Timothy M. Shead Sandia National Laboratories

Slides:



Advertisements
Similar presentations
© Telelogic AB [1] Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company for the United States Department of Energys.
Advertisements

Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energys National Nuclear.
Timothy M. Shead Sandia National Laboratories
Conclusion Kenneth Moreland Sandia National Laboratories Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company,
Advanced ParaView Visualization Kenneth Moreland, David Thompson, Timothy Shead Sandia National Laboratories Utkarsh Ayachit Kitware Inc. John Biddiscombe.
Parallel Visualization Kenneth Moreland Sandia National Laboratories Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin.
Section 2.5: Graphs and Trees
Algorithms (and Datastructures) Lecture 3 MAS 714 part 2 Hartmut Klauck.
Graphs and Finding your way in the wilderness
Database Systems: Design, Implementation, and Management Tenth Edition
Carolina Galleguillos, Brian McFee, Serge Belongie, Gert Lanckriet Computer Science and Engineering Department Electrical and Computer Engineering Department.
Graphs Chapter 12. Chapter Objectives  To become familiar with graph terminology and the different types of graphs  To study a Graph ADT and different.
Chapter 8, Part I Graph Algorithms.
Prim’s Algorithm from a matrix A cable TV company is installing a system of cables to connect all the towns in the region. The numbers in the network are.
Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin Corporation,
Chapter 8 Content-Based Image Retrieval. Query By Keyword: Some textual attributes (keywords) should be maintained for each image. The image can be indexed.
Unstructured Data Partitioning for Large Scale Visualization CSCAPES Workshop June, 2008 Kenneth Moreland Sandia National Laboratories Sandia is a multiprogram.
1 Representing Graphs. 2 Adjacency Matrix Suppose we have a graph G with n nodes. The adjacency matrix is the n x n matrix A=[a ij ] with: a ij = 1 if.
© University of Minnesota Data Mining for the Discovery of Ocean Climate Indices 1 CSci 8980: Data Mining (Fall 2002) Vipin Kumar Army High Performance.
Classifier Decision Tree A decision tree classifies data by predicting the label for each record. The first element of the tree is the root node, representing.
CSE351/ IT351 Modeling And Simulation Choosing a Mesh Model Dr. Jim Holten.
Massive Graph Visualization: LDRD Final Report Sandia National Laboratories Sand Printed October 2007.
1 Data Structures and Algorithms Graphs I: Representation and Search Gal A. Kaminka Computer Science Department.
Graphs Chapter 12. Chapter 12: Graphs2 Chapter Objectives To become familiar with graph terminology and the different types of graphs To study a Graph.
Spring 2010CS 2251 Graphs Chapter 10. Spring 2010CS 2252 Chapter Objectives To become familiar with graph terminology and the different types of graphs.
Tuple – InfoVis Publication Browser CS533 Project Presentation by Alex Gukov.
Fall 2007CS 2251 Graphs Chapter 12. Fall 2007CS 2252 Chapter Objectives To become familiar with graph terminology and the different types of graphs To.
Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy under contract.
Chapter 4 Database Management Systems. Chapter 4Slide 2 What is a Database Management System (DBMS)?  Database An organized collection of related data.
Important Problem Types and Fundamental Data Structures
“This presentation is for informational purposes only and may not be incorporated into a contract or agreement.”
2007 Trilinos User Group Meeting - 11/7/2007 Leveraging Trilinos for Data Mining & Data Analysis Danny Dunlavy (1415) Tim Shead (1424) Pat Crossno (1424)
Database System Concepts and Architecture Lecture # 3 22 June 2012 National University of Computer and Emerging Sciences.
By LaBRI – INRIA Information Visualization Team. Tulip 2010 – version Tulip is an information visualization framework dedicated to the analysis.
Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Cpt S 223 – Advanced Data Structures Graph Algorithms: Minimum.
Trilinos User Group Meeting Thursday, November 8 th, 2007 Timothy M. Shead (1424) Danny Dunlavy (1415) SAND P Sandia is a multiprogram laboratory.
Database System Concepts and Architecture Lecture # 2 21 June 2012 National University of Computer and Emerging Sciences.
MA/CSSE 473 Day 12 Insertion Sort quick review DFS, BFS Topological Sort.
Computer Science 112 Fundamentals of Programming II Introduction to Graphs.
Computer Vision Lecture 5. Clustering: Why and How.
Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Graphs.
Lesson 1: Exploring Access Learning Objectives After studying this lesson, you will be able to: Start Access and identify elements of the application.
SINGULAR VALUE DECOMPOSITION (SVD)
The Table Lens: Merging Graphical and Symbolic Representations in an Interactive Focus+Context Visualization for Tabular Information Ramana Rao and Stuart.
ITEC 2620A Introduction to Data Structures Instructor: Prof. Z. Yang Course Website: 2620a.htm Office: TEL 3049.
1 CSC 594 Topics in AI – Text Mining and Analytics Fall 2015/16 6. Dimensionality Reduction.
1. 2 CIShell Features A framework for easy integration of new and existing algorithms written in any programming language. CIShell Sci2 Tool NWB Tool.
Presented By: Solutions Delivery Managing Reports in CRMnext.
Chapter 2: Getting to Know Your Data
Data Structures CSCI 132, Spring 2014 Lecture 38 Graphs
Site Report DOECGF April 26, 2011 W. Alan Scott Sandia National Laboratories Sandia National Laboratories is a multi-program laboratory managed and operated.
Chapter 11 Information Visualization
ParaView III Software Methodology Update Where to now November 29, 2006 John Greenfield Sandia is a multiprogram laboratory operated by Sandia Corporation,
Graphs. Graphs Similar to the graphs you’ve known since the 5 th grade: line graphs, bar graphs, etc., but more general. Those mathematical graphs are.
Graphs A graphs is an abstract representation of a set of objects, called vertices or nodes, where some pairs of the objects are connected by links, called.
Data Visualization Fall Information Visualization Fall 2015Data Visualization2 Upon now, we dealt with scientific visualization (scivis) Scivis.
Graphs Chapter 12. Chapter 12: Graphs2 Chapter Objectives To become familiar with graph terminology and the different types of graphs To study a Graph.
Source: CSE 214 – Computer Science II Graphs.
Graph Representations And Traversals. Graphs Graph : – Set of Vertices (Nodes) – Set of Edges connecting vertices (u, v) : edge connecting Origin: u Destination:
Exploring High-D Spaces with Multiform Matrices and Small Multiples Presented by Ray Chen and Sorelle Friedler Authors: MacEachren, A., Dai, X., Hardisty,
Performing Fault-tolerant, Scalable Data Collection and Analysis James Jolly University of Wisconsin-Madison Visualization and Scientific Computing Dept.
Graph Terms By Susan Ott. Vertices Here are 7 vertices without any edges Each Vertex is labeled a different color and number.
1 Dimensions / Depth James Slack CPSC 533C February 10, 2003.
Datamining : Refers to extracting or mining knowledge from large amounts of data Applications : Market Analysis Fraud Detection Customer Retention Production.
Chapter 9: Graphs Basic Concepts
Graphs G = (V, E) V are the vertices; E are the edges.
Chapter 16 1 – Graphs Graph Categories Strong Components
Trees-2, Graphs Data Structures with C Chpater-6 Course code: 10CS35
Important Problem Types and Fundamental Data Structures
Chapter 9: Graphs Basic Concepts
Presentation transcript:

