Abstract: Data processing apparatus comprising: a chunk store containing specimen data chunks, a manifest store containing a plurality of manifests, each of which represents at least a part of a data set and each of which comprises at least one reference to at least one of said specimen data chunks, a sparse chunk index containing information on only some specimen data chunks, the processor being operable to: process input data into input data chunks; identify manifests having at least one reference to one of said specimen data chunks that corresponds to one of said input data chunks and on which there is information contained in the sparse chunk index; and prioritize the identified manifests for subsequent operation.

Abstract: Embodiments of the present invention pertain to determining an approximate number of instances of an item for an organization. According to one embodiment, instances of items that reside on computer systems associated with the organization are determined. Instances of the same item can reside on different computers and an identification uniquely identifies an item. Random numbers are associated with identifications of the items. An approximate number of instances of the item is determined based on a highest random number associated with the item. The highest random number is the highest of the random numbers that were generated for the instances of the item.

Abstract: Provided is a method for creating sketches of sets to permit comparing set members selected from a universe. The method includes selecting a size for the sketch and providing a randomizer. In addition, a set is provided as a subset of the universe. The set is processed with the randomizer to provide a new vector. The new vector is normalized to provide a value. Dividing each element of the new vector by the determined value results in the sketch.

Abstract: A flash memory device is powered via an RF field generated by a host unit. A contactless communication channel is established between the flash memory device and the host unit. A first version of a data file, including a first plurality of data chunks, is downloaded from the flash memory device to the host unit. A second version of the data file, including a second plurality of data chunks, is generated at the host unit. Data chunk modifications to the first plurality of data chunks necessary to generate the second plurality of data chunks are identified at the host unit. The contactless communication channel is reestablished. The identified data chunk modifications to the first plurality of data chunks are performed thereby updating the first version of the data file stored on the flash memory device to the second version of the data file.

Abstract: Embodiments of the present invention relate to a system and method of document retention with policy-controlled deletion. Embodiments of the present invention comprise committing to a plurality of documents, deleting one of the plurality of documents, and providing a proof of authorized deletion of the one of the plurality of documents in response to an audit request.

Abstract: One embodiment of the present invention provides a distributed, differential electronic-data storage system that includes client computers, component data-storage systems, and a routing component. Client computers direct data objects to component data-storage systems within the distributed, differential electronic-data storage system. Component data-storage systems provide data storage for the distributed, differential electronic-data storage system. The routing component directs data objects, received from the clients computers, through logical bins to component data-storage systems by a compression-enhancing routing method.

Abstract: One embodiment of the present invention includes a method for routing a data object, comprising a sequence of data units, to a particular component data-storage system, or particular group of component data-storage systems, within a distributed, differential electronic-data storage system by selecting one or more subsequences of data units from the data object, computing a characteristic value from the selected subsequences, computing an index from the characteristic value; and directing the data object to the particular component data-storage system, or to the particular group component data-storage systems, identified by the computed index.

Abstract: An improved sliding window chunking apparatus and method comprising comparing a fingerprint value of each position in a data set to a second set of criteria, at least in instances when it doesn't satisfy a first set of criteria, and, if the value satisfies the second set of criteria, identifying the position as a potential breakpoint. Subsequently, if a fingerprint value that satisfies the first set of criteria is not found before a maximum chunk size is reached, the potential breakpoint can be designated as a breakpoint. Further improvement is possible by imposing minimum and maximum sizes on chunks. In some instances, more than two sets of criteria may be used to identify additional potential chunks to be used should subsets having fingerprint values satisfying either of the first two sets of criteria not be found.

Abstract: Surveillance technology particularly suited to continuous gathering of autobiographical data. Integrated into a portable construction are data collection mechanisms for capturing substantially all perceptual stimulus and acquirable digital data in the immediate vicinity of the system, a data integrator for correlating said autobiographical data, and memory for storing collected data. The unit comprises a programmable device for integrating all data captured into an integrated, content-retrievable format. Data editing formats are also suggested.

Abstract: A method and system for tracking hits of a requested network file includes embedding an instruction within the file that directs the requesting device to transmit an indicator to a processor for counting subsequent to the requesting device receiving the requested file. The request for the network file is made by a requesting device (e.g., client of an end-user) and may be made over the Internet. The instruction is executed by a Web browser at the requesting device. The instruction is embedded within the Internet file, so that if the file is cached by a proxy server, the instruction is also cached. Thus, the instruction will reach the end-user regardless of whether the file is downloaded from the proxy server or from an originating server. When the file reaches the end-user, the instruction triggers the transmission of the indicator that is send to the processor for counting.

Abstract: Data associated with at least one characteristic associated with the viability of a product is monitored. The data associated with the at least one characteristic is analyzed, and based on the analyzing, at least one future viability state condition of the product is predicted. At least one indicator is displayed related to the at least one future viability state condition.

