Abstract: Techniques and tools for generating finite state machines (“FSMs”) for a software system with asynchronous callbacks are described. For example, method invocations in a model of the software system are partitioned into observable and controlled method invocations. The controlled method invocations are those which can be run from a test harness while the observed method invocations are those which are observed asynchronously as they are invoked in the system. An FSM is created with observation and control nodes such that observable transitions are found from observation nodes and controlled transitions are found from control nodes. If a state of the model contains both controlled and observable invocations, a timeout transition is added to the FSM to give an implementation time to come up with an observed method invocation before continuing to controlled invocations.

Abstract: Techniques and tools for testing multi-threaded or distributed software systems are described. For example, a multi-threaded system is instrumented and executed to produce logs of events that are performed by each of its agents. The agent logs contain a totally ordered series of events per agent, as well as information about accesses to resources shared between the agents. With this information, a partial ordering of the events performed by all the agents is described for the execution. The agent logs are then multiplexed into one or more serialized event orderings, which can then be compared to a specification of the system in a conformance testing engine.

Abstract: State spaces are traversed to produce test cases, or test coverage. Test coverage is a test suite of sequences. Accepting states are defined. Expected costs are assigned to the test graph states. Strategies are created providing transitions to states with lower expected costs. Linear programs and other approximations are discussed for providing expected costs. Strategies are more likely to provide access to an accepting state, based on expected costs. Strategies are used to append transitions to test segments such that the new test segment ends in an accepting state.

Abstract: The present invention can be used in a natural language processing system to determine a relationship (such as similarity in meaning) between two textual segments. The relationship can be identified or determined based on logical graphs generated from the textual segments. A relationship between first and second logical graphs is determined. This is accomplished regardless of whether there is an exact match between the first and second logical graphs. In one embodiment, the first graph represents an input textual discourse unit. The second graph, in one embodiment, represents information in a lexical knowledge base (LKB). The input graph can be matched against the second graph, if they have similar meaning, even if the two differ lexically or structurally.

Abstract: The present invention can be used in a natural language processing system to determine a relationship (such as similarity in meaning) between two textual segments. The relationship can be identified or determined based on logical graphs generated from the textual segments. A relationship between first and second logical graphs is determined. This is accomplished regardless of whether there is an exact match between the first and second logical graphs. In one embodiment, the first graph represents an input textual discourse unit. The second graph, in one embodiment, represents information in a lexical knowledge base (LKB). The input graph can be matched against the second graph, if they have similar meaning, even if the two differ lexically or structurally.

Abstract: The present invention can be used in a natural language processing system to determine a relationship (such as similarity in meaning) between two textual segments. The relationship can be identified or determined based on logical graphs generated from the textual segments. A relationship between first and second logical graphs is determined. This is accomplished regardless of whether there is an exact match between the first and second logical graphs. In one embodiment, the first graph represents an input textual discourse unit. The second graph, in one embodiment, represents information in a lexical knowledge base (LKB). The input graph can be matched against the second graph, if they have similar meaning, even if the two differ lexically or structurally.

Abstract: Dynamic tournament gaming method and system, including the provision of a plurality of gaming terminals selectively interlinkable together with a host terminal so that current players of the terminals desiring to participate in group tournament play can be notified of the opportunity and provided with the choice to play or not. If a current player chooses to play, he so signifies, enters his entry fee into the terminal, and awaits start of the event. Upon start of the tournament by the host terminal, the player will play the tournament game over and over as fast as possible to accumulate as many points as possible during a particular pre-announced tournament period. The host terminal will continuously monitor the terminals of all play participants, dynamically record play status, and control termination of the game period. It will also conduct an accounting of the results, issue win results notification, and perhaps provide remote pay-out of game winnings.

Abstract: A change management method and system for tool-based document generation which incorporates tool input changes, tool changes, and user changes during iterative document creation. After a tool-based document is generated and saved by a tool, and then edited by a user, during a next iteration of creating the edited document, the tool first generates a new base document. The base document is then saved, and a three-way merge is performed on the former iteration's base document, this iteration's new base document, and the former iteration's edited document. The former iteration's base document serves as the base of the merge process. The merge outputs a merged document, and when further edits are needed, the merged document is edited, and saved as the edited document. If no edits are necessary, the merged document is saved directly as the edited document. In each iteration, the new base document and the edited document are saved for a possible next iteration.

Abstract: The invention relates to a process for formation of carbon nanotubes. The process comprises laser ablation of a bulk metal catalyst within a hydrocarbon solution to produce a feedstock containing metal catalyst nanoparticles. The feedstock is atomizing to form a feedstock aerosol. The aerosol is heated to form naotubes. An apparatus for forming carbon nanotubes is also disclosed. Nanoparticles formed in the feedstock according to the invention can be controlled to achieve a narrow size distribution, which ultimately allows for good control over size and chirality of the nanotubes formed.

Abstract: To perform conformance checking of a software implementation with a (possibly non-deterministic) specification, a software implementation and a software specification are applied to produce a CT enabled implementation. Nondeterministic choices of the software specification result in assigning a corresponding choice of the CT enabled implementation to a variable. The CT enabled implementation includes a test that the variable then comprises one of the nondeterministic choices of the software specification.

