Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a f...Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a fixed code length. According to the characteristics of the problem, a DNA algorithm solving the minimum spanning tree problem is given. The effectiveness of the proposed method is verified by simulation. The advantages and disadvantages of this algorithm are discussed.展开更多
To decompose an unbalanced multi-stage logistic system to multipleindependent single-stage logistic systems, a new notion of parameterized interface distribution ispresented. For encoding the logistic pattern on each ...To decompose an unbalanced multi-stage logistic system to multipleindependent single-stage logistic systems, a new notion of parameterized interface distribution ispresented. For encoding the logistic pattern on each stage, the Pruefer number is used. With theimproved decoding procedure, any Pruefer number produced stochastically can be decoded to a feasiblelogistic pattern, which can match with the capacities of the nodes of the logistic system. Withthese two innovations, a new modeling method based on parameterized interface distribution and thePriifer number coding is put forward. The corresponding genetic algorithm, named as PIP-GA, can findbetter solutions and require less computational time than st-GA. Although requiring a little moreconsumption of memory, PIP-GA is still an efficient and robust method in the modeling andoptimization of unbalanced multi-stage logistic systems.展开更多
Y2000-62467-894 0104420图象窗口过完全独立成分分析基础估计用的快速算法=A fast algorithm for estimating overcomplere ICA basesfor image windows[会,英]/Hyvarinen,A.& Cristescu,R.//1999 IEEE International Joint Confer...Y2000-62467-894 0104420图象窗口过完全独立成分分析基础估计用的快速算法=A fast algorithm for estimating overcomplere ICA basesfor image windows[会,英]/Hyvarinen,A.& Cristescu,R.//1999 IEEE International Joint Conference on Neu-展开更多
文摘Molecular programming is applied to minimum spanning problem whose solution requires encoding of real values in DNA strands. A new encoding scheme is proposed for real values that is biologically plausible and has a fixed code length. According to the characteristics of the problem, a DNA algorithm solving the minimum spanning tree problem is given. The effectiveness of the proposed method is verified by simulation. The advantages and disadvantages of this algorithm are discussed.
文摘To decompose an unbalanced multi-stage logistic system to multipleindependent single-stage logistic systems, a new notion of parameterized interface distribution ispresented. For encoding the logistic pattern on each stage, the Pruefer number is used. With theimproved decoding procedure, any Pruefer number produced stochastically can be decoded to a feasiblelogistic pattern, which can match with the capacities of the nodes of the logistic system. Withthese two innovations, a new modeling method based on parameterized interface distribution and thePriifer number coding is put forward. The corresponding genetic algorithm, named as PIP-GA, can findbetter solutions and require less computational time than st-GA. Although requiring a little moreconsumption of memory, PIP-GA is still an efficient and robust method in the modeling andoptimization of unbalanced multi-stage logistic systems.
文摘Y2000-62467-894 0104420图象窗口过完全独立成分分析基础估计用的快速算法=A fast algorithm for estimating overcomplere ICA basesfor image windows[会,英]/Hyvarinen,A.& Cristescu,R.//1999 IEEE International Joint Conference on Neu-
