Abstract: Flexibly modeling and visualizing a level-based hierarchy. A first level set and a second level set are identified from a first data set and a second data set in a first domain and a second domain, respectively. A first relationship type to be used between the first level set and the second level set is received. A first hierarchy is formalized, including at least the first level set and the second level set joined in a hierarchical relationship according to the first relationship type.

Abstract: Techniques are disclosed to facilitate consistency between a glossary and a repository, where the glossary includes one or more terms and the repository includes information sets. Each information set includes a definition for a respective term and a range of valid values for the respective term. A request is received to approve a first information set in the repository, where the first information set pertains to a first term in the glossary. The first information set is designated as an active information set for the first term. A subsequent request is received to assign the first term in the glossary to a second information set in the repository, where the second information set is different from the first information set. An information set to designate as the active information set for the first term is programmatically determined based on a predefined consistency criterion.

Abstract: The disclosure is for run-time accessing a software component is provided, together with a computer system embodying the same, and a software utility directing the method. Initially a software component is loaded and analyzed to identify one or more features thereof, which features are checked against a database. Following the check, the component is classified as one of at least first, second, and third component types. A first component type is run without amendment. A second component type is replaced by a component of equivalent functionality prior to running. A third component type is blocked from running.

Abstract: The disclosure is for run-time accessing a software component is provided, together with a computer system embodying the same, and a software utility directing the method. Initially a software component is loaded and analyzed to identify one or more features thereof, which features are checked against a database. Following the check, the component is classified as one of at least first, second, and third component types. A first component type is run without amendment. A second component type is replaced by a component of equivalent functionality prior to running. A third component type is blocked from running.

Abstract: A computer system determines a category of users to which a user of a computer belongs. The computer system determines a relationship between the category of users and at least one program available for installation from the computer system. Based on the determined relationship, the computer system determines that at least one feature of the at least one program are of potential interest to the user of the computer. The computer system notifies the user of the at least one feature of the at least one program of potential interest.

Abstract: A method of operating a network of connected nodes comprises the steps of maintaining a trust value for each node in the network, maintaining one or more attributes for each node in the network, each attribute comprising a value and a respective confidence level, and performing a validation of a specific attribute of a specific node. The validation comprises the steps of querying nodes connected to the specific node for specific attribute values for the specific node, creating a results set from the returned attribute values from the connected nodes and the trust values of the connected nodes, and processing the results set according to a predefined algorithm to determine a new value and/or a new confidence level for the specific attribute of the specific node.

Abstract: Techniques are disclosed for searching a set of documents using search terms. In one embodiment, a summary is provided for each document in the set. Search terms are received, and the set of documents are parsed using the received search terms. A first relevance value is calculated using only the summary of each document. A subset of documents having the highest relevance is provided by using the first relevance value. The subset of documents is parsed using the received search terms, to calculate a second relevance value for each document using the respective document. Query results are provided, the query results including documents having the highest relevance according to the second relevance value.

Abstract: A method, system, and computer program product fo automatically generating service definitions for application clients of a message broker is provided. The method includes retrieving a trace of interactions between different application instances and corresponding message queues in a message brokering system. Thereafter, messages in the trace can be analyzed to identify the application instances and related message exchange data. Finally, a service definition document can be generated for each identified application instance using the related message exchange data to describe computational services provided by the identified application instance.

Abstract: The disclosure is for run-time accessing a software component is provided, together with a computer system embodying the same, and a software utility directing the method. Initially a software component is loaded and analysed to identify one or more features thereof, which features are checked against a database. Following the check, the component is classified as one of at least first, second, and third component types. A first component type is run without amendment. A second component type is replaced by a component of equivalent functionality prior to running. A third component type is blocked from running.

Abstract: The disclosure is for run-time accessing a software component is provided, together with a computer system embodying the same, and a software utility directing the method. Initially a software component is loaded and analysed to identify one or more features thereof, which features are checked against a database. Following the check, the component is classified as one of at least first, second, and third component types. A first component type is run without amendment. A second component type is replaced by a component of equivalent functionality prior to running. A third component type is blocked from running.

Abstract: Embodiments of the present invention provide method, system and computer program product for user profile and usage pattern based user ID prediction. In accordance with an embodiment of the invention, a user can request a user ID to access a portion of a computing system. One or more characteristics of the user, such as a role or location can be determined and correlated to one or more different additional user ID options. In this regard, the additional user ID options can be a suggested alternative user ID for use by the user commensurate with the role or location of the user, or with past patterns of other users considered similar to the user based upon the characteristics of the user.

Abstract: Embodiments of the present invention provide method, system and computer program product for user profile and usage pattern based user ID prediction. In accordance with an embodiment of the invention, a user can request a user ID to access a portion of a computing system. One or more characteristics of the user, such as a role or location can be determined and correlated to one or more different additional user ID options. In this regard, the additional user ID options can be a suggested alternative user ID for use by the user commensurate with the role or location of the user, or with past patterns of other users considered similar to the user based upon the characteristics of the user.

Abstract: Techniques are disclosed for searching a set of documents using search terms. In one embodiment, a summary is provided for each document in the set. Search terms are received, and the set of documents are parsed using the received search terms. A first relevance value is calculated using only the summary of each document. A subset of documents having the highest relevance is provided by using the first relevance value. The subset of documents is parsed using the received search terms, to calculate a second relevance value for each document using the respective document. Query results are provided, the query results including documents having the highest relevance according to the second relevance value.