Douglas C Beethe

US Patent:

53135750, May 17, 1994

Filed:

May 14, 1993

Appl. No.:

8/063102

Inventors:

Douglas C. Beethe - Loveland CO

Assignee:

Hewlett-Packard Company - Palo Alto CA

International Classification:

G06F 1560

US Classification:

395159

Abstract:

An iconic programming system wherein each icon within the system may have zero or more data input connections, zero or more data output connections, an optical sequence input connection, and an optional sequence output connection. Each of these connections may be used to graphically connect each icon to another icon to form a network of icons that operates as a computer program. Execution of the network is accomplished by processing each icon and performing any programming functions represented by the icon. After an icon is processed, data resulting from the processing is sent to all icons connected to data or sequence output connections, and those icons are scheduled for processing. Any start icons in the network are scheduled to process first. If an icon is scheduled for processing and it does not have data available to an input, the icon connected to that input is scheduled.

US Patent:

52610438, Nov 9, 1993

Filed:

Mar 12, 1991

Appl. No.:

7/668286

Inventors:

Susan G. Wolber - Ft. Collins CO
Douglas C. Beethe - Loveland CO

Assignee:

Hewlett-Packard Company - Palo Alto CA

International Classification:

G06F 1560

US Classification:

395159

Abstract:

A system that allows a user of an iconic programming system to specify data input constraints on any terminal of any icon of an iconic network program defined within the system. When adding connecting lines between icons during program creation, the iconic programming system verifies that any input constraints defined for an input terminal match the data type and shape of the data being sent by an output terminal. If a mismatch occurs, the system will allow a connection only if a method is available for converting the type and shape of the data. During the execution of the iconic network program, the constraints for each input terminal are compared to the type and shape of data being received on the terminal. Processing will continue only if the constraints match or the data can be converted.

US Patent:

55510418, Aug 27, 1996

Filed:

Dec 15, 1992

Appl. No.:

7/991485

Inventors:

Douglas C. Beethe - Loveland CO

Assignee:

Hewlett-Packard Company - Palo Alto CA

International Classification:

G06F 1314

US Classification:

395733

Abstract:

Disclosed in an iconic programming system process for processing the icons within an iconic network. When a user starts execution of the iconic system, the system first separates the icons into a list of threads, and creates a pending queue and a done stack for each thread. Execution then starts by selecting the first icon in the pending queue of the first thread within the system, processing the icon, and placing the icon on the done stack. After all icons on the pending queue are processed, icons are removed from the done stack and a sequence signal is sent on the sequence output for the icon. If a service request is received, the subthread hosted by an active service request icon is immediately made the highest priority, and processing continues with this subthread until the subthread is completely processed.

US Patent:

54370078, Jul 25, 1995

Filed:

Nov 10, 1992

Appl. No.:

7/974860

Inventors:

Randy L. Bailey - Ft. Collins CO
Douglas C. Beethe - Windsor CO
James P. Armentrout - Loveland CO

Assignee:

Hewlett-Packard Company - Palo Alto CA

International Classification:

G06F 314

US Classification:

395159

Abstract:

An iconic programming system that provides a sequencer icon to allow a series of operations to be performed, along with the conditions under which the operations are performed. Each operation performed, called a transaction, can be enabled or disabled, or can be enabled by a function within the process. The results of each transaction can be compared to tolerance limits and alternate subsequent transactions processed based upon whether the transaction results fell within the tolerance limits. The output of each transaction can be logged into a buffer to keep the results for later analysis.

US Patent:

52934764, Mar 8, 1994

Filed:

Mar 12, 1991

Appl. No.:

7/668285

Inventors:

Susan G. Wolber - Ft. Collins CO
Douglas C. Beethe - Loveland CO

Assignee:

Hewlett-Packard Co. - Palo Alto CA

International Classification:

G06F 1560

US Classification:

395159

Abstract:

An iconic programming system allowing a user to specify data input constraints and names for any terminal of any icon of an iconic network program defined within the system. The system allows names of any length and allows a programmer to change the names at any time after the iconic network is created. The system further provides a facility to lock the names so that they cannot be changed later.

US Patent:

53135741, May 17, 1994

Filed:

Oct 24, 1991

Appl. No.:

7/782220

Inventors:

Douglas C. Beethe - Loveland CO

Assignee:

Hewlett-Packard Company - Palo Alto CA

International Classification:

G06F 1562

US Classification:

395159

Abstract:

A iconic programming system process represented by a directed graph of icons and connections. When a user starts execution of the iconic system, the system first separates the icons into a list of threads starting with icons at the highest level of the graph. Icons at lower levels of the graph, such as icons within subprograms or virtual threads, will be placed on a thread when the subprogram or virtual thread is started. Virtual threads contain all icons connected to the output of an iteration icon. Each thread is processed by selecting a start icon, or by randomly selecting an unconstrained icon if no start icons are present. Processing continues by processing each icon which has all data input available. Each of the threads is processed by processing one icon per thread in each cycle, until all icons have been processed.