Abstract: A method and a system for computing the function value of an input node based on function values of known nodes. A database of known nodes and their corresponding function values is formed. The known nodes are located such that a distance between any two adjacent known nodes is an integer power-of-two number. The database is searched for a first node such that the input node is located between the first node and an adjacent second node. The difference ? between the input node and the first node is computed. Then ? is shifted to the right by k positions, k being the logarithm in base 2 of the distance between the first and second nodes. The input node function value is computed by combining the first node function value with the product of the shifted ? and the difference between the function values of the second and first nodes.

Abstract: A method in a computer system is disclosed for discovering host-based legacy screen assets. The system has a client, a server and a host, including a repository. The method comprises the steps of creating an application object comprising a collection of the legacy screen assets; and, creating a recognition file for storing constituent elements of the legacy screen assets. After this, a first stream of data representative of the legacy screen asset is received from the host in response to a request by the client for data fields. Next, the first data stream is parsed into constituent elements and stored in the recognition file and then the constituent elements are associated with the screen assets. The constituent elements of the first data stream are appended to the recognition file for the screen assets; and, then they are associated with data names that are stored in the repository, thereby creating a specification for each of said legacy screen assets.

Abstract: Heterogeneous data at a plurality of remote nodes is accessed automatically in parallel at high speed from a user site using a simple script request containing a data source object name wherein the heterogeneous data is treated as a single data source object, the script further containing at least one method to be performed on the data source object. Respective agent processes at the user site and at the remote nodes automatically generate descriptor files containing metadata corresponding to the data source object. The user site agent breaks the user-generated script into new scripts appropriate for execution at the remote nodes. A messenger process transmits the new scripts to the appropriate remote nodes where respective agent processes respond to automatically access the appropriate data and execute specified methods upon it.

Abstract: A computer-implemented method for translating a MOF metamodel into a UML Model. The method comprises the steps of reading each element of the MOF metamodel and determining the type of each MOF element read in the preceding step. After this, a translation process is selected for the type determined in the preceding step; and, the process selected in the preceding step is executed.

Abstract: A computer-implemented method for synchronizing JAVA with UML in a computer system executing a repository program. The method comprises the steps of determining if a previous revision of JAVA source exist, and if not; creating a new revision of the JAVA source. Next, the new revision is put in a “created” state and the new JAVA source is stored in the new revision. After this, the new revision is put in a “ready” state. A determination is next made if a previous revision of UML representation exist, and if not; a new revision of the UML representation is created. The new revision of the UML is then put in a “created” state; and, a UML representation of the JAVA source is created.

Abstract: Heterogeneous data at a plurality of remote nodes is accessed automatically in parallel at high speed from a user site using a simple script request containing a data source object name wherein the heterogeneous data is treated as a single data source object, the script further containing code representing a user-defined program to be executed on the data source object. The user-defined program may be represented by an embedded script, a user-defined script or an executable program designation. A user site agent breaks the user-generated script into new scripts appropriate for execution at the remote nodes. A messenger process transmits the new scripts to the appropriate remote nodes where respective agent processes respond to automatically access the appropriate data and to automatically execute the specified program. If the program is a user-defined script or executable, the respective agent processes access a metadata repository to obtain the specified program.

Abstract: A computer implemented-method for synchronizing JAVA in a UML in a computer system executing a repository program. The method comprises the steps of determining if a previous revision of UML representation exist, and if not; creating a new revision thereof. Next, the new revision is put in a “created” state and stored in a new UML representation in the UML revision. The UML revision is then put in a “ready” state. After this, a determination is made as to whether or not there are more UML classes/interfaces; and if there are, a JAVA revision ID is extracted from the UML class/interface. Another determination is made as to whether or not a JAVA revision exist, and if not; a new revision of JAVA source is created and put into a “created” state. JAVA source is then generated from a UML representation and stored in the new revision and put into a “ready” state. All of the steps are repeated until there are no more UML classes/interfaces.

Abstract: A computer-implemented method for converting a UML rendering of an RSM-based metamodel to a UML rendering of a MOF-based metamodel. The method includes the steps of removing inheritance from classes defined within a Repository Services Model (“RSM”) and removing each explicit “construct” operation from each class in the RSM-based metamodel Next, each use in the RSM-based metamodel of an RSM type is changed to use a non-RSM type. After this, each element of the RSM-based metamodel is converted to a corresponding MOF-based element and a determination is made as to whether or not the RSM naming service is used in the RSM-based metamodel, and if so “name” attributes are added that would have been inherited from the RSM classes. A <<metamodel>> stereotype is added to the UML rendering of the MOF-based metamodel; and the MOF properties are set on the UML rendering.

Abstract: A method in a multi-processor computing system is disclosed. The method is an object-oriented method that allows a user to make associations between processes to be executed and available CPUs of the system. In particular, the method includes the displaying of the associations for a user to manipulate. Responses are accepted by the method from a user for creating logical groupings of the CPUs, hereinafter referred to as affinity groups. Next, an affinity mask is accepted from the user for each of the affinity groups, which affinity mask assigns available ones of the CPUs. After this a determination is made as to whether or not there are more CPUs to be assigned to the affinity groups, and if not; specific rules that make associations between the processes and the affinity groups are then accepted by the method from the user.

