Measuring and evaluating the runtime of parallel programs is a diicult task. In this paper we present tools for performance evaluation and visualization in the distributed thread system (DTS), a programming environment for portable parallel applications. We describe the visualization of a parallel trace log as an execution graph using a novel layout algorithm which has been tailored to expose t...

When people explore and manage information, they think in terms of topics and themes. However, the software that supports information exploration sees text at only the surface level. In this paper we show how topic modeling – a technique for identifying latent themes across large collections of documents – can support semantic exploration. We present TopicViz, an interactive environment for inf...

Co-referential relations between textual and visual elements in illustrations can be encoded efficiently through textual labels. The labels support students to learn unknown terms and focus their attention on important aspects of the illustration; while a functional and aesthetic label layout aims at guaranteeing the readability of text strokes as well as preventing the referential mismatches. ...

Large collections of text documents are increasingly common, both in business and personal information environments. Tools from the field of information visualisation are being used to help users make sense of and extract useful knowledge from such collections. Flat text collections are often visualised using distance calculations between documents and subsequent (distance-preserving) projectio...

Technologies for discovering sounds in large databases can help breaking the boundary between exploration and music performance. In this paper, we present a system for exploring loops from Freesound. Sound files are grouped by their most common repetition periods, so that they can be played in sync. A graph layout algorithm is used to organize sounds in a two-dimensional plane so that loops wit...

This report presents a toolkit for automatic analysis and visualization of software written in NUT. This work is a continuation of the research described in TRITA-IT R 95:16; KTH/IT/R-95/16-SE. It uses the set of reflective functions for analysis of classes developed in the latter. The main part of the report is a description of the automatic layout algorithm which guarantees good quality of au...

Techniques for drawing graphs based on force-directed placement and virtual physical models have proven surprisingly successful in producing good layouts of undirected graphs. Aspects of symmetry, structure, clustering and reasonable vertex distribution arise from initial, formless clouds of points. However, when nodes must be labeled and point vertices are replaced by non-point vertices, simpl...

Dynamically recon gurable FPGAs have the potential to dramatically improve logic density by time-sharing a physical FPGA device. This paper presents a networkow based partitioning algorithm for dynamically recon gurable FPGAs based on the architecture in [2]. Experiments show that our approach outperforms the enhanced force-directed scheduling method in [2] in terms of communication cost.

High-level synthesis of data paths with concurrent self-checking abilities is discussed to balance redundancy, latency, and checking effectiveness. The nominal and the checking computations are scheduled and allocated contemporaneously by using a force-directed approach to limit the number of redundant units required to achieve detection within the latency of the nominal computation only. Resou...

The layout of a business process model influences how easily it can be understood. Existing layout features in process modeling tools often rely on graph representations, but do not take the specific properties of business process models into account. In this paper, we propose an algorithm that is based on a set of constraints which are specifically identified toward establishing a readable lay...