A model analyzer may receive a representative data set as input and select one of a plurality of analytic models to perform the analysis. Before deciding which model to use the model may be trained, and the trained model evaluated for accuracy. However, some models are known to behave poorly when the training data is distributed in a particular way. Thus, the cost of training a model and evaluating the trained model can be avoided by first analyzing the distribution of the representative data. Identifying the representative data distribution allows ruling out use of models for which the distribution of the representative data is unsuitable. Only models that may be compatible with the distribution of the representative data may be trained and evaluated for accuracy. The most accurate trained model whose accuracy meets an accuracy threshold may be selected to analyze subsequently received data related to the representative data.

An apparatus and computer implemented method that include obtaining, into a computer, text of a patent, automatically finding and extracting, using the computer, a set of claim text from the patent text, identifying, using the computer, text of independent claims from the set of claim text, displaying in a first row on a computer monitor the text of the independent claims, automatically determining a plurality of preliminary scope-concept phrases from the text of the independent claims, displaying in a second row on the computer monitor the text of the plurality of preliminary scope-concept phrases, eliciting and receiving user input to specify a first one of the plurality of preliminary scope-concepts phrases, and highlighting each occurrence of the specified first one of the plurality of preliminary scope-concept phrases in a plurality of the independent claims displayed in the first row. A scope concept builder tool is also provided.

A system, method, and computer-readable storage medium is provided for creating first and second blockchain instances, each comprising representative blocks corresponding to steps in first and second multistep processes, respectively; performing a linking operation to link a block in the first blockchain instance to a block in the second blockchain instance; receiving change evidence data pertaining to steps in one of the first and second multi-step processes; and performing an update operation comprising updating one of the first and second blockchain instances based on said change evidence data.

An apparatus, a method, and a computer program product for obtaining map update data of a region are provided. The method comprises determining an update candidate node, wherein the update candidate node is associated with a node identifier and a first node digest; sending the node identifier and the first node digest to an update data service; and receiving, from the update data service, a response containing one of node digests of the child nodes of the update candidate node at the update data service; or updated content corresponding to the update candidate node. The method may further include updating the map database based on the received response.

Method, apparatus and computer program product for detecting vulnerability and predicting maintenance in an industrial control system are described herein.

The present disclosure provides a method of reading data maintained in a tree data structure, such as B+ tree, using near data processing (NDP) in a cloud native database. According to embodiments, a desired LSN will be used in NDP page reads on the master computing node (e.g. master SQL node). When the master computing node (e.g. master SQL node) reads the regular page, the maximum desired LSN (e.g. the latest page version number) for that regular page will be used. Embodiments use features of the desired LSN and page locking, wherein correct versions of pages can be obtained by using the desired LSN associated with a page, in combination with page locking, and can enable the reading of a consistent tree structure and achieve good read/write concurrency.

A matching computer system for electronically generating, matching, and providing online user profiles, and determining a sharing score between the online user profiles is provided. The matching computer system may be configured to generate online user profiles associated with users of the systems. The matching computer system may be also configured to calculate a base score based upon the generated online user profile. Each base score represents a level of trustworthiness of each respective user. The matching computer system may be further configured to determine a sharing score between users based upon the base scores. Each sharing score represents a level of matching between the online user profiles.

Methods, systems and computer program products are provided for spoiler prevention. Media consumption applications may be placed in “spoiler-free” mode, for example, to prevent media content from spoiling first-hand user experience. A user may provide and/or authorize access to and use of spoiler prevention information. A user may request media content (e.g., while surfing the Internet). Digital media content to be presented to a user may be searched in real-time and/or pre-searched for spoiler content and/or associated spoiler indications relative to spoiler prevention information. Identified spoiler content may be concealed from users. A procedure may be provided for users to determine one or more reasons why content is concealed, to selectively reveal concealed content, and to provide feedback whether concealed content was or was not spoiler content for a user. Feedback may be used to improve spoiler prevention, for example, by retraining a machine learning model, which may be user-specific.

Systems and methods are described to address shortcomings in conventional conversation systems by executing a customized supplemental function for a natural language query based on the user's profile. In some aspects, the systems and methods receive a user query for a media asset, determine a query template in the user's profile matching the user's query, and identify and execute a supplemental function corresponding to the query template in addition to responding to the user's query. The user's profile is customized on the user's usage patterns of an interactive media guidance application. By monitoring the user's usage patterns and learning from the user's actions in conjunction with the user's natural language queries on which supplemental functions to execute, the interactive media guidance application may provide a smarter and more efficient user experience.

Methods, systems, apparatuses, and computer program products are described herein for the generation and traversal of a hierarchical index structure. The structure indexes search keys from data ingested from different data sources and enables efficient retrieval of the keys. As data is ingested, index nodes are generated at the lowest level of the structure. The nodes are analyzed to determine whether such nodes comprise duplicate keys. Responsive to doing so, a new index node is generated located at a higher level of the structure. This process results in a DAG comprising orphan nodes including different search keys. When processing a query for search keys, the orphan index nodes are initially analyzed for the keys. Upon finding a search key, its child nodes are recursively searched until location information specifying the location of ingested data in which the search key is located is found.