International Business Machines Corporation

Peter Haumer

J Todd Fredrickson

Arthur Gary Ryman

Nicholas Tyler Bartlett

Gary Mazo

Yan Luo

William John Scheid, Iii

Stanislav Georgiev

Tala El Hallak

J Todd Frederickson

Sanket Parikh

Milandeep S Shergill

Aspects include a method for generating an initial ranking of a plurality of discovered keywords, in which the initial ranking is based on confidence levels. The method includes presenting the initial ranking to a user as a list that includes the plurality of discovered keywords. The method includes, in response to receiving a text string as a first input from the user, filtering the list of discovered keywords to generate a refined list of discovered keywords. The filtering includes searching the list of discovered keywords to rank keywords that match the input string using a fuzzy search. The method includes mapping a discovered keyword of the refined list to a business term using a fuzzy search. The method includes updating the initial ranking based on the mapping of the discovered keyword.

Discovering and displaying business artifact and term relationships

A computer program is searched for one or more select terms. A first type of search is performed on source code of the computer program to search for one or more select terms in the source code. Results of the first type of search, if any, are included in a result set. A second type of search is performed on one or more particular elements of the computer program to search for the one or more select terms in the one or more particular elements. Results of the second type of search, if any, are added to the result set. Another search is performed, based on analysis of the result set. The other search searches for the one or more select terms in one or more selected source artifacts of the computer program to provide a refined result set. An action is performed using the refined set.

Refining search results generated from a combination of multiple types of searches

Various embodiments provide access control to unprotected data storage system endpoints. In one embodiment, an authenticated query request is received. The request includes a query associated with an unprotected data storage system endpoint configured to execute queries anonymously. The query is written in a Resource Description Framework (RDF) query language and requests one or more datasets stored in a relational data storage system. A user parameter within the query is identified. The user parameter uniquely identifies a user requesting the query. The query is automatically rewritten to include a set of access control list properties for one or more subject variables in the query. Each of the set of access control list properties configures the query to return data from the one or more datasets for which the user is authorized to access.

Access control for unprotected data storage system endpoints

Embodiments of the invention include methods, systems, and computer program products for root cause analysis. Aspects of the invention include receiving, by a processor, operations data associated with a plurality of applications. A trend analysis is performed on the operations data to determine an operations issue associated with at least one of the plurality of applications. And a root-cause analysis is performed on the operations issue to identify a set of candidate applications from the plurality of applications that may be a cause of the operations issue.

Root cause analysis for correlated development and operations data

Embodiments of the present invention address deficiencies of the art in respect to method and process management, and provide a data processing system, method, and computer program product for dynamic binding of a capability pattern to multiple processes in a method architecture. In accordance with an embodiment of the present invention, a data processing system configured for dynamic binding of process patterns can include a method management tool. The method management tool can include program code enabled both to compose a capability pattern comprised of at least one activity defined by a plurality of nested and descriptors for source method elements, and to bind an extension activity to the capability pattern in a process model without replicating the activity of the capability pattern in the process pattern.

Dynamic binding of process patterns in a method architecture

Embodiments of the present invention address deficiencies of the art in respect to method and process management, and provide a data processing system, method, and computer program product for process contributions in a method architecture. In accordance with an embodiment of the present invention, a data processing system configured for process contributions can include a method management tool configured for composing a process utilizing the method architecture. The system further can include one or more source method elements combinable to define an activity for the process. Finally, the system can include one or more process contributions defining variations in the activities of the process.

Process contributions in a method architecture

Embodiments of the invention provide a method, system and computer program product for methods management. A methods management method can include establishing default structured relationships between different reusable method elements. The methods management method also can include creating descriptors within a process that mirror the default structured relationships. Finally, the methods management method can include configuring the created descriptors to permit changes to the mirrored default structural relationships between the created descriptors in the process without changing the default structured relationships between the source reusable method elements.

Growing community of inventors

San Jose, CA, United States of America

Peter Haumer