International Business Machines Corporation

Sandeep Kohli

Karthik Subbian

Rajaraman Hariharan

Ramakrishnan Kannan

Sarika Sinha

Sandeep Katoch

Priyadarshini Sampath

Anil Bhatia

Ishai Rabinovitz

Ziv Glazberg

Satish Chandra Gupta

Sreerupa Sen

Janees Elamkulam

A method, software and/or computer system for representing a set of SPARQL queries. The set of SPARQL queries are converting into an RDF representation of the set of SPARQL queries (that is, a SPARQL RDF graph). The SPARQL RDF graph is applied to a target RDF graph to yield a transformed target representing the responses to the set of queries, as an ontology or as text.

RDF graphs made of RDF query language queries

Indicating hierarchy diversion in a class diagram. A class inheritance structure for at least one parent class contained in computer program code can be identified to determine a class hierarchy corresponding to the parent class. For at least one child class in the class hierarchy that is a child of the parent class, a parent-child similarity value corresponding to a parent-child diversion of the child class from the parent class can be calculated via a processor. The class diagram can be generated. The class diagram can indicate at least the parent class, the child class and the parent-child similarity value. The class diagram can be presented.

Indicating hierarchy diversion in a class diagram

An embodiment of the invention provides relative bookmarks that are sharable between developers engaged in product development utilizing integrated design environment applications. The relative bookmarks are sharable in that they can be exported, imported, activated and deactivated. The relative bookmarks are relative in that they do not rely on the original code line and contain at least function and/or data flow information, facilitating quick identification of relevant lines of code that have been previously bookmarked. The relative bookmarks can also be utilized to insert breakpoints.

Sharable development environment bookmarks for functional/data flow

A method, system and article of manufacture are disclosed for creating a graphical user interface (GUI) item, in a computer system having a graphical user interface and a display screen. The method includes the step of enabling a user to create one or more instances of a defined GUI item. This enabling step, in turn, includes the steps of displaying on the display screen a Universal Graphical User Interface (UGUI) item; and identifying on the display screen, in a defined manner associated with the display of the UGUI item, a desired GUI item. In response to said identifying this desired GUI item, the displayed UGUI item is visually transformed on the display screen to said desired GUI item. The UGUI item may be a UGUI element or a UGUI relation for indicating the relation between two GUI elements.

Generating universal graphical user interface element and relation

The disclosure presents categorization of users into groups comprising expert users and novice users. A system and method analyzes the users' inputted data in helpdesk troubleshooting software to determine the deviation of novice users from expert users, or the deviation of novice users to a preconfigured behavior as determined by management policy. Other embodiments are also disclosed.

Governance in work flow software

A method and system capable of creating UML protocol state machine for classes and interfaces of a software, by instrumenting the software to obtain a call graph comprising classes and interfaces and respective values associated with class variables and interface variables; identifying particular classes and interfaces in the call graph; identifying call patterns from the call graph to generate a protocol state machine.

Using dynamic call graphs for creating state machines

A method and system are disclosed for modeling non-deterministic queues for efficient model checking. In this method and system, a multitude of messages are held in a plurality of queues, and these messages having n priorities. The method comprises the steps of providing (n+1) queues, including a first queue, and n priority queues; passing said messages from a source to the first queue; passing each of said messages from the first queue to one of said n priority queues based on the priority of the message; and passing each of said messages from the n priority queues to a destination based on the priority of the message. One or more non-deterministic waits are introduced into one or more of the passing steps to simplify passing the messages into or out of the n priority queues.

Growing community of inventors

Bengaluru, India

Sandeep Kohli