{"title":"A Forward Pointer based mobility management scheme for multi-hop multi-path wireless mesh network","authors":"Abhishek Majumder, S. Roy","doi":"10.1109/ICDSE.2012.6281899","DOIUrl":"https://doi.org/10.1109/ICDSE.2012.6281899","url":null,"abstract":"Now-a-days with the increasing number of mesh clients it has become a challenging task to provide uninterrupted internet connectivity for the clients. To solve this problem several mobility management schemes such as iMesh and MEMO, have been proposed. The major drawbacks of these schemes are: larger handoff delay and higher signaling overhead. A new mobility management scheme named Forward Pointer Based Routing (FPBR) is proposed here and an analytical comparison is made with iMesh and MEMO. FPBR achieves low handoff latency and less signaling overhead. Moreover, FPBR supports multipath routing. This increases the reliability of the network.","PeriodicalId":293272,"journal":{"name":"2012 International Conference on Data Science & Engineering (ICDSE)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124532987","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 new spike train distance measure","authors":"S. Shekhar, K. Majumdar","doi":"10.1109/ICDSE.2012.6281906","DOIUrl":"https://doi.org/10.1109/ICDSE.2012.6281906","url":null,"abstract":"In this paper a new spike train distance measure has been proposed, which is purely dependent on statistical features of the two spike trains, the distance between which is to be measured. The accuracy can be improved by increasing the number of features. Here we have selected only two features and reported performance with high accuracy on spike trains generated by (1) Poisson process and (2)Izhikevich method . We have done performance analysis by two different methods namely, (1) area under ROC curve and (2) area under quasi-ROC curve. It has been indicated how accuracy can be further improved by increasing the number of features.","PeriodicalId":293272,"journal":{"name":"2012 International Conference on Data Science & Engineering (ICDSE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121144005","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":"Analysis of the sequence length of visitors from the entry point and their repeated visits","authors":"Justin Jose, P. Lal","doi":"10.1109/ICDSE.2012.6281901","DOIUrl":"https://doi.org/10.1109/ICDSE.2012.6281901","url":null,"abstract":"World Wide Web has grown-up exponentially during the last decade and subsequently web log files contain tremendous information about the user traffic and behavior. The sequence length of visitors, the depth to which a user visits a website, can be analyzed to study the behavior of visitors and it may vary depending on the entry point to the website. A statistical analysis was done to see the differences in sequence length of visitors entered through home page and other pages. We also intend to see whether sequence length increases in repeated visits. The hypothesis was tested and it revealed that there is a considerable difference in the sequence length of visitors from home page and other pages. It was observed that sequence length decreases in repeated visits. We have also analyzed whether this result varies with time. The analysis helps in setting appropriate commercial marketing strategy.","PeriodicalId":293272,"journal":{"name":"2012 International Conference on Data Science & Engineering (ICDSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130761451","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 statistical and semantic similarity techniques for paraphrase identification","authors":"S. S. Abraham, S. M. Idicula","doi":"10.1109/ICDSE.2012.6282314","DOIUrl":"https://doi.org/10.1109/ICDSE.2012.6282314","url":null,"abstract":"This paper compares statistical technique of paraphrase identification to semantic technique of paraphrase identification. The statistical techniques used for comparison are word set and word-order based methods where as the semantic technique used is the WordNet similarity matrix method described by Stevenson and Fernando in [3].","PeriodicalId":293272,"journal":{"name":"2012 International Conference on Data Science & Engineering (ICDSE)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132180886","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 Domain ontology based service matching for CHORD based Super Peer network","authors":"R. Rajmohan, N. Padmapriya","doi":"10.1109/ICDSE.2012.6282324","DOIUrl":"https://doi.org/10.1109/ICDSE.2012.6282324","url":null,"abstract":"One major issue in web service discovery is retrieving the desired services. Currently P2P architectures are used as a replacement of UDDI for registering and discovering web services. But P2P network structures lack semantic based query routing and have scalability issues when they are scaled to larger network. In this paper we introduce the concept of Domain ontology in CHORD based Super Peer network. The Traditional CHORD algorithm is modified by with two changes: Functionally equivalent services are evenly distributed across the network and Domain ontology is used for service matching instead of service identifiers. An ontology repository is also available in each Super node of the network which stores the domain ontologies used for service matching. At the same time, we take advantage of OWL-S to create domain ontologies and to add valuable semantic information in Web Service description. We have also modified an existing ontology matching algorithm making it compatible with CHORD structure.","PeriodicalId":293272,"journal":{"name":"2012 International Conference on Data Science & Engineering (ICDSE)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134589242","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":"Spatial localization and color histograms based insertion of virtual advertisements in videos","authors":"A. Hegde, D. Kumar, G. Srinivasa","doi":"10.1109/ICDSE.2012.6282323","DOIUrl":"https://doi.org/10.1109/ICDSE.2012.6282323","url":null,"abstract":"This paper presents a location-sensitive algorithm for the automated insertion of virtual advertisements in videos. Virtual advertisements are objects (text messages, pictures, an animation or video sequence) that are introduced noninvasively into a video. Typically, this is done manually. Most automated approaches involve insertion of virtual advertisements in hard-coded, specific locations of videos that could be intrusive. In this paper we propose an algorithm based on colour histogram processing that works with an inter-frame difference based classifier. Along with the spatial localization input (based on the type of video), this ensures a virtual advertisement is inserted in a manner that it is noticed and yet appears at a location that does not obfuscate a critical portion of the video. We demonstrate the efficacy of this method through experimental results.","PeriodicalId":293272,"journal":{"name":"2012 International Conference on Data Science & Engineering (ICDSE)","volume":"137 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133518713","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":"Topic based semantic clustering using Wikipedia knowledge","authors":"B. Ramudu, M Narasimha Murty","doi":"10.1109/ICDSE.2012.6281905","DOIUrl":"https://doi.org/10.1109/ICDSE.2012.6281905","url":null,"abstract":"Most of the existing academic social networks like DBLP and ArnetMiner suggest co-authors as being related to each author based on author and co-author details, which are extracted from academic researchers publications. Instead of this approach, we propose grouping of researchers on basis of topics they have in common that would make more semantic sense for a user searching for publications in an area. Identification of relevant complete topic phrases, discovery of equivalent topics (synonyms) using terms in document collections are fundamental problems in information retrieval, natural language processing, pattern recognition, etc. In this paper, we propose a novel approach, wherein we identify a document's topic using Wikipedia. Wikipedia is the largest freely available crowd-source with up-to-date knowledge containing around 20 millions topics. The document collection we consider is the collection of academic researchers' publications. The documents are mapped to topics extracted from documents using Wikipedia to generate a document-topic representation. Then clustering algorithm is applied on document-topic representation to group semantically related researchers and generate a topic based academic researchers' Social Network. We use Adaptive Rough Fuzzy Leader (ARFL) a soft clustering algorithm, since each researcher can have expertise in more than one area and they can belong to more than one group. We present the empirical evaluation of our proposed scheme. We also demonstrate how our proposed solution is scalable to various domain areas and can be used to design topic based retrieval systems.","PeriodicalId":293272,"journal":{"name":"2012 International Conference on Data Science & Engineering (ICDSE)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132436345","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 improved MST-based clustering for biological data","authors":"D. Edla, S. Machavarapu, P. K. Jana","doi":"10.1109/ICDSE.2012.6282259","DOIUrl":"https://doi.org/10.1109/ICDSE.2012.6282259","url":null,"abstract":"Graph-based methods are widely used in cluster analysis because of their efficient functionality in a wide variety of problem domains. In this paper, we propose a new clustering algorithm with the help of minimum spanning tree. We remove the inconsistent edges of the MST by defining an error ratio based on the weights of the edges sorted in non-increasing order. Edges are removed until the error ratio is greater than certain value. An important advantage involved in this method is that the same threshold ratio is used for all the data sets. The proposed method is experimented on various two-dimensional synthetic and multi-dimensional real world data sets to prove the efficiency in detecting the complex clusters. Dynamic validity index is used to evaluate the clustering results of multi-dimensional data. The results of the proposed method are also compared with few existing clustering techniques. The results are encouraging.","PeriodicalId":293272,"journal":{"name":"2012 International Conference on Data Science & Engineering (ICDSE)","volume":"373 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131724011","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":"Detection of flock movement in spatio-temporal database using clustering techniques - An experience","authors":"G. Jacob, S. M. Idicula","doi":"10.1109/ICDSE.2012.6282312","DOIUrl":"https://doi.org/10.1109/ICDSE.2012.6282312","url":null,"abstract":"In this paper, moving flock patterns are mined from spatio- temporal datasets by incorporating a clustering algorithm. A flock is defined as the set of data that move together for a certain continuous amount of time. Finding out moving flock patterns using clustering algorithms is a potential method to find out frequent patterns of movement in large trajectory datasets. In this approach, SPatial clusteRing algoRithm thrOugh sWarm intelligence (SPARROW) is the clustering algorithm used. The advantage of using SPARROW algorithm is that it can effectively discover clusters of widely varying sizes and shapes from large databases. Variations of the proposed method are addressed and also the experimental results show that the problem of scalability and duplicate pattern formation is addressed. This method also reduces the number of patterns produced.","PeriodicalId":293272,"journal":{"name":"2012 International Conference on Data Science & Engineering (ICDSE)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116805012","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":"Cooperative caching techniques for mobile ad hoc networks","authors":"P. Joy, K. Jacob","doi":"10.1109/ICDSE.2012.6282317","DOIUrl":"https://doi.org/10.1109/ICDSE.2012.6282317","url":null,"abstract":"Data caching can remarkably improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. The cache placement problem minimizes total data access cost in ad hoc networks with multiple data items. The ad hoc networks are multi hop networks without a central base station and are resource constrained in terms of channel bandwidth and battery power. By data caching the communication cost can be reduced in terms of bandwidth as well as battery energy. As the network node has limited memory the problem of cache placement is a vital issue. This paper attempts to study the existing cooperative caching techniques and their suitability in mobile ad hoc networks.","PeriodicalId":293272,"journal":{"name":"2012 International Conference on Data Science & Engineering (ICDSE)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116513866","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}