Abstract: A system, method, and computer program product to find coalitions of receivers who collude to produce pirated protected content, then evaluates the confidence that particular members of each identified coalition are traitors versus innocent receivers incriminated by chance. Typically, each file in a group of original files is modified to include variations of critical file segments. The group of files is then broadcast with individualized codes that enable particular authorized receivers to properly process the modified files. The modifications in a pirated version of a file can identify which traitorous receivers contributed to its piracy. Candidate coalitions of differing size are first evaluated to determine if they cover observed file variations with greater than a predetermined likelihood that an innocent coalition is falsely incriminated by chance. Individual members of satisfactory coalitions are then evaluated. Traitors may be cryptographically revoked.

Abstract: A method, system, and computer program product for broadcast encryption key management. The invention eliminates the need for pre-specification of a maximum number of keys that can be employed in a given broadcast encryption system by enabling an initial key to be extended by a link key. New receiver devices are modified to validate the extended keys, while older devices ignore them and process initial keys as usual. Compromised link keys can be revoked, though revocation preferably uses a unique.

Abstract: A system and method for visualizing and navigating dynamic documents including data from an ongoing process and including instances of specified search terms. A summary view including a condensed abstract representation of a dynamic document provides a global overview of the distribution of search terms. The invention updates the document and aggregates the instances of search terms when the representation includes a nonlinear scale or uses multiple display regions having different resolution levels. The invention supports rapid skimming of dynamic documents and dynamic document collections, including enhancements triggered by cursor brushing, while keeping the user in context. Navigation to a segment of the dynamic document by selecting a corresponding portion of the summary view can replace the use of conventional scrolling techniques.

Abstract: A recorder system contains a media key block (MKB) and selectively writes protected content into a recording medium according to the following content protection logic, to combat theft of the protected content: If the medium does not have a MKB, then the recorder writes its stored MKB into the medium and writes protected content into the medium. If the medium has a MKB that is older than the stored MKB in the recorder, then the recorder writes its stored MKB into the medium before re-encrypting and writing protected content into the medium. If the medium has a MKB that is newer than the stored MKB, then the MKB in the medium is used for content protection. The recorder may store the newer MKB in non-volatile memory, effectively updating its previous stored MKB, so the recorder will have the most recently observed MKB for content protection use.

Abstract: A differential compression method and computer program product combines hash value techniques and suffix array techniques. The invention finds the best matches for every offset of the version file, with respect to a certain granularity and above a certain length threshold. The invention has two variations depending on block size choice. If the block size is kept fixed, the compression performance of the invention is similar to that of the greedy algorithm, without the expensive space and time requirements. If the block size is varied linearly with the reference file size, the invention can run in linear-time and constant-space. It has been shown empirically that the invention performs better than certain known differential compression algorithms in terms of compression and speed.

Abstract: A system, method, and computer program product to automatically eliminate the distribution information available for reconstruction from a disguised dataset. The invention flattens input numerical values into a substantially uniformly distributed dataset, then maps the uniformly distributed dataset into equivalent data in a target distribution. The invention allows the incremental encryption of new values in an encrypted database while leaving existing encrypted values unchanged. The flattening comprises (1) partitioning, (2) mapping, and (3) saving auxiliary information about the data processing, which is encrypted and not updated. The partitioning is MDL based, and includes a growth phase for dividing a space into fine partitions and a prune phase for merging some partitions together.

Abstract: A method, system, and computer program product to make query processing more robust in the face of optimization errors. The invention validates the statistics and assumptions used for compiling a query as the query is executed and, when necessary, progressively re-optimizes the query in mid-execution based on the knowledge learned during its partial execution. The invention selectively places a number of CHECK operators in a query execution plan to validate the optimizer's cardinality estimates against actual cardinalities. Errors beyond a threshold trigger re-optimization, and the optimizer decides whether the old plan is still optimal and whether to re-use previously computed results. The invention addresses arbitrary SQL queries whose plans can contain sub-queries, updates, trigger checking, and view maintenance operations.

Abstract: A system, method, and computer program product for processing a query spanning separate databases while revealing only minimal information beyond a query answer, by executing only specific information-limiting protocols according to query type.

Abstract: A system, method, and computer program product enabling individual user devices to authenticate and validate a digital message sent by a distribution center, without requiring transmissions to the distribution center. The center transmits the message with an appended modulus that is the product of two specially selected primes. The transmission also includes an appended authentication value that is based on an original message hash value, a new message hash value, and the modulus. The new message hash value is designed to be the center's public RSA key; a corresponding private RSA key is also computed. Individual user devices combine a digital signet, a public modulus, preferably unique hardware-based numbers, and an original message hash to compute a unique integrity value K. Subsequent messages are similarly processed to determine new integrity values K?, which equal K if and only if new messages originated from the center and have not been corrupted.

Abstract: A system and method for aggregating rankings from a plurality of ranking sources to generate a maximally consistent ranking by minimizing a distance measure. The ranking sources may be search engines executing queries on web pages that have been deliberately modified to cause an incorrect estimate of their relevance. The invention supports combining partial rankings.

