
Kun-Ting ChenMonash University (Australia) · Caulfield School of Information Technology
Kun-Ting Chen
Master of Science
About
14
Publications
1,287
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
48
Citations
Introduction
My research interests concern graph layout algorithms, network visualisation, and software visualisation.
Publications
Publications (14)
There are many methods for projecting spherical maps onto the plane. Interactive versions of these projections allow the user to centre the region of interest. However, the effects of such interaction have not previously been evaluated. In a study with 120 participants we find interaction provides significantly more accurate area, direction and dis...
In this paper, we report on a study of visual representations for cyclical data and the effect of interactively wrapping a bar chart 'around its boundaries'. Compared to linear bar chart, polar (or radial) visualisations have the advantage that cyclical data can be presented continuously without mentally bridging the visual 'cut' across the left-an...
In this paper, we report on a study of visual representations for cyclical data and the effect of interactively wrapping a bar chart ‘around its boundaries’. Compared to linear bar chart, polar (or radial) visualisations have the advantage that cyclical data can be presented continuously without mentally bridging the visual ‘cut’ across the left-an...
We explore network visualisation on a two-dimensional torus topology that continuously wraps when the viewport is panned. That is, links may be “wrapped” across the boundary, allowing additional spreading of node positions to reduce visual clutter. Recent work has investigated such pannable wrapped visualisations, finding them not worse than unwrap...
We explore network visualisation on a two-dimensional torus topology that continuously wraps when the viewport is panned. That is, links may be “wrapped” across the boundary, allowing additional spreading of node positions to reduce visual clutter. Recent work has investigated such pannable wrapped visualisations, finding them not worse than unwrap...
We investigate visualisations of networks on a 2-dimensional
torus topology, like an opened-up and flattened doughnut.
That is, the network is drawn on a rectangular area while
“wrapping” specific links around the border. Previous work
on torus drawings of networks has been mostly theoretical,
limited to certain classes of networks, and not evaluat...
It becomes a challenge to design an efficient load balancing method via live virtual machine (VM) migration without degrading application performance. Two major performance impacts on hosted applications that run on a VM are the system load balancing degree and the total time till a balanced state is reached. Existing load balancing methods usually...
With the popular usage of Google Maps and smart phones, more and more people are using smart phones to surf and inquire about travel information. As a result, every major city plans to push the existing online public transportation trip planning system beyond traditional computer users to mobile phone users. The trip planning system is based on the...
To cope with rapidly increasing Internet usage nowadays, providing Internet services using multiple servers has become a necessity. To ensure sufficient service quality and server utilization at the same time, effective methods are needed to spread load among servers properly. Existing load balancing methods often assume servers are homogeneous and...
Projects
Projects (2)
Interactive Torus Wrapping for Network Visualisation