|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM213402688 |
| 003 |
DE-627 |
| 005 |
20231224021522.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231224s2012 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1002/jcc.21976
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n0711.xml
|
| 035 |
|
|
|a (DE-627)NLM213402688
|
| 035 |
|
|
|a (NLM)22120989
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Logsdail, Andrew J
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Development and optimization of a novel genetic algorithm for identifying nanoclusters from scanning transmission electron microscopy images
|
| 264 |
|
1 |
|c 2012
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 24.04.2012
|
| 500 |
|
|
|a Date Revised 10.01.2012
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Copyright © 2011 Wiley Periodicals, Inc.
|
| 520 |
|
|
|a Whilst technological advancements have allowed imaging at atomic resolution using scanning transmission electron microscopy (STEM), identification of nanocluster structures has proven difficult due to their low thermal stability, and often resultant low-symmetry. In this work, we look at a novel solution to this problem using a genetic algorithm (GA). GAs are search methods for the minimization of statistical problems based on natural evolution. We develop a STEM model first described by Curley et al. (2007) and, using high-symmetry cluster structures as test subjects, look at the effectiveness and efficiency of the GA at optimizing orientation parameters for a cluster when compared to a model solution. We find for a 309-atom icosahedron that a random minimizing search would prove more efficient than a GA; however, for a 309-atom decahedron the GA becomes more effective and efficient than a random search. We predict that as we continue to lower symmetry of our test cases, we will find the GA becomes even more efficient at optimizing this otherwise computationally expensive problem
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Li, Z Y
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Johnston, Roy L
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t Journal of computational chemistry
|d 1984
|g 33(2012), 4 vom: 05. Feb., Seite 391-400
|w (DE-627)NLM098138448
|x 1096-987X
|7 nnns
|
| 773 |
1 |
8 |
|g volume:33
|g year:2012
|g number:4
|g day:05
|g month:02
|g pages:391-400
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1002/jcc.21976
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 33
|j 2012
|e 4
|b 05
|c 02
|h 391-400
|