Abstract: A computer method and system capable of searching multiple heterogeneous datastores with heterogeneous data types by employing an object oriented data model to define a federated datastore object. The federated query object translates a generic query into the appropriate queries for each datastore, the federated datastore object acts as a virtual datastore for multiple heterogeneous datastores with the ability to map concepts between datastores, and the federated collection object represents results from a federated query in a hierarchy that maintains sub-grouping information from each datastore to allow accessing of results by datastore or as a single collection of results. The federated objects thus provide user applications with enhanced accessibility of different hierarchies of information, as well as more robust search capabilities.

Abstract: Determining, prior to operation of an application program module, that a foreign file format is fully convertible to a native file format. Full conversion of the foreign file format means that a significant majority of the style and presentation of the content of the foreign file are preserved after conversion to the native file format. Prior to an attempted file conversion by the application program module, the filename extension of the foreign file is examined. If the filename extension is recognized as indicating that the foreign file is fully convertible, the application program module is commanded to access and convert the foreign file to the native file format. If the filename extension does not indicate that the foreign file is fully convertible, a determination is made as to whether the filename extension is registered in an operating system registry. If the filename extension is registered, it is considered not to a WordPerfect file and is ignored.

Abstract: A method of searching a database of three-dimensional protein structures. The method comprises the steps of setting a three-dimensional protein structure; forming a two-dimensional binary distance map based on the three-dimensional protein structure; forming a one-dimensional peripheral distribution based on the distance map; and comparing the one-dimensional peripheral distribution of a protein structure with that of another protein structure a dynamic programming algorithm. The method increases detection sensitivity and search speed.

Abstract: A system is described for monitoring information access. The system provides an access monitoring application to an information accessing system. The access monitoring application monitors information accessed by the information accessing system. Data is received from the information accessing system which identifies the information accessed by the information accessing system. The information accessing system may use a web browser application to access information stored in web pages and the access monitoring application may monitor web pages accessed by the web browser application. The system terminates the monitoring of information access if the information accessing system stops accessing information.

Abstract: A video capture system and method which includes improved software control of image acquisition and processing. The method comprises first creating an image application using one or more objects. Acquired data is preferably stored in an image object, and one or more objects, e.g., a viewer object or image processing object, are configured to share the image object, i.e., to dynamically bind to or communicate with the image object during program execution. When the application begins execution, the computer system acquires image data and stores the image data in an image object. A first object then dynamically binds to the image object, i.e., communicates with the image object, to access the image data contained in the image object and process the image data in response to the binding. This dynamic binding or communication, as well as the subsequent processing of the image data, occurs without user intervention.

Abstract: Replication tracking apparatus is described for tracking replication of data in a distributed data processing system having plural application server computer systems interconnected via a network, wherein each application server has a database application having a database and means for communicating data from the database via the network to plural client computer systems and to others of the application servers. The apparatus generates an event message on detection of an absence of database replication by the application servers.

Abstract: Predictions are based primarily upon similarities in pairs of ratings, irrespective of the actual value of the ratings. A table is used to translate each pair of ratings into rankings that are used to make predictions of future ratings. Similar ratings are ranked higher than dissimilar ratings. The prediction is based upon the average () of the books linked to the book of interest, as rated by the user, plus the difference (&dgr;) between the average rating of the book of interest, as rated by all users, and the average ratings of the linked books, as rated by the user. The averages may be weighted by the rankings. Alternatively, the prediction is based upon the cumulative values applied to books linked to the books rated by the user, where the values are based upon the user's ratings of the rated books.

Abstract: A system and method for processing, searching, and performing in-context searches on named annotated text string databases. The system and method provides users with a means for interactively refining database searches in order to account for differences in keywords used to describe similar phenomena. The system and method provides a means for performing searches for particular predefined target strings in context of particular predefined context strings. Data is represented using data types referred to as Hits and E-Hits. Hits data contains locations of search results and the E-Hits data contains text of search results. Hits lists are sorted and duplicate entries are discarded. Context search results are segregated from non-context search results by sorting the Hits lists. The Search module operates on a Hits list and selects those elements that match one or more search key(s). The output from a Search module is a Results Hits list.

Abstract: A method, apparatus, and product for leasing a delegation certificate in a distributed processing system is provided. Consistent with this method, apparatus, and product, a delegatee requests from a delegator access to a resource for a period of time that the delegator has authority to access. Responsive to this request, the delegator determines an appropriate lease period during which time the delegatee has authority to access to the resource.

Abstract: This invention uses a computer program to mine preexisting operator services configuration data located in a variety of preexisting source operator services configuration databases. The computer program either creates a new operator services configuration database from parts of existing operator services configuration databases or modifies an existing operator services configuration database. The computer program replaces the current system's reliance upon manual data entry by data engineers to configure the operation of a new telecommunication switch or replace the software in a telecommunication switch that was damaged or requires a new operator services configuration data configuration.

