Abstract: A process for maintaining ongoing registration for pages on a given search engine is disclosed. It is a method to actively cause an updating of a specific Internet search engine database regarding a particular WWW resource. The updated information can encompass changed, added, or deleted content of a specific WWW site. The process comprises the steps of having software tools at a local WWW site manually and/or automatically keep an index of added, changed, or deleted content to a particular WWW site since that WWW site was last indexed by a specific Internet search engine. The software tools will notify a specific Internet search engine of the URLs of specific WWW site resources that have been added, changed, or deleted. The Internet search engine will process the list of indices of changes, additions or deletions provided by a web site, or add the URL of resources that require indexing or re-indexing to a database and visit the WWW site to index added or re-index changed content when possible.

Abstract: A method is provided for inventory management which includes an initial step of receiving a customer request for an inventory item and then generating a table or menu of one or more inventory items that most closely correspond to the customer request using a price forecasting system. Based on negotiations concerning price, timing and other typical concerns, an item is selected from the table and a price quotation associated with the selected inventory item is generated using the price forecasting system, which price quotation has been predetermined by a yield management system using a pricing strategy. The customer information associated with the customer request is input into a traffic billing system. Information needed for price recalculation associated with the customer request is input into the yield management system.

Abstract: A hyper text reading system which assures an advantage by protecting the right of a contents provider. A link source confirmation unit confirms a link source of an anchor included in a hyper text. The link source is provided between a WWW browser and a helper application, thereby enabling contents data to be referred from only the anchor included in the hyper text prepared by the contents provider.

Abstract: A method and system for commanding and controlling diverse home devices connected to a home network is provided. According to the method, sequences of commands which are used to control a home device are stored as a macro to control the home device. A sequence of commands, used to control a plurality of home devices in tandem, is stored as a macro. The invention provides the user a capability of operating a single button to implement a sequence of control commands from within a HTML page contained on the respective home devices being controlled.

Abstract: A system that uses an object to relational database mapping infrastructure to map C++ objects and their relationships to and from a relational database. The mapping is facilitated by mapping files which describe an object and how the object corresponds to a table in the database. Overflow tables are provided in the database when an object is associated with more than a predetermined number of other objects, such as two. A C++ reflection layer allows access to attributes and methods of C++ objects at run-time by name. Mapped data is also memory buffered during the transferring of data to and from the database.

Abstract: A method and system for providing dynamic run-time object definition in a relational database. A mediating layer is introduced between applications and database objects. This layer mediates access to the physical database objects, such as tables, and allows applications to embed logical instead of physical names. If desired, the mediating layer can be maintained dynamically, as applications are running. The mediating layer preferably can run on a variety of relational databases, overcoming the vendor-specific extensions to SQL that relational database vendors have introduced.

Abstract: A method of controlling how a Web document is presented for display on a browser of a Web appliance. The Web appliance typically includes a television class monitor associated therewith. The Web document typically is formatted according to a markup language such as HTML. The method uses a client side HTTP caching proxy to intercept the Web document and then dynamically rewrite the document before it is displayed on the browser of the Web appliance. In particular, as the Web document is received from the server, the HTML is parsed to identify the format of the document and the information therein. A filter mechanism is then used to reformat the Web document according to some given protocol, and the re-formatted Web document is then passed to the browser for display on the monitor. Dynamic alteration of the HTML in this manner enables control of the “look and feel” of the browser display irrespective of the monitor resolution and/or quality.

Abstract: A technique for searching in a source sequence for a target sequence using parallel processing.

Abstract: The present invention relates to a system for providing a communication network, comprising: an intranet-connected server having input and access capabilities; a means on the server for receiving instructions input from a first user and for creating a dedicated intranet site based on the received instructions; means to communicate existence of the dedicated intranet site to a nominated second user; means to access contents of the dedicated intranet site by the second user via a web-browser installed on the second user; and means to store information in the dedicated intranet site input via a web-browser installed at the first or the second user.

Abstract: A computer system stores biomolecular data in a database in a memory. The biomolecular database has a set of entities. Each entity stores attributes for a plurality of entries. At least one attribute is stored in an array. Data associated with an entry is stored at a location in the array. An entity offset designates the location of the data in the array. The same entity offset value is used to access data associated with a particular entry for all attributes within the entity.

Abstract: A system that provides for the graphic visualization of the categories of a collection of records. The graphic visualization is referred to as “category graph.” The system optionally displays the category graph as a “similarity graph” or a “hierarchical map.” When displaying a category graph, the system displays a graphic representation of each category. The system displays the category graph as a similarity graph or a hierarchical map in a way that visually illustrates the similarity between categories. The display of a category graph allows a data analyst to better understand the similarity and dissimilarity between categories. A similarity graph includes a node for each category and an arc connecting nodes representing categories whose similarity is above a threshold. A hierarchical map is a tree structure that includes a node for each base category along with nodes representing combinations of similar categories.

