Abstract: An inner product if formed from an input signal and a hashing vector, to which a dither scalar is added. A binary digit is produced according to a quantization function, wherein the binary digit is zero or one, and wherein the quantization function is non-monotonic and subject to a sensitivity parameter. The steps are iterated while decreasing the sensitivity parameter until a termination condition is reached.

Abstract: A method, system, and article for compressing an input stream of uncompressed data. The input stream is divided into one or more data segments. A hash is applied to a first data segment, and an offset and length are associated with this first segment. This hash, together with the offset and length data for the first segment, is stored in a hash table. Thereafter, a subsequent segment within the input stream is evaluated and compared with all other hash entries in the hash table, and a reference is written to a prior hash for an identified duplicate segment. The reference includes a new offset location for the subsequent segment. Similarly, a new hash is applied to an identified non-duplicate segment, with the new hash and its corresponding offset stored in the hash table. A compressed output stream of data is created from the hash table retained on storage media.

Abstract: Disclosed herein are systems, computer-implemented methods, and tangible computer-readable media for representing media assets. The method includes receiving an original media asset and derivative versions of the original media asset and associated descriptors, determining a lineage to each derivative version that traces to the original media asset, generating a version history tree of the original media asset representing the lineage to each derivative version and associated descriptors from the original media asset, and presenting at least part of the version history tree to a user. In one aspect, the method further includes receiving a modification to one associated descriptor and updating associated descriptors for related derivative versions with the received modification. The original media asset and the derivative versions of the original media asset can share a common identifying mark.

Abstract: People are matched by obtaining, for a set of people, response information associated with previous matches the set of people have been a part of. For a person being matched, response information associated with previous matches the person being matched has been a part of is obtained. A match candidate is selected from a set of match candidates based at least in part on (1) the response information associated with the person being matched and (2) the response information associated with the set of people. Information associated with the selected match candidate is sent to the person being matched and/or information associated with the person being matched is sent to the selected match candidate.

Abstract: A value is computed for a feature in an instance of query content and compared to a threshold value. Based on the comparison, first and second bits in a hash value, which is derived from the query content feature, are determined. Conditional probability values are computed for the likelihood that quantized values of the first and the second bits equal corresponding quantized bit values of a target or reference feature value. The conditional probabilities are compared and a relative strength determined for the first and second bits, which directly corresponds to the conditional probability. The bit with the lowest bit strength is selected as the weakbit. The value of the weakbit is toggled to generate a variation of the query hash value. The query may be extended using the query hash value variation.

Abstract: Systems and methods for retrieving data within a linear grid management system are disclosed. Data having multiple dimensions is associated with physical locations, where a first dimension of the data is associated with a set of nodes and a second dimension of the data is associated with a set of memory storage locations. A received data query can be divided into multiple subqueries or data requests, such that each subquery is directed to a particular node identified by the first dimension of data referenced by the data query. When receiving a subquery, a node generates a unique and efficient parsing process to retrieve data from the memory storage locations identified by the second dimension of data referenced by the data query.

Abstract: The present invention provides a method and system for extending content based on the semantic meaning of content. It divides content into multiple content regions and finds words and/or phrases that are semantically relevant to the current content region and appends these words and/or phrases to the current content region as extended content. The extended content matches semantically with the original content in such a seamless way that users may think it is a part of the content.

Abstract: Disclosed is a system for, and method of, determining whether records and entity representations should be delinked. The system and method need no human interaction in order to calculate internal match scores by considering data associated with an entity representation and external match scores by considering data external to the entity representation. The system and method uses the internal match scores and external match scores to make the delinking decisions.

Abstract: The present invention enables the construction and deployment of semantic search engines, which learn. Here, the learning necessarily occurs in unsupervised mode given the huge amount of text being searched and the resultant impracticality of providing human feedback. That is, it acquires a lexicon of synonyms and the context for their proper application by searching a moving window of text and compiling the results. No human operator is involved. This allows for the practical search, using machine learning techniques, of very large textual bases.

Abstract: Systems and methods for presenting search results based on relevancy in an interactive media guidance application are disclosed. After performing a user-initiated or automatic search for media content, the interactive media guidance application determines which of the hits are most relevant to the user. The guidance application then displays, or visually identifies, the relevant items. Some embodiments employ using different display arrangements based on the number of relevant items. Some embodiments display the relevant items in recommendation lists or hot lists.

