Abstract: Query service receives a query comprising at least a name component. The query service searches a document corpus to identify multiple passages, each comprising a mention of the name component within a selection of one or more documents of the document corpus. The query service collects bins, each bin comprising a distinct selection of the passages from the one or more documents, each of the bins identifying a separate relationship the name component participates in within the distinct selection of passages. The query service assesses a separate score of each respective bin reflecting the relevance of each respective bin to the query. The query service returns a response to the query with the bins each ranked according to each separate score.

Abstract: A system can include one or more processing modules and one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processing modules and perform receiving, from an electronic device, a search query from a user of a plurality of users; processing first data; and facilitating displaying a set of items. Processing the first data can comprise determining one or more keywords by capturing the one or more keywords during a time window; creating a feature set of second data associated with at least a portion of the plurality of users; determining a set of items of the item set as being based at least in part on an item vector representation and a keyword vector representation; determining a respective purchase probability associated with each item of the set of items of the item set; ranking the set of items.

Abstract: Embodiments for generating descriptions of entities are provided. A plurality of references to an entity within a corpus are identified. The corpus includes a plurality of documents. Descriptors for the entity are extracted from portions of the plurality of documents associated with the plurality of references to the entity. A score for each of the descriptors is calculated based on at least one of a location of the reference associated with the descriptor within the respective document and a location of the descriptor within the respective document. A description of the entity is generated utilizing at least some of the descriptors based on said calculated scores.

Abstract: A system is provided, which may comprise: a word vector database configured to store word vectors, each of the word vectors representing a word or a phrase; a text database configured to store text data; and a processor configured to: receive a user input including a first term; obtain, for each word vector that is stored in the word vector database and that represents a word or a phrase other than the first term, a similarity between that word vector and a word vector representing the first term; select at least one second term based on the obtained similarity; perform a search in the text database using the at least one second term as a query for the search; and provide results of the search.

Abstract: Embodiments of the present invention relate to a method, system and computer program product for compacting data in a distributed storage system. According to the method, a query request is received from a client, wherein the query request comprises information of a previous query request of the client. A first query result of the query request and a second query result of the previous query request are retrieved. A delta data and a first indicator are sent to the client in response to the first query result being different from the second query result, wherein the delta data is the data of the first query result excluding the data comprised in both first and second query results, and the first indicator indicates the data comprised in both the first and the second query results.

Abstract: A method for semantic search includes receiving a query vector including a semantic feature value for each of a plurality of semantic feature dimensions. A cluster is selected from a plurality of different candidate clusters held in a relatively fast memory, each candidate cluster including a plurality of compressed answer vectors. A subset of the plurality of compressed answer vectors are promoted as candidate answers. For each of the candidate answers, a corresponding uncompressed answer vector is retrieved from a relatively slower memory. A selected answer is promoted from among the candidate answers.

Abstract: In one aspect, there is provided a system. The system may store instructions that result in operations when executed by the at least one data processor. The operations may include receiving raw transactional data, collating, and reading the raw transactional data from the plurality of data sources. The operations may further include randomly sampling the raw transactional data. The operations may further include transforming the raw transactional data into at least one resilient distributed dataset. The operations may further include mapping the at least one resilient distributed dataset with a corresponding unique key. The operations may further include aggregating the at least one resilient distributed dataset on a key field. The operations may further include iterating over a lookup table. The operations may further include aggregating the data lines corresponding to the unique key associated with the at least one resilient distributed dataset.

Abstract: A method for resynchronizing data repositories in a high availability storage environment includes maintaining, in a first gateway server, a first journal that records operations that are performed for a first set of objects. The method further maintains, in a second gateway server, a second journal that records operations that are performed for a second set of objects. The method communicates, from the first gateway server to the second gateway server, any operations that are performed by the first gateway server for objects in the second set, so that these operations may be recorded in the second journal. The method further communicates, from the second gateway server to the first gateway server, any operations that are performed by the second gateway server for objects in the first set, so that these operations may be recorded in the first journal. A corresponding system and computer program product are also disclosed.

Abstract: An event processing system comprising a processor and a non-transitory computer readable medium coupled to the processor. The non-transitory computer readable medium stores computer-readable code executable to provide a domain-agnostic service for analyzing data and process heterogeneous events conforming to a plurality of schemas using the service. The domain-agnostic service comprises an adaptive data model and an adaptive processing model. The adaptive data model supports runtime event type discovery and event schema management that reacts to new schemas discovered at runtime. The adaptive processing model supports configurable partitioning of events by event type and time and is reactive to create new aggregations and analyses based on the propagation of new partitions.

Abstract: A method can include modeling a webpage as a random field. The random field can include an undirected graph including two or more nodes and one or more edges. A goodness function can be associated with one or more webpage elements. Each edge of the one or more edges can include a compatibility function based at least in part on the one or more goodness functions of two different nodes of the two or more nodes. The method also can include determining a probability of the webpage having exceeded a predetermined threshold based at least in part on one or more of the compatibility functions of the one or more edges. Other embodiments are disclosed.

