Abstract: A method and apparatus for creating custom dimension trees. The method may include receiving a user request to create a custom dimension tree, displaying a list of available dimensions, and receiving user selection of available dimensions from the list. The method may further include allowing the user to create virtual dimensions, mapping elements of the available dimensions to the virtual dimensions, and creating the custom dimension tree using the mapping. The custom dimension tree represents relationships between the virtual dimensions.

Abstract: A content management system (CMS) includes metadata for each element in the repository. When an element has missing content that needs to be created, the repository is queried to identify elements which most closely match the metadata of the missing content. The metadata for these identified elements is analyzed to determine the authors for these elements which most closely match the element that needs to be authored. The authors are then ranked according to an author selection policy that may specify any suitable criteria for ranking authors, including author selection criteria, author ranking criteria, author filtering criteria, and author backup criteria. The result is a ranked list of one or more authors that are deemed the best choices of authors to author the missing content. The user may then request one of the authors in the ranked list to create the missing content.

Abstract: The present invention may be used to analyze subject content, search and analyze reference content, compare the subject and reference content for similarity, and output comparison reports between the subject and reference content. The present invention may incorporate and utilize text from intrinsic and/or extrinsic subject documents. The analysis may employ a variety of metrics, including scores generated from a natural language processing system, scores based on classification similarity, scores based on proximity similarity, and in the case of analysis of patent documents, scores based on measurement of claims.

Abstract: A recommendation information generation apparatus and a recommendation information generation method that can select a similar user appropriately even if the amount of history information is small. In an information distribution server, a user characteristic vector calculation unit calculates a user characteristic vector of each of users, and a similar user calculation unit calculates the degree of similarity between the users based on the calculated user characteristic vector of each of the users. The similar user calculation unit then selects a similar user who is similar to a first user based on the calculated degree of similarity. A relevance evaluation unit generates recommendation information for the first user based on the characteristic vector of the selected similar user.

Abstract: Provided is a method and system for performing volume migrations while retaining persistent point in time data of the migrated volume. Specifically, by using a collective persistent point in time data map that describes a collection of persistent point in time data of a volume to be migrated, the collective persistent point in time data map and volume data can be migrated during a quiesced period of user activity. Then, during a non-quiesced period of user activity, the persistent point in time data can be transferred to the location of the migrated volume in real-time.

Abstract: A system and method for suggesting keywords for tagging a digital image are provided. In general, a requesting node is communicatively coupled to a keyword service via a network. The requesting node sends a request to the keyword service requesting suggested keywords for a digital image. The request includes information relating to the digital image such as positional information. Based on the information, the keyword service generates a list of suggested keywords and provides the list of suggested keywords to the requesting node. At the requesting node, the list of suggested keywords is displayed to a user, and the user selects one or more of the suggested keywords for tagging the digital image.

Abstract: Methods and apparatus for a new approach to the problem of finding communities in complex networks relating to a social definition of communities and percolation are disclosed. Instead of partitioning the graph into separate subgraphs from top to bottom a local algorithm (communities of each vertex) allows overlapping of communities. The performance of an algorithm on synthetic, randomly-generated graphs and real-world networks is used to benchmark this method against others. An heuristic is provided to generate a list of communities for networks using a local community finding algorithm. Unlike diffusion based algorithms, The provided algorithm finds overlapping communities and provides a means to measure confidence in community structure. It features locality and low complexity for exploring the communities for a subset of network nodes, without the need for exploring the whole graph.

Abstract: Techniques are described for organizing structurally similar web pages for a website. Fingerprints are made of the structure of the web pages using shingling by placing the web page's HTML tags and attributes in sequence and encoding the tags and attributes using a standard encoding technique. Fixed-size portions of the encoded sequence are taken and a set of values extracted using independent hash functions to compute the shingles. Alternatively, a DOM tree representation of HTML of the web page is generated and each path of the DOM tree encoded and values extracted using independent hash functions to compute the shingles. A specified number of shingles are retained as the fingerprint. The pages are then clustered based upon the URL and the similarity of the shingles. The clustered hierarchal organization of pages is further pruned by various criteria including similarity of shingles or support of the cluster node in the hierarchy.

Abstract: A data retrieving apparatus having: an input apparatus for inputting the hierarchical structure data showing the hierarchical structure and operation instruction data; a data storing apparatus for storing the inputted hierarchical structure data; a retrieving apparatus for retrieving data which satisfies conditions from the hierarchical structure data stored in the data storing apparatus on the basis of the operation instruction data which is inputted by the input apparatus; and an output apparatus for outputting the retrieved data. Each data which is stored in the data storing apparatus has items regarding an efficient date and items regarding a data change date. The retrieving apparatus has an apparatus for retrieving the data on the basis of the efficient date and the data change date.

