Abstract: An archiving system for enabling searching for collections of items is disclosed. A processing unit displays an archived items collection management template in respect of a particular collection of items and prompts a user to complete the template fields with data obtained by the user from manually reviewing that collection of items to capture information relevant to each of the template fields. An archiving controller stores, in pre-determined data fields of a storage area of a data store corresponding to said collection of items, the data from the completed template fields. A document search controller may search the pre-determined data fields of the storage areas of the data store corresponding to each of the collections of items to identify ones of the collection of items which match search criteria.

Abstract: A management device includes a memory unit for storing configuration item information regarding configuration items to be managed and relationship information regarding relationships between the configuration items to be managed, an extracting unit for extracting, based on the information stored in the memory unit and based on predetermined constraint conditions, such relationships between the configuration items that satisfy the predetermined constraint conditions and that are not included in the relationship information, and an evaluating unit for executing an application that refers to the extracted relationships between the configuration items and obtains an evaluation result regarding the extracted relationships between the configuration items.

Abstract: Methods and apparatus for ensuring uniqueness of database object attributes are disclosed. An example computer-implemented method includes receiving a request to insert, update or delete a versioned database object having a first identifier (ID) in a main database table. The method further includes determining, based on the request, whether to fire an insert trigger, a delete trigger or an update trigger for the main database table. In the event an insert trigger is fired, the method includes performing, in a secondary database table, a record insertion process. In the event a delete trigger is fired, the method includes performing, in the secondary database table, a record deletion process. In the event an update trigger is fired, the method includes performing, in the secondary database table, at least one of the record insertion process for a post-update versioned database object and the record deletion process for a pre-update versioned database object.

Abstract: Architecture for extracting document information from documents received as search results based on a query string, and computing an edit distance between the data string and the query string. The edit distance is employed in determining relevance of the document as part of result ranking by detecting near-matches of a whole query or part of the query. The edit distance evaluates how close the query string is to a given data stream that includes document information such as TAUC (title, anchor text, URL, clicks) information, etc. The architecture includes the index-time splitting of compound terms in the URL to allow the more effective discovery of query terms. Additionally, index-time filtering of anchor text is utilized to find the top N anchors of one or more of the document results. The TAUC information can be input to a neural network (e.g., 2-layer) to improve relevance metrics for ranking the search results.

Abstract: The APPARATUSES, METHODS AND SYSTEMS FOR A DESCRIPTIVE BUSINESS GRAMMAR SYNTAX QUERIER (“QUERIER”) implement efficient and scalable monitoring, regulation, and allocation of computational processing, data, labor, and/or the like resources within an enterprise. The Querier may include facilities for basal tagging to associate entities, employees, transactions, projects and/or assignments, and/or the like business data with various tables in an enterprise database, and the implementation of a descriptive business grammar to access, search, store, manipulate, modify and/or the like stored business data. The Querier allows for engagement of descriptive business grammar phraseology for accessing, querying, viewing and/or creating associations for data in a database, tailoring rules, managing and/or allocating enterprise resources, and/or the like.

Abstract: The present invention relates to storing and manipulating customer purchasing information, particularly purchasing information by credit cards, debit cards, checks, and the like. A hierarchical organizational structure is created comprising a plurality of categories and sub-categories. The customer purchase information may then be retrieved according to user created links to generate customer preference information. The customer preference information may be stored in a customer account, thereby allowing targeted offers to be made to customers.

Abstract: In general, in one aspect, a method includes receiving a query image, accessing a database of hash values of other images, determining a hash value for the query image by applying a hash function to a bit-vector of data representing signs of a subset of wavelet coefficients collected from the query image, the subset corresponding to wavelet coefficients having greatest magnitude, comparing the hash value of the query image to the hash values of the database, and based on the comparison, identifying as near duplicate images one or more of the other images having a hash value that matches the hash value of the query image. This and other implementations of this aspect can include corresponding systems, apparatus, and computer program products.

Abstract: A method and an apparatus for recommending information to users within a social network. The method builds a recommendation list with at least one two-tuple, where each two-tuple comprises a target user name and an information item and ranks the recommendation list by using two-tuples in the recommendation list as a basic unit. By selecting a two-tuple in the recommendation list, the user can recommend a corresponding information item to a user represented by a target user name. An apparatus is also provided by using a builder for building for a user a recommendation list comprising at least one two-tuple and a sorter for ranking the recommendation list by using two-tuples in the recommendation list as a basic unit, such that, by selecting a two-tuple in the recommendation list.

Abstract: The present invention relates to a reproducing apparatus, a reproducing method, a program, a program storage medium, a data delivery system, a data structure, and a manufacturing method of a recording medium for easily handling a content file recorded on a disk and an update file recorded on a local storage. Downloaded data can be handled with a file having a path name and a file name on the local storage being different from a file having a path name and a file name on a virtual file system based on a path name specified by an src_file_name field of and a path name specified by a dst_file_name field of a manifest ( ) section. The present invention is applicable to reproducing apparatuses.

Abstract: A storage system, such as a file server, uses pathname aliasing and exports a stored resource to clients by advertising to the clients a different pathname than the actual pathname of the resource.

