Abstract: A method (and system) for generating a structured representation from an unstructured description includes receiving, by a computer, an unstructured description, and generating, by the computer, a structured representation based upon the unstructured description.

Abstract: A method is provided for characterizing objects generated during an initial run of a program, each object being characterized by a number of alternative properties which can be chosen. The method includes steps of instrumenting an initial run of program to determine characterization information about each of objects, then determining a desirable property for each object, then determining a correlation between the desirable property and the characterization information for each of the objects. This correlation is then used to select a property for an object that is subsequently created during a run of the program based only upon characterization information about the subsequently created object.

Abstract: A method and system are disclosed for manipulating a model, where that model represents some or all of a design. The design includes a multitude of design elements, the model includes a multitude of model elements, and each of the design elements is represented by a single model element. The method comprises the steps of generating a suite of documents from the model, each of the documents describing a view of the model; and displaying the documents to a user as a series of forms. The user provides information to the forms to change the documents, and changes to the documents result in both changes to the model and consistent changes across the suite of documents. In the preferred embodiment, the model identifies specific relationships between the elements of the model, and each of the model elements has defined properties.

Abstract: A method and system are disclosed for creating a hyperlink together with an associated semantic link between a source entity, and a target entity. The source entity includes descriptive text. The system includes means for selecting text within the source entity, and means for selecting the target entity. Also, means are provided for selecting a type of semantic link, and means are provided for creating a hyperlink between said selected text and said target entity. The system further includes means for creating a semantic link of said type between said source entity and said target entity, including means for including in the hyperlink a reference to said semantic link. In the preferred embodiment of the invention, the means for selecting the type of semantic link includes means for prompting a user to select from among a plurality of candidate types of semantic links.

Abstract: A method for minimizing total cost of interaction among components of a computer program, each of the components being characterized by at least one implementation property includes steps of: a) carrying out at least a partial run of the program; b) monitoring the at least partial run of the program to measure an amount of interaction between each pair of components; c) determining a cost of interaction between each pair of interacting components; d) determining a choice of implementation properties which minimizes total cost of the at least partial run; and e) assigning that choice of implementation properties to the components for a subsequent at least partial run of the program.

Abstract: Libraries and individual program components are provided with a common interface and a number of alternative implementations (e.g. hash table, tree, compressed) which can be selected. The component is instrumented to measure a cost of each of its alternative implementations, both independent of and in the context of the interaction of that component with other components of the computer program. Based on measured cost, the desired implementation is chosen for the component by an external controller that is generic to the computer program or by an application program that interfaces with the library or component.