Abstract: A method of executing arithmetic operations in a data processing apparatus wherein first and second numbers having a main frame “e-mode format are converted to IEEE double format. Arithmetic operations are then performed using the first and second numbers in IEEE double format to form a result in IEEE double format. The IEEE double format result is then converted back to main frame e-mode format. The conversion of the first and second e-mode numbers to IEEE format includes a step of shifting a mantissa of each e-mode number by a single step of subtracting 2Nexp where Nexp is the exponent of the IEEE double under formation.

Abstract: A computer-implemented method for streaming object models with a plurality of versioned states. The method comprises the steps of streaming out each versioned state for each nonderived classifier-level feature; streaming out each versioned state of each unowned object within the model; streaming out versioned state of each owned object not yet streamed out; streaming out the versioned state of each link not represented by a reference; and streaming out a version graph using normal XMI.

Abstract: A method in a computer system executing a repository program for dynamically linking two objects in two different models within the repository. The method includes the steps of receiving object identifiers of each of the two objects and an association name from a computer program using the method. The association name is then used to extract a namespace object from the repository program, wherein the namespace object is a part of the repository program for containing association names. Next, a determination is made as to whether or not an association already exists between either one of the two objects and the namespace object. If it is determined that no association exists, then the association name of a first of the two objects and the namespace are changed to an object identifier of a second of the two objects. Finally, the association name of the second of the two objects and the namespace are changed to an object identifier of the first of the two objects.

Abstract: In a computer system having a memory and an operating system persistently stored in a storage device, a method for comparing System States of the system from time to time. The method includes creating a snapshot object for interfacing with functionalities of the system; and using the snapshot object, creating a first collection of System State objects which record the status of the system at a given instant in time. Next, the first collection of System State objects is stored in the memory. A second collection of System State objects, which was previously created and stored in the storage device, is then loaded into the memory. A comparison of the first collection with the second collection is made and an indicia of any differences therebetween is provided.

Abstract: A computer-implemented method for representing JAVA in UML in a computer system executing a repository program. The method comprises the steps of determining if a file is a JAVA package or project. If it is, then determining if there is a JAVA subpackage not represented in UML, and if so; recursively creating UML subpackages representing each nested JAVA subpackage. If it is determined that the file is not a JAVA package or project, then the method creates UML files representing each JAVA source file.

Abstract: A computer-implemented method is disclosed for automatically converting text-based screen applications of a legacy computer system into a graphical-based representation thereof. The method includes the steps of transforming a terminal-based screen application into an application specification; converting the application specification into a modeling language-based representation; and, displaying the modeling language-based representation with a graphical user interface. The method of this invention also includes the capability of generating document type definitions of the modeling language-based representation, which enables transmission of the representation among modeling tools.

Abstract: A method is provided in a computer system executing a repository program and having a storage means for mapping alterations in system state to rules, both of which are part of an object-oriented model resident in a persistent repository. The method includes storing in the persistent storage means the model comprising a set of rules and a set of facts defining event states, both of which are stored as objects. The set of rules and said set of facts comprise an object-oriented representation of the model. Next, a set of commands representing an extensible inference engine are loaded as meta objects into the persistent storage. The method accepts as inputs events representing alterations in the set of facts. All of the events are retained and the events are mapped to the set of rules for deriving a list of affected rules, which are evaluated to determine if they have been qualified. Only those affected rules determined as qualified are saved for further processing.

Abstract: A method is provided by a computer system processing XMI-based XML documents. The method compares two such XMI-based XML documents for identical content. The method begins with the step of parsing each of the documents to create for each a semantic graph of the document's objects. Next, a list of names of properties for each of the objects having significant order is read. For each of the objects, and then for each object's property not listed as having significant order, values of said properties are sorted. Finally, the objects of the semantic graphs are compared.

Abstract: A number of partitions of a cellular multiprocessor (CMP) are connected to respective databases and form respective nodes of a data warehouse. Heterogeneous data stored across the nodes is accessed automatically in parallel at high speed from a user site using a simple script request containing a data source object name wherein the heterogeneous data is treated as a single data source object, the script further containing at least one method to be performed on the data source object. Respective agent processes are stored in memory dedicated to each partition and automatically generate descriptor files containing metadata corresponding to the data source object from a repository available to each partition. A messenger process transmits the new scripts to the appropriate nodes via memory-based messaging using a shared portion of the CMP memory. Respective agent processes at each node respond to automatically access the appropriate data and execute specified methods upon it.

Abstract: The functionality of “protected shareware” is controlled by digitally signed messaging protocol. Protective code within the shareware controls the functionality of the shareware in response to authorization messages which are supplied directly or indirectly by the shareware supplier. These messages are digitally signed in whole or part by or on behalf of the shareware supplier using the supplier's secret signing key. The shareware, in turn, includes the public checking key for this digital signature of the supplier, thereby enabling the protective code to authenticate any such authorization message before acting in reliance upon it. The shareware includes an integrity self-checking routine which is run at appropriate times to ensure that shareware, including its protective code, is in an anticipated state. Typically this is equivalent to a finding that the code has not been altered, but it is conceivable that the code might be dynamically altered in some authorized (i. e.