Benjamin M Howe

US Patent:

20100268512, Oct 21, 2010

Filed:

Apr 21, 2009

Appl. No.:

12/427474

Inventors:

Benjamin M. Howe - Plano TX, US
Daniel W. Otts - Allen TX, US
Winthrop W. Smith - Richardson TX, US

Assignee:

Raytheon Company - Waltham MA

International Classification:

G06F 17/50
G06F 15/00

US Classification:

703 1, 702189

Abstract:

In particular embodiments, analyzing data includes receiving sensor data generated in response to sensing one or more structures. The structural features of the sensor data are identified. Each structural feature is represented by one or more vectors. A score matrix that describes a plurality of distances among the vectors is generated. Vector pairs are formed from at least some of the vectors according to the distances of the score matrix. A layout of the structures is generated from the vector pairs.

US Patent:

20120087389, Apr 12, 2012

Filed:

Oct 7, 2010

Appl. No.:

12/900096

Inventors:

Benjamin M. Howe - Plano TX, US
Gary A. Frazier - Garland TX, US

Assignee:

Raytheon Company - Waltham MA

International Classification:

G01K 13/00
G01K 7/00

US Classification:

374142, 374163, 374141, 374E07001, 374E13001

Abstract:

An apparatus includes a temperature detector coupled to a conductive layer of an electrophoretic display device. The temperature detector is operable to measure a leakage current that is responsive to a temperature associated with the electrophoretic device and determine the temperature associated with the electrophoretic device based at least in part on the measured leakage current.

US Patent:

20170344439, Nov 30, 2017

Filed:

May 27, 2016

Appl. No.:

15/166724

Inventors:

- WALTHAM MA, US
BENJAMIN M. HOWE - PLANO TX, US

International Classification:

G06F 11/14

Abstract:

A massively parallel real-time computing system receives input data events across many compute nodes, each with a processing algorithm in its processing pipeline. An Event Manager is placed before the algorithm processing pipelines, receives metadata about each incoming event, and collects and organizes it in a database. A fast histogram compares the metadata about each event to that of all the other events, in a processing interval. For sufficiently matching metadata, the events are forwarded to the processing nodes as “regular” events for processing. If the metadata for a processing interval does not match sufficiently, the histogram decides which events are the “correct” events and which events are “incorrect.” The “correct” events are sent on for processing and the “incorrect” events are combined with the “correct” metadata and sent back to the processing nodes to supplement or modify their incoming data to match the other nodes' expectations.