Abstract: The present invention provides a music artist retrieval system which makes it possible for users to automatically retrieve an unknown music artist similar to the user's favorite artist while actually reproducing and confirming a piece of music of the unknown artist. A music artist similarity map storing section (13) computes a plurality of similarities for a plurality of music artists and makes a music artist similarity map for the plurality of music artists based on the plurality of similarities, then stores the music artist similarity map. Here, the similarities are computed between one of the plurality of music artists and the other music artists based on features of the respective music artists. A similar artists selecting and displaying section (17) displays on a display plurality of indications related to one music artist and two or more music artists whose similarities are close to the one music artist, based on the music artist similarity map.

Abstract: An efficient PEIM-to-PEIM interface (“PPI”) database for storing data identifying one or more PPIs. The PPI database includes a linked list having one or more linked arrays of elements. The elements in each array store data identifying a PPI. Each array in the linked list of arrays may also include an element reserved for storing data identifying the last element in the array. Each array in the linked list of arrays may also include an element reserved for storing a pointer to a next array in the linked list of arrays. When the last array in the linked list of arrays becomes full, a new array is created, and a pointer to the new array is stored in the last array.

Abstract: Each of two or more document management server stores a document and index data corresponding to the document. Of the index data stored in the two or more document management servers, index data corresponding to a document that satisfies a first retrieval condition is collected for storage. When a user requests retrieval based on a second retrieval condition, it is determined whether the first retrieval condition and the second retrieval condition are the same, and when the first and second conditions are the same, the document retrieval according to the user's instruction is performed by referring to the collected index data.

Abstract: A method and system for determining currency of data in a data processing system. The processing steps along a dependency chain used to populate a data reporting program are back tracked recursively through each processing step until a first originating set of processing steps are reached. The currency of each data source for the programs is identified and it is determined whether the program has run since that time. If any one of the sources for the program of the processing step is more recent than a last run time of the program associated with the processing step, the program is re-run and outputs updated. The same process is executed moving forward along the dependency chain, to each other processing step.

Abstract: Systems, methods, and other embodiments associated with providing query modes for translation-enabled XML documents are described. One method embodiment includes receiving an XPath query to an XML document that may store a translation for a data element. The method embodiment may also include automatically selecting a query mode for the XPath query. The method embodiment may also include querying the XML document using the XPath query and the selected query mode. The query mode may control, at least in part, the operation of an XML database logic.

Abstract: The page ranking technique described herein employs a Markov Skeleton Mirror Process (MSMP), which is a particular case of Markov Skeleton Processes, to model and calculate page importance scores. Given a web graph and its metadata, the technique builds an MSMP model on the web graph. It first estimates the stationary distribution of a EMC and views it as transition probability. It next computes the mean staying time using the metadata. Finally, it calculates the product of transition probability and mean staying time, which is actually the stationary distribution of MSMP. This is regarded as page importance.

Abstract: File difference is managed. Group data and difference detection data tables are stored. A previous difference detection file, which is an original file of a difference management object file, is searched, and a difference between the previous difference detection file and the difference management object file is detected. Difference detection data is used to detect the difference, and is recorded on the difference detection data table. A group to which the difference management object file belongs is selected based on a group condition registered in the group data table. The difference is detected based on comparing extracted difference detection data and file data of the difference management object file. A set of the file data and the group is recorded as a new difference detection data on the difference detection data table, when the difference is detected.

Abstract: A log collection utility (LCU) operable in a storage area network (SAN) to identify the various types of log files generated in the SAN computes the location of each of the log files, and collects the log files for consolidation and analysis in a common repository. The LCU periodically collects and/or processes the log files by enumerating the location of each of the log files in a log file designator, and generates a script operable for identifying each of the log files sought. A resulting task definition file lists each of the log files identified. The log collection utility therefore finds log files generated by dissimilar applications and nodes in the SAN via a log type definition that enumerates each of the log files in a manner that is agnostic to operating systems, platforms, and directory structures around which the log files are written and stored.

Abstract: One embodiment of the present invention provides a system for detecting correlations between terms. During operation, the system identifies one or more lists contained in one or more documents and identifies two terms co-occurring in the lists. The system further determines a correlation between the co-occurring terms, and places the co-occurring terms in a correlated-pair list based on the correlation.

Abstract: A method for generating search results based on a search term and displaying the search results in one or more groupings. The method includes receiving a search term entered by a user, selecting one or more search result groupings based on the search term entered by the user and at least in part on a bid amount associated with the search term, providing search results based on the search term entered by the user for each search result grouping, and displaying the search groupings to the user.

Abstract: A process combines multiple grouping sets into single rollup sets with depth lists defining the levels of grouping that must be performed. Grouping sets are identified that are contained within other sets and combined into single rollups with depth lists. Cube aggregation conversion to rollup aggregation is provided for optimizing database query processing. Natural sets of rollup hierarchies within a cube are recognized and the cube is converted into those rollup hierarchies. Once converted, the rollup aggregation is performed to significantly reduce required processing.

