The performance of genetic algorithm(GA) is determined by the capability of search and optimization for satisfactory solutions. The new adaptive genetic algorithm(AGA) is built for inducing suitable search and optimiz...The performance of genetic algorithm(GA) is determined by the capability of search and optimization for satisfactory solutions. The new adaptive genetic algorithm(AGA) is built for inducing suitable search and optimization relationship. The use of six fuzzy logic controllers(6FLCs) is proposed for dynamic control genetic operating parameters of a symbolic-coded GA. This paper uses AGA based on 6FLCs to deal with the travelling salesman problem (TSP). Experimental results show that AGA based on 6FLCs is more efficient than a standard GA in solving combinatorial optimization problems similar to TSP.展开更多
The potential energy curves （PECs） of three low-lying electronic states （X^3∑, a^1△, and a^3△） of SO radical have been studied by ab initio quantum chemical method. The calcula- tions were carried out with the ...The potential energy curves （PECs） of three low-lying electronic states （X^3∑, a^1△, and a^3△） of SO radical have been studied by ab initio quantum chemical method. The calcula- tions were carried out with the full valence complete active space self-consistent field method followed by the highly accurate valence internally contracted multireference configuration in- teraction （MRCI） approach in combination with correlation-consistent basis sets. Effects of the core-valence correlation and relativistic corrections on the PECs are taken into account. The core-valence correlation correction is carried out with the cc-pCVDZ basis set. The way to consider the relativistic correction is to use the second-order Douglas-Kroll Hamiltonian approximation, and the correction is performed at the level of cc-pV5Z basis set. To obtain more reliable results, the PECs determined by the MRCI calculations are also corrected for size-extensivity errors by means of the Davidson modification （MRCI＋Q）. These PECs are extrapolated to the complete basis set limit by the two-point energy extrapolation scheme. With these PECs, the spectroscopic parameters are determined.展开更多
The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The ...The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed,and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms,and performs excellently in delay variation performance under lower time complexity,which ensures it to support the requirements of real-time multimedia communications more effectively.展开更多
This paper considers a new form of the Steiner tree problem that is more practical and reliable,which we call Reliable Steiner Tree(RST)problem.The authors give a detailed definition for this new problem and design bo...This paper considers a new form of the Steiner tree problem that is more practical and reliable,which we call Reliable Steiner Tree(RST)problem.The authors give a detailed definition for this new problem and design both an exact algorithm and an approximation algorithm for it.The definition is based on the reliability of full components instead of Steiner vertices.The task is thus to find the most reliable full components to make up an optimum reliable Steiner tree.The exact algorithm designed for this problem utilizes a dynamic programming frame.The approximation algorithm designed in this paper exploits a local search strategy that looks for the best full component according to a selection function at a time.展开更多
文摘The performance of genetic algorithm(GA) is determined by the capability of search and optimization for satisfactory solutions. The new adaptive genetic algorithm(AGA) is built for inducing suitable search and optimization relationship. The use of six fuzzy logic controllers(6FLCs) is proposed for dynamic control genetic operating parameters of a symbolic-coded GA. This paper uses AGA based on 6FLCs to deal with the travelling salesman problem (TSP). Experimental results show that AGA based on 6FLCs is more efficient than a standard GA in solving combinatorial optimization problems similar to TSP.
文摘The potential energy curves （PECs） of three low-lying electronic states （X^3∑, a^1△, and a^3△） of SO radical have been studied by ab initio quantum chemical method. The calcula- tions were carried out with the full valence complete active space self-consistent field method followed by the highly accurate valence internally contracted multireference configuration in- teraction （MRCI） approach in combination with correlation-consistent basis sets. Effects of the core-valence correlation and relativistic corrections on the PECs are taken into account. The core-valence correlation correction is carried out with the cc-pCVDZ basis set. The way to consider the relativistic correction is to use the second-order Douglas-Kroll Hamiltonian approximation, and the correction is performed at the level of cc-pV5Z basis set. To obtain more reliable results, the PECs determined by the MRCI calculations are also corrected for size-extensivity errors by means of the Davidson modification （MRCI＋Q）. These PECs are extrapolated to the complete basis set limit by the two-point energy extrapolation scheme. With these PECs, the spectroscopic parameters are determined.
文摘The delay and DVBMT problem is known to be NP-complete. In this paper,an efficient distributed dynamic multicast routing algorithm was proposed to produce routing trees with delay and delay variation constraints. The proposed algorithm is fully distributed,and supports the dynamic reorganizing of the multicast tree in response to changes for the destination. Simulations demonstrate that our algorithm is better in terms of tree delay and routing success ratio as compared with other existing algorithms,and performs excellently in delay variation performance under lower time complexity,which ensures it to support the requirements of real-time multimedia communications more effectively.
基金supported by National Natural Science Foundation of China under Grant Nos.71171189,71271204,11101420Knowledge Innovation Program of the Chinese Academy of Sciences under Grant No.KGCX2-RW-329
文摘This paper considers a new form of the Steiner tree problem that is more practical and reliable,which we call Reliable Steiner Tree(RST)problem.The authors give a detailed definition for this new problem and design both an exact algorithm and an approximation algorithm for it.The definition is based on the reliability of full components instead of Steiner vertices.The task is thus to find the most reliable full components to make up an optimum reliable Steiner tree.The exact algorithm designed for this problem utilizes a dynamic programming frame.The approximation algorithm designed in this paper exploits a local search strategy that looks for the best full component according to a selection function at a time.