Abstract: A coarse database index, and system and method of use therefor, that will quickly indicate which data partitions of a table contain a given key. Once the target data partitions are located, the exact record locations can be found using traditional indexes. The coarse indexes take little space, can be updated quickly, and searched quickly. The coarse index is in conjunction with a database including a plurality of data partitions. Each data partition includes data, including a plurality of key values of at least one key, and at least one dense index referencing the data. The coarse index indexing the plurality of key values according to data partitions containing each key value. The coarse index includes a first bitmap, which is preferably arranged in key value major format. The coarse index may also include a second bitmap, which is preferably arranged in data partition major format. The second bitmap may be transformed from data partition major format to key value major format.

Abstract: A system is provided for selecting an appropriate aggregated fact data table to use as the basis for calculating an aggregation request from a set of stored aggregated fact data tables. An estimate is established of the amount of processing time required to aggregate each of the tables. The table with the lowest estimate is then used to perform the aggregation.

Abstract: View space representation data is produced in real time from a world space database representing terrain features. The world space database is first preprocessed. A database is formed having one element for each spatial region corresponding to a finest selected level of detail. A multiresolution database is then formed by merging elements and a strict error metric is computed for each element at each level of detail that is independent of parameters defining the view space. The multiresolution database and associated strict error metrics are then processed in real time for real time frame representations. View parameters for a view volume comprising a view location and field of view are selected. The error metric with the view parameters is converted to a view-dependent error metric. Elements with the coarsest resolution are chosen for an initial representation. Data set first elements from the initial representation data set are selected that are at least partially within the view volume.

Abstract: A method and apparatus for compressing data is provided. The invention compresses an input bit stream into a compressed output bit stream. The input bit streams are byte aligned and classified. Bytes with all bits set to value zero are classified as gap bytes. Bytes with only one bit set to value one are classified as offset bytes. All other bytes are classified as map bytes. Groups of adjacent bytes are organized into two types of groups. The first type is a gap bit group. A gap map group contains gap bytes and one offset byte. The second type is the gap map group. It contains gap bytes and map bytes. The number of gap bytes in a group is called a gap size. The groups are compressed into four types of atoms. Each type of atom has one control byte, zero or more gap size bytes, and zero or map bytes. A control byte describes the atom. The map bytes in an atom are copies of the map bytes in the control group.

Abstract: Apparatus, methods and computer program products are disclosed for archiving a hypertext document that contains a hyperlink definition. Archiving is the process of rendering a hypertext document for storage in a noninteractive form (for example, printing a copy of the hypertext document). The archival copy of the hypertext document presents the reader with a URL, contained in the hyperlink definition, as an embedded note, a footnote, or an endnote. Thus a reader of the archived hypertext document knows the URL associated with the hyperlink definition.

Abstract: A database management system ensures consistency between primary and mirrored backup copies of a database, despite occurrence of a suspending condition interrupting the normal process of mirroring the primary database. One or more primary controllers are provided, each having a data storage unit with multiple primary data storage devices. Multiple secondary controllers each have multiple associated secondary data storage devices, each secondary controller being coupled to one primary controller. One or more primary databases reside on the primary devices, with a corresponding number of secondary databases residing on the secondary devices. Each secondary database mirrors a corresponding primary database. Either a host, attached to a primary controller, or one of the primary controllers itself, maintains a map cross-referencing each primary and secondary database with the primary and secondary devices containing portions thereof.

Abstract: A system and method for answering a relational database query is presented. According to an embodiment of the present invention, a database query is received. It is then determined whether that query can be rewritten in such a manner as to be able to utilize a precomputed view, such that an answer to the rewritten query is equivalent to an answer to the original query. If the query can be rewritten, it is determined whether the rewritten query can more efficiently derive the answer than the original query. The query which has the most efficiently derived answer is the query which is utilized to derive that answer.

Abstract: A system and method for automatically generating personalized user profiles and for utilizing the generated profiles to perform adaptive Internet or computer data searches is provided. In accordance with the present invention, particular linguistic patterns and their frequency of recurrence are extracted from personal texts provided by the users of the system of the present invention and stored in a user profile data file such that the user profile data file is representative of the user's overall linguistic patterns and the frequencies of recurrence thereof. All documents in a remote computer system, such as the Internet, are likewise analyzed and their linguistic patterns and pattern frequencies are also extracted and stored in corresponding document profiles. When a search for particular data is initiated by the user, linguistic patterns are also extracted from a search string provided by the user into a search profile.

Abstract: A system and method for controlling the conversion of a file from an input format to an output format is provided. The method includes a computer-implemented method for controlling the conversion of a computer file from an input format to an output format by determining the best path for converting the file from the input format to the output format using family objects. The method includes the steps of receiving the input format and the output format, and generating a node in memory for each family object that can read the input format. The method further includes the step of generating successful branches of nodes in memory that include one or more nodes such that each successful branch includes a first node that can read the input format and a last node that can write the output format. Finally, the method includes calculating a best path through the successful branches of nodes.