Abstract: The invention relates to a multiple platform architecture data reporting system for managing attribute data. The system comprises: a system manager for collecting attribute data from multiple platforms and a user interface connected to the system manager for displaying the collected attribute data to a user. Also disclosed is a method for managing attribute data in a multiple platform architecture comprising the steps of polling at least two platforms for attribute data, collecting the attribute data from the at least two platforms in response to the step of polling, and then displaying the collected attribute data on a user display.

Abstract: A temporal relational database includes a relational database framework that allows for all the capabilities of a standard relational database with the addition of the concept of time. Transactions, which can be modifications of attribute values or changes to the database schema, can be stored with temporal histories. Through the use of these temporal histories, the temporal database is able to seamlessly respond to queries for times that are in the past, present, or future. Furthermore, transactions can be entered into the temporal relational database that are not effective until some point in the future, thus allowing for seamless migration of the data and schema of a database. Applications that access data in a temporal database may retrieve a time appropriate schema from the temporal database. An exemplary use of a temporal database to manage roles and responsibilities within an organization is described.

Abstract: Redundant data is removed from a volume of data by partitioning the volume of data into fixed-length input segments and, for each of the input segments, traversing nodes of a search tree in accordance with the value of a fixed-size portion of the input segment to determine if the search tree contains a pointer to a matching fixed-sized portion of a segment within a dictionary. If the search tree contains the pointer, the input segment is compared with the segment within the dictionary pointed to by the pointer, and a token representative of the segment within the dictionary is substituted for at least part of the input segment determined to match the segment within the dictionary.

Abstract: An information reproducing apparatus and method thereof. The information reproducing apparatus includes a storage unit, communication unit, controller, and display unit. The storage unit stores music data and at least one first string of characters corresponding to the music data. The reproducing unit reproduces the music data from the storage unit. The communication unit communicates with an image data storage unit, which stores a plurality of image data each corresponding to at least one second string of characters. The controller controls acquisition of one image data from the image data storage unit via the communication unit. The one image data is acquired based on a comparison between the at least one first string of characters and the plurality of the at least one second string of characters. Further, the display unit is configured to display the acquired image data when the reproducing unit is reproducing the music data.

Abstract: This invention provides the data network user with an interactive search engine environment that helps him focus on the object of his search. Through a powerful graphical user interface (GUI), the user is provided with terms closely related to what he is looking for, even when he has no prior knowledge of the subject or its terminology. The user is also provided with suggested terms that should be excluded from the search because of the high probability of interfering with the search. The contribution of each term to the search progress is explained to the user. The invention then enables the user to build complex queries combining the related terms in a visual and simple way that facilitates the search process and saves time. This invention allows the user to create a detailed, precise, and longer search query then is customarily executed today.

Abstract: Aspects of the invention provide for information to be synchronized in an asynchronous manner among two or more computing devices.

Abstract: A priority restore agent in a data storage system generates a priority restore data set for a client computer system or device by identifying a set of active data sets and/or a set of key data sets within client system data generated by the client computer system. The priority restore agent looks at or processes file system attributes for the client system data and compares these attributes with predefined restore parameters. The restore parameters may indicate that any file that has been accessed, modified, or created within a particular period of time be included in the priority restore data set. The key data sets may be identified in a set of automated restore rules. A data protection application within the data storage system can restore data in the priority restore data set onto the client computer system after a disaster or system crash.

Abstract: System, method and computer program product for searching through multiple databases based on a search expression. Distribution of records corresponding to search keys in the database is defined. The search expression is divided into multiple search expressions based in part on the defined distribution of records. Respective, target search ranges are determined for the multiple search expressions such that a number of records to be searched with each of the multiple search expressions is approximately constant. The multiple search expressions are executed in their respective, target search ranges. The search ranges can also be determined for the multiple search expressions based in part on search rates through respective search ranges.

Abstract: A system and computer readable medium for executing a query to access data stored in a database, wherein the query includes a plurality of DISTINCT keys, is disclosed. The system and computer readable medium includes a capture module for identifying each of the plurality of DISTINCT keys in the query and a sort module coupled to the capture module for determining if more than one sort is needed to execute the query, performing a first DISTINCT operation on a first DISTINCT key of the plurality of DISTINCT keys, storing data fetched from the first DISTINCT operation in a master workfile only if more than one sort process is needed to execute the query, and utilizing the master workfile to perform subsequent DISTINCT operations on the other of the plurality of DISTINCT keys.

Abstract: A web server for tracking media content transaction includes a controller adapted to manage an archive of media content for a subscriber and to record a transaction description and a corresponding tracking identifier for a transaction that manipulates the archive.