Abstract: A method, apparatus, and article of manufacture for a computer implemented database interpreter. A main window is displayed that provides selection of subsystem parameter browsing. When subsystem parameter browsing is selected, subsystem parameters are extracted from the database. Next, access to the extracted subsystem parameters is provided within a subsystem parameters window. Additionally, the computer can be a workstation that is connected to a mainframe storing the database. The main window is displayed providing selection of graphical plan representation at the workstation. When graphical plan representation is selected, at the workstation, plan table data is extracted from the database at the mainframe. Next, a graphical representation of the plan table data is displayed at the workstation.

Abstract: A system, method, and apparatus is provided for computerized management of a method of corporate, business or sports management by a remote party comprising relating a current database of an entity. For instance, in sports management substantially real time management is possible. Data of a player together with a historical database related to that player and decisions can be transmitted. This is communicated between a central database processing resource and at least one remote party. A remote party is permitted to access the database and access designated data from the database, and input and output data. Voting and other management of the player, team, or business is possible in substantially real time or near real time by the remote party. A remote user can vote on financial compensation for a player, a coach or a team and/or for a bonus for a player, team or game. Similarly hiring and firing decisions can be made.

Abstract: A computer-implemented method and computer program product for comparing two data files to find matching data. The comparisons can be between dates, monetary units, or any other quantities. Comparisons are handled between files which differ by any predetermined function such as additive or multiplicative without using file wide delimiters, field boundary or field format information. An example of such a comparison are the additive differences resulting from aging files in a Year 2000 compliance testing method. The method can thus be used to test whether an effort to remediate a Year 2000 problem in a computer program was successful. Another example of such comparisons are the differences resulting from conversion between the monetary units of two countries or regions. The method can thus also be used to verify currency conversions.

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: A system and method selects rows from a fact table in a dimensional database containing a fact table, a time dimension table and other dimension tables. The other dimension tables each contain rows containing a time invariant attribute to identify an item described by the row, an effective time attribute for the row, and other attributes. If an attribute for an item changes, a new row is added to the dimension table containing the time-invariant attribute for the item and current attributes for the item, without deleting or overwriting any existing rows for that item. Such dimension tables can be selected or used to create other tables using one or more time attributes of the dimension tables. The tables created can be selected or used to create still other tables using one or more time attributes of those tables.

Abstract: A computer method and system capable of searching multiple heterogeneous datastores with heterogeneous data types by employing an object oriented data model to define a federated query object, a federated collection object and a federated datastore object. The federated query object translates a generic query into the appropriate queries for each datastore, the federated datastore object acts as a virtual datastore for multiple heterogeneous datastores with the ability to map concepts between datastores, and the federated collection object represents results from a federated query in a hierarchy that maintains sub-grouping information from each datastore to allow accessing of results by datastore or as a single collection of results. The federated objects thus provide user applications with enhanced accessibility of different hierarchies of information, as well as more robust search capabilities.

Abstract: AIN services include multiple SCP pairs, which can be expanded to meet increased demand. The expansion can occur without cessation in services by migrating records between SCP pairs while maintaining redundancy between the pairs. A centralized GTT maintains the GTTs distributed between multiple subsystems in the AIN system. Synchronization between mate SCPs within a pair occurs at high speed as the subscriber database is split into multiple files, each file having a separate synchronization process.

Abstract: A method and system identify in a database one or more data entries that are the nearest neighbors of a query. The database prebuilds a first set of strings by probabilistically selecting values of respective bits in each of the first set of strings based on a probability that depends on a first hamming distance. Based on the first set of strings, the database predetermines the trace values of each data entry in the database, respectively, and stores the predetermined trace values as entries in a trace table. For each trace value entry, the database identifies the data entries whose trace values are within a second hamming distance of the trace value entry, and stores the addresses of the identified data entries in the trace value entry. When the database receives a query, by identifying the trace value entry in the trace table that match the trace value of the query, the database identifies the data entries that are within the first hamming distance of the query.

Abstract: A system for presenting hypermedia link information. A computer-implemented method for presenting hypermedia link information is described which relates to the user the characteristics of a data file pointed to by the hypermedia link. The computer system waits for an event to occur. This event is the user or system selecting one or more hypermedia links. The hypermedia link in this scenario points to a data file about which information is to be gathered. The computer system then requests information about the data file. Finally, an auditory cue is generated to communicate information about said data file to a user. Alternatively, this information may be conveyed to the user by visual means, such as a pop-up information box on the user's display. A powerful and convenient system for browsing hypermedia information is thus provided.

Abstract: An electronic mail (e-mail) search folder device utilizing an easily configurable search system that allows the user to associate attributes to a folder and will automatically search and organize the user's e-mail messages. Search attributes that are specified by the user are associated with a file folder by the invention. Search strings and properties, the frequency of the search, and the scope of the search are designated by the user. The invention waits for the specified interval or event condition to become true and performs the search across the folders and objects specified by the user. The invention inserts pointers to the e-mail messages that were found to match the search criteria into the search folder which is always available to the user.