18319517. STORAGE MEDIUM, FLOW GENERATION METHOD, AND INFORMATION PROCESSING DEVICE simplified abstract (Fujitsu Limited)

From WikiPatents
Jump to navigation Jump to search

STORAGE MEDIUM, FLOW GENERATION METHOD, AND INFORMATION PROCESSING DEVICE

Organization Name

Fujitsu Limited

Inventor(s)

Akito Maruo of Atsugi (JP)

Hideyuki Jippo of Atsugi (JP)

Takeshi Soeda of Kawasaki (JP)

STORAGE MEDIUM, FLOW GENERATION METHOD, AND INFORMATION PROCESSING DEVICE - A simplified explanation of the abstract

This abstract first appeared for US patent application 18319517 titled 'STORAGE MEDIUM, FLOW GENERATION METHOD, AND INFORMATION PROCESSING DEVICE

Simplified Explanation

The patent application describes a computer program stored on a non-transitory computer-readable storage medium that generates processing flows based on metadata and genetic programming.

  • The program selects a processing flow based on the similarity level of metadata with respect to a given problem.
  • It specifies a tree structure of the process flow based on genetic programming using the selected processing flow as an initial individual.

Potential Applications

This technology could be applied in various fields such as data processing, optimization algorithms, and artificial intelligence.

Problems Solved

1. Efficient generation of processing flows based on metadata. 2. Automated selection of processing flows for different problems.

Benefits

1. Improved efficiency in processing flow generation. 2. Automated decision-making based on metadata similarity. 3. Enhanced adaptability to different problem scenarios.

Potential Commercial Applications

"Automated Processing Flow Generation for Data Analysis and Optimization"

Possible Prior Art

There may be prior art related to genetic programming for process flow generation and metadata-based decision-making in computer programs.

Unanswered Questions

How does the program handle conflicting metadata similarities between different processing flows?

The abstract does not provide information on how the program resolves conflicts when multiple processing flows have similar metadata with respect to a given problem.

What is the computational complexity of the genetic programming algorithm used in the process flow specification?

The abstract does not mention the computational complexity or efficiency of the genetic programming algorithm employed in specifying the process flow structure.


Original Abstract Submitted

A non-transitory computer-readable storage medium storing a flow generation program that causes at least one computer to execute a process, the process includes based on first metadata that corresponds to a first problem of processing flow generation, selecting a processing flow that corresponds to a second problem with second metadata with a certain similarity level with respect to the first metadata by referring to a memory that stores a plurality pieces of metadata and a plurality of processing flows that correspond to each of a plurality of problems, the plurality of problems including the first problem and the second problem; and specifying a tree structure of the process flow that corresponds to the first problem based on genetic programming that uses the selected processing flow as an initial individual.