Cloud computing technology is enabling IT to do more with the infrastructure that already exists, as well as adding new ways to expand capacity quickly and economically by using external cloud computing resources. This technology is enabling IT managers to treat infrastructure as a common substrate on which they can provide services to users faster, in a much more flexible way and in cost-effective way –without having to re-design or add to the underlying infrastructure. Given the benefits of cloud computing, its broad appeal is not surprising. However, this new approach does raise some concerns. Chief among them is securing stored data in the cloud. In this paper, we focus on cloud data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users’ data in the cloud, we propose a method by utilizing the homomorphic token with distributed verification of erasure-coded data. Our scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server(s).
{"title":"Ensuring Data Storage Security in Cloud Computing through Two-Way Handshake Based on Token Management","authors":"M. Tribhuwan, V. Bhuyar, Shabana Pirzade","doi":"10.1109/ARTCOM.2010.23","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.23","url":null,"abstract":"Cloud computing technology is enabling IT to do more with the infrastructure that already exists, as well as adding new ways to expand capacity quickly and economically by using external cloud computing resources. This technology is enabling IT managers to treat infrastructure as a common substrate on which they can provide services to users faster, in a much more flexible way and in cost-effective way –without having to re-design or add to the underlying infrastructure. Given the benefits of cloud computing, its broad appeal is not surprising. However, this new approach does raise some concerns. Chief among them is securing stored data in the cloud. In this paper, we focus on cloud data storage security, which has always been an important aspect of quality of service. To ensure the correctness of users’ data in the cloud, we propose a method by utilizing the homomorphic token with distributed verification of erasure-coded data. Our scheme achieves the integration of storage correctness insurance and data error localization, i.e., the identification of misbehaving server(s).","PeriodicalId":210885,"journal":{"name":"Advances in Recent Technologies in Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125139681","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}
Despite much research activity over the last several decades on wireless communications in general, and ad hoc wireless networks in particular, there remain many significant technical challenges in the design of these networks. As it is not possible to give a significant amount of power to the mobile devices of ad-hoc networks so that it could work for long time, so mobile devices with rechargeable batteries must conserve energy to maximize time between recharging. This article surveys and classifies the energy aware routing protocols proposed for MANETs as well as various matrices responsible for energy (power) optimization by going through different layers of a internet protocol to provide a comprehensive understanding of these routing protocols and better organize existing ideas and work to facilitate energy efficient routing design for MANETs, we present the taxonomy of the energy efficient routing protocols, their properties and design features. This paper aims to aid those MANETs researchers and application developers in selecting appropriate energy efficient routing protocols for their work.
{"title":"A Short Survey of Energy-Efficient Routing Protocols for Mobile Ad-Hoc Networks","authors":"D. Anand, Shiva Prakash","doi":"10.1109/ARTCOM.2010.103","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.103","url":null,"abstract":"Despite much research activity over the last several decades on wireless communications in general, and ad hoc wireless networks in particular, there remain many significant technical challenges in the design of these networks. As it is not possible to give a significant amount of power to the mobile devices of ad-hoc networks so that it could work for long time, so mobile devices with rechargeable batteries must conserve energy to maximize time between recharging. This article surveys and classifies the energy aware routing protocols proposed for MANETs as well as various matrices responsible for energy (power) optimization by going through different layers of a internet protocol to provide a comprehensive understanding of these routing protocols and better organize existing ideas and work to facilitate energy efficient routing design for MANETs, we present the taxonomy of the energy efficient routing protocols, their properties and design features. This paper aims to aid those MANETs researchers and application developers in selecting appropriate energy efficient routing protocols for their work.","PeriodicalId":210885,"journal":{"name":"Advances in Recent Technologies in Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124282768","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}
Any FPGA structure has interconnect cells, configurable logic blocks and I/O pads. The physical path between the blocks form interconnects. The logic blocks may have both combinational and sequential circuits to perform logic functions. Here the logic blocks are assumed to have either combinational or sequential circuits which generate a single minterm or maxterm as the output. The FPGA testing is divided into interconnect and logical testing. In interconnect testing fault models are introduced in the wire connections that exists within logic blocks and these faults are propagated to the output thereby detecting the faults at interconnects. In general 2n test vectors are needed to test the single term logic function with n inputs. Here Walsh code is used to optimize the test vectors. The number of test vectors are optimized as log2(M+2), where M is number of wire connections. The test vectors are the columns of M binary numbers and the successive binary numbers are exchanged to obtain the test vectors
{"title":"Testing of Logic Blocks Using Built-In Self Test Scheme for FPGAs","authors":"Putnanjan Sumathi","doi":"10.1109/ARTCOM.2010.101","DOIUrl":"https://doi.org/10.1109/ARTCOM.2010.101","url":null,"abstract":"Any FPGA structure has interconnect cells, configurable logic blocks and I/O pads. The physical path between the blocks form interconnects. The logic blocks may have both combinational and sequential circuits to perform logic functions. Here the logic blocks are assumed to have either combinational or sequential circuits which generate a single minterm or maxterm as the output. The FPGA testing is divided into interconnect and logical testing. In interconnect testing fault models are introduced in the wire connections that exists within logic blocks and these faults are propagated to the output thereby detecting the faults at interconnects. In general 2n test vectors are needed to test the single term logic function with n inputs. Here Walsh code is used to optimize the test vectors. The number of test vectors are optimized as log2(M+2), where M is number of wire connections. The test vectors are the columns of M binary numbers and the successive binary numbers are exchanged to obtain the test vectors","PeriodicalId":210885,"journal":{"name":"Advances in Recent Technologies in Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2010-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131212557","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}
V. Dhanalakshmi, M. A. Kumar, R. Rekha, C. Kumar, K. Soman, S. Rajendran
This paper is based on morphological analyzer using machine learning approach for complex agglutinative natural languages. Morphological analysis is concerned with retrieving the structure, the syntactic and morphological properties or the meaning of a morphologically complex word. The morphology structure of agglutinative language is unique and capturing its complexity in a machine analyzable and generatable format is a challenging job. Generally rule based approaches are used for building morphological analyzer system. In rule based approaches what works in the forward direction may not work in the backward direction. This new and state of the art machine learning approach based on sequence labeling and training by kernel methods captures the non-linear relationships in the different aspect of morphological features of natural languages in a better and simpler way. The overall accuracy obtained for the morphologically rich agglutinative language (Tamil) was really encouraging.
{"title":"Morphological Analyzer for Agglutinative Languages Using Machine Learning Approaches","authors":"V. Dhanalakshmi, M. A. Kumar, R. Rekha, C. Kumar, K. Soman, S. Rajendran","doi":"10.1109/ARTCom.2009.184","DOIUrl":"https://doi.org/10.1109/ARTCom.2009.184","url":null,"abstract":"This paper is based on morphological analyzer using machine learning approach for complex agglutinative natural languages. Morphological analysis is concerned with retrieving the structure, the syntactic and morphological properties or the meaning of a morphologically complex word. The morphology structure of agglutinative language is unique and capturing its complexity in a machine analyzable and generatable format is a challenging job. Generally rule based approaches are used for building morphological analyzer system. In rule based approaches what works in the forward direction may not work in the backward direction. This new and state of the art machine learning approach based on sequence labeling and training by kernel methods captures the non-linear relationships in the different aspect of morphological features of natural languages in a better and simpler way. The overall accuracy obtained for the morphologically rich agglutinative language (Tamil) was really encouraging.","PeriodicalId":210885,"journal":{"name":"Advances in Recent Technologies in Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123802725","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}
R. Marimuthu, K. Thanushkodi, K. Dayalan, P. Dharani
Cubing plays a vital role in secure communication systems, Signal Processing Applications, Finite Field Arithmetic etc. As the radix of the number used for cubing increases the process gets complicated which in turn increases the delay and power consumption. Vedic mathematics is an ancient mathematics concept that provides a fast and a reliable approach to perform arithmetic operations using sixteen Sutras or word- formulae. In this paper the Anurupya Vedic sutra is used for cubing operations with two different multiplier architectures - One array structured and one tree structure. The performance of these multipliers for cubing applications is compared on the basis of their delay, power consumption and area utilization and it is proved that Anurupya Sutra improves the performance tremendously
{"title":"A Novel Time and Energy Efficient Cubing Circuit Using Vedic Mathematics for Finite Field Arithmetic","authors":"R. Marimuthu, K. Thanushkodi, K. Dayalan, P. Dharani","doi":"10.1109/ARTCOM.2009.227","DOIUrl":"https://doi.org/10.1109/ARTCOM.2009.227","url":null,"abstract":"Cubing plays a vital role in secure communication systems, Signal Processing Applications, Finite Field Arithmetic etc. As the radix of the number used for cubing increases the process gets complicated which in turn increases the delay and power consumption. Vedic mathematics is an ancient mathematics concept that provides a fast and a reliable approach to perform arithmetic operations using sixteen Sutras or word- formulae. In this paper the Anurupya Vedic sutra is used for cubing operations with two different multiplier architectures - One array structured and one tree structure. The performance of these multipliers for cubing applications is compared on the basis of their delay, power consumption and area utilization and it is proved that Anurupya Sutra improves the performance tremendously","PeriodicalId":210885,"journal":{"name":"Advances in Recent Technologies in Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122090750","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}
This paper introduces a new hybrid fusion method which is comprised of fast intensity–hue-saturation (FIHS) and over complete discrete wavelet transform with rational dilation factors. Apart from speed, this hybrid fusion method can help to overcome the problems inherent in IHS and wavelet based methods. This method can also be used to extract the spatial information from the difference image of the panchromatic (PAN) and intensity images.
{"title":"Image Fusion Based on Overcomplete Rational Wavelet Transform with an Improved IHS Method","authors":"M. K., Soman K","doi":"10.1109/ARTCom.2009.199","DOIUrl":"https://doi.org/10.1109/ARTCom.2009.199","url":null,"abstract":"This paper introduces a new hybrid fusion method which is comprised of fast intensity–hue-saturation (FIHS) and over complete discrete wavelet transform with rational dilation factors. Apart from speed, this hybrid fusion method can help to overcome the problems inherent in IHS and wavelet based methods. This method can also be used to extract the spatial information from the difference image of the panchromatic (PAN) and intensity images.","PeriodicalId":210885,"journal":{"name":"Advances in Recent Technologies in Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122816845","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}
Multi-core processors represent a major evolution in computing hardware technology. Multi-core provides a network security application with more processing power from the hardware perspective. However, there are still significant software design challenges that must be overcome. In this paper, we present new architecture for multi-core supported Intrusion Detection System, which aims at providing network security processing without causing performance penalty to normal network operations. While hardware-based parallelisms have shown their advantage on throughput performance, parallelisms based multi-core provides more flexible, high performance, comprehensive, intelligent, and scalable solutions to network security applications. The Intrusion Detection System that we presented in this paper also protect the multi core systems from Real Time attacks and Packet Filtrations with high performance without any penalty.
{"title":"Implementing Intrusion Detection System for Multicore Processor","authors":"G. Rajeswari, B. Nithya","doi":"10.1109/ARTCom.2009.44","DOIUrl":"https://doi.org/10.1109/ARTCom.2009.44","url":null,"abstract":"Multi-core processors represent a major evolution in computing hardware technology. Multi-core provides a network security application with more processing power from the hardware perspective. However, there are still significant software design challenges that must be overcome. In this paper, we present new architecture for multi-core supported Intrusion Detection System, which aims at providing network security processing without causing performance penalty to normal network operations. While hardware-based parallelisms have shown their advantage on throughput performance, parallelisms based multi-core provides more flexible, high performance, comprehensive, intelligent, and scalable solutions to network security applications. The Intrusion Detection System that we presented in this paper also protect the multi core systems from Real Time attacks and Packet Filtrations with high performance without any penalty.","PeriodicalId":210885,"journal":{"name":"Advances in Recent Technologies in Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122259290","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}
The proposed system identifies the species of the wood using the textural features present in its barks. Each species of a wood has its own unique patterns in its bark, which enabled the proposed system to identify it accurately. Automatic wood recognition system has not yet been well established mainly due to lack of research in this area and the difficulty in obtaining the wood database. In our work, a wood recognition system has been designed based on pre-processing techniques, feature extraction and by correlating the features of those wood species for their classification. Texture classification is a problem that has been studied and tested using different methods due to its valuable usage in various pattern recognition problems, such as wood recognition, rock classification. The most popular technique used for the textural classification is Gray-level Co-occurrence Matrices (GLCM). The features from the enhanced images are thus extracted using the GLCM is correlated, which determines the classification between the various wood species. The result thus obtained shows a high rate of recognition accuracy proving that the techniques used in suitable to be implemented for commercial purposes.
{"title":"Wood Species Recognition Using GLCM and Correlation","authors":"R. Bremananth, B. Nithya, R. Saipriya","doi":"10.1109/ARTCom.2009.10","DOIUrl":"https://doi.org/10.1109/ARTCom.2009.10","url":null,"abstract":"The proposed system identifies the species of the wood using the textural features present in its barks. Each species of a wood has its own unique patterns in its bark, which enabled the proposed system to identify it accurately. Automatic wood recognition system has not yet been well established mainly due to lack of research in this area and the difficulty in obtaining the wood database. In our work, a wood recognition system has been designed based on pre-processing techniques, feature extraction and by correlating the features of those wood species for their classification. Texture classification is a problem that has been studied and tested using different methods due to its valuable usage in various pattern recognition problems, such as wood recognition, rock classification. The most popular technique used for the textural classification is Gray-level Co-occurrence Matrices (GLCM). The features from the enhanced images are thus extracted using the GLCM is correlated, which determines the classification between the various wood species. The result thus obtained shows a high rate of recognition accuracy proving that the techniques used in suitable to be implemented for commercial purposes.","PeriodicalId":210885,"journal":{"name":"Advances in Recent Technologies in Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117088572","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}
In this paper the human object present in images are identified. K-means clustering algorithm is used for segmenting the images and Connected Component Analysis is used as post-processing step. Initially, templates are created from human posture in idle and various angles. The adjacency matrix is constructed from objects and it is matched with templates. A similarity measure has been proposed for estimating the matching.
{"title":"Adjacency Matrix Based Objects Representation for Human Identification in Images","authors":"S. Saravanakumar, A. Vadivel","doi":"10.1109/ARTCom.2009.70","DOIUrl":"https://doi.org/10.1109/ARTCom.2009.70","url":null,"abstract":"In this paper the human object present in images are identified. K-means clustering algorithm is used for segmenting the images and Connected Component Analysis is used as post-processing step. Initially, templates are created from human posture in idle and various angles. The adjacency matrix is constructed from objects and it is matched with templates. A similarity measure has been proposed for estimating the matching.","PeriodicalId":210885,"journal":{"name":"Advances in Recent Technologies in Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122770916","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}
In this paper sequence of execution of algorithms are explained visually in an interactive manner. It helps to realize the fundamental concept of algorithms such as searching and sorting method in a simple manner. Visualization gains more attention than theoretical study and it is an easy way of learning process. We propose methods for finding runtime of each algorithm and aims to overcome the drawbacks of the existing character systems. System illustrates each and every step clearly using text and animation. Comparisons of its time complexity have been carried out and results show that our approach provides better perceptive of algorithms.
{"title":"Visualizing Sequence of Algorithms for Searching and Sorting","authors":"R. Bremananth, V. Radhika, S. Thenmozhi","doi":"10.1109/ARTCom.2009.20","DOIUrl":"https://doi.org/10.1109/ARTCom.2009.20","url":null,"abstract":"In this paper sequence of execution of algorithms are explained visually in an interactive manner. It helps to realize the fundamental concept of algorithms such as searching and sorting method in a simple manner. Visualization gains more attention than theoretical study and it is an easy way of learning process. We propose methods for finding runtime of each algorithm and aims to overcome the drawbacks of the existing character systems. System illustrates each and every step clearly using text and animation. Comparisons of its time complexity have been carried out and results show that our approach provides better perceptive of algorithms.","PeriodicalId":210885,"journal":{"name":"Advances in Recent Technologies in Communication and Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2009-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121411029","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：