Abstract: A data transformation apparatus selects items one by one and generates a first weight dataset and a second weight dataset on the basis of similarity between first records in a first dataset and second records in a second datasets. The first records and second records respectively include first item values and second item values that belong to the selected item. Based on the first weight dataset, the data transformation apparatus transforms the first dataset into a first similarity-determining dataset including third records. Each third record includes a numerical value that indicates a relationship between transformed item values belonging to different items. Further, based on the second weight dataset, the data transformation apparatus transforms the second dataset into a second similarity-determining dataset including fourth records. Each fourth record includes a numerical value that indicates a relationship between transformed item values belonging to different items.

Abstract: A media system that is accessible over a network, which includes a user interface module implemented by a server computer and accessible by a plurality of user computers operated by a plurality of users over the network and is operative to respond to user requests for web pages or other selections of content, where user inputs of one or more collections can be obtained.

Abstract: Techniques and system configurations for identifying search recall activities and performing changes to search criteria based on streaming event data are disclosed. In an example, electronic operations used for identifying search recall scenarios based on streaming events in a user interface include: obtaining a plurality of streaming events that represent user interaction from a user interface sessions, from inputs that are used to locate and select items; identifying search recall scenarios from the events based on vicinity and exposure, where the items are not retrieved by initial searches; determining changes to selection criteria, to locate and select the items; and updating the selection criteria such that subsequent searches are configured to locate the items using the updated search criteria. With this technique, search data and rules such as exclusion and inclusion lists or category/product information rules may be automatically updated to successfully locate product items in subsequent searches.

Abstract: A method includes receiving Resource Description Framework (RDF) data to be stored; obtaining triplet information including at least a resource name of the resource, attribute of the resource, and attribute value of the resource represented by the RDF data; obtaining from the RDF data a first namespace usable in a resource name of the resource; searching for a resource identification corresponding to a resource name and first namespace of the resource; obtaining from the RDF data a second namespace usable by the attribute of the resource; searching for the attribute identification corresponding to the attribute of the resource and the second namespace; and storing the triplet information, the resource name of a specific resource being represented by a resource identification and the attribute of the specific resource being represented by an attribute identification. Using an embodiment, it is possible to reduce the storage of redundant data, thereby saving storage space.

Abstract: A system, computer program product, and computer-executable method for managing replication from a production site to a target site, wherein both the production site and the target site are content addressable data storage systems, the system, computer program product, and computer-executable method including processing a replication session from the production site to the target site, collecting information related to the replication session from the production site to the target site, analyzing the information to determine whether to change the processing of the replication session, upon a positive determination, modifying the processing of the replication session.

Abstract: Systems and methods are disclosed herein for resolving a meaning of an ambiguous calendar entry and recommending broadcast media based on the meaning. To this end, a media guidance application may detect a calendar entry specific to a user, and determine that the calendar entry is ambiguous with respect to an associated period of time. In response to determining that the calendar entry is ambiguous with respect to the associated period of time, the media guidance application may determine characteristics of the calendar entry and the user, and compute an estimated range of time corresponding to the calendar entry based on the characteristic of the calendar entry and the characteristic of the user. The media guidance application may then generate for display a recommendation of broadcast media based on the estimated range of time.

Abstract: One embodiment provides a computer implemented method of data identification within a deduplication storage system, the method comprising processing multiple units of a segment of data within the deduplication storage system using a fingerprint generation algorithm; storing the internal state generated while processing the multiple units of the segment of data; generating a first fingerprint for the segment of data based on the internal state; reloading the internal state after generating the first fingerprint for the segment of data; and generating a second fingerprint for the segment of data based on a transformed unit of the segment of data.

Abstract: Methods and a system are provided for accelerating an operation in a B+-tree. A method including forming triplets, by a triplet manager. Each of the triplets includes a pointer to a leaf node, a lower bound of a key on the leaf node, and an upper bound of the key on the leaf node. The method further includes performing, by the triplet manager, a lookup operation on the triplets responsive to the operation to avoid traversals of intermediate nodes for the operation. The method also includes executing, by a processor, the operation in the B+-tree while avoiding the traversals of the intermediate nodes for the operation responsive to a result of the lookup operation. The operation is any one of an insertion operation, a deletion operation, and a search operation.

Abstract: An electronic-discovery system and method, wherein content items and hold anchors are stored in a repository, tracking objects and representational anchor objects are stored in a database system, and the tracking objects represent the content items and the representational anchor objects represent the hold anchors. A first hold anchor is used for placing a hold on the content items for a first defined period of time, and a first representational anchor object and one or more of the tracking objects are used for representing and tracking the holds for the first defined period of time. When the first defined period of time expires, a second hold anchor is used for placing the hold on the content items for a second defined period of time, and a second representational anchor object and the tracking objects are used for representing and tracking the holds for the second defined period of time.

Abstract: Disclosed are various examples for downloading data objects by enforcing a threshold amount of allocated data. A file sync application determines which data objects to download to the client device such that the total amount of downloaded data meets or falls below the threshold amount of allocated data. File system entries for undownloaded data objects are also downloaded and stored in a file system of the client device. If a process attempts to access an undownloaded data object, the file sync application downloads the data object and evicts another data object, if necessary, according to the threshold amount of allocated data.

