Abstract: The present disclosure describes a firmware analysis system and method that can generate a collection of protocol constraints from known firmware and apply the collection of protocol constraints towards an unknown firm to recognize protocol relevant fields and detect functionality within the unknown firmware.

Abstract: In some examples, a method includes receiving a plaintext message including plaintext data and error detection bits. The method also includes encrypting the plaintext message based on a feedback algorithm to generate an encrypted message including a set of encrypted bits for error detection, cryptographic integrity, and cryptographic authentication. The set of encrypted bits for error detection, cryptographic integrity, and cryptographic authentication can replace the error detection bits in whole or in part. A receiver can confirm the cryptographic integrity and the cryptographic authentication of the encrypted message by decrypting the set of encrypted bits.

Abstract: In an embodiment, a computing node includes a computing circuit, a comparing circuit, and an indicator circuit. The computing circuit is configured to generate a first redundant message that corresponds to, and that is independent of, a source message propagating over a network during at least one time period. The comparing circuit is configured to compare information content of one or more corresponding portions of the source message and the first redundant message during each of the at least one time period to generate a comparison result. And the indicator circuit is configured to indicate whether the source message is valid or invalid in response to the comparison result. For example, such computing node can determine the validity of a redundant result with reduced processing overhead, reduced message delay, and reduced message latency as compared to existing computer nodes.

Abstract: A network includes a plurality of nodes and a plurality of links communicatively coupling each of the nodes to at least one respective adjacent node via a first communication channel and to another respective adjacent node via a second communication channel. The nodes and links have a braided ring topology. First and second nodes of the plurality of nodes source data, are adjacent nodes, and at least one is a source node. The first node sends a first communication to the second node via a third node that is adjacent the first node and via a fourth node that is adjacent the second node. The second node sends a second communication to the first node via the third node and via the fourth node. At least one of the first and second nodes terminates transmission of the first and second communications when the first and second communications do not match.

Abstract: In an embodiment, a computing node includes a computing circuit, a comparing circuit, and an indicator circuit. The computing circuit is configured to receive each of at least one input-data message. The comparing circuit is configured to compare each of the at least one received input-data message to a list of input-data-message identifiers. And the indicator circuit is configured, for each of the at least one input-data message that corresponds to a respective input-data-message identifier, to generate a respective portion of a first status message, the respective portion indicating that the input-data message was received. For example, such computing node can determine the congruency of a received input-data message between coupled redundancy circuits with reduced processing overhead, reduced message delay, and reduced message latency as compared to existing computer nodes.

Abstract: An electronic gaming machine includes a game controller that executes instructions that cause the game controller to at least: (i) display, on a display, a plurality of reels, each reel of the plurality of reels comprising a plurality of symbols, each symbol representing a puzzle piece including a plurality of connectors; (ii) simulate spinning and stopping each reel of the first plurality of reels, whereby symbols from each reel of the first plurality of reels are stopped and displayed; (iii) evaluate the plurality of symbols displayed on of the plurality of reels; (iv) determine, in response to the evaluating, which of the displayed symbols match with adjacent symbols, wherein matching an adjacent symbol includes interconnecting between adjacent connectors on adjacent symbols; and (v) provide a game award in response to the determining.

Abstract: Devices, methods, systems, and computer-readable media for auto-commissioning of devices in a communication network are described herein. One or more embodiments include a method for auto-commissioning of a device added to a communication network, comprising: determining properties of signal transitions of the communication network via a device added to the network while the signal transitions of the communication network are passing unchanged, and processing the signal transitions of the communication network, via the device, based on the properties of the signal transitions.

Abstract: Devices, methods, systems, and computer-readable media for auto-commissioning of devices in a communication network are described herein. One or more embodiments include a method for auto-commissioning of a device added to a communication network, comprising: determining properties of signal transitions of the communication network via a device added to the network while the signal transitions of the communication network are passing unchanged, and processing the signal transitions of the communication network, via the device, based on the properties of the signal transitions.

Abstract: Devices, methods, systems, and computer-readable media for auto-commissioning of devices in a communication network are described herein. One or more embodiments include a method for auto-commissioning of a device added to a communication network, comprising: determining properties of signal transitions of the communication network via a device added to the network while the signal transitions of the communication network are passing unchanged, and processing the signal transitions of the communication network, via the device, based on the properties of the signal transitions.

Abstract: Devices, methods, systems, and computer-readable media for auto-commissioning of devices in a communication network are described herein. One or more embodiments include a method for auto-commissioning of a device added to a communication network, comprising: determining properties of signal transitions of the communication network via a device added to the network while the signal transitions of the communication network are passing unchanged, and processing the signal transitions of the communication network, via the device, based on the properties of the signal transitions.

Abstract: Methods and systems for using simple authenticated messages are disclosed for use with implementing (i) synchronization schemes, (ii) encoded control messaging schemes, and (iii) encrypted data communication schemes. Messages are authenticated by applying a secure hash function to one or more authentication tokens to produce hash results which are compared to stored trusted bit strings, wherein the stored trusted bit strings are replaced with the most-recently received authentication token whose corresponding hash result matched the stored bit string.

Abstract: A wine rack system for the easy assembly of a custom-fitted wine rack apparatus is described. The system comprises parts that enable the construction of the wine rack apparatus that is able to be easily assembled and custom-fitted into a variety of differently-sized home storage spaces and affixed to at least one storage space surface. The resulting wine rack apparatus is sturdy, flexible, modular and stationary.

Abstract: The present invention concerns a lighting substrate that supports an array of lights, and in particular small decorative lights. The invention also concerns a lighting arrangement incorporating the lighting substrate together with an array of lights.

Abstract: Methods and systems for using simple authenticated messages are disclosed for use with implementing (i) synchronization schemes, (ii) encoded control messaging schemes, and (iii) encrypted data communication schemes. Messages are authenticated by applying a secure hash function to one or more authentication tokens to produce hash results which are compared to stored trusted bit strings, wherein the stored trusted bit strings are replaced with the most-recently received authentication token whose corresponding hash result matched the stored bit string.

Abstract: Methods and an associated apparatus are disclosed for providing fault tolerance for memory. The method involves generating a remapping value. Then the remapping value may be logically combined with the address value intended for accessing a given memory location to remap the bad address to an unused address.

Abstract: Methods and an associated apparatus are disclosed for providing fault tolerance for memory. The method involves generating a remapping value. Then the remapping value may be logically combined with the address value intended for accessing a given memory location to remap the bad address to an unused address.

Abstract: Methods and an associated apparatus are disclosed for providing fault tolerance for memory. The method involves generating a remapping value. Then the remapping value may be logically combined with the address value intended for accessing a given memory location to remap the bad address to an unused address.