Abstract: A method, system and computer-usable medium are disclosed for generating a context-sensitive summarization of a corpus of content. Natural Language Processing (NLP) operations are performed on text within an input corpus to extract phrases, which are then used to generate a grammatical analysis. In turn, the grammatical analysis is used to determine the thematic relevance of individual sentences in the input corpus. Sentences within the input corpus are then ranked according to their respective thematic relevance. This ranking is used to construct a contextualized content graph, which in turn is used to generate a content summarization for the input corpus.

Abstract: Embodiments of the invention relate to identification of material that contains linguistically related content. Key phrases are filtered through a content store to ascertain the linguistically related content and to move the identified content to a target corpus. At least two iterations of the filtering process are employed. Each subsequent iteration of the filtering process identifies at least one new key phrase within the filtered material. In addition, each subsequent iteration takes place with a union of each previously employed key phrase and each new key phrase. As new content is identified, the content is populated to the target corpus.

Abstract: Embodiments of the invention relate to identification of material that contains linguistically related content. Key phrases are filtered through a content store to ascertain the linguistically related content and to move the identified content to a target corpus. At least two iterations of the filtering process are employed. Each subsequent iteration of the filtering process identifies at least one new key phrase within the filtered material. In addition, each subsequent iteration takes place with a union of each previously employed key phrase and each new key phrase. As new content is identified, the content is populated to the target corpus.

Abstract: A first seed concept term may be identified. The first seed concept term may be to train a cognitive computing system. The cognitive computing system may analyze the first seed concept term to generate a first set one or more concept terms that are candidates for being conceptually related to the first seed concept term. A first plurality of individual characters and the first seed concept term may be provided. A first user of a client computing device may be prompted to generate a second set of one or more concept terms that are conceptually related to the first seed concept term using one or more of the first plurality of individual characters.

Abstract: Mechanisms are provided for implementing a virtual corpus engine that receives an inquiry to be processed and analyzes the inquiry to extract one or more features of the inquiry. The virtual corpus engine selects a weight matrix associated with a virtual corpus based on the extracted one or more features of the inquiry. The virtual corpus comprises a plurality of actual corpora of information. The weight matrix comprises a separate weight value for each actual corpus in the plurality of actual corpora. The virtual corpus engine processes the inquiry using a set of selected actual corpora selected from the plurality of actual corpora based on the weight values in the weight matrix and receives results of the processing of the inquiry using the set of selected actual corpora. The virtual corpus engine outputs the results of the processing of the inquiry.

Abstract: A first list that includes a first set of one or more concept terms may be obtained. The first set of one or more concept terms may be candidates for being conceptually related to a seed concept term. Prior to the obtaining, a first client computing device may provide a first plurality of individual characters and the seed concept term to a first user using the first client computing device. The first client computing device may prompt the first user to generate the first set of one or more concept terms that are conceptually related to the seed concept term using one or more of the first plurality of individual characters. In response to the obtaining, one or more particular categories to which each of the first set of one or more concept terms belongs to may be determined.

Abstract: A computer-implemented method for creating question-answer pairs is provided. The computer-implemented method includes leveraging domain specific resources including, at least one or more of lexicons, glossaries, or knowledge bases for constructing templates for creating the question-answer pairs. The computer implemented method further includes leveraging user experiences of a plurality of users for constructing templates. The computer implemented method further includes eliminating erroneous question-answer pairs based on templates specifications of a heuristic process of the constructed templates.

Abstract: A method for controlled sharing, in a cognitive computing system having a memory and a processor, of content from a variety of content providers may include receiving, by the cognitive computing system, an inquiry, wherein the inquiry is directed to at least one content topic. The method may then include identifying, by the cognitive computing system, the at least one content topic, and determining that a cognitive component of the cognitive computing system managed by a content provider has access to a content repository addressing the at least one content topic. The method may further include distributing, by the cognitive computing system, the inquiry to the cognitive component. The method may additionally include receiving a response from the cognitive component.

Abstract: Aspects of the present disclosure, in certain embodiments, are directed toward providing a visual representation of question quality in a question answering system. More particularly, aspects are directed toward receiving, by a question answering system, an input question having a set of query attributes. The set of query attributes may be user-influenced characteristics of the input question. Aspects of the present disclosure are also directed toward evaluating, by comparing the set of query attributes to a set of assessment criteria, the quality of the input question. Aspects of the present disclosure are also directed toward assigning, in response to evaluating the quality of the input question, a set of quality values to the set of query attributes. Using the assigned set of quality values and the set of query attributes, an icon that indicates a visual representation of the quality of the input question may be generated.

Abstract: Systems (100) and methods (200) for managing transactional processing. The methods involve executing a first transaction (120) which is blocked by an exclusive lock of at least one second transaction (110) from accessing at least one resource of a system. Thereafter, a determination is made as to whether a Service Level Agreement (“SLA”) associated with the first transaction is being met. If it is determined that the SLA is not being met, the resources needed by the first transaction are identified. Subsequently, all executing transactions, that are using the resources needed by the first transaction, are identified. At least one of the identified transactions is then dynamically slowed down or speed up. The transaction is slowed down or sped up by: adjusting how many records are to be processed in each sub-transaction of the transaction; and/or increasing or decreasing the time period between commit operations of the transaction.

