Visualisation Reference Framework Mark Nixon, Martin Taylor, Margaret Varga, Jan Terje Bjørke and Amy Vanderbilt.

Slides:



Advertisements
Similar presentations
A Framework for Network Visualisation Progress Report Report to IST-063/RWS-010 by the IST-059/RTG-025 Working Group on Framework for Network Visualisation.
Advertisements

Generic Network Visualization: Applications for NATO IST-043/RWS-006: WG5 Luc Beaudoin Dr. Jan Bjoerke Alain Bouchard Capt Stephen Boyne Zack Jacobson.
Graph. -traffic modeling MAXIMUM FLOW -shortest (fastest) route SHORTEST PATH -efficient distribution, logistics, pickup/delivery HAMILTONIAN PATH/CYCLE,
Visualisation Network-of-Experts Malvern, UK NOV 4-6th 2008 Amy Vanderbilt ~ Vin Taylor ~ Martin Taylor ~ Mark Nixon ~ Jan Terje Bjorke Sven Brueckner.
Spatial Database Systems. Spatial Database Applications GIS applications (maps): Urban planning, route optimization, fire or pollution monitoring, utility.
Displays Chapter 8. Key Components in Display Design.
1 Advancing Supercomputer Performance Through Interconnection Topology Synthesis Yi Zhu, Michael Taylor, Scott B. Baden and Chung-Kuan Cheng Department.
Center for Modeling & Simulation.  A Map is the most effective shorthand to show locations of objects with attributes, which can be physical or cultural.
CompTIA Network+ Chapter 2
Reading Graphs and Charts are more attractive and easy to understand than tables enable the reader to ‘see’ patterns in the data are easy to use for comparisons.
Data Structures For Image Analysis
Graph Visualization cs5764: Information Visualization Chris North.
Introduction to Spatial Analysis
WFM 6202: Remote Sensing and GIS in Water Management
Matnet – Matlab Network Simulator for TinyOS Alec WooTerence Tong July 31 st, 2002.
Internetworking Fundamentals (Lecture #2) Andres Rengifo Copyright 2008.
NonLinear Dimensionality Reduction or Unfolding Manifolds Tennenbaum|Silva|Langford [Isomap] Roweis|Saul [Locally Linear Embedding] Presented by Vikas.
STOCHASTIC GEOMETRY AND RANDOM GRAPHS FOR THE ANALYSIS AND DESIGN OF WIRELESS NETWORKS Haenggi et al EE 360 : 19 th February 2014.
SMUCSE 8344 Constraint-Based Routing in MPLS. SMUCSE 8344 Constraint Based Routing (CBR) What is CBR –Each link a collection of attributes (performance,
Properties of networks to be considered in their visualization Jan Terje Bjørke.
By LaBRI – INRIA Information Visualization Team. Tulip 2010 – version Tulip is an information visualization framework dedicated to the analysis.
Human-Computer Interaction Lecture 2: Visual representation.
Presentation on Neural Networks.. Basics Of Neural Networks Neural networks refers to a connectionist model that simulates the biophysical information.
Lecture 12: Network Visualization Slides are modified from Lada Adamic, Adam Perer, Ben Shneiderman, and Aleks Aris.
Richard Johnson  How can we use the visualization tools we currently have more effectively?  How can the Software Development.
1Ellen L. Walker Segmentation Separating “content” from background Separating image into parts corresponding to “real” objects Complete segmentation Each.
7.1. Mean Shift Segmentation Idea of mean shift:
1 ECE 453 – CS 447 – SE 465 Software Testing & Quality Assurance Instructor Kostas Kontogiannis.
S EGMENTATION FOR H ANDWRITTEN D OCUMENTS Omar Alaql Fab. 20, 2014.
Using 3D and visualising 3D. “sculptural” window elements highlighting drop shadows may help distinguish features – figure ground separation – e.g. X.
How do we represent the world in a GIS database?
Laboratory for InterNet Computing CSCE 561 Social Media Projects Ryan Benton October 8, 2012.
27th April 2006Semantics & Ontologies in GI Services Semantic similarity measurement in a wayfinding service Martin Raubal
Network and Communications Ju Wang Chapter 5 Routing Algorithm Adopted from Choi’s notes Virginia Commonwealth University.
Attributed Visualization of Collaborative Workspaces Mao Lin Huang, Quang Vinh Nguyen and Tom Hintz Faculty of Information Technology University of Technology,
Neural Networks - Lecture 81 Unsupervised competitive learning Particularities of unsupervised learning Data clustering Neural networks for clustering.
GIS Data Structures How do we represent the world in a GIS database?
Representing Uncertainty, Unknowns and Dynamics of Social Networks NX-Workshop on Social Network Analysis and Visualization for Public Safety 18 – 19 October.
Levels of Image Data Representation 4.2. Traditional Image Data Structures 4.3. Hierarchical Data Structures Chapter 4 – Data structures for.
FORSVARETS FORSKNINGSINSTITUTT Transformation of geographical information into linguistic sentences: Two case studies Jan Terje Bjørke.
Graph Theory. undirected graph node: a, b, c, d, e, f edge: (a, b), (a, c), (b, c), (b, e), (c, d), (c, f), (d, e), (d, f), (e, f) subgraph.
The n queens problem Many solutions to a classic problem: On an n x n chess board, place n queens so no queen threatens another.
Data Information, Resource Discovery, Information Taxonomy for Presentation, Selection, and Design Visualisation for Defensive Information Warfare Syndicates.
Informatics tools in network science
OOD OO Design. OOD-2 OO Development Requirements Use case analysis OO Analysis –Models from the domain and application OO Design –Mapping of model.
“Niche Work” Graham J Wills, Lucent Technologies (Bell Lab)
What is GIS? “A powerful set of tools for collecting, storing, retrieving, transforming and displaying spatial data”
Applied Cartography and Introduction to GIS GEOG 2017 EL Lecture-5 Chapters 9 and 10.
Data Mining: Concepts and Techniques1 Prediction Prediction vs. classification Classification predicts categorical class label Prediction predicts continuous-valued.
CHAPTER
Delay-Tolerant Networks (DTNs)
“Visual Representation” – for CompSci’s
AESA – Module 8: Using Dashboards and Data Monitors
Main issues: • What do we want to build • How do we write this down
Course Outcomes of Object Oriented Modeling Design (17630,C604)
Computer Network Topology
Ch 13 WAN Technologies and Routing
Graphic Organizers.
Critical Design in Statistical Visualization
Complexity Time: 2 Hours.
NSI Topology Thoughts on how topology fits into the NSI architecture
Mean Shift Segmentation
Chapter 9: Graphs Basic Concepts
Analysis models and design models
Ajay S. Pillai, Viktor K. Jirsa  Neuron 
Ajay S. Pillai, Viktor K. Jirsa  Neuron 
NonLinear Dimensionality Reduction or Unfolding Manifolds
Computer network technology
Chapter 9: Graphs Basic Concepts
Design.
Presentation transcript:

Visualisation Reference Framework Mark Nixon, Martin Taylor, Margaret Varga, Jan Terje Bjørke and Amy Vanderbilt

IST Reference Model

Summary of Data Types Acquisition Streamed regular sporadic Static Sources Single Multiple Choice User-selected Externally imposed Identification Located Labelled Values Analogue scalar vector Categoric (classic) symbolic linguistic non-linguistic non-symbolic linguistic non-linguistic Categoric (fuzzy) symbolic (non-linguistic) non-symbolic (non-linguistic) Interrelations User-structured Source-structured

Summary of Display Types Display Timing static dynamic Data Selection User-selected Algorithmically directed Data Placement Located Labelled Data Values Analogue scalar vector Categoric linguistic non-linguistic

Some examples of mapping data types onto display types Data typeDisplay typeComment Streamed DynamicThe user ordinarily wants to act when some event occurs Located 2-D or 3-D Located The display is a 2-D or 3-D map of some attribute(s) of the data. If the location identification of the data are in higher dimensional spaces, there is no such natural mapping. Tricks must be used. Labelled The display is likely to be tabular, or some kind of a graph such as a histogram or pie chart Analogue scalar Even if the data are identified by label, its analogue values map naturally to analogue display variables such as the length of a line or the brightness of a pixel. Analogue vector 2-D A 2-D attribute can be mapped onto an area display, a line with length and orientation, a colour hue, a sound location, a sound intensity and pitch, and so forth, all analogue vector attributes of the display. 3-D,A 3-D attribute can similarly be mapped into a volumetric display. Analogue vector Higher dimensional analogue attributes can be displayed, but the mapping is less obviously "natural." Categoric Categoric data values have no natural relation to analogue display values, and must be displayed categorically. The categoric display attributes may or may not map "naturally" ont the categoric data attributes. This kind of mapping is usually considered to be "cognitive metaphor."

Global Attributes of Networks Relevant to Visualisation Topology –Connectivity –Links & nodes –Symmetries –Boundaries –Hierarchical –Tree –Topology evolution in time and space –Embedding space Located/partially located/un-located –Multipartite –Cyclicity –Minimum spanning tree –Closures Reflexive-transitive closure (ancestral) –Hyperstructure Constraints –Rules Thresholds and changes Metrical properties –Path length –Diameter –Density Traffic –Flow –Path –Routing Logical/physical Redundancy Open/Closed Layers Overlapping – partial, complete –Relationships

Local Attributes of Networks Relevant to Visualisation Nodes –Node ID –Location –Node type –Weight Fuzzy Probabilistic –Open/Closed –Input/output property –Memory –Constraints & rules –Informational properties Threshold Links –Link ID –Location –Capacity –Weight Fuzzy Probabilistic –Strength –Direction –Availability –Type of traffic, e.g. protocols –Route –The medium –Memory –Constraints & rules –Informational properties

Representational Attributes of Networks Shape properties Layout Susceptibility to aggregation Duality ……

Attributes of Representations Symbology Visual separation Colour coding Layout Preservation of reference …….

Way Forward Network Visualisation Test Examples –Illustrate the framework –Reveal the missing components –Identify redundancies –Reveal conflicts Develop collaboration environment –WIKI –Bulletin board Integrate the VisTG model, data types and display types in the context of networks