2014 10th International Conference on Natural Computation (ICNC)最新文献_第5页

Graph based K-nearest neighbor minutiae clustering for fingerprint recognition 基于图的k近邻聚类指纹识别

2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975917

Vaishali S. Pawar, M. Zaveri

{"title":"Graph based K-nearest neighbor minutiae clustering for fingerprint recognition","authors":"Vaishali S. Pawar, M. Zaveri","doi":"10.1109/ICNC.2014.6975917","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975917","url":null,"abstract":"The graph is an efficient data structure to represent multi-dimensional data and their complex relations. Pattern matching and data mining are the two important fields of computer science. Pattern matching finds a particular pattern in the given input where as data mining deals with selecting specific data from the huge databases. This work contributes towards the combination of graph theory, pattern recognition and graph based databases. A variety of graph based techniques have been proposed as a powerful tool for pattern representation and classification in the past years. For a longer time graphs remained computationally expensive tool. But recently the graph based structural pattern recognition and image processing is becoming popular. The computational complexity of the graph based methods is becoming feasible due to high end new generations of the computers and the research advancements. In this work we have implemented graph based fingerprint recognition algorithm. The fingerprints are represented as attributed relational graphs. In the pattern recognition phase graph matching is applied. This study focuses on the clustering of graph databases prior to graph matching. When the structural feature set size of the data grows longer, graph matching becomes expensive. The clustering of graph databases drastically reduce the graph matching candidates.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"7 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114019869","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}

引用次数: 10

Solving capacitated vehicle routing problem using intelligent water drops algorithm 用智能水滴算法求解有容车辆路径问题

2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975880

A. Wedyan, A. Narayanan

引用次数: 5

Identifying minimally redundant wavenumbers for vibrational microspectroscopic image analysis 识别振动显微光谱图像分析的最小冗余波数

2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975950

Qiaoyong Zhong, D. Niedieker, Dennis Petersen, K. Gerwert, A. Mosig

引用次数: 0

The application of Elman recurrent neural network model for forecasting consumer price index of education, recreation and sports in Yogyakarta Elman递归神经网络模型在日惹市教育、娱乐和体育消费物价指数预测中的应用

2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975833

D. U. Wutsqa, R. Kusumawati, R. Subekti

