Map-Based Navigation in a Graphical MOO

Traditional MUDs and MOOs lack support for global wareness and simple navigation. These problems can be addressed by the introduction of a map-based navigation tool. In this paper we report on the design and evaluation of such a tool for MOOsburg, a graphical 2D MOO based on the town of Blacksburg, Virginia. The tool supports exploration and place-based tasks in the MOO. It also allows navigation of a large-scale map and encourages users to develop survey knowledge of the town. An evaluation revealed some initial usability problems with our prototype and suggested new design ideas that may better support users. Using these results, the lessons learned about map-based navigation are presented

TGVizTab: An ontology visualisation extension for Protégé

Ontologies are gaining a lot of interest and many are being developed to provide a variety of knowledge services. There is an increasing need for tools to graphically and in-teractively visualise such modelling structures to enhance their clarification, verification and analysis. Protégé 2000 is one of the most popular ontology modelling tools currently available. This paper introduces TGVizTab; a new Protégé plugin based on TouchGraph technology to graphically visualise Protégé?s ontologies

A visual workspace for constructing hybrid MDS algorithms and coordinating multiple views

Data can be distinguished according to volume, variable types and distribution, and each of these characteristics imposes constraints upon the choice of applicable algorithms for their visualisation. This has led to an abundance of often disparate algorithmic techniques. Previous work has shown that a hybrid algorithmic approach can be successful in addressing the impact of data volume on the feasibility of multidimensional scaling (MDS). This paper presents a system and framework in which a user can easily explore algorithms as well as their hybrid conjunctions and the data flowing through them. Visual programming and a novel algorithmic architecture let the user semi-automatically define data flows and the co-ordination of multiple views of algorithmic and visualisation components. We propose that our approach has two main benefits: significant improvements in run times of MDS algorithms can be achieved, and intermediate views of the data and the visualisation program structure can provide greater insight and control over the visualisation process

WWW Site Design Using Fisheye Views: An Empirical Study

In many contexts, decision-making situations call for examination of local detail without losing awareness of global context. Knowledge will be more useful if organized and presented accordingly. Fisheye view methods are one way of effective knowledge presentation and have been used in displaying various knowledge structures. This study explores an application of the fisheye view concept on World Wide Web site design. A related experiment and following empirical tests are described

Graph layout for applications in compiler construction

We address graph visualization from the viewpoint of compiler construction. Most data structures in compilers are large, dense graphs such as annotated control flow graph, syntax trees, dependency graphs. Our main focus is the animation and interactive exploration of these graphs. Fast layout heuristics and powerful browsing methods are needed. We give a survey of layout heuristics for general directed and undirected graphs and present the browsing facilities that help to manage large structured graph

A virtual workspace for hybrid multidimensional scaling algorithms

In visualising multidimensional data, it is well known that different types of algorithms to process them. Data sets might be distinguished according to volume, variable types and distribution, and each of these characteristics imposes constraints upon the choice of applicable algorithms for their visualization. Previous work has shown that a hybrid algorithmic approach can be successful in addressing the impact of data volume on the feasibility of multidimensional scaling (MDS). This suggests that hybrid combinations of appropriate algorithms might also successfully address other characteristics of data. This paper presents a system and framework in which a user can easily explore hybrid algorithms and the data flowing through them. Visual programming and a novel algorithmic architecture let the user semi-automatically define data flows and the co-ordination of multiple views

A proposal from the point of view of information visualization and human computer interaction for the visualization of distributed system load

In this article we show how the design of interfaces for the visualization of distributed system load can benefit from the combination of concepts and techniques from Information Visualization and Human Computer Interaction (HCI). Every distributed systems administrator must handle a high volume of information and the exploration and analysis of this data set has become increasingly difficult. We propose how to visualize the parameters involved in the load of a distributed system to obtain an effective visualization tool in order to reduce the user cognitive workload and help the user make the right decisions in a productive way.Facultad de Informátic

A parent-centered radial layout algorithm for interactive graph visualization and animation

We have developed (1) a graph visualization system that allows users to explore graphs by viewing them as a succession of spanning trees selected interactively, (2) a radial graph layout algorithm, and (3) an animation algorithm that generates meaningful visualizations and smooth transitions between graphs while minimizing edge crossings during transitions and in static layouts. Our system is similar to the radial layout system of Yee et al. (2001), but differs primarily in that each node is positioned on a coordinate system centered on its own parent rather than on a single coordinate system for all nodes. Our system is thus easy to define recursively and lends itself to parallelization. It also guarantees that layouts have many nice properties, such as: it guarantees certain edges never cross during an animation. We compared the layouts and transitions produced by our algorithms to those produced by Yee et al. Results from several experiments indicate that our system produces fewer edge crossings during transitions between graph drawings, and that the transitions more often involve changes in local scaling rather than structure. These findings suggest the system has promise as an interactive graph exploration tool in a variety of settings

Visualizing the Knowledge Base of a Strategic Planning Expert System

A knowledge base can be very large containing many hundreds of objects and relationships. A graphical representation can assist in exploring and understanding the structure. The work discussed here is concerned with visualizing the knowledge structure in an expert system that has been developed for strategic planning. The method involves determining an initial layout for the structure followed by application of a fisheye viewing technique. Here we outline the approach taken to produce an initial layout of this complex structure