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": "College of Information Science and Technology, Gansu Agricultural University, No. 1 Yingmen Village, 730070, Lanzhou, Gansu, China", 
          "id": "http://www.grid.ac/institutes/grid.411734.4", 
          "name": [
            "College of Information Science and Technology, Gansu Agricultural University, No. 1 Yingmen Village, 730070, Lanzhou, Gansu, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Wang", 
        "givenName": "Lianguo", 
        "id": "sg:person.011546457215.07", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.011546457215.07"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "College of Information Science and Technology, Gansu Agricultural University, No. 1 Yingmen Village, 730070, Lanzhou, Gansu, China", 
          "id": "http://www.grid.ac/institutes/grid.411734.4", 
          "name": [
            "College of Information Science and Technology, Gansu Agricultural University, No. 1 Yingmen Village, 730070, Lanzhou, Gansu, China"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Liu", 
        "givenName": "Xiaojuan", 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/978-3-662-03423-1_27", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1011772001", 
          "https://doi.org/10.1007/978-3-662-03423-1_27"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s11831-019-09343-x", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1115676632", 
          "https://doi.org/10.1007/s11831-019-09343-x"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00366-011-0241-y", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1009081493", 
          "https://doi.org/10.1007/s00366-011-0241-y"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s10898-007-9149-x", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1049543869", 
          "https://doi.org/10.1007/s10898-007-9149-x"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00500-019-04484-4", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1122284946", 
          "https://doi.org/10.1007/s00500-019-04484-4"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1007/s00170-016-9523-2", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1016842758", 
          "https://doi.org/10.1007/s00170-016-9523-2"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2021-11-03", 
    "datePublishedReg": "2021-11-03", 
    "description": "The shuffled frog leaping algorithm is easily trapped into local optimum and has the low optimization accuracy when it is used to optimize the complex functions problems. To overcome the above shortcomings, a shuffled frog leaping algorithm with contraction factor was proposed. By introducing acceleration factors c1 and c2, the ability of worst individual to learn from best individual within the submemeplexes or global best individual of the entire population was improved and the convergence rate of algorithm was accelerated. Under inserting the contraction factor \u03c7, the convergence of algorithm was ensured. After performing local optimization of the self-learning operator on the worst individual, and taking full advantage of the useful information in the worst individuals, the self-learning ability of the individual and the optimization accuracy of the algorithm were improved. Simulation results illustrated that the enhanced algorithm performed better optimization performance than basic SFLA and other improved SFLAs. Finally, the proposed algorithm was used to optimize five problems of the mechanical design, and its validity and practicability were verified.", 
    "genre": "article", 
    "id": "sg:pub.10.1007/s00366-021-01510-8", 
    "inLanguage": "en", 
    "isAccessibleForFree": false, 
    "isPartOf": [
      {
        "id": "sg:journal.1041785", 
        "issn": [
          "0177-0667", 
          "1435-5663"
        ], 
        "name": "Engineering with Computers", 
        "publisher": "Springer Nature", 
        "type": "Periodical"
      }
    ], 
    "keywords": [
      "optimization accuracy", 
      "worst individuals", 
      "contraction factor", 
      "better optimization performance", 
      "low optimization accuracy", 
      "convergence of algorithm", 
      "best individual", 
      "global best individual", 
      "convergence rate", 
      "optimization performance", 
      "local optimization", 
      "local optimum", 
      "function problems", 
      "simulation results", 
      "algorithm", 
      "optimum design", 
      "basic SFLA", 
      "SFLA", 
      "self-learning operator", 
      "problem", 
      "self-learning ability", 
      "convergence", 
      "factor \u03c7", 
      "operators", 
      "accuracy", 
      "optimization", 
      "full advantage", 
      "above shortcomings", 
      "mechanical design", 
      "optimum", 
      "design", 
      "validity", 
      "applications", 
      "practicability", 
      "useful information", 
      "performance", 
      "advantages", 
      "shortcomings", 
      "results", 
      "information", 
      "entire population", 
      "C2", 
      "ability", 
      "C1", 
      "rate", 
      "factors", 
      "population", 
      "individuals", 
      "factor C1", 
      "frogs", 
      "improved SFLA"
    ], 
    "name": "A shuffled frog leaping algorithm with contraction factor and its application in mechanical optimum design", 
    "pagination": "1-19", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1142376306"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/s00366-021-01510-8"
        ]
      }
    ], 
    "sameAs": [
      "https://doi.org/10.1007/s00366-021-01510-8", 
      "https://app.dimensions.ai/details/publication/pub.1142376306"
    ], 
    "sdDataset": "articles", 
    "sdDatePublished": "2022-05-20T07:38", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220519/entities/gbq_results/article/article_884.jsonl", 
    "type": "ScholarlyArticle", 
    "url": "https://doi.org/10.1007/s00366-021-01510-8"
  }
]

Download the RDF metadata as:  json-ld nt turtle xml License info

This table displays all metadata directly associated to this object as RDF triples.

133 TRIPLES      22 PREDICATES      80 URIs      66 LITERALS      4 BLANK NODES