John J Esch

US Patent:

20060139475, Jun 29, 2006

Filed:

Dec 23, 2004

Appl. No.:

11/022370

Inventors:

John Esch - Burnsville MN, US
Rick Stevens - Apple Valley MN, US
Kevin Thorson - Eagan MN, US
James Howe - Burnsville MN, US
Stephen Sohn - Shoreview MN, US
Timothy Zajic - Boxford MA, US

International Classification:

H04N 5/225

US Classification:

348340000

Abstract:

Systems and apparatuses are provided that include a number of cameras. One embodiment includes a surveillance camera. The embodiment includes a camera having a lens with a first field of view. The camera can be mounted to an imaging circuit board having an imaging circuit provided thereon for converting image data from the lens into a digital field of view.

US Patent:

20070007303, Jan 11, 2007

Filed:

Jul 8, 2005

Appl. No.:

11/177711

Inventors:

John Esch - Burnsville MN, US

International Classification:

B65D 35/00

US Classification:

222107000, 222092000

Abstract:

A decoration means () for retainers of collapsible tubes and bags. A user of a toothpaste or similar tube will normally progressively coil, lap or fold the bottom end of the tube as the contents of the tube is used. The user of a plastic or other collapsible bag will normally progressive coil, lap or fold the open end of the bag as the contents is used. The retainer device is attached to the coils, laps or folds of the tube or bag, holding them firmly in place, thereby preventing any uncoiling, un-lapping, or unfolding. The current invention provides a means () to add decoration () to the retaining device and, in some cases, change the decoration () and ().

US Patent:

45063257, Mar 19, 1985

Filed:

Nov 15, 1982

Appl. No.:

6/441962

Inventors:

Donald B. Bennett - Burnsville MN
John W. Esch - Burnsville MN

Assignee:

Sperry Corporation - New York NY

International Classification:

G06F 500
H03K 1300

US Classification:

364200

Abstract:

A method of and apparatus for encoding computer program instructions and data greatly reduces the total storage requirements. Upon compiling each computer program segment, statistics are generated regarding the frequency of use of each unique program operator and each unique program operand. The operators and operands are encoded using the information theoretic encoding technique. A conversion table is also prepared which enables the object computer to translate the encoded operands and operators during that time when the computer program segment is being executed. Apparatus within the object computer decodes the encoded operands and operators using the conversion tables enabling execution of the computer program segment.

US Patent:

49640631, Oct 16, 1990

Filed:

Sep 15, 1988

Appl. No.:

7/244365

Inventors:

John W. Esch - Burnsville MN

Assignee:

Unisys Corporation - Blue Bell PA

International Classification:

G06F 1518

US Classification:

364513

Abstract:

Conceptual structures which can be used to represent any knowledge that can be represented by frames/units. Its realization, in a software program called Unit Interface, provides a method of storing frame/unit data in conceptual structures and algorithms for accessing that data when stored in conceptual structures as if it were a frame/unit or collection of them.

US Patent:

20230049179, Feb 16, 2023

Filed:

Sep 22, 2022

Appl. No.:

17/950479

Inventors:

- Minneapolis MN, US
John W. Esch - Burnsville MN, US

International Classification:

G06N 3/04

Abstract:

A memory for storing a directed acyclic graph (DAG) for access by an application being executed by one or more processors of a computing device is described. The DAG includes a plurality of nodes, wherein each node represents a data point within the DAG. The DAG further includes a plurality of directional edges. Each directional edge connects a pair of the nodes and represents a covering-covered relationship between two nodes. Each node comprises a subgraph consisting of the respective node and all other nodes reachable via a covering path that comprises a sequence of covering and covered nodes. Each node comprises a set of node parameters including at least an identifier and an address range. Each node and the legal address specify a cover path. Utilizing DAG Path Addressing with bindings the memory can be organized to store a generalization hierarchy of logical propositions.