Abstract: Methods and apparatus for providing access in an event detection and tracking system are disclosed, where the event detection and tracking system is adapted for storing data associated with a plurality of detected events. An access request for access to at least a portion of data associated with one of the plurality of detected events is received and access information associated with the access request is obtained. It is then determined from the access information whether to provide access to at least a portion of the data associated with one of the plurality of detected events. When it is determined from the access information that access to at least a portion of the data is to be provided, access is provided in accordance with the access information.

Abstract: A computerized process of intelligently inventorying data and managing assets includes the steps of initially inventorying a plurality of hardware, software, and data files on-site by assigning a hexadecimal signature identifying each file in the database, inventorying the files at a subsequent time by repeating the prior step and comparing the previous and current signatures of the files to determine whether any of the files have been changed, comparing the current version of a changed file to the last previous on-site version of the changed file, computing the differences between the two versions by different forward and reverse algorithms to provide a forward delta and a reverse delta, storing the current version and the reverse delta of the changed file on-site while deleting the last previous on-site version of the changed file, permanently storing off-site the forward deltas of each changed file and a baseline copy of each new file, restoring any requested file, if on-site, by recovering the current ver

Abstract: A method and apparatus disclosed may be implemented in a digital computer to query a set of arbitrarily structured records. Arbitrarily structured records are structured differently from each other. A query engine, query structure, operators of conventional and non-conventional types may be used in formulating a query. The apparatus may evaluate records having missing fields, repeating fields, or an UNKNOWN value arising from a missing field, division by zero, modulo by zero, or the like. New aggregator (e.g. universal quantifier and existential quantifier) and selector operators (e.g., first, last, nth) may distill multiple values to return a single value. To evaluate a query, the search engine may implement filtered indices, alternate-key indices, compound alternate-key indices, hybrid queries having both full-text and non-full text operands, and joinder of records.

Abstract: A system and method which enforces integrity in the construction of component Plans, such Plans defined as being composed of one or more unique Strategies. The Strategies in turn are defined as being composed of one or more unique Objectives each and these Objectives in turn are defined as being composed of one or more unique Alternatives. The rules of uniqueness are enforced by the system and method which is designed to lead users intuitively through the construction of such Plans thus furthering the integrity of the Plans constructed through the system by virtue of the way the system organizes Plans and their components as its users proceed to utilize it The system offers a menu of activities associated with the tasks of constructing said Plans and their underlying components.

Abstract: A system and method is shown for enabling a plurality of computers and associated computer resources, some or all of which may be of heterogeneous configuration, to cooperatively process various applications such that the execution is transparent to the user regardless of where the application is actually executing. This distributed applications architecture performs an information distribution service between multiple transaction processing systems by working with a transaction processor via communication channels to other hosts within the network and a dialog manager which uses a transaction processor interface to communicate with the transaction processor. The architecture employs a map service which provides an editor to create the maps for the application panels, a compiler to generate the maps into a linkable form, and a linkable interpreter which translates the linkable form into the screen presentation format for that platform.

Abstract: A Japanese character processing system containing a roman character keyboard containing a plurality of keys arranged in one or more rows. A first set of roman character consonants is provided in one row, a second set of roman character consonants is provided in a second row, and a set of roman character vowels is provided in a third row. The processing system converts a valid consonant-vowel combination into a corresponding Japanese character upon the entry of a valid consonant vowel combination and displays the Japanese character on a display device coupled to the processing system.

Abstract: The present invention comprises a novel system for managing changes to a graph of data bearing objects. In one embodiment, an object graph manager object referred to as an editing context is used to identify changes made to data bearing enterprise objects and to notify other interested objects when changes occur. As a result, data bearing objects need not themselves contain code necessary for monitoring changes. In another embodiment of the invention, the editing context is used to provide event-based "undo" capabilities. In another embodiment of the invention, each enterprise object has a primary key that is used to maintain the identification between an enterprise object instance and a corresponding database row. In another embodiment of the invention, multiple levels of editing contexts are used to provide multiple isolated object graphs, each of which allows independent manipulation of the underlying data bearing objects.

Abstract: This invention concerns a database computer system and method for making applications recoverable from system crashes. The application state (i.e., address space) is treated as a single object which can be atomically flushed in a manner akin to flushing individual pages in database recovery techniques. To enable this monolithic treatment of the application, executions performed by the application are mapped to logical loggable operations which can be posted to the stable log. Any modifications to the application state are accumulated and the application state is periodically flushed to stable storage using an atomic procedure. The application recovery integrates with database recovery, and effectively eliminates or at least substantially reduces the need for check pointing applications. In addition, optimization techniques are described to make the read, write, and recovery phases more efficient.

Abstract: The present invention is a method and an apparatus for searching a personal digital assistant (PDA) data base utilizing a search criteria and displaying the result so that the user can determine whether the search yielded the intended result, whether the search needs to be refined, or whether the outcome should be used to initiate an electronic communication such as a telephone call. After successfully obtaining the specific name and recipient information, such as a telephone number, telefax number, numbers for an Internet server and related E-mail address, the numbers may be applied to a telephone for establishing a PSTN or telephone connection. Thereafter the PDA, utilizing the telephone unit links the user to a line or employs data transmission capabilities of a wireless network to send telefaxes, short messages, E-mail and to connect with remote computers. Using a keyboard the user can store data in a data base, alter the data base and input search criteria.