Abstract: System and method for detecting the inclusion of strings of words (records) in an input string of words. In a preparation phase, the records are pre-processed. Each record is represented by a string of chunks, each chunk composed of a pre-defined number of words. Each chunk found in at least one record is assigned a number of attributes, such as a “Begin of Record” attribute and an “End of Record” attribute. In the searching phase the input string is also divided in chunks, and for each input chunk, an Incremental Hash Function (IHF) is calculated for comparing with a prerecorded value ?I. If the two values IHF and ?I coincide for matching chunks with certain predefined attributes, a “probable match” is set, indicating a very high probability that a chunk was found in the records.

Abstract: The subject matter disclosed herein relates to processing information regarding events. In one particular example, a stabbing query may be formulated in response to an event. One or more sets are associated with and/or mapped to nodes of a tree.

Abstract: A method and system of masking a group of related data values. A record in an unmasked data file of n records is read. The record includes a first set of data values of data elements included in a related data group (RDG) and one or more data values of one or more data elements external to the RDG. A random number k is received. A second set of data values is retrieved from a lookup table that associates n key values with n sets of data values. Retrieving the second set of data values includes identifying that the second set of data values is associated with a key value of k. The n sets of data values are included in the umnasked data file's n records. The record is masked by replacing the first set of data values with the retrieved second set of data values.

Abstract: Under the present invention, a set of filters (e.g., one or more) is associated with a hierarchical tree, which includes sets of namespace nodes, element nodes and variable nodes. Once the set of filters is associated with the hierarchical tree, a network document is parsed and compared to the hierarchical tree to identify a set of corresponding filters. Each corresponding filter is then evaluated based on the network document to determine which, if any, are “satisfied.” The network document is then communicated to the user(s) that correspond to the satisfied filter(s).

Abstract: A request is received with a first operation identifier to lock a first resource. The first resource is locked with the first operation identifier. It is determined whether a second resource should be locked with the first operation identifier or with a second operation identifier based on whether an operation to be performed for the request may complete after the request is processed. Additional embodiments are described and claimed.

Abstract: A system and method for suggesting keywords for tagging a digital image are provided. In general, a requesting node is communicatively coupled to a keyword service via a network. The requesting node sends a request to the keyword service requesting suggested keywords for a digital image. The request includes information relating to the digital image such as positional information. Based on the information, the keyword service generates a list of suggested keywords and provides the list of suggested keywords to the requesting node. At the requesting node, the list of suggested keywords is displayed to a user, and the user selects one or more of the suggested keywords for tagging the digital image.

Abstract: One embodiment of the present invention provides a system that selects data records from versioned data. The system operates by receiving a query from a client to select data records from a data source that match a criteria specified by the query. Note that the data source includes at least one data record which has been modified at least one time, to create multiple versions of the data record. The system performs the query on the data source, which includes performing the query on multiple versions of the data record. Finally, the system returns results of the query to the client.

Abstract: A query and a factoid type selection are received from a user. An index of passages, indexed based on factoids, is accessed and passages that are related to the query, and that have the selected factoid type, are retrieved. The retrieved passages are ranked and provided to the user based on a calculated score, in rank order.

Abstract: Information on a referenced class or a referenced property is extracted from at least one referenced dictionary having a referencing relation with a referencing dictionary having the hierarchical structure, in which lower classes inherit the properties of upper classes; the extracted information is added to the referencing dictionary and organized; the extracted detailed information is outputted organized referencing dictionary. Thus, the detailed information on an imported property may be acquired simply at the side of the referencing dictionary. In addition, since only the information on the referenced class or property in the referenced dictionary is separately extracted, traffic of the dictionary data may be reduced, and the efficient inter-dictionary data exchange can be realized.

Abstract: A system may receive a feed associated with a blog. The system may extract information from the feed and the blog and create a hybrid document based on the extracted information. The system may further use the hybrid document to determine a relevance of the blog to a search query.

Abstract: Consistency errors may arise during replication of diverse data storage objects from servers in a data network. For preventing consistency errors, a server is programmed for responding to a request for a report of whether or not the server can replicate the dataset without causing a consistency error. Such a report is useful for replicating a consistency group of objects from more than one server. Preparation for replication can be begun at each of the servers, and if any of the servers fail to report that replication can be done without causing a consistency error, the preparation can be aborted so that write access by applications will not be disrupted while the potential problem is diagnosed and eliminated.