The rapid development of modern VLSI technology allows incorporating a complete system on a single chip using the system-on-chip (SOC) methodology. Test scheduling solution for SOC embedded IP cores is a very complex problem. It is necessary to test these cores in parallel for reducing test time. This paper presents an efficient approach based on particle swarm optimization (PSO) algorithm for the test scheduling problem of core-based SOCs with power constraint. PSO algorithm is improved on so that the algorithm can be used to optimize SOC testing. The cores are assigned to test access mechanism (TAM) of given widths such that the total test time is minimized. Experimental results for ITC’02 benchmarks demonstrate that the method has better performance and lower testing time compared to other heuristic algorithms in test scheduling of SOC.
{"title":"Test Scheduling of SOC with Power Constraint Based on Particle Swarm Optimization Algorithm","authors":"Chuan-pei Xu, Hong-bo Hu, Junhao Niu","doi":"10.1109/WGEC.2009.61","DOIUrl":"https://doi.org/10.1109/WGEC.2009.61","url":null,"abstract":"The rapid development of modern VLSI technology allows incorporating a complete system on a single chip using the system-on-chip (SOC) methodology. Test scheduling solution for SOC embedded IP cores is a very complex problem. It is necessary to test these cores in parallel for reducing test time. This paper presents an efficient approach based on particle swarm optimization (PSO) algorithm for the test scheduling problem of core-based SOCs with power constraint. PSO algorithm is improved on so that the algorithm can be used to optimize SOC testing. The cores are assigned to test access mechanism (TAM) of given widths such that the total test time is minimized. Experimental results for ITC’02 benchmarks demonstrate that the method has better performance and lower testing time compared to other heuristic algorithms in test scheduling of SOC.","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":"129068147","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}
Aiming at the conflict between robustness and invisibility of video watermarking system, a new adaptive video watermarking based on decomposing of bit plane was proposed in this paper. The bit planes of watermark were embedded in different quantity of intermediate and low frequency DCT coefficients because of the different weights in the process of watermark reconstruction. Meanwhile, the embedding strength was adaptively adjusted depending on luminance masking of HVS (Human Visual System). Watermark was adaptively embedded in video. Experimental results show that the presented video watermark scheme was robust and highly transparent.
{"title":"An Adaptive Video Watermarking Based on Decomposing of Bit Planes","authors":"Zhigang Sun, Hua Jiang","doi":"10.1109/WGEC.2009.44","DOIUrl":"https://doi.org/10.1109/WGEC.2009.44","url":null,"abstract":"Aiming at the conflict between robustness and invisibility of video watermarking system, a new adaptive video watermarking based on decomposing of bit plane was proposed in this paper. The bit planes of watermark were embedded in different quantity of intermediate and low frequency DCT coefficients because of the different weights in the process of watermark reconstruction. Meanwhile, the embedding strength was adaptively adjusted depending on luminance masking of HVS (Human Visual System). Watermark was adaptively embedded in video. Experimental results show that the presented video watermark scheme was robust and highly transparent.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"63 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":"126882996","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}
This paper analyses the defect of the designing model of load balancing in hybrid P2P network, and proposes a new strategy of scheduling for load balancing, which based on culture algorithm of multilayer belief spaces. According to the current load status of each super-node in the system, it can calculate its load weight of the next time section by using the cultural algorithm, and assign the current requests of login with weighted round-robin. The extracted knowledge which is got by selecting the best belief space from the multilayer belief space is used to optimize the constrains of the evolutionary, in order to accelerate the optimization process of the calculation of load weight. Simulation experiments show that the allocation of login request to each node is to be balance much faster through using of cultural algorithm based on multilayer belief spaces.
{"title":"The Application of Cultural Algorithm in Load Balancing of Hybrid P2P Network","authors":"Xiaodong Fu, Jing Zhang","doi":"10.1109/WGEC.2009.155","DOIUrl":"https://doi.org/10.1109/WGEC.2009.155","url":null,"abstract":"This paper analyses the defect of the designing model of load balancing in hybrid P2P network, and proposes a new strategy of scheduling for load balancing, which based on culture algorithm of multilayer belief spaces. According to the current load status of each super-node in the system, it can calculate its load weight of the next time section by using the cultural algorithm, and assign the current requests of login with weighted round-robin. The extracted knowledge which is got by selecting the best belief space from the multilayer belief space is used to optimize the constrains of the evolutionary, in order to accelerate the optimization process of the calculation of load weight. Simulation experiments show that the allocation of login request to each node is to be balance much faster through using of cultural algorithm based on multilayer belief spaces.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"16 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":"126900912","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}
Particle swarm optimization (PSO) is a good optimization algorithm, but it always premature convergence to local optimization, especially in some complex issues like optimization of high-dimensional function. In this paper, a particle swarm optimization based on chaotic neighborhood search (PSOCNS) is proposed. When the sign of premature convergence is arise, search each small area which is defined of all particles by chaotic search, then jump out of local optimization, and avoid premature convergence. Finally, the experiment results demonstrate that the PSOCNS proposed is better than the basic particle swarm optimization algorithm in the aspects of convergence and stability.
{"title":"A Particle Swarm Optimization Based on Chaotic Neighborhood Search to Avoid Premature Convergence","authors":"Wei Wang, Jin-mu Wu, Jie Liu","doi":"10.1109/WGEC.2009.168","DOIUrl":"https://doi.org/10.1109/WGEC.2009.168","url":null,"abstract":"Particle swarm optimization (PSO) is a good optimization algorithm, but it always premature convergence to local optimization, especially in some complex issues like optimization of high-dimensional function. In this paper, a particle swarm optimization based on chaotic neighborhood search (PSOCNS) is proposed. When the sign of premature convergence is arise, search each small area which is defined of all particles by chaotic search, then jump out of local optimization, and avoid premature convergence. Finally, the experiment results demonstrate that the PSOCNS proposed is better than the basic particle swarm optimization algorithm in the aspects of convergence and stability.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"19 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":"127695660","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}
Yong-hou Sun, Jia-ding Bao, M. Huang, Qiao-yi Wang, Xiang-qian Li
The evaluation of measurement uncertainty is an important part of the new generation geometric products specifications (GPS). At present, coordinate measurement only give examine result of plane to plane parallelism, and fail to give uncertainty problem of examine result. According to basic principle of two planes least-square verification and ISO/ TS 14253 – 2 to give transfer formula of uncertainty, combined with evaluation and simplification of synthesis uncertainty, the paper put forwards a kind of uncertainty calculate method of two planes parallel coordinate measurement. The experiment show that the two planes parallelism certification based on the proposed method can meet the requirement of the new generation GPS standard, and the certification result is standard and reliability
{"title":"Uncertainty Calculate of Plane to Plane Parallelism Based on New Generation GPS","authors":"Yong-hou Sun, Jia-ding Bao, M. Huang, Qiao-yi Wang, Xiang-qian Li","doi":"10.1109/WGEC.2009.124","DOIUrl":"https://doi.org/10.1109/WGEC.2009.124","url":null,"abstract":"The evaluation of measurement uncertainty is an important part of the new generation geometric products specifications (GPS). At present, coordinate measurement only give examine result of plane to plane parallelism, and fail to give uncertainty problem of examine result. According to basic principle of two planes least-square verification and ISO/ TS 14253 – 2 to give transfer formula of uncertainty, combined with evaluation and simplification of synthesis uncertainty, the paper put forwards a kind of uncertainty calculate method of two planes parallel coordinate measurement. The experiment show that the two planes parallelism certification based on the proposed method can meet the requirement of the new generation GPS standard, and the certification result is standard and reliability","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"23 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":"126259406","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 direct torque control (DTC) of induction motor, the performance of system is influenced by the given value of torque. The given torque is the output of speed regulator. And PID adjustor is used generally as the speed regulator, so the selection of PID parameters is crucial to DTC system. In this paper, a new optimal control strategy of DTC based-on genetic algorithm (GA) for induction motor is presented. In this method, GA is used to optimize the PID parameters of speed regulator, so the precision of given torque is improved, and the dynamic response of torque is more satisfying than traditional DTC. The results of simulation indicate the validity of this method.
{"title":"An Optimal Controller Based-on GA for Direct Torque Control","authors":"Feng Pan, Ru-cheng Han, Runsheng Zhang","doi":"10.1109/WGEC.2009.59","DOIUrl":"https://doi.org/10.1109/WGEC.2009.59","url":null,"abstract":"In direct torque control (DTC) of induction motor, the performance of system is influenced by the given value of torque. The given torque is the output of speed regulator. And PID adjustor is used generally as the speed regulator, so the selection of PID parameters is crucial to DTC system. In this paper, a new optimal control strategy of DTC based-on genetic algorithm (GA) for induction motor is presented. In this method, GA is used to optimize the PID parameters of speed regulator, so the precision of given torque is improved, and the dynamic response of torque is more satisfying than traditional DTC. The results of simulation indicate the validity of this method.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"53 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":"126002634","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, a Clonal Selection Algorithm for the Open Vehicle Routing Problem¿OVRP¿is presented, in which a new definition of antibodies’ affinity and algorithm of keeping antibodies’ diversity are introduced. Computational results on a set of benchmark problems are provided. Comparison with the best ones in literature shows that the Clonal Selection Algorithm is efficient.
{"title":"A Clone Selection Algorithm for the Open Vehicle Routing Problem","authors":"L. Pan, Z. Fu","doi":"10.1109/WGEC.2009.174","DOIUrl":"https://doi.org/10.1109/WGEC.2009.174","url":null,"abstract":"In this paper, a Clonal Selection Algorithm for the Open Vehicle Routing Problem¿OVRP¿is presented, in which a new definition of antibodies’ affinity and algorithm of keeping antibodies’ diversity are introduced. Computational results on a set of benchmark problems are provided. Comparison with the best ones in literature shows that the Clonal Selection Algorithm is efficient.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"3 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":"127986000","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}
Mobility model is the foundation of the simulation study of various protocols in the Mobile Ad-Hoc Network (MANET). The entity mobility model is a family of mobility models widely used in the study. A comparative study on entity mobility models is presented in this paper. Firstly, both the advantages and disadvantages of four typical entity mobility models are summarized; these models include the Random Walk model (RW), the Random WayPoint model (RWP), the Random Direction model (RD) and the Markov Random Path model (MRP). Secondly, focus on primary parameters of these models, effects of both the speed and the pause time on the performance metric of MANET routing protocols are analyzed. Finally, with the help of the NS-2 simulator, the effect of different entity mobility models on the performance of MANET routing protocols are analyzed. This study is significant in practice for the simulation study of MANET as well as for the design and improvement of mobility models.
{"title":"Analyzing the Impact of Entity Mobility Models on the Performance of Routing Protocols in the MANET","authors":"Tieyuan Liu, Liang Chang, T. Gu","doi":"10.1109/WGEC.2009.200","DOIUrl":"https://doi.org/10.1109/WGEC.2009.200","url":null,"abstract":"Mobility model is the foundation of the simulation study of various protocols in the Mobile Ad-Hoc Network (MANET). The entity mobility model is a family of mobility models widely used in the study. A comparative study on entity mobility models is presented in this paper. Firstly, both the advantages and disadvantages of four typical entity mobility models are summarized; these models include the Random Walk model (RW), the Random WayPoint model (RWP), the Random Direction model (RD) and the Markov Random Path model (MRP). Secondly, focus on primary parameters of these models, effects of both the speed and the pause time on the performance metric of MANET routing protocols are analyzed. Finally, with the help of the NS-2 simulator, the effect of different entity mobility models on the performance of MANET routing protocols are analyzed. This study is significant in practice for the simulation study of MANET as well as for the design and improvement of mobility models.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"97 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":"133910398","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}
This paper expounds three kinds of grey neural network combined model for short-term prediction of urban traffic speed, and confirms their validity and feasibility by conducting experiment in Beijing road of Jingzhou. Three kinds of networks are parallel grey neural network, series grey neural network, and inlaid grey neural network. The experiment proves that the three kinds of modes are feasible and effective in comparison with single model GM(1,1) and neural network. And actual traffic speed varies smoothly or will not influence significantly the accuracy for prediction.
{"title":"Short-term Traffic Prediction Model Based on Grey Neural Network","authors":"Qiongqin Jiang, Zhigang Liu, Youfu Du","doi":"10.1109/WGEC.2009.159","DOIUrl":"https://doi.org/10.1109/WGEC.2009.159","url":null,"abstract":"This paper expounds three kinds of grey neural network combined model for short-term prediction of urban traffic speed, and confirms their validity and feasibility by conducting experiment in Beijing road of Jingzhou. Three kinds of networks are parallel grey neural network, series grey neural network, and inlaid grey neural network. The experiment proves that the three kinds of modes are feasible and effective in comparison with single model GM(1,1) and neural network. And actual traffic speed varies smoothly or will not influence significantly the accuracy for prediction.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"7 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":"130964844","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}
Based on the specific features of advertisement robot widely existing in network information, a mixture strategy for network content filtering is presented in this paper. The strategy can determine quickly by calculating the fingerprint of network content, and Bayesian filtering is reused when the strategy can not determine. The result of this experiment shows that the strategy is more advanced than the sole Bayesian method in improving system running efficiency and finding out the phenomenon of advertisement robot.
{"title":"Research on Network Content Audit Based on Information Fingerprint","authors":"Tonglai Liu, Hua Jiang, Wanzhen Zhang","doi":"10.1109/WGEC.2009.50","DOIUrl":"https://doi.org/10.1109/WGEC.2009.50","url":null,"abstract":"Based on the specific features of advertisement robot widely existing in network information, a mixture strategy for network content filtering is presented in this paper. The strategy can determine quickly by calculating the fingerprint of network content, and Bayesian filtering is reused when the strategy can not determine. The result of this experiment shows that the strategy is more advanced than the sole Bayesian method in improving system running efficiency and finding out the phenomenon of advertisement robot.","PeriodicalId":277950,"journal":{"name":"2009 Third International Conference on Genetic and Evolutionary Computing","volume":"44 3 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":"132764984","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
扫码关注我们
求助内容：
应助结果提醒方式：