Abstract: Techniques to configure media packages are described. In one embodiment, an apparatus may comprise a client support component operative to receive search term information from a client device at a server device; and configure the client device with a selected one or more high-priority media items; a media server search component operative to transmit the search term information to a plurality of media servers; receive a plurality of media items from the plurality of media servers in response to the transmitting of the search term information to the plurality of media servers; and select the one or more high-priority media items from the plurality of media items based on priority weights; and a media item evaluation component operative to assign the priority weights to each of the plurality of media items. Other embodiments are described and claimed.

Abstract: A database server may include a master table schema that defines a database table's configuration and an arrangement for corresponding shadow tables. The shadow tables contain data related to contiguous and non-overlapping time periods and writing to the shadow tables occurs in a rotational fashion so that only one active table is written to at any point. The server may upgrade the master table schema. The server then may determine that a rotation event has occurred where a first shadow table is active and a second shadow table is associated with an oldest of the contiguous and non-overlapping time periods. In response, the server may delete data in the second table, determine that the schema has been upgraded since the second table was most recently active, upgrade the second table's schema to match the schema, and set the second table to active enabling writing to the second table.

Abstract: Embodiments of the present invention provide systems, methods, and computer storage media for latent summarization of a graph. Structural features can be captured from feature vectors associated with each node of the graph by applying base functions on the feature vectors and iteratively applying relational operators to successive feature matrices to derive deeper inductive relational functions that capture higher-order structural information in different subgraphs of increasing size (node separations). Heterogeneity can be summarized by performing capturing features in appropriate subgraphs (e.g., node-centric neighborhoods associated with each node type, edge direction, and/or edge type). Binning and/or dimensionality reduction can be applied to the resulting feature matrices.

Abstract: A method includes receiving, at an analysis server from a user device, a keyword associated with content of interest. The method includes retrieving, at the analysis server from a database, searchable tag data for first searchable tags in the database. Each searchable tag of the searchable tags corresponds to a segment of stored media content. The stored media content is associated with the user device. The first searchable tags pertain to the keyword. The searchable tag data includes an initial relevancy score and a corresponding aging factor for each first searchable tag of the first searchable tags. The method also includes generating, at the analysis server, a list of media content segments based on the searchable tag data and sending the list from the analysis server to the user device. The list is ordered based on the initial relevancy scores modified by the corresponding aging factors.

Abstract: A distributed search system can be partitioned into buckets based on entities and time periods. Addresses for the partitions can be formed from entity parameters and time period parameters. An indexing scheme for the partitions can be maintained at one or more search clusters, which may be geographically separate from one another. Consistency can be maintained across the search clusters though routing queries between clusters based at least in part on the status of partitions.

Abstract: A computer-implemented method, computer program product, and system are provided for providing a recommendation. The method includes receiving, by a conversation system, a query from a user. The method also includes inputting the query into an intent-entity model to obtain a first output. The method further includes inputting the query into a question-answering system to obtain a second output. The method additionally includes analyzing the first output from the intent-entity model to calculate a value of degree of ambiguity of the first output to the query. The method also includes analyzing the query and the second output from the question-answering system to calculate a value of extent of satisfaction to which the second output satisfies the query. The method further includes determining one or more recommendations using the degree of ambiguity and the extent of satisfaction. The method additionally includes outputting the one or more recommendations to the user.

Abstract: Aspects of the invention include a system, a computer program product and a computer-implemented method for building a relational database between a first term and a second term. An embedding management system is used to determine a first term set based on the first term and a second term set based on the second term. An entity linking engine and a knowledge base engine are used to determine a relation match for the first term set when a relation of the first term set relates to a term from a second term set and for determining a relation match for the second term set when a relation of the second term set relates to a term from a first term set. A relation ranking engine selects a relation for the relational database having a selected number of matches.

Abstract: Embodiments are directed to data ingestion over a network. Raw data and integrated data associated with a plurality of separate data sources may be provided such that the raw data includes content associated with a plurality of subjects. Categorization models may be employed to categorize the raw data based on various features, such as, format, structure, data source, variability, volume, or associated entities. Matching models may be determined based on the categorization of the of the raw data, the integrated data and the content associated with the plurality of subjects. Matching models may generate a plurality of unified facts based on the raw data and the integrated data such that each unified fact is associated with a score associated with a quality of its match with a unified schema.

Abstract: The disclosed computer-implemented method for classifying electronic files may include (i) identifying an electronic file that is being evaluated for importance by a file-categorization system, (ii) collecting, via at least one user-state monitoring device, information about a physical state of at least one user while the user is interacting with the electronic file, (iii) determining, based on the information about the physical state of the user while the user was interacting with the electronic file, whether the user considers the electronic file to be important, and (iv) classifying, by the file-categorization system and based at least in part on determining whether the user considers the electronic file to be important, the electronic file as an important file. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: Mechanisms are provided for processing sources of content in a corpus of information associated with a domain. The mechanisms ingest a plurality of sources of content in the corpus of information associated with the domain and determine at least one temporal category for the domain based on identification of frequently occurring references to at least one of temporal terms or time spans specified in the plurality of sources of content in the corpus of information associated with the domain. The mechanisms store the at least one temporal category for the domain in association with the domain and process queries applied to the plurality of sources of content in the corpus of information associated with the domain based on the stored at least one temporal category for the domain.

