Abstract: An inherently serial program is processed in parallel, thus leading to higher processing speeds, while maintaining a close approximation to the specific result obtained through a serial running of the program. This goal has been attained based on the fact that the desired degree of closeness between a parallel result and the serial result depends on the particular inherently serial program being run and the type of analysis being performed. That is, some inherently serial processes require a “fine-tuned” result while for others a “coarser” result is acceptable. The frequency at which the parallel branches consolidate their respective results is changed accordingly to alter the degree of closeness between the parallel processed result and the serially processed result.

Abstract: A method is disclosed for reproducible sampling of data items of a dataset which is shared across a plurality of nodes of a parallel data processing system.In data mining of large databases, segmentation of the database is often necessary either to obtain a summary of the database or prior to an operation such as link analysis. A sample of data records are taken to create an initial segmentation model. The records of this sample and the initial model created from them can be critical to the results of the data mining process, and the initial model may not be reproducible unless the same sampling of data records is repeatable. Reproducible sampling is enabled without polling of all nodes to locate particular records. Parametric control information with a small number of control parameters is generated which describes the particular partitioning of the dataset. The parametric control information enables computing of the location of a data record.

Abstract: The present invention relates to a method of computerized transaction of a collection of a multitude of potentially distributed transactions ensuring the atomicity of the collection of transactions. Besides offering atomic processing behavior the invention optimizes the communication traffic for the coordination of said transactions and the concurrency behavior and throughput of said collection of transactions. The fundamental concept of the current invention for the processing of a collection of potentially distributed transactions encompassed by a global transaction is based on the approach to split the collection of transactions into groups of transactions. Each of the groups is called a transactional stratum or stratum for short. Each stratum is processed and synchronized via an atomic-commit-protocol, thus guaranteeing an ACID processing outcome for each individual stratum. The global transaction, hence structured as a resulting collection of groups of transactions, i.e.

Abstract: A computer graphics system and method for automatically defining a multi-block grid in a three dimensional space region which has a plurality of finite 4-sided surfaces arranged so that the space region is divided into a plurality of substantially hexahedral adjacent blocks.

Abstract: A system to intelligently link a computer user to enormous databases of multi-media information. The system provides an automated facility to determine the value of information based on each user's subjective preferences. An execution is created by comparing these preferences with prior characterizations of information objects. Once the comparisons are made, an ordered list is compiled. The list provides a set of data sources starting with the most relevant and ending with the least relevant. By selecting and reviewing only the most significant references, the probability of locating a pertinent reference is increased dramatically while increasing the effectiveness of time spent reviewing results.

Abstract: A phase-locked loop implemented in all-digital components uses a stochastic approach to detect errors in phase position and relative velocity. Using a history circuit and an adjustment-intensity selection circuit appropriate corrections in phase and frequency are made. The history circuit keeps a running record of a series of binary results (0 or 1) as received from a phase comparator. History components collected include the number of consecutive oscillator periods in which the phase offset (0 or 1) has remained the same and the number of oscillator periods in which the phase offset count has not exceeded 1.

Abstract: A method is described for a computerized search for words in an electronic database with a large number of documents stored in memory. With this method, a Boolean retrieval method is used to determine in which of a large number of documents an initial word meets a Boolean condition. A probabilistic retrieval method is then used to determine in which of the documents fulfilling the Boolean condition, the relevance of appearance of a second word exceeds a specified value. The two retrieval methods use different indexes for this. The disadvantages normally found with this are avoided by the two different indexes having a common element that can be processed by both retrieval methods.

Abstract: A system and method for allowing communication of a large number of parameters from a computer user to an application program with a relatively small amount of interaction. The system uses a plurality of graphical metaphors to represent a collection of known personality or collective knowledge representations to extract a computer user's preferences. A computer user expresses how much likeness exists between themselves and a set of metaphoric graphical objects which is translated into an intermediary format which enables the computer to provide a higher quality of pattern matching and differentiation.

Abstract: IMS Web provides for a method and apparatus which enables a user to communicate with IMS-based applications using a Web Browser. An input HTML form is used to associate IMS transaction data which is then supplied to a CGI-BIN program which uses IMS Web generated C++ class definitions to determine classes for each logical page. The CGI-BIN program interacts with the IMS database through an TCP/IP OTMA adapter and an output HTML communicates with the Web client.

Abstract: A server-based application intercepts an initial request for access to documents which may contain imbedded references to linked information. A request is made from the server to the actual location of the requested document as it is found on a network (e.g. WORLD-WIDE WEB, INTERNET, etc.). The document is retrieved into the server and parsed to discover all imbedded addresses contained therein. The server then replaces each imbedded address with its own address plus the original imbedded address such that all future references to the imbedded information will be supplied by the server. Additional linking information, functions and/or environment escape information may then be prepended and/or postpended to the requested document independently through the server.

