Abstract: Systems and methods for classifying structured vocabulary where an input is received that includes one or more terms. The one or more terms relate to an area of technology. Each one or more terms are identified and extracted from the input. The results of the extraction may be reviewed, and manually modified if appropriate. Each extracted one or more terms are classified where the classification associates a classified term to each extracted one or more terms. Each classified term is related to the area of technology. The results of the classification may be reviewed, and manually modified if appropriate. A result output is generated containing each one or more terms and the associated classified terms.

Abstract: A system and method for assigning unique names to data storage products. The system and method is applicable for assigning unique World Wide Names to library storage products having removable or fixed media storage devices, or existing library storage products to be provisioned with Fiber Channel interface connections. When configuring new library storage products the method comprises the steps of: allocating a range of names to the library storage product, a name being assigned in one-to-one correspondence with a device position in the library and, the range including a base name (Base_N) for indicating where device position numbering begins; and, storing the base name in a memory associated with the library; installing a data storage device at a position in the library; and automatically calculating a unique name N based on the stored base name and the data storage device position of the installed device and assigning the calculated name to the installed device.

Abstract: An automated system and associated method for building a comprehensive database of a configurable entity that is available from one or more Web sites, while removing redundancies. The system merges data tree structures that contain redundant data into more tractable data tree structures where those redundancies have been removed. More specifically, a feature of the present system is to automate the process of collecting information from one or more Web sites and convert the raw data into a logically fashioned, non-redundant tree structure. Advantageously, Web users would be able to retrieve information stored on one or more Web pages and locally merge the data.

Abstract: A data viewer for displaying information selected from hierarchically organized data enables hierarchical searching by displaying hierarchical levels, or alternatively, by implementing an index search of selected data elements. If the index search is selected, an alphabetically ordered list of selected subjects, categories, and subcategories in the database is displayed for the hierarchically organized data. The selected subjects, categories, and subcategories are each associated with a database record and not with a lower hierarchical level that is a category or subcategory. Upon selecting an element from the index, the user is presented with a topical list. Any topic can be selected to display additional information. When an element is selected during an index search, the hierarchical relationship of the selected element to the hierarchical levels above it is also displayed, enabling the user to select a different hierarchical level that appears more relevant to the information desired.

Abstract: An apparatus and method for providing selective views of on-line surveys are provided. With the apparatus and method, each survey has a survey data structure and a template data structure. In a preferred embodiment, the data structures represent tree structures having nodes, child nodes, links between nodes and child nodes, and the like, for the survey and the template. Changes to the survey are made in the template data structure. The survey data structure and the template data structure are compared to one another, and nodes are either added, subtracted, or modified based on the differences between the survey data structure and the template data structure. In this way, the survey data structure retains the information that is already in present in it, such as the questions and answers previously provided. Thereafter, when the survey is again presented to a user, the user's previous answers to questions still remaining in the survey are displayed but no answers are displayed for newly added questions.

Abstract: A method for storing and managing data on a storage medium connected to a computer system, wherein the data consists of a plurality of data elements and a plurality of tags, wherein each of the data elements is assigned one of the tags to form a plurality of pairs each consisting of at least one of the data elements and one of the tags, wherein each of the pairs is assigned a position in a hierarchical structure, wherein each of the pairs is stored and managed on the storage medium together with a pair-individual hierarchy indicator indicating the position of the pair in the hierarchical structure. Furthermore, a computer program for carrying out this method and a data carrier storing such a program are provided.

Abstract: An exemplary embodiment of the present invention is a method for dynamically managing a hash pool data structure. A request to insert a new key value into a hash pool data structure that includes at least one index level is received. An insertion location is calculated for the new key value in response to the new key value and to existing key values in the hash pool data structure. The insertion location includes an index level. A new index level is added at the insertion location if the index level is not the maximum number of index levels in the hash pool data structure; if the insertion location contains a chain of existing key values with a length equal to the maximum chain length; and if the new index record locations of the new key value and the existing key values are dispersed. The insertion location is updated in response to adding a new index record and the new key value is inserted into the insertion location.

Abstract: There are provided a file structure for preventing edition and deletion in the Internet, a variety of computers and computer application media, an advertising method using this file structure and a system adapted for this method, which is capable of providing various information items such as music, music video, movies, games and programs together with advertisements free to users through the Internet, a super fast communication network, a dedicated line network, or a general communication networks, and preventing an information file provided to the users from being reproduced if any one of the information, advertisement and header is edited or deleted.

Abstract: Improved techniques are defined for dynamically loading components which have prerequisite relationships more complex than the simple single inheritance chains which are supported with prior art dynamic class loading techniques. Multiple prerequisites are supported in this improved technique, and in preferred embodiments, an arbitrary number of prerequisites may be explicitly specified for a component. Furthermore, techniques are disclosed which enable delaying the loading and initialization of components until such time as a class in the component is actually needed, thereby improving overall efficiency of the system. Optional filtering and export aspects may also be supported to selectively expose classes for use by dependent components and to enable a component to opt out of re-exporting the classes of its prerequisites, respectively.

