Abstract: A method and implementing system are provided in which processor registers are divided into sectors and such sectors are individually renamed. In one embodiment, the register file is divided into sectors such that the smallest accessible unit for an instruction set in each register can be uniquely addressed and renamed thereby providing additional effective registers for renaming.

Abstract: The invention is a system, method, and computer readable medium for determining which copy of data to access in an information handling system. Since the same data is often stored in more than one storage location (e.g., on more than one physical volume or disk, or in more than one memory area), it is often more efficient to read a particular copy of the data. The present invention determines which copy of the desired data can be read most efficiently (i.e. in the least amount of time), and then accesses that particular copy of the data. In an embodiment of the invention, when a read request is received, each mirrored disk (i.e. copy) containing the requested data is checked to determine which disk contains the fewest relocated blocks within the desired read area. The data is then read from the mirrored disk with the fewest relocated blocks within the read area.

Abstract: A dynamic buffer is used to display an object from a document. The cut object is visible to the user as the floating cursor is positioned to a desired insertion point. The cut object can be any combination of text, graphics or data. The display can move in conjunction with the floating cursor or be parked at a predetermined or user-selected position. The cut object can be abbreviated to fit the display, or the display can be sized or scrolled. Once an object has been cut and thus stored in the dynamic buffer, it can be edited, or pasted to a new location or merely deleted.

Abstract: The present invention allows a multimedia session to be transferred from one application server to another in the event that the original application server fails, and also allows a session to be cooperatively transferred from one application server to another, even though the original application server is still available for use. The new application server may be in the same multimedia computer (i.e. the same physical machine) as the original application server, or the new application server may be in a different computer. The session is transferred without losing existing resources, and callbacks that occur during the session takeover process are not lost. An application server which owns a multimedia session may enable that session for takeover, by using an Application Programming Interface (API). The API returns session takeover data which must be available to a new application server in the event of a takeover.

Abstract: The present invention is a system and method for finding information of interest within a particular Web page. A user creates an interest profile, which is stored with the user's browser. An interest profile may be as simple as a list of key words, or may be more complex, including data such as relative importance weights and boolean expressions. Once an interest profile is created, it may be used on any Web page to sort the information on the page according to the user s interests. Information may be sorted by line, paragraph, section, or any other defined scope. Once sorted, the information is displayed to the user as a series of links to the actual points of interest within the original page.

Abstract: The present invention is a system, method, and computer readable medium for controlling the downloading and display of animated sequences from a server to a client. A user chooses which, if any, animated sequences to view on a Web page. Before downloading a graphics file associated with a particular Web page, the server checks the file to determine if it contains any animated sequences. If the graphics file contains an animated sequence, the server only downloads the first graphic image of the animated sequence. This first graphic image is presented as a static image to the user. By only downloading the first graphic image, download time is reduced and less memory and disk space is used in the client. The user views the static image presented on the screen, and then determines if he wishes to view the entire animated sequence. If so, the user indicates that he wishes to view the entire animated sequence.

Abstract: The present invention is a system, method, and computer readable medium for dynamically specifying one or more attributes for an I/O transaction, or group of I/O transactions. There are situations where it is advantageous to allow a process (i.e. user or application) to dynamically change I/O attributes, such as the primary mirror and scheduling type, for a single I/O operation or for groups of I/O operations. The present invention allows a process to request a particular attribute (e.g., a primary mirror or a scheduling type, such as parallel or sequential) or set of attributes for an I/O transaction. If the dynamically requested attribute or attributes are available, they are used to complete the I/O transaction. If any requested attributes are not available, a default attribute or attributes are used, so that the I/O transaction completes.

Abstract: The present invention is a system, method, and computer readable medium for inserting additional data into a digital audio/visual data stream, at points other than pre-defined splice points in the data stream. The inserted data may possess one or more attributes which differ from the original data stream. The distributor of an audio/video asset provides control information, including an insert file, which contains a list of insert points in the data stream. Reinitialization data information is also provided for each insert point. The reinitialization data includes the attribute information needed to reinitialize a decoder with the attributes of the original data stream after the inserted data is played. The original audio/video data stream is played until an insert point is reached. The additional data is then played. Next, the reinitialization data for the insert point is played in order to reinitialize the decoder with the attributes of the original data stream.

Abstract: The present invention is a system, method, and computer readable medium for saving and reusing recently acquired Internet addresses. When a client computer receives an Internet address for a particular computer name, the computer name and its corresponding Internet address are saved in a client memory area. Before sending a request to a name server, the client memory is checked to determine if the desired computer name and corresponding Internet address are stored in the client memory. If so, the stored Internet address is used to access the desired machine. If the desired computer name and corresponding Internet address are not stored in the client memory, the requested computer name is sent to the name server for conversion. The name server passes the Internet address back to the client, where it is used to access the machine, and is also stored in the client memory for future use.

