Abstract: A technique for triggering a system bus write command with user code includes identifying a specific store-type instruction in a user instruction sequence. The specific store-type instruction is converted into a specific request-type command, which is configured to include core permission controls (that are stored in core configuration registers of a processor core by a trusted kernel) and user created data (stored in a cache memory). Slave devices are configured through register space (that is only accessible by the trusted kernel) with respective slave permission controls. The specific request-type command is then transmitted from the cache memory, via a system bus. In this case, the slave devices that receive the specific request-type command (via the system bus) process the specific request-type command when the core permission controls are the same as the respective slave permission controls.

Abstract: A method for decompressing multiple data streams includes receiving a packet of data of a compressed data stream, directing the received packet to a selected one of a plurality of decompression functional units within a hardware-based decompression accelerator unit, obtaining decompression state information pertaining to the compressed data stream, and decompressing the received packet using the obtained decompression state information.

Abstract: An apparatus is disclosed for transporting control information in a communications system. The apparatus comprises a network processor, a control point processor operatively coupled to the network processor, and a guided frame generated by the control point processor. The guided frame comprises a first section in which frame control information is placed and is used by the network processor to update at least one control register within the network processor; a second section carrying correlators assigned by the control point processor to correlate guided frame responses with their requests; a third section carrying one or a sequence of guided commands; and an End delimiter guided command.

Abstract: A control sub system, a plurality of interface processors, a plurality of media interfaces a plurality of queues are operatively coupled and responsive to a control signal to move data from a memory to a selected one of the plurality of queues.

Abstract: Designs for cognitive memory systems storing input data, images, or patterns, and retrieving it without knowledge of where stored when cognitive memory is prompted by query pattern that is related to sought stored pattern. Retrieval system of cognitive memory uses autoassociative neural networks and techniques for pre-processing query pattern to establish relationship between query pattern and sought stored pattern, to locate sought pattern, and to retrieve it and ancillary data.

Abstract: A cache coherency technique used in a multi-node symmetric multi-processor system that reduces the number of message phases of a read request from 5 to 4, canceling the combined response phase for read requests in most cases, thereby improving system performance and reducing the overall system power consumption.

Abstract: The decision within a packet processing device to transmit a newly arriving packet into a queue to await further processing or to discard the same packet is made by a flow control method and system. The flow control is updated with a constant period determined by storage and flow rate limits. The update includes comparing current queue occupancy to a threshold. The outcome of the update is adjustment up or down of the transmit probability value. The value is stored for the subsequent period of flow control and packets arriving during that period are subject to a transmit or discard decision that uses that value.

Abstract: The decision within a packet processing device to transmit a newly arriving packet into a queue to await further processing or to discard the same packet is made by a flow control method and system. The flow control is updated with a constant period determined by storage and flow rate limits. The update includes comparing current queue occupancy to a threshold. The outcome of the update is adjustment up or down of the transmit probability value. The value is stored for the subsequent period of flow control and packets arriving during that period are subject to a transmit or discard decision that uses that value.

Abstract: Novel data structures, methods and apparatus for finding the longest prefix match search when searching tables with variable length patterns or prefixes. To find the exact match or the best matching prefix, patterns have to be compared a bit at a time until the exact or first match is found. This requires “n” number of comparisons or memory accesses to identify the closest matching pattern. The trees are built in such a way that the matching result is guaranteed to be a best match, whether it is an exact match or a longest prefix match. Using the trail of all the birds and associated prefix lengths enables determination of the correct prefix result from the trail. By construction, the search tree provides the best matching prefix at or after the first compare during walking of the trail or tree.

Abstract: The invention consists of a variety of embodiments for a shoe insert that prevents creasing along the top of a shoe. The invention consists of a semi-rigid inner shell, and an outer shell that has a range of rigidity based upon the alternative embodiments design. The inner and outer shells are made of materials comprising wood, metal, ceramic, or plastic.

Abstract: A disclosure of a subscription service is provided, where this service allows for the running of unsigned content, such as games, on closed computing systems, such as gaming consoles. The subscription service checks whether gamer tags have an account to run unsigned games on any consoles on which the gamer tags happen to be residing. If so, users associated with such gamer tags can run unsigned content; if not, then they cannot (but may be asked or allowed to subscribe to the service). The subscription service has various facets, some of which include: gamer tags that can interact with the service while being distributed across a plurality of consoles; remote location of the service from the gaming console; user privileges auditing and revocation if users associated with gamer tags violate policies set out by the subscription service, and so on.

