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

2012 International Conference on Recent Trends in Information Technology最新文献

筛选
英文 中文
Design of an Early Response System using EGT-based overlay network 基于egt覆盖网络的早期响应系统设计
2012 International Conference on Recent Trends in Information Technology Pub Date : 2012-04-19 DOI: 10.1109/ICRTIT.2012.6206760
V. Akilandeswari, D. Namachivayam, S. Prasanna, S. Shalinie
{"title":"Design of an Early Response System using EGT-based overlay network","authors":"V. Akilandeswari, D. Namachivayam, S. Prasanna, S. Shalinie","doi":"10.1109/ICRTIT.2012.6206760","DOIUrl":"https://doi.org/10.1109/ICRTIT.2012.6206760","url":null,"abstract":"The main objective of this paper is to design Evolutionary Game Theory (EGT) based overlay network structure with the combination of network reciprocity and group selection mechanisms to achieve evolutionary cooperation among individual nodes. Each node in the proposed network structure has ability to detect the DDoS attacks using Non-parametric sliding window based change point detection algorithm. It analyzes every incoming traffic behavior changes and generates the attack patterns based on the traffic profile. The proposed network structure is considered as a tree like structure in the experimental analysis, which monitors the network traffic and provides faster detection during the distributed flooding attack. As a result, our network detects the DDoS attacks at the intermediate stage itself with the sharing nature of attack patterns, without any interruption to legitimate users. Moreover, it provides excellent detection accuracy (98%) and high degree of efficiency during high probability of network traffic.","PeriodicalId":191151,"journal":{"name":"2012 International Conference on Recent Trends in Information Technology","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127449793","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 novel and fast exemplar based approach for filling missing portions in an image 一种新颖、快速的基于范例的图像缺失部分填充方法
2012 International Conference on Recent Trends in Information Technology Pub Date : 2012-04-19 DOI: 10.1109/ICRTIT.2012.6206805
S. Bhuvaneshwari, T. Subashini, S. Soundharya, V. Ramalingam
{"title":"A novel and fast exemplar based approach for filling missing portions in an image","authors":"S. Bhuvaneshwari, T. Subashini, S. Soundharya, V. Ramalingam","doi":"10.1109/ICRTIT.2012.6206805","DOIUrl":"https://doi.org/10.1109/ICRTIT.2012.6206805","url":null,"abstract":"This paper discusses a novel and fast exemplar based approach for filling missing portions in an image. Images are used everywhere and a single image can express more than a thousand words. Inpainting is the art of modifying an image in a form that is not detectable by an ordinary observer. There are numerous and very different approaches to tackle the inpainting problem. This work is based on the exemplar based approach. The basic idea behind this approach is to find a similar patch with a higher priority from the original image and replace the lost data with it. This technique can be used in restoring old photographs or damaged film. It can also be used in removing superimposed text like dates, subtitles etc., or even entire objects from the image.","PeriodicalId":191151,"journal":{"name":"2012 International Conference on Recent Trends in Information Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132188672","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
Secured secret color image sharing with steganography 安全的秘密彩色图像共享与隐写术
2012 International Conference on Recent Trends in Information Technology Pub Date : 2012-04-19 DOI: 10.1109/ICRTIT.2012.6206748
L. Anbarasi, S. Kannan
{"title":"Secured secret color image sharing with steganography","authors":"L. Anbarasi, S. Kannan","doi":"10.1109/ICRTIT.2012.6206748","DOIUrl":"https://doi.org/10.1109/ICRTIT.2012.6206748","url":null,"abstract":"Secret sharing refers to a method of distributing a secret among a group of participants, each of whom is allocated with a share of the secret. The participant's shares are used to reconstruct the secret. Single individual participants share is of no use. The reversible image sharing approach and threshold schemes are used achieve the novel secret color image sharing. The secret color image pixels will be transformed to m-ary notational system. The reversible polynomial function will be generated using (t-1) digits of secret color image pixels. Secret shares are generated with the help of reversible polynomial function and the participant's numerical key. The secret image and the cover image is embedded together to construct a stego image. The reversible image sharing process is used to reconstruct the secret image and cover image. The secret is obtained by the lagrange's formula generated from the sufficient secret shares. Quantization process is applied to improve the quality of the cover image. Peak signal to noise ratio is applied to analyze the quality of the stego images. The simulation results show that the secret and cover are reconstructed without loss.","PeriodicalId":191151,"journal":{"name":"2012 International Conference on Recent Trends in Information Technology","volume":"398 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117353655","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}
引用次数: 29
Texture classification using reduced set of nonsubsampled contourlet transform features 非下采样contourlet变换特征的约简集纹理分类
2012 International Conference on Recent Trends in Information Technology Pub Date : 2012-04-19 DOI: 10.1109/ICRTIT.2012.6206828
M. Vijilious, V. S. Bharathi
{"title":"Texture classification using reduced set of nonsubsampled contourlet transform features","authors":"M. Vijilious, V. S. Bharathi","doi":"10.1109/ICRTIT.2012.6206828","DOIUrl":"https://doi.org/10.1109/ICRTIT.2012.6206828","url":null,"abstract":"Texture based classification is an important approach for effective classification of images. In this work, a non-subsampled contourlet transform is employed to extract the directional frequency information followed by the statistical moment extraction where, zernike moments are used as texture descriptors. The main advantage of this approach is that it helps in reducing the dimensionality contourlet coefficients. from the experiments conducted in this work, it has been observed that combining non-subsampled contourlet transform and zernike moments produces good image representative capability. Moreover, nearest neighbour classifier is used in this work as classifier. For the experimental stud, brodatz database of textures is used. From the experimental results, it has been observed that non-subsampled contourlet transform combined with zernike moments achieve greater performance than the other well-known models.","PeriodicalId":191151,"journal":{"name":"2012 International Conference on Recent Trends in Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115166054","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}
引用次数: 3
Efficient access of Cloud Resources through virtualization techniques 通过虚拟化技术高效访问云资源
2012 International Conference on Recent Trends in Information Technology Pub Date : 2012-04-19 DOI: 10.1109/ICRTIT.2012.6206761
S. U. Muthunagai, C. Karthic, S. Sujatha
{"title":"Efficient access of Cloud Resources through virtualization techniques","authors":"S. U. Muthunagai, C. Karthic, S. Sujatha","doi":"10.1109/ICRTIT.2012.6206761","DOIUrl":"https://doi.org/10.1109/ICRTIT.2012.6206761","url":null,"abstract":"Cloud computing depends on Virtualization for service implementation and distribute resources to the end users over the web as web services. The major issue of Virtualization is a security which has been examined as an unproven commodity when user stipulates for cloud resources. The existing cloud protection systems provide improved security with the guest virtual machine, but retards in performance while accessing the resources through Virtualization. This paper proposes a novel architecture Efficient Cloud Protection System (ECPS) which detects the guest-to-guest attack in the Virtualization environment and provides efficient access of cloud resources to the users by providing easy access to the commonly used resources that saves the time spent in accessing frequently used resources. This architecture will integrate the functions of cloud security components like interceptor, warning recorder, etc., to reduce the computation thereby enhancing the security of the cloud protection system.","PeriodicalId":191151,"journal":{"name":"2012 International Conference on Recent Trends in Information Technology","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114429251","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}
引用次数: 16
IP traceback system for network and application layer attacks IP溯源系统用于网络和应用层攻击
2012 International Conference on Recent Trends in Information Technology Pub Date : 2012-04-19 DOI: 10.1109/ICRTIT.2012.6206778
M. Vijayalakshmi, S. Mercy Shalinie, A. Arun Pragash
{"title":"IP traceback system for network and application layer attacks","authors":"M. Vijayalakshmi, S. Mercy Shalinie, A. Arun Pragash","doi":"10.1109/ICRTIT.2012.6206778","DOIUrl":"https://doi.org/10.1109/ICRTIT.2012.6206778","url":null,"abstract":"Distributed Denial of Service attacks pose an ever great challenge to the Internet with an increasing resources and techniques available to the attackers. From SYN flooding to spoofing it has finally arrived at application layer attacks with legitimate IP addresses. Our traceback system detects the network layer attacks carried out with spoofed IP addresses, application layer attacks carried with legitimate IP addresses and traceback the real source of the attack. In contrast to the earlier works, the proposed system detects the attack, traceback the attack source and also enhances the availability of the server by proactive traffic shaping and reactive filtering mechanism. The work is deployed in the NTRO sponsored Smart and Secure Environment Test Bed and programmable routers in real time and the efficacy of the system is evaluated. Our system not only detects and traceback the attacker but also reduces the magnitude of the attack traffic and improves the probability of survival of legitimate flow.","PeriodicalId":191151,"journal":{"name":"2012 International Conference on Recent Trends in Information Technology","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126783550","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}
引用次数: 24
An efficient semantic secure keyword based search scheme in cloud storage services 云存储服务中基于关键字的高效语义安全搜索方案
2012 International Conference on Recent Trends in Information Technology Pub Date : 2012-04-19 DOI: 10.1109/ICRTIT.2012.6206776
R. ChinnaSamy, S. Sujatha
{"title":"An efficient semantic secure keyword based search scheme in cloud storage services","authors":"R. ChinnaSamy, S. Sujatha","doi":"10.1109/ICRTIT.2012.6206776","DOIUrl":"https://doi.org/10.1109/ICRTIT.2012.6206776","url":null,"abstract":"Cloud data storage (Storage as a Service) is an important service of cloud computing it can also be referred as Infrastructure as a Service (IaaS). The data storage security problem is an important aspect of Quality of Service (QoS). In the existing cloud storage, the user stores his information in the encrypted format, preserving privacy. When a user wants to retrieve files through keyword search, the cloud storage server returns all matched data, which forces the user to decrypt all returned data. Decrypting all the returned data will result in depletion of CPU time and results in increased memory utilization. This paper proposes an efficient semantic secure keyword based search (ESSKS) scheme, which retrieves exact information needed by the user, ensuring that the same keyword does not always produce the same result, in user querying, reducing computational and communication overhead. This security mechanism also addresses the data integrity problem.","PeriodicalId":191151,"journal":{"name":"2012 International Conference on Recent Trends in Information Technology","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126978813","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}
引用次数: 5
Performance of precoding techniques in LTE LTE中预编码技术的性能
2012 International Conference on Recent Trends in Information Technology Pub Date : 2012-04-19 DOI: 10.1109/ICRTIT.2012.6206803
M. Chandrasekaran, S. Subramanian
{"title":"Performance of precoding techniques in LTE","authors":"M. Chandrasekaran, S. Subramanian","doi":"10.1109/ICRTIT.2012.6206803","DOIUrl":"https://doi.org/10.1109/ICRTIT.2012.6206803","url":null,"abstract":"Codebook based precoding is a limited feedback structure and promising technology adopted by Long Term Evolution (LTE) which is proposed by 3GPP (Third Generation Partnership Project). An important feature of LTE systems is the MIMO mode, which is used to achieve higher spectral efficiency. Precoding is used in certain MIMO modes to improve performance. This paper presents the precoding techniques namely per-subcarrier, sub-band and wide-band precoding, the precoding matrix selection based on the post processing SNR and presents some comparison of precoding SNR Gain for wide-band, sub-band and per subcarrier precoding with that of non precoding case (NPC).","PeriodicalId":191151,"journal":{"name":"2012 International Conference on Recent Trends in Information Technology","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123509002","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}
引用次数: 12
An efficient HOT-B protocol for caching in Mobile Adhoc Networks 一种用于移动自组网高速缓存的高效HOT-B协议
2012 International Conference on Recent Trends in Information Technology Pub Date : 2012-04-19 DOI: 10.1109/ICRTIT.2012.6206746
L. Sheeba, Yogesh P
{"title":"An efficient HOT-B protocol for caching in Mobile Adhoc Networks","authors":"L. Sheeba, Yogesh P","doi":"10.1109/ICRTIT.2012.6206746","DOIUrl":"https://doi.org/10.1109/ICRTIT.2012.6206746","url":null,"abstract":"Data Accessibility in mobile ad hoc network is an important issue of concern since the ultimate goal of using MANETs is to provide information access to mobile hosts. To improve data availability, with reduced access latency and reduced network traffic towards the Data Centre, cache sharing techniques are proposed. Caching in general improves network performance by caching frequently accessed items. However, caching comes along with many associated issues like data consistency and looping problems. In this paper we propose an efficient Heap Oriented Time Based (HOT-B) protocol to mitigate these issues. In this we propose four policies namely Data Discovery, Data Admission, Data Update and Data Replacement. These policies enhance data availability in an efficient manner even in resource constrained environments. When a new item is inserted or deleted from the cache all the data items within the cache is reordered in a prescribed manner, thereby reducing the traversal time within the cache.","PeriodicalId":191151,"journal":{"name":"2012 International Conference on Recent Trends in Information Technology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121995226","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 partitioning algorithm for large scale ontologies 大规模本体的分区算法
2012 International Conference on Recent Trends in Information Technology Pub Date : 2012-04-19 DOI: 10.1109/ICRTIT.2012.6206792
K. Saruladha, G. Aghila, B. Sathiya
{"title":"A partitioning algorithm for large scale ontologies","authors":"K. Saruladha, G. Aghila, B. Sathiya","doi":"10.1109/ICRTIT.2012.6206792","DOIUrl":"https://doi.org/10.1109/ICRTIT.2012.6206792","url":null,"abstract":"As the need and usage of semantic web grows, the number of semantic web data made up of ontology also increases. The ontology constructed for real world domains like medicine, life science and e-commerce are large in size ranging from 1000 to more than 20000 concepts. Various semantic operations like query answering, data sharing, data matching, data reuse and data integration become complicated as the size of ontology increases. Partitioning the ontology is the key solution to handle this scalability issue. This paper presents an efficient neighbour based bottom up partitioning algorithm (Refined AHSCAN) to tackle this scalability issue. The proposed partition algorithm divides the large unmanageable ontology into small manageable sub ontologies (partitions). The efficiency in the partition algorithm is achieved by reducing the computation needed for finding the neighbour similarity of the concepts and merging the partitions in bottom up hierarchy without compromising on the effectiveness (quality) of the result.","PeriodicalId":191151,"journal":{"name":"2012 International Conference on Recent Trends in Information Technology","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121568621","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}
引用次数: 7
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信