Abstract: Various methods, apparatuses/systems, and media for generating a data structure are provided. A database stores a historic version of taxonomy data and a new version of taxonomy data. A processor, operatively connected to the database, accesses the database and analyzes the historic version of taxonomy data and the new version of taxonomy data. The processor determines what changes have been made in connection with a particular reference data based on analyzing the historic version of taxonomy data and the new version of taxonomy data; creates, based on determining, an association between the historic version of taxonomy data and the new version of taxonomy data corresponding to said particular reference data; generates consistent metadata from said association; and generates a data structure that illustrates history of evolution of taxonomy in connection with said particular reference data based on the metadata.

Abstract: Various methods, apparatuses/systems, and media for application of an N-dimensional hypercube datatype for automatically generating a data structure are provided. A database stores a plurality of data each associated with a corresponding application and each including metadata describing information about the data. A processor creates taxonomies describing data concepts associated with the metadata and store the taxonomies onto the database; receive the metadata and the taxonomies from the database via a communication network; automatically generate a cube set including a set of N-dimensional hypercubes from the received metadata to represent the metadata describing the information about the data; automatically generate a map from the cube set to express data quality checks and rules that apply to nodes in the map; and apply the data quality checks and rules to the received metadata to automatically generate a data structure.

Abstract: Various methods, apparatuses/systems, and media for generating a data structure are provided. A database stores a historic version of taxonomy data and a new version of taxonomy data. A processor, operatively connected to the database, accesses the database and analyzes the historic version of taxonomy data and the new version of taxonomy data. The processor determines what changes have been made in connection with a particular reference data based on analyzing the historic version of taxonomy data and the new version of taxonomy data; creates, based on determining, an association between the historic version of taxonomy data and the new version of taxonomy data corresponding to said particular reference data; generates consistent metadata from said association; and generates a data structure that illustrates history of evolution of taxonomy in connection with said particular reference data based on the metadata.

Abstract: Various methods, apparatuses/systems, and media for application of an N-dimensional hypercube datatype for automatically generating a data structure are provided. A database stores a plurality of data each associated with a corresponding application and each including metadata describing information about the data. A processor creates taxonomies describing data concepts associated with the metadata and store the taxonomies onto the database; receive the metadata and the taxonomies from the database via a communication network; automatically generate a cube set including a set of N-dimensional hypercubes from the received metadata to represent the metadata describing the information about the data; automatically generate a map from the cube set to express data quality checks and rules that apply to nodes in the map; and apply the data quality checks and rules to the received metadata to automatically generate a data structure.

Abstract: Various methods, apparatuses/systems, and media for implementing an N-dimensional hypercube visualization module are provided. A database stores a plurality of data each including metadata describing information about the data. A processor creates taxonomies describing data concepts associated with the metadata; receives the metadata and the taxonomies from the database via a communication network; automatically generates a cube set including a set of N-dimensional hypercubes from the received metadata; for each dimension of the cube set, automatically generates a map from values in that dimension to a number range; receives input for selecting three or fewer dimensions from the cube set to be displayed onto a graphical user interface (GUI) based on the number range; and automatically build a tree-view user interface (UI) component onto the GUI based on the received input representing selected and unselected terms from a taxonomy among the created taxonomies corresponding to a dimension.

Abstract: Systems and methods for dynamically managing and netting transactions based on one or more sets of netting rules are disclosed. The present invention dynamically associates transactions with one or more collections based on the execution of netting rules to identify transactions that may be ideal for netting and to perform netting operations and calculations accordingly. The present invention may execute the netting rules according to the priority of the netting rule within a rule hierarchy and utilizes unique solutions allowing for the efficient processing of transactions even as netting rules are created, modified and removed from time-to-time. In addition, embodiments of the disclosed netting system utilize denormalized sets of data and maintain a complete audit trail for all operations.

Abstract: Systems and methods for dynamically managing and netting transactions based on one or more sets of netting rules are disclosed. The present invention dynamically associates transactions with one or more collections based on the execution of netting rules to identify transactions that may be ideal for netting and to perform netting operations and calculations accordingly. The present invention may execute the netting rules according to the priority of the netting rule within a rule hierarchy and utilizes unique solutions allowing for the efficient processing of transactions even as netting rules are created, modified and removed from time-to-time. In addition, embodiments of the disclosed netting system utilize denormalized sets of data and maintain a complete audit trail for all operations.