Abstract: Systems (100) and methods (200) for managing transactional processing. The methods involve executing a first transaction (120) which is blocked by an exclusive lock of at least one second transaction (110) from accessing at least one resource of a system. Thereafter, a determination is made as to whether a Service Level Agreement (“SLA”) associated with the first transaction is being met. If it is determined that the SLA is not being met, the resources needed by the first transaction are identified. Subsequently, all executing transactions, that are using the resources needed by the first transaction, are identified. At least one of the identified transactions is then dynamically slowed down or speed up. The transaction is slowed down or sped up by: adjusting how many records are to be processed in each sub-transaction of the transaction; and/or increasing or decreasing the time period between commit operations of the transaction.

Abstract: Systems (100) and methods (200) for managing transactional processing. The methods involve executing a first transaction (120) which is blocked by an exclusive lock of at least one second transaction (110) from accessing at least one resource of a system. Thereafter, a determination is made as to whether a Service Level Agreement (“SLA”) associated with the first transaction is being met. If it is determined that the SLA is not being met, the resources needed by the first transaction are identified. Subsequently, all executing transactions, that are using the resources needed by the first transaction, are identified. At least one of the identified transactions is then dynamically slowed down or speed up. The transaction is slowed down or sped up by: adjusting how many records are to be processed in each sub-transaction of the transaction; and/or increasing or decreasing the time period between commit operations of the transaction.

Abstract: Systems (100) and methods (200) for managing transactional processing. The methods involve executing a first transaction (120) which is blocked by an exclusive lock of at least one second transaction (110) from accessing at least one resource of a system. Thereafter, a determination is made as to whether a Service Level Agreement (“SLA”) associated with the first transaction is being met. If it is determined that the SLA is not being met, the resources needed by the first transaction are identified. Subsequently, all executing transactions, that are using the resources needed by the first transaction, are identified. At least one of the identified transactions is then dynamically slowed down or speed up. The transaction is slowed down or sped up by: adjusting how many records are to be processed in each sub-transaction of the transaction; and/or increasing or decreasing the time period between commit operations of the transaction.

Abstract: An improved method, apparatus, and computer instructions for creating and running batch jobs in an object oriented environment, such as a J2EE environment. A request to execute a batch job is received. A deployment descriptor file is processed to identify a batch bean to be invoked. This batch job session bean processes the request, parses deployment descriptor file that comprises definitions of relationships between other helper classes, entity and session beans. The identified batch bean is invoked to execute the batch job step in the order described in the deployment descriptor applying checkpoints at intervals specified in the descriptor.

Abstract: A method, apparatus, and computer instructions are provided for implementing container managed uses, ownerships, and references in an enterprise JavaBean™ environment. A user may specify a uses, ownership, reference relationships between entity beans and sessions in a deployment descriptor file. When the file is processed, the present embodiment generates methods on the entity beans and allows the container to recognize the relationships, such that the user may access the session beans based on the specified relationships.

Abstract: A system for navigating relationships between beans using filters and container managed relationships is provided. With the system, filters are specified in the relationship definition of a deployment descriptor of a bean. The filters generate additional predicates to the WHERE clauses in SQL SELECT statements generated based on the contents of the deployment descriptor. Moreover, these filters may be defined such that method parameters may be passed into the resulting deployed code to thereby make them more flexible. Therefore, with the system, rather than defining filters programmatically in methods of a bean's implementation class, filters are defined declaratively in the deployment descriptor of the bean. Since these filters are specified in the deployment descriptor of the bean, they are accessible to clients of the bean through the local interface.

Abstract: A system for navigating relationships between beans using filters and container managed relationships is provided. With the system, filters are specified in the relationship definition of a deployment descriptor of a bean. The filters generate additional predicates to the WHERE clauses in SQL SELECT statements generated based on the contents of the deployment descriptor. Moreover, these filters may be defined such that method parameters may be passed into the resulting deployed code to thereby make them more flexible. Therefore, with the system, rather than defining filters programmatically in methods of a bean's implementation class, filters are defined declaratively in the deployment descriptor of the bean. Since these filters are specified in the deployment descriptor of the bean, they are accessible to clients of the bean through the local interface.

Abstract: A method for navigating relationships between beans using filters and container managed relationships is provided. With the method, filters are specified in the relationship definition of a deployment descriptor of a bean. The filters generate additional predicates to the WHERE clauses in SQL SELECT statements generated based on the contents of the deployment descriptor. Moreover, these filters may be defined such that method parameters may be passed into the resulting deployed code to thereby make them more flexible. Therefore, with the method, rather than defining filters programmatically in methods of a bean's implementation class, filters are defined declaratively in the deployment descriptor of the bean. Since these filters are specified in the deployment descriptor of the bean, they are accessible to clients of the bean through the local interface.

Abstract: Mapping Enterprise Java Bean (“EJB”) attributes to database schema including providing a first metamap including one or more abstracted variable characteristics of a first database schema and creating from the first metamap a second metamap for a second database schema including varying one or more of the abstracted variable characteristics to conform to the second database schema. Typical embodiments also include synchronizing, in response to methods invoked on the EJB and in dependence upon the second metamap, the state of the EJB with a persistent data store having the second database schema. In typical embodiments, synchronizing the state of the EJB with a persistent data store having the second database schema also includes creating records, updating records, and deleting records in the persistent data store.

Abstract: An improved method, apparatus, and computer instructions for creating and running batch jobs in an object oriented environment, such as a J2EE environment. A request to execute a batch job is received. A deployment descriptor file is processed to identify a batch bean to be invoked. This batch job session bean processes the request, parses deployment descriptor file that comprises definitions of relationships between other helper classes, entity and session beans. The identified batch bean is invoked to execute the batch job step in the order described in the deployment descriptor applying checkpoints at intervals specified in the descriptor.