2007 6th International Asia-Pacific Symposium on Visualization

5-7 Feb. 2007

Filter Results

Displaying Results 1 - 25 of 34
  • Asia-Pacific Symposium on Visualization 2007 - Cover

    Publication Year: 2007, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (1044 KB)
    Freely Available from IEEE
  • Cover image credits

    Publication Year: 2007, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (21 KB)
    Freely Available from IEEE
  • Author index

    Publication Year: 2007, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (17 KB)
    Freely Available from IEEE
  • Asia-Pacific Symposium on Visualisation 2007 - Proceedings - Title

    Publication Year: 2007, Page(s): i
    Request permission for commercial reuse | PDF file iconPDF (115 KB)
    Freely Available from IEEE
  • Copyright - 2007

    Publication Year: 2007, Page(s): ii
    Request permission for commercial reuse | PDF file iconPDF (14 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 2007, Page(s):iii - iv
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2007, Page(s): v
    Request permission for commercial reuse | PDF file iconPDF (21 KB) | HTML iconHTML
    Freely Available from IEEE
  • VGTC Committees

    Publication Year: 2007, Page(s): vi
    Request permission for commercial reuse | PDF file iconPDF (47 KB)
    Freely Available from IEEE
  • Committees

    Publication Year: 2007, Page(s): vii
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE
  • Reviewers

    Publication Year: 2007, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (30 KB)
    Freely Available from IEEE
  • Visual analytics: A grand challenge in science - turning information overload into the opportunity of the decade [Keynote Address]

    Publication Year: 2007, Page(s): ix
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (74 KB)

    Provides an abstract of the keynote presentation and a brief professional biography of the presenter. The complete presentation was not made available for publication as part of the conference proceedings. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualization and analysis of email networks

    Publication Year: 2007, Page(s):1 - 8
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (4328 KB) | HTML iconHTML

    This paper presents various methods for visualization and analysis of email networks; visualization on the surface of a sphere to reveal communication patterns between different groups, a hierarchical drawing displaying the centrality analysis of nodes to emphasize important nodes, a 2.5D visualization for temporal email networks to analyze the evolution of email relationships changing over time, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualization of sanitized email logs for spam analysis

    Publication Year: 2007, Page(s):9 - 16
    Cited by:  Papers (3)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (7244 KB) | HTML iconHTML

    Email has become an integral method of communication. However, it is still plagued by vast amounts of spam. Many statistical techniques, such as Bayesian filtering, have been applied to this problem, and been proven useful. But these techniques in general require training. Another common method of spam prevention is blacklisting known spam sources. In order to do this, the sources must be identifi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualisation and analysis of the internet movie database

    Publication Year: 2007, Page(s):17 - 24
    Cited by:  Papers (8)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3020 KB) | HTML iconHTML

    In this paper, we present a case study for the visualisation and analysis of large and complex temporal multivariate networks derived from the Internet movie database (IMDB). Our approach is to integrate network analysis methods with visualisation in order to address scalability and complexity issues. In particular, we defined new analysis methods such as (p,q)-core and 4-ring to identify importan... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualizing social interaction in open source software projects

    Publication Year: 2007, Page(s):25 - 32
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (808 KB) | HTML iconHTML

    Open source software projects such as Apache and Mozilla present an opportunity for information visualization. Since these projects typically require collaboration between developers located far apart, the amount of electronic communication between them is large. Our goal is to apply information visualization techniques to assist software engineering scientists and project managers with analyzing ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • GraphScape: integrated multivariate network visualization

    Publication Year: 2007, Page(s):33 - 40
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3890 KB) | HTML iconHTML

    In this paper, we introduce a new method, GraphScape, to visualize multivariate networks, i.e., graphs with multivariate data associated with their nodes. GraphScape adopts a landscape metaphor with network structure displayed on a 2D plane and the surface height in the third dimension represents node attribute. More than one attribute can be visualized simultaneously by using multiple surfaces. I... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Integrated visualization system for monitoring security in large-scale local area network

    Publication Year: 2007, Page(s):41 - 44
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (701 KB) | HTML iconHTML

    In monitoring security of enterprise or campus networks, detecting attacks from internal network to external network is becoming more and more important. After detecting such attacks, finding the location of the target PC is sometimes needed. This paper describes a visual security monitoring system for large-scale local area network. The system integrates three information, logical, temporal, and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Labeling collinear sites

    Publication Year: 2007, Page(s):45 - 51
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (256 KB) | HTML iconHTML

    We consider a map labeling problem, where the sites to be labeled are restricted on a line L. This is quite common e.g. in schematized maps for road or subway networks. Each site si, is associated with an axis-parallel witimeshi label li, which can be placed anywhere on the "boundary" of the input line L. The main task is to place the labels in distinct ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficiently drawing a significant spanning tree of a directed graph

    Publication Year: 2007, Page(s):53 - 59
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (271 KB) | HTML iconHTML

    A directed graph can model any ordered relationship between objects. However, visualizing such graphs can be a challenging task. If the graph is undirected, a popular strategy is to choose a significant spanning tree, nominate a vertex as the root, for example the vertex whose distance from all other vertices is minimal, hang the significant spanning subtrees from this root and add in the remainin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Directed graphs and rectangular layouts

    Publication Year: 2007, Page(s):61 - 64
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (181 KB) | HTML iconHTML

    This paper deals with the problem, arising in practice, of drawing a directed graph as a collection of disjoint, isothetic rectangles, where the rectangles of the nodes of each edge must touch and where the placement of the rectangles respects the ordering of the edges. It provides characterizations for those graphs having the special type of rectangular layout known as a rectangular dual. It then... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Many-to-one boundary labeling

    Publication Year: 2007, Page(s):65 - 72
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (453 KB) | HTML iconHTML

    In boundary labeling, each point site is uniquely connected to a label placed on the boundary of an enclosing rectangle by a leader, which may be a rectilinear or straight line segment. To our knowledge, all the results reported in the literature for boundary labeling deal with the so-called one-to-one boundary labeling, i.e., different sites are labelled differently. In certain applications of bo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Overlapping cluster planarity

    Publication Year: 2007, Page(s):73 - 80
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (236 KB) | HTML iconHTML

    Cluster planarity is currently recognized as one of the most interesting problem in graph drawing. This paper investigates a new direction in this area by addressing the following question: let G be a graph along with a hierarchy of vertex clusters, where clusters can partially intersect. Does G admit a drawing where each cluster is inside a simple closed region, no two edges intersect, and no edg... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Navigation techniques for 2.5D graph layout

    Publication Year: 2007, Page(s):81 - 84
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (721 KB) | HTML iconHTML

    In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy some of the criteria. In particular, we design and implement methods for trees, clustered graphs and hierarchical graphs drawn in 2.5 dimensions. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Force-directed drawing method for intersecting clustered graphs

    Publication Year: 2007, Page(s):85 - 92
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (852 KB) | HTML iconHTML

    We present a novel force-directed method for drawing an intersecting clustered graph. This is based upon simulation of a virtual physical system. The graph can express complicated structures such as inclusion and intersection between vertices/clusters as well as adjacency, and it is used in diverse fields such as creativity support, software engineering, and semantic Web. We describe definitions, ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Analysis of a high-dimensional approach to interactive graph drawing

    Publication Year: 2007, Page(s):93 - 96
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (309 KB) | HTML iconHTML

    Graph drawing is an information visualization technology for illustrating relations between objects. Interactive graph drawing is often important since it is difficult to statically lay out complex graphs. For the interactive drawing of general undirected graphs, we have proposed the high-dimensional approach, which uses static graph layouts in high-dimensional spaces to dynamically find two-dimen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.