Abstract: A system and method for minimizing total cost of interaction among components of a computer program which are each characterized by at least one implementation property. A implementation property may, for example, be a choice of string representation (e.g. ASCII, UNICODE, EBCDIC or choice of data structure (e.g. hash, tree, compressed). The method comprises the steps of: carrying out a run of the program; monitoring that run to measure an amount of interaction between each pair of components; determining a cost of interaction between each pair of interacting components; determining a choice of implementation properties which minimizes total cost of the run; and assigning choices of implementation properties to said components for a future run of the program.

Abstract: A method (and system) for generating a structured representation from an unstructured description includes receiving, by a computer, an unstructured description, and generating, by the computer, a structured representation based upon the unstructured description.

Abstract: A problem determination method, system and program product are provided. Specifically, the present invention identifies problems with software programs by inserting compiled problem determination probes into program classes while the computer system on which the program is loaded is running. Once the probes have been inserted, the classes will be run and trace data will be generated. The trace data can be retrieved and analyzed to identify and address the problem. When the probes are no longer needed, they can be removed while the computer system continues to run.

Abstract: A task management system, method and computer program product for determining optimal placement of task components on multiple machines for task execution, particularly for placing program components on multiple computers for distributed processing. First, a communication graph is generated representative of the computer program with each program unit (e.g., an object) represented as a node in the graph. Nodes are connected to other nodes by edges representative of communication between connected nodes. A weight is applied to each edge, the weight being a measure of the level of communication between the connected edges. Terminal nodes representative of the multiple computers are attached to the communication graph. Then, the communication graph is divided into independent nets and a min cut is found for each independent net. The min cut for the communication graph is the combination of the min cuts for all of the independent nets.

Abstract: The present invention is a task management system, method and computer program product for determining optimal placement of task components on multiple machines for task execution, particularly for placing program components on multiple computers for distributed processing. First, a communication graph is generated representative of the computer program with each program unit (e.g., an object) represented as a node in the graph. Nodes are connected to other nodes by edges representative of communication between connected nodes. A weight is applied to each edge, the weight being a measure of the level of communication between the connected edges. Terminal nodes representative of ones of the multiple computers are attached to the communication graph. Independent nets may be separated out of the communication graph.

Abstract: A task management system, method and computer program product for determining optimal placement of task components on multiple machines for task execution, particularly for placing program components on multiple computers for distributed processing. First, a communication graph is generated representative of the computer program with each program unit (e.g., an object) represented as a node in the graph. Nodes are connected to other nodes by edges representative of communication between connected nodes. A weight is applied to each edge, the weight being a measure of the level of communication between the connected edges. Terminal nodes representative of the multiple computers are attached to the communication graph. Independent nets may be separated out of the communication graph. A cut is made at each terminal node and the weights of the cut edges are summed.

Abstract: A task management system, method and computer program product for determining optimal placement of task components on multiple machines for task execution, particularly for placing program components on multiple computers for distributed processing. First, a communication graph is generated representative of the computer program with each program unit (e.g., an object) represented as a node in the graph. Nodes are connected to other nodes by edges representative of communication between connected nodes. A weight is applied to each edge, the weight being a measure of the level of communication between the connected edges. Terminal nodes representative of the multiple computers are attached to the communication graph. Then, dominant edges are identified within the communication graph. For any non-terminal node, a connected edge is dominant if it is at least as heavy (its weight is greater than or equal to) as the sum of the remaining non-terminal edges and the heaviest of the remaining terminal edges.

Abstract: A problem determination method, system and program product are provided. Specifically, the present invention identifies problems with software programs by inserting compiled problem determination probes into program classes while the computer system on which the program is loaded is running. Once the probes have been inserted, the classes will be run and trace data will be generated. The trace data can be retrieved and analyzed to identify and address the problem. When the probes are no longer needed, they can be removed while the computer system continues to run.

Abstract: A method is provided for characterizing objects generated during an initial run of a program, each object being characterized by a number of alternative properties which can be chosen. The method entails instrumenting an initial run of program to determine characterization information about each of objects, then determining a desirable property for each object, then determining a correlation between the desirable property and the characterization information for each of said objects. This correlation is then used to select an property for an object that is subsequently created during a run of the program based only upon characterization information about the subsequently created object.

Abstract: Libraries and individual program components are provided with a common interface and a number of alternative implementations (e.g. hash table, tree, compressed) which can be selected. The component is instrumented to measure a cost of each of its alternative implementations, both independent of and in the context of the interaction of that component with other components of the computer program. Based on measured cost, the desired implementation is chosen for the component by an external controller that is generic to the computer program or by an application program that interfaces with the library or component.

Abstract: A system and method for minimizing total cost of interaction among components of a computer program which are each characterized by at least one implementation property. A implementation property may, for example, be a choice of string representation (e.g. ASCII, UNICODE, EBCDIC or choice of data structure (e.g. hash, tree, compressed). The method comprises the steps of: carrying out a run of the program; monitoring that run to measure an amount of interaction between each pair of components; determining a cost of interaction between each pair of interacting components; determining a choice of implementation properties which minimizes total cost of the run; and assigning choices of implementation properties to said components for a future run of the program.

Abstract: A zoom control mechanism includes a context display for displaying a representation of a data set, a zoom display for displaying a representation of a zoom interval within the data set, a context indicator that indicates a start point or an end point of a zoom interval within a context display, and a zoom indicator, corresponding to the context indicator, that indicates the start point or end point of the zoom interval within the zoom display. The zoom interval is updated according to user selection and movement of the context indicator and the zoom indicator to a new location within the context display and the zoom display, respectively.

Abstract: A zoom control mechanism includes a context display for displaying a representation of a data set, a zoom display for displaying a representation of a zoom interval within the data set, a context indicator that indicates a start point or an end point of a zoom interval within a context display, and a zoom indicator, corresponding to the context indicator, that indicates the start point or end point of the zoom interval within the zoom display. The zoom interval is updated according to user selection and movement of the context indicator or the zoom indicator to a new location within the context display and the zoom display, respectively.