Adaptive problem solving method and apparatus utilizing evolutionary computation techniques


Ontology type: sgo:Patent     


Patent Info

DATE

2001-08-28T00:00

AUTHORS

GOUNARES ALEXANDER , SIKCHI PRAKASH

ABSTRACT

A system for adaptively solving sequential problems in a target system utilizing evolutionary computation techniques and in particular genetic algorithms and modified genetic algorithms. Stimuli to a target system such as a software system are represented as actions. A single sequence of actions is a chromosome. Chromosomes are generated by a goal-seeking algorithm that uses a hint database and recursion to intelligently and efficiently generate a robust chromosome population. The chromosomes are applied to the target system one action at a time and the change in properties of the target system is measured after each action is applied. A fitness rating is calculated for each chromosome based on the property changes produced in the target system by the chromosome. The fitness rating calculation is defined so that successive generations of chromosomes will converge upon desired characteristics. For example, desired characteristics for a software testing application are defect discovery and code coverage. Chromosomes with high fitness ratings are selected as parent chromosomes and various techniques are used to mate the parent chromosomes to produce children chromosomes. Children chromosomes with high fitness ratings are entered into the chromosome population. Defects in a target software system are minimized by evolving ever-shorter chromosomes that produce the same defect. Defect discovery rate, or any other desired characteristic, is thereby maximized. More... »

Related SciGraph Publications

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/06", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "type": "DefinedTerm"
      }, 
      {
        "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0604", 
        "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
        "type": "DefinedTerm"
      }
    ], 
    "author": [
      {
        "name": "GOUNARES ALEXANDER", 
        "type": "Person"
      }, 
      {
        "name": "SIKCHI PRAKASH", 
        "type": "Person"
      }
    ], 
    "citation": [
      {
        "id": "sg:pub.10.1007/bf00993046", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1048698842", 
          "https://doi.org/10.1007/bf00993046"
        ], 
        "type": "CreativeWork"
      }, 
      {
        "id": "sg:pub.10.1038/scientificamerican0792-66", 
        "sameAs": [
          "https://app.dimensions.ai/details/publication/pub.1056571710", 
          "https://doi.org/10.1038/scientificamerican0792-66"
        ], 
        "type": "CreativeWork"
      }
    ], 
    "datePublished": "2001-08-28T00:00", 
    "description": "

A system for adaptively solving sequential problems in a target system utilizing evolutionary computation techniques and in particular genetic algorithms and modified genetic algorithms. Stimuli to a target system such as a software system are represented as actions. A single sequence of actions is a chromosome. Chromosomes are generated by a goal-seeking algorithm that uses a hint database and recursion to intelligently and efficiently generate a robust chromosome population. The chromosomes are applied to the target system one action at a time and the change in properties of the target system is measured after each action is applied. A fitness rating is calculated for each chromosome based on the property changes produced in the target system by the chromosome. The fitness rating calculation is defined so that successive generations of chromosomes will converge upon desired characteristics. For example, desired characteristics for a software testing application are defect discovery and code coverage. Chromosomes with high fitness ratings are selected as parent chromosomes and various techniques are used to mate the parent chromosomes to produce children chromosomes. Children chromosomes with high fitness ratings are entered into the chromosome population. Defects in a target software system are minimized by evolving ever-shorter chromosomes that produce the same defect. Defect discovery rate, or any other desired characteristic, is thereby maximized.

", "endDate": "2017-06-27", "id": "sg:patent.US-6282527-B1", "name": "Adaptive problem solving method and apparatus utilizing evolutionary computation techniques", "recipient": [ { "id": "http://www.grid.ac/institutes/grid.419815.0", "type": "Organization" } ], "sameAs": [ "https://app.dimensions.ai/details/patent/US-6282527-B1" ], "sdDataset": "patents", "sdDatePublished": "2022-01-01T19:32", "sdLicense": "https://scigraph.springernature.com/explorer/license/", "sdPublisher": { "name": "Springer Nature - SN SciGraph project", "type": "Organization" }, "sdSource": "s3://com-springernature-scigraph/baseset/20220101/entities/gbq_results/patent/patent_22.jsonl", "type": "Patent" } ]
 

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