Abstract: A coherent method for the creating, capturing, and retrieving of ideas, concepts, data, and/or multi-media information The system establishes a framework in which knowledge can be represented. The system is a computer-based system which utilizes multimedia, databases, and mass storage to implement this framework. It has an architecture and an open-ended-set of functional elements that combine to support knowledge processing. Knowledge is created by uniquely identifying and interrelating heterogeneous datasets located locally on a user's workstation or dispersed across computer networks. By uniquely identifying and storing the created interrelationships, the datasets themselves need not be locally stored. Datasets may therefore be located, interrelated and accessed across computer networks. In addition, an almost unlimited number of relationships can be created and stored as knowledge to be selectively filtered and collected by the end user.

Abstract: An extension of an information cataloging metadata model allows metadata users to link objects in a linear or peer-to-peer relationship (not hierarchical). Additional elements include adding a metadata functional category whoes object instances logically attach to other metadata objects in an information catalog (or information directory). Finally, the information cataloging metadata model is extended to enable metadata users to launch applications which can use values from any metadata object type as parameters to applications.

Abstract: A Connection Server provides very flexible structures for the identification of objects to be interconnected, the identification of the links which connect them, and the auxiliary information needed to materialize objects when they are referenced. The connection Server is designed as a stand-alone reusable component. It interfaces with other independent components for services such as classification attributes, distributed database services, Noumena (object) storage, etc. Clean public programming interfaces are available for all components. It is independent from the "front-end", the user driven display of the Connections and associated meta-data. It is independent from any authoring facilities which may be used to customize the services, meta-data, etc., that are provided.

Abstract: A system including a method for cohesively storing and retrieving heterogeneous classification systems. The database schema of the present invention is constructed of three data substructures, the Attribute Classification, Attribute Value Instance and Attribute Value schemes. The three structures track globally uniquely identified representations of the descriptions, values, and attributes of various differing classification systems and their respective contents. The use of uniquely identifiable elements throughout the database schema allows computerized management of noncompatible classification systems without programming modifications as required in the prior art systems.

Abstract: A data recording disk drive is provided with a fixed block architecture sector format that eliminates the ID region. The servo region contains sector identification information in the form of a start-of-track indicating mark recorded in a selected sector of each track and a start-of sector indicating mark recorded in each sector. A full track number identifier is encoded in the position field within the servo region of each sector. A look-up table is built at format time to map bad sectors out of the disk drive. The table contains entries for each cluster of contiguous bad sectors, and is searched at runtime to provide conversion of logical sector location identifiers to physical sector location identifiers.

Abstract: A system and method for creating a knowledge base continuously developed through a method of repetitiously connecting various sources of locally and remotely located sources of data. The various sources of data can include reports, articles, books, audio recording, multi-media or computer data. The system uses a systematic approach of selecting a search criteria, selecting a set of search objects, identifying connections (relationships) between the search criteria and the search objects, creating an attribute (description of the relationship) and storage of the connection and its attribute. By following this approach additional connections can be made between already connected objects to exhaustively collect all possible relationships between objects. Through the use of unique identifiers the connections are made between systems located across networks.

Abstract: An intelligent system for the efficient selection and allocation of the various types of resources available in a multimedia environment. The system interrelates a combination of user input parameters with the resident hardware and software parameters of the requesting multimedia resources by grouping into common computing needs. In addition to traditionally known hardware/software parameters the system recognizes specific limitations of resources which would effect a proper multimedia presentation to the end user. The system uses an internal graph structure to interrelate the various resources as they are allocated to proved for an intelligent data flow.

Abstract: An improved apparatus and method for designing and displaying three dimensional solid representations from a two dimensional drawing. The invention prompts the user to select a two-dimensional view as a profile for extrusion. This is accomplished by selecting all the elements from a geometry to include in the extrusion. Thereafter, the user is prompted to select a front and back cutting face for the extrusion. The system thereafter transforms the selected two dimensional elements into three dimensional geometries.

Abstract: A computer server for storing and managing a digitized generic form of multiple heterogeneously formatted data objects (e.g. multi-media files). The system uniquely identifies both the generic form of the data and a description relating the stored generic form to the original formatted data. Through the management of the unique identifiers a requester need only specify an identifier to quickly access a data object regardless of platform incongruencies, particular stored format, location or addressing structure (i.e. particular file path). Once identified and located the generic data object form is transformed into a format usable by the requestor.

Abstract: A sector servo, zone bit recording disk drive includes a sector architecture in which the recording head locates and identifies data sectors without using data ID fields, but instead using information obtained from electronic storage and from servo sectors which need not be adjacent to the data sectors. The tracks contain servo information and data, but not data sector ID information. The tracks in each zone are circumferentially divided into segments. Included in each segment is a number of data regions separated from one another by servo sectors. The data regions may contain partial data sectors and complete data sectors. The format information provided to identify and locate data sectors, including ones whose region locations are not adjacent to servo sectors, includes an entry for each region in the section.