Abstract: A method and system for determining the relevance of questions to a queried question based on topics and focuses of the questions is provided. A question search system provides a collection of questions with topics and focuses. Upon receiving a queried question, the question search system identifies a queried topic and queried focus of the queried question. The question search system generates a score indicating the relevance of a question of the collection to the queried question based on a language model of the topic of the question and a language model of the focus of the question.

Abstract: A schema definition, which is known to the encoder and to the decoder or transmitted from the encoder to the decoder, specifies information for calculating code concerning the elements or data types contained in the name subspace and enabling this information to be clearly assigned in this manner to each code in the name subspace. Only a portion of the entire name space including the number of the elements or data types lacking for the code calculation have to be transmitted for the configuration of a code which generally means a significantly smaller volume of data than the volume of data that would be required for the entire name space. In addition, the code tables are smaller than in entirely known name spaces which requires less storage space in the codec and enables a faster encoding and decoding.

Abstract: According to the invention, a system for downloading audio or video to a browser is disclosed. The system includes a media server, a content database and a web page. The content database includes the content object, and the content database is linked to the media server. The web page presented to the browser and includes a link to the content object. The link avoids activating an autoplay feature of the browsers should the link be activated.

Abstract: A method and system for presenting questions that are relevant to a queried question based on clusters of topics and clusters of focuses of the questions is provided. A question search system provides a collection of questions. Each question of the collection has an associated topic and focus. Upon receiving a queried question, the question search system identifies questions of the collection that may be relevant to the queried question and generates a score or ranking indicating relevance of the identified questions. The question search system clusters the identified questions into topic clusters of questions with similar topics. The question search system may also cluster the questions within each topic cluster into focus clusters of questions with similar focuses.

Abstract: Disclosed is a method and device for finding documents, such as Web pages, for presentation to a user, automatically or in response to a user expression of interest, which documents are part of a Web site being accessed by the user, and which documents relate to a document, such as a Web page, being accessed in the Web site. The method takes advantage of information retrieval techniques. The method generates the search query to use to find documents by reference to the text of the document in the Web site being accessed by the user. The method further uses a weighting function to weigh the terms used in the search query.

Abstract: A first set of data includes a plurality of presentation elements. A second set of data includes metadata concerning the presentation elements, the metadata including at least a hash value related to each of the presentation elements and a location of each of the presentation elements. An element management subsystem is configured to provide the presentation elements to a remote element server. The element server is configured to serialize and transmit the elements in a binary stream in response to a request, the elements being formatted according to a parameter of the request.

Abstract: Programming mechanisms for data parsing facilitate both clear code specification and efficient execution. Declarative style code can be employed to enable clear and concise specification of data parsing. Further, an efficient parsing approach can be utilized that enables processing of a data structure without first materializing the entire structure to memory. More specifically, streaming and/or selective materialization of portions of data to memory can be employed.

Abstract: Documents having a structured nature such as contracts, legislation, etc. can be graphically depicted to emphasize their logical structure. In a document mapping method, a set of logical operator classes each representing a logical operator may be defined. Each logical operator class may also have a dedicated mapping symbol. Through a mapping interface, logically structured document sections may be mapped. Each document section will typically include a logical operator and one or more requirements logically associated with the logical operator. The mapping symbol may depict the logical operator in a node structure and the unique requirements in branch structures extending from the logical operator node. Multiple document sections may be graphically and logically linked, including embedding document structures within the requirement fields of parent structures. The document map may be used to determine compliance with a document, costs of compliance, etc.

Abstract: A method and system for managing schedule information using a digital living network alliance (DLNA) network are disclosed. The method includes receiving a schedule memo stored in a portable terminal via a DLNA network, analyzing the schedule memo and creating a query for searching for supplementary information related to the schedule memo, transmitting the created query to a Web server, receiving, in reply to the query, a Web search result from the Web server, generating detailed schedule information using the Web search result and transmitting the detailed schedule information to the portable terminal via the DLNA network.

Abstract: Search term ranking algorithms can be generated and updated based on customer settings, such as where a ranking algorithm is modeled as a combination function of different ranking factors. An end user of a search system provides personalized preferences for weighted attributes, generally or for a single instance of the query. The user also can indicate the relative importance of one or more ranking factors by specifying different weights to the factors. Ranking factors can specify document attributes, such as document title, document body, document page rank, etc. Based on the attribute weights and the received user query, a ranking algorithm function will produce the relevant value for each document corresponding to the user preferences and personalization configurations.