Dennis L Carroll

US Patent:

6967593, Nov 22, 2005

Filed:

Jun 26, 2003

Appl. No.:

10/607409

Inventors:

Dennis J. Carroll - Houston TX, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G08G001/095

US Classification:

340907, 340555, 340556, 340557, 340902, 250334, 353 13, 33264

Abstract:

Under the present invention, a warning unit having a light source (e. g. , a laser) is mounted on an emergency vehicle. The light source first emits a low intensity light beam (e. g. , an infrared light beam) to scan an area in front of the emergency vehicle. The scan is used to detect one or more objects having a height to width ratio exceeding a predetermined threshold. Specifically, the scan is used to detect one or more tall, narrow objects such as poles, sign posts, etc. , while ignoring other objects such as people, animals, etc. Once any applicable objects are detected, a second, higher intensity light beam is emitted to illuminate the detected objects with a predetermined indicia. The predetermined indicia can be observed by other motorists and indicates to them a direction of origin of the emergency vehicle.

US Patent:

7151830, Dec 19, 2006

Filed:

Dec 24, 2002

Appl. No.:

10/329234

Inventors:

Dennis J. Carroll - Houston TX, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H04K 1/00
H04L 9/00
H04L 9/28

US Classification:

380 28, 380 46

Abstract:

Under the present invention, a state machine representation is used to encrypt/decrypt a message of data values. The state machine representation includes a plurality of nodes, wherein each of the data values are assigned to at least one of the plurality of nodes, wherein each of the plurality of nodes includes one or more transition vectors that each have a unique value, and wherein each of the one or more transition vectors starts from one of the plurality of nodes and leads to another one of the plurality of nodes. To encrypt the message, a sequence of transition vectors is traversed from a start node. As the transitional vectors are traversed, the corresponding unique values are recorded in sequence. When one of the data values is encountered at a node, a random number is generated and recorded in the sequence. Once all data values have been encountered, a string of the recorded unique values and the random values is outputted to a recipient.

US Patent:

7260216, Aug 21, 2007

Filed:

Aug 20, 2003

Appl. No.:

10/644446

Inventors:

Dennis J. Carroll - Houston TX, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

H04K 1/00
H04L 9/00
H04L 9/28

US Classification:

380 28, 380 45

Abstract:

A state machine representation is provided that includes a plurality of nodes that are assigned a unique node identifier and an output value, and that are grouped into color segments. The nodes are interconnected by transitional vectors, with each transitional vector being assigned a unique value. Further, at least one of the nodes has a termination vector that leads to a termination point. To encrypt the set of data values, a start node is identified and any path of transitional vectors is be traversed from node to node. As each transitional vector is traversed, its corresponding unique value will be recorded in sequence. When a node is reached that has an output value that matches one of the set of data values, an invalid unique value is designated and recorded in sequence with the unique values.

US Patent:

7370058, May 6, 2008

Filed:

Oct 28, 2003

Appl. No.:

10/696404

Inventors:

Dennis J. Carroll - Houston TX, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 7/00
G06F 17/00

US Classification:

707102, 707101, 707100

Abstract:

A method and associated algorithm for sorting S sequences of binary bits. The S sequences may be integers, floating point numbers, or character strings. The algorithm is executed by a processor of a computer system. Each sequence includes contiguous fields of bits. The algorithm executes program code at nodes of a linked execution structure in a sequential order with respect to the nodes. The algorithm executes a masking of the contiguous fields of the S sequences in accordance with a mask whose content is keyed to the field being masked. The sequential order of execution of the nodes is a function of an ordering of masking results of the masking. Each sequence, or a pointer to each sequence, is outputted to an array in the memory device whenever the masking places the sequence in a leaf node of the nodal linked execution structure.

US Patent:

7467138, Dec 16, 2008

Filed:

Dec 14, 2004

Appl. No.:

11/011930

Inventors:

