Extending interaction overview diagrams with activity diagram constructs

UML2.0 introduced interaction overview diagrams (IODs) as a way of specifying relationships between UML interactions. IODs are a variant of activity diagrams that show control flow between a set of interactions. The nodes in an IOD are either inline interactions or references to an interaction. A number of recent papers have defined a formal semantics for IODs. These are restricted, however, to interactions that can be specified using basic sequence diagrams. This excludes the many rich modeling constructs available in activity diagrams such as interruptible regions, activity groups, concurrent node executions, and flow final nodes. It is non-trivial to allow such constructs in IODs because their meaning has to be interpreted in the context of interaction sequences rather than activities. In this paper, we consider how some of these activity diagram constructs can be used practically in IODs. We motivate the integration of these constructs into IODs using a NASA air traffic control subsystem and define a formal semantics for these constructs that builds on an existing semantics definition for IODs.     

Biaxially loaded concrete column interaction curve

A computer program for the ineraction curve data corresponding to a specified bending moment ratio is presented. The iterative solution is original and can be utilized for rectangular and square crosssections with any number of arbitrarily located steel bar areas individually specified by the user. Assumptions are that the column is short and the 1971 ACI Code rectangular stress block is the exact definition of internal stress distribution.     

由序列图合成状态图

序列图和状态图对于描述和理解面向对象软件系统有着极其重要的作用。符合UML标准的序列图和状态图存在信息重叠，根据序列图提供的信息可以合成状态图。给出了在Rational Rose中由序列图合成状态图工具的实现。     

Computerized prediction of interaction parameters and phase diagrams of the immiscible binary systems of nontransition-nontransition metals

The relationship between the interaction parameters of liquid alloys and the atomic parameters of constituent elements has been investigated by artificial neural network method. The relationship found can be used for the computerized prediction of phase diagrams of liquid-liquid immiscible binary systems between non-transition elements.     

Set space diagrams

This paper introduces set space diagrams and defines their formal syntax and semantics. Conventional region based diagrams, like Euler circles and Venn diagrams, represent sets and their intersections by means of overlapping regions. By contrast, set space diagrams provide a certain layout that avoids overlapping geometrical entities. This enables the representation of a good deal of sets without getting diagrams which are cluttered due to overlapping regions. In particular, these diagrams can be employed for illustration purposes, e.g., for showing the laws of Boolean algebras. Additionally, cardinalities are represented and can be easily compared; inferences can be drawn to derive unknown cardinalities from a given knowledge base. The soundness of set space diagrams is shown with respect to their set-theoretic interpretation.     

Untangling euler diagrams

In many common data analysis scenarios the data elements are logically grouped into sets. Venn and Euler style diagrams are a common visual representation of such set membership where the data elements are represented by labels or glyphs and sets are indicated by boundaries surrounding their members. Generating such diagrams automatically such that set regions do not intersect unless the corresponding sets have a non-empty intersection is a difficult problem. Further, it may be impossible in some cases if regions are required to be continuous and convex. Several approaches exist to draw such set regions using more complex shapes, however, the resulting diagrams can be difficult to interpret. In this paper we present two novel approaches for simplifying a complex collection of intersecting sets into a strict hierarchy that can be more easily automatically arranged and drawn (Figure 1). In the first approach, we use compact rectangular shapes for drawing each set, attempting to improve the readability of the set intersections. In the second approach, we avoid drawing intersecting set regions by duplicating elements belonging to multiple sets. We compared both of our techniques to the traditional non-convex region technique using five readability tasks. Our results show that the compact rectangular shapes technique was often preferred by experimental subjects even though the use of duplications dramatically improves the accuracy and performance time for most of our tasks. In addition to general set representation our techniques are also applicable to visualization of networks with intersecting clusters of nodes.     

Compiling influence diagrams

This paper examines a class of algorithms for “compiling” influence diagrams into a set of simple decision rules. These decision rules define simple-to-execute, complete, consistent, and near-optimal decision procedures. These compilation algorithms can be used to derive decision procedures for manually solving time constrained decision problems     

Computer-aided hierarchical diagrams

