SView 0.3设计 2013-07-02.

Slides:



Advertisements
Similar presentations
Mercury Quality Center 9.0 Training Material
Advertisements

1 Union-find. 2 Maintain a collection of disjoint sets under the following two operations S 3 = Union(S 1,S 2 ) Find(x) : returns the set containing x.
WebTMA for Users Workshop
Tries Standard Tries Compressed Tries Suffix Tries.
Combinatorial Pattern Matching CS 466 Saurabh Sinha.
Optimal Merging Of Runs
Search  Exhaustive/Blind Search Methods Depth First Search Breadth First Search  Heuristic Methods Hill Climbing Beam Search Best First Search…
Important Problem Types and Fundamental Data Structures
Data Structures – Binary Tree
AMI GUI Design V1.1 by Kilian Pohl - Reflects changes in AMI MRML Structure - Includes feedback from AMI Workshop in Dec 09.
Business Requirements Using Unified Modeling Language Eric H. Castain, SVP Internet Services Group, Architecture Wells Fargo March 2005.
Grant Number: IIS Institution of PI: Arizona State University PIs: Zoé Lacroix Title: Collaborative Research: Semantic Map of Biological Data.
Making a Game Linking Slides. To link slides: 1.Prepare your storyboard 2.Complete all slides 3.Link the slides.
NCIP Hub Webinar Series: Collections April 24, 2014.
Research & Learning For Libraries and Patrons that need to stay Ahead of the Learning Curve Presenter Name Here Books24x7® for Libraries.
1 By: Nour Hilal. Microsoft Access is a database software where data is stored in one or more Tables. A Database is a group of related Tables. Access.
New Globe Logistik Online Marketing Material. What is Online Marketing Material In today’s world every one is on internet. Every one wants the quick access.
Red-Black Trees Acknowledgment Many thanks to “erm” from Purdue University for this very interesting way of presenting this course material. 1.
CSS446 Spring 2014 Nan Wang.  Java Collection Framework ◦ Set ◦ Map 2.
Grouper Training End Users Admin UI – Part 4 Shilen Patel Duke University This work licensed under a Creative Commons Attribution-NonCommercial 3.0 Unported.
MIS001 A1 Computer Hardware Windows ’98 and Internet Explorer Chapter 3 Start Menu and Control Panel.
With Windows 7 Introductory© 2011 Pearson Education, Inc. Publishing as Prentice Hall1 Windows 7 Introductory Chapter 3 Advanced File Management and Advanced.
Balanced search trees: 2-3 trees. 2-3 trees allow us to process ordered lists in more efficient way than binary trees with an ordering property. Recall.
EMIS 8374 Optimal Trees updated 25 April slide 1 Minimum Spanning Tree (MST) Input –A (simple) graph G = (V,E) –Edge cost c ij for each edge e 
1 EndNote X2 Your Bibliographic Management Tool 29 September 2009 Humanities and Social Sciences Resource Teams.
Labcheck Next Generation Quick Start Guide Filters.
Microsoft FrontPage 2003 Illustrated Complete Integrating a Database with a Web Site.
How to Register Go to Click on “Sign In or Register” Sign in to an existing account or click Register.
Basic Search Procedure 1. Start with the start node (root of the search tree) and place in on the queue 2. Remove the front node in the queue and If the.
Discrete Mathematics Chapter 5 Trees.
AVL trees1 AVL Trees Height of a node : The height of a leaf is 1. The height of a null pointer is zero. The height of an internal node is the maximum.
Copyright © 2010 Verizon Foundation. All Rights Reserved. This document may be reproduced and distributed solely for uses that are both (a) educational.
New COOL Tag Browser Release 10 Giorgi BATIASHVILI Georgian Engineering Center 23/10/2012
242/102/49 0/51/59 181/172/166 Primary colors 248/152/29 PMS 172 PMS 137 PMS 546 PMS /206/ /227/ /129/123 Secondary colors 114/181/204.
How to create a prompt in an Alma Analytics report Yoel Kortick | Senior Librarian.
Copyright © 2010 Verizon Foundation. All Rights Reserved. This document may be reproduced and distributed solely for uses that are both (a) educational.
Subscribers – List Model
Best-first search is a search algorithm which explores a graph by expanding the most promising node chosen according to a specified rule.
Texas Skyward User Group Conference Helpful Hints Jennifer Speulda.
EduBrite Training for Group Admins. Dashboard Reports Groups Enrolled courses More items under this menu.
CPS120: Introduction to Computer Science Nell Dale John Lewis Abstract Data Types.
Applying References and Hyperlinks
How to Create Workplaces
Using the Personal Image Photo Library
The Enhanced Entity- Relationship (EER) Model
Lecture 23 Red Black Tree Chapter 10 of textbook
CARA 3.10 Major New Features
ClubRunner Tutorial Home Page Stories.
Chapter 10.1 Binary Search Trees
Optimal Merging Of Runs
Training course on Euro SDMX Registry
AC3274 CUIX Zen - Customizing the CUI
QAD Browses.
Optimal Merging Of Runs
SView Team Nanjing University
Minimum Spanning Tree.
دانشگاه شهیدرجایی تهران
Trees made simple in Blender
تعهدات مشتری در کنوانسیون بیع بین المللی
Chapter 11 Data Compression
Verbalized Query Construction on general case (con.3)
SView /2/5.
SView /2/18.
Mrs. Tonya McKinnie Morgan Road Middle School
Magnet & /facet Zheng Liang
Data Structures and Algorithms
Mining Path Traversal Patterns with User Interaction for Query Recommendation 龚赛赛
Leverage Consensus Partition for Domain-Specific Entity Coreference
Browsing Data in AQS.
Lecture 9: Intro to Trees
Presentation transcript:

