Solving the traffic and flitter challenges with tulip

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 sugges...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	2009 IEEE Symposium on Visual Analytics Science and Technology s. 247 - 248
Hlavní autori:	Simonetto, P., Koenig, P.-Y., Zaidi, F., Archambault, D., Gilbert, F., Trung-Tien Phan-Quang, Mathiaut, M., Lambert, A., Dubois, J., Sicre, R., Brulin, M., Vieux, R., Melancon, G.
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 01.10.2009
Predmet:	Computer interfaces Computer networks Encoding F.2.2 [Theory of Computation]: Nonnumerical Algorithms and Problems-Pattern matching H.5.0 [Information Systems]: Information Interfaces and Presentation-General Information systems Social network services Software algorithms Telecommunication traffic Visualization
ISBN:	9781424452835, 142445283X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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.
ISBN:	9781424452835 142445283X
DOI:	10.1109/VAST.2009.5334456