2011 3rd International Conference on Electronics Computer Technology最新文献

{"title":"Implementation of distributed ROCK algorithm for clustering of large categorical datasets and its performance analysis","authors":"A. Patidar, R. Joshi, Surendra Mishra","doi":"10.1109/ICECTECH.2011.5941659","DOIUrl":"https://doi.org/10.1109/ICECTECH.2011.5941659","url":null,"abstract":"Clustering in data mining, is useful to discover distribution patterns in the underlying data. ROCK is one such hierarchical clustering algorithm, which works on sampled data. We show that sequential ROCK algorithm is time consuming for large dataset. Instead, we present distributed algorithms with better performance than known algorithms. We develop a robust hierarchical clustering algorithm ROCK that employs preliminary calculations to be done at different processors. In addition to presenting detailed complexity results for DROCK we also conduct an experimental study with real life data sets to demonstrate the effectiveness of our technique.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115080958","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}

{"title":"Classical knapsack to geometric knapsack: A journey","authors":"P. Mahapatra","doi":"10.1109/ICECTECH.2011.5941660","DOIUrl":"https://doi.org/10.1109/ICECTECH.2011.5941660","url":null,"abstract":"Knapsack problems have been extensively studied in operations research for last few decades. We review the method of mapping classical knapsack problems into a new class of geometric knapsack problems. Then it is shown that a wide class of problems in geometric optimization and facility location can be represented as geometric knapsack problems.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"4 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116787195","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}

{"title":"A study on optimized power consumption routing in Wireless Sensor Networks","authors":"K. Arulmozhi, V. R. Sarma Dhulipala, R. Prabakaran","doi":"10.1109/ICECTECH.2011.5941752","DOIUrl":"https://doi.org/10.1109/ICECTECH.2011.5941752","url":null,"abstract":"Two extensively studied and analyzed factors related to Wireless Sensor Networks (WSNs) are optimization of power or energy consumption of node or network and efficient routing mechanism for data transfer between sensor nodes. These two aspects play a major role in the effectiveness and efficiency of the WSN being deployed. This paper, is a study of these aspects of WSN and the various mechanisms that have been proposed to provide an efficient network with reasonable functional time. In this paper, (i) we have studied the various factors that affect the energy consumption of the node and modeled it in a layered approach for better understanding (ii) we have created a framework for the Power Optimized Network Protocol","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116942258","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}

{"title":"Reconciliation of ICT in education for healthy future","authors":"S. Chowdhary, Ajit Yadav, Naveen Garg","doi":"10.1109/ICECTECH.2011.5941759","DOIUrl":"https://doi.org/10.1109/ICECTECH.2011.5941759","url":null,"abstract":"How to facilitate efficient infrastructure in rural areas and motivate student to learn? In the present system we are facing numerous issues in social, political and health sector. We have all the advance technology but lacking equally talented work force, the reason most of the facilities are available in cities. Due to resource problems, Industries and government are not interested in heavy investment in rural areas, this existing gap resulting into unemployment and corruption, and internal terror activities. To reduce such activity the most important and basic element is to provide quality education in remote areas. ICT (Internet Communication and Technology) can play a major role to reduce this problem by providing relevant study materials at effective rate. By providing appropriate infrastructure for ICT with help of industries and government we can bring equal opportunities to people living in rural areas. This paper aims to explain the current state of how ICT is being used in education and how it can better benefit current and future users.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116016826","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}

{"title":"Comparison of different CBIR techniques","authors":"Meenakshi Madugunki, D. Bormane, Sonali Bhadoria, C. Dethe","doi":"10.1109/ICECTECH.2011.5941923","DOIUrl":"https://doi.org/10.1109/ICECTECH.2011.5941923","url":null,"abstract":"Image retrieval is a poor stepchild to other forms of information retrieval (IR). Image retrieval has been one of the most interesting and vivid research areas in the field of computer vision over the last decades. Content-Based Image Retrieval (CBIR) systems are used in order to automatically index, search, retrieve, and browse image databases. Color and texture features are important properties in content-based image retrieval systems. In this paper we have mentioned detailed classification of CBIR system. Also we have discussed about the efficiency of different techniques used in CBIR. We have compared different techniques as well as the combinations of them to improve the performance. We have also compared the effect of different matching techniques on the retrieval process.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123722835","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}

{"title":"Location aware efficient multicasting protocol with state information","authors":"P. Shrividhya","doi":"10.1109/ICECTECH.2011.5941857","DOIUrl":"https://doi.org/10.1109/ICECTECH.2011.5941857","url":null,"abstract":"Several multicast protocols for mobile ad hoc networks have been proposed, which build multicast trees by using location information that is available from the Global Positioning System (GPS) or localization algorithms and use geographic forwarding to forward packets down the multicast trees. These stateless multicast protocols carry encoded membership, location, and tree information in each packet and are more efficient and robust than stateful protocols (for example, ADMR and ODMRP), as they avoid the difficulty of maintaining distributed state in the presence of frequent topology changes. However, current stateless multicast protocols are not scalable to large groups because of the per-packet encoding overhead, and the centralized group membership and location management. In this paper I propose a novel Robust and Scalable Geographic Multicast Protocol (RSGM). Several virtual architectures are used in the protocol without need of maintaining state information for more robust and scalable membership management and packet forwarding in the presence of high network dynamics due to unstable wireless channels and node movements. Specifically, scalable and efficient group membership management is performed through a virtual-zone-based structure, and the location service for group members is integrated with the membership management. Both the control messages and data packets are forwarded along efficient tree-like paths, but there is no need to explicitly create and actively maintain a tree structure. The stateless virtual-tree-based structures significantly reduce the tree management overhead, support more efficient transmissions, and make the transmissions much more robust to dynamics. Geographic forwarding is used to achieve further scalability and robustness. To avoid periodic flooding of the source information throughout the network, an efficient source tracking mechanism is designed to focus on minimizing join latency, repair latency, and control overhead. I have design a routing protocol based on these principles and demonstrate its effectiveness through simulations.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116862110","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}

{"title":"Design of low power and high speed configurable booth multiplier","authors":"D. Moni, P. Sophia","doi":"10.1109/ICECTECH.2011.5942111","DOIUrl":"https://doi.org/10.1109/ICECTECH.2011.5942111","url":null,"abstract":"A configurable multiplier optimized for low power and high speed operations and which can be configured either for single 16-bit multiplication operation, single 8-bit multiplication or twin parallel 8-bit multiplication is designed. The output product can be truncated to further decrease power consumption and increase speed by sacrificing a bit of output precision. Furthermore, the proposed multiplier maintains an acceptable output quality with enough accuracy when truncation is performed. Thus it provides a flexible arithmetic capacity and a tradeoff between output precision and power consumption. The approach also dynamically detects the input range of multipliers and disables the switching operation of the non effective ranges. Thus the ineffective circuitry can be efficiently deactivated, thereby reducing power consumption and increasing the speed of operation. Thus the proposed multiplier outperforms the conventional multiplier in terms of power and speed efficiencies.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125761582","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}

{"title":"Medical image transcoder for telemedicine based on wireless communication devices","authors":"Samit Desai, B. Usha","doi":"10.1109/ICECTECH.2011.5941629","DOIUrl":"https://doi.org/10.1109/ICECTECH.2011.5941629","url":null,"abstract":"Digital Imaging and Communications in Medicine (DICOM) is a standard for handling, storing, printing, and transmitting information in medical imaging. DICOM viewer tool is required to view and analyze these DICOM images. There are many commercially available algorithms which process Dicom images; however these algorithms are typically tuned for particular image types. This paper describes a universal transcoder for reading Dicom images and compressing these using lossy as well as lossless schemes such as Dicom rle, jpeg, and jpeg 2000. The compression technique to be used is either automatically selected based on image parameters, or as specified by the user. This paper also describes results from research conducted in the conversion of images from DICOM format into any other image format, reducing the dependence of specialized DICOM viewer tools for viewing medical images. The idea is to convert DICOM formatted files into bitmap format first, and then convert these bitmaps into other common image files. Our transcoder outputs an image that is best suited for viewing on wireless handhelds (mobile phones) as well as built-in viewers on computers, which facilitates further analysis and research to be conducted on these images.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129432874","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}

{"title":"An advanced scratch removal method for Fingerprint biometrics","authors":"S. Arumugaperumal, B. Sivagami, K. Pazhanikumar","doi":"10.1109/ICECTECH.2011.5941886","DOIUrl":"https://doi.org/10.1109/ICECTECH.2011.5941886","url":null,"abstract":"Minutiae extraction for automatic Fingerprint identification system is one of the most important steps however, the performance of minutiae extraction relies heavily on an enhancement algorithm. There are a lot of things that affect the quality of the fingerprint; one of them is scratches occurred in the fingerprint. Scratches generate the cutting in ridges. This affects the performance of the minutiae extraction. There are many algorithms for fingerprint enhancement, but very limited papers considering the enhancement by scratch removal in the fingerprint. In this paper we present a new effective method for making scratch free fingers. This proposed method can be used to detect and reduce the scratches in the fingerprint. The power of the proposed method is made by morphological operations and inpaint operations. Morphology concepts are used to detect the scratches and exemplar inpaint method is used to fill the scratched locations. Experimental results show a significant improvement of the fingerprint enhancement in the scratch-affected — area.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129520882","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}

{"title":"Reversible Arithmetic Logic Unit","authors":"Y. Syamala, A. Tilak","doi":"10.1109/ICECTECH.2011.5941987","DOIUrl":"https://doi.org/10.1109/ICECTECH.2011.5941987","url":null,"abstract":"A function is reversible if each input vector produces a unique output vector. Reversible logic is of growing importance to many future computer technologies. In this paper, the design of a reversible Arithmetic Logic Unit (ALU) is presented making use of multiplexer unit as well as control signals. ALU is one of the most important components of CPU that can be part of a programmable reversible computing device such as a quantum computer. In multiplexer based ALU the operations are performed depending on the selection line. The control unit based ALU is developed with 9« elementary reversible gates for four basic arithmetic logical operations on two w-bit operands. The series of operations are performed on the same line depending on control signals, instead of selecting the desired result by a multiplexer. The later design is found to be advantageous over the former in terms of number of garbage outputs and constant inputs produced.","PeriodicalId":184011,"journal":{"name":"2011 3rd International Conference on Electronics Computer Technology","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128477709","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}