G06F16/902

Method, apparatus and computer program product for generating tiered search index fields in a group-based communication platform

Methods, apparatus and computer program product for generating tiered search index fields based on a divided group-based communication data corpus in a group-based communication platform are described herein. In some embodiments, the system provides for receiving a group-based communication data corpus, generating a retrieval score, and assigning each group-based communication data object associated with a retrieval score. Each group-based communication data object may meet or exceed a retrieval score threshold of a high retrieval probability corpus. Each group-based communication data object associated with a retrieval score below the retrieval score threshold may be assigned to a low retrieval probability corpus. High and a low retrieval probability search index fields may be generated and associated with the high and low retrieval probability corpus.

CONTENT DEVELOPMENT DEVICE
20190212987 · 2019-07-11 ·

This content development apparatus includes at least one storage medium and at least one processor. The storage medium is configured to store a plurality of resource data pertaining to content being created; and store a database pertaining to the resource data. The processor is configured to execute a plurality of editing processes; generate first information created for each type of the resource data and at least including a location of each of the resource data, and second information expressing an association between different types of the first information; store the first and the second information in the at least one storage medium; respond to a request from one of the editing processes to acquire, using a designated resource data, information indicating a different type of the resource data associated with the designated resource data; notify the editing process; and update the database.

Method for flavor profile and nutrition values retention of customized dish recipe
12016365 · 2024-06-25 ·

The present invention provides a method of retaining the dish flavor profile and nutrition values, of customized dish recipes. The dish recipe customization might result in adding or removing one or more ingredients, changing the amount of one or more ingredients of the originally defined recipe, and may also involve changing the recipe or a dish flavor profile. The method also derives and assigns a flavor profile to a specific customized recipe.

METADATA ATTACHMENT TO STORAGE OBJECTS WITHIN OBJECT STORE

Techniques are provided for managing objects within an object store. An object is maintained within an object store. In an embodiment, a rule is enforced for the object that in-use slots of the object are non-modifiable and unused slots of the object are modifiable. Metadata of additional information for a slot within the object is attached to the object header. A first application allowed to access user data within the slot is provided access to the user data without being provided access to the metadata. A second application allowed access to the user data and the additional information is provided with access to the user data and the metadata for identifying a location of additional information within the object.

Delay propagation for multiple logic cells using correlation and coskewness of delays and slew rates in an integrated circuit design

A method as provided includes retrieving a correlation value from a correlation table and a coskewness value from a coskewness table. The correlation value includes a correlation between a delay distribution and a slew rate distribution, and is associated with both: an input slew rate and an output load, in a logic stage in an integrated circuit design, and the coskewness value is a coskewness between the delay distribution and the slew rate distribution. The method includes determining a partial derivative of a delay function relative to the input slew rate, determining a delay distribution for a signal through a plurality of logic stages using the correlation value, the coskewness value, and the partial derivative of the delay function relative to the input slew rate. The method also includes verifying that a statistical value of the delay distribution satisfies a desired performance value for an integrated circuit.

Tensor-based deep relevance model for search on online social networks

In one embodiment, a method includes receiving, from a client system associated with a user, a search query comprising a number of query terms, generating a query match-matrix for the search query, identifying a number of objects matching the search query, retrieving, for each identified object, an object match-matrix for the identified object, constructing, for each identified object, a three-dimensional tensor for the identified object, computing, for each identified object, a relevance score based on the tensor for the identified object, ranking the identified objects based on their respective relevance scores, and sending, to the first client system in response to the search query, instructions for generating a search-results interface for presentation to the user.

EFFICIENT TRICKLE UPDATES IN LARGE DATABASES USING PERSISTENT MEMORY

Systems, methods, and computer-readable media for storing data in a data storage system using a child table. In some examples, a trickle update to first data in a parent table is received at a data storage system storing the first data in the parent table. A child table storing second data can be created in persistent memory for the parent table. Subsequently the trickle update can be stored in the child table as part of the second data stored in the child table. The second data including the trickle update stored in the child table can be used to satisfy, at least in part, one or more data queries for the parent table using the child table.

PROCESSING A DATA SET

Embodiments relate to processing a data set stored in a computer system. In one aspect, a method of processing a data set stored in a computer system includes providing one or more parameters for quantifying data quality of the data set. A processor generates, for each parameter of the one or more parameters, a reference pattern indicating a dysfunctional behavior of the values of the parameter. The data set is processed to obtain values of the one or more parameters. A parameter of the one or more parameters is identified whose obtained values match a corresponding reference pattern of the generated reference patterns. The identified parameter is assigned a resource weight value indicating the amount of processing resources required to fix the dysfunctional behavior of the identified parameter.

Contextual dialogue framework over dynamic tables

Methods, systems, and computer program products for providing a contextual dialogue framework over dynamic tables are provided herein. A computer-implemented method includes maintaining a context space for a natural language conversation of a user, wherein the context space comprises a dynamic set of one or more tables used for processing at least one query of the natural language conversation; obtaining an additional table associated with an additional query of the natural language conversation; discovering one or more implicit links between the additional table and the dynamic set of tables; updating the context space with the one or more implicit links; and answering the additional query based at least in part on the updated context space.

Storage and retrieval of data from a bit vector search index

The technology described herein provides for storing and retrieving data in a bit vector search index. The bit vector search index stores data about terms from documents using bit vectors. Each bit vector comprises an array of bits and corresponds to a different set of terms. Each bit in the bit vector is used to represent whether a document includes at least one term from the set of terms. A band table is used to store bit vector configurations for bands of terms having similar term characteristics. Each term is indexed in the bit vector search index according to a bit vector configuration for a band to which it belongs. When identifying bit vector storage locations for terms, explicit mappings are used for some terms and ad hoc approaches used for other terms. Explicit mappings provide specific locations for terms, while ad hoc approaches use mapping algorithms assigned to bands.