{"title":"The application of Elman recurrent neural network model for forecasting consumer price index of education, recreation and sports in Yogyakarta","authors":"D. U. Wutsqa, R. Kusumawati, R. Subekti","doi":"10.1109/ICNC.2014.6975833","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975833","url":null,"abstract":"Recurrent neural network is a network which provides feedback connections. This network is believed to have a more powerful approach than the typical neural network for learning given data. The current research was aimed to apply the simplest recurrent neural network model, namely the Elman recurrent neural network (ERNN) model, to the consumer price index (CPI) of education, recreation, and sports data in Yogyakarta. The pattern of CPI data can be categorized as a function of time period, which tends to move upwards when the time period is increased, and jump at some points of the time period. This pattern was identified as similar to the pattern resulted by the function of the truncated polynomial spline regression model (TPSR). Hence, this research considered ERNN model which the inputs such as in the TPSR model were established by taking into account the location of the knot or jump points. In addition, the ERNN model with a single input, a time period was also generated. The results demonstrated that the two models have high accuracy both in training and testing data. More importantly, it was found that the first model is more appropriate than the second one in testing data.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123123959","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}

引用次数: 12

Using WebSocket-based technology to build real-time meteorological wireless sensor network information publishing platform 利用基于websocket的技术构建实时气象无线传感器网络信息发布平台

2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975834

Leiyue Yao, D. Xu, Weijian Zhang, Jie Zhou

{"title":"Using WebSocket-based technology to build real-time meteorological wireless sensor network information publishing platform","authors":"Leiyue Yao, D. Xu, Weijian Zhang, Jie Zhou","doi":"10.1109/ICNC.2014.6975834","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975834","url":null,"abstract":"According to the specific business requirements of the meteorological wireless sensor network (MWSN), we analyze and summarize the principles and problems of the existing Web real-time communication technology, and put forward the real-time meteorological information publishing platform (RT-MIPP) solution based on WebSocket. We first analyze and classify the observational data of MWSN, and design the meteorological information packet format. On this basis, the overall framework design of middleware server (MWServer) is established, the functions of each module are described in detail, and the specific design of MWServer software platform is given. At the same time, through the comparison of all kinds of real-time Web communication technology, the WebSocket significant advantages in low-latency and low network throughput is obtained, and the information Web publishing platform is designed. Actual operating results show that, using .NET and WebSocket technology, greatly improve the performance of system in realtime, versatility and flexibility, simplify the process of later modifications and maintenance, and achieve the expected effect of the authors.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123556571","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}

引用次数: 1

Voronoi-clustering for plane data 平面数据的voronoi聚类

2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975932

Zuoyong Xiang, Zhenghong Yu

引用次数: 0

Intelligent optimization approach for the k shortest paths problem based on genetic algorithm 基于遗传算法的k条最短路径问题智能优化方法

2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975838

Feng Wang, Yuan Man, Lichun Man

引用次数: 8

A hierarchical particle swarm optimizer with random social cognition for large scale global optimization 面向大规模全局优化的随机社会认知分层粒子群优化器

2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975844

H. Ge, Z. Ma, Liang Sun

{"title":"A hierarchical particle swarm optimizer with random social cognition for large scale global optimization","authors":"H. Ge, Z. Ma, Liang Sun","doi":"10.1109/ICNC.2014.6975844","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975844","url":null,"abstract":"In this paper, a Hierarchical Particle Swarm Optimizer with Random Social Cognition, briefly expressed as HPSO-RSC, is proposed. During the execution process of HPSO-RSC, the social environment is changed dynamically, and each particle is not only attracted by its previous best particle and the global best particle of the whole population, but also attracted by all other better particles randomly. During the early stage of the execution process, to speed up convergence of the algorithm, the particles are inclined to choose the global best particle as cognition object. On the other hand, during the late stage of the execution process, to keep the diversity of the population, the particles are inclined to choose the particles that better than themselves as cognition object. To solve the large scale global optimization problem, the algorithm is integrated into a cooperative coevolution framework with an efficient variable interaction checking method. Simulated experiments were conducted on the CEC'2008 benchmarks. The result demonstrates that, HPSO-RSC has strong ability to find the global optimum for most of the benchmark problems.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125572739","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}

引用次数: 2

Simulated evolution based algorithm versus exact method for virtual private network design 基于模拟进化算法与精确算法的虚拟专用网设计

2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975842

B. Thabti, H. Youssef, A. Mahjoub, A. Meddeb

{"title":"Simulated evolution based algorithm versus exact method for virtual private network design","authors":"B. Thabti, H. Youssef, A. Mahjoub, A. Meddeb","doi":"10.1109/ICNC.2014.6975842","DOIUrl":"https://doi.org/10.1109/ICNC.2014.6975842","url":null,"abstract":"In this paper, we studied Virtual Private Network Design Problem using tree structure and assuming a pipe traffic matrix. Today with network virtualization, Virtual Private Networks (VPNs) have more importance in networking and offers the company the ideal solution to establish ondemand overlay networks that enable their customers to securely access company resources. This is a hard combinatorial optimization problem that it has been solved in literature only with approximation methods. Generally, this kind of methods do not give any guarantee on the solution quality and we are enable to know a priori how far the given solution is from the optimal one unlike other methods such as the exact methods. For this purpose, we propose an integer linear program (ILP) with classical Pipe traffic model to design the problem under investigation. Based on the proposed integer programming formulation, we solve the problem using two approaches: The first contribution is Simulated Evolution based evolutionary algorithm and the second contribution is an exact method based on Branch and Cut (B&C) algorithm to find a tree rooted at a user specified node with minimized overall reserved bandwidth. Performance results using Brite networks show that our proposed evolutionary algorithm offers good solutions within a fraction of the time required by the B&C algorithm and bandwidth cost within at most 1.5% of the optimal solutions found by the exact method.","PeriodicalId":208779,"journal":{"name":"2014 10th International Conference on Natural Computation (ICNC)","volume":"160 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129259292","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}

引用次数: 2

The application and optimization of genetic algorithms in formula problems 遗传算法在公式问题中的应用与优化

2014 10th International Conference on Natural Computation (ICNC) Pub Date : 2014-12-08 DOI: 10.1109/ICNC.2014.6975843

Nian-yun Shi, Pei-yao Li, Zhuo-jun Li, Qing-dong Zhang

引用次数: 0