Abstract: An apparatus receives messages having a linking keyword for identification of a transaction, classifies the received messages in terms of transaction using message patterns and the linking keyword. It compares a series of messages associated with the transaction with the message patterns. It makes a decision as to whether the series of messages associated with the transaction matches any one of the message patterns. It creates a record including an identifier for the transaction and the linking keyword. It searches for the unclassified messages based on the linking keywords contained in the unclassified messages, and identifies the record containing the identical linking keyword. It stores the identifiers for the unclassified messages into a linked candidate list in a corresponding manner to linked candidate transactions. It adds the unclassified messages to the message pattern which corresponds to the linked candidate transaction to create a new message pattern.

Abstract: A client terminal displays the titles of downloaded music data such that these titles are classified by albums based on the album identification information associated with each music data and arranged in an order indicated by the recording order information which is associated with each music data.

Abstract: Systems, methodologies, media, and other embodiments associated with supporting queries with hard time constraints are described. One exemplary system embodiment includes logic for accepting a query having a hard time constraint. The example system may also include logic for selectively rewriting the query having the hard time constraint into a query having a row limitation or a sample percentage limitation. In one example, the row limitation or sample percentage limitation are computed by repetitively comparing an estimated query execution time to the hard time constraint. The example system may also include logic for establishing a timer(s) associated with the rewritten query.

Abstract: Novel methods and systems for the privacy preserving mining of string data with the use of simple template based models. Such template based models are effective in practice, and preserve important statistical characteristics of the strings such as intra-record distances. Discussed herein is the condensation model for anonymization of string data. Summary statistics are created for groups of strings, and use these statistics are used to generate pseudo-strings. It will be seen that the aggregate behavior of a new set of strings maintains key characteristics such as composition, the order of the intra-string distances, and the accuracy of data mining algorithms such as classification. The preservation of intra-string distances is a key goal in many string and biological applications which are deeply dependent upon the computation of such distances, while it can be shown that the accuracy of applications such as classification are not affected by the anonymization process.

Abstract: A version update method is provided for updating a version of a communication system application program installed in a plurality of terminals connected to a communication network and operating between at least two terminals. The method includes: starting communications between the two of the plurality of terminals; exchanging version information of the communication system application program between the two terminals communicating with each other and making a comparison between the version information held in one terminal and that in the other; making a request for transmitting the communication system application program file of the version not held in either terminal; and transmitting the communication system application program file of the specified version to the terminal making the request.

Abstract: A data item name constituting a source data schema is extracted (1051), a data item name constituting a target data schema is extracted (1052), element concepts included in the extracted data item names of the source data schema and the target data schema are extracted (1053), a distinctive relation between the data item names is set based on the extracted element concepts to be stored in an ontology (1061), the data item names of the source data schema and the target data schema are read, a correlation is set between the two read data item names based on the distinctive relation to be stored in a mapping definition file (1071).

Abstract: The invention receives a request to store a file having a filename written in a first text encoding, converts the filename into a Unicode filename and stores the Unicode filename and the file into memory. The invention then sets a flag, associated with the memory, indicating that a first text encoding has been used. To retrieve a Unicode filename, the invention receives a request to locate a Unicode filename from memory. Next, the invention uses a predetermined text encoding to convert the filename into Unicode. The invention then searches for the Unicode filename in the memory. If the Unicode filename is not found, the invention uses a next text encoding from the set of text encodings which have been used, to repeat the conversion and searches the memory until the Unicode filename is identified. Lastly, the Unicode file is retrieved.

Abstract: A system searches a first search index based on a search query to obtain first search results and searches a second search index based on the search query to obtain second search results. The system further ranks the first search results using a first ranking algorithm and one or more first ranking parameters to produce ranked first search results, and ranks the second search results using a second ranking algorithm and one or more second ranking parameters to produce second search results, where the one or more first ranking parameters are different than the one or more second ranking parameters and where the one or more second ranking parameters include at least one of previous user feedback associated with custom content that corresponds to the second search index, annotations of the custom content provided by a user, or usage patterns associated with users previously accessing and searching the custom content. The system also provides the ranked first and second search results to a user.

Abstract: A method and system for allowing a rollback within a multi-object system infrastructure are provided. In embodiments, a rollback to a state of a software business object is effected. A sync point manager maintains, for example, a list of sync points and their respective associated identifiers and relationship data. When under sync point protection, i.e., a sync point is set, each subsequent object, when created, is requested to prepare a buffer associated with the specific sync point, so that if an error occurs, a request to rollback to the state associated with the sync point is effectable. Multiple sync points may be kept track of by the sync point manager. In further embodiments, the sync points may be associated with a variety of different types of objects.