Abstract: An implementation of a technology, described herein, for relevance-feedback, content-based facilitating accurate and efficient image retrieval minimizes the number of iterations for user feedback regarding the semantic relevance of exemplary images while maximizing the resulting relevance of each iteration. One technique for accomplishing this is to use a Bayesian classifier to treat positive and negative feedback examples with different strategies. In addition, query refinement techniques are applied to pinpoint the users' intended queries with respect to their feedbacks. These techniques further enhance the accuracy and usability of relevance feedback. This abstract itself is not intended to limit the scope of this patent. The scope of the present invention is pointed out in the appending claims.

Abstract: The invention provides a method and system for verifying a data record. An unverified data record is read. A reference data file containing reference data records, the reference data records being associated with verified data records, is provided. The unverified data record is compared with the reference data records to identify a matching reference data record. The matching reference data record is read to identify a matching verified data record. The matching verified data record is outputted.

Abstract: A system, method and computer program product for generating software cards that summarize and index information. A documentation storage unit stores a variety of documentation. A software card generator generates each of the software cards for a predetermined card category. Each software card points to blocks of information stored in the documentation storage unit that relate to the predetermined card category. A software card database stores the generated plurality of software cards. A user can search the software cards in order to quickly and easily access documentation and materials specific to their specific area of interest.

Abstract: Disclosed is a system, method, and an article of manufacture for preferentially keeping an uncopied data set in one of two storage devices in a peer-to-peer environment when data needs to be removed from the storage devices. Each time a data set is modified or newly created, flags are used to denote whether the data set needs to be copied from one storage device to the other. The preferred embodiments modify the timestamp for each uncopied data set by adding a period of time, and thus give preference to the uncopied data set when the data from the storage device is removed based on the least recently used as denoted by timestamp of each data set. Once the data set is copied, the timestamp is set back to normal by subtracting the same period of time added on when the data set was flagged as needing to be copied.

Abstract: An XML-aware file system exploits attributes encoded in an XML document. The file system presents a dynamic directory structure to the user, and breaks the conventional tight linkage between sets of files and the physical directory structure, thus allowing different users to see files organized in a different fashion. The dynamic structure is based upon content, which is extracted using an inverted index according to attributes and values defined by the XML structure.

Abstract: In a database synchronization process, a block of data is read from a source database at the first node. A marker is assigned to the block of data, and the marker is then written to an audit trail at the first node. The marker is sent from the audit trail to a second node having a target database. The block of data is sent from the first node to the second node without passing the block of data through the audit trail. At the second node, the block of data is stored in the target database upon receipt at the second node of the block of data and the marker assigned to the block of data. This process is repeated for additional blocks of data in the source database, wherein a marker is assigned to each subsequent block of data. In this manner, some or all of the source database may be replicated to the target database without having to store or pass any data in the source database in or through the audit trail at the first node.

Abstract: A method for validity checking a file with permitted design features stored in a profile specification. The profile specification is defined by a plurality of page components having elements with attributes, and each attribute has an associated rule specifying the permitted design features for that attribute. The method includes the steps of selecting an attribute from the file, detecting the features of the selected attribute, finding an attribute from the profile specification that matches the selected attribute from the file and comparing a rule associated with the matched attribute from the profile specification with the detected features of the selected attribute from the file, and determining whether the matched attribute complies with the rule.

Abstract: The present invention is a computer-implemented system and method that allow data from a first hierarchical data structure to be applied to a second hierarchical data structure. The method comprises recursively comparing the source elements of the first hierarchical structure to the target elements of the second hierarchical structure, and applying the data from a source element or source child element to a matching target element or target child element. The method is iterated, until all elements of the second hierarchical data structure have been traversed.

Abstract: A tree-structured index to multidimensional data is created using naturally occurring patterns and clusters within the data which permit efficient search and retrieval strategies in a database of DNA profiles. A search engine utilizes hierarchical decomposition of the database by identifying clusters of similar DNA profiles and maps to parallel computer architecture, allowing scale up past previously feasible limits. Key benefits of the new method are logarithmic scale up and parallelization. These benefits are achieved by identification and utilization of naturally occurring patterns and clusters within stored data. The patterns and clusters enable the stored data to be partitioned into subsets of roughly equal size. The method can be applied recursively, resulting in a database tree that is balanced, meaning that all paths or branches through the tree have roughly the same length. The method achieves high performance by exploiting the natural structure of the data in a manner that maintains balanced trees.

Abstract: System and method for filtering and sorting data. The system includes data management system for displaying a data table having a plurality of rows and columns of data cells. Each of the columns in the data table has an associated filter cell whereby the user may input filter criteria. In response to receiving the filter criteria in the filter cells, a data management system filters and sorts each of the data cells in the data table. In one embodiment of the invention, the data management system records the order in which the user inputs the filter criteria and generates a sorting priority list that defines a sorting priority for the data cells. The data management system sorts the data cells using the sorting priority list. Furthermore, in one embodiment of the invention, the data management system displays the data cells that satisfy the filter criteria contiguously and interleaved between those data cells that do not satisfy the filter criteria.

Abstract: In an information processing system, an information storing unit stores a plurality of main information sets along with time information sets. A retrieval condition input unit inputs retrieval conditions for the main information sets. A retrieval execution unit performs a retrieval upon the main information sets along with the time information sets by using the retrieval conditions. A cell output information generating unit receives retrieved main information sets along with the time information sets and generates a number of the main information sets and a tendency of the number of the main information sets to change with respect to time for each of cells defined by the retrieval conditions. A cell output unit outputs each of the cell and displays each of the cells at a location on a matrix designated by the retrieval conditions.