Abstract:
PROBLEM TO BE SOLVED: To reproduce a play list by simplified user bidirectional type creation, and to reproduce MP3 by navigation. SOLUTION: In sequentially playing a first play list of a sequence of a plurality of stored MP3 files, arranged according to a selected attribute of the files, there is provided a combination of a means enabling a user to branch selectively at a selected MP3 file departure node in the sequence, to sequentially play a second play list of a sequence of a plurality of the stored MP3 files, arranged according to an attribute different from the selected attribute, together with a means for storing the departure node; and a means for enabling the user to return to the departure node to continue the playing of the first play list from the departure node. COPYRIGHT: (C)2008,JPO&INPIT
Abstract:
A set of program elements (e.g., transcoders) are grouped together as an administrative unit. Instead of caching the individual outputs of each program element, preferabl y only the aggregate output of the set of program elements, taken as a whole, is cached. The inventive technique enables the effective re-use of intermediate content. In an illustrative client-server based implementation involving a transcoding service located at a server, the cach ed information may be shared across multiple server instances to obviate redundant processing. With the present invention, a caching mechanism in a complex software system may be extended in a user-configurable manner by setting up optimal intermediate caching points that are defined by groups of programs used in long computations.
Abstract:
Upon receiving a request for a document, recipient- specific identifying information for the requester is secured, including at least the TCP/IP address(es) of the client being utilized by the requester and the proxy, if any, transmitting the request from the client, and optionally including client authentication information such as userid and password or HTTP request header information such as authorization header information, "From" header information, proxy-authorization information, and user-agent header information. The recipient-specific identifying information is then compared to a watermark database for the requested document. If a match is found, the associated unique watermark is retrieved from the database. If no match is found, a unique watermark is generated for the document and associated with the recipient-specific identifying information in a new entry within the watermark database for the document. The watermark is employed to generate a uniquely watermarked version of the requested document, with the watermarked version being returned in response to the request. Subsequently, when an infringing copy of the document is located, the infringing copy is compared to the original, unwatermarked version of the document to extract the watermark. The extracted watermark is then looked up in the watermark database for the document to determine the "original" copyright infringer, and the associated recipient identifying information is retrieved.