Abstract: Fairness algorithms and access methods enable non-zero channel access for wireless communication systems operating in a random access channel environment. Fair access to a random access channel for each station in a wireless network is assured by each station calculating a priority or probability for accessing the channel based on logical connections among certain stations, based on other stations perception of the channel and based on each calculating station's own perception of the channel properties.

Abstract: A method of customizing and modifying program material to tailor it to a receiving end user or client. When program material is to be generated for future customization or modification, an encrypted license tag is associated with the program material. When examining putatively modifiable program material for possible modification, a license tag is decrypted. If clear text results then the putatively modifiable program material is established to be modifiable or customizable. Then the program material is modified or customized to suit the profile of a client or end user who is to receive this customized program material. With the encrypted license tag, the owner of the program material can control the modifications made to his or her program material.

Abstract: A switching system comprising a switching structure for routing cells from a set of M input ports towards a set of M output ports. The system includes a set of distributed individual Switch Core Access layer elements which communicate with one input and output port of the switching structure by means of a set of serial communication links. Each SCAL element provides attachment to at least one Protocol Adapter and comprises a set of circuits. The receive part of each circuit, which includes at least one first FIFO storage for storing the cells being received, receives the data cells from the attached Protocol Adapter and introduces at least one extra byte to every cell. Each transmit part of the destination circuit, which includes at least one second FIFO storage having a greater capacity than the first FIFO storage, receives all the cells that are generated at the corresponding output port and uses the at least one extra byte for cell buffering.

Abstract: A method of providing coherent shared memory access among a plurality of shared memory multiprocessor nodes. For each line of data in each of the nodes, a list of those processors of the node that have copies of the line in their caches is maintained. If a memory command is issued from a processor of one node, and if the command is directed to a line of memory of another node, then the memory command is sent directly to an adapter of the one node. When the adapter receives the command, it forwards the command from the one adapter to another adapter of the other node. When the other adapter receives the command, the command is forwarded to the local memory of the other node. The list of processors is then updated in the local memory of the other node to include or exclude the other adapter depending on the command. If the memory command is issued from one of the processors of one of the nodes, and if the command is directed to a line of memory of the one node, then the command is sent directly to local memory.

Abstract: The object of the present invention is to eliminate, in a data processing system having multiple buses, a combination of devices that can not be accessed via a PCI to PCI bridge. When an access request is issued to an S.sub.-- ISA device by an S.sub.-- PCI device, a PCI to PCI bridge determines whether or not a requested address is outside a blocked area, and whether or not the address matches an address stored in a retry register. When the requested address does not match the address in the retry register, the PCI to PCI bridge mistakes the access request for an access to a P.sub.-- PCI device. Thus, the PCI to PCI bridge positively decodes the access request on the S.sub.-- PCI bus, and transmits an access request on the P.sub.-- PCI bus. However, since none of the P.sub.-- PCI devices do not decode the request, the PCI to PCI bridge has to terminate the bus cycle on the P.sub.-- PCI bus by master abort.

Abstract: To provide a peripheral device and a computer system, each being arranged to allow both of external and internal attachments of the peripheral device to the computer system such that, in case of the external attachment, the peripheral device can be attached to the computer system in a manner compatible with the conventional attachment method and yet it does not require any dedicated attachment device as before. A computer system 100 comprises a container 140 for containing a peripheral device 130 as an internal device, a cable 410 for attaching the peripheral device 130 to the system 100 as an external device, and a connector 434 for connecting the cable 410. Also, the peripheral device 130 has a connector 132 for internal attachment and a connector 310 for external attachment. When the peripheral device 130 is contained in the container 140, it is electrically connected to the system 100 and operates as a part thereof.

Abstract: The invention provides a data processing system comprising: a CPU; a system memory; a plurality of network interfaces; a CPU bus connected to the system memory and to each of the network interface for initialization and control of the network interfaces by the CPU; an individual DMA bus connected to each of corresponding network interfaces and to the system memory; each of the network interfaces is connectable to an external network, whereby data can be transferred by the data processing system from one network to another using system memory.

Abstract: A method of optimizing the operation of a computer system in running application programs in accordance with system capabilities, user preferences and configuration parameters of the application program. More specifically, with this invention, an optimizing program gathers information on the system capabilities, user preferences and configuration parameters of the application program to maximize the operation of the application program or computer system. Further, user selected rules of operation can be selected by dragging rule icons to target optimizer icon.

Abstract: Trellis-enhanced precoding for trellis-coded transmission over channels with intersymbol interference allows coding and shaping gains to be achieved with minimal transmit power penalty for arbitrary signal constellations, provided the intersymbol interference channels are linearly invertible. This technique can be employed for trellis-coded transmission over a variety of communication channels. However, if the channel response exhibits spectral nulls, trellis-enhanced precoding cannot be applied because the corresponding inverse precoding operation at the receiver requires inverse channel filtering. For channels with a spectral null, this inverse operation can result in unlimited error propagation. The present invention allows trellis-coded transmission over channels exhibiting spectral nulls without incurring unlimited error propagation in the receiver. Coding gains are achieved with minimal transmit power penalty, like in the case of trellis-enhanced preceding.

