Seyed Jabbar Hosaini, S. Alirezaee, M. Ahmadi, S. Makki
In this paper we compare the performance of Legendre moments, Zernike moments and Pseudo-Zernike moments in feature extraction for iris recognition. We have increased the moment orders until the best recognition rate is achieved. Robustness of these moments in various orders has been evaluated in presence of White Gaussian Noise. Numerical results indicate that recognition rate by the Legendre, Zernike and Pseudo-Zernike moments in higher orders are approximately identical. However, average computation time for feature extraction is 4.5, 18 and. 75 seconds respectively for the Legendre, Zernike and Pseudo-Zernike moments of order 14. On the other hand, the result indicates the Legendre moment is more robust than the others against the white Gaussian noise.
{"title":"Comparison of the Legendre, Zernike and Pseudo-Zernike Moments for Feature Extraction in Iris Recognition","authors":"Seyed Jabbar Hosaini, S. Alirezaee, M. Ahmadi, S. Makki","doi":"10.1109/CICN.2013.54","DOIUrl":"https://doi.org/10.1109/CICN.2013.54","url":null,"abstract":"In this paper we compare the performance of Legendre moments, Zernike moments and Pseudo-Zernike moments in feature extraction for iris recognition. We have increased the moment orders until the best recognition rate is achieved. Robustness of these moments in various orders has been evaluated in presence of White Gaussian Noise. Numerical results indicate that recognition rate by the Legendre, Zernike and Pseudo-Zernike moments in higher orders are approximately identical. However, average computation time for feature extraction is 4.5, 18 and. 75 seconds respectively for the Legendre, Zernike and Pseudo-Zernike moments of order 14. On the other hand, the result indicates the Legendre moment is more robust than the others against the white Gaussian noise.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130727107","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}
Neelanshu Kumar Khare, A. Shrivastava, Manish Panchal
AODV is reactive routing protocol, used in MANET that establishes route between source and destination, whenever the source has data to send to the destination and there is not any route between them. Since nodes are moving route breaks because nodes are out of coverage of the neighboring nodes. After route break RERR messages are circulated to all the nodes, due to RERR messages traffic increases in the network. And again route discovery mechanism is initiated, in this situation there is a lot of delay. In this paper, authors proposed a method which is based on receive signal strength of the packets coming from neighboring nodes. This method avoid route break in advance. Simulation shows, this new protocol outperforms the original AODV protocol in terms of delay and throughput. Simulation is done on Network Simulator 2.
{"title":"A Low Latency AODV Routing Protocol","authors":"Neelanshu Kumar Khare, A. Shrivastava, Manish Panchal","doi":"10.1109/CICN.2013.31","DOIUrl":"https://doi.org/10.1109/CICN.2013.31","url":null,"abstract":"AODV is reactive routing protocol, used in MANET that establishes route between source and destination, whenever the source has data to send to the destination and there is not any route between them. Since nodes are moving route breaks because nodes are out of coverage of the neighboring nodes. After route break RERR messages are circulated to all the nodes, due to RERR messages traffic increases in the network. And again route discovery mechanism is initiated, in this situation there is a lot of delay. In this paper, authors proposed a method which is based on receive signal strength of the packets coming from neighboring nodes. This method avoid route break in advance. Simulation shows, this new protocol outperforms the original AODV protocol in terms of delay and throughput. Simulation is done on Network Simulator 2.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131723167","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}
Cloud computing is the latest trend in computing and it is established as the newest big shift in the computing. For some, the notion of managing and storing data in a centralized, 'Always-On' repository that can be accessed from anywhere is the key. This paper describe the limitations and challenges in respect of consuming cloud services through mobile devices as well as best served existing solutions. In addition, proposed middleware architecture is discussed with detailed scenario which would be able to provide runtime support and a supportive mechanism for the mobile devices in order to consume or access cloud services.
{"title":"Mobile Cloud Computing: Bridging the Gap between Cloud and Mobile Devices","authors":"Rishabh Sharma, Sanjay Kumar, M. Trivedi","doi":"10.1109/CICN.2013.120","DOIUrl":"https://doi.org/10.1109/CICN.2013.120","url":null,"abstract":"Cloud computing is the latest trend in computing and it is established as the newest big shift in the computing. For some, the notion of managing and storing data in a centralized, 'Always-On' repository that can be accessed from anywhere is the key. This paper describe the limitations and challenges in respect of consuming cloud services through mobile devices as well as best served existing solutions. In addition, proposed middleware architecture is discussed with detailed scenario which would be able to provide runtime support and a supportive mechanism for the mobile devices in order to consume or access cloud services.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133143642","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}
Association Rule Mining becomes a vast area of research in last few decades. The basic idea behind ARM is to mine positive (interesting) and negative (uninteresting) rules from a transaction database. In this paper we have proposed a new model for mining positive and negative association rules. Our proposed model is an integration between two algorithms, the interesting multiple level minimum support (IMLMS) algorithm and genetic algorithm (GA), which propose a new approach for mining positive and negative rules from frequent and infrequent itemset mined in IMLMS model. Our model gives much better results than previous model.
{"title":"Mining Positive and Negative Association Rules from Frequent and Infrequent Pattern Using Improved Genetic Algorithm","authors":"Jeetesh Kumar Jain, N. Tiwari, M. Ramaiya","doi":"10.1109/CICN.2013.146","DOIUrl":"https://doi.org/10.1109/CICN.2013.146","url":null,"abstract":"Association Rule Mining becomes a vast area of research in last few decades. The basic idea behind ARM is to mine positive (interesting) and negative (uninteresting) rules from a transaction database. In this paper we have proposed a new model for mining positive and negative association rules. Our proposed model is an integration between two algorithms, the interesting multiple level minimum support (IMLMS) algorithm and genetic algorithm (GA), which propose a new approach for mining positive and negative rules from frequent and infrequent itemset mined in IMLMS model. Our model gives much better results than previous model.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123867654","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}
A. Manekar, Malti Nagle, Pankaj K. Kawadkar, H. Gupta
Geographic Information Systems (GIS) has been prominently working for the designed to sculpt the world. With the growth and data and increasing sophistication of analysis and processing techniques the traditional sequential methods of performing GIS processing on desktop computers is insufficient. This paper is based on analysis and the performance of 3D convex hull algorithm for the three flavors of parallel architecture considering spatial scatter point data using parallel programming. As GIS use huge set of scatter data for processing and development of many product, a Convex Hull of planner scattered point set will useful in the area of planning and grafting the satellite image in GIS. Analysis is based on the parallel algorithm on OpenMP, MPI and Hybrid of HPC (High Performance Computing) architecture also improvement strategy for the huge data point available for computing such as GIS spatial data with respective OpenMP, MPI and Hybrid is stated.
{"title":"Sifting of a Potent Convex Hull Algorithm for Scattered Point Set Using Parallel Programming","authors":"A. Manekar, Malti Nagle, Pankaj K. Kawadkar, H. Gupta","doi":"10.1109/CICN.2013.121","DOIUrl":"https://doi.org/10.1109/CICN.2013.121","url":null,"abstract":"Geographic Information Systems (GIS) has been prominently working for the designed to sculpt the world. With the growth and data and increasing sophistication of analysis and processing techniques the traditional sequential methods of performing GIS processing on desktop computers is insufficient. This paper is based on analysis and the performance of 3D convex hull algorithm for the three flavors of parallel architecture considering spatial scatter point data using parallel programming. As GIS use huge set of scatter data for processing and development of many product, a Convex Hull of planner scattered point set will useful in the area of planning and grafting the satellite image in GIS. Analysis is based on the parallel algorithm on OpenMP, MPI and Hybrid of HPC (High Performance Computing) architecture also improvement strategy for the huge data point available for computing such as GIS spatial data with respective OpenMP, MPI and Hybrid is stated.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114492828","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}
A new Drug Discovery Platform (DDP) for distributed virtual screening by using database system is proposed. DDP can monitor the process in real time, analyze docking results promptly, and process poses by energy ranking techniques. DDP can provide controls of communication and synchronization, it allows multiple tasks to access and update the data in parallel with marginal additional effort by using a database management system DB2. DDP can be used to dock millions of molecules effectively.
{"title":"A New Drug Discovery Platform for Distributed Virtual Screening Based on Data Management System","authors":"Dong Yueli, Guo Quan, K. Ling, Zhao Xiaoyu","doi":"10.1109/CICN.2013.122","DOIUrl":"https://doi.org/10.1109/CICN.2013.122","url":null,"abstract":"A new Drug Discovery Platform (DDP) for distributed virtual screening by using database system is proposed. DDP can monitor the process in real time, analyze docking results promptly, and process poses by energy ranking techniques. DDP can provide controls of communication and synchronization, it allows multiple tasks to access and update the data in parallel with marginal additional effort by using a database management system DB2. DDP can be used to dock millions of molecules effectively.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121212780","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}
Robots active olfaction based on Genetic algorithm, in order to make the robot car plume in a specific environment, can be faster and more accurate to find the odor source, through the genetic algorithm crossover and mutation operator improved, the formation of a new improved genetic algorithm. In the five assumptions, will improve the genetic algorithm is applied to the robot active olfaction study, simulation results show that the genetic algorithm with the traditional comparison, the robot car can be faster and more accurate in finding the odor plume source.
{"title":"Robots Active Olfaction Based on Improved Genetic Algorithm","authors":"Zhi-Biao Shi, Jiang-bo Sun","doi":"10.1109/CICN.2013.136","DOIUrl":"https://doi.org/10.1109/CICN.2013.136","url":null,"abstract":"Robots active olfaction based on Genetic algorithm, in order to make the robot car plume in a specific environment, can be faster and more accurate to find the odor source, through the genetic algorithm crossover and mutation operator improved, the formation of a new improved genetic algorithm. In the five assumptions, will improve the genetic algorithm is applied to the robot active olfaction study, simulation results show that the genetic algorithm with the traditional comparison, the robot car can be faster and more accurate in finding the odor plume source.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123151744","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}
The spot-checking system is a new pattern about the decision-making for equipment maintenance. This paper introduces the characteristics and types of equipment spot checking system, and analyzes spot-checking maintenance workflow. Through collecting the information on spot checking, the deterioration trend analysis of the equipment may be taken as the master line, assisted by the equipment management network system with expert diagnoses system and the optimization maintenance cost, resulting in correctly reflecting deteriorated situation of the key part in the key equipment and the information of equipment working and maintenance condition, which provide the technical basis for the device management decision-making.
{"title":"The Information System of Spot-Checking System","authors":"Hong Yanyun, H. Qing","doi":"10.1109/CICN.2013.117","DOIUrl":"https://doi.org/10.1109/CICN.2013.117","url":null,"abstract":"The spot-checking system is a new pattern about the decision-making for equipment maintenance. This paper introduces the characteristics and types of equipment spot checking system, and analyzes spot-checking maintenance workflow. Through collecting the information on spot checking, the deterioration trend analysis of the equipment may be taken as the master line, assisted by the equipment management network system with expert diagnoses system and the optimization maintenance cost, resulting in correctly reflecting deteriorated situation of the key part in the key equipment and the information of equipment working and maintenance condition, which provide the technical basis for the device management decision-making.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121735328","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}
GE Small world is a new type of GIS software. Based on the fundamental meaning of Geographic Information System (GIS), the important features of GE Small world and the fundamental features of Forest Resources, we discuss the current application in forest resources information management, forest insect pest and disease control, the integration between GPS (global positioning system) and YAN AN RS (remote sensing), resource management in nature reserve. At the same time the further development of GE Small world in forest resources management has been analyzed.
GE小世界是一款新型的GIS软件。从地理信息系统(GIS)的基本含义、GE小世界的重要特征和森林资源的基本特征出发，论述了地理信息系统在森林资源信息管理、森林病虫害防治、全球定位系统(GPS)与遥感(YAN AN RS)集成、自然保护区资源管理等方面的应用现状。同时对GE小世界在森林资源管理方面的进一步发展进行了分析。
{"title":"Forest Resources Management Based on GIS Technology","authors":"Zhongwei Wang, Yan An","doi":"10.1109/CICN.2013.130","DOIUrl":"https://doi.org/10.1109/CICN.2013.130","url":null,"abstract":"GE Small world is a new type of GIS software. Based on the fundamental meaning of Geographic Information System (GIS), the important features of GE Small world and the fundamental features of Forest Resources, we discuss the current application in forest resources information management, forest insect pest and disease control, the integration between GPS (global positioning system) and YAN AN RS (remote sensing), resource management in nature reserve. At the same time the further development of GE Small world in forest resources management has been analyzed.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"130 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122016985","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}
In Wireless Sensor Networks (WSN), Node Localization is of great importance for location aware services. In this paper we propose the use of Time of Arrival (TOA) information with two popular machine learning algorithms M5 tree Model (M5P) and Sequential Minimal Optimization for Regression (SMOreg) for more accurate node localization in WSN. In this paper we also applied the same node localization problem to two previously used artificial neural network models- Multi Layer Perceptron (MLP) and Radial Basis Function (RBF) Network. After that a comparative analysis between all selected algorithms has been made. Simulation results show the superiority of M5P and SMOreg over MLP and RBFN in high noise conditions in terms of root mean square error. At last a comparative analysis between the two new proposed algorithms was made by changing the number of training nodes. Results show that initially the performance of SMOreg is better but there is no improvement in its performance with increasing training samples. On the other hand M5P's performance can be made better by train it with more number of samples.
{"title":"Node Localization in Wireless Sensor Networks Using the M5P Tree and SMOreg Algorithms","authors":"P. Singh, S. Agrawal","doi":"10.1109/CICN.2013.32","DOIUrl":"https://doi.org/10.1109/CICN.2013.32","url":null,"abstract":"In Wireless Sensor Networks (WSN), Node Localization is of great importance for location aware services. In this paper we propose the use of Time of Arrival (TOA) information with two popular machine learning algorithms M5 tree Model (M5P) and Sequential Minimal Optimization for Regression (SMOreg) for more accurate node localization in WSN. In this paper we also applied the same node localization problem to two previously used artificial neural network models- Multi Layer Perceptron (MLP) and Radial Basis Function (RBF) Network. After that a comparative analysis between all selected algorithms has been made. Simulation results show the superiority of M5P and SMOreg over MLP and RBFN in high noise conditions in terms of root mean square error. At last a comparative analysis between the two new proposed algorithms was made by changing the number of training nodes. Results show that initially the performance of SMOreg is better but there is no improvement in its performance with increasing training samples. On the other hand M5P's performance can be made better by train it with more number of samples.","PeriodicalId":415274,"journal":{"name":"2013 5th International Conference on Computational Intelligence and Communication Networks","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124605133","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：