Abstract: Novel data structures, methods and apparatus for finding the longest prefix match search when searching tables with variable length patterns or prefixes. To find the exact match or the best matching prefix, patterns have to be compared a bit at a time until the exact or first: match is found. This requires “n” number of comparisons or memory accesses to identify the closest matching pattern. The trees are built in such a way that the matching result is guaranteed to be a best match, whether it is an exact match or a longest prefix match. Using the trail of all the birds and associated prefix lengths enables determination of the correct prefix result from the trail. By construction, the search tree provides the best matching prefix at or after the first compare during walking of the trail or tree.

Abstract: The systems and methods disclosed herein include an interactive data finder that allows an advertisement purchaser to associate media programs with demographics and subscriber information. The data finder comprise a search module for processing input data to determine data representative of media buying opportunities as a function of search options, where the search options are representative of media buying criteria. The data finder also comprises a category module for refining the data representative of the media buying opportunities as a function of filter options, where the filter options are representative of media buying criteria related to the media buying opportunities. The refined data provides the advertisement purchaser with the information that associates the media-buying opportunities with at least one of the demographics and the subscriber information.

Abstract: Designs for cognitive memory systems storing input data, images, or patterns, and retrieving it without knowledge of where stored when cognitive memory is prompted by query pattern that is related to sought stored pattern. Retrieval system of cognitive memory uses autoassociative neural networks and techniques for pre-processing query pattern to establish relationship between query pattern and sought stored pattern, to locate sought pattern, and to retrieve it and ancillary data.

Abstract: A system and method of moving information units from a network processor toward a data transmission network in a prioritized sequence which accommodates several different levels of service. The present invention includes a method and system for scheduling the egress of processed information units (or frames) from a network processing unit according to stored priorities associated with the various sources of the information units. A system for allowing peak bursts based on a system of credits and charges is taught along limits on such peak bursts. Also taught is a system for preventing a flow's disconnection and reconnection to the queues from allowing it to unfairly achieve an improved position.

Abstract: The present invention is directed towards a ceramic nanocomposite comprising a nanostructured carbon component inside a ceramic host. The ceramic nanocomposite may further comprise vapor grown carbon fibers. Such nanostructured carbon materials impart both structural and thermal barrier enhancements to the ceramic host. The present invention is also directed towards a method of making these ceramic nanocomposites and for methods of using them in various applications.

Abstract: A network switch apparatus, components for such an apparatus, and methods of operating such an apparatus in which data flow handling and flexibility is enhanced by the cooperation of a control point and a plurality of interface processors formed on a semiconductor substrate. The control point and interface processors together form a network processor capable of cooperating with other elements including an optional switching fabric device in executing instructions directing the flow of data in a network.

Abstract: A video game system comprises memory for storing data defining graphical objects for use in a video game. The system further comprises logic configured to enable a user to select at least one musical song to be played during a run of the video game. The logic is further configured to control at least one of the graphical objects during the run of the video game based on an attribute correlated with the selected song.

Abstract: Objects associated with fixation regions are used to support training tasks that are characterized by operation within a dynamic 3D environment, problem-solving that involves user multi-tasking, fast decisions, heavy workloads, potential for unexpected events, and the need for high-performance skills. The invention is ideally suited to measure the nuances associated with maintaining situation awareness in such tasks where dynamic 3D environments that support problem solving with high cognitive fidelity have already been developed. Potential training application areas include urban warfighting, night vision goggle use, aircraft piloting, helicopter operation, remote control of vehicles and robots, night driving, air traffic control, and quarterback decision-making.

Abstract: Novel data structures, methods and apparatus for finding a full match between a search pattern and a pattern stored in a leaf of the search tree. A key is input, a hash function is performed on the key, a direct table (DT) is accessed, and a tree is walked through pattern search control blocks (PSCBs) until reaching a leaf. The search mechanism uses a set of data structures that can be located in a few registers and regular memory, and then used to build a Patricia tree structure that can be manipulated by a relatively simple hardware macro. Both keys and corresponding information needed for retrieval are stored in the Patricia tree structure. The hash function provides an n->n mapping of the bits of the key to the bits of the hash key. The data structure that is used to store the hash key and the related information in the tree is called a leaf. Each leaf corresponds to a single key that matches exactly with the input key. The leaf contains the key as well as additional information.