HOW TO GET THIS DATA PROGRAMMATICALLY:

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/patent.US-6282527-B1'

N-Triples is a line-based linked data format ideal for batch operations.

curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/patent.US-6282527-B1'

Turtle is a human-readable linked data format.

curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/patent.US-6282527-B1'

RDF/XML is a standard XML format for linked data.

curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/patent.US-6282527-B1'


 

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

38 TRIPLES      15 PREDICATES      18 URIs      9 LITERALS      2 BLANK NODES

Subject Predicate Object
1 sg:patent.US-6282527-B1 schema:about anzsrc-for:06
2 anzsrc-for:0604
3 schema:author N8423549c40bb43618f10491f867d5174
4 schema:citation sg:pub.10.1007/bf00993046
5 sg:pub.10.1038/scientificamerican0792-66
6 schema:datePublished 2001-08-28T00:00
7 schema:description <p>A system for adaptively solving sequential problems in a target system utilizing evolutionary computation techniques and in particular genetic algorithms and modified genetic algorithms. Stimuli to a target system such as a software system are represented as actions. A single sequence of actions is a chromosome. Chromosomes are generated by a goal-seeking algorithm that uses a hint database and recursion to intelligently and efficiently generate a robust chromosome population. The chromosomes are applied to the target system one action at a time and the change in properties of the target system is measured after each action is applied. A fitness rating is calculated for each chromosome based on the property changes produced in the target system by the chromosome. The fitness rating calculation is defined so that successive generations of chromosomes will converge upon desired characteristics. For example, desired characteristics for a software testing application are defect discovery and code coverage. Chromosomes with high fitness ratings are selected as parent chromosomes and various techniques are used to mate the parent chromosomes to produce children chromosomes. Children chromosomes with high fitness ratings are entered into the chromosome population. Defects in a target software system are minimized by evolving ever-shorter chromosomes that produce the same defect. Defect discovery rate, or any other desired characteristic, is thereby maximized.</p>
8 schema:endDate 2017-06-27
9 schema:name Adaptive problem solving method and apparatus utilizing evolutionary computation techniques
10 schema:recipient grid-institutes:grid.419815.0
11 schema:sameAs https://app.dimensions.ai/details/patent/US-6282527-B1
12 schema:sdDatePublished 2022-01-01T19:32
13 schema:sdLicense https://scigraph.springernature.com/explorer/license/
14 schema:sdPublisher N7d441f9cfc0a4a298434fd6a512a3985
15 sgo:license sg:explorer/license/
16 sgo:sdDataset patents
17 rdf:type sgo:Patent
18 N7d441f9cfc0a4a298434fd6a512a3985 schema:name Springer Nature - SN SciGraph project
19 rdf:type schema:Organization
20 N8423549c40bb43618f10491f867d5174 rdf:first Nba38e8044dfb4e69a2fdc7e905c47aef
21 rdf:rest Ndd1a051afc254077aa6fa6998a98265b
22 Nba38e8044dfb4e69a2fdc7e905c47aef schema:name GOUNARES ALEXANDER
23 rdf:type schema:Person
24 Ncdacd55c1b7a4fecb75b9939ba98870a schema:name SIKCHI PRAKASH
25 rdf:type schema:Person
26 Ndd1a051afc254077aa6fa6998a98265b rdf:first Ncdacd55c1b7a4fecb75b9939ba98870a
27 rdf:rest rdf:nil
28 anzsrc-for:06 schema:inDefinedTermSet anzsrc-for:
29 rdf:type schema:DefinedTerm
30 anzsrc-for:0604 schema:inDefinedTermSet anzsrc-for:
31 rdf:type schema:DefinedTerm
32 sg:pub.10.1007/bf00993046 schema:sameAs https://app.dimensions.ai/details/publication/pub.1048698842
33 https://doi.org/10.1007/bf00993046
34 rdf:type schema:CreativeWork
35 sg:pub.10.1038/scientificamerican0792-66 schema:sameAs https://app.dimensions.ai/details/publication/pub.1056571710
36 https://doi.org/10.1038/scientificamerican0792-66
37 rdf:type schema:CreativeWork
38 grid-institutes:grid.419815.0 schema:Organization
 




Preview window. Press ESC to close (or click here)


...