Dennis J. Carroll - Houston TX, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30
G06F 15/76
G06F 15/00

US Classification:

707 7, 712 8, 712300

Abstract:

A method and associated algorithm for in-place sorting S sequences of binary bits stored contiguously in an array within a memory device of a computer system prior to the sorting. Each sequence includes contiguous fields of bits. The algorithm is executed by a processor of a computer system. The in-place sorting executes program code at each node of a linked execution structure. Each node includes a segment of the array. The program code is executed in a hierarchical sequence with respect to the nodes. Executing program code at each node includes: dividing the segment of the node into groups of sequences based on a mask field having a mask width, wherein each group has a unique mask value of the mask field; and in-place rearranging the sequences in the segment, wherein the rearranging results in each group including only those sequences having the unique mask value of the group.

US Patent:

7509309, Mar 24, 2009

Filed:

Jun 22, 2006

Appl. No.:

11/473288

Inventors:

Dennis J. Carroll - Houston TX, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707 3, 707102

Abstract:

A method and associated algorithm for sorting S sequences of binary bits. The S sequences may be integers, floating point numbers, or character strings. The algorithm is executed by a processor of a computer system. Each sequence includes contiguous fields of bits. The algorithm executes program code at nodes of a linked execution structure in a sequential order with respect to the nodes. The algorithm executes a masking of the contiguous fields of the S sequences in accordance with a mask whose content is keyed to the field being masked. The sequential order of execution of the nodes is a function of an ordering of masking results of the masking. Each sequence, or a pointer to each sequence, is outputted to an array in the memory device whenever the masking places the sequence in a leaf node of the nodal linked execution structure.

US Patent:

7788268, Aug 31, 2010

Filed:

Jan 8, 2008

Appl. No.:

11/970600

Inventors:

Dennis James Carroll - Houston TX, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 17/30

US Classification:

707752

Abstract:

A method and system for in-place sorting S sequences of binary bits stored contiguously in an array within a memory device of a computer system prior to the sorting. Each sequence includes contiguous fields of bits. Program code is executed at each node of a linked execution structure in a hierarchical sequence. Each node includes a segment of the array. Executing program code at each node includes: identifying R sequences of the S sequences at each node; ascertaining a mask width W that is specific to each node and is a function of R; dividing the R sequences of the node into G groups of sequences based on a mask field having the mask width W, wherein G=2; and in-place rearranging the R sequences, wherein the rearranging results in each group including only those sequences having the unique mask value of the group.

US Patent:

7870159, Jan 11, 2011

Filed:

Jan 2, 2008

Appl. No.:

11/968266

Inventors:

Dennis J. Carroll - Houston TX, US

Assignee:

International Business Machines Corporation - Armonk NY

International Classification:

G06F 7/00
G06F 17/00

US Classification:

707791, 707956, 712 8, 712300

Abstract:

A computer program product and associated algorithm for sorting S sequences of binary bits. The S sequences may be integers, floating point numbers, or character strings. The algorithm is executed by a processor of a computer system. Each sequence includes contiguous fields of bits. The algorithm executes program code at nodes of a linked execution structure in a sequential order with respect to the nodes. The algorithm executes a masking of the contiguous fields of the S sequences in accordance with a mask whose content is keyed to the field being masked. The sequential order of execution of the nodes is a function of an ordering of masking results of the masking. Each sequence, or a pointer to each sequence, is outputted to an array in the memory device whenever the masking places the sequence in a leaf node of the nodal linked execution structure.

Author:

Dennis J. Carroll

ISBN #:

0820419672

Author:

Dennis Carroll

ISBN #:

0312004451

Author:

Dennis Carroll

ISBN #:

0333413660

Author:

Dennis Carroll

ISBN #:

0820401919

Author:

Dennis Carroll

ISBN #:

0756706874

Author:

Dennis Carroll

ISBN #:

0824808053

Author:

Dennis Carroll

ISBN #:

0868193666