International Business Machines Corporation

John Mourra

Hiroshi Tsuji

Vladimir Klicnik

Lok Tin Loi

Kevin Quan

Grant D Taylor

Crystal J Su

Anita O L Leung

C Lorne Parsons

A method, system, and/or computer program product generates self-organizing layouts of process diagrams. Initial weight vectors are distributed uniformly within boundaries of regions in the process diagram. A spatial input vector is randomly generated within the boundaries of each region. In each region in the process diagram, a closest graphical node is found, and a position of a winning graphical node that is the closest graphical node to the random input vector is adjusted. Positions of all non-immutable graphical objects, w, in a topographical neighborhood N(k) of a closest graphical node wthat can cross a boundary of one or more regions from the multiple regions are adjusted. The spatial input vector is recursively generated, the closest graphical node is recursively located, and the positions of all non-immutable graphical objects, w, in the topographical neighborhood N(k) are recursively adjusted until a maximum number of iterations, kis reached.

Self-organizing neural network approach to the automatic layout of business process diagrams

The present invention provides an extensible dependency management framework and method. Specifically, the present invention provides dependency management handler(s) and dispatcher(s) (e.g., revalidation and/or refactoring). The handlers are created and registered by users of the framework. When a change to a resource is detected, a notification is received by a dispatcher from an external caller. Upon receipt, the dispatcher will query an index to identify dependents, and then call a dependency management handler associated with the changed resource to obtain and implement updates for the dependents. In so doing, a list of the dependents will be provided to the dependency management handler.

Extensible dependency management framework and method

A volatile memory manager of a data handling system can be configured to convert the one-to-many external reference into an external reference that references the common ancestor node of the contiguous region. Specific pathing and/or termination conditions can be contained in a Relationship_Path parameter of the external reference. The hierarchical data structure can also be loaded into volatile memory by the volatile memory manager as data structure references. The volatile memory manager can be further configured to perform various functions utilizing the external and data structure references.

Optimizing the storage of one-to-many external references to contiguous regions of hierarchical data structures

The present invention provides a file management system that includes a file indexing framework that allows third parties to contribute index handlers that are responsible for populating index entries for the artifacts they own and/or generate. The framework manages the creation, maintenance, and update of the index, and calls the index handlers at appropriate times so they can parse files that they understand for values that need to be stored in the index. The framework also provides APIs for querying the standardized fields of the index, so applications can search for standard types of data contributed for any of the indexed files. The present invention also provides a mechanism to keep track of symbolic name associations for every file/entity in the system. Specifically, the present invention provides a session-based and transient shadow table of symbolic names previously used by the files (even beyond the lifetime of the files themselves).

Growing community of inventors

Oakville, Canada

John Mourra