Abstract: A method and apparatus for pushing information. A specific implementation of the method includes: parsing page content browsed by a user to extract a keyword of the page content and determine a theme corresponding to the keyword; determining a preset keyword matching the keyword in a preset keyword collection; determining an associated keyword associated with the determined preset keyword based on a pre-established associated relationship of the preset keyword; and pushing information corresponding to the theme and/or the associated keyword to the user. This implementation implements targeted information push.

Abstract: Systems for synchronization of host and client log timestamps are provided. One system includes a timing module that acquires an initiator timestamp, wherein the initiator timestamp indicates a time on an initiating device associated with a computational activity performed between the initiating device and a receiving device. Additionally, the system includes a communication module that transmits the initiator timestamp to the receiving device. Also, the system includes a synchronization module that associates a receiver record of the computational activity on the receiving device with the initiator timestamp.

Abstract: A method and system for improving sensor triggered event presentation is provided. The method includes associating a sequence of sensor triggered events associated with a graphical presentation for an object and detecting that a user has accessed a structure associated with an entity. In response, automated sensors associated with the structure are enabled and specified events triggered by the user are detected. A modified graphical presentation associated with an original graphical presentation for the object is generated and presented to the user. An associated a notification is generated and transmitted to a vendor associated with the product.

Abstract: A system and method of generating a cleaned machine image. One example includes capturing used machine image data stored in a first boot volume to generate a set of captured machine image data and extracting at least a portion of the set of captured machine image data to the second volume to generate a cleaned machine image.

Abstract: A database system stores both compressed and uncompressed data in a row-based database system. The database system converts a representation of data involving a set of rows of a source database table, each row comprising multiple values, into a representation involving a single row stored in a target database table, each column of the row comprising arrays of values from the set. The database system may perform type-specific compression of data when storing in the target database table. Accordingly, the database system may apply different compression schemes for different columns or sets of values obtained from the source database table and may group or order selected rows or store additional summary information to improve query performance to the target database table. The database system allows users to query data stored in compressed form. The database system combines compressed and uncompressed data at query time for efficient database analytics.

Abstract: A system and a method are disclosed for searching and ranking molecules based on specificity. To this end, a processor receives a request to search for molecules that correspond to biological features, and generates a mapping of molecules to the biological features by searching publications for a reference to a biological feature in connection with a molecule, and responsively adding to the mapping any found references. The processor determines a respective specificity score for each respective molecule of the plurality of molecules by determining which of the plurality of biological features are mapped to each respective molecule, and for each such respective biological feature, in response to determining that there is not more than one concrete instance that is mapped to the respective molecule, incrementing the respective specificity score by a unit. The processor generates a ranking based on the respective specificity scores and outputs the ranking.

Abstract: Example embodiments describe a data storage method and system. For example, the method described, performed by one or more processors, may comprise in an application for enforcing one or more policies for reading and writing data to a database receiving, over a data network, instructions for performing a read or write request for data, and sending the read or write request to a transaction manager for providing transactions for a key-value store of the database, the request being in accordance with one or more policies to be enforced by the enforcing application. The method may also comprise receiving, from the transaction manager, a response message based on operations performed by the transaction manager in response to the read or write request.

Abstract: System and methods are provided for identifying, searching, collecting, locking, executing deleting, comparing and/or analyzing data from a plurality of computer devices and environments from a centralized interface. The endpoint computer devices utilize an agent to index data contained on each device and that allows for a distributed action model using simple or advanced analytics by authenticated users. The agent can be embedded in an integrated circuit of the endpoint computing device or otherwise stored in permanent read only memory (i.e., firmware). The system allows for one or more users to conduct actions via device indexes utilizing a centralized computing device for comparison and analyzation purposes.

Abstract: A method for an associative memory device includes dividing a multi-bit mantissa A of a number X to a plurality of smaller partial mantissas Aj, offline calculating a plurality of partial exponents F(Aj) for each possible value of each partial mantissa Aj and storing the plurality of partial exponents F(Aj) in a look up table (LUT) of the associative memory device. A system includes an associative memory array to store a plurality of partial mantissas Ai of a mantissa A of a number X and an exponent calculator to utilize the partial mantissas to compute e in the power of X.

Abstract: Application-aware database environments. A repository of previously received and registered database queries is maintained that includes at least corresponding metadata having information about an application generating the database queries. A subsequent database query and application metadata corresponding to the subsequent database query can be received. The repository to determine if the subsequent database query and application metadata match one of the previously received database queries and application metadata. A matching previously received database query is retrieved from the repository if a match is determined. The retrieved database query is executed.