Abstract: When a data manipulation language execution unit (120) executes a data manipulation routine, an object manipulation unit (150) requests a database access unit (170) to make the database access unit retrieve an object in order to obtain the object from a database (180). The object manipulation unit registers the object in an object descriptor table (160) and supplies the object to the data manipulation language execution unit. The data manipulation language execution unit accesses the object in accordance with an object descriptor and an attribute name. The object manipulation unit fetches the object designated with the descriptor from the object descriptor table. The object manipulation unit supplies object to an attribute extraction unit (140). The attribute extraction unit fetches an attribute in accordance with the object.

Abstract: A method and apparatus for retrieving similar or identical textual passages among different documents is disclosed. Normal discourse structures along with textual content attributes are used to encode a known passage with "marker sequences" that give a characterizing "signature" to the passage. The encoded known passage is then evaluated against similarly encoded passages appearing in a database of documents. If it is determined that there is a possible match between the encoded known passage and an encoded passage in a database document, a sequential string search is performed to determine whether the two passages are likely to be similar or identical. If the sequential string search records a probable match between the known passage and the database passage, the database passage is displayed for further review.

Abstract: A method and system are provided for processing a hypertext markup language (HTML) source file stored in a server processor. The processing is performed by a browser program in a client processor. The server processor and client may communicate with each other across a communications network, which may be the Internet. The HTML source file may define a web page in the worldwide web. The browser, in the client processor, processes the source file to generate an output display. A region within the output display is selected using a pointing device, such as a mouse, track ball, or the like. The region includes less than the whole output display. The region includes information, which may include text, a list, a table, or a graphic. Information that is displayed within the region is identified by the client processor. The client processor identifies a portion of the source file from which the information displayed within the region is generated. The portion is less than the whole source file.

Abstract: An extensible digital library is comprised of a library server and an object server. The library server stores tables describing the digital library, wherein it uses a relational database server to manage the storage of the tables describing the digital library. The object server stores objects referenced by the tables describing the digital library. Two application programming interfaces (APIs) are provided. A first API is coupled to the library server and the object server and provides functions for accessing the stored tables and the stored objects via the library server and the object server. A second API is coupled to the first API and the relational database server and provides functions for accessing the stored tables via the relational database server.

Abstract: A method and apparatus for performing client-sensitive DNS translations includes the steps of receiving a translation request by a DNS server. The DNS server examines the translation request to determine if a record exists within the DNS server that associates the symbolic name included in the translation request with an IP record. If such a record exists, the IP address is returned as the translation. If not, the DNS server determines whether reflective client-sensitive translation is required. In the affirmative case, the request is reflected to back to the client where client-sensitive translation is performed and returned to the DNS server. If client-sensitive translation is not required, the DNS server determines whether non-reflective client-sensitive translation is required. If so, the requested translation is forwarded to a special DNS server, along with information that identifies the client system requesting translation.

Abstract: The invention disclosed herein is implemented in a repository which stores metadata relating to data stored in one or more databases. The repository includes a repository database in which the metadata is stored, one or more scanners each of which scans at least one database and obtains metadata therefrom, and one or more loaders each of which loads metadata obtained by at least one scanner into the repository database in accordance with the externalized reuse criteria. According to the invention, metadata stored in the repository is reused, for example, not replaced by identical metadata when the repository is updated or populated, and the criteria governing reuse is externalized, i.e., accessible and modifiable by a repository user. The reuse criteria accessible to repository users is stored separate from repository program code at a non-programming level such that the customer (user) can change the reuse procedures without an experienced programmer.

Abstract: A Japanese character processing system containing an on-screen keyboard which includes an array of base Japanese kana characters of a first kana character set. The first selection of a character key causes the display of the character in base kana form. A second consecutive selection of the same key causes the display of the character in a first variant form. Subsequent consecutive selections of the character cause the display of the character in further variant forms. Variant forms may include voiced, aspirated, or subscripted versions of the base character. A further variant form may include the display of the character in an alternate kana character set.

Abstract: In an object environment, among the plurality of objects interact, one or several objects in the number of objects are allocated to a component. The naming management is distributed over the components. Each component manages the naming of the component or components which immediately follows it.

Abstract: A service provider registers information of some documents, including an identifier of each document and a bibliographic item constituting the document content, in a storage section in a database section and determines classifications to which these documents should belong to further register identifiers of these documents to the classification items in the storage section. A calculation section calculates a distinction quantity of each classification item by consulting the bibliographic item of the classified document in the database section. Another calculation section calculates a distinction quantity of an unclassified document in the database section, and a decision section determines and classifies a classification item to which the unclassified document should belong based on a result of the calculation and the distinction quantity of each classification item.

Abstract: A method is provided of accessing a database comprising a plurality of entries, each entry comprising a main entry containing a headword. At least one of the entries comprises a first subsidiary entry (2) containing a plurality of sets of words, each of which is capable of being associated with the headword. The method comprises the steps of: entering a section of text which comprises a plurality of words; locating the entry whose main entry contains the headword corresponding to a selected word of the section of text; and, where the located entry has a first subsidiary entry containing a plurality of sets of words, selecting from the first subsidiary entry a set of words of which at least one word is present in at least part of the section of text.

Abstract: A method and system are disclosed for performing spatial similarity joins on high-dimensional points that represent data objects of a database. The method comprises the steps of: generating a data structure based on the similarity distance .epsilon. for organizing the high-dimensional points, traversing the data structure to select pairs of leaf nodes from which the high-dimensional points are joined, and joining the points from selected pairs of nodes according to a joining condition based on the similarity distance .epsilon.. An efficient data structure referred to as an .epsilon.-K-D-B tree is disclosed to provide fast access to the high-dimensional points and to minimize system storage requirements. The invention provides algorithms for generating the .epsilon.-K-D-B tree using biased splitting to minimize the number of nodes to be examined during join operations. The traversing step includes joining selected pairs of nodes and also self-joining selected nodes.