Abstract: Provided are a method, system, and program for synchronizing data. A client data record is received from a client and a determination is made of a server data record corresponding to the client data record and a stored digest generated from a previously received version of the received client data record. A current digest is computed from the received client data record. A determination is then made as to whether the computed current digest matches the stored digest. The server data record is updated with modified data from the received client data record if the computed digest and stored digest do not match.

Abstract: A data retrieval system having a database storing data as a vector that has been digitized based on a keyword. The system has capability of generating a residual vector from the data to compute a covariance matrix and an eigenvector of the covariance matrix. The system further has the capability for generating and storing a set of basic vectors from the set of the computed eigenvectors, and for reading out the data and at least one of the eigenvectors from a memory. This is utilized to compute a contribution of the eigenvector to the data, and for contracting or enlarging a residual vector to store. The system selects a keyword to be used for labeling according to a similarity between the stored basic vector and the data, and a weight on the similarity so as to store the keyword in a memory.

Abstract: A method of query pattern matching uses a chain of linked stacks to compactly represent partial results to root-to-leaf query paths, which are then composed to obtain matches for the twig pattern.

Abstract: Tagging trees are generated and used to facilitate transforming data from relational databases into hierarchical formats, such as in XML documents. Tagging trees contain both XML hierarchical structure information as well a query information that is needed to access different data sources, e.g., databases, to retrieve the information to be placed in the hierarchical structure. A designer optionally creates a mapping script that specifies the transformation from relational databases to the hierarchical format. A tagging tree is created by either parsing that mapping script or by other means. A runtime environment then processes the tagging tree by a depth first traversal. The runtime environment is able to be configured to output a hierarchical data object, such as an XML document, or pipelined to control, for example, SAX processing.

Abstract: A system, method, and computer program product that uses attribute importance (AI) to reduce the time and computation resources required to build data mining models, and which provides a corresponding reduction in the cost of data mining. Attribute importance (AI) involves a process of choosing a subset of the original predictive attributes by eliminating redundant, irrelevant or uninformative ones and identifying those predictor attributes that may be most helpful in making predictions. A new algorithm Predictor Variance is proposed and a method of selecting predictive attributes for a data mining model comprises the steps of receiving a dataset having a plurality of predictor attributes, for each predictor attribute, determining a predictive quality of the predictor attribute, selecting at least one predictor attribute based on the determined predictive quality of the predictor attribute, and building a data mining model including only the selected at least one predictor attribute.

Abstract: A data merging program causes a computer to perform a step of selecting a first cell as a starting point of merging; a step of comparing a first numerical value, which is recorded in the first cell, with a preset reference value; a step of, if the first numerical value is smaller than the reference value, calculating a total value of the first numerical value and a second numerical value recorded in a second cell adjacent to the first cell in the same column; a step of comparing the total value with the reference value and, if the total value is smaller than the reference value, setting a third cell into which the first and second cells are merged and recording the total value in the third cell; and a step of selecting the third cell as a new starting point of merging.

Abstract: Disclosed is a system and method for coordinating the backup of multiple databases and file systems in a Content Manager system. This is accomplished by “pausing” the library server to enable the desired coordinated backup of all servers, that is, the Library Servers and the Resource Servers. The coordinated backup is accomplished by both “pausing” and coordinated backup, and without interrupting a transaction which is in progress. This is accomplished by a consideration of the full CM transaction rather then just the individual elemental library server and resource manager transactions. The effect is to allow existing operations to complete, and involves “pausing” the library server to enable coordinated backup of all servers without interrupting a content management transaction which is in progress, if they complete within an interval specified by the administrator.

Abstract: The invention provides directory views for a directory server to facilitate navigating entries hierarchically without requiring physical existence of the entry in any particular place. The entries are put into the directory views hierarchy using information about the entries. Given a set of views, a user can navigate using one of the views which is most appropriate to get to the entries that are required. Search of views in a directory server can be performed by a filter rewriting process.

Abstract: A method of distributing a file from a first node to a plurality of recipient nodes comprises logically organizing a plurality of recipient nodes to which a file is to be distributed into a plurality of groups of recipient nodes. The file is distributed to the plurality of groups, wherein the distributing includes (a) partitioning the file into a plurality of subfiles, (b) distributing the plurality of subfiles from a first node to a first group, wherein at least one subfile is distributed from the first node to each recipient node of the first group but not all of the plurality of subfiles are distributed from the first node to any of the recipient nodes of the first group, and (c) the plurality of recipient nodes of the first group exchanging their respective subfiles such that each recipient node of the first group obtains all of the plurality of subfiles.

Abstract: A system includes a configuration module operable to configure a routing device to communicate with one or more network devices. Each of the network devices having device identifiers and other device data. The device data can be maintained in a database. The system also includes a command interpreter for the configuration module. The command interpreter operates to display at least a subset of the device identification data in response to detecting a completion token entered by the user.

