The stability of neural networks is not only the most basic and important problem but also the foundation of some neural network's applications. In this paper, the stability of discrete delayed Hopfield neural networks is mainly investigated by constructing Lyapunov function and taking some inequality techniques into account. The sufficient conditions for discrete delayed Hopfield neural networks converging towards a limit cycle with 4-period are given. Also, some conditions for discrete delayed Hopfield neural networks neither having a stable state nor a limit cycle with 2-period are obtained. The obtained results here extend and improve some previously established results on the stability of discrete Hopfield neural network and the stability of discrete delayed Hopfield neural network in the literature.
{"title":"Stability Conditions for Discrete Delayed Hopfield Neural Networks","authors":"Runnian Ma, Peng Chu, Shengrui Zhang","doi":"10.1109/ICNC.2007.679","DOIUrl":"https://doi.org/10.1109/ICNC.2007.679","url":null,"abstract":"The stability of neural networks is not only the most basic and important problem but also the foundation of some neural network's applications. In this paper, the stability of discrete delayed Hopfield neural networks is mainly investigated by constructing Lyapunov function and taking some inequality techniques into account. The sufficient conditions for discrete delayed Hopfield neural networks converging towards a limit cycle with 4-period are given. Also, some conditions for discrete delayed Hopfield neural networks neither having a stable state nor a limit cycle with 2-period are obtained. The obtained results here extend and improve some previously established results on the stability of discrete Hopfield neural network and the stability of discrete delayed Hopfield neural network in the literature.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133868811","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}
Although the representation methods of the quadtree for the multi-valued image have many important applications in different fields, they put too much emphasis upon the symmetry of image segmentation. Therefore, they are not the optimal representation methods. In this paper, inspired by the concept of the packing problem, we present a novel algorithm of binary-bit plane decomposition based on the non-symmetry and anti-packing pattern representation model (BPD-based NAM) for the multi-valued image representation. The theoretical analyses and experimental results presented in this paper show that when the algorithm of BPD-based NAM is compared with that of the popular quadtree, the former can reduce the data storage much more effectively than the latter and it is a better method to represent the multi-valued image. This novel algorithm of BPD-based NAM opens a new research area with respect to the multi-valued image representation and is valuable for the further theoretical research and potential business foreground.
{"title":"A Novel Algorithm for Multi-valued Image Representation","authors":"Chuanbo Chen, Yunping Zheng, M. Sarem, Wei Huang","doi":"10.1109/ICNC.2007.107","DOIUrl":"https://doi.org/10.1109/ICNC.2007.107","url":null,"abstract":"Although the representation methods of the quadtree for the multi-valued image have many important applications in different fields, they put too much emphasis upon the symmetry of image segmentation. Therefore, they are not the optimal representation methods. In this paper, inspired by the concept of the packing problem, we present a novel algorithm of binary-bit plane decomposition based on the non-symmetry and anti-packing pattern representation model (BPD-based NAM) for the multi-valued image representation. The theoretical analyses and experimental results presented in this paper show that when the algorithm of BPD-based NAM is compared with that of the popular quadtree, the former can reduce the data storage much more effectively than the latter and it is a better method to represent the multi-valued image. This novel algorithm of BPD-based NAM opens a new research area with respect to the multi-valued image representation and is valuable for the further theoretical research and potential business foreground.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"264 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133985447","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 proposes a 3-D Lorenz system based image encryption scheme, which improves the security and performance of the encryption system over conventional one dimension chaos based ones. The balance and correlation properties of the analog sequences generated by Lorenz system are analyzed and a pre-process method is proposed, which makes the key stream have good statistical properties. Three initial parameters of Lorenz system are combined together as one key, which greatly enlarges the key space under precision restricted condition. The encryption speed is also improved since the position permutation and grayscale substitution of a pixel can be done by one iteration operation. Besides, the encryption system is strong against adaptive parameter synchronous attack since it has more complicated structure than one dimension ones. The experimental results indicate that the algorithm is more secure and efficient than conventional ones.
{"title":"An Improved Image Encryption Algorithm Based on Chaotic Maps","authors":"Chong Fu, Zhen-chuan Zhang, Ying-yu Cao","doi":"10.1109/ICNC.2007.215","DOIUrl":"https://doi.org/10.1109/ICNC.2007.215","url":null,"abstract":"This paper proposes a 3-D Lorenz system based image encryption scheme, which improves the security and performance of the encryption system over conventional one dimension chaos based ones. The balance and correlation properties of the analog sequences generated by Lorenz system are analyzed and a pre-process method is proposed, which makes the key stream have good statistical properties. Three initial parameters of Lorenz system are combined together as one key, which greatly enlarges the key space under precision restricted condition. The encryption speed is also improved since the position permutation and grayscale substitution of a pixel can be done by one iteration operation. Besides, the encryption system is strong against adaptive parameter synchronous attack since it has more complicated structure than one dimension ones. The experimental results indicate that the algorithm is more secure and efficient than conventional ones.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131537147","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, two techniques are proposed for globalizing and accelerating the dynamic encoding algorithm for searches (DEAS) method which is developed within the framework of applying the binary representation in optimization and modified for global search using a multi-start approach. These techniques make DEAS fitted better to global optimization than the previously developed ones. The results of numerical simulations show that the proposed techniques are effective in discontinuous and multimodal cost functions.
{"title":"Enhancement of Dynamic Encoding Algorithm for Searches (DEAS) via Modified Decoding Function and Hopping Operation","authors":"Nam-Geun Kim, J. Yun, Sang Woo Kim","doi":"10.1109/ICNC.2007.358","DOIUrl":"https://doi.org/10.1109/ICNC.2007.358","url":null,"abstract":"In this paper, two techniques are proposed for globalizing and accelerating the dynamic encoding algorithm for searches (DEAS) method which is developed within the framework of applying the binary representation in optimization and modified for global search using a multi-start approach. These techniques make DEAS fitted better to global optimization than the previously developed ones. The results of numerical simulations show that the proposed techniques are effective in discontinuous and multimodal cost functions.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"194 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131558592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A multiple sequence alignment algorithm based on divide-and-conquer method and ant colony algorithms is proposed. In the algorithm, ant colony optimization method is used to partition the set of sequences into several subsections vertically. Then the procedure of partitioning is applied to the prefix family and the suffix family in a recursive manner until the lengths of the subsequences are all equal to 1. Experimental results show that the algorithm can get high quality solution and reduce the running time.
{"title":"An Efficient Ant Colony Algorithm for Multiple Sequences Alignment","authors":"Ling Chen, Lingjun Zou, Juan Chen","doi":"10.1109/ICNC.2007.189","DOIUrl":"https://doi.org/10.1109/ICNC.2007.189","url":null,"abstract":"A multiple sequence alignment algorithm based on divide-and-conquer method and ant colony algorithms is proposed. In the algorithm, ant colony optimization method is used to partition the set of sequences into several subsections vertically. Then the procedure of partitioning is applied to the prefix family and the suffix family in a recursive manner until the lengths of the subsequences are all equal to 1. Experimental results show that the algorithm can get high quality solution and reduce the running time.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131636901","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, we present a new preconditioner which is different from the preconditioner given by Milaszewicz, and prove the monotone convergence theory about this method when the coefficient matrix is an H - matrices. This directly leads to several novel sufficient conditions for guaranteeing the convergence of the preconditioned iterative method.
{"title":"Convergence of the Modified Gauss-Seidel Method for H-matrices","authors":"Qingbing Liu","doi":"10.1109/ICNC.2007.317","DOIUrl":"https://doi.org/10.1109/ICNC.2007.317","url":null,"abstract":"In this paper, we present a new preconditioner which is different from the preconditioner given by Milaszewicz, and prove the monotone convergence theory about this method when the coefficient matrix is an H - matrices. This directly leads to several novel sufficient conditions for guaranteeing the convergence of the preconditioned iterative method.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131174800","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 multi-objective particle swarm optimization (MOPSO) methods, selecting good local guides (the global best particle) for each particle of the population from a set of Pareto-optimal solutions has a great impact on the convergence and diversity of solutions. This paper introduces the particle angle division method as a new method for finding the global best particle for each particle of the population. The particle angle division method is implemented and is compared with adaptive grid method based on the same MOPSO for different test functions. The results show our strategy can improve convergence and diversity of MOPSO largely.
{"title":"A Novel Method for Finding Good Local Guides in Multi-objective Particle Swarm Optimization","authors":"Qing Jiang, Mutao Huang, Cheng Wang","doi":"10.1109/ICNC.2007.116","DOIUrl":"https://doi.org/10.1109/ICNC.2007.116","url":null,"abstract":"In multi-objective particle swarm optimization (MOPSO) methods, selecting good local guides (the global best particle) for each particle of the population from a set of Pareto-optimal solutions has a great impact on the convergence and diversity of solutions. This paper introduces the particle angle division method as a new method for finding the global best particle for each particle of the population. The particle angle division method is implemented and is compared with adaptive grid method based on the same MOPSO for different test functions. The results show our strategy can improve convergence and diversity of MOPSO largely.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130747604","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, the optimization modeling and algorithm of facility location problem in perishable commodities emergency system is studied. First, transportation cost and perishability loss of the distribution network is computed separately. Then, our problem is modeled as a kind of emergency optimization problem under certain time constraints, and the modeling objective is logistics cost minimization. In order to solve it, a re-marking algorithm is proposed.
{"title":"Optimization Modeling and Algorithm of Facility Location Problem in Perishable Commodities Emergency System","authors":"Min Zhang, Jun Yang","doi":"10.1109/ICNC.2007.525","DOIUrl":"https://doi.org/10.1109/ICNC.2007.525","url":null,"abstract":"In this paper, the optimization modeling and algorithm of facility location problem in perishable commodities emergency system is studied. First, transportation cost and perishability loss of the distribution network is computed separately. Then, our problem is modeled as a kind of emergency optimization problem under certain time constraints, and the modeling objective is logistics cost minimization. In order to solve it, a re-marking algorithm is proposed.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131117106","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 vehicle routing problem with simultaneous delivery and pick-up (VRP-SDP) is a variant of the classical vehicle routing problem (VRP) where clients require simultaneous delivery and pick-up. Deliveries are supplied from a single depot at the beginning of the vehicle's service, while pick-up loads are taken to the same depot at the conclusion of the service. One important characteristic of this problem is that a vehicle's load in any given route is a mix of delivery and pick-up loads, at the same time in any route the vehicle can not violate some constraints for example the vehicle capacity and traveling distance constraints. In this paper, VRP-SDP is presented from the point of strategic view that combined the logistics and reverse logistics (bidirectional logistics). We constructed a universal mixed integer programming mathematic model of VRP-SDP in detail, it can transform into other classical vehicle routing problems by setting different parameters. An improved differential evolution algorithm (IDE) is proposed. In operation process, we firstly adopted the novel decimal coding to construct initial population, and then some improved differential evolution operators were adopted as the main optimizing scheme, such as adopted a real number coding method based on integer order criterion in mutation operation, a punishment function was designed to dispose constraints, and in crossover operation the crossover probability was self-updated with iteration. The computer simulations are used to compare the performance of the proposed method with genetic algorithm (GA), numerical results show that the performance of the proposed method is better than GA.
{"title":"An Improved Differential Evolution Algorithm for the Vehicle Routing Problem With Simultaneous Delivery and Pick-up Service","authors":"Erbao Cao, M. Lai","doi":"10.1109/ICNC.2007.209","DOIUrl":"https://doi.org/10.1109/ICNC.2007.209","url":null,"abstract":"The vehicle routing problem with simultaneous delivery and pick-up (VRP-SDP) is a variant of the classical vehicle routing problem (VRP) where clients require simultaneous delivery and pick-up. Deliveries are supplied from a single depot at the beginning of the vehicle's service, while pick-up loads are taken to the same depot at the conclusion of the service. One important characteristic of this problem is that a vehicle's load in any given route is a mix of delivery and pick-up loads, at the same time in any route the vehicle can not violate some constraints for example the vehicle capacity and traveling distance constraints. In this paper, VRP-SDP is presented from the point of strategic view that combined the logistics and reverse logistics (bidirectional logistics). We constructed a universal mixed integer programming mathematic model of VRP-SDP in detail, it can transform into other classical vehicle routing problems by setting different parameters. An improved differential evolution algorithm (IDE) is proposed. In operation process, we firstly adopted the novel decimal coding to construct initial population, and then some improved differential evolution operators were adopted as the main optimizing scheme, such as adopted a real number coding method based on integer order criterion in mutation operation, a punishment function was designed to dispose constraints, and in crossover operation the crossover probability was self-updated with iteration. The computer simulations are used to compare the performance of the proposed method with genetic algorithm (GA), numerical results show that the performance of the proposed method is better than GA.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133018550","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}
Determining the winners of combinatorial auctions which maximize the profit of the auctioneer is NP-complete problem. This paper presents an efficient approximate searching algorithm IAA for the problem. The new algorithm uses the ant colony optimization algorithm based on heuristic rules, the proposed algorithm not only give the way for identify feasible bids with a given partial solution but also avoid the unnecessary trials that will not lead to an optimal solution. We have implemented IAA with Visual C++6.0, experiment results show IAA has good performance. When the average error of IAA is less than 2%, the running time of IAA is less than half of Edo Zurel and Noam Nisan's ALPH algorithm in random and weighted random distributions. Meanwhile IAA can get excellent solution for problem with over 3000 items and 50000 bids.
确定能使拍卖人利润最大化的组合拍卖中标者是np完全问题。本文提出了一种高效的近似搜索算法IAA。该算法采用基于启发式规则的蚁群优化算法，在给定部分解的情况下，给出了确定可行出价的方法，同时避免了不必要的试验，避免了无法得到最优解。我们用Visual c++ 6.0实现了IAA，实验结果表明IAA具有良好的性能。当IAA的平均误差小于2%时，在随机分布和加权随机分布下，IAA的运行时间不到Edo Zurel和Noam Nisan的ALPH算法的一半。同时，IAA可以通过3000多个项目和50000个投标获得优秀的问题解决方案。
{"title":"Ant Colony Optimization for Winner Determination in Combinatorial Auctions","authors":"Rongwei Gan, Qingshun Guo, Huiyou Chang, Yang Yi","doi":"10.1109/ICNC.2007.242","DOIUrl":"https://doi.org/10.1109/ICNC.2007.242","url":null,"abstract":"Determining the winners of combinatorial auctions which maximize the profit of the auctioneer is NP-complete problem. This paper presents an efficient approximate searching algorithm IAA for the problem. The new algorithm uses the ant colony optimization algorithm based on heuristic rules, the proposed algorithm not only give the way for identify feasible bids with a given partial solution but also avoid the unnecessary trials that will not lead to an optimal solution. We have implemented IAA with Visual C++6.0, experiment results show IAA has good performance. When the average error of IAA is less than 2%, the running time of IAA is less than half of Edo Zurel and Noam Nisan's ALPH algorithm in random and weighted random distributions. Meanwhile IAA can get excellent solution for problem with over 3000 items and 50000 bids.","PeriodicalId":250881,"journal":{"name":"Third International Conference on Natural Computation (ICNC 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133366571","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
扫码关注我们
求助内容：
应助结果提醒方式：