The user interface of a diagram-drawing program, DIAG2, is described. The user is provided with three basic constructs: the straight line, the segment of a circle and the block of text. These constructs may be assembled into larger groups. Thus a diagram can be built up in a hierarchical manner by the user. DIAG2 performs the unwrapping operations necessary to decompose the diagram into a set of straight line segments, which can be output to the appropriate display peripheral. No intelligence is required in the graphics device itself.     

Synthesis of state machine diagrams from communication diagrams using Petri nets

Service-oriented architecture is an architecture style to build up a large-scale networked system composed of a set of components or functions, each of which is called a service. A problem to construct behavioral models of services from given global interaction specifications, called choreography, is known as the choreography realization problem. The constructed model is still an intermediate model in the process of system developments; the model will be corrected, modified, and enhanced further by designers. Therefore, we also have to consider readability of the constructed model. In this paper, we proposed a method to construct state machine models from choreographies described by a set of communication diagrams using Petri nets. The proposed method will try to use the composite states and the orthogonal regions of UML state machines for the readability.     

Towards recursive block diagrams

Block diagrams have been recently successfully applied in programming safety critical control systems. This presentation investigates the interest of using recursion within this framework. First it identifies the necessary concepts for using recursion while remaining within the domain of real-time bounded memory, bounded response time systems and then it presents examples, which hopefully illustrate the interest of the approach.     

Multiple combinatorial block diagrams

Conditions were presented for design of the combinatorial symmetrical block diagrams with σ > 1 different blocks (elements) for any pair of elements (blocks) to each of which the elements of this pair are incident. The multiple block diagrams may be interpreted as an optimal model of the structure of redundantized links between the system components.     

Doing arithmetic without diagrams

We describe a theorem prover for elementary number theory which proves theorems not by representing them as diagrams as in a semantic net, but rather by representing them in the traditional manner as lists. This theorem prover uses no chaining rules, forward or backward, but instead interaction between equations is based upon the use of many truth-value preserving transformations. These transformations are used in a manner similar to that in which a LISP interpreter executes LISP functions.     

Computer constructed optical-rose diagrams

Rose diagrams, a circular plot of relative frequencies, are a convenient method of visualizing directional data. One method of obtaining optical-rose diagrams is by sampling the intensity distribution across the Fourier transform. This transform is produced optically using directional data in pictorial form. High-contrast black-and-white reduced transparencies form the input to the optical system containing a monochromatic laser source and a series of lenses to focus the diffraction pattern on the transform plane. Light intensity, recorded digitally over all directions on the transform plane by a set of photodiodes, is normalized and circularly plotted by computer to produce optical-rose diagrams. By selective filtering, certain directions can be eliminated to enhance the effect of the residual major or minor directional features. Directional filtering is achieved by obstructing the light in the transform plane by a wedge and using another lens. These filtered transforms can be reconstructed to form the image with the desired directions. Optical-rose construction is easy, economical, and fast, in addition to having the flexibility of selective directional filtering and reconstructing the filtered image.     

Multi-perspective compact explosion diagrams

This article presents a system to automatically generate compact explosion diagrams. Inspired by handmade illustrations, our approach reduces the complexity of an explosion diagram by rendering an exploded view only for a suitable subset of the assemblies of an object. However, the exploded views are chosen so that they allow inferring the remaining unexploded assemblies of the entire 3D model. In particular, our approach demonstrates the assembly of a set of identical groups of parts by presenting an exploded view only for a single representative. In order to identify the representatives, our system automatically searches for recurring subassemblies. It selects representatives depending on a quality evaluation of their potential exploded view. Our system takes into account visibility information of both the exploded view of a potential representative as well as visibility information of the remaining unexploded assemblies. This allows rendering a balanced compact explosion diagram, consisting of a clear presentation of the exploded representatives as well as the unexploded remaining assemblies. Since representatives may interfere with one another, our system furthermore optimizes combinations of representatives. The optimization process also generates good views on the explosion diagram. Labels are added to the explosion diagram to increase the visibility of small or occluded parts. Throughout this article, we show a number of examples, which all have been rendered from unmodified 3D CAD data.     

Some nonrealizable line diagrams

We superimpose weaving patterns on planar line arrangements, and we face the question when they can be realized by lines in 3-space. Using the combinatorial type of the given lines in the plane we derive a class of nonrealizable weavings.