Abstract: Systems and methods for monitoring chain health of a chain having multiple links in a closed loop, as the chain cycles. The system includes: a camera statically positioned with respect to the chain, the camera configured to generate a frame to include a link from among the multiple links; and a controller module operationally coupled to the camera and programmed to repeat the steps of: receiving the frame; converting the frame to a black and white frame with a high-contrast; identifying a link type of the link in the black and white frame based on referencing a plurality of predefined skyline templates; and, storing the link with the link type and a respective temporal marker in a cache, storing a sequence. The system continues until discovering that the chain has cycled back to the starting link, identifies a type of chain for the chain, and fingerprints the chain.

Abstract: Systems and methods for monitoring chain health of a chain having multiple links in a closed loop, as the chain cycles. The system includes: a camera statically positioned with respect to the chain, the camera configured to generate a frame to include a link from among the multiple links; and a controller module operationally coupled to the camera and programmed to repeat the steps of: receiving the frame; converting the frame to a black and white frame with a high-contrast; identifying a link type of the link in the black and white frame based on referencing a plurality of predefined skyline templates; and, storing the link with the link type and a respective temporal marker in a cache, storing a sequence. The system continues until discovering that the chain has cycled back to the starting link, identifies a type of chain for the chain, and fingerprints the chain.

Abstract: A computer program product and computer system for in-place sorting sequences of binary bits stored contiguously in an array within a memory device of the computer system prior to sorting. Each sequence includes contiguous fields of bits. The algorithm is executed by a processor of the 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.

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.

Abstract: A computer program product and computer system for in-place sorting sequences of binary bits stored contiguously in an array within a memory device of the computer system prior to sorting. Each sequence includes contiguous fields of bits. The algorithm is executed by a processor of the 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.

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.

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.

Abstract: Disclosed are a method of and system for assuring a person's identity. A first party registers with an identity service and gives that service a first set of answers to a set of questions and additional data; the identity service gives the first party identification information; and the first party, through interacting with the identity service, establishes its identity with a second party. To do this, the first party gives the second party the identification information and a second set of answers to the set of questions. The second party sends the identification information and the second set of answers to the identity service. The service analyzes the identification information and the first and second sets of answers to determine an identification quality rating for the first party, and sends that rating to the second party.

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.

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.

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.

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.

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.

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.