Abstract: A query is for retrieving a data item of a data graph. The data graph stores representations of the data item. Each representation stores information represented by the data item in a different manner or way. Sub-queries for the query each correspond to a different representation in which the data graph stores the data item. The sub-queries are evaluated to determine an appropriate representation of the data item in satisfaction or fulfillment of the query.

Abstract: Sub-queries for a query are determined. The query is for retrieving a data item of a data graph. The data graph stores representations of the data item. Each representation of the data item stores knowledge represented by the data item in a different way or manner. Each sub-query corresponds to a different representation by which the data graph stores the data item. The sub-queries are evaluated to determine an appropriate representation of the data item in fulfillment of the query without duplicatively traversing the data graph, such as by reusing evaluation results of the sub-queries that overlap one another.

Abstract: Sub-queries for a query are ordered. The query is for retrieving a data item of a data graph. The data graph stores representations of the data item. Each representation stores information represented by the data item in a different manner or way. Each sub-query corresponds to a different representation in which the data graph stores the data item. The sub-queries are ordered in an ordered list according to likelihood that evaluation thereof will yield an appropriate or selected representation of the data item that is correct for the query and that correctly answers the query. The sub-queries within the ordered list are evaluated on a sub-query by sub-query basis, until the data item has been retrieved.

Abstract: A method is provided for analyzing log message content. The computer-implemented method may include detecting, by at least one processor, log messages in an application code, identifying a log level assigned to each of the log messages, and performing natural language processing (NLP) analysis on each of the log messages by using at least keyword and synonym matching percentage analysis criteria. The computer-implemented method may further include determining, in response to the NLP analysis, a severity score of each of the log messages, and reclassifying, based on the severity score, the assigned log level of one or more of the log messages to a different log level.

Abstract: A search engine is enhanced to employ user preferences to customize answer output by, receiving a first plurality of candidate answers and weights to a first search query for a first user from a first stage of a non-semantic search engine routing and processing path; augmenting the weights for the plurality of candidate answers according to a set of preference coefficients according to a first set of preferences for the first user; selecting one or more of the first plurality of candidate answers according to the augmented weights; and producing an output including the selected one or more candidate answers.

Abstract: Sub-queries for a query are determined. The query is for retrieving a data item of a data graph. The data graph stores representations of the data item. Each representation of the data item stores knowledge represented by the data item in a different way or manner. Each sub-query corresponds to a different representation by which the data graph stores the data item. The sub-queries are evaluated to determine an appropriate representation of the data item in fulfillment of the query without duplicatively traversing the data graph, such as by reusing evaluation results of the sub-queries that overlap one another.

Abstract: Sub-queries for a query are determined. The query is for retrieving a data item of a data graph. The data graph stores representations of the data item. Each representation of the data item stores knowledge represented by the data item in a different way or manner. Each sub-query corresponds to a different representation by which the data graph stores the data item. The sub-queries are evaluated to determine an appropriate representation of the data item in fulfillment of the query without duplicatively traversing the data graph, such as by reusing evaluation results of the sub-queries that overlap one another.

Abstract: Systems and methods for preventing vulnerabilities in a blockchain due to quiescence are disclosed including submitting a first crosslink transaction for addition to a first blockchain that includes cross-referencing information for a second crosslink transaction that corresponds to the first crosslink transaction and submitting the second crosslink transaction for addition to a second blockchain that includes cross-referencing information corresponding to the first crosslink transaction. The first and second crosslink transactions are configured to be usable together by a user of at least one of the first and second blockchains to validate at least a portion of one of the first and second blockchains after a period of quiescence in the one of the first and second blockchains.

Abstract: An approach is provided to identify permanence data corresponding to terms included in a corpus of a question answering (QA) system. Based on the identified permanence, a time-based confidence of each of the terms is established. Terms are identified as a plurality of candidate answers to a question posed to the QA system. Each of the plurality of candidate answers are scored with the scoring being at least partially based on the time-based confidence established for each of the terms.

Abstract: A method is provided for analyzing log message content. The computer-implemented method may include detecting, by at least one processor, log messages in an application code, identifying a log level assigned to each of the log messages, and performing natural language processing (NLP) analysis on each of the log messages by using at least keyword and synonym matching percentage analysis criteria. The computer-implemented method may further include determining, in response to the NLP analysis, a severity score of each of the log messages, and reclassifying, based on the severity score, the assigned log level of one or more of the log messages to a different log level.

Abstract: An approach is provided to identify permanence data corresponding to terms included in a corpus of a question answering (QA) system. Based on the identified permanence, a time-based confidence of each of the terms is established. Terms are identified as a plurality of candidate answers to a question posed to the QA system. Each of the plurality of candidate answers are scored with the scoring being at least partially based on the time-based confidence established for each of the terms.

