Abstract: A method for processing a particle stream in a KStore having a sensor level and a first level above the sensor level, including receiving a particle to provide a received particle and first determining a current K node to determine a partial sequence location. The method also includes second determining a match in accordance with the received particle and the current K node to provide a match determination and processing the current K node based upon the match determination. A new node is created if the second determining is negative. A current K node is set to the new node. A node count is incremented and a delimiter particle type of the received particle is determined. A match is determined between the delimiter and a Result node of an asCase node of the current K node to provide a delimiter match determination.

Abstract: The present invention provides a method for identifying a serialization bottleneck in a computer system (FIG. 1). The method comprises the steps of providing statistical data with regard to the actual response time (FIG. 2) of a computing resource, providing statistical data with regard to an expected response time of the computing resource and applying a mathematical formula to the actual response time to derive a relationship between the actual and expected response time. The relationship between the expected response time and the actual response time provides an indication of the presence of a serialization problem in a computing system.

Abstract: In a video-on-demand system, memory-based video streams are seamlessly replaced with disc-based video streams. This is achieved by first switching each memory-based video stream to a mixed video stream; and later, switching each mixed video stream to a disc-based video stream.

Abstract: A method for processing KStore sensors for use by a KEngine in a KStore system to process a K includes providing a stream of particles, instantiating a KStore sensor structure, identifying particles to be included in a sensor set and processing said identified particles. The KStore sensor structure can provide a correspondence between a particle and a sensor K node. Furthermore, the KStore sensor structure can be a list of K nodes, an indexed array or a hash table.

Abstract: A service processor computing arrangement is associated with a cellular multiprocessing cell. The arrangement includes a scan machine coupled to communicate with processing hardware of the cell and a service processor coupled to an external communications interface of the scan machine. The scan machine includes remote scan software that performs at least one of monitoring and configuration of the processing hardware, and a first remote install program that receives update data via the external communications interface and applies the update data to the remote scan software. The service processor includes a server control program that performs at least one of monitoring and configuring the cell via the remote scan machine, and a second remote install program that applies the update data to the scan machine via the first remote install program.

Abstract: Error correction and error detection related to DRAM chip failures, particularly adapted server memory subsystems. It uses ×4 bit DRAM devices organized in a code word of 128 data bit words and 16 check bits. These 16 check bits are generated in such a way as to provide a code capable of 4 bit adjacent error correction within a family (i.e., in a ×4 DRAM) and double bit non-adjacent error detection across the entire 128 bit word, with single bit correction across the word as well. Each device can be thought of as a separate family of bits, errors occurring in more than one family are not correctable, but may be detected if only one bit in each of two families is in error. Syndrome generation and regeneration are used together with a specific large code word. Decoding the syndrome and checking it against the regenerated syndrome yield data sufficient for providing the features described.

Abstract: A system and method is disclosed for prioritizing requests received from multiple requesters for presentation to a shared resource. The system includes logic that implements multiple priority schemes. This logic may be programmably configured to associate each of the requesters with any of the priority schemes. The priority scheme that is associated with the requester controls how that requester submits requests to the shared resource. The requests that have been submitted by any of the requesters in this manner are then processed in a predetermined order. This order is established using an absolute priority assigned to each of the requesters. This order may further be determined by assigning one or more requesters a priority that is relative to another requester. The absolute and relative priority assignments are programmable.

Abstract: A specialized server holding a hierarchical database works with a Graphical User Interface to transform a hierarchical schema by utilizing an XMI file which is used with a modeling tool to develop a relational schema for display and use in a relational database in the Graphical User Interface.

Abstract: A set of mechanisms handles communication with a Knowledge Store and its K Engine(s). The Knowledge Store (Kstore) does not need indexes or tables to support it but instead is formed by the construction of interlocking trees of pointers in nodes of the interlocking trees. The K Engine builds and is used to query a KStore by using threads that use software objects together with a K Engine to learn particlized events, thus building the KStore, and these or other software objects can be used to make queries and get answers from the KStore, usually with the help of a K Engine. Under some circumstances, information can be obtained directly from the KStore, but is generally only available through the actions of the K Engine. The mechanisms provide communications pathways for users and applications software to build and/or query the KStore. Both these processes can proceed simultaneously, and in multiple instances. There can be a plurality of engines operating on a KStore essentially simultaneously.

Abstract: Intelligent NIC optimizations includes system and methods for Token Table Posting, use of a Master Completion Queue, Notification Request Area (NRA) associated with completion queues, preferably in the Network Interface Card (NIC) for providing notification of request completions, and what we call Lazy Memory Deregistration which allows non-critical memory deregistration processing to occur during non-busy times. These intelligent NIC optimizations which can be applied outside the scope of VIA (e.g. iWARP and the like), but also support VIA.

Abstract: A system and method of emulating network communications between applications executing in different partitions of a partitionable computer system is provided. A connection is established between a first partition and a second partition of a computer system, through a memory region of the computer system shared by both the first partition and the second partition. The connection emulates a network connection. A network message is transmitted from a first application in the first partition using a network application interface and intended for transmission to a second application in the second partition. The network message transmitted by the first application is transmitted to the second application via the connection established through the shared memory region.

