Ontology type: schema:Chapter
2018-09-28
AUTHORSVladimir Myasnichenko , Leoneed Kirilov , Rossen Mikhov , Stefka Fidanova , Nikolay Sdobnyakov
ABSTRACTThe goal of this paper is to develop an efficient method to search for metal and bimetal nanoparticle structures with the lowest possible potential energy. This is a global optimization problem. In computational complexity theory, global optimization problems are NP-hard, meaning that they cannot be solved in polynomial time. Because of the severe difficulty of finding the global minimum, the simulated annealing algorithm was selected as main strategy. At the first step we use the lattice Monte Carlo method with different lattices. Then we relax the resulting nanoparticle structures at low temperature within molecular dynamics, choosing one of them as approximation of the global minimum. The numerical solution of an optimal cluster structure of Ag (200) shows the efficiency of the proposed method. More... »
PAGES277-289
Advanced Computing in Industrial Mathematics
ISBN
978-3-319-97276-3
978-3-319-97277-0
http://scigraph.springernature.com/pub.10.1007/978-3-319-97277-0_23
DOIhttp://dx.doi.org/10.1007/978-3-319-97277-0_23
DIMENSIONShttps://app.dimensions.ai/details/publication/pub.1107272539
JSON-LD is the canonical representation for SciGraph data.
TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT
[
{
"@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json",
"about": [
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/01",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Mathematical Sciences",
"type": "DefinedTerm"
},
{
"id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0103",
"inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/",
"name": "Numerical and Computational Mathematics",
"type": "DefinedTerm"
}
],
"author": [
{
"affiliation": {
"alternateName": "Tver State University, Tver, Russia",
"id": "http://www.grid.ac/institutes/grid.438242.b",
"name": [
"Tver State University, Tver, Russia"
],
"type": "Organization"
},
"familyName": "Myasnichenko",
"givenName": "Vladimir",
"id": "sg:person.013562762060.25",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013562762060.25"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Institute of Information and Communication Technologies\u2014Bulgarian Academy of Sciences, Sofia, Bulgaria",
"id": "http://www.grid.ac/institutes/grid.424988.b",
"name": [
"Institute of Information and Communication Technologies\u2014Bulgarian Academy of Sciences, Sofia, Bulgaria"
],
"type": "Organization"
},
"familyName": "Kirilov",
"givenName": "Leoneed",
"id": "sg:person.015700215743.52",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015700215743.52"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Institute of Information and Communication Technologies\u2014Bulgarian Academy of Sciences, Sofia, Bulgaria",
"id": "http://www.grid.ac/institutes/grid.424988.b",
"name": [
"Institute of Information and Communication Technologies\u2014Bulgarian Academy of Sciences, Sofia, Bulgaria"
],
"type": "Organization"
},
"familyName": "Mikhov",
"givenName": "Rossen",
"id": "sg:person.014434131110.58",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.014434131110.58"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Institute of Information and Communication Technologies\u2014Bulgarian Academy of Sciences, Sofia, Bulgaria",
"id": "http://www.grid.ac/institutes/grid.424988.b",
"name": [
"Institute of Information and Communication Technologies\u2014Bulgarian Academy of Sciences, Sofia, Bulgaria"
],
"type": "Organization"
},
"familyName": "Fidanova",
"givenName": "Stefka",
"id": "sg:person.011173106320.18",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011173106320.18"
],
"type": "Person"
},
{
"affiliation": {
"alternateName": "Tver State University, Tver, Russia",
"id": "http://www.grid.ac/institutes/grid.438242.b",
"name": [
"Tver State University, Tver, Russia"
],
"type": "Organization"
},
"familyName": "Sdobnyakov",
"givenName": "Nikolay",
"id": "sg:person.015175741710.55",
"sameAs": [
"https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.015175741710.55"
],
"type": "Person"
}
],
"datePublished": "2018-09-28",
"datePublishedReg": "2018-09-28",
"description": "The goal of this paper is to develop an efficient method to search for metal and bimetal nanoparticle structures with the lowest possible potential energy. This is a global optimization problem. In computational complexity theory, global optimization problems are NP-hard, meaning that they cannot be solved in polynomial time. Because of the severe difficulty of finding the global minimum, the simulated annealing algorithm was selected as main strategy. At the first step we use the lattice Monte Carlo method with different lattices. Then we relax the resulting nanoparticle structures at low temperature within molecular dynamics, choosing one of them as approximation of the global minimum. The numerical solution of an optimal cluster structure of Ag (200) shows the efficiency of the proposed method.",
"editor": [
{
"familyName": "Georgiev",
"givenName": "Krassimir",
"type": "Person"
},
{
"familyName": "Todorov",
"givenName": "Michail",
"type": "Person"
},
{
"familyName": "Georgiev",
"givenName": "Ivan",
"type": "Person"
}
],
"genre": "chapter",
"id": "sg:pub.10.1007/978-3-319-97277-0_23",
"inLanguage": "en",
"isAccessibleForFree": false,
"isPartOf": {
"isbn": [
"978-3-319-97276-3",
"978-3-319-97277-0"
],
"name": "Advanced Computing in Industrial Mathematics",
"type": "Book"
},
"keywords": [
"global optimization problems",
"optimization problem",
"computational complexity theory",
"global minimum",
"optimal cluster structure",
"Monte Carlo method",
"lattice Monte Carlo method",
"numerical solution",
"Carlo method",
"different lattices",
"complexity theory",
"annealing algorithm",
"polynomial time",
"structure optimization",
"cluster structure",
"annealing method",
"potential energy",
"efficient method",
"approximation",
"problem",
"molecular dynamics",
"lattice",
"low temperature",
"optimization",
"theory",
"minimum",
"algorithm",
"dynamics",
"severe difficulties",
"solution",
"structure",
"nanoparticle structure",
"first step",
"NPs",
"energy",
"efficiency",
"step",
"temperature",
"difficulties",
"time",
"goal",
"main strategies",
"strategies",
"metals",
"Ag",
"method",
"paper"
],
"name": "Simulated Annealing Method for Metal Nanoparticle Structures Optimization",
"pagination": "277-289",
"productId": [
{
"name": "dimensions_id",
"type": "PropertyValue",
"value": [
"pub.1107272539"
]
},
{
"name": "doi",
"type": "PropertyValue",
"value": [
"10.1007/978-3-319-97277-0_23"
]
}
],
"publisher": {
"name": "Springer Nature",
"type": "Organisation"
},
"sameAs": [
"https://doi.org/10.1007/978-3-319-97277-0_23",
"https://app.dimensions.ai/details/publication/pub.1107272539"
],
"sdDataset": "chapters",
"sdDatePublished": "2022-05-10T10:41",
"sdLicense": "https://scigraph.springernature.com/explorer/license/",
"sdPublisher": {
"name": "Springer Nature - SN SciGraph project",
"type": "Organization"
},
"sdSource": "s3://com-springernature-scigraph/baseset/20220509/entities/gbq_results/chapter/chapter_193.jsonl",
"type": "Chapter",
"url": "https://doi.org/10.1007/978-3-319-97277-0_23"
}
]Download the RDF metadata as: json-ld nt turtle xml License info
JSON-LD is a popular format for linked data which is fully compatible with JSON.
curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-97277-0_23'
N-Triples is a line-based linked data format ideal for batch operations.
curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-97277-0_23'
Turtle is a human-readable linked data format.
curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-97277-0_23'
RDF/XML is a standard XML format for linked data.
curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/978-3-319-97277-0_23'
This table displays all metadata directly associated to this object as RDF triples.
148 TRIPLES
23 PREDICATES
72 URIs
65 LITERALS
7 BLANK NODES