Abstract: A method and apparatus for different embodiments of probabilistic summary data structure based encoding for garbage collection are described. In one embodiment, a method comprises generating a probabilistic summary data structure that represents active blocks of data within a storage device based on identifications of the active blocks or the data within the active blocks. The method also includes performing garbage collection of at least a portion of the storage device based on the probabilistic summary data structure.
Abstract: A portable information processor (10) includes a storage unit (11) that stores information; a connecting unit (12) that connects to one of the device (1 (or 2)); an information acquiring unit (13) that acquires information from the connected device (1 (or 2)); an operation information generating unit (14) supplied with a driving power from a power source of the connected device (1 (or 2)) and generating operation information relating to the predetermined operation executable by the connected device (1 (or 2)) based on device identification information and the acquired information acquired by the information acquiring unit (13), and the information stored in the storage unit (11); and a control unit (15) that controls the connected device (1 (or 2)) based on the operation information generated by the operation information generating unit (14).
Abstract: A method and apparatus is provided for managing a plurality of devices in a federated network and a sub-network within the federated network. The devices in the sub-network may have a functional capability of performing a function associated with the federated network. For example, the federated network may include devices for providing data content such as media content and the sub-network may include devices for controlling the presentation of the data content. In addition, a constellation of devices is provided that may share data content such as media data. At least some of the devices in the constellation may form a sub-network.
Type:
Grant
Filed:
November 20, 2006
Date of Patent:
October 13, 2009
Assignee:
Microsoft Corporation
Inventors:
Ruston John David Panabaker, Eric Horvitz, Gregory Baribault, Michael Sinclair, Alexander Frank, Scott C. Forbes
Abstract: The present invention relates to searching content, particularly for at least one extract common to a first data file and a second data file.
Abstract: A software toolset includes a number of software modules that handle control and data communication within a web application server instance. An application programmatic interface (API) provides a common interface to communicate with the software modules in the toolset.
Type:
Grant
Filed:
December 30, 2005
Date of Patent:
September 8, 2009
Assignee:
SAP AG
Inventors:
Frank Kilian, Christian Fleischer, Oliver Luik
Abstract: A method of storing a data set on a storage device carrying a file of random data comprising the steps of: selecting, in dependence on a user input passphrase, a first location within the file of random data for storing a file index (FI); selecting a second location within the file of random data for storing the data set; encrypting the data set (D); storing the encrypted data set at the second selected location in the file of random data; making an entry in the file index in respect of the data set, the entry comprising an indication of the second selected location; encrypting the file index; and storing the encrypted file index at the first selected location in the file of random data. Also computer programs for carrying out such methods and storage devices arranged to operate using such methods.
Abstract: The method of indexing multimedia documents comprises the following steps: a) for each document identifying and extracting terms ti constituted by vectors characterizing properties of the; b) storing terms ti in a term base comprising P terms; c) determining a maximum number N of desired concepts that group together the most pertinent terms ti; d) calculating the matrix T of distances between the terms ti of the term base; e) decomposing the set P of terms ti of the term base into N portions Pj (1?j?N) such that P=P1? P2 . . . ? Pj . . .
Abstract: A file containing proprietary content can be protected against unauthorized duplication via file sharing between remote computers connected to an Internet swapping service. To this end, the content to be protected is searched on the Internet, at least the hash ID of each data record offered as a search hit is stored, this hash ID is linked to substitute content data, and queries of remote computers for the file to be protected are responded to by offering the modified data record.
Type:
Grant
Filed:
December 15, 2004
Date of Patent:
May 5, 2009
Assignee:
Arvato Digital Services GmbH
Inventors:
Mario Dzeko, Jens Maukisch, Sebastian Uhl
Abstract: A method for searching across instant message systems and an interconnecting server are disclosed. The method includes the steps of searching in a SIMPLE IM system by a WV-IMPS user, and searching in a WV-IMPS system by a SIMPLE IM user. The interconnecting server includes a message input/output module and a message processing and converting module. The technical solution of the present invention seamlessly connects the search services of the WV-IMPS instant message system and the SIMPLE instant message system, and thus solves the problem on interconnecting search functions between different types of instant message systems.