Abstract: A method and a system are provided for constructing album data using discrete track data from multiple sources. In one example, the system identifies one or more set of tracks having a similar album title, wherein the one or more set of tracks are obtained from one or more client devices. The system then searches across the one or more set of tracks for tracks having a matching fingerprint and a matching album title. The system groups tracks that match according to an original album title in metadata to obtain grouped tracks. The system mines across the grouped tracks to generate a juxtaposition of track data from the one or more client devices. The system then generates album data for one or more albums based on the juxtaposition of track data.

Abstract: A method, machine readable storage medium, and system for generating a semantic network that utilizes existing relationships between related terms in a searchable database. Upon detection of the absence of a searched term from a database, a term data structure and indexes in a particular domain in which related terms related to the results provided by the search engine may be analyzed to determine if a new term related to the unfound search term should be created. Upon creation of the term, attributes related to the term are generated so the term may be placed in the most proper domain, and linkages to other terms in the same or different domains may be generated. All of the information is stored in the database. User input is not needed to accomplish the creation of the new term in the database.

Abstract: In certain embodiments, a parser parses a formula to yield one or more functions, at least one function comprising a dependent value of a dependent object. One or more macro handlers configured to execute the functions are determined. At least one macro handler is instructed to register with one or more dominant objects on behalf of the dependent object, where the dominant objects are used to evaluate the dependent value.

Abstract: In accordance with one or more embodiments, an inode implemented file system may be utilized to support both offline and inline deduplication. When the first content is stored in the storage medium, one inode is used to associate a filename with the data blocks where the first content is stored. When a second content that is a duplicate of the first content is to be stored, then a parent inode is created to point to the data blocks in which a copy of the first content is stored. Further, two inodes are created, one representing the first content and the other representing the second content. Both inodes point to the same parent inode that points to the data blocks where the first content is stored.

Abstract: A node apparatus acquires root link information including a serial number of root page information, information for checking the root page information for tampering, and a digital signature for checking the root link information for tampering from a management apparatus or another node apparatus that stores the root link information through a network and determines a range of page information assigned to each node apparatus according to predetermined rules. The node apparatus determines whether page information that is a child of the root page information indicated by the acquired root link information is within the assigned range. If so, the node apparatus acquires the child page information and pieces of page information linked together from the child to leaf page information from the management apparatus or another node apparatus as page information assigned to the node apparatus and stores the acquired page information in a storage area.

Abstract: The invention relates to a system (100) for retrieving a volumetric image data subset comprised in a data storage (105) of volumetric image data sets, the system comprising: a first query unit (111; 113) for composing a first query for searching the data storage (105) for a volumetric image data set comprising the volumetric image data subset; a second query unit (112; 113) for composing a second query for searching the volumetric image data set for the volumetric image data subset, the second query comprising anatomical structure information for identifying an anatomical structure within the volumetric image data set; a first determination unit (121; 123) for determining the volumetric image data set, based on the first query; a second determination unit (122; 123) for determining the volumetric image data subset of the volumetric image data set, based on the anatomical structure identified within the volumetric image data set, using the anatomical structure information comprised in the second query; and a r

Abstract: A data management system respectively computes first hash values while sliding a window a prescribed amount at a time with respect to a prescribed range from a start location of a data block to a prescribed size. The system extracts, from among the first hash values, a first hash value, which is equivalent to a characteristic value, and partitions the data block into a first chunk of data at a location corresponding to this first hash value. The system determines coincidence between a first chunk of data and a stored second chunk of data, and prevents duplicate data from being stored twice.

Abstract: Techniques implementable in an enterprise application or application suite for managing the organizational structure of an enterprise. In one set of embodiments, a single, unified hierarchy can be defined for the organizational structure of an enterprise. The unified hierarchy can include high-level nodes that correspond to entities common to different manifestations of the organizational structure (e.g., reporting structure, cost structure, etc.). The unified hierarchy can also include lower-level nodes that are unique to a particular manifestation. By defining a single, unified hierarchy in this manner, organizational changes in the enterprise can be modeled in the application/application suite by simply updating the unified hierarchy (rather than updating multiple hierarchies). In addition, the unified hierarchy can be used to facilitate security provisioning and reporting.

Abstract: A system and process for record duplication analysis that relies on a multi-membership Bayesian analysis to determine the probability that records within a data set are matches. The Bayesian calculation may rely on objective data describing the data set as well as subjective assessments of the data set. In addition, a system and process for record duplication analysis may rely on the predetermination of probabilistic patterns, where the system only searches for patterns exceeding a chosen threshold.

Abstract: A computer program product is provided and includes a tangible storage medium readable by a processing circuit and on which instructions are stored for execution by the processing circuit for initially verifying a presence of parameters passed to a parameter database and that a selected group of the parameters are greater than or equal to zero, parsing optional block data to validate the optional block data, determine a length thereof and a number of optional blocks contained therein and proceeding with one of a secondary info-parsing and a secondary data-parsing operation with respect to the optional block data in accordance with content of the parameters passed to the parameter database.