Abstract: A press frame for attaching connectors to workpieces such as cables and pipes is described. The press frame is adapted to be releasably attached to a hand-held, battery powered press tool. The press frame includes selectively interchangeable components that enable a wide range of different styles, sizes, and configurations of electrical connectors to be attached to cables.

Abstract: A jaw arm for an associated compression tool having cam rollers that displace forwardly and rearwardly along an axis to pivot the jaw arm includes a recess and a notch. The recess is disposed adjacent a forward end of the jaw arm. The notch is axially spaced rearwardly from the recess. The recess is configured to receive an associated pipe and an associated coupling for compressing at least one of the associated pipe and the associated coupling to mechanically attach the associated pipe to the associated coupling when the jaw arm is pivotally displaced toward at least one of the associated pipe and the associated coupling. The notch is configured to receive an associated cam roller of the associated compression tool and to retain the associated cam roller to inhibit axial rearward movement of the associated cam roller when the associated cam roller has been received in the notch. A pressing tool and a jaw set incorporating the aforementioned jaw arm is also disclosed.

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: Processes for the treatment of wastewater comprising incorporating a delaminated nanoparticulate clay into a treatment mixture to form a coagulant. The nanoparticulate clay comprises an anionic coagulant. Preferred nanoparticulate clays are bentonite clays and hectorite clays.

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.

Abstract: A system and method of altering frames being processed by a network processing unit. The system includes a set of defined alterations, with some of the alterations being fixed alterations which are advantageously handled by hardware to accomplish the fixed alterations rapidly and without executing a stored program and other alterations which include a variable portion, with these variable alterations being accomplished through the use of stored programs allowing the variables to be used to effect variable alterations to a frame. The present system accommodates a change in the duration of life of a frame or information unit and addition or deletion of bits and also allows for a new cyclic redundancy checking to be accomplished for a revised information unit. Advantageously, the frame alteration system is on the same substrate as the processors.

Abstract: A system and method of moving information units from an output flow control 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 service based on a weighted fair queue where position in the queue is adjusted after each service based on a weight factor and the length of frame, a process which provides a method for and system of interaction between different calendar types is used to provide minimum bandwidth, best effort bandwidth, weighted fair queuing service, best effort peak bandwidth, and maximum burst size specifications. The present invention permits different combinations of service that can be used to create different QoS specifications.

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.