Abstract: Disclosed subject matter relates to virtual assistance that includes a method and system for automatically generating response to a user query without language constraints. A response generating system receives the user query from a computing device associated with an end user and determines whether the user query belongs to at least one domain to determine goal data and a problem category of the user query. Further, a problem node associated with the user query is detected from problem nodes by parsing a predefined knowledge graph based on the goal data and the problem category. Furthermore, questions are provided based on problem sub-nodes of the problem node to the computing device to receive a feedback. The response to the user query extracted from the one of the problem sub-nodes is displayed to the end user based on the feedback. The present disclosure is highly scalable, reusable and requires minimal human supervision.

Abstract: A waveform simulation system with a waveform database architecture satisfies different requirements of different waveform simulation tools. The waveform simulation system includes a waveform database configured to store one or more mappings that map one or more design objects to one or more memory addresses. The waveform simulation system also includes a packet processing module configured to receive simulation data from a simulation tool. The packet processing module is configured to translate the simulation data into translated simulation data that is independent of implementation details of the one or more design objects, based at least in part on the one or more mappings. In some cases, the translated simulation data may include event data stored in the waveform database.

Abstract: A remote storage digital video recording system (300) comprises a storage server (310). The storage server can include a memory (412) and a control circuit (410) operable with the memory. The storage server can be in communication across a network (311) with one or more client devices (306,307,308). The control circuit can be configured to create a file allocation table (314) to organize clusters (330) of a computer readable medium (308). The file allocation table can include a plurality of distinguishable file entries (320,321,322). Each of the distinguishable file entries can index clusters of the computer readable medium. At least two of the plurality of distinguishable file entries can index selfsame clusters (331) of the computer readable medium.

Abstract: A method and apparatus of a device that indexes donatable content from a network site is described. In an exemplary embodiment, the device receives a requested document, where the requested document includes a plurality of tags. In addition, the device detects a donatable tag in the plurality tags that indicates the network site includes donatable content. In response to the detecting, the device sends a request for the donatable content to the network site. Furthermore, the device receives the donatable content from the network site. The device additionally indexes the donatable content into an on-device search index, where at least some of the index donatable content is further returned as a search result for an on-device search.

Abstract: Systems and methods for identifying relevancy scores of a keyword cluster related to an event category for a given time period relative to an event of the event category. Processors identify an event and determine event parameters of the event. Processors determine keyword clusters associated with the event parameters for serving content. Processors generate a relevancy score for each of the keyword clusters over plurality of time periods relative to the event. The relevancy score of a first subset of the keyword clusters is higher during a first time period than a second time period and the relevancy score of a second subset of the keyword clusters is higher during the second time period than the first time period. Processors create, for the event, a data structure including the keyword clusters and the generated relevancy scores for each of the keyword clusters over the time periods relative to the event.

Abstract: The described embodiments set forth techniques for managing the fragmentation of files at a computing device. Specifically, the techniques involve, for a given file, analyzing different extents of the file under a “segment window” basis to identify whether a fragmentation threshold is satisfied between the extents that correspond to the scope of the segment window. In turn, for each segment window that satisfies the threshold level of fragmentation, (1) the data for the extents is copied into an allocated area of contiguous memory, and (2) the extents are updated to reference the copied data. Additionally, the original data referred to by the extents can be freed for usage within the computing device, thereby increasing storage space. In this manner, the overall fragmentation of the file is substantially reduced under the segment window basis, thereby improving the overall performance of the computing device.

Abstract: Methods, systems, and apparatus, including computer programs encoded on computer storage media, for generating answers to answer-seeking queries. One of the methods includes receiving a query having multiple terms. The query is classified as an answer-seeking query of a particular question type, and one or more answer types associated with the particular question type are obtained. Search results satisfying the query are obtained, and a respective score is computed for each of one or more passages of text occurring in each document identified by the search results, wherein the score for each passage of text is based on how many of the one or more answer types match the passage of text. A presentation that includes information from one or more of the passages of text selected based on the respective score is provided in response to the query.

Abstract: Method and system for identifying and analysing hidden relationships in application databases is provided. During a database session database query language statements (DQLS) are retrieved from log tables in application databases to analyze and identify join indicators. Join indicators represent data fields from two or more tables which are joined using values common to each data field. Based on identified join indicators, data definition language (DDL) file is generated including relationship between two or more tables. Above steps are repeated until all DQLS in log tables are analyzed. Thereafter it is ascertained if content of created DDL file is defined in database schema (DS). DS is represented in physical data models of application databases. If it is not defined in the database schema, a logical data definition language file is generated based on generated DDL file to update logical data model, which represents hidden relationships between tables in application databases.

Abstract: Systems and methods for writing updates to and/or reading previously stored updates of assets that are implemented as smart contracts on a decentralized database are disclosed. Exemplary implementations may: receive a first request, from a first client computing device associated with a first user, to write a first update to an individual asset, or to read one or more previously stored updates; transfer the first request to the decentralized database; responsive to transferring the first request, receive the first reference from the decentralized database; generate a second file and a second reference; store the second file on the content-addressable file system; and record the second reference in the state of the individual asset on the decentralized database.

Abstract: Systems and methods are provided that allow client programs using APIs for accessing local DB2 databases to access DB2 systems on remote logical partitions and remote zSeries mainframes rather than from a local DB2 system. For example, a method may include intercepting a DB2 request using a documented API for accessing local DB2 databases from a client program executing on a source mainframe system. The method may also include selecting a destination mainframe system and sending a buffer including information from the request from the source mainframe system to the destination mainframe system and establishing, at the destination mainframe system, a DB2 connection with the DB2 system from the request. The method may further include receiving a response from the DB2 system, sending a buffer having information from the response from the destination mainframe system to the source mainframe system, and providing the information to the client program.