Abstract: A data service system includes web servers, each servicing any access request received by the data service system. Duplicate application servers are also provided, each processing any request directed from any one of the web servers. A session state information managing system is provided to allow different application servers to process requests belonging to a single session without requiring the requests to carry their entire session state information. The managing system includes a session state information manager that, when called by an application server in processing a request, (1) provides the session state information of the request to the application server, and (2) generate a state reference for a new session state information for the request after the application server has processed the request and generated the new session state information. The managing system also includes a store that stores all session state information.

Abstract: A system and method is provided for determining characteristics of sets of organized items. In an illustrative implementation, a first set of organized items as a compare-from location is identified, and a second set of organized items as a compare-to location is also identified. In an illustrative operation, a recursive intrinsic reference representing the first set of organized items is determined so that the recursive intrinsic reference is an intrinsic reference to an item containing a second intrinsic reference. A discrepancy is determined between the first set of organized items and the second set of organized items using the recursive intrinsic reference.

Abstract: Embodiments of the present invention relate to a system and method of providing computer archive system accountability. In accordance with some embodiments of the present invention, the system and method may comprise receiving a plurality of documents and assigning document IDs to the plurality of documents, each of the document IDs corresponding to one of the received documents. Further, embodiments of the present invention may comprise building a hash-based directed acyclic graph (HDAG) specifying the received documents and their document IDs, the HDAG having a plurality of nodes, a root node, and a root hash, wherein the root hash depends on the HDAG and is a hash of the root node. Additionally, embodiments of the present invention may comprise making the root hash available, providing proofs that the received documents and document IDs are properly incorporated into the HDAG, and providing a copy of a particular document that corresponds to a given document ID on request.

Abstract: An improved sliding window chunking apparatus and method comprising comparing a fingerprint value of each position in a data set to a second set of criteria, at least in instances when it doesn't satisfy a first set of criteria, and, if the value satisfies the second set of criteria, identifying the position as a potential breakpoint. Subsequently, if a fingerprint value that satisfies the first set of criteria is not found before a maximum chunk size is reached, the potential breakpoint can be designated as a breakpoint. Further improvement is possible by imposing minimum and maximum sizes on chunks. In some instances, more than two sets of criteria may be used to identify additional potential chunks to be used should subsets having fingerprint values satisfying either of the first two sets of criteria not be found.

Abstract: The present invention is directed toward providing a system for monitoring events occurring on a networked browser while the browser is processing web page-based transactions and information, wherein the data from the monitoring process is sent to a computer other than the browser on which the transactions are executing and other than the computer from which the transaction was downloaded. Exemplary embodiments of the invention are directed toward a system and method for invoking a monitoring function on a network computer, including the steps of accessing a web page from a web server, updating the web page by inserting a script tag in the web page, wherein the script tag includes location information for a function for monitoring events on a network computer other than the web server, and storing the updated web page on the web server.

Abstract: Auxiliary, or external, information is used to assist in handling email addresses by allowing additional characterizations of the addresses. The additional characterizations can include geographical, organizational, temporal, and other types of information obtained, for example, from databases external to the email system. An email system can access information in a company's enterprise database to obtain organizational information such as names of people under a given manager, people in a specific building, people who have attended a meeting, etc. Characterizations can be used with traditional email information to create an email group, a search or sort filter, etc.

Abstract: A data service system includes a number of duplicate content servers that host a content file with a file name. Each of the content servers stores a version of the same content file that is referred to by a file reference. An updating engine is also provided that, when receiving an update of the content file, generates an updated version of the content file. A file name binding server is coupled to the updating engine and the content servers to generate a new file reference for the updated version of the content file. The file name binding server updates each of the content servers with the updated version by sending the new file reference to a binding table in each of the content servers. A content store is provided to store the updated version of the content file before it is fetched by a content server. Each of the content servers includes a binding table that stores the most recent file reference referenced by the file name of the content file.

Abstract: Data collection and display representative of at least one characteristic relevant to a viability product contained in a sealed package, via monitoring at least one characteristic associated with a state condition of said product. A viability state condition may be related to probability of degradation of the product. The monitoring may include analyzing data associated with at least one said characteristic and, based on said analyzing, determining at least one critical date of said product which may be displayed. When current state of viability can be predicted, freezing said display with said signal representative of an expiration or maturity state condition, or dynamically altering a display accordingly. Options for displaying a history of said characteristic may be provided.

Abstract: A method and an apparatus for matching elements within sets of trajectories, locations or other attributes without revealing the entire sets. The elements are partitioned into segments. A rotating selection is made among the sets and one segment of each potentially matching element is newly disclosed from the selected set. Optionally, the sets are cryptographically hashed, using, for example, a MD5 hash or a SHA-1 hash. Optionally, the sets are represented as tries, and successively lower levels within the tries are newly disclosed from potentially matching elements as the disclosing set rotates. Optionally, the sets are encoded, using: a grid of longitude and latitude; a spatial temporal grid; a overlapping spatial grid; a temporal grid; a set of cities; a set of countries; a set of names of places; or a set of attributes. Optionally, the matching process is repeated while refining the encoding. Optionally, negotiations determine what encoding or cryptographic hash is used.