Abstract: A racquet sports scoring system is provided. The scoring system uses a computerized display and input system to receive scoring changes. In many embodiments, the computerized interface is in communication with a database which records the score in real time, and also records scores of other concurrently-played matches. These match scores, and in some cases video of live matches played at other locations, can be viewed on the same computerized interface on which scores are recorded or on remote devices.

Abstract: A racquet sports scoring system is provided. The scoring system uses a computerized display and input system to receive scoring changes. In many embodiments, the computerized interface is in communication with a database which records the score in real time, and also records scores of other concurrently-played matches. These match scores, and in some cases video of live matches played at other locations, can be viewed on the same computerized interface on which scores are recorded or on remote devices.

Abstract: A racquet sports scoring system is provided. The scoring system uses a computerized display and input system to receive scoring changes. In many embodiments, the computerized interface is in communication with a database which records the score in real time, and also records scores of other concurrently-played matches. These match scores, and in some cases video of live matches played at other locations, can be viewed on the same computerized interface on which scores are recorded or on remote devices.

Abstract: A racquet sports scoring system is provided. The scoring system uses a computerized display and input system to receive scoring changes. In many embodiments, the computerized interface is in communication with a database which records the score in real time, and also records scores of other concurrently-played matches. These match scores, and in some cases video of live matches played at other locations, can be viewed on the same computerized interface on which scores are recorded or on remote devices.

Abstract: A shader core includes a first processing element (PE), a second processing element, a register file and a warp sequencing unit. The first PE includes a first predetermined number of execution units, and the second PE includes a second predetermined number of execution units in which the second predetermined number of execution units is less than the first predetermined number of execution units. The register file shared by the first PE and the second PE. The warp sequencer unit (WSQ) is coupled to the first PE and to the second PE and schedules an instruction trace to execute on the first PE or the second PE based on information contained in a trace header of the instruction trace. The information contained in the trace header indicates whether the instruction trace is executable on the second PE.

Abstract: A shader core includes a first processing element (PE), a second processing element, a register file and a warp sequencing unit. The first PE includes a first predetermined number of execution units, and the second PE includes a second predetermined number of execution units in which the second predetermined number of execution units is less than the first predetermined number of execution units. The register file shared by the first PE and the second PE. The warp sequencer unit (WSQ) is coupled to the first PE and to the second PE and schedules an instruction trace to execute on the first PE or the second PE based on information contained in a trace header of the instruction trace. The information contained in the trace header indicates whether the instruction trace is executable on the second PE.

Abstract: An apparatus includes an execution unit, an instruction queue, and a control circuit. The control circuit may be configured to activate a plurality of processor threads. Each of the plurality of processor threads may include a respective plurality of instructions. The instruction queue may be configured to issue at least one instruction included in the plurality of processor threads to the execution unit at a first rate. The control circuit may also be configured to track, for a particular processor thread, a period of time from activating the particular processor thread. The instruction queue may be further configured to limit issue of a next instruction for at least one other processor thread to a second rate, based on a comparison of the period of time to a threshold amount of time. The second rate may be lower than the first rate.

Abstract: A composition for a wood restorer with a stain, the composition comprising: a polymer emulsion, wherein the polymer emulsion comprises a styrene acrylic copolymer emulsion and a high density polyethylene emulsion, a stain, and a first water, wherein the first water forms the balance of the composition. A method of using the composition to cleanse a wood surface is also disclosed.

Abstract: An apparatus includes an execution unit, an instruction queue, and a control circuit. The control circuit may be configured to activate a plurality of processor threads. Each of the plurality of processor threads may include a respective plurality of instructions. The instruction queue may be configured to issue at least one instruction included in the plurality of processor threads to the execution unit at a first rate. The control circuit may also be configured to track, for a particular processor thread, a period of time from activating the particular processor thread. The instruction queue may be further configured to limit issue of a next instruction for at least one other processor thread to a second rate, based on a comparison of the period of time to a threshold amount of time. The second rate may be lower than the first rate.

Abstract: There are disclosed systems, method and tools for facilitating group collaborations. In an embodiment, collaborative ideas are represented in a modified tree data structure in which ideas are stored in nodes of the tree (an “idea tree”). Each node may be associated with data storage means, such as a table of records, in which different kinds of data can be stored. Data stored in the idea tree, or a part thereof, may be created, modified, deleted or organized by using various types of collaboration tools. A participant's interaction with the idea tree, or a part thereof, using a particular collaboration tool may be mapped as a transformation of the idea tree from one state to another. Other participants may simultaneously or successively interact with the idea tree, or a part thereof, using the same or a different collaboration tool. A coherent representation of collaborative ideas can be developed and organized without excessive manual effort.

