We develop an iterative algorithm based on right-hand side decomposition for the solution of multicommodity network flow problems. At each step of the proposed iterative procedure the coupling constraints are eliminat...
详细信息
A modified auction algorithm for solving the shortest path problem is presented and convergence is established. The proposed method differs from the standard auction algorithm in the way dual variables are updated. By...
详细信息
A new procedure for the optimum design of optoelectronic devices is explained in this paper and an automatic search is made simultaneously for the structure satisfying various demands. The feature of this procedure is...
详细信息
A new procedure for the optimum design of optoelectronic devices is explained in this paper and an automatic search is made simultaneously for the structure satisfying various demands. The feature of this procedure is in the introduction of cost by which the quantitative evaluation of the structure becomes possible and the global search for the required structure by simulated annealing can be carried out. First, the definition of cost and details of the optimization procedure are clarified. In optimization, in addition to convergence to the minimum point of the cost function (the optimum configuration from theoretical viewpoint), the convergence also is possible in structures with great tolerance to fabrication errors (neighborhood cost (NC) and finite temperature annealing (FTA) methods). Next, these three proposed methods are used in the design of a pnpn differential optical switch and the effectiveness of the methods is verified. The method of cost expression, the relation between annealing parameters, and convergence are investigated. It is shown that cost expression with large degree of freedom improves the search for high-performance structures and the initial temperature of annealing or the fixed temperature of FTA method is the important parameter which sets up the probability of acceptance. Further, it is shown that the convergence cost is inversely proportional to the time spent in annealing. These results are useful guidelines in the optimum design of arbitrary optoelectronic devices.
作者：
STEMMER, WPCPalo Alto Institute of Molecular Medicine 2462 Wyandotte Street Mountain View
CA 94043 (e-mail:youvan@***)REFERENCES Stemmer W.P.C. 1995. Searching sequence space. Bio/Technology 13: 549-553.|ISI|ChemPort|Stemmer W.P.C. 1994. DNA shuffling by random fragmentation and reassembly: In vitro recombination for molecular evolution. Proc. Natl. Acad. Sci. USA 91: 10747-10751.|Article|PubMed|ChemPort|Stemmer W.P.C. 1994. Rapid evolution of a protein in vitro by DNA shuffling. Nature 370: 389-391.|Article|PubMed|ISI|ChemPort|Arkin A.P. and Youvan D.C. 1992. An algorithm for protein engineering: Simulation of recursive ensemble mutagenesis. Proc. Natl. Acad. Sci USA 89: 7811-7815.|PubMed|ChemPort|Youvan D.C. Arkin A.P. and Yang N.M. 1992. Recursive ensemble mutagenesis: A combinatorial optimization technique for protein engineering. In Parallel Problem Solving from Nature. B. Manderick. ed. Elsevier Publishing Co. New York pp.401-410.Reidhaar-Olson J.F. Bowie J.U. Breyer R.M. Hu J.C. Knight K.L. Lim W.A. Mossing M.C. Parsell D.A. Shoemaker K.R. and Sauer R.T. 1991. Random mutagenesis of protein sequences using oligonucleotide cassettes. Meth. Enzymol. 208: 564-587.|PubMed|ChemPort|Oliphant A.R. Nussbaum A.L. and Struhl K. 1986. Cloning of random sequence oligonucleotides. Gene 44: 177-183.|Article|PubMed|ISI|ChemPort|Fuellen G. and Youvan D.C. 1994. Genetic algorithms and recursive ensemble mutagenesis in protein engineering. Complexity International http://life.anu.edu.au/ci/voll/fuellen/REM.html.Goldman E.R. and Youvan D.C. 1992. An algorithmically optimized combinatorial library screened by digital imaging spectroscopy. Bio/Technology 10: 1557-1561.|Article|PubMed|ISI|ChemPort|Youvan D.C. 1994. Imaging sequence space. Nature 369: 79-80.|Article|PubMed|ISI|ChemPort|Delagrave S.Goldman E.R. and Youvan D.C. 1993. Recursive ensemble mutagenesis. Protein Engineering 6: 327-331.|PubMed|ISI|ChemPort|Youvan D.C. Goldman E. Delagrave S. and Yang M.M. 1994. Digit
Using recombination to search more efficiently and thoroughly instead of making bigger combinatorial libraries
Using recombination to search more efficiently and thoroughly instead of making bigger combinatorial libraries
暂无评论