Abstract: This invention provides an information processing apparatus which shortens the memory access time and reduces the cost while ensuring data reliability. To accomplish this, the information processing apparatus shifts each write start timing so that data to be written in at least one memory is not influenced by noise during write when writing the same information in a plurality of memories. When reading data from a plurality of memories, the information processing apparatus compares the data with each other to estimate normal data.

Abstract: A method and system may receive time-series data of each of a plurality of real-time data streams from one or more sensors and create an electronic file based on the plurality of real-time data streams. The plurality of real-time data streams comprises a primary data stream, a low limit data stream, a high limit data stream, and a target value data stream. The electronic file includes a data portion and a metadata portion. The metadata portion of the electronic file comprises, for each of the plurality of data streams, one or more data stream identifiers, a time range, a source type, and a data type, and the data portion comprises the time-series data of each of the plurality of real-time data streams.

Abstract: Computer based systems, methods, software and databases are presented in which correlations between web item preferences and pangenetic (genetic and epigenetic) attributes of individuals are used for pangenetic based web item satisfaction prediction in which a user can request and receive online predictions of their satisfaction with web items that are based on the user's pangenetic makeup. Data masking can be used to maintain privacy of sensitive portions of the pangenetic data.

Abstract: A method for processing video data involves receiving data from a series of images and analyzing the data to identify geometric forms. The forms are stored as metadata of a first data level and are linked by time stamps to the images in which the forms were identified. The metadata from an image and the previous image are compared, and delta metadata is generated from the difference. Delta metadata is also marked with time stamps. Metadata and delta metadata are analyzed, and objects are extracted from the geometric forms. The objects are stored as time-stamped metadata and delta metadata of a second data level. The process is repeated for higher data levels. A user inputs a database query to identify from among the stored input images that particular image sequence in which the extracted object is recorded. Queries started at higher data levels are quicker but less accurate.

Abstract: Techniques for a rating system are described, including presenting a visual field including two or more axes, each axis representing a criterion associated with an asset, receiving a user rating associated with the asset, the user rating including a point on the visual field, and updating a presentation of the visual field to include the user rating. Further, techniques for spatial searching within the rating system are described, including presenting a visual field including two or more axes, each axis representing a criterion, receiving a search inquiry including a shape input on the visual field, searching assets in response to the search inquiry, and displaying a subset of the assets determined from the searching.

Abstract: The embodiments of the invention relate to method for image-based retrieval of an image or text, comprising capturing a digital image; matching the digital image against digitally-stored documents; and retrieving one or more of the digitally-stored documents that match the digital image. Other embodiments relate to a device for image-based retrieval and rendering, comprising an image capturing device for capturing digital image; a device for processing the digital image to match it against digitally-stored documents; a device for retrieving a digitally-stored document that matches the digital image; and a device for rendering the selected retrieved image.

Abstract: A plurality of catalogs are maintained, and wherein each catalog of the plurality of catalogs includes data sets and attributes of the data sets. An indication that a new data set is to be defined is received. A selected catalog is determined from the plurality of catalogs, wherein the selected catalog is suitable for including the new data set and attributes of the new data set. An entry that indicates a data set name corresponding to the new data set and an index to the selected catalog is inserted in a group table.

Abstract: A method comprising, defining a social network U={u, u?, . . . }, defining a set of relationships between users O?U×U, defining a set of attributes of the social network A={a1, a2, . . . }, defining a set of contacts of the user u, defining a user profile of the user u Iu=Au?Uu, defining a metric M={m1, m2, . . . }, receiving a rating of a metric of user u? from the user u, defining a condition c?C, defining a set of elements Z={z1, z2, . . . }, receiving a request for access to Iu from user u?, determining authorization for user u? to access a subset of Iu by an access control function U×U×Pow(R)×C?Pow(Iu×Z), and outputting a subset of Iu to user u? as determined by the access control function.

Abstract: A system and method for utilizing data mining to generate a policy document or to revise theory within a policy document. A data base of unknown events is mined for application to the development of a system management policy document. The results of the data mining of the database of unknown events are automatically incorporated into a policy document, subject to user approval, to produce a new policy document or an updated version of an existing policy document.

Abstract: The invention makes use of a single data structure to define all of the information and parameters necessary for the efficient sharing and exchange of entire or partial BI applications. The invention enables a user to capture preferences that are applicable to both ends of the exchange, namely the source and the target systems. It provides for users to be presented with a comprehensive list of preferences and smart defaults from which they can select, and in some cases override, at both the source and target end points of the exchange. The actual metadata exchange is persisted as an exchange structure in a computer system file system called an exchange archive.