Method of computing based on networks of dependent objects

• US 5,455,952 A
• Filed: 03/28/1995
• Issued: 10/03/1995
• Est. Priority Date: 11/03/1993
• Status: Expired due to Fees

• Current Assignee: Cardinal Vision Incorporated
• Original Assignee: Cardinal Vision Incorporated
• Inventors: Gjovaag, Inghard J.
• Primary Examiner(s): Kriess, Kevin A.
• Assistant Examiner(s): Banankhah, Majid A.
• Application Number:
  US08/411,855
• Time in Patent Office: 189 Days
• Field of Search: 395/700, 364/DIG. 1
• US Class Current: 717/108
• CPC Class Codes: G06F 8/20 Software design
• CPC Class Codes: G06F 8/34 Graphical or visual programming

Abstract

An object dependency network-based data visualization system allows a user to graphically edit a network of displayed objects and their interconnections to specify an underlying data computing and data visualization process. Each displayed object is selected by the user from among a menu of objects representing data structures and functions such as data fields to be analyzed, mathematical operations, data input functions, and display manipulation functions. The user graphically draws lines interconnecting ports on the objects that have underlying data structure addresses that establish and control a data and operational flow through the underlying computer-driven process. The underlying process is continually running but only performs a particular computation in response to a data change or state change associated with any of the objects in the network. Thereby, an improved data visualization system is provided that minimizes memory usage and computation time while maintaining accuracy of the computed results, which is particularly beneficial when analyzing data derived from very large data structures such as scalar, vector, and tensor data fields.

Claims

1. In a computer including a processor, a memory, a graphic input device, and a display, a method executed by the computer for analyzing information contained in a data field, comprising the steps of:

storing in the memory a Kernel class data structure executable by the processor to at least one of create, delete, interconnect, and communicate between instances of tool classes, each instance of a tool class having a first address pointer identifying a memory location storing a data structure defining a state of the instance of the tool class and a second address pointer identifying a memory location defining an interconnection port to the instance of the tool class;

storing the data field in the memory at a first memory location;

creating with the Kernel class data structure an instance of a data field tool class having the first address pointer identifying the first memory location;

creating with the Kernel class data structure an instance of a process tool class having the first address pointer identifying a second memory location storing a processor executable process;

interconnecting with the Kernel class data structure the interconnection port of the instance of the data field tool class and the interconnection port of the instance of the process tool class;

requesting by the instance of the process tool class a state of the instance of the data field tool class;

receiving at the instance of the process tool class values of the data field representing the state of the instance of the data field tool class; and

processing the received values of the data field according to the processor executable process identified by the instance of the process tool class.

2. The method of claim 1 in which the data field is one of a scalar data field, a vector data field, and a tensor data field.

3. The method of claim 1 in which the kernel class data structure further assigns a class type to each of the interconnection ports and the interconnecting step is carried out between interconnection ports of a same class type.

4. The method of claim 1 in which each instance of the tool class further includes a third address pointer identifying a memory location storing a data structure defining a displayable object representing the tool class, the method further comprising the steps of:

storing in the memory a graphic editor executable by the processor to interface the graphic input device and the Kernel class data structure;

employing the graphic input device to initiate execution of the creating and interconnecting steps;

retrieving from the memory the displayable objects representing the created instances of a tool classes; and

displaying on the display the displayable objects representing the created instances of the tool classes and a graphical line representing the interconnection formed between the interconnection ports by the interconnecting step.

5. The method of claim 1 further comprising the steps of:

creating with the Kernel class data structure an instance of a display tool class having the first address pointer identifying a third memory location storing a processor executable display driver process;

interconnecting with the Kernel class data structure the interconnection port of the instance of the process tool class and an interconnection port of the instance of the display tool class;

requesting by the instance of the display tool class a state of the instance of the process tool class;

receiving at the instance of the display tool class from the instance of the process tool class the processed received values of the data field; and

displaying on the display in a format defined by the display driver process the processed received values of the data field.

6. The method of claim 5 in which the instance of the process tool class defers the processing step until the requesting by the instance of the display tool class step is executed.

7. In a computer including a processor, a memory, a graphic input device, and a display, a method executed by the computer for analyzing information contained in first and second data fields, comprising the steps of:

storing in the memory a Kernel class data structure executable by the processor to at least one of create, delete, interconnect, and communicate between instances of tool classes, each instance of a tool class having a first address pointer identifying a memory location storing a data structure defining a state of the instance of the tool class and at least a second address pointer identifying at least one memory location forming at least one interconnection port to the instance of the tool class;

storing the first and second data fields in the memory at respective first and second memory locations;

creating with the Kernel class data structure instances of a first data field tool class and a second data field tool class having the first address pointers identifying the respective first and second memory locations;

creating with the Kernel class data structure an instance of a process tool class having the first address pointer identifying a third memory location storing a processor executable process;

interconnecting with the Kernel class data structure the interconnection port of the instance of the first data field tool class and a first input interconnection port of the instance of the process tool class;

interconnecting with the Kernel class data structure the interconnection port of the instance of the second data field tool class and a second input interconnection port of the instance of the process tool class;

requesting by the instance of the process tool class a state of the instances of the first and second data field tool classes;

receiving at the instance of the process tool class values of the first and second data fields representing the respective states of the instances of the first and second data field tool classes; and

processing the received values of the first and second data fields according to the processor executable process identified by the instance of the process tool class.

8. The method of claim 7 in which the first and second data fields are one of a scalar data field type, a vector data field type, and a tensor data field type.

9. The method of claim 7 in which the kernel class data structure further assigns a class type to each of the interconnection ports and the interconnecting steps are carried out between interconnection ports of a same class type.

10. The method of claim 7 in which each instance of the tool class further includes a third address pointer identifying a memory location storing a data structure defining a displayable object representing the tool class, the method further comprising the steps of:

storing in the memory a graphic editor executable by the processor to interface the graphic input device and the Kernel class data structure;

employing the graphic input device to initiate execution of the creating and interconnecting steps;

retrieving from the memory the displayable objects representing the created instances of a tool classes; and

displaying on the display the displayable objects representing the created instances of the tool classes and graphical lines representing the interconnections formed between the interconnection ports by the interconnecting steps.

11. The method of claim 7 further comprising the steps of:

creating with the Kernel class data structure an instance of a display tool class having a first address pointer identifying a fourth memory location storing a processor executable display driver process;

interconnecting with the Kernel class data structure an output interconnection port of the instance of the process tool class and an input interconnection port of the instance of the display tool class;

requesting by the instance of the display tool class a state of the instance of the process tool class;

receiving at the instance of the display tool class from the instance of the process tool class the processed received values of the first and second data fields; and

displaying on the display in a format defined by the display driver process the processed received values of the first and second data fields.

12. The method of claim 11 in which the instance of the process tool class defers the processing step until the requesting by the instance of the display tool class step is executed.

13. The method of claim 7 further comprising the steps of:

creating with the Kernel class data structure an instance of an antecedent tool class having the first address pointer identifying a fourth memory location storing a processor executable process;

interconnecting with the Kernel class data structure an output interconnection port of the instance of the process tool class and an input interconnection port of the instance of the antecedent tool class;

receiving by the antecedent tool class from an instance of a dependent tool class a request for a state of the instance of the antecedent tool class;

referring to the instance of the process tool class an indirect evaluation required by the instance of the antecedent tool class to satisfy the request;

receiving at the instance of the antecedent tool class from the instance of the process tool class a result of the indirect evaluation; and

sending the state of the antecedent tool class to the instance of the dependent tool class.