Abstract: A system (10) for generating dependent data (132) includes a database (16) having at least a first dimension (50, 70, 122). The database (16) contains a mapping (106) comprising a source member (54) in the first dimension (50, 70, 122) and a target member (54) in the first dimension (50, 70, 122). The database (16) also contains an attach rate (120) that relates independent data (112) associated with the source member (54) to dependent data (132) associated with the target member (54). A server (12) coupled to the database (16) accesses the mapping (106) and applies the attach rate (120) to the independent data (112) for the source member (54) to generate the dependent data (132) for the target member (54).

Abstract: A user of an information network is provided with information contained within at least one of plurality of network sites in view of a user search criteria by searching a database that is populated with a plurality of other search criteria provided by other network users and a plurality of search strategies. Each of the search strategies includes information regarding network sites likely to contain information relevant to the other search criteria. The other search criteria within the database are linked with the search strategies. At least one search strategy is selected from the database based upon the user's search criteria. The search strategy is executed and the results are provided to the user in one embodiment, users can employ software agents to assist in searching, collecting, and reporting on data in accordance with the user's specified criteria.

Abstract: This invention provides methods by which biologically derived DNA sequences in a mixed sample or in an arrayed single sequence clone can be determined and classified without sequencing. The methods make use of information on the presence of carefully chosen target subsequences, typically of length from 4 to 8 base pairs, and preferably the length between target subsequences in a sample DNA sequence together with DNA sequence databases containing lists of sequences likely to be present in the sample to determine a sample sequence. The preferred method uses restriction endonucleases to recognize target subsequences and cut the sample sequence. Then carefully chosen recognition moieties are ligated to the cut fragments, the fragments amplified, and the experimental observation made. Polymerase chain reaction (PCR) is the preferred method of amplification.

Abstract: Techniques are provided for executing distinct aggregation operations in a manner that is more scalable and efficient than prior techniques. A three-stage technique is provided to parallelize aggregation operations that involve both grouping and multiple distinct-key columns. Such queries are handled by splitting rows into as many pieces as there are distinct aggregates in the query, and processing the row pieces. During the first-stage, a set of slave processes scans the rows of the base tables and performs partial duplicate elimination. During the second-stage, a set of slave processes completes the duplicate elimination and performs partial set function aggregation. During the third-stage, a third set of slave processes completes the set aggregation to produce the results of the distinct aggregation operation.

Abstract: A data processing system provided with a CPU for reading at units of 32 bits per read cycle, a font card that requires read accesses of either 16 or 8 bits per cycle by accessing a specific address area, and an address specifying control circuit positioned between the CPU and font card. When accessing the specific address area, the CPU provides information on the data width for access and the low-order portion of the address to the address specifying control circuit. Based on this data, the address specifying control circuit outputs the low-order portion of the address to the font card for accessing the font card at the prescribed unit of bits, regardless of the address data output from the CPU. For example, when performing a 16 bit read, the second to lowest order bit (ADR01) is set to 0 in the first read cycle, and the low-order 16 bits of data is considered valid. In the second read cycle, ADR01 is set to 1, and the high-order 16 bits of data is considered valid.

Abstract: According to the preferred embodiments of the present invention, an apparatus and method for a digital filing system is disclosed. In this context, digital filing refers to the efficient management of paper-based information from its receipt at the desktop through an indexing, scanning, image storage, and image retrieval process. The preferred embodiments of the present invention provide for easy and effective indexing, imaging, storing, retrieving and managing of paper-based documents, transforming them into electronic documents using a system which incorporates many existing office resources. The proposed system and method implements a desktop solution for digital filing, which can be made available to each worker. Uniquely, the digital filing system of the present invention also allows users to index and label documents prior to scanning/imaging by using either a dedicated desktop labeling mechanism or pre-printed labels.

Abstract: The present invention relates to a method of delaying space allocation for parallel copying garbage collection in a data processing system comprising a memory divided in a current area (from-space) used by at least a program thread during current program execution and reserve area (to-space), and wherein a copying garbage collection is run in parallel by several collector threads, the garbage collection consisting in stopping the program threads and flipping the roles of the current area and reserved area before copying into the reserved area the live objects stored in the current area.

Abstract: A system for maintaining an object repository within an object management system where the objects are software constructs and the system provides a set of tools for creating packages of the objects that can be reused as well as monitored as they are changed or recombined. The packages themselves become new objects for the repository to store. The set of relationships within a package is also stored as are any relationships between any of the objects within the object management system object repository.

Abstract: A database server with a “shared nothing” system architecture has multiple nodes, each having its own central processing unit, primary and secondary memory for storing database tables and other data structures, and communication channels for communication with other ones of the nodes. The nodes are divided into at least two groups that share no resources, including power supply and cooling system. Each database table in the system is divided into fragments distributed for storage purposes over all the nodes in the system. To ensure continued data availability after a node failure, a “primary replica” and a “standby replica” of each fragment are each stored on nodes in different ones of the groups. Database transactions are performed using the primary fragment replicas, and the standby replicas are updated using transaction log records.

Abstract: A method and system for creating an interactive virtual community of famous people, or those people who wish to attain the status of a famous person, in a field of endeavor, such as arts, accounting, animal rights, business, education, engineering, entertainment, financing, government affairs, human rights, legal, medical, philanthropy, politics, religion, research, science, sports, etc. The virtual community of the present invention is unique in that the members of the virtual community can update, modify or revise their individual profile, and interact with other members of the virtual community, as well as the non-members of the virtual community.