Abstract: The present technology pertains to an organization directory hosted by a synchronized content management system. The corporate directory can provide access to user accounts for all members of the organization to all content items in the organization directory on the respective file systems of the members' client devices. Members can reach any content item at the same path as other members relative to the organization directory root on their respective client device. In some embodiments novel access permissions are granted to maintain path consistency.

Abstract: Certain aspects of the present disclosure provide techniques for determining content quality of a set of content item based on generating a score for each content item. An example technique includes using a trained content quality model to generate the score for each content item component. In such example, the model is trained using a calculated set of features associated with text and metadata of a content item in a training data set as well as a quality label for the content item. The model is trained by associating the set of features with the quality label for each content item in the training data.

Abstract: A method of structuring data in a virtual file system, includes using the file system to apply specific handling of data that represents genomic sequence information or information that is related to genomic sequences. The method also concerns portioning the data into a collection of storage devices that have different cost and performance characteristics, wherein the splitting policy is based on a cost model. The method is executable by employing a computing device functioning under software control.

Abstract: A plurality of memory maps may be allocated that represents the hash table on a memory device to store keys and values. The memory maps may comprise at least a primary map and a secondary map. A hash table operation may be performed on the primary map based on a first position computed using a first hash function, and if not successful, a bounded linear probing that probes a defined primary probe region in the primary map. Responsive to determining that the hash table operation on the primary map is not successful, the hash table operation may be performed on the secondary map based on a second position computed using a second hash function, and if not successful, a bounded linear probing that probes a defined secondary probe region in the secondary map.

Abstract: User-submitted content (e.g., stories) may be associated with descriptive metadata (intersection metadata), such as a timeframe, location, tags, and so on. The user-submitted content may be browed and/or searched using the descriptive metadata. Intersection criteria comprising a prevailing timeframe, a location, and/or other metadata criteria may be used to identify an intersection space comprising one or more stories. The stories may be ordered according to relative importance, which may be determined (at least in part) by comparing story metadata to the intersection criteria.

Abstract: An example operation may include one or more of connecting, by a feedback controller node, to a blockchain network configured to process transaction proposals through a plurality of endorser nodes connected to an orderer node, receiving, by the feedback controller node, reports from the orderer node that reflect performance of the plurality of the endorser nodes, assigning, by the feedback controller node, rankings to the plurality of the endorser nodes based on the reports, and ordering the transaction proposals to be executed by the plurality of the endorser nodes based on the assigned rankings.

Abstract: A computer-executed process receives an object that characterizes a navigation capability of a website. The object includes a navigation parameter that specifies a navigation page of the web site, and a query parameter that specifies a subset of content of the navigation page. The process also executes a script to dynamically generate a navigation structure based upon the object data. The process detects selection of a navigation component of the navigation structure, and updates an address in a Uniform Resource Locator (URL) bar of the browser with a composite resource identifier to retrieve a requested subset of content of the selected navigation page. The composite resource identifier includes a subordinate resource identifier that identifies the navigation page, which is derived from the navigation parameter and at least one query derived from the query parameter, which specifies the requested subset of content of the navigation page.

Abstract: Embodiments of the present invention describe an approve for ledger synchronization. Embodiments monitor conversations for keywords, and responsive to detecting the keywords, recording at least a portion of the conversations that includes the keywords. Additionally, embodiments store recorded conversation, based on the at least portion of the conversations that include the keywords, in a database, detect changes to ledgers, and determine authorization records is absent on the ledgers for the changes. Furthermore, embodiments, determine at least one of the stored conversations includes authorization records associated with the detected changes, retrieve the determined at least one of stored conversations, and synchronize the ledgers by creating a new block to the ledgers indicating authorization for the new block based on the determined at least one of stored conversations.

Abstract: Systems, methods, and non-transitory computer readable media are provided for managing expiration of modules. An expiry dataset may be maintained. The expiry dataset may include a set of identifiers corresponding to a set of modules, a set of expiry values for the set of modules, and a set of termination tasks for the set of modules. A request to refresh a module may be received from a client. Responsive to the reception of the request, an expiry value and a termination task for the module within the expiry dataset may be updated. The expiry value may be independent of a timestamp associated with the request.

Abstract: Systems, methods, and devices for tracking a series of changes to database data are disclosed. A method includes executing a transaction to modify data in a micro-partition of a table of a database by generating a new micro-partition that embodies the transaction. The method includes associating transaction data with the new micro-partition, wherein the transaction data comprises a timestamp when the transaction was fully executed, and further includes associating modification data with the new micro-partition that comprises an indication of one or more rows of the table that were modified by the transaction. The method includes joining the transaction data with the modification data to generate joined data and querying the joined data to determine a listing of intermediate modifications made to the table between a first timestamp and a second timestamp.