21,529 research outputs found
Extending constrained hierarchical layout for drawing UML activity diagrams
Ankara : The Department of Computer Engineering and Institute Engineering and Science of Bilkent University, 2002.Thesis (Master's) -- Bilkent University, 2002.Includes bibliographical references leaves 48-51.While modeling an object-oriented software, a visual language called Unified Modeling Language (UML)
may be used. UML is a language and notation for specification, construction, visualization, and
documentation of models of software systems. It consists of a variety of diagrams including class
diagrams and activity diagrams. Graph layout has become an important area of research in Computer
Science for the last couple of decades. There is a wide range of applications for graph layout including
data structures, databases, software engineering, VLSI technology, electrical engineering, production
planning, chemistry, and biology. Diagrams are more effective means of expressing relational information
and automatic graph layout makes them to be more comprehensible. In other words, with graph layout
techniques, the readability and the comprehensibility of the graphs increases and the complexity is
reduced. UML diagrams are no exception. In this thesis, we present graph layout algorithms for UML
activity diagrams based on constrained hierarchical layout. We use an existing implementation of
constrained hierarchical layout to draw UML activity diagrams. We analyze and present the results of
these new layout algorithms.YĂźksel, H MehmetM.S
Drawing Area-Proportional Euler Diagrams Representing Up To Three Sets
Area-proportional Euler diagrams representing three sets are commonly used to visualize the results of medical experiments, business data, and information from other applications where statistical results are best shown using interlinking curves. Currently, there is no tool that will reliably visualize exact area-proportional diagrams for up to three sets. Limited success, in terms of diagram accuracy, has been achieved for a small number of cases, such as Venn-2 and Venn-3 where all intersections between the sets must be represented. Euler diagrams do not have to include all intersections and so permit the visualization of cases where some intersections have a zero value. This paper describes a general, implemented, method for visualizing all 40 Euler-3 diagrams in an area-proportional manner. We provide techniques for generating the curves with circles and convex polygons, analyze the drawability of data with these shapes, and give a mechanism for deciding whether such data can be drawn with circles. For the cases where non-convex curves are necessary, our method draws an appropriate diagram using non-convex polygons. Thus, we are now always able to automatically visualize data for up to three sets
GRAPHICAL CONFIGURATION PROGRAMMING - THE STRUCTURAL DESCRIPTION, CONSTRUCTION AND EVOLUTION OF SOFTWARE SYSTEMS USING GRAPHICS
Published versio
Generating collaborative systems for digital libraries: A model-driven approach
This is an open access article shared under a Creative Commons Attribution 3.0 Licence (http://creativecommons.org/licenses/by/3.0/). Copyright @ 2010 The Authors.The design and development of a digital library involves different stakeholders, such as: information architects, librarians, and domain experts, who need to agree on a common language to describe, discuss, and negotiate the services the library has to offer. To this end, high-level, language-neutral models have to be devised. Metamodeling techniques favor the definition of domainspecific visual languages through which stakeholders can share their views and directly manipulate representations of the domain entities. This paper describes CRADLE (Cooperative-Relational Approach to Digital Library Environments), a metamodel-based framework and visual language for the definition of notions and services related to the development of digital libraries. A collection of tools allows the automatic generation of several services, defined with the CRADLE visual language, and of the graphical user interfaces providing access to them for the final user. The effectiveness of the approach is illustrated by presenting digital libraries generated with CRADLE, while the CRADLE environment has been evaluated by using the cognitive dimensions framework
Towards Model Checking Executable UML Specifications in mCRL2
We describe a translation of a subset of executable UML (xUML) into the process algebraic specification language mCRL2. This subset includes class diagrams with class generalisations, and state machines with signal and change events. The choice of these xUML constructs is dictated by their use in the modelling of railway interlocking systems. The long-term goal is to verify safety properties of interlockings modelled in xUML using the mCRL2 and LTSmin toolsets. Initial verification of an interlocking toy example demonstrates that the safety properties of model instances depend crucially on the run-to-completion assumptions
Automatic Metro Map Layout Using Multicriteria Optimization
This paper describes an automatic mechanism for drawing metro maps. We apply multicriteria optimization to find effective placement of stations with a good line layout and to label the map unambiguously. A number of metrics are defined, which are used in a weighted sum to find a fitness value for a layout of the map. A hill climbing optimizer is used to reduce the fitness value, and find improved map layouts. To avoid local minima, we apply clustering techniques to the map the hill climber moves both stations and clusters when finding improved layouts. We show the method applied to a number of metro maps, and describe an empirical study that provides some quantitative evidence that automatically-drawn metro maps can help users to find routes more efficiently than either published maps or undistorted maps. Moreover, we found that, in these cases, study subjects indicate a preference for automatically-drawn maps over the alternatives
On the role of domain ontologies in the design of domain-specific visual modeling langages
Domain-Specific Visual Modeling Languages should provide notations and abstractions that suitably support problem solving in well-defined application domains. From their userâs perspective, the languageâs modeling primitives must be intuitive and expressive enough in capturing all intended aspects of domain conceptualizations. Over the years formal and explicit representations of domain conceptualizations have been developed as domain ontologies. In this paper, we show how the design of these languages can benefit from conceptual tools developed by the ontology engineering community
Business Process Visualization - Use Cases, Challenges, Solutions
The proper visualization and monitoring of their (ongoing) business processes is crucial for any enterprise.
Thus a broad spectrum of processes has to be visualized ranging from simple, shortârunning processes to
complex longârunning ones (consisting of up to hundreds of activities). In any case, users shall be able to
quickly understand the logic behind a process and to get a quick overview of related tasks. One practical
problem arises when different fragments of a business process are scattered over several systems where they
are often modeled using different process meta models (e.g., HighâLevel Petri Nets). The challenge is to find
an integrated and userâfriendly visualization for these business processes. In this paper we discover use cases
relevant in this context. Since existing graph layout approaches have focused on general graph drawing so
far we further develop a specific approach for layouting business process graphs. The work presented in this
paper is embedded within a larger project (Proviado) on the visualization of automotive processes
On Class Diagrams, Crossings and Metrics
As a standardized software engineering diagram, the UML class diagram provides various information on the static structure of views on software while design, implementation and maintenance phase. This talk gives an overview on drawing UML class diagrams in hierarchical fashion. Therefore, common elements of class diagrams are introduced and aesthetic rules for drawing UML class
diagrams are given. These rules are based on four disciplines involved in the reading process of diagrams. After a brief introduction to our drawing algorithm, an extensive extension of the well-known Sugiyama algorithm, two details are highlighted: A new crossing reduction algorithm is presented and compared to existing ones and issues on measuring the quality of a layout are discussed
Application of shape grammar theory to underground rail station design and passenger evacuation
This paper outlines the development of a computer design environment that generates station âreferenceâ plans for analysis by designers at the project feasibility stage. The developed program uses the theoretical concept of shape grammar, based upon principles of recognition and replacement of a particular shape to enable the generation of station layouts. The developed novel shape grammar rules produce multiple plans of accurately sized infrastructure faster than by traditional means. A finite set of station infrastructure elements and a finite set of connection possibilities for them, directed by regulations and the logical processes of station usage, allows for increasingly complex composite shapes to be automatically produced, some of which are credible station layouts at âreferenceâ block plan level. The proposed method of generating shape grammar plans is aligned to London Underground standards, in particular to the Station Planning Standards and Guidelines 5th edition (SPSG5 2007) and the BS-7974 fire safety engineering process. Quantitative testing is via existing evacuation modelling software. The prototype system, named SGEvac, has both the scope and potential for redevelopment to any other countryâs design legislation
- âŚ