发布求助
文献互助 智能选刊 最新文献

2015 7th Conference on Information and Knowledge Technology (IKT)最新文献

筛选
英文 中文
Targeted watermark removal of a SVD-based image watermarking scheme 一种基于奇异值分解的图像水印方案
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288669
Pegah Nikbakht, M. Mahdavi
{"title":"Targeted watermark removal of a SVD-based image watermarking scheme","authors":"Pegah Nikbakht, M. Mahdavi","doi":"10.1109/IKT.2015.7288669","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288669","url":null,"abstract":"Digital watermarking is widely used to verify the authenticity or integrity of multimedia contents, such as images and videos. In the last few years, a well-known numerical tool called singular value decomposition (SVD) has received much attention from the watermarking community. Designers of SVD-based schemes usually use dewatermarking tools such as Stirmark to prove the robustness of their schemes. Although, these tools are valuable but their attacks usually reduce the quality of watermarked images. On the other hand, there is another group of attacks in which the attacker needs to know the watermarking algorithm to perform the attack. In this paper, an attack in this group has been designed to remove the watermark from a specific SVD-based watermarking scheme [1]. The attack tries to change the exact space where watermark has been embedded. The experiments show our attack makes fewer changes to remove embedded watermark than other distortions available in Stirmark, so the quality of attacked image is better than processed image by using Stirmark in terms of PSNR.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134284025","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Improvement of minimum disclosure approach to authentication and privacy in RFID systems RFID系统中认证和隐私最小披露方法的改进
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288766
Mohammad Hadi Fathi Kordlar, Y. Azimi
{"title":"Improvement of minimum disclosure approach to authentication and privacy in RFID systems","authors":"Mohammad Hadi Fathi Kordlar, Y. Azimi","doi":"10.1109/IKT.2015.7288766","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288766","url":null,"abstract":"RFID facilitates automatic identification, tracking, and handling of objects, human beings, and animals through the use of radio-frequency based communications. The performance of RFID depends on tag, reader, and server equipment that make use of radio waves in order to establish communications between each other. The economic transfers are among the primary objectives of RFID, though these days, other sectors within the industry benefit from it. Nonetheless, the major concern in RFID systems relates to their security and privacy. Up to now, several protocols have been introduced on tag and reader identification but the majority of them suffer from shortcomings. In 2012, Doss et al. proposed a lightweight protocol based on minimum disclosure that guaranteed the safety of communications between tag-reader and reader-server channels. In the current study, it has been shown that this protocol is prone to replay attack. In other words, attackers can authenticate themselves to the server as a legal reader or a legal tag. Therefore, an improvement has been proposed in the current article to make the protocol more resistant against attacks.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134470842","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Extraction of brain regions affected by Alzheimer disease via fusion of brain multispectral MR images 脑多光谱磁共振图像融合提取阿尔茨海默病影响的脑区
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288773
Tannaz Akbarpour, M. Shamsi, S. Daneshvar
{"title":"Extraction of brain regions affected by Alzheimer disease via fusion of brain multispectral MR images","authors":"Tannaz Akbarpour, M. Shamsi, S. Daneshvar","doi":"10.1109/IKT.2015.7288773","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288773","url":null,"abstract":"This paper proposes a new method for extraction of regions affected by Alzheimer's disease from multispectral medical images. In this method, first two modals of magnetic resonance images are fused to achieve an image with high information content. Statistical features of fused image are extracted and then are grouped into three clusters with the help of an unsupervised algorithm to perform initial segmentation. Labeling members of clusters and rearranging image yields final image. Results of quantitative analysis prove combination of fusion and segmentation to result in an image with higher values of quantitative metrics and better visual outcome.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131662193","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
High-performance multi/many-core network processing architectures with shared and private queues 具有共享和私有队列的高性能多核/多核网络处理体系结构
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288757
Reza Falamarzi, Bahram Bahrambeigy, M. Ahmadi, Amir Rajabzade
{"title":"High-performance multi/many-core network processing architectures with shared and private queues","authors":"Reza Falamarzi, Bahram Bahrambeigy, M. Ahmadi, Amir Rajabzade","doi":"10.1109/IKT.2015.7288757","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288757","url":null,"abstract":"Nowadays, the efficient and probabilistic data-structure named Bloom filter is widely used in network processing applications. Moreover, the parallel nature of Bloom filter has made it suitable for multi/many-core architectures. In this paper, two schemes called multi-core architecture with shared queue and multi-core architecture with private queue (both employing Bloom filter cores) are proposed and implemented on FPGA. The inherent parallelism in querying of packets and different number of cores (such as 1, 2, 4, 8 and 16 cores) are considered. Experimental results show that the multi-core architecture with private queue achieves higher throughput than the latter one. Furthermore, Bloom filter is also implemented on GPU (as many-core architecture) and the results are compared to the CPU only version. When the number of packets in GPU memory is 16384, the speedup achieved by GPU implementations using CUDA is about 274 times compared to CPU implementation. However FPGA results outperform GPU, so that the throughput of first architecture (shared queue) and second architecture (private queue) with 16 cores are respectively almost 5.5 and 7.1 times higher than GPU throughput.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134320363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Metamorphic malware categorization using co-evolutionary algorithm 使用协同进化算法的变形恶意软件分类
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288668
Zahra Bazrafshan, A. Hamzeh
{"title":"Metamorphic malware categorization using co-evolutionary algorithm","authors":"Zahra Bazrafshan, A. Hamzeh","doi":"10.1109/IKT.2015.7288668","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288668","url":null,"abstract":"Malware is a malicious code which intends to harm computers and networks. As malware attacks become pervasive, the security policy of computers is more critical and it is so important to have a well-defined process to detect malware. However to avoid detection of the malware, various concealment strategies are invented regularly. Metamorphism is a strategy in which malware change their codes on each infection, meanwhile keeping the functionality unchanged. We focus on these types of malware due to their complex behaviors. In this work we concentrate on Visual Basic Script (VBS) malware and propose a detection mechanism for metamorphic malware. Regarding the great ability of evolutionary algorithms, here, we employ a Co-evolutionary-based architecture to tackle the graph isomorphism problem to be able to detection metamorphic malware based on their semantic graph. The experimental results confirm the efficiency of the proposed method regarding other state of the art ones in the literature.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133444846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Bloom filter-based IP Traceback on Netfilter open-source framework 基于Bloom过滤器的IP回溯的Netfilter开源框架
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288672
Tabassom Shahsafi, Bahram Bahrambeigy, M. Ahmadi
{"title":"Bloom filter-based IP Traceback on Netfilter open-source framework","authors":"Tabassom Shahsafi, Bahram Bahrambeigy, M. Ahmadi","doi":"10.1109/IKT.2015.7288672","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288672","url":null,"abstract":"Routing only based on destination IP address is one of the major potential threats of current Internet routers that enables attackers to attack victims from forged sources. IP packet Traceback is one of the important defense mechanisms against Denial of Service (DoS) attacks because it traces packets from source to destination. In this paper, an IP Traceback method based on efficient Bloom filter data-structure and Netfilter open-source framework is proposed in which outperforms previous methods in terms of speed, memory usage, memory and processing overhead.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"229 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117183651","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
A modified Gravitational Search Algorithm and its application 一种改进的引力搜索算法及其应用
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288803
Donya Yazdani, M. Meybodi
{"title":"A modified Gravitational Search Algorithm and its application","authors":"Donya Yazdani, M. Meybodi","doi":"10.1109/IKT.2015.7288803","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288803","url":null,"abstract":"Gravitational Search Algorithm (GSA) is a population-based optimization algorithm based on Newton's law of gravitation and the rules of mass interactions. Despite good exploration, GSA suffers from improper exploitation ability. This is mainly due to relatively big movements of agents, even the qualified ones, in the entire search process. In this paper, in order to improve the balance between exploration and exploitation of GSA, the quality of a current solution is considered in the processes of computing its velocity and acceleration. The experiments are conducted on standard unimodal and multimodal benchmark functions and their shifted and rotated versions. The obtained results are compared with those of five well-known algorithms in this field. In addition, the proposed algorithm is applied to clustering of wireless sensor network to find near-optimum cluster heads in a way that energy consumption would be the minimum. The obtained results show the high performance of the proposed algorithm in both fields.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116854105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Pervasive privacy: A practical context-aware system to preserve privacy on android smartphones 无处不在的隐私:一个实用的上下文感知系统，以保护android智能手机的隐私
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288781
Hossein Ghasemi, A. Haghighat, M. Razazi, Saeed Sharifian
{"title":"Pervasive privacy: A practical context-aware system to preserve privacy on android smartphones","authors":"Hossein Ghasemi, A. Haghighat, M. Razazi, Saeed Sharifian","doi":"10.1109/IKT.2015.7288781","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288781","url":null,"abstract":"Advent of instant messaging systems has increased the concerns about privacy violation. Although, smartphones contain a lot of personal information, their operating systems have not provided a complete compliance with privacy preserving principles. As a result, providing a smart guard for private information on smartphones is required. The proposed system should be able to detect which information could be shared with other users and warn in the case of unintended sensitive information leakages, as well. In this paper, we propose a context-aware real-time system to preserve privacy on android smartphones with mentioned properties using information flow tracking techniques. The proposed system detects privacy violation in Android phones based on users relations in a social network created by the system itself.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121776121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Proposing an evolutionary method based on maximization precision of group recommender systems 提出了一种基于群推荐系统精度最大化的进化方法
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288671
Shakib Loveymi, A. Hamzeh
{"title":"Proposing an evolutionary method based on maximization precision of group recommender systems","authors":"Shakib Loveymi, A. Hamzeh","doi":"10.1109/IKT.2015.7288671","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288671","url":null,"abstract":"In this paper we proposed an evolutionary algorithm to maximize precision of group recommender systems and reducing the online calculations. In this method we try to build a transition matrix that's made by an evolutionary algorithm and then we multiply this transition matrix with user-item rate matrix. By this action we go to a reduced dimension space. The characteristic of this space is that the users that are really more similar, would be closer to each other. Also because the dimension of the user-item matrix has been reduced, the online calculations are hugely reduced and if we have a new user, we can easily multiply his rates on the transition matrix and find out that he has to be in which group. We used the average real rate of group users to an item as a metric to evaluate how much this item is suitable for this specific group. At end we compare this method with other methods that also reduce the dimension on the various datasets. Then we show that our method works better. Finally we have a discussion about weakness and strength of our method.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"138 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114315989","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A multi-start path-relinking algorithm for the flexible job-shop scheduling problem 柔性作业车间调度问题的多起点路径链接算法
2015 7th Conference on Information and Knowledge Technology (IKT) Pub Date : 2015-05-26 DOI: 10.1109/IKT.2015.7288747
Sahar Bakhtar, H. Jazayeriy, M. Valinataj
{"title":"A multi-start path-relinking algorithm for the flexible job-shop scheduling problem","authors":"Sahar Bakhtar, H. Jazayeriy, M. Valinataj","doi":"10.1109/IKT.2015.7288747","DOIUrl":"https://doi.org/10.1109/IKT.2015.7288747","url":null,"abstract":"Scheduling is a well-known NP-hard problem. The flexible job-shop scheduling problem (FJSP) is an extention of the classical job-shop scheduling problem(JSP). FJSP allows an operation of each job to be performed by any machine out of a set of available machines. FJSP consists two sub-problems which are assigning each operation to a machine out of a set of capable machines and sequencing the assigned operations on the machines. This paper proposes a path-relinking(PR) algorithm that solves the FJSP to minimize makespan. Also, a GRASP method has been used for creating the initial solutions. The proposed algorithm is evaluated by testing on a set of 15 benchmark problems. The computational results show that the proposed algorithm is an effective approach to solve the FJSP.","PeriodicalId":338953,"journal":{"name":"2015 7th Conference on Information and Knowledge Technology (IKT)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121061406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信