Abstract: A method and apparatus for acquiring point of interest (POI) state information are suggested, which relate to a big data technology in the technical field of artificial intelligence. A specific implementation scheme involves: acquiring a text including POI information within a preset period from the Internet; and recognizing the text by using a pre-trained POI state recognition model, to obtain a two-tuple in the text, the two-tuple including a POI name and POI state information corresponding to the POI name.

Abstract: A method performs efficient data searches in a distributed computing system. The method may include, receiving a first key. The method may further include determining a hash map associated with the first key from among a plurality of hash maps. In some examples, the obtained hash map maps a partition of a set of keys to particular index values. The method may further include determining an index value associated with a second key using the determined hash map. The method may further include determining transaction processing data associated with the first key using the determined index value and providing the transaction processing data. Utilization of the plurality of hash maps may enable a data search to be performed using on-board memory of an electronic device of the distributed computing system.

Abstract: A clustering device includes a storage means configured to store a transposed file including array elements in a storage unit, the array elements storing a pair in which a cluster identifier and a first non-zero feature quantity of a mean feature vector are associated with each feature identifier, a calculation means configured to calculate a distance between the object feature vector in sparse representation indicating the object feature vector in a pair in which a second non-zero feature quantity of the object feature vector and a feature identifier of the second non-zero feature quantity are associated with each other, and the mean feature vector of each cluster, and an assignment means configured to assign the object feature vector to one of the plurality of clusters on the basis of the distance, and the calculation means calculates a product of a second non-zero feature quantity and a first non-zero feature quantity stored in an array element of an index based on a feature identifier corresponding to the

Abstract: In an aspect, a system for physiologically informed network searching, includes a computing device designed and configured to receive a biological extraction from a user, input the biological extraction to an index classifier, the index classifier configured to input biological extractions and output web search indices, wherein the classifier is generated by executing a classification algorithm clustering a plurality of user physiological data records to a plurality of user cohort labels, output, from the index classifier, a physiologically linked web index, receive, from the user, a search query, and generate, using the physiologically linked web index and the search query, a ranked search result.

Abstract: Systems and methods for extracting data views from heterogeneous data sources in accordance with embodiments of the invention are illustrated. One embodiment includes a method for extracting data views. The method includes steps for receiving data from several data sources and identifying raw fields from the received data. The process further includes steps for mapping the identified raw fields to common fields by determining similarities between a raw field and each of the common fields, identifying a target common field based on the determined similarities, and mapping the raw field to the target common field. The process further includes steps for extracting views of the received data based on the mapping of the identified raw fields to common fields.

Abstract: A storage device includes at least one processor. The at least one processor is configured to acquire a surface scan image in an image tile format of a set size, bind a set number of image tiles in one segment, and store a plurality of segments as files, respectively, instead of storing the image tiles without modification.

Abstract: The present specification discloses video matching. In a computer-implemented method, a plurality of feature vectors of a target video is obtained. A candidate video similar to the target video is retrieved from a video database based on the plurality of feature vectors of the target video. A time domain similarity matrix feature map is constructed between the target video and the candidate video based on the target video and the candidate video. Using the time domain similarity matrix feature map as an input into a deep learning detection model, a video segment matching the target video in the candidate video and a corresponding similarity is output.

Abstract: A method and system for enabling a user to hide or rename an item in a list of items. The user identifies an item or a set of related items and then designates whether to hide or rename the item(s). The hiding or renaming can be applied to printed lists or to lists displayed in online systems, or both. Various options exist for footnoting the hidden or renamed item, and for compensating for hidden items in printed lists. Original item data including date, description and other information are always retained in the database.

Abstract: The present disclosure relates to systems and methods for carrying out predictive analysis where a plurality of data sets may be ingested from a data lake. A data analyzer may tag the ingested data sets, detect redundant occurrence of multiple attributes such as, a row, a column, and a list in the tagged data set. The data analyzer may eliminate the detected redundant multiple attributes. Further, a model selector and evaluator may execute a machine learning (ML) model to conduct predictive analysis on the data set. The execution may be done based on a predefined set of instructions stored in a database. The executed ML model may be validated upon determining that the predictive analysis yields a positive response for the transformed data set.

Abstract: A system and method are presented that utilize facet modifications to alter user input values to perform a facet search on a found set of data records. The facet modifications are associated with item records, such as by using type attributes. Facet modifications can be associated with query information that is utilized to create a query on a user interface. Input received from the query is then modified according to the facet modifier in order to create facet search parameters. The facet search parameters are used to perform a facet search to narrow the found set of item records. In some embodiments, facet modifications are stored in facet modifier records. Multiple facet modifications can be stored in a single facet modifier record. A single query input can be manipulated by multiple facet modifications to create separate facet search parameters.

