Radio Frequency Identification (RFID) middleware is the new type of software system which facilitates data communication between automatic identification equipments and enterprise applications. The paper designs a component and implementation of adaptive RFID middleware based on ALE specification, which supports adaptive characteristic in multi readers and provides different tag data for enterprise applications by packaging and releasing ALE interfaces as well as deploying it with mutli-level.
{"title":"Study and Implementation of Adaptive RFID Middleware Based on ALE Specification","authors":"Yuanjie Liu, Tinglei Huang, Jiangfei Zhao","doi":"10.1109/WGEC.2009.52","DOIUrl":"https://doi.org/10.1109/WGEC.2009.52","url":null,"abstract":"Radio Frequency Identification (RFID) middleware is the new type of software system which facilitates data communication between automatic identification equipments and enterprise applications. The paper designs a component and implementation of adaptive RFID middleware based on ALE specification, which supports adaptive characteristic in multi readers and provides different tag data for enterprise applications by packaging and releasing ALE interfaces as well as deploying it with mutli-level.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115411423","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}
Groundwater level has random characters because of influences factors of natural and anthropogenic. Study random prediction model of groundwater level on the basis of groundwater physical process analysis is important to groundwater appraisal. The theory of supporting vector machine based on small-sample machine learning theory is introduced into dynamic prediction of groundwater level. A least square support vector machine groundwater level dynamic forecasting model based on chaos optimization peak value identification was proposed and applied in Hetao irrigation district in Inner Mongolia. The results show that the fitted values, the tested values and the predicted values of this model have little different from their real values. And they indicate that the model is feasible and effective. So the model proposed in this paper can provide a new tool for groundwater level dynamic forecasting.
{"title":"Groundwater Level Dynamic Prediction Based on Chaos Optimization and Support Vector Machine","authors":"Jin Liu, Jian-xia Chang, Wen-ge Zhang","doi":"10.1109/WGEC.2009.25","DOIUrl":"https://doi.org/10.1109/WGEC.2009.25","url":null,"abstract":"Groundwater level has random characters because of influences factors of natural and anthropogenic. Study random prediction model of groundwater level on the basis of groundwater physical process analysis is important to groundwater appraisal. The theory of supporting vector machine based on small-sample machine learning theory is introduced into dynamic prediction of groundwater level. A least square support vector machine groundwater level dynamic forecasting model based on chaos optimization peak value identification was proposed and applied in Hetao irrigation district in Inner Mongolia. The results show that the fitted values, the tested values and the predicted values of this model have little different from their real values. And they indicate that the model is feasible and effective. So the model proposed in this paper can provide a new tool for groundwater level dynamic forecasting.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115445352","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 order to increase the reliability of multimedia authentication, we present a method combined digital signature with digital watermark. The method have implemented dual protection functionality for multi-media information and improved the accuracy of the argument. The experimental results show that this method is feasible and effective.
{"title":"An Effective Arithmetic Combined Digital Signature with Digital Watermarking","authors":"Xingguo Cheng","doi":"10.1109/WGEC.2009.23","DOIUrl":"https://doi.org/10.1109/WGEC.2009.23","url":null,"abstract":"In order to increase the reliability of multimedia authentication, we present a method combined digital signature with digital watermark. The method have implemented dual protection functionality for multi-media information and improved the accuracy of the argument. The experimental results show that this method is feasible and effective.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114818531","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}
As a classical algorithm of association rules mining, Apriori algorithm has two bottlenecks: the large number of candidate itemsets and the poor efficiency of counting support. A new association rules mining algorithm based on vector is proposed, which can reduce the number of candidate frequent itemsets, improve efficiency of pruning operation and count support quickly using vector inner product operation and vector addition operation between transaction vector and itemset vector. According to the results of the experiments, the proposed algorithm can quickly discover frequent itemsets and is more efficient than Apriori algorithm.
{"title":"A New Association Rules Mining Algorithm Based on Vector","authors":"Xin Zhang, Pin Liao, Huiyong Wang","doi":"10.1109/WGEC.2009.64","DOIUrl":"https://doi.org/10.1109/WGEC.2009.64","url":null,"abstract":"As a classical algorithm of association rules mining, Apriori algorithm has two bottlenecks: the large number of candidate itemsets and the poor efficiency of counting support. A new association rules mining algorithm based on vector is proposed, which can reduce the number of candidate frequent itemsets, improve efficiency of pruning operation and count support quickly using vector inner product operation and vector addition operation between transaction vector and itemset vector. According to the results of the experiments, the proposed algorithm can quickly discover frequent itemsets and is more efficient than Apriori algorithm.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"131 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114521642","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}
Three-dimensional CAD model of hierarchical processing is the key technology to the rapid prototyping manufacturing. Compared with the method of applying StereoLithography (STL) format, the representation based on a neutral, international standard (ISO10303) STEP-formatted geometric model is more precise. This paper presents theresults of our development of an extraction algorithm, STEP-based standards for the characteristics of rapid prototyping manufacturing data. With extreme tracking method, we extract the characteristics data with surface tangent plane intersection line and directly slice the model. In VC++ and OPENGL programming environment, using of dual circulation list as a data structure, a data acquisition and hierarchical processing is realized, which is based on a neutral document STEP/AP203 of three-dimensional CAD model. The experimental results demonstrate that the algorithm is more accurate, stable and efficient than that of STL model.
{"title":"Extracting Algorithm of Characteristics Data Based STEP in Rapid Prototyping Technology","authors":"Hongyan Yang, Yanru Zhong","doi":"10.1109/WGEC.2009.191","DOIUrl":"https://doi.org/10.1109/WGEC.2009.191","url":null,"abstract":"Three-dimensional CAD model of hierarchical processing is the key technology to the rapid prototyping manufacturing. Compared with the method of applying StereoLithography (STL) format, the representation based on a neutral, international standard (ISO10303) STEP-formatted geometric model is more precise. This paper presents theresults of our development of an extraction algorithm, STEP-based standards for the characteristics of rapid prototyping manufacturing data. With extreme tracking method, we extract the characteristics data with surface tangent plane intersection line and directly slice the model. In VC++ and OPENGL programming environment, using of dual circulation list as a data structure, a data acquisition and hierarchical processing is realized, which is based on a neutral document STEP/AP203 of three-dimensional CAD model. The experimental results demonstrate that the algorithm is more accurate, stable and efficient than that of STL model.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117265540","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}
Simplification of scattered point cloud is one of the key preprocessing technologies in reverse engineering. Most simplification algorithms always lose geometric feature excessively in the process. On the basis of feature extraction, a new algorithm is proposed for the simplification of scattered point cloud with unit normal vectors. First, points in point cloud are distributed into uniform cubes. Next, bounding spheres are constructed with their centers at each point; accordingly K-nearest neighbors are searched in the relevant sphere. Later, a specified function is defined to measure the curvature of each point so that feature points can be extracted. Finally, feature points and non-feature points are simplified according to the radius of bounding sphere and the threshold of normal vectors' inner product. The experiments show that the proposed algorithm has the advantages of fast speed and high reservation of the geometric feature of point cloud.
{"title":"Simplification of scattered point cloud based on feature extraction","authors":"X. Peng, Wenming Huang, P. Wen, Xiaojun Wu","doi":"10.1109/WGEC.2009.12","DOIUrl":"https://doi.org/10.1109/WGEC.2009.12","url":null,"abstract":"Simplification of scattered point cloud is one of the key preprocessing technologies in reverse engineering. Most simplification algorithms always lose geometric feature excessively in the process. On the basis of feature extraction, a new algorithm is proposed for the simplification of scattered point cloud with unit normal vectors. First, points in point cloud are distributed into uniform cubes. Next, bounding spheres are constructed with their centers at each point; accordingly K-nearest neighbors are searched in the relevant sphere. Later, a specified function is defined to measure the curvature of each point so that feature points can be extracted. Finally, feature points and non-feature points are simplified according to the radius of bounding sphere and the threshold of normal vectors' inner product. The experiments show that the proposed algorithm has the advantages of fast speed and high reservation of the geometric feature of point cloud.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"164 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116293402","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 this paper, an Ethernet data acquisition and transmission unit designed for general purpose information exchange between different channels has been proposed. In hardware, it is composed of only one chip and multiple interfaces which result to easy design and excellent stability; in software, the μC/OS-II, an embedded Real Time Operation System(RTOS), is applied and runs on the microcontroller, and a configuration software used to configure all of the unit parameters by TCP connection runs on the computer. Because of the RAM size and other resources limitation, we improved the μC/OS-II in several aspects. The results of performance evaluations show that the improved μC/OS-II uses less RAM space, more data are exchanged between the Ethernet and other interfaces, and the time of data waiting for processing is ensured and satisfying.
{"title":"Research and Implementation on the Embedded RTOS for the Ethernet Data Acquisition and Transmission System","authors":"Zaosheng Zhang, Tinglei Huang","doi":"10.1109/WGEC.2009.78","DOIUrl":"https://doi.org/10.1109/WGEC.2009.78","url":null,"abstract":"In this paper, an Ethernet data acquisition and transmission unit designed for general purpose information exchange between different channels has been proposed. In hardware, it is composed of only one chip and multiple interfaces which result to easy design and excellent stability; in software, the μC/OS-II, an embedded Real Time Operation System(RTOS), is applied and runs on the microcontroller, and a configuration software used to configure all of the unit parameters by TCP connection runs on the computer. Because of the RAM size and other resources limitation, we improved the μC/OS-II in several aspects. The results of performance evaluations show that the improved μC/OS-II uses less RAM space, more data are exchanged between the Ethernet and other interfaces, and the time of data waiting for processing is ensured and satisfying.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125883533","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 garbage crusher is one of the important parts in recoverable coal production line. To diagnose its faults during the working process, Back Propagation algorithm is used. However, it has some shortcomings, such as low precision solution, slow searching speed and easy convergence to the local minimum points. To overcome this problem, a novel method which integrates Back Propagation neural network (BP NN) and Ant Colony Algorithm(ACA) is proposed in this paper. ACA has the advantages such as positive feedback, distributed computation and using a constructive greedy heuristic. In this paper, ACA is used to train the weights and the thresholds of BP NN, so the searching speed and the precision can be improved. An case study is given. The result shows that the proposed method improves the training efficiency and the fault classification accuracy.
{"title":"The Fault Diagnosis of Garbage Crusher Based on Ant Colony Algorithm and Neural Network","authors":"Xuemei Li, Cong Li, Meifa Huang, H. Jing","doi":"10.1109/WGEC.2009.165","DOIUrl":"https://doi.org/10.1109/WGEC.2009.165","url":null,"abstract":"The garbage crusher is one of the important parts in recoverable coal production line. To diagnose its faults during the working process, Back Propagation algorithm is used. However, it has some shortcomings, such as low precision solution, slow searching speed and easy convergence to the local minimum points. To overcome this problem, a novel method which integrates Back Propagation neural network (BP NN) and Ant Colony Algorithm(ACA) is proposed in this paper. ACA has the advantages such as positive feedback, distributed computation and using a constructive greedy heuristic. In this paper, ACA is used to train the weights and the thresholds of BP NN, so the searching speed and the precision can be improved. An case study is given. The result shows that the proposed method improves the training efficiency and the fault classification accuracy.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129570503","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}
Through some examples, a new problem of the incomplete information in probability is advanced and analyzed, and the distinctness of the problem and other problems is analyzed. The algorithm to enhance completeness of information is given. The algorithm is validated at a certain extent, and other possible algorithms are eliminated.
{"title":"Information Fusion Algorithm Enhancing Information Completeness","authors":"Yong Wang, Huadeng Wang, Jinxiang Huang","doi":"10.1109/WGEC.2009.141","DOIUrl":"https://doi.org/10.1109/WGEC.2009.141","url":null,"abstract":"Through some examples, a new problem of the incomplete information in probability is advanced and analyzed, and the distinctness of the problem and other problems is analyzed. The algorithm to enhance completeness of information is given. The algorithm is validated at a certain extent, and other possible algorithms are eliminated.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129094854","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 singular points of a fingerprint image contain important information, so it is very significant to detect the position, number and type of singular points. The Poincare Index method can’t accurately detect the singular points in arch fingerprints and some tented arch fingerprints. To resolve the problem, we propose an improvement of the Poincare Index method. The experimental results show that our method is better than the Poincare Index method.
{"title":"A New Algorithm for Detecting Singular Points in Fingerprint Images","authors":"Xin-Ming Cheng, Cheng Xu, Dong-Cheng Xu","doi":"10.1109/WGEC.2009.71","DOIUrl":"https://doi.org/10.1109/WGEC.2009.71","url":null,"abstract":"The singular points of a fingerprint image contain important information, so it is very significant to detect the position, number and type of singular points. The Poincare Index method can’t accurately detect the singular points in arch fingerprints and some tented arch fingerprints. To resolve the problem, we propose an improvement of the Poincare Index method. The experimental results show that our method is better than the Poincare Index method.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122360184","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
扫码关注我们
求助内容：
应助结果提醒方式：