Abstract: Non-harmful data mimicking computer network attacks may be inserted in a computer network. Anomalous real network connections may be generated between a plurality of computing systems in the network. Data mimicking an attack may also be generated. The generated data may be transmitted between the plurality of computing systems using the real network connections and measured to determine whether an attack is detected.

Abstract: Non-harmful data mimicking computer network attacks may be inserted in a computer network. Anomalous real network connections may be generated between a plurality of computing systems in the network. Data mimicking an attack may also be generated. The generated data may be transmitted between the plurality of computing systems using the real network connections and measured to determine whether an attack is detected.

Abstract: Non-harmful data mimicking computer network attacks may be inserted in a computer network. Anomalous real network connections may be generated between a plurality of computing systems in the network. Data mimicking an attack may also be generated. The generated data may be transmitted between the plurality of computing systems using the real network connections and measured to determine whether an attack is detected.

Abstract: In an embodiment, a secure module is provided that provides access keys to an unsecured system. In an embodiment, the secure module may generate passcodes and supply the passcodes to the unsecured system. In an embodiment, the access keys are sent to the unsecured system after receiving the passcode from the unsecured system. In an embodiment, after authenticating the passcode, the secure module does not store the passcode in its memory. In an embodiment, the unsecured module requires the access key to execute a set of instructions or another entity. In an embodiment, the unsecured system does not store access keys. In an embodiment, the unsecured system erases the access key once the unsecured system no longer requires the access key. In an embodiment, the unsecured system receives a new passcode to replace the stored passcode after using the stored passcode. Each of these embodiments may be used separately.

Abstract: The security of an entity is protected by using passcodes. A passcode device generates a passcode. In an embodiment, the passcode is generated in response to receipt of user information. The passcode is received by another system, which authenticates the passcode by at least generating a passcode from a passcode generator, and comparing the generated passcode with the received passcode. The passcode is temporary. At a later use a different passcode is generated from a different passcode generator.

Abstract: A collapsible container includes a base, a top, and opposed side covers arranged between the base and the top. The side covers have a lower section frame pivotally connected to the base and a top section frame pivotally connected to the top, and a central hinge arrangement configured so that the top section frame is pivotally movable relative to the lower section frame. The side covers can thus be selectively positioned between an erected position and a collapsed position. In the erected position, the container presents an interior space. End covers are arranged to be pivotally movable between an upright position for covering respective open ends, and a down position for allowing the side covers to be movable to the collapsed position.

Abstract: In an embodiment, a secure module is provided that provides access keys to an unsecured system. In an embodiment, the secure module may generate passcodes and supply the passcodes to the unsecured system. In an embodiment, the access keys are sent to the unsecured system after receiving the passcode from the unsecured system. In an embodiment, after authenticating the passcode, the secure module does not store the passcode in its memory. In an embodiment, the unsecured module requires the access key to execute a set of instructions or another entity. In an embodiment, the unsecured system does not store access keys. In an embodiment, the unsecured system erases the access key once the unsecured system no longer requires the access key. In an embodiment, the unsecured system receives a new passcode to replace the stored passcode after using the stored passcode. Each of these embodiments may be used separately.

Abstract: Protecting the security of an entity by using passcodes is disclosed. A passcode device generates a passcode. In an embodiment, the passcode is generated in response to receipt of user information. The passcode is received by another system, which authenticates the passcode by at least generating a passcode from a passcode generator, and comparing the generated passcode with the received passcode. The passcode is temporary. At a later use a different passcode is generated from a different passcode generator.

Abstract: In an embodiment, a lock mechanism has a lock shaft, a motor, and a lock cylinder, wherein the motor rotates a cog that moves the lock cylinder into and out of the lock shaft. The lock cylinder is oriented concentric to an axis about which the lock cylinder rotates. Rotating the cog causes the lock cylinder to rotate about the axis, which in turn causes the lock cylinder to more into and out of the lock shaft in a direction along the axis. In an embodiment, the cog has no translational motion in a direction parallel to the axis. The lock cylinder may have grooves, and the cog may engage the grooves. Rotating the cog may causes the lock cylinder to rotate with the cog, and the cog to slide within the grooves as the lock cylinder moves along the axis.