Abstract: Efficient tagging of content items using content embeddings are provided. In one technique, multiple content items are stored a content embedding for content item is stored. Entity names are also stored along with an entity name embedding for each entity name. For each content item, (1) multiple content embeddings that are associated with the content item are identified; (2) a subset of the entity names is identified; and (3) for each entity name in the subset, (i) an embedding of the entity name is identified, (ii) similarity measures are generated based on the entity name embedding and the multiple content embeddings, (iii), a distribution of the similarity measures is generated, (iv) feature values are generated based on the distribution, (v) the feature values are input into a machine-learned classifier, and (vi) based on output from the classifier, it is determined whether to associate the entity name with the content item.

Abstract: An embodiment for identifying and processing poly-process natural language queries may include receiving a natural language query. The embodiment may also automatically identify a bridge entity in the received natural language query. The embodiment may also automatically determine whether the received natural language query is a poly-process query. The embodiment may further include, in response to identifying that the received natural language query is the poly-process query, automatically generating sub-queries for each process in the poly-process query and generate results for each sub-query. The embodiment may also automatically combining the results of each sub-query using the bridge entity to output a combined result. The embodiment may further include automatically generating a modified sub-query for post-processing of the combined result. The embodiment may also automatically process the modified sub-query to generate a final query result for the received natural language query.

Abstract: The present disclosure relates to systems, methods, and computer-readable media for optimizing selection of a cached execution plan to use in processing a parametric query. For example, systems described herein involve training a plan selection model that makes use of machine learning to identify an execution plan from a set of pre-selected execution plans based on predicted cost of executing a query instance in accordance with the selected execution plan (e.g., relative to predicted costs of executing the query instance using other pre-selected execution plans). This application describes features related to lowering costs associated with selecting the execution plan in a way that will continue to be more accurate overtime based on training and refining the plan selection model.

Abstract: A system level search module receives system level search user interface registration information for an application of the computing device. The registration information includes an indication of how the system level search module can launch the application. The registration information is added to a registration store, and the application is included as one of one or more applications that can be searched using the system level search user interface.

Abstract: Embodiments include a computer-implemented method for storing comments received at a collaboration page of a content collaboration system in a hierarchical relationship that corresponds to the comments position in a comments field. The method can include receiving a comment at a user interface displaying the collaboration page and creating a thread identification string for the comment having a set of string portions. The method can also include obtaining a comment index file comprising an ordered list of previously-entered comments having respective thread identification strings, adding the comment and thread identification string to the ordered list of previously-entered comments at a location indicated by the thread identification string, designating a pagination of the ordered list of previously-entered comments in the comment index file in accordance with a fixed number of simultaneously viewable lines, and displaying a subset of the ordered list of previously-entered comments in the comment field.

Abstract: Sub-plans are executed in parallel using a plurality of execution nodes, which can be part of a data platform. In particular, various embodiments identify sub-plans (e.g., fragments or portions of one or more child operators) of a root operator in a query plan such that the identified sub-plans that are candidates for execution on a single execution node, determine a cost estimate for causing the candidate sub-plans to be executed in parallel using multiple execution nodes, and cause the candidate sub-plans to be executed in parallel based on the cost estimate.

Abstract: A query processing method including decomposing an SQL into logical plans based on data source feature information, to obtain a logical plan set, where the data source feature information is stored in an internal storage space of the query engine; generating physical plans for the logical plan set based on the data source feature information, to obtain a physical plan set; determining query costs of the physical plan set based on the data source feature information, to obtain a physical plan with a highest priority; and executing the physical plan with the highest priority, to obtain a query result queried by a user.

Abstract: Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, for providing suggestions within a document. In one aspect, a method includes obtaining textual input provided to a document editing application by a user device, the textual input being provided to the document editing application for inclusion in a document; identifying performance measures associated with the current editing session for the document, each performance measure being based on session data obtained from the user device during a document editing session, the session data being for the textual input and prior text that was included in the document prior to the textual input; providing the performance measures as input to a suggestion model that was trained using historical performance measures identified in performance logs for historical document editing sessions of users; and throttling textual suggestions during the current editing session based on the output of the suggestion model.

Abstract: In an example embodiment, a solution is provided that aggregates records as they are submitted to a third party (on the write path) rather than performing a real-time aggregation when a request is processed that needs the aggregation (read path). More particularly, in an example embodiment, a caching layer is introduced that avoids having to read all usage events to compute an aggregation when a request is received for aggregated data. The caching layer maintains values for various metrics that require aggregation.

Abstract: Systems and methods including one or more processors and one or more non-transitory media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to perform: storing one or more notifications in a data store; receiving a new notification; determining a respective number of notifications in each respective segment of a plurality of approximately equal segments; using the respective number of notifications in each respective segment of the plurality of approximately equal segments to determine a number of the one or more notifications; when the number of the one or more notifications is equal to or greater than a maximum number of notifications, removing at least one notification of the one or more notifications; and before or after removing the at least one notification, storing the new notification in the data store.