Abstract: A cell switching module and switching system for routing cells each having a cell header comprising a plurality of input and output ports; at least one common cell storage connected between the input and output ports and comprising a plurality of storage locations having addresses; a storage section for performing storage of cells coming through any one of the input ports into the common cell storage and comprising a plurality of receiver means for performing the physical interface for the plurality of input ports, a plurality of input routers for connection the input ports to the cell storage, a plurality of ASA registers for providing the input routers with addresses to be used for storing the cells into the cell storage; and a retrieve section for retrieving cells from storage and for transporting them to one of the output ports, where the retrieve section comprises a plurality of output routers for retrieving the data stored in any locations of the cell storage, a plurality of drivers for connecting to th

Abstract: An image to be clipped is decomposed into its edges and the edges simultaneously clipped by multiple execution units of a SIMD computer along pairs of parallel clip planes. Successive parallel operations are performed on polygons recomposed using the clipped output edges, until all clipping has been performed.

Abstract: While executing the standard graphics processing steps, problem polygons (i.e., those outside of a defined clip volume) are buffered for later processing, while the standard graphics processing continues, without the need for periodically reformatting data and performing clipping. After either a predefined number of polygons have been stored at the buffer location, or at such time as a change in the rendering state occurs, the buffered polygons are clipped.

Abstract: A server and method for connecting in a network system whereby user computers can be connected with each other as clients of server computers using Internet Protocol (IP) connections. When Internet user A desires to talk with user B across the Internet, user A dials up server A for an IP connection and issues a request to server A for connection with user B. Upon receipt of a request for connection to a user B, server A accesses a record for user B. which record is stored in a storage area managed by server A. The record includes a user name, corresponding server name, user phone number, and IP connection state of the user. Once this record has been accessed, server A sends a connection request to server B. Since servers A and B are constantly connected, server B can respond immediately to a request from server A. Server B examines the pertinent record in its storage area and determines whether or not user B currently has an IP connection.

Abstract: A method of distributing program material to a number of access providers which have identified themselves as having clients meeting profiles specified in a program material placement request, which is typically from an advertiser. More specifically, summary information is transmitted to a control distribution node from each of the access providers, where the summary information describes customer profile information on the customers using each respective access provider. This summary information is then processed by the control distribution node to allocate the number of copies of program material that may be delivered to the clients or customers by each of the access provider nodes.

Abstract: A method of signing digital streams so that a receiver of the stream can authenticate and consume the stream at the same rate which the stream is being sent to the receiver. More specifically, this invention involves computing and verifying a single digital signature on at least a portion of the stream. The properties of this single signature will propagate to the rest of the stream through ancillary information embedded in the rest of the stream.

Abstract: A method of transmitting speech signals with reduced bandwith requirements. With this invention an original speech signal is first converted to a textual representation, and a facsimile of the original speech is determined from the textual representation. Then a minimum error turn is derived from the difference between the original speech signal and the facsimile of the original speech signal. The minimum error turn is then compressed, and it is this compressed minimum error turn, along with the textual representation, that is transmitted on the communications medium. At the receiving end, the textual representation and the difference representation are split through a demultiplexer. The textual representation is then passed through a synthesizer while the difference representation is passed through a mapper.

Abstract: A system and method for dynamic scheduling and allocation of resources to parallel applications during the course of their execution. By establishing well-defined interactions between an executing job and the parallel system, the system and method support dynamic reconfiguration of processor partitions, dynamic distribution and redistribution of data, communication among cooperating applications, and various other monitoring actions. The interactions occur only at specific points in the execution of the program where the aforementioned operations can be performed efficiently.

Abstract: A method of compressing data, including representations of objects, for future transmission or storage. More specifically, this invention compresses a representation of differences between a base sequence of data and the actual data to be transmitted or stored. Sparse bit masks representing the positions of insertions and deletions from a base sequence are iteratively compressed by representing consecutive sequences of zero-valued bits with single zero-valued bits.

Abstract: A system architecture enables the distribution, to users connected to a digital broadcast medium, of supplementary information, which is presented and accessed in the context of the viewing of a video program. This ancillary, or "follow-up" information (FUI) is embedded in the same transport stream (digital multimedia broadcast stream) as the digital video and audio content. The FUI may take the form of video, audio or text. Alternatively, the transport stream may carry pointers to follow-up information (PFUI) instead of the information itself. In the latter case, the pointers are saved and used subsequently in the selection of FUI from a channel which carries data exclusively. In the former case, the user selects the FUI (supplementary information) which is to be extracted from the broadcast stream as it is transmitted.

Abstract: A method and apparatus for providing customized notification in response to a search query. Moreover, with this invention, a query is received from a user via a user interface. The user also selected a time and means of notification, such as for example, by fax at a specified time. The system will also receive several notification choices from both the user and a supplier of information and match the choices so that a supplier can notify a user in accordance with a mutually selected time and means of notification.