{"title":"DIMM: Framework for interoperability of data centric mobile middlewares","authors":"R. Pal, Souvik Mazumder, Samiran Chattopadhyay","doi":"10.1109/IADCC.2010.5423003","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423003","url":null,"abstract":"Each data-centric mobile middleware has an unique abstraction of the data. They vary in data format, mode of operation etc. As each of these middlewares has some advantage over others, it is important to establish interoperability among these. There might be application-level interconnection among these components. But that is disadvantageous. In this paper DIMM (Data-centric Interoperable Mobile Middleware) is proposed as a framework to build an interoperable middleware. It handles all the headaches related to different underlying middlewares at different devices.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129669524","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":"Fast reoptimization of Steiner trees","authors":"Subhash Panwar, Suneeta Agarwaal","doi":"10.1109/IADCC.2010.5423050","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423050","url":null,"abstract":"In this paper, we discuss the problem of reoptimization of Steiner tree. We are given an instance of Graph and also an optimal Steiner tree of it. If some changes occur later on in the given graph, a new optimal Steiner tree is to be determined. This process is known as re optimization. We consider two cases of change: one is addition of a new edge and second is, Deletion of an existing edge from the given graph. For both the cases, we provide approximation algorithms with corresponding approximation ratio equal to (1+δ) where 0≪δ≪1.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"5 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114115559","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":"Text region extraction from low resolution natural scene images using texture features","authors":"S. Angadi, M. Kodabagi","doi":"10.1109/IADCC.2010.5423026","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423026","url":null,"abstract":"Automated systems for understanding display boards are finding many applications useful in guiding tourists, assisting visually challenged and also in providing location aware information. Such systems require an automated method to detect and extract text prior to further image analysis. In this paper, a methodology to detect and extract text regions from low resolution natural scene images is presented. The proposed work is texture based and uses DCT based high pass filter to remove constant background. The texture features are then obtained on every 50×50 block of the processed image and potential text blocks are identified using newly defined discriminant functions. Further, the detected text blocks are merged and refined to extract text regions. The proposed method is robust and achieves a detection rate of 96.6% on a variety of 100 low resolution natural scene images each of size 240×320.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123427340","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":"SAES- expert system for advising academic major","authors":"Sourabh Deorah, Srivatsan Sridharan, S. Goel","doi":"10.1109/IADCC.2010.5422931","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422931","url":null,"abstract":"Most students in India choose their undergraduate major solely on the basis of persisting trends in the society. Due to the lack of a holistic guidance system, students often end up making choices solely on the basis of the above parameter, which in eventuality, may fail to align with the student's actual interest and inherent aptitude towards a particular major. In this paper we propose an expert system-SAES which aims to provide intelligent advice to the student as to which major he/she should opt. SAES acquires knowledge of academic performances as well as explicit and implicit interests of the candidate. Knowledge representation in SAES is done by the use of a combination of case based and rule based reasoning. SAES draws inferences on the basis of acquired knowledge and also takes into account the degree of dilemma faced by the candidate and the time he/she takes to decide the interest areas. SAES then recommends the most suitable majors for each candidate, which are further classified as strong, mild and weak on the basis of calculated relative probabilities of success. At the end, we analyze results of the test conducted on a working prototype of SAES.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125702776","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":"Distributed clustering approach for wireless sensor network based cellular data placement model","authors":"S. Gupta, M. Dave","doi":"10.1109/IADCC.2010.5422928","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422928","url":null,"abstract":"Requiring all the nodes in a large-scale wireless sensor network to communicate their data to their respective destination will deplete the energy of the nodes quickly due to the long-distance and multi-hop nature of the communication and will also results in network contention. Therefore to increase longevity and support scalability, nodes are often grouped into disjoint and mostly non-overlapping clusters. Clustering saves energy and reduces network contention by enabling locality of communication: nodes communicate their data over shorter distances to their respective cluster-heads. The cluster-heads aggregate these data into a smaller set of meaningful information. Not all nodes, but only the cluster-heads need to communicate far distances to their respective destinations. In this paper, we propose a distributed clustering approach for our proposed real time data placement model for WSNs. It is assumed that the sensor nodes are aware of their locations in their deployment area, and they are time synchronized. For data dissemination and action in the wireless sensor network the usage of Action and Relay Stations (ARS) has been proposed.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127201397","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":"Enhancing the performance of WDM systems by using TFF in hybrid amplifiers","authors":"I. Kaur, N. Gupta","doi":"10.1109/IADCC.2010.5423027","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423027","url":null,"abstract":"Hybrid amplifiers with different gain bandwidths are indensible for long haul wavelength multiplexed optical communication systems in C-band and L-band. In this paper, the gain spectrum of EDFA has been broadened and flattened by cascading EDFA with TDFA along with a dielectric Interference filter (TFF). On using this configuration we have obtained an amplification bandwidth of 100 nm ranging from 1460nm to 1560 nm with a +2.5% gain deviation.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"113 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134196345","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":"Terrain modeling using dominant points","authors":"N. Panigrahi, B. Mohan, G. Athithan","doi":"10.1109/IADCC.2010.5423041","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423041","url":null,"abstract":"Digital representation of terrain surface is an important research area. A number of techniques have been proposed to represent the terrain surface in a realistic manner. They have been broadly categorized as 2D or 3D terrain models. Each of these models has its own merits and demerits. An ideal model will capture the minute details of the terrain, thus requiring more sample points of the terrain, whereas an optimum model will require the dominant features to represent the terrain effectively. Hence there is a debate amongst researchers on which are the “appropriate level of detail of the terrain which captures the terrain features without compromising the signature of the terrain”. The Very Important Point (VIP) algorithm captures the essential terrain samples which encode the dominant physical characteristics of the terrain surface so that the properties such as height, slope, aspect of the terrain can be preserved accurately. The level of details or the dominant points captured through VIP algorithm is decided through a major of significance of the sample point with respect to its surroundings. The major of significance is empirically being decided through a threshold value in most of the techniques which select the sample points. This paper attempts to investigate and understand the optimum threshold value of the undulating terrain for sampling the dominant points. The threshold value of VIP algorithms which filters the dominant points is investigated for different types of terrain. The range of the threshold value which filters the optimum number of terrain points so that the important physical characteristic of the terrain is preserved is derived from the experiment.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131896949","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":"New wavelet features for image indexing and retrieval","authors":"A. Lakshmi, S. Rakshit","doi":"10.1109/IADCC.2010.5423022","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423022","url":null,"abstract":"Image descriptors encode the images in the database as feature vectors. Feature vectors play main role in content based image retrieval. This paper proposes a new feature vector based on wavelets. Most of the natural images have short span high frequencies and low frequencies extending for larger span. Hence, the design of our feature vector is such that it provides higher spatial localization and lower frequency resolution at higher frequencies and the reverse for lower frequencies. The energy of the frequency content of the image at various sub-bands and different spatial resolution (higher for higher frequency bands) is stored as feature vector. Thus, the given feature vector encodes high frequency information as well. The superiority of the proposed algorithm over some traditional algorithms is substantiated with results.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115654052","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":"Evaluation of correlation properties of Orthogonal spreading codes for CDMA wireless mobile communication","authors":"D. Kedia, M. Duhan, S. Maskara","doi":"10.1109/IADCC.2010.5422934","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5422934","url":null,"abstract":"Code Division Multiple Access (CDMA) is the predominant multiple access technology for future generation wireless systems. The performance of CDMA based wireless systems is largely based on the characteristics of user specific spreading codes. The objective of this paper is to highlight the various factors affecting the choice of these spreading codes and present a comparative evaluation of correlation properties of Orthogonal Gold codes, Orthogonal Golay complementary sequences and Walsh-Hadamard codes for application to next generation CDMA based wireless mobile systems.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114477275","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":"Novel approach to design a testable conservative logic gate for QCA implementation","authors":"Kunal Das, D. De","doi":"10.1109/IADCC.2010.5423034","DOIUrl":"https://doi.org/10.1109/IADCC.2010.5423034","url":null,"abstract":"In the Low power Nanocomputing era, Reversible and Conservative logic gate design is emerging as an important area of research. In this paper, we present a Novel approach to design conservative logic gate (CLG) using 3×3 tile nanostructure, as reversible logic design research gets amplitude. On the other hand study of 3×3 tile make fruitful result as it have diverse application, mentioned in this paper. It is a Novel nanostructure that is applied here to implement CLG. The basic principle of CLG is Parity preserving in both input as well as output. Here we applied 3×3 orthogonal MV to implement the logic and Cross wire is implemented with the help of 3×3 Baseline tile. The main advantage of this design we achieve that the numbers of Layer required only one. It also been demonstrated that the proposed design offers less numbers of QCA cell as well as less area and less clocking zones then the existing counterparts. We also analyzed the logic synthesis using our proposed gate. Here, we also found an effective and promising result and excels all existing counterparts. We demonstrate the testability of proposed CLG by means of behavioral approach of both inputs and outputs.","PeriodicalId":249763,"journal":{"name":"2010 IEEE 2nd International Advance Computing Conference (IACC)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120898125","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}