William G Heaton

US Patent:

43442889, Aug 17, 1982

Filed:

Jun 9, 1980

Appl. No.:

6/157517

Inventors:

William C. Heaton - Decatur GA

International Classification:

F02B 7106

US Classification:

60595

Abstract:

An internal combustion engine in which a rotor or turbine is driven by the exhaust gases of a pair of interconnected double-acting pistons. The double-acting pistons are interconnected by a pinion gear and are internally constructed to have an inner piston slidably reciprocating within a chamber defined within an outer piston. The purpose of the inner piston is to feed additional fuel into the main combustion chamber in a controlled manner. Exhaust gases are collected and washed before being exhausted to the atmosphere or recycled within the engine.

US Patent:

44494882, May 22, 1984

Filed:

Jul 20, 1982

Appl. No.:

6/400071

Inventors:

William C. Heaton - Decatur GA

International Classification:

F02B 7100

US Classification:

123 46R

Abstract:

An internal combustion engine in which a rotor or turbine is driven by the exhaust gases of a pair of interconnected double-acting pistons. The double-acting pistons are interconnected by a pinion gear and are internally constructed to have an inner piston slidably reciprocating within a chamber defined within an outer piston. The purpose of the inner piston is to feed additional fuel into the main combustion chamber in a controlled manner. Exhaust gases are collected and washed before being exhausted to the atmosphere or recycled within the engine.

US Patent:

20170024514, Jan 26, 2017

Filed:

Oct 6, 2016

Appl. No.:

15/287504

Inventors:

- Providence RI, US
William Heaton - Cambridge MA, US
Franco Preparata - Providence RI, US
Eli Upfal - Providence RI, US

Assignee:

Nabsys 2.0 LLC - Providence RI

International Classification:

G06F 19/22

Abstract:

Techniques for assembly of genetic maps including de novo assembly of distance maps using multiple alignment consensus construction. Multiple map alignment can be performed on a defined bundle of fragment maps corresponding to biomolecule fragments to determine consensus events and corresponding locations. Fragment maps in the bundle can be removed when there is no overhang from the consensus events. When the subset of fragment maps in the bundle is less than a predetermined threshold, one or more additional fragment maps can be added based on fragment signatures, a consensus alignment score, and a pairwise alignment score. Techniques for multiple alignment can include generating a graph with edges and vertices representing each pairwise relation. An ordered set of sets of events best representing a multiple alignment reflecting all pairwise alignments can be generated by repeatedly randomly removing edges and combining vertices to identify a min cut of the graph.

US Patent:

20140278137, Sep 18, 2014

Filed:

Mar 14, 2014

Appl. No.:

14/212458

Inventors:

- Providence RI, US
William Heaton - Cambridge MA, US
Franco Preparata - Providence RI, US
Eli Upfal - Providence RI, US

Assignee:

NABSYS, INC. - Providence RI

International Classification:

G06F 19/22

US Classification:

702 19

Abstract:

Techniques for assembly of genetic maps including de novo assembly of distance maps using multiple alignment consensus construction. Multiple map alignment can be performed on a defined bundle of fragment maps corresponding to biomolecule fragments to determine consensus events and corresponding locations. Fragment maps in the bundle can be removed when there is no overhang from the consensus events. When the subset of fragment maps in the bundle is less than a predetermined threshold, one or more additional fragment maps can be added based on fragment signatures, a consensus alignment score, and a pairwise alignment score. Techniques for multiple alignment can include generating a graph with edges and vertices representing each pairwise relation. An ordered set of sets of events best representing a multiple alignment reflecting all pairwise alignments can be generated by repeatedly randomly removing edges and combining vertices to identify a min cut of the graph.