A Comparison of Hyperstructures: Zzstructures, mSpaces, and Polyarchies By: McGuffin & Schraefel Presented by: Travis Gadberry.

Slides:



Advertisements
Similar presentations
Objectives Make qualitative and quantitative observations
Advertisements

Trees for spatial indexing
Multivariate Statistics An Introduction & Multidimensional Contingency Tables.
Spatial Join Queries. Spatial Queries Given a collection of geometric objects (points, lines, polygons,...) organize them on disk, to answer point queries.
H3: Laying Out Large Directed Graphs in 3D Hyperbolic Space Tamara Munzner, Stanford University.
The Last Procedure Before First Functional Prototype Grant Boomer, Brett Papineau, Tanis Lopez, Archana Shrestha CS 383.
Ontology Visualization Methods—A Survey. INTRODUCTION ONTOLOGY DEFINITION purpose of this article : The best method for an ontology.
Two Technique Papers on High Dimensionality Allan Rempel December 5, 2005.
Hierarchy Visualization By Christian Chita. Papers Surveyed: 1. 1.Cone Trees: Animated 3D Visualizations of Hierarchical Information. George G. Robertson,
CSE332: Data Abstractions Lecture 9: B Trees Dan Grossman Spring 2010.
RingTree Roundabout Exploring Trees Michael Knapp & Werner Bruckner VU Informationsvisualisierung VU Informationsvisualisierung.
Multidimensional Visualization David Yucht ICS 280 Spring 2001.
Generating Sinewy Networks using Environment-Sensitive Automata Anthony Gaarenstroom Bachelor of Software Engineering Honours Project 2006.
Learning to Advertise. Introduction Advertising on the Internet = $$$ –Especially search advertising and web page advertising Problem: –Selecting ads.
1 Data & Database Development. 2 Data File Bit Byte Field Record File Database Entity Attribute Key field Key file management concepts include:
Multivariate and High Dimensional Visualizations Robert Herring.
Extending TreeJuxtaposer Nicholas Chen Maryam Farboodi May 9, 2006.
Vector vs. Bitmap SciVis V
Wheeler Lower School Mathematics Program Grades 4-5 Goals: 1.For all students to become mathematically proficient 2.To prepare students for success in.
1 Statistical Mechanics and Multi- Scale Simulation Methods ChBE Prof. C. Heath Turner Lecture 11 Some materials adapted from Prof. Keith E. Gubbins:
Basic concepts in ordination
Vector vs. Bitmap
Indexing for Multidimensional Data An Introduction.
-1- Philipp Heim, Thomas Ertl, Jürgen Ziegler Facet Graphs: Complex Semantic Querying Made Easy Philipp Heim 1, Thomas Ertl 1 and Jürgen Ziegler 2 1 Visualization.
Lecture 10 Trees –Definiton of trees –Uses of trees –Operations on a tree.
March 16 & 21, Csci 2111: Data and File Structures Week 9, Lectures 1 & 2 Indexed Sequential File Access and Prefix B+ Trees.
OLAP tool for comparing time- based data 14 th May 2008 Proposed By Pimolmas Ponchaisakuldee Advisor Dr. Paul Janecek.
Chapter 9 (modified) Abstract Data Types and Algorithms Nell Dale John Lewis.
Chapter 9 Abstract Data Types and Algorithms Nell Dale John Lewis.
Multi-level Raid Multi-level Raid 2 Agenda Background -Definitions -What is it? -Why would anyone want it? Design Issues -Configuration and.
Shape Descriptors Thomas Funkhouser and Michael Kazhdan Princeton University Thomas Funkhouser and Michael Kazhdan Princeton University.
Towards a High-Level Petri Net Type DefinitionWorkshop on Interchange Formats for Petri Nets 1/18 June 26, 2004 Towards a High-Level Petri Net Type Definition.
Correspondence Filing AOS 155 Chapter 5. Alphabetic Storage Advantages Advantages Direct access filing method Direct access filing method Numbers before.
A Study of Balanced Search Trees: Brainstorming a New Balanced Search Tree Anthony Kim, 2005 Computer Systems Research.
Cluster Sorting, Analysis and 3D-Display For the Mapping of the Dragonfly’s Neuro- Network Advisor: Prof. Hannay Client: Prof. Olberg (Biology )
Basic Compositional Rules Photographymad.com. Composition  The sum of all visual tricks a photographer used to make a picture pleasing and/or challenging.
Query Previews in Networked Information systems - K.Doan, C.Plaisant, B.Shneiderman Department of Computer Science University of Maryland, College park.
Transfer Viva Empathic Visualisation Algorithm (EVA)
Daniel A. Keim, Hans-Peter Kriegel Institute for Computer Science, University of Munich 3/23/ VisDB: Database exploration using Multidimensional.
Data Abstraction and Time-Series Data CS 4390/5390 Data Visualization Shirley Moore, Instructor September 15,
CONFIDENTIAL Data Visualization Katelina Boykova 15 October 2015.
Storage dashboard Status report A.Baranovski 12/10/07.
Data Visualization Fall Information Visualization Fall 2015Data Visualization2 Upon now, we dealt with scientific visualization (scivis) Scivis.
Where We Stand At this point we know how to: –Convert points from local to window coordinates –Clip polygons and lines to the view volume –Determine which.
1 C++ Classes and Data Structures Jeffrey S. Childs Chapter 15 Other Data Structures Jeffrey S. Childs Clarion University of PA © 2008, Prentice Hall.
Video Composition Media Concepts The Spill Resource Page.
Scientific Method Review.  The scientific method is used by scientists to solve problems  It is organized and reproducible (can be repeated by other.
Image Processing A Study in Pixel Averaging Building a Resolution Pyramid With Parallel Computing Denise Runnels and Farnaz Zand.
Measure Length to the Nearest Inch Unit of Study: Measurement- Length Global Concept Guide: 3 of 3.
Finding Answers. Steps of Sci Method 1.Purpose 2.Hypothesis 3.Experiment 4.Results 5.Conclusion.
Parts of an Experiment EXPERIMENT n Organized procedure for testing a hypothesis –When designing an experiment there are certain things that you will.
Guilford County SciVis V104.03
Exploring High-D Spaces with Multiform Matrices and Small Multiples Presented by Ray Chen and Sorelle Friedler Authors: MacEachren, A., Dai, X., Hardisty,
Double and Multiple Sampling Plan
Indexing Structures for Files and Physical Database Design
Basic Photography rules
Visible-Surface Detection Methods
Multiform Views of Multiple Trees
Basic Isometric Sketching and Coded Plans
A Few Rules- Even Though There are No Real Set Rules
Back Tracking.
Parts of an Experiment.
Skyline query with R*-Tree: Branch and Bound Skyline (BBS) Algorithm
Drill: 9/09/2013 What’s the difference between real and applied texture?
Chapter 11 Indexing And Hashing (1)
TABLE OF CONTENTS Line Shape Color Value Texture Space Form.
Top features for multi-context debugging
File Processing : Multi-dimensional Index
SPACE The Illusion of Depth
Shape and Form The Elements of Design.
Presentation transcript:

A Comparison of Hyperstructures: Zzstructures, mSpaces, and Polyarchies By: McGuffin & Schraefel Presented by: Travis Gadberry

Abstract Background Smaller chunks of info (not full pages) Focus on the structures, not implementation Desire for new ways of accessing data

Structures Multitrees Polyarchies Zzstructures mSpaces

Multitrees Kind of DAG Can contain multiple overlapping trees Overlaps must share subtrees Ex. Human genealogies

Multitrees

Polyarchies Can contain multiple overlapping trees Overlaps may contain subtrees Overlaps may happen at arbitrary nodes Coloring edges distinguishes different trees

Polyarchies

Zzstructures Kind of directed multigraph Subject to a single restriction R: Each node in a zzstructure may have at most one incoming edge of each color, and at most one outgoing edge of each color Edges of each color form paths/cycles that do not intersect within the same color

Zzstructures

mSpaces Difficult to visualize Ability to organize data points in multivariate space Allows for dimensional sorting, changing structure of the tree.

mSpaces mSpace polyarchy for a 3D 2x2x2 multivariate space. 3! (6) overlapping bi. trees Each row displays 1 slice less (3D, 2D, 1D, 0D)

mSpaces

Taxonomy

Analysis Zzstructures ?= edge-colored directed multigraphs ? (ecdm) Zzstructures == ecdm + R R can be simulated by node cloning Advantages?

Comparisons Zzstructure’s Space non-Euclidean Not easy to flatten and visualize May be changed independently of content More freedom Can be much more confusing Dimensions are like containers Nodes have a relative position in some dimensions

Comparisons mSpace’s Space Euclidean Like a high-dimensional grid Slices can be taken and visualized Space determined by attributes on content More structured Changing location of nodes doesn’t affect space Dimensions are variables Nodes have a value in every dimension

Comparisons Nature of overlap between trees Polyarchy – arbitrary Zzstructure – arbitrary Multitree – one subtree is shared mSpace – all subtrees at certain depth are shared

Conclusions & Future Work New ways to create hypermedia systems This paper has shown the differences Visualization applications are needed Other hybrid or extended structures