Solving the traffic and flitter challenges with tulip

Author

Simonetto, Paolo ; Koenig, P.-Y. ; Zaidi, Fatiha ; Archambault, Daniel ; Gilbert, F. ; Trung-Tien Phan-Quang ; Mathiaut, M. ; Lambert, Andrew ; Dubois, Jonathan ; Sicre, Ronan ; Brulin, M. ; Vieux, R. ; Melancon, Guy

Author_Institution

LaBRI, Univ. de Bordeaux I, Bordeaux, France

fYear

2009

fDate

12-13 Oct. 2009

Abstract

We present our visualization systems and findings for the badge and network traffic as well as the social network and geospatial challenges of the 2009 VAST contest. The summary starts by presenting an overview of our time series encoding of badge information and network traffic. Our findings suggest that employee 30 may be of interest. In the second part of the paper, we describe our system for finding subgraphs in the social network subject to degree constraints. Subsequently, we present our most likely candidate network which is similar to scenario B.

Keywords

business communication; computational geometry; data visualisation; encoding; graph theory; graphical user interfaces; query processing; social networking (online); time series; 2009 VAST contest; Tulip graph drawing software; badge traffic; candidate network traffic; embassy leak; employee suspicious transmission; flitter challenge; geospatial challenge; graph visualization system; social network; time series encoding; traffic challenge; visual query generator interface; Computer interfaces; Computer networks; Encoding; Information systems; Social network services; Software algorithms; Telecommunication traffic; Visualization; F.2.2 [Theory of Computation]: Nonnumerical Algorithms and Problems—Pattern matching; H.5.0 [Information Systems]: Information Interfaces and Presentation—General;

fLanguage

English

Publisher

ieee

Conference_Titel

Visual Analytics Science and Technology, 2009. VAST 2009. IEEE Symposium on

Conference_Location

Atlantic City, NJ

Print_ISBN

978-1-4244-5283-5

Type

conf

DOI

10.1109/VAST.2009.5334456

Filename

5334456