Abstract: Systems and methods for dynamically managing and netting transactions based on one or more sets of netting rules are disclosed. The present invention dynamically associates transactions with one or more collections based on the execution of netting rules to identify transactions that may be ideal for netting and to perform netting operations and calculations accordingly. The present invention may execute the netting rules according to the priority of the netting rule within a rule hierarchy and utilizes unique solutions allowing for the efficient processing of transactions even as netting rules are created, modified and removed from time-to-time. In addition, embodiments of the disclosed netting system utilize denormalized sets of data and maintain a complete audit trail for all operations.

Abstract: Systems and methods for dynamically managing and netting transactions based on one or more sets of netting rules are disclosed. The present invention dynamically associates transactions with one or more collections based on the execution of netting rules to identify transactions that may be ideal for netting and to perform netting operations and calculations accordingly. The present invention may execute the netting rules according to the priority of the netting rule within a rule hierarchy and utilizes unique solutions allowing for the efficient processing of transactions even as netting rules are created, modified and removed from time-to-time. In addition, embodiments of the disclosed netting system utilize denormalized sets of data and maintain a complete audit trail for all operations.

Abstract: Systems and methods for dynamically managing and netting transactions based on one or more sets of netting rules are disclosed. The present invention dynamically associates transactions with one or more collections based on the execution of netting rules to identify transactions that may be ideal for netting and to perform netting operations and calculations accordingly. The present invention may execute the netting rules according to the priority of the netting rule within a rule hierarchy and utilizes unique solutions allowing for the efficient processing of transactions even as netting rules are created, modified and removed from time-to-time. In addition, embodiments of the disclosed netting system utilize denormalized sets of data and maintain a complete audit trail for all operations.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique. This provides the advantage that known changes to the subsystem do not require an invalidate/rebuild style operation on the cache. This is especially important where a change will invalidate the entire cache.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique. This provides the advantage that known changes to the subsystem do not require an invalidate/rebuild style operation on the cache. This is especially important where a change will invalidate the entire cache.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique. This provides the advantage that known changes to the subsystem do not require an invalidate/rebuild style operation on the cache. This is especially important where a change will invalidate the entire cache.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique. This provides the advantage that known changes to the subsystem do not require an invalidate/rebuild style operation on the cache. This is especially important where a change will invalidate the entire cache.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique. This provides the advantage that known changes to the subsystem do not require an invalidate/rebuild style operation on the cache. This is especially important where a change will invalidate the entire cache.

Abstract: An arrangement and method for update of configuration cache data in a disk storage subsystem in which a cache memory (110) is updated using two-phase (220, 250) commit technique.

Abstract: Disclosed is a method and device adapter for managing devices in a data processing system that includes a plurality of device adapters connected for independent communication with at least one shared device (e.g. disk data storage device). The method comprises the steps of: issuing a command from a first of the plurality of adapters to the at least one shared device; setting, in the first adapter, first and second timeouts associated with the command; on expiration of the first timeout value, issuing a message from said first adapter to other(s) of the plurality of adapters to request the other adapter(s) to notify the first adapter of any work requested of the shared device by the other adapter(s); and on expiration of the second timeout value, initiating a recovery operation in the data processing system.

Abstract: A data processing system comprises means for identifying and replacing instructions to jump to functions having known prolog instructions with modified jump instructions, means for storing the known prolog instructions, and means for retrieving the known prolog instructions when such modified instructions are found and for supplying the known prolog instructions for processing. A compiler or preprocessor is arranged to detect and modify the jump instructions. A logic module is arranged to intercept the modified instructions, retrieve from its storage the prolog instructions, and supply the prolog instructions for processing. The compiler or preprocessor is further arranged to detect and modify the first instruction of known epilog code. A logic module is arranged to intercept the modified instruction, and to retrieve and supply for processing the epilog instructions.

Abstract: There is described a personal conferencing method and system for a client (32)/server (30) environment. The server (30) stores conference model data (60) such as a shared chalkboard or a molecular model and each client has a copy of the conference model data (61). When one of said clients (32A, 32B, 32C) edits the model (61) it creates an instruction (64A) for operating on the model and sends the instruction (64A) to the server (30). The server (30) operates (62) on its conference model data (60) on receipt of the instruction (64A) and resends the instruction (64B) to each of the clients (32A, 32B, 32C) and each client (32A, 32B, 32C) performs the same operation (63) on their respective copies of the conference data model (61). Whereby after a plurality of different operating instructions (64B) from different clients (32A, 32B, 32C) the respective copies of the conference model data (60) are equivalent.

Abstract: A system and method are provided for processing data representing stored images so that a set of such stored images can be represented simultaneously on an output medium having a specified output area in such a way that more effective use of the output area is made than previously possible with prior art techniques. Typically the set of stored images to be represented will result from an image database search and the output area will be a display screen of a monitor.