SView 0.3设计 2013-07-02

Browse the collection of values Entity Identity Image view Browse the collection of values

The properties of entities Favorite + recommended Personalized ordering/Partition + Consensus ordering/Partition Favorite: implicitly conveyed, i.e. property added, user focus from moving and merging, etc. (cp. Removed) Show all favorite ones with limited number of recommended ones [1, …, 5], i.e. total number not limited

Add more properties of entities Add one property at a time Currently, two or more at a time not allowed Put the new one at proper position according to personalized ordering + consensus ordering/partition Property widget Order by importance/ alphabet Quick search

Click to inspect members Entity collection Filter members Click to inspect members

The properties of collections Favorite + recommended Union of properties of members + type Favorite: implicitly conveyed, i.e. property added, property in filters(cp. Removed) Currently, order by importance Num of adding, num of removing, time of adding, etc. Show all favorite ones with limited number of recommended ones [1, …, 3], i.e. total number not limited

Inspect members (3) Actor of avatar Actor of avatar Actor of avatar

Filter members (3) p v1 … p v2 … p v3 …

Filter members Star shaped But allow leaf to link to the root Currently, only leverage importance of properties in filters Summary of members during filtering Show one value satisfying property constraint for each branch. Highlight/reorder types

Miscellaneous Collection naming Based on path in query trace

Browsing model P11 P21 P31 e1 e2 e3 e6 P22 T31 P12 e7 e4 L12 C1 C2 C6 L41,v41 L31,v31 C4 C3 e:实体 C: 集合 T:类 P, L:属性 (L,v): filter L32 e5

Browsing model e1 e2 e3 e6 P12 e7 e4 L12 C1 C2 T11 L31,v31 L41,v41 C5 Query trace

Browsing model Start point In a session, a set of trees A uri Enumeration based collection In a session, a set of trees New tree starts when doing a new query(e.g. input a new uri in the textbox), select members and browse Open a new tab Collection name: a path from start node Bookmark Extension Path (allow user to specify length)

Thanks for your attention