Timothy M. Shead Sandia National Laboratories InfoVis in ParaView Sandia is a multiprogram laboratory operated by Sandia Corporation, a Lockheed Martin Company, for the United States Department of Energy’s National Nuclear Security Administration under contract DE-AC04-94AL85000. This document is SAND Number: 2008-5203 P Timothy M. Shead Sandia National Laboratories

Topics Applications Data Structures Data Sources Data Transformations Algorithms Views

Applications ParaView OverView Vertical Applications All of the capabilities mentioned here are ParaView plugins. Use them in ParaView today! OverView The OverView client provides a simplified (relative to ParaView) client intended for Infovis use. The OverView UI can be "branded" and bundled with a specific set of plugins to provide a domain-specific solution. The OverView UI will continue to evolve relative to the standard ParaView UI. Vertical Applications Some problem domains will merit their own custom clients, with simplified, specialized user interfaces.

Data Structures Tables Graphs (Directed, Undirected, Directed Acyclic, Trees) N-Way Arrays

Tables vtkTable: manages a heterogeneous collection of VTK arrays. API enforces equal lengths for every column. Provides API for getting / setting individual “cells” or entire rows. “ID” “Name” “Age” vtkIntArray vtkStringArray vtkIntArray GetValue() 1 Bob 12 2 Ann vtkVariant 25 3 Sue 72 GetRow() 4 Bill 11 5 Dave 31 vtkVariantArray 6 Jill 36 7 Rick 32 InsertNextRow() 8 Luis 68 vtkVariantArray

Graphs vtkGraph provides a generic, read-only interface to an arbitrary graph. Derivatives provide increasingly-specialized interfaces. Provides per-vertex and per-edge attributes. Distributed graph work with Indiana University is ongoing.

N-Way Arrays Arbitrary-dimension sparse and dense arrays. Several different levels of abstraction: Generic arrays without type. Arbitrary-dimension arrays with type. Arrays with specific dimension and type. Storage-specific interfaces. Sparse arrays use coordinate storage.

Data Sources Databases MySQL Postgres Oracle SQLite ODBC / Netezza Graph Sources Random Graph Source Array Sources Diagonal Matrix Source Random Sparse Array Source Table Readers DelimitedText FixedWidth ISI, RIS Graph Readers Dimacs DOT GXL Chaco XML Tulip Databases MySQL Postgres Oracle SQLite ODBC / Netezza

Data Transformations Data Object to Table Table to Graph Table to Tree Adjacency Matrix to Edge Table Array to Table Table to Sparse Array

Algorithms Table Algorithms Graph Algorithms Array Algorithms Univariate Statistics Descriptive Statistics Order Statistics Bivariate Statistics Contingency Statistics Correlative Statistics Merge Columns Split Table Field Merge Tables Threshold Table Graph Algorithms Brandes Centrality Breadth First Search Connected Components Extract Selected Graph Array Algorithms Cosine Similarity (Thresholded) Log Weighting Matricize Array Matrix Column Norm Normalize Matrix Vectors Transpose Matrix

Views Table View Record View Attribute View Geospatial View Graph View Hierarchy View Landscape View

Table View Simple client-side spreadsheet-like display of table data. Needs to be merged with ParaView Spreadsheet View.

Record View Displays a single record (row) from a table. Useful when the size or number of columns make it impractical to browse using a Table View.

Attribute View Provides a “textual histogram” of table data. Sort values or counts

Geospatial View Displays geo-referenced data on an interactive globe. Variable-resolution background texture maps. Polyline-based political boundaries.

Graph View Arbitrary layout algorithms. Attribute-based rendering: vertex / edge labels, vertex / edge color, vertex icons.

Hierarchy View Displays a graph, embedded within a hierarchy (tree). All of the rendering functionality of a Graph View. For data that incorporates hierarchies, provides a fast layout that’s more meaningful than force-directed.

Landscape View Renders a graph using a heightfield to accentuate vertex clusters.

Infovis Demo