Abstract: A method is provided for analyzing log message content. The computer-implemented method may include detecting, by at least one processor, log messages in an application code, identifying a log level assigned to each of the log messages, and performing natural language processing (NLP) analysis on each of the log messages by using at least keyword and synonym matching percentage analysis criteria. The computer-implemented method may further include determining, in response to the NLP analysis, a severity score of each of the log messages, and reclassifying, based on the severity score, the assigned log level of one or more of the log messages to a different log level.

Abstract: An approach is provided in which a knowledge manager trains a machine-learning model and generates a hyperplane based upon a first set of labeled feature vectors. The knowledge manager computes, relative to the hyperplane, a first distribution of a first set of feature vectors corresponding to a first set of source documents. Subsequently, the knowledge manager computes, relative to the hyperplane, a second distribution of a second set of feature vectors corresponding to a second group of source documents. The knowledge manager, in turn, generates an indicator to retrain the machine-learning model in response to determining that a distribution difference between the second distribution and the first distribution reaches a distribution difference threshold.

Abstract: A mechanism is provided in a data processing system for aggregating sentiment about an entity from a corpus of documents. The mechanism identifies a plurality of sentiment passages in the corpus of documents. Each of the plurality of sentiment passages includes a statement of sentiment about the entity. The mechanism determines a plurality of passage sentiment scores for the plurality of sentiment passages and an actual aggregate sentiment score from the plurality of passage sentiment scores based on a k-valued model. The mechanism determines a sentiment confidence score for the actual aggregate sentiment score based on the raw aggregate sentiment score and the actual aggregate sentiment score and presents the actual aggregate sentiment score and the sentiment confidence score.

Abstract: A search engine is enhanced to employ user preferences to customize answer output by, receiving a first plurality of candidate answers and weights to a first search query for a first user from a first stage of a non-semantic search engine routing and processing path; augmenting the weights for the plurality of candidate answers according to a set of preference coefficients according to a first set of preferences for the first user; selecting one or more of the first plurality of candidate answers according to the augmented weights; and producing an output including the selected one or more candidate answers.

Abstract: A method, system, and computer program product for subject-matter analysis of tabular data are provided in the illustrative embodiments. A first document including the tabular data is received. A library of functional signatures for a first subject-matter domain is selected. A determination is made whether a threshold number of functional signatures from the selected library are applicable to the tabular data, wherein a functional signature is applicable to the tabular data when values in the tabular data correspond to an operation and a table structure specified in the functional signature. Responsive to the threshold number of functional signatures from the selected library being applicable to the tabular data, a processor and a memory process the first document according to a process for the first subject matter domain selected from a plurality of processes for respective subject matter domains.

Abstract: A semantic search engine is enhanced to employ user preferences to customize answer output by, for a first user, extracting user preferences and sentiment levels associated with a first question; receiving candidate answer results of a semantic search of the first question; weighting the candidate answer results according to the sentiment levels for each of the user preferences; and producing the selected candidate answers to the first user. Optionally, user preferences and sentiment levels may be accumulated over different questions for the same user, or over different users for similar questions. And, supplemental information may be retrieved relative to a user preference in order to further tune the weighting per the preferences and sentiment levels.

Abstract: Systems and methods for preventing vulnerabilities in a blockchain due to quiescence are disclosed including submitting a first crosslink transaction for addition to a first blockchain that includes cross-referencing information for a second crosslink transaction that corresponds to the first crosslink transaction and submitting the second crosslink transaction for addition to a second blockchain that includes cross-referencing information corresponding to the first crosslink transaction. The first and second crosslink transactions are configured to be usable together by a user of at least one of the first and second blockchains to validate at least a portion of one of the first and second blockchains after a period of quiescence in the one of the first and second blockchains.

Abstract: Sub-queries for a query are ordered. The query is for retrieving a data item of a data graph. The data graph stores representations of the data item. Each representation stores information represented by the data item in a different manner or way. Each sub-query corresponds to a different representation in which the data graph stores the data item. The sub-queries are ordered in an ordered list according to likelihood that evaluation thereof will yield an appropriate or selected representation of the data item that is correct for the query and that correctly answers the query. The sub-queries within the ordered list are evaluated on a sub-query by sub-query basis, until the data item has been retrieved.

Abstract: A query is for retrieving a data item of a data graph. The data graph stores representations of the data item. Each representation stores information represented by the data item in a different manner or way. Sub-queries for the query each correspond to a different representation in which the data graph stores the data item. The sub-queries are evaluated to determine an appropriate representation of the data item in satisfaction or fulfillment of the query.