Abstract: Dynamic tournament gaming method and system, including the provision of a plurality of gaming terminals selectively interlinkable together with a host terminal so that current players of the terminals desiring to participate in group tournament play can be notified of the opportunity and provided with the choice to play or not. If a current player chooses to play, he so signifies, enters his entry fee into the terminal, and awaits start of the event. Upon start of the tournament by the host terminal, the player will play the tournament game over and over as fast as possible to accumulate as many points as possible during a particular pre-announced tournament period. The host terminal will continuously monitor the terminals of all play participants, dynamically record play status, and control termination of the game period. It will also conduct an accounting of the results, issue win results notification, and perhaps provide remote pay-out of game winnings.

Abstract: A dentifrice closure on a dentifrice tube can emit a signal upon the opening of the closure to dispense some of the dentifrice. The closure is comprised of a base portion to attach the closure to the dentifrice tube and a lid portion that closes the dispensing opening of the dentifrice tube and which contains switch timer and signal generator. The signal generator can be a light, but preferably is a sound generator, and most preferably a music generator. Upon the lid being opened, a switch activates the timer which in turn activates the signal generator. Regardless of the position of the switch after a lid opening (the lid can be quickly closed) the signal will be emitted for a set period of time.

Abstract: A vehicle, such as a garden tractor, riding mower or golf cart, with sport bottles, having fluid refreshment therein, removably adhered thereto in which the various body parts of the vehicle are disposed in different planes and the sport bottles are formed with attachment devices which are removably adherent to the various body parts to support the sport bottle, irrespective of the plane of the body part to which it is adhered.

Abstract: Dynamic tournament gaming method and system, including the provision of a plurality of gaming terminals selectively interlinkable together with a host terminal so that current players of the terminals desiring to participate in group tournament play can be notified of the opportunity and provided with the choice to play or not. If a current player chooses to play, he so signifies, enters his entry fee into the terminal, and awaits start of the event. Upon start of the tournament by the host terminal, the player will play the tournament game over and over as fast as possible to accumulate as many points as possible during a particular pre-announced tournament period. The host terminal will continuously monitor the terminals of all play participants, dynamically record play status, and control termination of the game period. It will also conduct an accounting of the results, issue win results notification, and perhaps provide remote pay-out of game winnings.

Abstract: Dynamic tournament gaming method and system, including the provision of a plurality of gaming terminals selectively interlinkable together with a host terminal so that current players of the terminals desiring to participate in group tournament play can be notified of the opportunity and provided with the choice to play or not. If a current player chooses to play, he so signifies, enters his entry fee into the terminal, and awaits start of the event. Upon start of the tournament by the host terminal, the player will play the tournament game over and over as fast as possible to accumulate as many points as possible during a particular pre-announced tournament period. The host terminal will continuously monitor the terminals of all play participants, dynamically record play status, and control termination of the game period. It will also conduct an accounting of the results, issue win results notification, and perhaps provide remote pay-out of game winnings.

Abstract: Authentication of a casino game data set is carried out within the casino game console using an authentication program stored in an unalterable ROM physically located within the casino game console. The casino game data set and a unique signature are stored in a mass storage device, which may comprise a read only unit or a read/write unit and which may be physically located either within the casino game console or remotely located and linked to the casino game console over a suitable network. The authentication program stored in the unalterable ROM performs an authentication check on the casino game data set at appropriate times, such as prior to commencement of game play, at periodic intervals or upon demand.

Abstract: The electronic casino gaming system consists of several system components, including a microprocessor (12), a main memory unit (13) that is typically a random access memory, and a system boot ROM (14). Also included in the electronic casino gaming system are a non-volatile RAM (17), a mass storage unit (18), a disk subsystem (19), and a PCI bus (20). The disk subsystem (19) preferably supports SCSI-2 with options of fast and wide. A video subsystem (22) is also included in the electronic casino gaming system and is coupled to the PCI bus (20) to provide full color still images and MPEG movies.

Abstract: An operating system having a multitude of subsystems is provided where each subsystem performs a distinct function and may register with other subsystems to receive notification (or callbacks) upon the ocurrence of certain events. Moreover, the subsystems are programmed in such a manner where in the event of a fault (or exception) they can be instructed to cease the calling of other subsystems, thereby allowing each of the subsystems to complete its distinctive task without commencing further additional activities. When all of the activities have ceased, the state of the system as indicated by the parameters at the various registers and addresses are saved. At this time, the system can initiate a service call for an attendant through one of the provided mechanisms or routine calls.

Abstract: The electronic casino gaming system consists of several system components, including a microprocessor (12), a main memory unit (13) that is typically a random access memory, and a system boot ROM (14). Also included in the electronic casino gaming system are a non-volatile RAM (17), a mass storage unit (18), a disk subsystem (19), and a PCI bus (20). The disk subsystem (19) preferably supports SCSI-2 with options of fast and wide. A video subsystem (22) is also included in the electronic casino gaming system and is coupled to the PCI bus (20) to provide full color still images and MPEG movies.

Abstract: The electronic casino gaming system consists of several system components, including a microprocessor (12), a main memory unit (13) that is typically a random access memory, and a system boot ROM (14). Also included in the electronic casino gaming system are a non-volatile RAM (17), a mass storage unit (18), a disk subsystem (19), and a PCI bus (20). The disk subsystem (19) preferably supports SCSI-2 with options of fast and wide. A video subsystem (22) is also included in the electronic casino gaming system and is coupled to the PCI bus (20) to provide full color still images and MPEG movies.