Abstract: A method relates to conducting a card based game of chance for a charity wherein a game is played at a plurality of remote play locations and the charity benefits from increased player participation. The method includes distributing game cards to purchasing players at a plurality of remote locations, the game cards containing game data related to the game of chance. At the remote locations and prior to initiation of the game, the game data of each individual game card is exchanged and validated with a central server location. Information is exchanged between the remote location and the central server location. The game of chance is conducted at the remote location and, for any purported winning cards, exchanging game data of such cards with the central server location and performing a post-game validation at the central server location of the purported winning cards.

Abstract: Biometric Authentication Lock Mechanism, called BALM, is a novel fingerprint enabled lock mechanism for bike locks, lockboxes, handguns, luggage, briefcases, desk drawers, cash registers, gym lockers and padlocks. Until BALM, mechanical locks required a key, a combination number, or an access code. Furthermore, most of these locks utilized a tumbler. BALM enables customers to open their lock with only their finger. With BALM, there are no more keys to lose, or combination numbers to forget.

Abstract: An active element machine is a new kind of computing machine. When implemented in hardware, the active element machine can execute multiple instructions simultaneously, because every one of its computing elements is active. This greatly enhances the computing speed. By executing a meta program whose instructions change the connections in a dynamic active element machine, the active element machine can perform tasks that a digital computer are unable to compute. In an embodiment, instructions in a computer language are translated into instructions in a register machine language. The instructions in the register machine language are translated into active element machine instructions. In an embodiment, an active element machine may be programmed using instructions for a register machine. The active element machine is not limited to these embodiments.

Abstract: NADO is a process for encrypting and decrypting information in a variety of cryptographic devices. The underlying process is a fast stream-like cipher that can be implemented efficiently in analog or digital hardware or in software. The NADO process makes use of three novel methods in cryptography: 1) A sequence of permutations which scrambles and spreads out the encrypted information; (2) A state generator built with a non-autonomous dynamical system to generate an unpredictable sequence of states; (3) One or more perturbators which perturb both the non-autonomous dynamical system and the sequence of permutations in a non-periodic way.

Abstract: An active element machine is a new kind of computing machine. When implemented in hardware, the Active element machine can execute multiple instructions simultaneously, because every one of its computing elements is active. This greatly enhances the computing speed. By executing a meta program whose instructions change the connections in a dynamic Active element machine, the Active element machine can perform tasks that digital computers are unable to compute.

Abstract: In an embodiment, instructions in a computer language are translated into instructions in a register machine language. The instructions in the register machine language are translated into active element machine instructions. In an embodiment, an active element machine may be programmed using instructions for a register machine.

Abstract: An Effector machine is a new kind of computing machine. When implemented in hardware, the Effector machine can execute multiple instructions simultaneously because every one of its computing elements is active. This greatly enhances the computing speed. By executing a meta program whose instructions change the connections in a dynamic Effector machine, the Effector machine can perform tasks that digital computers are unable to compute.

Abstract: Protecting the security of an entity by using passcodes is disclosed. A passcode device generates a passcode. In an embodiment, the passcode is generated in response to receipt of user information. The passcode is received by another system, which authenticates the passcode by at least generating a passcode from a passcode generator, and comparing the generated passcode with the received passcode. The passcode is temporary. At a later use a different passcode is generated from a different passcode generator.

Abstract: A method for adapting a game of bingo to a lottery, includes predetermining a plurality of bingo faces to achieve a desired liability profile. One or more of the plurality of bingo faces are distributed. Random call numbers are generated until a desired pattern is achieved on one or more of the distributed bingo faces.

Abstract: A method enables the topology of an acyclic fully propagated network to be discovered. A list of switches that comprise the network is formed and the MAC address cache for each one of the switches is determined. For each pair of switches, from the MAC address caches the remaining switches that see the pair of switches are located. For each pair of switches the remaining switches are determined that see one of the pair of switches on a first port and the second one of the pair of switches on a second port. A list of insiders is formed for every pair of switches. It is determined whether the insider for each pair of switches is a graph edge and adjacent ones of the graph edges are determined. A symmetric adjacency matrix is formed from the graph edges to represent the topology of the data link network.

Abstract: In one embodiment, messages are encrypted with encrypted transformations that commute with one another. In another embodiment, a message is divided into message segments, and with each encrypted message segment one or more encrypted keys are sent. The encrypted keys may be used to decrypt a message segment that is sent at another time, such as the next message segment to be sent. In another embodiment, a sender encrypts a message with a first encryption, which may be unknown to the receiver. Then a receiver encrypts the message with a second encryption. Next the sender removes the first encryption, thereby allowing the receiver to reconstitute the original message by removing the second encryption.