Abstract: A system and method for visualizing and navigating document content using a condensed representation of a document to provide both a global overview of the distribution of key search terms as well as their immediate context. The invention supports rapid skimming of documents and document collections and enables efficient information finding, in some cases entirely eliminating the need to scroll within a document as with a conventional browser tool. The invention is of particular utility with personal digital assistants, which generally have small displays and limited storage capacity and communication bandwidth in comparison to personal computers. Documents may include conventional text and image files, web pages, audio files, and video files. The invention may also apply to collections of documents.

Abstract: A system and method for automatically generating a hierarchical table of contents or outline for indexing a document and identifying clusters of related information in the document. The document may comprise text, audio, video, or a multimedia presentation. The invention employs a unique and novel combination of latent semantic indexing techniques to identify related blocks and major topic changes within the document with scale space segmentation techniques to respectively identify self-similar blocks within the document and to thus find topic changes of various sizes at block edges. The invention then produces a visual presentation of the semantic structure of the document.

Abstract: A system, method and computer program product for enabling a user to detect nearby RFID tags and identify nearby RFID readers to enhance user privacy. A portable RFID reader scans for nearby tags, and a universal RFID tag detects nearby readers. The invention can alert the user of nearby RFID tags or readers, unless the user has disabled the alerting feature or unless a particular tag or reader is already known to the user and has been deemed allowable. A memory includes editable lists of allowable tags and readers. Exemplary alerts include outputs from a sound emitter, a vibrator, a light, or a display readout. The invention thus prevents surreptitious identification and tracking of a user and a user's possessions. The invention may be integrated into items typically carried by users so that the detection and alerting may be performed without outward indication.

Abstract: A method for storing XML documents in a relational database system while exploiting XML Schema information to capture information about types, inheritance, equivalence classes, and integrity constraints in the generated relational schema, enabling efficient querying. The invention simplifies complex XML schema types, translates the simplified XML schema types into relational tables, and then stores relations corresponding to each XML element in relational table rows. The simplification includes grouping all occurrences of a given element together, assembling two or more element types into element groups if the schema indicates that elements of those element types will occur the same number of times, and applying a number of transformation rules to the element groups. The translation includes constructing a type graph from the simplified schema, building an element graph for each global element in the simplified schema from the type graph, and generating relational tables from the element graph.

Abstract: A system, method, and computer program product for processing XML queries over relational data and meta-data using a relational database system. The invention runs a query to generate a view definition, so a regular query processor can handle queries on a mix of data and meta-data. Names of desired tables are data-dependent, so the invention represents a default XML view as an XML query over the relational tables, gets the table names and table data by recursively invoking the query processor (first by querying the catalog table, and then querying base data according to a new construct). The invention thus processes queries over table names in addition to table values.

Abstract: A method for publishing relational data as XML by translating XML queries into queries against an relational database. Conversion of the relational database into an XML database is not required. Each relational table is mapped to a virtual XML document, and XML queries are issued over these virtual documents. An XML query is parsed and transformed into a language-neutral intermediate representation, which is a sequence of operations describing how the output document is derived from the underlying relational tables. The intermediate representation is then translated into an SQL query over the underlying relational tables and into instructions for a tagger. The SQL query is executed, and the SQL query results are then fed into the tagger, which follows tagger instructions to generate the marked up output.

Abstract: The present invention discloses a method, a computer system, a computer readable medium and a sever. The method of the present invention comprises steps of; creating said document matrix from said documents using at least one attribute; creating a scaled residual matrix based on said document matrix using a predetermined function; executing singular value decomposition to obtain a basis vector corresponding to the largest singular value; re-constructing said residual matrix and scaling dynamically said re-constructed residual matrix to obtain another basis vector; repeating said singular value decomposition step to said re-constructing step to create a predetermined set of basis vector; and executing reduction of said document matrix to perform detection, retrieval and identification of said documents in said database.

Abstract: A system, method, and computer program product for a lease-based timeout scheme that addresses fencing's shortcomings. Unlike fencing, this scheme (or protocol) enables an isolated computer to realize it is disconnected from the distributed system and write its dirty data out to storage before its locks are stolen. In accordance with the invention, data consistency during a partition in a distributed system is ensured by establishing a lease based protocol between in the distributed system wherein a client can hold a lease with a server. The lease represents a contract between a client and a server in which the server promises to respect the client for a period of time. The server respects the contract even when it detects a partition between the client and itself.

Abstract: A method, apparatus, and article of manufacture for the incremental maintenance of summary tables with complex grouping expressions where the change (insert/delete/update) of a single row of the base data can affect multiple rows in the summary table. The invention applies the complex grouping expression to the raw delta, yielding a delta stream consisting of multiple (but distinct) grouping combinations. The invention then inserts/deletes/updates delta values into/from the existing summary table so that each grouping combination of the delta stream modifies its corresponding grouping combination in the summary table.

Abstract: A method and apparatus for detecting typing errors of critical fixed series of characters (digits) by using at least one redundant parity digit. The invention detects the most common typing errors that involve both permutations and incorrect striking of adjacent characters during data entry via a keyboard of an electronic apparatus. The method provides warning to the data input operator when incorrect data entry occurs and optionally automatically suspends entry thereof.