Abstract: The invention provides a mechanism for distributing objects from a object oriented framework that permits method invocation and state information notification, such as event notification in a JavaBeans software component model. A code generation tool generates code from an existing server object that contains only application domain specific logic, to support deployment of the server object on a remote machine in a distributed application. The generated code includes a proxy class to reside locally with a client program that might invoke methods on the server object or receive notification of state information (events) from the server object, and a proxy class to be remotely deployed with the server object. The proxies created provide all the middleware specific logics.

Abstract: An apparatus and method for locating and selecting hypertext links allows a web user to select a web page, then quickly and efficiently locate and select any hypertext link on the web page. A web user simply navigates to a web page and scrolls through the web page using the slider on the scroll bar. As the web user scrolls through the page, each link that appears on the screen is displayed in one of several predefined colors with no two adjacent links being displayed in the same color. When a given hypertext link is within the range of the slider on the scroll bar, this link becomes the current or active link and the slider on the scroll bar changes to a color which corresponds to the color of the link. The color change provides a visual cue to the user that the current or active link can now be selected.

Abstract: The scroll box processor of the present invention provides increased access capabilities by providing four different access modes. Each mode involves a different level of access (i.e., coarse to fine). The fine access mode provides unit by unit access (line by line in the case of a document) by allowing the user to accomplish fine access through the scroll box itself. The remaining access modes are provided by combining conventional left mouse button/scroll box interaction with user mode selection.

Abstract: The Viewable Object Processor of the present invention utilizes object handles that allow users to perform operations on windows and other viewable objects (e.g., move or resize a window) without having to depress a key (or key sequence) on a keyboard or a button on a pointing device such as a mouse. Essentially, object handles are specialized regions created on a display screen. Associated with each object handle is a particular geometric shape and a object handle type. The shape of each object handle identifies the bounds of the particular object handle. To perform an operation on a viewable object, a user need only cause the cursor to enter into the object handle region of a handle that corresponds to the operation that the user wishes to perform.

Abstract: A computer system and method of controlling the same utilize logically-typed concept highlighting to link together in a user's mind the relationships between various concepts within a body of knowledge. Information from a body of knowledge is maintained in one or more information elements, at least a portion of which are associated with one or more named concepts. Links are defined between two or more named concepts, so that information elements associated with named concepts linked via a link may be visually represented to a user in such a manner that the link between such named concepts is apparent to the user. The links are selectively enabled in response to a predetermined criteria so that different links may be enabled or disabled under appropriate circumstances.

Abstract: The method maintenance mechanism of the present invention is comprised of two submechanisms, a method update mechanism and a method call manager. The method update mechanism is used to make changes to existing methods. The method call manger manages calls to methods in a way that allows active programs to continue to use old versions of methods while at the same time providing access to new method versions when programs are reactivated or activated for the first time.

Abstract: The present invention provides an enhanced computer resource search mechanism that can be used to search for computer system resources using either computer resource names or computer resource unique identifiers. This is accomplished via a search mechanism that is comprised of an enhanced indexing structure and an associated search engine. The indexing structure is made up of a series of entries that are resource name/bag pairs. A bag is a composite structure that is itself made up of one or more UID/location pairs. Each pair within a bag represents one instance of the subject name within the name space under consideration. The search engine uses this enhanced indexing structure to perform bounded searches of a name space based on a presented resource name or UID.

Abstract: The ADL system provides a way in which computer programs written in different programming languages can share data. The ADL system comprises the ADL language and the facilities necessary to perform the data sharing function. The ADL language uses the concept of a data description and conversion module. A data description and conversion module, or more simply, an ADL module, is composed of declarations and plans. Each declaration is an ADL description of how a particular program environment represents data. The plan portion of the ADL module contains ADL statements that instruct the computer system to convert the data representations of the source program environment into the data representations of the target program environment.

Abstract: An architecture-independent test program generator for producing test programs for checking the operation of a hardware processor design comprises means for storing data representing the processor instruction set and resources, and logic for generating, for subsequent storage or processing, test programs from said stored data, characterized in that the data is a separate declarative specification, the generator comprising logic for extracting said data from the storage means, and in that the relationships between the processor resources and semantic entities associated with each instruction are modelled in said declarative specification.

Abstract: Historically, graphics editors, text editors, presentation editors, and word processors provide a number of special processing functions that operate on a presented object as a whole. For word processors, these special functions might include: spelling checks, style (grammar) checks, hyphenation, and pagination. The present invention provides a transparent mechanism for making these special processing functions incremental, in the sense that the mechanisms re-process only those portions of presented objects that have changed since the last time the function was performed.

Abstract: A visually aging scroll bar is associated with a window or viewport on a computer display as part of a computer system, and contains a slider to indicate relative positioning in the window of a document, such as a data file, image file, audio file, text file, or spreadsheet. The current position of the scroll bar slider is monitored by the computer system. After a first predetermined sampling period has elapsed, a first region matching the current position of the scroll bar slider is created. The visual appearance of the region is determined by a predetermined region heating rate. For example, a newly created region starts at "cold", which can be indicated by a violet-indigo color. After a second sampling period has elapsed, the computer system again checks the current position of the scroll bar slider. If the current position still matches the first region, the visual appearance of the first region symbolically "warms up" as indicated by the region heating rate.

