Abstract: Embodiments of the present disclosure provide methods, apparatus, systems, computing devices, and computing entities for generating a comparison data value for each attribute of interest for one or more attributes of interest associated with a dataset. In one embodiment, a method is provided comprising: importing the dataset into a database environment; executing a SQL procedure to aggregate records in the dataset into attribute data items, wherein each item comprises an aggregate data value for each attribute of interest; and for each item: executing the SQL procedure to (1) generate a standardized data value for each attribute of interest based on the aggregate data value; (2) identify a cohort; (3) generate a statistical data value for each attribute of interest with respect to the cohort; and (4) generate the comparison data value for each attribute of interest based on a comparison between the standardized data value and the statistical data value.

Abstract: Disclosed herein is software technology that enables different accounts to be mirrored. In one aspect, the disclosed process may involve determining that an origin data record created under a first account of a first party is to be mirrored to a second account of a second party, generating a thread identification that is mapped to the data record created under the first account of the first party, and generating a first message that comprises data from the origin data record and the thread identifier that is mapped to the origin data record. Based on the first message, the disclosed process may further involve creating a target data record under a second account of a second party that corresponds to the origin data record created under the first account of the first party and storing the target data record under the second account of the second party.

Abstract: A method of updating a server knowledge graph, is performed by a server and includes obtaining a server knowledge graph of the server, and obtaining a plurality of device knowledge graphs by receiving a device knowledge graph from each of a plurality of devices. The method further includes generating a knowledge graph for server knowledge graph extension, based on the obtained plurality of device knowledge graphs, and updating the obtained server knowledge graph, using the generated knowledge graph for server knowledge graph extension.

Abstract: Multiple edits to a hierarchical data structure may be atomically applied. A request to perform modifications with respect to a portion or the entire hierarchical data structure may be received. A copy of the requested portion of the hierarchical data structure may be created separate from the hierarchical data structure. The portion of the hierarchical data structure may remain available for read access. Modifications may be applied to the copy of the portion of the hierarchical data structure. In response to a request to commit the modifications to the portion of the hierarchical data structure, the copy of the portion of the hierarchical data structure may atomically replace the portion of the hierarchical data structure.

Abstract: According to one aspect of the invention, there is provided a method for searching for documents containing mathematical expressions, the method comprising the steps of: dividing a first document containing mathematical expressions into a plurality of components; comparing the plurality of components with a plurality of other components extracted from a plurality of other documents, with reference to weights respectively assigned to the plurality of components according to types of the components; and determining a document associated with the first document among the plurality of other documents, with reference to a result of the comparison, wherein the weights are adaptively adjusted according to a result of the determination of the document associated with the first document.

Abstract: A dynamically self-indexing database-management system selects database indexes associated with table columns that are most frequently accessed by user queries, deleting all other indexes. The system periodically reviews database-performance figures and data-usage patterns for each table of its database and revises its selection of indexes in order to ensure that only the most frequently accessed columns continue to be indexed and that the omission of other indexes does not degrade performance. The total number of selected indexes, the overall percent of selected indexes, or the selection itself is optimized over time through continued monitoring of database transaction logs. Optimization may comprise cognitive analytics or other methods of artificial intelligence by which the system learns over time how to best determine whether its current selection of indexes is likely to provide the best overall performance.

Abstract: In a computerized information retrieval system: executing a search based on a query, to retrieve a set of tables ranked according to their relevancy to the query, wherein each of the tables includes one or more columns; selecting, from the retrieved tables, a predefined number of highest-ranking tables; scoring each column in the highest-ranking tables using a link analysis algorithm, and selecting, from the scored columns, a predefined number of highest-scoring columns; scoring terms contained within each of the highest-scoring columns, and selecting, from the scored terms, a predefined number of highest-scoring terms; re-ranking the highest-ranking tables by using the highest-scoring terms as pseudo relevance feedback that expands the query; and providing, as a response to the query, at least one of: the re-ranked tables, ordered according to the re-ranking, and data contained in at least one of the re-ranked tables, wherein the data are ordered according to the re-ranking.

Abstract: Systems and methods for searching for a media asset are described. In some aspects, the system includes control circuitry that receives a first search query from a user. The control circuitry identifies media assets related to the first search query from a content database. The control circuitry receives a second search query following the first search query. The control circuitry determines whether a media asset from the media assets is related to the second search query. In response to determining that less than a threshold number of media assets from the media assets are related to the second search query, the control circuitry transmits an instruction requesting the user to repeat the second search query. The control circuitry receives a third search query related to the first search query. The control circuitry determines a media asset from the media assets that is related to the third search query.

Abstract: A method of operating a telemetry system includes automatically populating a first set of fields in a schema of an event definition using a logging library of the telemetry system, and populating a second set of fields in the schema selected by an event author.

Abstract: In one example this disclosure describes a method that includes receiving, by a computing system, a first single character input from a user for a type down search. Responsive to the first single character input, sending, by the computing system, a plurality of asynchronous search requests to one or more data sources. Responsive to the plurality of asynchronous search requests, receiving, by the computing system, a first one or more data source search results from a first data source. Displaying, by the computing system, the one or more data source search results. Receiving, by the computing system, a second one or more data source search results from a second data source different from the first data source. And, updating, by the computing system and based on the received second one or more data source search results, the displayed one or more data source search results.

