東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Genetic algorithms and genetic progr...

Sastry, Kumara Narasimha.

FindBook

Google Book

Amazon

博客來

Genetic algorithms and genetic programming for multiscale modeling: Applications in materials science and chemistry and advances in scalability.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Genetic algorithms and genetic programming for multiscale modeling: Applications in materials science and chemistry and advances in scalability./
作者:	Sastry, Kumara Narasimha.
面頁冊數:	220 p.
附註:	Advisers: David E. Goldberg; Duane D. Johnson.
Contained By:	Dissertation Abstracts International68-11B.
標題:	Engineering, Materials Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3290369
ISBN:	9780549345923

Genetic algorithms and genetic programming for multiscale modeling: Applications in materials science and chemistry and advances in scalability.
Sastry, Kumara Narasimha.

Genetic algorithms and genetic programming for multiscale modeling: Applications in materials science and chemistry and advances in scalability. - 220 p.

Advisers: David E. Goldberg; Duane D. Johnson.

Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.

Effective and efficient rnultiscale modeling is essential to advance both the science and synthesis in a, wide array of fields such as physics, chemistry, materials science; biology, biotechnology and pharmacology. This study investigates the efficacy and potential of rising genetic algorithms for rnultiscale materials modeling and addresses some of the challenges involved in designing competent algorithms that solve hard problems quickly, reliably and accurately. In particular, this thesis demonstrates the use of genetic algorithms (GAs) and genetic programming (GP) in multiscale modeling with the help of two non-trivial case studies in materials science and chemistry.

ISBN: 9780549345923Subjects--Topical Terms:

1017759
Engineering, Materials Science.

Genetic algorithms and genetic programming for multiscale modeling: Applications in materials science and chemistry and advances in scalability.
LDR:05818nam 2200349 a 45 001 955463
005 20110622
008 110622s2007 ||||||||||||||||| ||eng d
020 $a 9780549345923
035 $a (UMI)AAI3290369
035 $a AAI3290369
040 $a UMI $c UMI
100 1 $a Sastry, Kumara Narasimha. $3 1278928
245 1 0 $a Genetic algorithms and genetic programming for multiscale modeling: Applications in materials science and chemistry and advances in scalability.
300 $a 220 p.
500 $a Advisers: David E. Goldberg; Duane D. Johnson.
500 $a Source: Dissertation Abstracts International, Volume: 68-11, Section: B, page: 7640.
502 $a Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.
520 $a Effective and efficient rnultiscale modeling is essential to advance both the science and synthesis in a, wide array of fields such as physics, chemistry, materials science; biology, biotechnology and pharmacology. This study investigates the efficacy and potential of rising genetic algorithms for rnultiscale materials modeling and addresses some of the challenges involved in designing competent algorithms that solve hard problems quickly, reliably and accurately. In particular, this thesis demonstrates the use of genetic algorithms (GAs) and genetic programming (GP) in multiscale modeling with the help of two non-trivial case studies in materials science and chemistry.
520 $a The first case study explores the utility of genetic programming (GP) in multi-timescaling alloy kinetics simulations. In essence, GP is used to bridge molecular dynamics and kinetic Monte Carlo methods to span orders-of-magnitude in simulation time. Specifically, GP is used to regress symbolically an inline barrier function from a limited set of molecular dynamics simulations to enable kinetic Monte Carlo that simulate seconds of real time. Results on a non-trivial example of vacancy-assisted migration on a surface of a face-centered cubic (fcc) Copper-Cobalt (CuxCo 1-x) alloy show that GP predicts all barriers with 0.1% error from calculations for less than 3% of active configurations, independent of type of potentials used to obtain the learning set of barriers via molecular dynamics. The resulting method enables 2--9 orders-of-magnitude increase in real-time dynamics simulations taking 4--7 orders-of-magnitude less CPU time.
520 $a The second case study presents the application of multiobjective genetic algorithms (MOGAs) in multiscaling quantum chemistry simulations. Specifically, MOGAs are used to bridge high-level quantum chemistry and semiempirical methods to provide accurate representation of complex molecular excited-state and ground-state behavior. Results on ethylene and benzene---two common building blocks in organic chemistry---indicate that MOGAs produce High-quality semiempirical methods that (1) are stable to small perturbations, (2) yield accurate configuration energies on untested and critical excited states, and (3) yield ab initio quality excited-state dynamics. The proposed method enables simulations of more complex systems to realistic, multi-picosecond timescales, well beyond previous attempts or expectation of human experts, and 2--3 orders-of-magnitude reduction in computational cost.
520 $a While the two applications use simple evolutionary operators, in order to tackle more complex systems, their scalability and limitations have to be investigated. The second part of the thesis addresses some of the challenges involved with a successful design of genetic algorithms and genetic programming for multiscale modeling. The first issue addressed is the scalability of genetic programming, where facetwise models are built to assess the population size required by GP to ensure adequate supply of raw building blocks and also to ensure accurate decision-making between competing building blocks.
520 $a This study also presents a design of competent genetic programming, where traditional fixed recombination operators are replaced by building and sampling probabilistic models of promising candidate programs. The proposed scalable GP, called extended compact GP (eCGP), combines the ideas from extended compact genetic algorithm (eCGA) and probabilistic incremental program evolution (PIPE) and adaptively identifies, propagates and exchanges important subsolutions of a search problem. Results show that eCGP scales cubically with problem size on both GP-easy and GP-hard problems.
520 $a Finally, facetwise models are developed to explore limitations of scalability of MOGAs, where the scalability of multiobjective algorithms in reliably maintaining Pareto-optimal solutions is addressed. The results show that even when the building blocks are accurately identified, massive multimodality of the search problems can easily overwhelm the nicher (diversity preserving operator) and lead to exponential scale-up. Facetwise models are developed, which incorporate the combined effects of model accuracy, decision making, and sub-structure supply, as well as the effect of niching on the population sizing, to predict a limit on the growth rate of a maximum number of sub-structures that can compete in the two objectives to circumvent the failure of the niching method. The results show that if the number of competing building blocks between multiple objectives is less than the proposed limit, multiobjective GAs scale-up polynomially with the problem size on boundedly-difficult problems.
590 $a School code: 0090.
650 4 $a Engineering, Materials Science. $3 1017759
650 4 $a Engineering, System Science. $3 1018128
690 $a 0790
690 $a 0794
710 2 $a University of Illinois at Urbana-Champaign. $3 626646
773 0 $t Dissertation Abstracts International $g 68-11B.
790 $a 0090
790 1 0 $a Goldberg, David E., $e advisor
790 1 0 $a Johnson, Duane D., $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3290369