Pub Date : 2012-05-29DOI: 10.1109/ICNC.2012.6234655
Qiwen Yang, Yan Liu, S. Wang, Yunchan Xue
Locating the neighborhood of global optimum (NGO) is critical for global optimization. For this purpose, the relationship between the barycenter and the global maximum is investigated in this paper. And a space transform technique is proposed such that the barycenter of the transformed space is more close to NGO. Consequently, NGO can be readily located by means of estimating the barycenter of search space. The validity of the proposed method is demonstrated by multimodal function optimization.
{"title":"A method to locate neighborhood of global optimum","authors":"Qiwen Yang, Yan Liu, S. Wang, Yunchan Xue","doi":"10.1109/ICNC.2012.6234655","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234655","url":null,"abstract":"Locating the neighborhood of global optimum (NGO) is critical for global optimization. For this purpose, the relationship between the barycenter and the global maximum is investigated in this paper. And a space transform technique is proposed such that the barycenter of the transformed space is more close to NGO. Consequently, NGO can be readily located by means of estimating the barycenter of search space. The validity of the proposed method is demonstrated by multimodal function optimization.","PeriodicalId":404981,"journal":{"name":"2012 8th International Conference on Natural Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116358105","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 : 2012-05-29DOI: 10.1109/ICNC.2012.6234695
Ruqing Chen
Standard particle swarm optimization (PSO) has the drawback of trapping into local minima easily when used for the optimization of high-dimension complex functions with a lot of local minima. In order to deal with the problem an improved PSO algorithm with crossover operator is developed. Better particles are selected in this algorithm, thus can avoid premature convergence to local optimum as well as accelerate the convergence speed. Four high-dimension complex benchmark functions are introduced to test this method. Simulation analysis shows that improved PSO algorithm has better capabilities in convergence accuracy and speed as well as its global search performance by comparison with normal PSO algorithms. Finally the improved PSO based neural network (NN) soft sensor model for ethylene yield is developed, results of the application in industrial process control show that this model has high prediction precision and good generalization ability, it can satisfy the need of spot measurement.
{"title":"Soft sensor modeling based on modified PSO","authors":"Ruqing Chen","doi":"10.1109/ICNC.2012.6234695","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234695","url":null,"abstract":"Standard particle swarm optimization (PSO) has the drawback of trapping into local minima easily when used for the optimization of high-dimension complex functions with a lot of local minima. In order to deal with the problem an improved PSO algorithm with crossover operator is developed. Better particles are selected in this algorithm, thus can avoid premature convergence to local optimum as well as accelerate the convergence speed. Four high-dimension complex benchmark functions are introduced to test this method. Simulation analysis shows that improved PSO algorithm has better capabilities in convergence accuracy and speed as well as its global search performance by comparison with normal PSO algorithms. Finally the improved PSO based neural network (NN) soft sensor model for ethylene yield is developed, results of the application in industrial process control show that this model has high prediction precision and good generalization ability, it can satisfy the need of spot measurement.","PeriodicalId":404981,"journal":{"name":"2012 8th International Conference on Natural Computation","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117328614","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 : 2012-05-29DOI: 10.1109/ICNC.2012.6234667
Shaojin Feng
In order to explore more efficient classification method, this paper presents a supervised classification algorithm based on artificial immune. It describes the representation of antibody and antigen in the classification algorithm, mathematical model of antibody population reproduction and immune memory formation. The experimental results show that the algorithm can achieve high classification performance. The average classification accuracy is 89.3%, stable classification performance. It has non-linear and clone selection, immune regulation, immune memory and other features of biological immune system, which provides a new solution for supervised classification problem.
{"title":"Supervised classification algorithms based on artificial immune","authors":"Shaojin Feng","doi":"10.1109/ICNC.2012.6234667","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234667","url":null,"abstract":"In order to explore more efficient classification method, this paper presents a supervised classification algorithm based on artificial immune. It describes the representation of antibody and antigen in the classification algorithm, mathematical model of antibody population reproduction and immune memory formation. The experimental results show that the algorithm can achieve high classification performance. The average classification accuracy is 89.3%, stable classification performance. It has non-linear and clone selection, immune regulation, immune memory and other features of biological immune system, which provides a new solution for supervised classification problem.","PeriodicalId":404981,"journal":{"name":"2012 8th International Conference on Natural Computation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127362555","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 : 2012-05-29DOI: 10.1109/ICNC.2012.6234506
P. He, Defei Zhang
In this paper, the asymmetric Nizhnik-Novikov-Vesselov equation is studied by using extended three-soliton method. The new exact solutions including discontinuous periodic wave solution, two-soliton wave solution, three solitary wave solution and smooth solitary wave solution for the asymmetric Nizhnik-Novikov-Vesselov equation are obtained. Their dynamic properties of some exact solutions are discussed and their profiles of these solutions are given by Maple.
{"title":"The three-wave method for the asymmetric Nizhnik-Novikov-Vesselov equation","authors":"P. He, Defei Zhang","doi":"10.1109/ICNC.2012.6234506","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234506","url":null,"abstract":"In this paper, the asymmetric Nizhnik-Novikov-Vesselov equation is studied by using extended three-soliton method. The new exact solutions including discontinuous periodic wave solution, two-soliton wave solution, three solitary wave solution and smooth solitary wave solution for the asymmetric Nizhnik-Novikov-Vesselov equation are obtained. Their dynamic properties of some exact solutions are discussed and their profiles of these solutions are given by Maple.","PeriodicalId":404981,"journal":{"name":"2012 8th International Conference on Natural Computation","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125931385","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 : 2012-05-29DOI: 10.1109/ICNC.2012.6234566
Hao Yue, Xu Zhang, C. Shao, Qi Li
A simulation of pedestrian evacuation from room with internal obstacles is presented based on an improved Dynamic Parameter Model (DPM) in the paper. In order to reduce evacuation imbalance caused by the asymmetry of obstacles layout, a special technology is introduced to compute the shortest estimated distance from anyone cell site to exits in room, which determines two basic dynamic parameter: direction-parameter and empty-parameter. Actual and imaginary distances are merged into the shortest estimated distance through considering the effects of pedestrian jam around obstacles on evacuation path selection. The pedestrian evacuation flows with single exit and multi-exit are simulated under different obstacles layouts from two aspects: with fixed and unfixed initialization site. It is observed that improved model can effectively reduce evacuation imbalance.
{"title":"Simulation of pedestrian evacuation from room with internal obstacles","authors":"Hao Yue, Xu Zhang, C. Shao, Qi Li","doi":"10.1109/ICNC.2012.6234566","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234566","url":null,"abstract":"A simulation of pedestrian evacuation from room with internal obstacles is presented based on an improved Dynamic Parameter Model (DPM) in the paper. In order to reduce evacuation imbalance caused by the asymmetry of obstacles layout, a special technology is introduced to compute the shortest estimated distance from anyone cell site to exits in room, which determines two basic dynamic parameter: direction-parameter and empty-parameter. Actual and imaginary distances are merged into the shortest estimated distance through considering the effects of pedestrian jam around obstacles on evacuation path selection. The pedestrian evacuation flows with single exit and multi-exit are simulated under different obstacles layouts from two aspects: with fixed and unfixed initialization site. It is observed that improved model can effectively reduce evacuation imbalance.","PeriodicalId":404981,"journal":{"name":"2012 8th International Conference on Natural Computation","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127473392","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 : 2012-05-29DOI: 10.1109/ICNC.2012.6234630
Sihong Zhou
The study focused on text-picture integration of the readers in magazine catalogue layout. Using eye tracking technique, 32 participants' eye movement were recorded when they were reading catalogue pages of scientific popular magazine. The catalogue page layout was operated form two dimension: separated vs. integrated and with key words vs. without key words. The results indicated that the format of with key words and integrated graphics, which is better than others. Its not only attract the readers' attention, but sustain the readers' interest and promote a longer and deeper processing of information.
{"title":"Text-picture integration of magazine catalogue layout: An eye movement study","authors":"Sihong Zhou","doi":"10.1109/ICNC.2012.6234630","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234630","url":null,"abstract":"The study focused on text-picture integration of the readers in magazine catalogue layout. Using eye tracking technique, 32 participants' eye movement were recorded when they were reading catalogue pages of scientific popular magazine. The catalogue page layout was operated form two dimension: separated vs. integrated and with key words vs. without key words. The results indicated that the format of with key words and integrated graphics, which is better than others. Its not only attract the readers' attention, but sustain the readers' interest and promote a longer and deeper processing of information.","PeriodicalId":404981,"journal":{"name":"2012 8th International Conference on Natural Computation","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124138579","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 : 2012-05-29DOI: 10.1109/ICNC.2012.6234617
Li Chen, Jianlin Qiu, Xiang Gu, Yang Pan, Yanyun Chen
Based on the analysis of logic optimization and task parallel allocation algorithm, combining with logic optimization features, we propose a new parallel processing algorithm for logic optimization scheduling and allocation. Considering the correlation between minimizers of each logic function, assign the logic associated with high correlation firstly, then with the size of the matrix. Through the studies of furnished example, the algorithm can be well in completing the logic scheduling.
{"title":"A task allocation algorithm for logic optimization parallel scheduling","authors":"Li Chen, Jianlin Qiu, Xiang Gu, Yang Pan, Yanyun Chen","doi":"10.1109/ICNC.2012.6234617","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234617","url":null,"abstract":"Based on the analysis of logic optimization and task parallel allocation algorithm, combining with logic optimization features, we propose a new parallel processing algorithm for logic optimization scheduling and allocation. Considering the correlation between minimizers of each logic function, assign the logic associated with high correlation firstly, then with the size of the matrix. Through the studies of furnished example, the algorithm can be well in completing the logic scheduling.","PeriodicalId":404981,"journal":{"name":"2012 8th International Conference on Natural Computation","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124274335","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 : 2012-05-29DOI: 10.1109/ICNC.2012.6234618
Feng Gao, Aimin Zhou, Guixu Zhang
The multiobjective evolutionary algorithm based on decomposition (MOEA/D) has gained much attention recently. It is suitable to use scalar objective optimization techniques for dealing with multiobjective optimization problems. In this paper, we propose a new approach, named multiobjective estimation of distribution algorithm based on decomposition (MEDA/D), which combines MOEA/D with probabilistic model based methods for multiobjective traveling salesman problems (MOTSPs). In MEDA/D, an MOTSP is decomposed into a set of scalar objective sub-problems and a probabilistic model, using both priori and learned information, is built to guide the search for each subproblem. By the cooperation of neighbor sub-problems, MEDA/D could optimize all the sub-problems simultaneously and thus find an approximation to the original MOTSP in a single run. The experimental results show that MEDA/D outperforms BicriterionAnt, an ant colony based method, on a set of test instances and MEDA/D is insensible to its control parameters.
{"title":"An estimation of distribution algorithm based on decomposition for the multiobjective TSP","authors":"Feng Gao, Aimin Zhou, Guixu Zhang","doi":"10.1109/ICNC.2012.6234618","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234618","url":null,"abstract":"The multiobjective evolutionary algorithm based on decomposition (MOEA/D) has gained much attention recently. It is suitable to use scalar objective optimization techniques for dealing with multiobjective optimization problems. In this paper, we propose a new approach, named multiobjective estimation of distribution algorithm based on decomposition (MEDA/D), which combines MOEA/D with probabilistic model based methods for multiobjective traveling salesman problems (MOTSPs). In MEDA/D, an MOTSP is decomposed into a set of scalar objective sub-problems and a probabilistic model, using both priori and learned information, is built to guide the search for each subproblem. By the cooperation of neighbor sub-problems, MEDA/D could optimize all the sub-problems simultaneously and thus find an approximation to the original MOTSP in a single run. The experimental results show that MEDA/D outperforms BicriterionAnt, an ant colony based method, on a set of test instances and MEDA/D is insensible to its control parameters.","PeriodicalId":404981,"journal":{"name":"2012 8th International Conference on Natural Computation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123433569","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 : 2012-05-29DOI: 10.1109/ICNC.2012.6234717
Jiang Li, Kenichi Takahashi, H. Tamukoh, M. Sekine
We propose an FPGA Array structure that is designed to the scalable structure for executing brain processes and numerical computation for 3-D problem, and the circuits in FPGA Array are controlled from the application program running in host PC directly. Many circuits for brain processes are designed to evaluate the 3-D FPGA, also we implement arithmetic circuits that calculate 2D Poisson equation by the finite difference method to shows numerical computation performance. We also show the results of circuits for the brain processes such as voice recognition, voice synthesis, and image recognition with Self Organizing Map. We estimate the gate count of the circuit for practical brain processes.
{"title":"2D/3D FPGA array for brain process and numerical computation","authors":"Jiang Li, Kenichi Takahashi, H. Tamukoh, M. Sekine","doi":"10.1109/ICNC.2012.6234717","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234717","url":null,"abstract":"We propose an FPGA Array structure that is designed to the scalable structure for executing brain processes and numerical computation for 3-D problem, and the circuits in FPGA Array are controlled from the application program running in host PC directly. Many circuits for brain processes are designed to evaluate the 3-D FPGA, also we implement arithmetic circuits that calculate 2D Poisson equation by the finite difference method to shows numerical computation performance. We also show the results of circuits for the brain processes such as voice recognition, voice synthesis, and image recognition with Self Organizing Map. We estimate the gate count of the circuit for practical brain processes.","PeriodicalId":404981,"journal":{"name":"2012 8th International Conference on Natural Computation","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123623134","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 : 2012-05-29DOI: 10.1109/ICNC.2012.6234538
Ping Guo, Lin Zhu
The ant colony algorithm has been successfully used to solve discrete problems. However, its discrete nature restricts applications to the continuous domains. In this paper, we introduce two methods of ACO for solving continuous domains. The first method references the thought of ACO in discrete space and need to divide continuous space into several regions and the pheromone is assigned on each region discrete, the ants depend on the pheromone to construct the path and find the solution finally. Compared with the first method, the second one which the distribution of pheromone in definition domain is simulated with normal distribution has essential difference to the first one. In order to improve the solving ability of those two algorithms, the pattern search method will be used. Experimental results on a set of test functions show that those two algorithms can obtain the solution in continuous domains well.
{"title":"Ant colony optimization for continuous domains","authors":"Ping Guo, Lin Zhu","doi":"10.1109/ICNC.2012.6234538","DOIUrl":"https://doi.org/10.1109/ICNC.2012.6234538","url":null,"abstract":"The ant colony algorithm has been successfully used to solve discrete problems. However, its discrete nature restricts applications to the continuous domains. In this paper, we introduce two methods of ACO for solving continuous domains. The first method references the thought of ACO in discrete space and need to divide continuous space into several regions and the pheromone is assigned on each region discrete, the ants depend on the pheromone to construct the path and find the solution finally. Compared with the first method, the second one which the distribution of pheromone in definition domain is simulated with normal distribution has essential difference to the first one. In order to improve the solving ability of those two algorithms, the pattern search method will be used. Experimental results on a set of test functions show that those two algorithms can obtain the solution in continuous domains well.","PeriodicalId":404981,"journal":{"name":"2012 8th International Conference on Natural Computation","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121563223","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
扫码关注我们
求助内容：
应助结果提醒方式：