Abstract: A computer-implemented method includes analyzing a first dataset to extract metadata that corresponds to a first visualization; analyzing a second dataset to extract metadata; comparing the metadata of the datasets; deriving based on the comparing, a level of correlation between attributes of the datasets; establishing a score for each of the levels of correlation; determining that a first attribute of the first dataset and a first attribute of the second dataset are a match in response to the establishing of a score for the level of correlation of the first attributes of the datasets; determining that the datasets are related in response to the determining that the first attributes of the datasets are a match; and directing the displaying of a second visualization, the second visualization being a visual representation that includes data from the second dataset.

Abstract: Object transformation based on object groupings is disclosed. A plurality of first data objects are accessed, each first data object having a predetermined first format comprising a plurality of first data fields, and each first data object being associated with a particular object group of a plurality of object groups. For each object group, a corresponding transformation policy of a plurality of different transformation policies is selected. The transformation policy that corresponds to the respective object group is applied to the first data objects to generate a plurality of second data objects, each second data object having a predetermined second format comprising a plurality of second data fields, the predetermined second format being different from the predetermined first format.

Abstract: A method, a system, and a computer program product may be provided for updating map data in a map database to indicate presence of a road sign. The method may include obtaining first sensor data associated with a road sign. The first sensor data may comprise at least one of one or more first positive observations of a road sign or one or more first negative observations of the road sign. The method may further include obtaining second sensor data for the road sign, for example, based on the first sensor data. The second sensor data may comprise cumulative historic road sign observation data for time duration. The method may include determining a sign confidence ratio based on the first sensor data and the second sensor data. The method may include updating the map data based on the sign confidence ratio.

Abstract: A journaling engine receives input from a variety of sources to synthesize editable journal of experiences over a given date range. The engine uses application program interfaces to interface to a transaction database for cataloging experiences during an event. The engine further evaluates transactions to retrieve venue and activity information associated with the experiences. The user may edit the journal by adding or subtracting experiences. The final journal may be posted to social media by exporting the journal in an appropriate format. The user and those viewing the journal on social media may receive offers related to the experiences in the journal or similar experiences local to the user and viewers.

Abstract: An apparatus includes at least one processor configured to obtain a graph having vertices that represent items and edges that represent relationships between the items. The at least one processor is also configured to identify pairwise relatedness values associated with pairs of vertices. Each pairwise relatedness value is determined as a measure of diffusion on a space in the graph with a first vertex acting as a diffusion source and a boundary acting as a diffusion sink such that a diffusion density at a second vertex defines the pairwise relatedness value associated with the first and second vertices. The at least one processor is further configured to use the pairwise relatedness values as a measure of how the items associated with the pairs of vertices in the graph are related to one another. A boundary condition defines the boundary on the space in the graph around the diffusion source.

Abstract: Disclosed herein are systems and method for launching a new node in a blockchain network. In one exemplary aspect, the method may generate a snapshot of a node participating in a blockchain network and storing the snapshot in an archive, wherein the snapshot comprises a blockchain. The method may receive a request to create a new node to participate in the blockchain network. The method may retrieve, from the archive, the snapshot of the node in the blockchain network. The method may create the new node and load the snapshot onto the new node such that the blockchain comprised in the snapshot is imported without downloading or verifying the blocks of the blockchain individually. The method may then synchronize the new node with changes that occurred on the blockchain subsequent to the generation of the snapshot.

Abstract: Methods, systems, and computer-readable media are provided for collective reconciliation. In some implementations, a query is received, wherein the query is associated at least in part with a type of entity. One or more search results are generated based at least in part on the query. Previously generated data is retrieved associated with at least one search result of the one or more of search results, the data comprising one or more entity references in the at least one search result corresponding to the type of entity. The one or more entity references are ranked, and an entity result is selected from the one or more entity references based at least in part on the ranking. An answer to the query is provided based at least in part on the entity result.

Abstract: Techniques and mechanisms are disclosed that enable a data intake and query system to generate and cause display of circular timelines of timestamped event data. As used herein, a circular timeline generally refers to a graphical display of timestamped events stored by a data intake and query system, wherein the timestamped events may be displayed as arcs of one or more concentric circles and located in a circular timeline area according to a chronological ordering associated with the events. One or more display attributes of each arc may further depend on other data associated with the corresponding events. For example, each arc of a circular time may be displayed at a particular radial distance, with a particular thickness, using a particular shading and/or color, etc., depending on various data values associated with the one or more events represented by the arc.

Abstract: A resource exploitation management system, method and a computer program product therefor. A description of new geological evidence for a geological resource is received, e.g., as one or more triples describing the evidence. Keywords in the description are matched against keywords in representations in a geological resource database. Geological relations are inferred from the descriptions and matched against predefined geological relations from the geological resource database. Consistent triple matches are merged with the geological resource database. The confidence level for merged matches is updated in the geological resource database.

Abstract: A method of selecting content object tags for recommendation to a user includes having a taxonomy of tags for labeling content objects to be stored at a content hosting service; identifying a baseline subset of content objects based on a user context at the content hosting service; identifying a targeted subset of the baseline subset based on the user context; determining a tag score for each tag associated with the targeted subset of content objects; determining a maximum number of tags to be recommended to the user based on available space within a user interface of the user; selecting tags with the highest recommendation score from a number of different tag taxonomy branches, the number being no more than the maximum number; receiving tags selected by the user from among the recommended tags; and performing an operation on the content object corpus for the user context using the selected tags.