The ability to visualize data often leads to new insights. Data that is more than three dimensional must be visualized as a series of projections or transformed into some other representation which usually causes a loss of details. Parallel coordinates allows one to visualize data in two dimensions without a loss of information. In this paper, we discuss the use of parallel coordinates to visualize fuzzy data. Fuzzy data may consist of fuzzy rules, which can be viewed as cutting a swath through an n-dimensional space. Fuzzy clusters may also be considered fuzzy data in a similar way. Examples are given from three domains. The examples show that parallel coordinates can be used to nd extraneous fuzzy rules, separate fuzzy clusters as well as validate previous ndings about data sets.

In this paper, we develop methodologies and algorithms for multi-agent visualisation. For different systems such as mobile, personal, or communicating agents, we identify metrics to define a distance between individual agents. Given a distance table, we develop an algorithm based on spring embedding and one on matrix theory to visualise the agents. We evaluate the algorithm in several scenarios.

Routing Architecture and Layout Synthesis for Multi-FPGA Systems Doctor of Philosophy, 1999 Mohammed A. S. Khalid Department of Electrical and Computer Engineering University of Toronto Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing architecture, which is the manner in which wires, FPGAs and Field-Programmable Interconnect Devices (FPIDs) are connected.

With the data explosion in biology visualisation techniques are of paramount importance for further progress. In this paper, we review traditional visualisation by clustering and dendrogram, which are prevailent in biology. We discuss its shortcomings and develop an alternative approach: Space Explorer .

Interesting features of complex agent systems can be captured as multivariate data. There are a number of different approaches to visualizing such data. In this paper, we focus on methods which reduce the dimensions of the data through matrix transformations and then visualise the entities in the lower-dimensional space.

A Network-on-Chip (NoC) is increasingly needed to interconnect the large number and variety of Intellectual Property (IP) cells that make up a System-on-Chip (SoC). The network must be able to communicate between cells in different clock domains, and do so with minimal space, power, and latency overhead. In this paper, we describe an asynchronous NoC using an elastic-flow protocol, and methods of automatically generating a topology and router placement. We use the communication profile of the SoC design to drive the binary-tree topology creation and the physical placement of routers, and a force-directed approach to determine router locations. The nature of elastic-flow removes the need for large router buffers, and thus we gain a significant power and space advantage compared to traditional NoCs. Additionally, our network is deadlock-free, and paths have bounded worst-case communication latencies. Keywords: VLSI, GALS, Network-on-chip, Asynchronous 1

Current tools for VLSI placement are based either on quadratic placement, or on min-cut heuristics, or on simulated annealing. For the most complex chips with millions of movable objects, algorithms based on quadratic placement seem to yield the best results within reasonable time. In this paper we prove several new theoretical results on quadratic placement. We point out connections to random walks and electrical networks. Moreover, we argue that quadratic placement has, in contrast to the other approaches, some well-defined stability properties. Finally, we consider the question how to choose the weights of the clique edges representing a multiterminal net optimally.

Actor-issue analysis

This paper proposes a modified spring modeling algorithm for drawing undirected graphs, that is an extension of the forceddirected placement method of spring modeling algorithm by Eades. We call it dynamic parameter spring modeling algorithm. This algorithm is not only a general algorithm for graph layout, but also it is more suitable to get a semi-stable graph layout. A semi-stable layout is an intermediate layout, which leads to the final layout. The method of drawing this type of intermediate layout can shorten the cycle of the user's editing and speed up the process of layout in graph editing.

this paper, we describe a more intuitive approach to argumentation, which is based on its visualization