Abstract: There are disclosed systems, method and tools for facilitating group collaborations. In an embodiment, collaborative ideas are represented in a modified tree data structure in which ideas are stored in nodes of the tree (an “idea tree”). Each node may be associated with data storage means, such as a table of records, in which different kinds of data can be stored. Data stored in the idea tree, or a part thereof, may be created, modified, deleted or organized by using various types of collaboration tools. A participant's interaction with the idea tree, or a part thereof, using a particular collaboration tool may be mapped as a transformation of the idea tree from one state to another. Other participants may simultaneously or successively interact with the idea tree, or a part thereof, using the same or a different collaboration tool. A coherent representation of collaborative ideas can be developed and organized without excessive manual effort.

Abstract: An apparatus and method are described for mapping a plurality of multimedia streams (e.g., received from a set of satellite transponders) across a lesser plurality of decoders. In one embodiment, arbitration logic allocates the multimedia streams to divide the decoding load equally among the group of decoders (or at least as equally as possible). Allocation may occur statically, when the system is initialized, or dynamically, as the streams are being processed. In addition, in one embodiment, the arbitration logic monitors the amount of multimedia data for each stream stored in a buffer and causes streams to be serviced by the decoders which have relatively more stored multimedia data.

Abstract: An apparatus and method for preventing the development or exacerbation of tendinitis is provided. The apparatus includes a first pad made of a resilient material that is configured to be carried by a digit of the user. The first pad has a palmar face and an oppositely disposed dorsal face that define a thickness therebetween. The thickness of the first pad is selected in order to prevent the digit of the user from fully bending so that impact forces transmitted through the digit are dampened as the muscle pulling on the digit is not completely tight.

Abstract: There are disclosed systems, method and tools for facilitating group collaborations. In an embodiment, collaborative ideas are represented in a modified tree data structure in which ideas are stored in nodes of the tree (an “idea tree”). Each node may be associated with data storage means, such as a table of records, in which different kinds of data can be stored. Data stored in the idea tree, or a part thereof, may be created, modified, deleted or organized by using various types of collaboration tools. A participant's interaction with the idea tree, or a part thereof, using a particular collaboration tool may be mapped as a transformation of the idea tree from one state to another. Other participants may simultaneously or successively interact with the idea tree, or a part thereof, using the same or a different collaboration tool. A coherent representation of collaborative ideas can be developed and organized without excessive manual effort.

Abstract: A system and method are described in which a decoder decodes data from a plurality of data streams. In one embodiment, the decoder is restored to the state it was in the last time it processed data from each data stream by re-decoding data stored in a replay buffer before decoding new data from each respective data stream. In one embodiment, multiple decoders are grouped together to process data from a plurality of satellite transponders.

Abstract: An apparatus is described comprising: a decoder which decodes a plurality of data streams, the decoder having a state associated with each of the data streams; and state restoration logic to restore the decoder's state upon switching from decoding one data stream to another data stream.

Abstract: An apparatus and method are described for mapping a plurality of multimedia streams (e.g., received from a set of satellite transponders) across a lesser plurality of decoders. In one embodiment, arbitration logic allocates the multimedia streams to divide the decoding load equally among the group of decoders (or at least as equally as possible). Allocation may occur statically, when the system is initialized, or dynamically, as the streams are being processed. In addition, in one embodiment, the arbitration logic monitors the amount of multimedia data for each stream stored in a buffer and causes streams to be serviced by the decoders which have relatively more stored multimedia data.

Abstract: An apparatus and method are described for normalizing a plurality of state metric values stored in a plurality of accumulators. In one embodiment, normalization logic monitors the each of the state metric values. When all of the values are above a predetermined threshold, the normalization logic subtracts a normalization amount from each of the state metric values. In one embodiment, the normalization amount is incorporated into branch metric calculations at one or more branch metric units. In addition, in one embodiment, different normalization amounts are employed based on the state metric values.

Abstract: In one embodiment of the invention, during add-compare-select computations, the output of the adders is guaranteed to be a positive value because the only time normalization logic subtracts a normalization amount is when all accumulators are greater than the normalization amount. As such, the detection of overflow is greatly simplified. Overflow in the add-compare-select unit may be indicated simply by the value of the most significant bit (“MSB”) (i.e., the sign bit) of the result. If the MSB of the result of the adder is set then, in one embodiment, the output of the adder gets forced the maximum possible value given the number of bits. For example, this value will be forced to 7h7f if the value is represented by 7-bits. That is to say, if an overflow is detected, then the accumulator is saturated to the maximum value.

Abstract: An apparatus and method are described for mapping a plurality of multimedia streams (e.g., received from a set of satellite transponders) across a lesser plurality of decoders. In one embodiment, arbitration logic allocates the multimedia streams to divide the decoding load equally among the group of decoders (or at least as equally as possible). Allocation may occur statically, when the system is initialized, or dynamically, as the streams are being processed. In addition, in one embodiment, the arbitration logic monitors the amount of multimedia data for each stream stored in a buffer and causes streams to be serviced by the decoders which have relatively more stored multimedia data.