Abstract: A digital rights management architecture for securely delivering content to authorized consumers. The architecture includes a content provider and a consumer system for requesting content from the content provider. The content provider generates a session rights object having purchase options selected by the consumer. A KDC thereafter provides authorization data to the consumer system. Also, a caching server is provided for comparing the purchase options with the authorization data. The caching server forwards the requested content to the consumer system if the purchase options match the authorization data. Note that the caching server employs real time streaming for securely forwarding the encrypted content, and the requested content is encrypted for forwarding to the consumer system. Further, the caching server and the consumer system exchange encrypted control messages (and authenticated) for supporting transfer of the requested content.

Abstract: A method of securing information. The method comprises: obtaining a path to the information; and performing a security check regarding the path.

Abstract: Noise is reduced in a video system by applying motion compensated temporal filtering using previously generated motion vectors and adaptive spatial filtering at scene change frames. Various types of noise can be introduced into video prior to compression and transmission. Artifacts arise from recording and signal manipulation, terrestrial or orbital communications, or during decoding. Noise introduced prior to image compression interferes with performance and subsequently impairs system performance. While filtering generally reduces noise in a video image, it can also reduce edge definition leading to loss of focus. Filtering can also tax system throughput, since increased computational complexity often results from filtering schemes. Furthermore, the movement of objects within frames, as defined by groups of pixels, complicates the noise reduction process by adding additional complexity.

Abstract: A method for forwarding messages containing cryptographic keys from a conditional access system that controls a population of set-top boxes to an encryption renewal system. The method includes storing a fictitious address of a virtual set-top box; generating a message based on the fictitious address, the message containing a cryptographic key; and forwarding the message to the fictitious address of the virtual set-top box. The encryption renewal system has information regarding the virtual set-top box, and is the recipient of the message. In addition, the encryption renewal system is for controlling access to pre-encrypted content generated by an encryption device.

Abstract: A method for improving or eliminating second harmonic and higher even order distortion terms and balance of fundamental signals in push-pull amplifiers and other differential circuits is disclosed. A common-mode (CM) signal is generated as a sum of two complementary (out of phase) signals in a summation network. The CM signal contains even order distortion terms only, while the fundamental signal and odd order distortion terms are canceled, thus providing a correction signal that can be used to reduce even order distortion terms, by injecting the correction signal, with proper phase and amplitude, into suitable circuit nodes. For feedback, the correction signal is injected at the input of the amplifiers, for feed-forward, it's injected at the output. The correction signal can be amplified to higher levels and injected into the circuit, without affecting gain of fundamental signals; and can result in significant even order distortion improvements, and improved balance of complementary fundamental signals.

Abstract: Aliasing and routing of plural MPEG data streams are disclosed. Disclosed apparatus embodiments include, e.g., a router or a cross-point switch that can route data packets from any source location(s) to any destination location(s). Such locations may be on multiple targets on a single processing board or may be on multiple boards in a chassis with a backplane linking the boards together. The disclosed aliasing and routing is achieved by processing MPEG data streams with associated PIDs so they can be transported between communicatively linked locations. This is achieved by generating a PID alias table with plural PID aliases for each input data stream; by removing at least one PID from each input data stream to thereby produce filtered data streams; by determining target destination(s) for each of the filtered data streams; and by buffering the filtered data streams so the filtered data streams can then be read and transported to respective target destination(s).

Abstract: Progressive I-slice refreshed MPEG data streams are transcoded to I-frame based MPEG data streams to enable trick play modes on a television appliance, such as pause, scan forward, scan backward, jump, or still frame displays for use, e.g., in film indexing (chapters). A progressive I-slice refreshed MPEG data stream 10 having I-slices distributed over multiple P-frames is received by a television appliance 300. The P-frames are decoded at decoder 220 to recover the I-slices which make up a complete I-frame. The recovered I-slices are assembled (e.g., by processor 230) into a complete I-frame. The complete I-frame is encoded at an encoder 250. A selected P-frame in the MPEG data stream is replaced with the encoded I-frame (e.g., via multiplexer 255) to provide an encoded I-frame based data stream 200. The I-frame based data stream is stored (e.g., in memory 240) for trick play mode use.

Abstract: An efficient processing system, such as for transcoding video data. In a multi-processor embodiment, channels of data are assigned to processors to maximize the use of the processor resources. A channel complexity measure is made from a sample of each channel, and an accumulated complexity is maintained for each processor based on the complexity of the channels assigned to it. The channels are assigned to the processors such that the most complex channels are assigned first, and the processor with the least accumulated complexity receives the next channel assignment.

Abstract: Bridges (10, 12, 14) are used to interconnect local area networks transparently. In the IEEE 802.1D standard for bridges, a spanning tree is built among the bridges for loop-free frame forwarding (FIG. 10). Although this approach is simple, it does not support all-pair shortest paths. A novel bridge protocol is employed that attempts to find and forward frames over alternate paths that are shorter than their corresponding tree paths on the standard spanning tree, and makes use of the standard spanning tree for default forwarding. The proposed protocol, referred to as the Spanning Tree Alternate Routing (STAR) Bridge Protocol, is backward compatible with the IEEE 802.1D standard and has a complexity that is comparable to that of the standard and other existing protocols.