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/08", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Information and Computing Sciences", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "name": "Artificial Intelligence and Image Processing", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Engineering, The Pennsylvania State University, 16802, University Park, PA, USA", 
          "id": "http://www.grid.ac/institutes/grid.29857.31", 
          "name": [
            "Department of Computer Science and Engineering, The Pennsylvania State University, 16802, University Park, PA, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Berman", 
        "givenName": "Piotr", 
        "id": "sg:person.01274506210.27", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.01274506210.27"
        ], 
        "type": "Person"
      }, 
      {
        "affiliation": {
          "alternateName": "Department of Computer Science and Engineering, The Pennsylvania State University, 16802, University Park, PA, USA", 
          "id": "http://www.grid.ac/institutes/grid.29857.31", 
          "name": [
            "Department of Computer Science and Engineering, The Pennsylvania State University, 16802, University Park, PA, USA"
          ], 
          "type": "Organization"
        }, 
        "familyName": "Coulston", 
        "givenName": "Chris", 
        "id": "sg:person.010257152675.20", 
        "sameAs": [
          "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010257152675.20"
        ], 
        "type": "Person"
      }
    ], 
    "datePublished": "1998", 
    "datePublishedReg": "1998-01-01", 
    "description": "We consider the problem of preemptive non-clairvoyant scheduling on a single machine. In this model a scheduler receives a number of jobs at different times without prior knowledge of the future jobs or the required processing time of jobs that are not yet completed. We want to minimize the total response time, i.e. the sum of times each job takes from its release to completion. One particular algorithm, Balance, always schedules the job that was least processed so far. A comparison of an on-line scheduler running Balance against the optimal off-line shows a very large competitive ratio if both algorithms use machines of the same speed. However, it has been shown if Balance is run on a v times faster machine then the competitive ratio drops to at most 1 + 1/(v\u22121). This result showed that speed can almost be as good as clairvoyance. We show for v \u2265 2 the competitive ratio of Balance is 2/v. In other words, sufficiently high speed is more powerful than clairvoyance.", 
    "editor": [
      {
        "familyName": "Arnborg", 
        "givenName": "Stefan", 
        "type": "Person"
      }, 
      {
        "familyName": "Ivansson", 
        "givenName": "Lars", 
        "type": "Person"
      }
    ], 
    "genre": "chapter", 
    "id": "sg:pub.10.1007/bfb0054373", 
    "isAccessibleForFree": false, 
    "isPartOf": {
      "isbn": [
        "978-3-540-64682-2", 
        "978-3-540-69106-8"
      ], 
      "name": "Algorithm Theory \u2014 SWAT'98", 
      "type": "Book"
    }, 
    "keywords": [
      "competitive ratio", 
      "larger competitive ratios", 
      "particular algorithm", 
      "number of jobs", 
      "non-clairvoyant scheduling", 
      "single machine", 
      "fast machine", 
      "line scheduler", 
      "algorithm", 
      "prior knowledge", 
      "same speed", 
      "total response time", 
      "scheduler", 
      "processing time", 
      "sum of time", 
      "speed", 
      "scheduling", 
      "high speed", 
      "sum", 
      "problem", 
      "machine", 
      "model", 
      "response time", 
      "clairvoyance", 
      "time", 
      "number", 
      "ratio", 
      "jobs", 
      "balance", 
      "results", 
      "comparison", 
      "different times", 
      "lines", 
      "knowledge", 
      "future jobs", 
      "completion", 
      "words", 
      "release"
    ], 
    "name": "Speed is more powerful than clairvoyance", 
    "pagination": "255-263", 
    "productId": [
      {
        "name": "dimensions_id", 
        "type": "PropertyValue", 
        "value": [
          "pub.1008132074"
        ]
      }, 
      {
        "name": "doi", 
        "type": "PropertyValue", 
        "value": [
          "10.1007/bfb0054373"
        ]
      }
    ], 
    "publisher": {
      "name": "Springer Nature", 
      "type": "Organisation"
    }, 
    "sameAs": [
      "https://doi.org/10.1007/bfb0054373", 
      "https://app.dimensions.ai/details/publication/pub.1008132074"
    ], 
    "sdDataset": "chapters", 
    "sdDatePublished": "2022-08-04T17:17", 
    "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
    "sdPublisher": {
      "name": "Springer Nature - SN SciGraph project", 
      "type": "Organization"
    }, 
    "sdSource": "s3://com-springernature-scigraph/baseset/20220804/entities/gbq_results/chapter/chapter_270.jsonl", 
    "type": "Chapter", 
    "url": "https://doi.org/10.1007/bfb0054373"
  }
]

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.

109 TRIPLES      22 PREDICATES      63 URIs      56 LITERALS      7 BLANK NODES