International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications最新文献
Pub Date : 2011-07-26DOI: 10.1109/ICNC.2011.6022395
Wenwen Li, Wuneng Zhou
The node localization of wireless sensor network (WSN) is an important technical. In this paper, an algorithm on the node location of WSN combing with the genetic algorithm is proposed. The simulation result shows that the proposed algorithm is able to determine the accurate position of the unknown nodes currently. And then comparing to the DV-HOP, the proposed algorithm has lower error which is also verified by the simulation.
{"title":"Genetic algorithm-base localization algorithm for wireless sensor networks","authors":"Wenwen Li, Wuneng Zhou","doi":"10.1109/ICNC.2011.6022395","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022395","url":null,"abstract":"The node localization of wireless sensor network (WSN) is an important technical. In this paper, an algorithm on the node location of WSN combing with the genetic algorithm is proposed. The simulation result shows that the proposed algorithm is able to determine the accurate position of the unknown nodes currently. And then comparing to the DV-HOP, the proposed algorithm has lower error which is also verified by the simulation.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"44 1","pages":"2096-2099"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74180468","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}
Pub Date : 2011-07-26DOI: 10.1109/ICNC.2011.6022145
Dongfeng Yan, Qiuling Zhang, Jiarong Huang
Taking the investigated data from 40 samples plots of natural secondary oak stand in Baotianman natural reserve for the research object, BP-ANN model was created by using relative diameter of tree as the input variable, and accumulated frequency of tree number as output variable. Through training and optimal seeking by the software of MATLAB, the idea network model was created. In the performance analysis of 7 models of main tree species, the fitting accuracy is 96.92% to 100%; in the test analysis of the created model by not used data, the test accuracy is 97.95%; and in the X2 test, the fitting effect is remarkable. The results indicated that ANN method is a more effective way to model diameter distribution of natural secondary oak stand.
{"title":"Studying diameter distribution of natural secondary stand based on artificial neural network","authors":"Dongfeng Yan, Qiuling Zhang, Jiarong Huang","doi":"10.1109/ICNC.2011.6022145","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022145","url":null,"abstract":"Taking the investigated data from 40 samples plots of natural secondary oak stand in Baotianman natural reserve for the research object, BP-ANN model was created by using relative diameter of tree as the input variable, and accumulated frequency of tree number as output variable. Through training and optimal seeking by the software of MATLAB, the idea network model was created. In the performance analysis of 7 models of main tree species, the fitting accuracy is 96.92% to 100%; in the test analysis of the created model by not used data, the test accuracy is 97.95%; and in the X2 test, the fitting effect is remarkable. The results indicated that ANN method is a more effective way to model diameter distribution of natural secondary oak stand.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"8 1","pages":"848-851"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84368818","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}
Pub Date : 2011-07-26DOI: 10.1109/ICNC.2011.6022117
Guoliang Cai, H. Shao, Qin Yao
In this paper, an adaptive procedure to the problem of global synchronization of nonlinearly coupled chaotic neural networks with time-varying delay is introduced by combining the adaptive control and pinning control methods, especially, the parameters of this paper are very few, which is different from other papers and easily applied to practical. Sufficient conditions for global synchronization are obtained by applying suitable feedback or adaptive feedback controllers to certain selected nodes.
{"title":"Global synchronization of delayed chaotic neural networks","authors":"Guoliang Cai, H. Shao, Qin Yao","doi":"10.1109/ICNC.2011.6022117","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022117","url":null,"abstract":"In this paper, an adaptive procedure to the problem of global synchronization of nonlinearly coupled chaotic neural networks with time-varying delay is introduced by combining the adaptive control and pinning control methods, especially, the parameters of this paper are very few, which is different from other papers and easily applied to practical. Sufficient conditions for global synchronization are obtained by applying suitable feedback or adaptive feedback controllers to certain selected nodes.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"186 2 1","pages":"358-361"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81072177","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}
Pub Date : 2011-07-26DOI: 10.1109/ICNC.2011.6022142
J. Kang, Baiben Chen, Wei Wang
Traffic analysis and prediction is one of the core contents in the feasibility study of highway construction project [1]. It has the vital significance to the highway construction and road networks development. The traditional traffic volume prediction, as four steps prediction method [2] represented, have many uncertain factors to make the deviation between final forecast results and actual situation is larger, and unable to achieve the expected effect. This paper takes that reducing the errors of the indefinite factors influencing the results as a starting point, improves the standard BP neural network [3] to solve the problems appearing in training, and puts it into the traffic volume prediction model which applied in engineering instances. Forecasting results show that this method predicts accurately and efficiently, and achieves the purpose of reducing prediction errors.
{"title":"The application and research in reducing the errors of traditional traffic volume prediction using an improved BP neural network","authors":"J. Kang, Baiben Chen, Wei Wang","doi":"10.1109/ICNC.2011.6022142","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022142","url":null,"abstract":"Traffic analysis and prediction is one of the core contents in the feasibility study of highway construction project [1]. It has the vital significance to the highway construction and road networks development. The traditional traffic volume prediction, as four steps prediction method [2] represented, have many uncertain factors to make the deviation between final forecast results and actual situation is larger, and unable to achieve the expected effect. This paper takes that reducing the errors of the indefinite factors influencing the results as a starting point, improves the standard BP neural network [3] to solve the problems appearing in training, and puts it into the traffic volume prediction model which applied in engineering instances. Forecasting results show that this method predicts accurately and efficiently, and achieves the purpose of reducing prediction errors.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"93 4","pages":"852-856"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/ICNC.2011.6022142","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72452203","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}
Pub Date : 2011-07-26DOI: 10.1109/ICNC.2011.6022242
Wei Li, Zhao Xie
Motivating from biological visual cues in the cortex, by simulating visual information processing and transmission mechanism in the human brain, and using Bayesian network to design object perception model in the visual cortex, this paper proposed an object perception model based on Bayesian network. First, extracted shape feature, color feature, texture feature of the given images; Second, normalized these features and inputed them all to Bayesian network for inference and learning; Third, carried out two experiments to test the validity and reliability of the proposed model. Experiment results shown that the proposed model is reasonable and robust, can integrate all possible information and combine varieties of evidence to implement uncertainty inference, can solve problems with uncertainty and incomplete effectively. The proposed model achieved better recognition performance on the given experimental image datasets, obtained a higher recognition accuracy compared with other methods, and better solved various of recognition difficulties in visual object recognition.
{"title":"Object perception model in visual cortex based on Bayesian network","authors":"Wei Li, Zhao Xie","doi":"10.1109/ICNC.2011.6022242","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022242","url":null,"abstract":"Motivating from biological visual cues in the cortex, by simulating visual information processing and transmission mechanism in the human brain, and using Bayesian network to design object perception model in the visual cortex, this paper proposed an object perception model based on Bayesian network. First, extracted shape feature, color feature, texture feature of the given images; Second, normalized these features and inputed them all to Bayesian network for inference and learning; Third, carried out two experiments to test the validity and reliability of the proposed model. Experiment results shown that the proposed model is reasonable and robust, can integrate all possible information and combine varieties of evidence to implement uncertainty inference, can solve problems with uncertainty and incomplete effectively. The proposed model achieved better recognition performance on the given experimental image datasets, obtained a higher recognition accuracy compared with other methods, and better solved various of recognition difficulties in visual object recognition.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"118 1","pages":"886-890"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78308990","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}
Pub Date : 2011-07-26DOI: 10.1109/ICNC.2011.6022218
Cuicui Zhang, Shujuan Ji, Yongquan Liang, X. Lv
The outputs of the BP neural network when used to generate fire rescue plan represent the amounts of various rescue resources which are generally called fire rescue plan. This paper assumes that the total losses the expected(i.e. the best) rescue plan causes is zero, and that the losses a rescue resource causes are mainly fire losses due to its shortage, resource waste losses due to its surplus or zero. The total losses of a rescue plan are the sum of the losses of all rescue resources. Because it is difficult to get the expected rescue plan, the purpose of the fire rescue plan generation algorithm based on BP neural network is to make the total losses of the obtained rescue plans as little as possible. This paper first analyzes the characteristics of the traditional BP neural network and concludes that it can't guarantee the total losses of a rescue plan as little as possible. Therefore, this paper puts forward an improved BP neural network to generate rescue plan. Experimental results show that the improvement can realize the purpose of decreasing the total losses to the lowest point.
{"title":"A fire rescue plan generation algorithm based on BP neural network","authors":"Cuicui Zhang, Shujuan Ji, Yongquan Liang, X. Lv","doi":"10.1109/ICNC.2011.6022218","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022218","url":null,"abstract":"The outputs of the BP neural network when used to generate fire rescue plan represent the amounts of various rescue resources which are generally called fire rescue plan. This paper assumes that the total losses the expected(i.e. the best) rescue plan causes is zero, and that the losses a rescue resource causes are mainly fire losses due to its shortage, resource waste losses due to its surplus or zero. The total losses of a rescue plan are the sum of the losses of all rescue resources. Because it is difficult to get the expected rescue plan, the purpose of the fire rescue plan generation algorithm based on BP neural network is to make the total losses of the obtained rescue plans as little as possible. This paper first analyzes the characteristics of the traditional BP neural network and concludes that it can't guarantee the total losses of a rescue plan as little as possible. Therefore, this paper puts forward an improved BP neural network to generate rescue plan. Experimental results show that the improvement can realize the purpose of decreasing the total losses to the lowest point.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"1 1","pages":"716-719"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81878230","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}
Pub Date : 2011-07-26DOI: 10.1109/ICNC.2011.6022514
T. Fei, H. Ren, Liyi Zhang, Jin Zhang, Qian Li
After disasters the emergency logistics distribution path selection problem is the key to the ways to ensure relief work go on wheels. In this article, MAX-MIN ant colony algorithm is used to solve the problem about post-disaster emergency logistics distribution path selection so that the emergency relief supplies will be sending to the disaster area more efficiently. The MAX - MIN ant colony algorithm, which has been proved by simulation, possesses advantage on solving the problem about post-disaster emergency logistics distribution path selection.
{"title":"The research about emergency logistics path optimization based on MAX - MIN ant colony algorithm","authors":"T. Fei, H. Ren, Liyi Zhang, Jin Zhang, Qian Li","doi":"10.1109/ICNC.2011.6022514","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022514","url":null,"abstract":"After disasters the emergency logistics distribution path selection problem is the key to the ways to ensure relief work go on wheels. In this article, MAX-MIN ant colony algorithm is used to solve the problem about post-disaster emergency logistics distribution path selection so that the emergency relief supplies will be sending to the disaster area more efficiently. The MAX - MIN ant colony algorithm, which has been proved by simulation, possesses advantage on solving the problem about post-disaster emergency logistics distribution path selection.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"102 1","pages":"1211-1215"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76874800","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}
Pub Date : 2011-07-26DOI: 10.1109/ICNC.2011.6021915
Li Yanmei, Q. Xiaokun, Jiang Zhenzhen
A new method to objectively evaluate seam pucker is brought out in this paper. Firstly, AATCC 88B seam pucker standard pictures are taken by digital camera. After wavelet transform of images, the six parameters that are standard deviation of horizontal, vertical and diagonal detail coefficients on 5th dimension, horizontal detail coefficients and histogram and image entropy are extracted, on 4th are extracted. Then, objective evaluation model of seam pucker based on probabilistic neural network is constructed and its prediction accuracy is more than 90% by test. This prediction model can be used to evaluate seam pucker grades of unknown samples, so that to overcome ambiguity and uncertainty of subjective evaluation.
{"title":"Study on objective evaluation of seam pucker based on wavelet probabilistic neural network","authors":"Li Yanmei, Q. Xiaokun, Jiang Zhenzhen","doi":"10.1109/ICNC.2011.6021915","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6021915","url":null,"abstract":"A new method to objectively evaluate seam pucker is brought out in this paper. Firstly, AATCC 88B seam pucker standard pictures are taken by digital camera. After wavelet transform of images, the six parameters that are standard deviation of horizontal, vertical and diagonal detail coefficients on 5th dimension, horizontal detail coefficients and histogram and image entropy are extracted, on 4th are extracted. Then, objective evaluation model of seam pucker based on probabilistic neural network is constructed and its prediction accuracy is more than 90% by test. This prediction model can be used to evaluate seam pucker grades of unknown samples, so that to overcome ambiguity and uncertainty of subjective evaluation.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"88 1","pages":"259-262"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83063133","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}
Pub Date : 2011-07-26DOI: 10.1109/ICNC.2011.6022231
Ji Changming, Yu Shan, Zhao Bikui, Zhang Yan-ke, Yang Zijun
Comparing to traditional operation chart, the accurate dispatching function, as a way of guiding hydropower reservoir operation, can develop much more benefit. In allusion to the characteristics of dispatching function compilation and its insufficiency, an optimization model for dispatching function based on ant colony optimization is established and specifically analyzed in this article. Through calculation and analysis within a case, it is showed that, with the optimized dispatching function, the operation efficiency has greatly improved, which fully manifests the effectiveness and feasibility of this model, providing a new thought of the optimal operation for hydropower reservoirs and also an effective guiding way for actual scheduling.
{"title":"The optimization of dispatching function based on ant colony optimization","authors":"Ji Changming, Yu Shan, Zhao Bikui, Zhang Yan-ke, Yang Zijun","doi":"10.1109/ICNC.2011.6022231","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022231","url":null,"abstract":"Comparing to traditional operation chart, the accurate dispatching function, as a way of guiding hydropower reservoir operation, can develop much more benefit. In allusion to the characteristics of dispatching function compilation and its insufficiency, an optimization model for dispatching function based on ant colony optimization is established and specifically analyzed in this article. Through calculation and analysis within a case, it is showed that, with the optimized dispatching function, the operation efficiency has greatly improved, which fully manifests the effectiveness and feasibility of this model, providing a new thought of the optimal operation for hydropower reservoirs and also an effective guiding way for actual scheduling.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"51 1","pages":"1207-1210"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80898639","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}
Pub Date : 2011-07-26DOI: 10.1109/ICNC.2011.6022556
W. Tan, Xiangping Meng, Hui Wang, Liang Zhao
Circulating cooling water system of large heavy industry had the problem that many pumps of regulating speed operate in higher energy consumption and lower efficiency. The paper analyzed the characteristic of variable speed water pump around the problem. The mathematics model was established with the optimization goal of the lowest energy consumption, which was on the basis of Particle Swarm Optimization and frequency speed control technology, and it simplified inequality constraint condition. It avoided the difficulty of the premature convergence of genetic algorithm through using PSO and improves the global search ability of the algorithm. Simulation results show that it is an effective algorithm to solving optimal problem of many pumps of speed-frequency control in water circulating system.
{"title":"The operating study of circulating water system based on Particle Swarm Optimization","authors":"W. Tan, Xiangping Meng, Hui Wang, Liang Zhao","doi":"10.1109/ICNC.2011.6022556","DOIUrl":"https://doi.org/10.1109/ICNC.2011.6022556","url":null,"abstract":"Circulating cooling water system of large heavy industry had the problem that many pumps of regulating speed operate in higher energy consumption and lower efficiency. The paper analyzed the characteristic of variable speed water pump around the problem. The mathematics model was established with the optimization goal of the lowest energy consumption, which was on the basis of Particle Swarm Optimization and frequency speed control technology, and it simplified inequality constraint condition. It avoided the difficulty of the premature convergence of genetic algorithm through using PSO and improves the global search ability of the algorithm. Simulation results show that it is an effective algorithm to solving optimal problem of many pumps of speed-frequency control in water circulating system.","PeriodicalId":87274,"journal":{"name":"International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications","volume":"96 1","pages":"2317-2321"},"PeriodicalIF":0.0,"publicationDate":"2011-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82224218","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}
International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：