Abstract: A method is provided to verify a database copy of a primary database which has been replicated. A secondary physically consistent copy of the primary database is put in a state of quiesce while the primary database is allowed to resume update activity. The consistent copy, in a state of quiesce, can be used for database maintenance activities or as a recovery source should the primary database be damaged, but the consistent copy is first checked for integrity by using a Verify option before such recovery source is utilized.

Abstract: An improved method and system for storage of data that represent geographic features in a region. The data are organized into parcels each of which contains data that represent those geographic features that are located within a separate one of a plurality of rectangular areas into the region is divided. The method identifies linearly extending features that extend across multiple rectangular areas so that data representing the linearly extending feature can be included in each parcel that contains data that represents a rectangular area in which the linearly extending feature extends at least in part.

Abstract: A method, computer readable medium and system are provided which retrieve confirming sentences from a sentence database in response to a query. A search engine retrieves confirming sentences from the sentence database in response to the query. IN retrieving the confirming sentences, the search engine defines indexing units based upon the query, with the indexing units including both lemma from the query and extended indexing units associated with the query. The search engine then retrieves a plurality of sentences from the sentence database using the defined indexing units as search parameters. A similarity between each of the plurality of retrieved sentences and the query is determined by the search engine, wherein each similarity is determined as a function of a linguistic weight of a term in the query. The search engine then ranks the plurality of retrieved sentences based upon the determined similarities.

Abstract: Compact multi-band antenna system (500) includes a main reflector (502) having a shaped surface of revolution about a boresight axis of the antenna operable at a plurality of frequency bands spectrally offset from each other. A multi band feed system (300) is provided for the main reflector that includes a subreflector (304) formed as a shaped surface of revolution about the boresight axis of the antenna, and a horn antenna (302). The horn antenna has one or more ridges (312) disposed in a throat region (314) of the horn antenna extending in a direction aligned with the boresight axis (3100 of the antenna. The horn antenna is coupled to the shaped surface of revolution defining the subreflector.

Abstract: The visual form of data from a computer program is received and stored in a database. The visual form of the data may be received, for example, in response to a print operation by the computer program or by some other operation such as a cut and paste sequence of operations or by sending the data to another application. The visual form of the data may be stored as a vector image that permits scalability. The visual form of the data may be stored with other identifying information or tags in the database to facilitate searching of the database. The data in the database may be encoded in a manner that ensures data integrity and that permits detection of when data has been compromised. In one embodiment, a service layer application is provided to control access to the database by performing encoding and decoding of the data in the database. The service layer may have an application programming interface that permits many applications to have access to the database.

Abstract: A data mapping management server collects data mapping information about functions for providing virtual storage regions, and provides an administrator with a management view on which the virtual storage regions created/managed in each virtual storage region providing function can be comprehensively grasped based on the collected information. The order to migrate data with the destination after mapping alteration can be accepted on interactive views. The data mapping management server produces a procedure plan for carrying out the accepted data mapping alteration order, and presents it to the administrator. The administrator decides if this plan can be carried out. If the administrator permits this plan to be carried out, the server orders each virtual storage region providing function to migrate data and create new virtual storage regions according to the produced plan.

Abstract: A method and apparatus for storage, insertion, deletion, and searching of a database index using a compact representation of a 0-complete binary tree. The compact representation, termed a C0-trie, is represented in a computer memory as a set of layered vectors with the layering of the vectors corresponding to the depths of the C0-trie. Insertion and deletion processes maintain the representation of the C0-trie remains in a well-formed and taut state at the end of each operation, thus providing subsequent efficient manipulations of the C0-trie in computer memory.

Abstract: An apparatus, program product and method integrate virus checking functionality into a computer database search environment to assist in protecting a user computer from contracting a computer virus when accessing search results. The generation of a display representation of a result set generated in response to a search request may be based at least in part upon virus status information associated with at least a portion of a plurality of result records identified in the generated result set. Moreover, an apparatus, program product, and method configure a first computer to receive virus status information generated by a plurality of computers, with such received virus status information stored in a virus database that is accessible by the first computer.

Abstract: A web-based system, method and program product are provided for adding content to a content object stored (e.g., a custom compilation or prepublished work) in a data repository as a group of hierarchically related content entities. Each noncontainer content object is preferably stored as a separate entity in the data repository. Each content entity is also stored as a row in a digital library index class as a collection of attributes and references to related content entities and containers. As the user selects desired objects for inclusion in a content object, the system arranges the objects hierarchically, e.g., into volumes, chapters and sections according to the order specified by the user. The system then creates a file object (e.g., a CBO) defining the content object that contains a list or outline of the container and noncontainer entities selected, their identifiers, order and structure. This file object is stored separately in the data repository.

Abstract: Data is captured from a web site or other data source. Data is extracted from the web page using a data harvesting script or other data acquisition routine. The extracted data is then normalized and stored in a database. If data cannot be extracted from the web page, a copy of the captured web page is stored without personal information contained in the web page. The data harvesting script is then edited based on an analysis of the captured web page.