Abstract: A system for correlating crime incidents with the location of a subject in which crime incident data containing information about the location and time of at least one crime and subject location data containing information about the locations at various times of a plurality of subjects are provided to a correlation database of a computer, whereupon the correlation computer correlates the crime incident data and the subject location data to determine if each of said subjects are likely suspects of said crime based upon whether each of the subjects were proximate to the location of the crime at the time of the crime.

Abstract: A system is disclosed that facilitates web-based information retrieval and display system. A wireless phone or similar hand-held wireless device with Internet Protocol capability is combined with other peripherals to provide a portable portal into the Internet. The wireless device prompts a user to input information of interest to the user. This information is transmitted a query to a service routine (running on a Web server). The service routine then queries the Web to find price, shipping and availability information from various Web suppliers. This information is then available for use by application programs such as wordprocessors, e-mail, accounting, graphical editors and other user tools. The system provides an innovative collaborative interface to many popular user applications that are useful in a mobile environment.

Abstract: A method for dynamically obtaining a unified classification information graph which provides a navigation system for a user to access sought information. The method includes providing a multiple information resources that include hierarchy of categories that are associated, each, with a category. Leaf categories in the hierarchy are connected to information pages. The method filter provides generating a unified classification information graph by using the hierarchy of categories and the categories of the multiple information resources. The unified classification graph includes hierarchy of unified categories. Leaf unified categories in the hierarchy are connected to inflation pages, whereby, information pages accessible through the hierarchy of the multiple information resources are also accessible through the hierarchy of the unified classification information graph.

Abstract: A method of searching one or more ligand-candidate compounds to a target biopolymer from a three-dimensional structure database, which comprises the steps of: (i) the first step of assigning hydrogen-bonding category numbers, information for calculating force-field energy, and information for generating conformations to two or more trial compounds in addition to atomic three-dimensional coordinates thereof; (ii) the second step of preparing physicochemical information about a ligand-binding region and one or more dummy atoms based on the three-dimensional atomic coordinates of the target biopolymer;(iii) the third step of estimating the most stable docking structure, wherein said step further comprises the steps of examining possible docking structures by docking a trial compound to the biopolymer while varying conformations of the trial compound, evaluating interaction energies between the target biopolymer and the trial compound, and repeating structure optimization; (iv) the fourth step of deciding whether

Abstract: A transaction processing system that continues to process incoming transactions during the failure and recovery of either of two duplicate databases. One of the two duplicate databases is assigned “active” status and the other is maintained with “redundant” status. All incoming queries are sent only to the active database and all incoming updates are sent to both active and redundant databases. When one database fails, the other is immediately reassigned active status if not already active and continues to process incoming queries and updates during the failure. When the failed database is repaired and restarted, all records are flushed therefrom and the failed database is reconstructed using interleaved copy and update operations in a single pass through the active database. Incoming transaction and copy operations are interleaved according to a queue thresholding method for throttling copy operations responsive to increased numbers of incoming transactions.

Abstract: In a novel approach for retrieving information a set of sub-documents first is established based upon a set of documents. A query is processed which operates on the set of sub-documents, causing a score to be generated for each sub-document. The score for each sub-document is indicative of the relevance of the corresponding sub-document to the query. The scores are reviewed and the best sub-document is retrieved. According to one aspect of the invention, the best sub-document has a score that indicates the highest relevance between the sub-document and the query. According to another aspect of the invention, in response to a user selection, the next best sub-document is identified and retrieved. The sub-documents are also presented to the user in an order based upon the scores. According to another aspect of the invention, the document containing the sub-document having the best score is displayed and automatically scrolled to the location of the sub-document having the best score.

Abstract: An apparatus for and method of utilizing an internet terminal coupled to the world wide web to access an existing proprietary data base management system having a dialog-based request format. The user is permitted to access an HTML template within the internet terminal. Entry of data into the HTML template provides for definition of a dialog-base request in the command language of the existing proprietary data base management system. The request is received by a web server from the world wide web. The data base management commands are sequentially presented to the data base management system and the intermediate products stored. After all of the sequenced data base management commands have been executed, the web server combines the intermediate products to form a complete response to the initial user request. The response is transferred to the user over the world wide web.

Abstract: A method of using a binary tree data structure to represent a time-varying variable, and to solve queries about the variable. The tree is especially useful for solving “find” type queries, such as “What is the earliest/latest time when a minimum of y units are on hand?” This type of query can be solved with a efficiency of O(log n), where n is the number of nodes of the tree.

Abstract: An apparatus for and method of utilizing an internet terminal coupled to the world wide web to execute batch processed accesses to an existing proprietary data base management system having a dialog-based request format. The user request is received by a web server from the world wide web and converted into one or more sequenced data base management commands. These data base management commands are scheduled for execution by a monitoring program and the sequenced data base management commands sequentially presented to the data base management system and the intermediate products stored. After all of the sequenced data base management commands have been executed, the web server combines the intermediate products to form a complete response. The response is transferred to the user, if appropriate, over the world wide web.

Abstract: A design and implementation of a client/server framework for federated multi-search and update across heterogeneous datastores. In particular, a technique for manipulating data in one or more heterogeneous datastores at a computer is provided. An object-oriented model is provided for integrating one or more heterogeneous datastores with a federated datastore. One or more heterogeneous datastores and a federated datastore are generated based on the object-oriented model. The generated datastores are organized into a federated composition.