2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering最新文献

{"title":"GAMANET: A ganatic algorithm approach for hierarchical group key management in mobile adhoc network","authors":"K. Pushpalatha, M. Chitra","doi":"10.1109/ICPRIME.2013.6496503","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496503","url":null,"abstract":"Mobile adhoc network (MANET) is a seamless integration of nodes that can be sender, recipient or relay and may unaware until they come in contact with each other in a decentralized network. Communication should takes place in a secure manner even with the changes on topology, bandwidth, network size, resources etc. The core aspect of establishing trust among the mobile nodes can do with the help of authentication check by exchanging keys. In this paper, we propose a genetic algorithm approach for hierarchical group key management scheme by simple rekeying technique on frequent scalable and high mobility nodes. The rekeying approach (in our scheme) distributes key with decentralize authority require single round and achieves consumption of energy during exchanging of rekeying messages with simplified number of bits. Few approaches such as OFT, CRTDH, GDH, and BH uses 3 rounds and DLKH, DOWF uses based on number of members in the network. The proposed approach (On our method) reduces energy consumption, computation, and communication compare to the existing scheme.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"23 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133185151","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":"Modeling intrusion detection in mobile ad hoc networks as a non cooperative game","authors":"Dr. B. Paramasiva, K. Pitchai","doi":"10.1109/ICPRIME.2013.6496490","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496490","url":null,"abstract":"The vulnerable nature of the Mobile Adhoc Networks, make them open to numerous security threats which distorts their further developmental attempts, In order to overcome such scenarios in an effective way Intrusion Detection System techniques can be incorporated which will strengthen the frontline security. This paper addresses a novel intrusion detection system that uses Game theoretic model to detect the malicious nodes at an earlier stage. The Bayesian game concept of game theory have been used to model the interaction between any two neighbouring nodes of a mobile adhoc network and the game is resolved to find best strategies for the regular nodes of the network. These strategies are used as a defensive mechanism to defend against malicious attacks and also the nodes monitor their neighbours continuously and stores the information about the packets sent and received based on which the subsequent stages of the game are carried forward.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129071992","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":"Performance analysis of query related user profiling for web search","authors":"D. Madusubram, S. Shantharajah","doi":"10.1109/ICPRIME.2013.6496493","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496493","url":null,"abstract":"Record matching, which recognizes the records that symbolize the similar real-world article, is an imperative tread for data incorporation. Most state-of-the-art record corresponding techniques are managed, which needs the user to present training data. These techniques are not appropriate for the Web catalog situation, where the records to counterpart are query results vigorously produced on the dash. Such records are query reliant and a pre-arranged technique by means of training instances from preceding query results might fall short on the consequences of a novel query. To deal with the crisis of record similar in the Web database set-up, an unconfirmed, online verification corresponding technique, UDD, presented for efficiently recognize replicas from the query outcome records of numerous Web databases. UDD proficiently identified the replica pairs in the dataset but consumes more time. There are numerous methods have discussed the problem of user profiling fundamental component of personalization applications. In this paper, we analyze current query related user profiling schemes and provide an overview of the emerging record matching with query results from multiple web databases. Also comparisons are done between the various schemes to explain the advantages and limitations. In this paper, experimental evaluation shows that the performance analysis of the query related user profiling for web search on the basis of precision, recall, F-measure.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129152731","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":"Harmony search based wrapper feature selection method for 1-nearest neighbour classifier","authors":"V. Krishnaveni, G. Arumugam","doi":"10.1109/ICPRIME.2013.6496442","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496442","url":null,"abstract":"The high-dimensional feature vectors often impose a high computational cost when classification is performed. Feature selection plays major role as a pre-processing technique in reducing the dimensionality of the datasets in data analysis and data mining. This process reduces the number of features by removing irrelevant and redundant data and hence resulting in acceptable classification accuracy. Filter and wrapper are the two kinds of feature selection methods. Experimental results have proved that the wrapper methods can yield better performance, although they have the disadvantage of high computational cost. This paper presents a Harmony Search based novel optimization algorithm for wrapper feature selection. 1-NN classifier method has been used to evaluate the quality of the solutions. The performance of the proposed approach has been analysed by experiments with various real-world data sets. The proposed method, HS-1-NN, produced better performance than other state-of-the-art methods in terms of classification accuracy and convergence rate.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127866329","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 generic tool for link spam detection in search engine results using graph mining","authors":"D. Saraswathi, A. Vijaya","doi":"10.1109/ICPRIME.2013.6496487","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496487","url":null,"abstract":"Web Spam is a portion of web page which has been created with the intention of increasing its ranking in search engines. Web spamming [4] refers to actions intended to mislead search engines into ranking certain pages higher than they deserve. Recently, the amount of web spam has increased dramatically, leading to a degradation of search results. And also the web spam takes large amount of disk space, additional crawling, indexing, query processing time and the users gets affected by getting irrelevant results. Most of the websites are intended to increase the popularity of the links and to display their websites in top ten search results. This research work is towards to reduce the link spamming in web search engine results using Graph mining. This system takes various parameters such as Degree, PageRank, and finds close supporters related features of the links. The purpose of this research is to identify the link spamming techniques, to ignore spam links and to improve the quality of the search engine results.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124486456","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":"Survey of image segmentation algorithms on ultrasound medical images","authors":"S. Sridevi, M. Sundaresan","doi":"10.1109/ICPRIME.2013.6496475","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496475","url":null,"abstract":"Visual information plays an important role in almost all areas our life. Nowadays, much of this information is represented and processed digitally. Image processing is ubiquitous, with the applications ranging from Television (TV) to Computed Tomography, from Photography to Printing, from Robotics to remote sensing and medical applications. Ultrasound is one of the techniques for medical application. It is used for clinical usage. The most important technologies include transducers, beam forming, contrast agents, pulse compression techniques for measuring blood flow and three-dimensional imaging. Ultrasound imaging provides valuable imaging modality to provide the following functionalities as ease of use, low cost, safe, non invasive and fast examination. Ultrasound imaging system provides effective way for examining the various tissues of human body including thyroid, breast, abdominal organs, heart, muscles, tendons, arteries and veins. This paper aims to present on current segmentation algorithms used for medical images. Each and every type of algorithm is discussed as well as their main application fields identified. Experiments that apply the algorithms to segment ultrasound images are presented to further evaluate their behaviour.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121370679","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 and characterization of chemical properties of soil surface data using K-means algorithm","authors":"D. A. Kumar, N. Kannathasan","doi":"10.1109/ICPRIME.2013.6496484","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496484","url":null,"abstract":"Soil is a vital natural resource on whose proper use depends the life supporting system of a country and the socio-economic development of its people. Clustering in agricultural soil datasets is a relatively novel research field. This research paper aims to study the Characterization of Chemical Properties of Soil Surface Data of Bhanapur Micro watershed of Koppal District, Karnataka using K-means algorithm. This work computed average silhouette width which provides an evaluation of clustering validity, and might be used to select an appropriate number of clusters in the soil dataset. Soil dataset clustered by using K-means two clustering with Euclidean distance which provides average silhouette value is 0.7736. And this work also proved high intra-class similarity: cohesive within clusters and low inter-class similarity: distinctive between clusters in the soil dataset by K-means which reassigns points among clusters to decrease the sum of point-to-centroid distances, and then recomputed cluster centroids for the new cluster assignments. Kmeans clustering with Euclidean distance total sum of distance is 1.14402 based on the number of reassign soil data. By default, Kmeans begins the clustering process using a randomly selected set of initial centroid locations. K-means repeats the clustering process starting from different randomly selected centroids. The sum of distances within each cluster for that best solution is 1.1440 with Euclidean distance. K-means three clustering solution with Euclidean distance which provides average silhouette value is 0.6052. K-means three clustering solution with Cosine distance average silhouette value is 0.6219. Hierarchical Clustering dendrogram with Euclidean distance measure is 0.7935. Hierarchical Clustering dendrogram with Cosine distance measure is 0.6678. The results from hierarchical clustering dendrogram with Cosine distance are qualitatively similar to results from K-Means using three clusters. K-means cluster analysis with Euclidean and Cosine distance measures compared with Hierarchical clustering dendrogram. Based on the study and characterization of chemical properties of soil surface data using K-means, Cosine might be a good choice of distance measure.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121522216","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":"Efficient routing with multicost parameters based DSDV protocol in wireless ad hoc networks","authors":"D. Loganathan, P. Ramamoorthy","doi":"10.1109/ICPRIME.2013.6496516","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496516","url":null,"abstract":"A Wireless ad hoc network is a collection of wireless mobile nodes that dynamically form a network connection temporarily without any support of static infrastructure. A major problem in wireless ad hoc networks that care advance reservations is the network routing. This paper reviews the Multicost Parameters Based DSDV (MPB-DSDV) Routing protocol and scheduling algorithm for selecting the optimal path in the network nodes and along with some other QoS parameters requirement. The various parameters like hop count, total interference, node link delay, residual energy of a node and the node transmission power are the cost parameters allocated for link and path of the ad hoc networks. The simulation results indicate the Multicost Parameters Based DSDV (MPB-DSDV) Routing Protocol to improve the performance metrics like packet-delivery ratio, end-to-end delay, dropped packets, routing overhead, route length of wireless ad hoc networks than regular DSDV routing protocol.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123347660","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":"Total Bimagic labeling and Total Magic Cordial labeling of Paley digraphs","authors":"R. Parameswari, R. Rajeswari","doi":"10.1109/ICPRIME.2013.6496723","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496723","url":null,"abstract":"In this paper we define Total Bimagic labeling and Total Magic Cordial labeling fordigraphs, and we prove the same for the small class of digraphs called Paley digraphs with q vertices and p set of edges where q 3 mod 4 and p = (q-1/2) admits and Total Magic Cordiallabeling Total Bimagic labeling. A digraph G is said to have a total magic cordial (TMC) labeling with constant C if thereexists a mapping f: V (G)∪ E(G) {0, 1} such that for any vertex vi, the sum of the labels of outgoing edges of vi and the label of itself is a constant C (mod2) provided the condition |f(0)-f(1)|≤ 1 is hold, where f(0) = vf (0)+ef (0) and f(1) = vf(1) + ef(1) where Vf(l), ef(l); i to,{0, 1} are respectively, the number of vertices and edges labeled with i.A total bimagic labeling of a digraph with v vertices and e edges is a bijection f : V(G) E(G) {1,2, .... V E| such that for any vertex vi the sum of the labels of outgoing edges of vi together with the label of itself is equal to either of constants kl or k2. AMS Subject Classification: 05C78.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123366087","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":"Pre-emptive scheduling of on-line real time services with task migration for cloud computing","authors":"R. Santhosh, T. Ravichandran","doi":"10.1109/ICPRIME.2013.6496485","DOIUrl":"https://doi.org/10.1109/ICPRIME.2013.6496485","url":null,"abstract":"This paper presents a new scheduling approach to focus on providing a solution for online scheduling problem of real-time tasks using “Infrastructure as a Service” model offered by cloud computing. The real time tasks are scheduled pre-emptively with the intent of maximizing the total utility and efficiency. In traditional approach, the task is scheduled non- pre-emptively with two different types of Time Utility Functions (TUFs) - a profit time utility function and a penalty time utility function. The task with highest expected gain is executed. When a new task arrives with highest priority then it cannot be taken for execution until it completes the currently running task. Therefore the higher priority task is waiting for a longer time. This scheduling method sensibly aborts the task when it misses its deadline. Note that, before a task is aborted, it consumes system resources including network bandwidth, storage space and processing power. This leads to affect the overall system performance and response time of a task. In our approach, a preemptive online scheduling with task migration algorithm for cloud computing environment is proposed in order to minimize the response time and to improve the efficiency of the tasks. Whenever a task misses its deadline, it will be migrated the task to another virtual machine. This improves the overall system performance and maximizes the total utility. Our simulation results outperform the traditional scheduling algorithms such as the Earliest Deadline First (EDF) and an earlier scheduling approach based on the similar model.","PeriodicalId":123210,"journal":{"name":"2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130919488","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}