Abstract: A conventional bi-endian computer system is enhanced to include mixed-endian mechanisms that allows the computer system to dynamically change its endian mode. The mixed-endian computer system can change endian mode on a task by task basis if necessary. The mixed-endian mechanisms automatically format the data in the form expected by the running task, regardless of whether the task expects the data to be in big endian format or in little endian format. The mixed-endian mechanisms also format big and little endian instructions such that they can execute on the same computer system.

Abstract: The present invention uses an optimizing compiler to identify what are referred to herein as stackless variables. A variable is said to be stackless for a given call statement if the calling program does not have a need for the information stored in the variable when the calling program resumes execution after the program that is the subject of the call statement returns control of the processor to the calling program. The decision of whether a variable is stackless or not for a given call statement is made within the preferred embodiment by determining whether the live range of the particular variable spans the location of the call statement in question. If a variable's live range is found to cross the location of the call statement, it is not considered stackless. However, if a variable's live range is not found to cross the location of the call statement, it is considered to be stackless for that particular call statement.

Abstract: A conventional bi-endian computer system is enhanced to include mixed-endian mechanisms that allows the computer system to dynamically change its endian mode. The mixed-endian computer system can change endian mode on a task by task basis if necessary. The mixed-endian mechanisms automatically format the data in the form expected by the running task, regardless of whether the task expects the data to be in big endian format or in little endian formate. The mixed-endian mechanisms also format big and little endian instructions such that they can execute on the same computer system.

Abstract: The data structures, apparatus, methods, and mechanisms of the present invention cooperate to provide the user with a flexible multiple inheritance OOP environment. OOP environments comprise composite data structures and internal mechanisms for manipulating those structures. The structures are used to allow a user to realize the power of OOP. Hence, the layout of these structures, the way in which the structures inter-relate, and the manner in which they are built and used are all critical to the utility of a particular OOP environment. It is no surprise, then, that manufacturers and suppliers of OOP environments are constantly striving to design composite data structures and internal mechanisms which maximize user productivity. The composite data structures and organization of the MOM OOP environment provide significant benefits that are not provided by the multiple inheritance environments of the prior art.

Abstract: It is known that virtual memory segments that are allocated together tend to be used together. With existing sequential address allocation mechanisms, this in turn means that programs tend to end up using the same set or sets of virtual segment addresses (i.e., in the same minitable or minitables), which, as mentioned, leads to increased address translation time because of clumping. The address allocation mechanism of the present invention reduces clumping by allocating virtual segment addresses in a pseudo-random order. This decreases the likelihood that virtual segment addresses that are allocated together end up in the same set or sets of virtual segment addresses within the address translation table.

Abstract: A television presentation and editing system uses closed captioning text to locate items of interest. A closed captioning decoder extracts a closed captioning digital text stream from a television signal. A viewer specifies one or more keywords to be used as search parameters. A digital processor executing a control program scans the closed captioning digital text stream for words or phrases matching the search parameters The corresponding segment of the television broadcast may then be displayed, edited or saved. In one mode of operation, the television presentation system may be used to scan one or more television channels unattended, and save items which may be of interest to the viewer. In another mode of operation, the system may be used to assist editing previously stored video by quickly locating segments of interest.

Abstract: Historically, graphics editors, text editors, presentation editors, and word processors provide a number of special processing functions that operate on a presented object as a whole. For word processors, these special functions might include: spelling checks, style (grammar) checks, hyphenation, and pagination. The present invention provides a transparent mechanism for making these special processing functions incremental, in the sense that the mechanisms re-process only those portions of presented objects that have changed since the last time the function was performed.

Abstract: In a resilient database system which includes a journaled database which is implemented at one or more locations within a distributed data processing system, multiple diverse consistency levels are specified which each detail a level of consistency to be maintained between a primary database and a replica database. A user is then permitted to select a particular level of consistency for each replica database. Thereafter, each update to a record within the primary database is utilized to initiate an update to the corresponding record within each replica database in a manner which is consistent with the selected level of consistency for that replica database.

Abstract: The Output Library Administrator of the present invention is comprised of three discrete components: an Output Record Handler, a Logon Request Processor, and a Call Command Processor. The Output Record Handler is responsible for interacting with the user to gather pertinent information about an output material file that the user wants processed. Once the Output Record Handler has assembled all of the necessary information, the Output Record Handler creates a record containing the information (i.e., the output material file, etc.) and stores the record in a library for later processing by the Logon Request Processor and the Call Command Processor. After the output file has been stored by the Output Record Handler, the output file remains in storage until further processing is requested by the user. To request processing of an output material file that has been stored by the Output Record Handler, the user merely goes to the output device and "logs on" via a keypad or other interactive device.