Abstract: This invention addresses the management of window geometry (or layout) in a distributed data processing system. In this invention, a client server model includes an application executing on a client system with graphics being drawn on the server system for the end user. Each client application interacts with the user by defining client windows into which are placed graphical data and where input data may be entered by the user. The application software together with the graphics software is provided in the client processor. The server processor includes the ability to display data to the end user. The application data for display, in the form of a window, includes a special designated area within the window to provide user access to the application.

Abstract: The present invention provides a computer system which allows a user to identify which one of a plurality of feature cards has issued an error signal. The device issuing the error signal is then isolated and error recovery techniques, (or re-initialization) are implemented only on the device with the error condition. The computer system includes additional control logic, along with a bridge chip that interconnects different information buses and at least one connector slot for receiving a feature card, which implements specific functions such as I/O, memory, or the like. When it is determined that an error signal is present the system hardware activates and holds a reset signal to the device which issued the error signal. Additionally, a status bit in a register in the bridge chip is set.

Abstract: An arbiter which allows a normal arbitration algorithm to be implemented for standard I/O devices, and an isochronous arbitration algorithm to be run for isochronous devices. Further, the isochronous devices can participate in the normal arbitration scheme when operating as a standard I/O device. A host bridge interconnects a system bus with an I/O bus, such as the PCI bus. The host bridge includes an arbiter with a normal arbitration algorithm, and, an isochronous arbitration algorithm implemented in either logic circuitry or software. Each I/O device (both standard devices and isochronous devices) connected to the I/O bus has a bus request line which transmits a request for control of the I/O bus to the arbiter. Depending on the state of the bus request control signal, the arbiter can determine which arbitration algorithm is to be utilized. For example, a standard device will drive the bus request signal active and hold it in its active state to indicate a standard bus request.

Abstract: A method and system for generating a private colormap for a window in a data processing system having a shared colormap. A private colormap is generated by overwriting a selected portion of a copy of the shared colormap with a user-determined colormap of the same size as the selected portion to form a modified colormap. The modified colormap is then substituted in place of the shared colormap.

Abstract: A method, apparatus, and article of manufacture for causing a computer to directly scroll the contents of window in any direction. The window could be a folder, document, or any container for retaining information. The contents of the window are too large to be simultaneously displayed on the display screen. The method includes the first step of moving a visible view indicator of a scrolling mechanism in a direction consistent with movement of a pointer means in response to the pointer means being positioned and activated over the visible view indicator using user controls. The second step includes the step of scrolling the contents of the window on the display screen in a direction substantially opposite to the movement of the pointer means and the visible view indicator.

Abstract: A data compression apparatus including a circuit for receiving a data element, a storage circuit for sequentially storing previously received data elements at sequentially addressed fixed locations, a circuit for comparing the received data element to the stored data elements to determine whether the received data element matches at least one of the stored data elements, and a circuit for generating an address of the matching stored data element. In addition, a method of compressing data including the steps of receiving a data element, sequentially storing previously received data elements at sequentially addressed fixed locations, comparing the received data element to the stored data elements to determine whether the received data element matches at least one of the stored data elements, and generating an address of the matching stored data element.

Abstract: A computer graphics system, that manipulates the vertices contained within a group of possibly self intersecting, free space, over lapping polygons, into simple, convex polygons. A normal axis to the complex polygon is determined such that the surface of the polygon is viewed along this normal axis. The polygon surface is then bounded by a rectangle and subdivided into a group of slabs, or smaller rectangles, each rectangular slab being bounded by a pair of interior vertices of the complex polygon. An active edge table is used to store values corresponding to the edges crossing through the slabs, which are used to determine if these edges cross are another at any point within the slab. If a crossing point does exist, the slabs are divided at the crossing point into rectangular sub-slabs until it is determined that no edge intersects another edge within the sub-slabs, of the original slab being considered.

Abstract: An information handling system manages the interaction between a graphical user interface and a program application. Procedural modules which define operations to be executed by the program application to implement specific functions are stored in a relational data table. Graphical objects such as polygons, rectangles, squares, arrows and other objects are stored in the relational data table. A menu driven system allows a user to associate or link, specific graphical objects with procedural modules such that when the graphical object is selected by a user through a mouse click operation, or the like, the program applications executes operations corresponding to the procedural modules associated with graphical objects selected. In this manner, a user can manage an object oriented system by relating various graphical objects to desired procedural modules to be executed by the program application.

Abstract: A system and method for checking the test logic contained in a computer memory system during POST such that any errors can be determined and made available to the system software prior to beginning processing operations. Single and double bit errors are induced which the ECC logic must identify and correct. The CPU compares the data that is written to memory with the data that is read back. Thus, since it is known that an error occurred, due to the induced error provided by the present invention, identical data will verify that the ECC correction logic is working properly. More specifically, a multiplexer is provided in the data write path which substitutes a constant set of identical bits for the actual data generated by the CPU. ECC bits are generated based on the actual generated test data, rather than the inserted identical bits. The substituted data bits and generated ECC bits are then stored in memory. An error condition is identified when the data and ECC code is read back from memory.