XDI RDF Cell Graphs V3 2010-01-13 This document introduces a notation for graphing XDI RDF statements called cell graphing. The motivation is to have an.

Slides:



Advertisements
Similar presentations
Your performance improvement partner 2/25/
Advertisements

7B Unit 3 Finding your way Integrated skills. Millie is walking across the road.Millie is walking along the road.Sandy is walking over the bridge.Kitty.
The following 5 questions are about VOLTAGE DIVIDERS. You have 20 seconds for each question What is the voltage at the point X ? A9v B5v C0v D10v Question.
From RegentsEarth.com How to play Earth Science Battleship Divide the class into two teams, Red and Purple. Choose which team goes first. The main screen.
Advanced Concepts in Scheduling SCH02 Stephen Rando.
Inside the binary adder. Electro-mechanical relay A solid state relay is a switch that is controlled by a current. When current flows from A to B, the.
The Science of Biology The study of living things.
4 Inputs input_a (double) input_b (double) input_c (double) monitor_state (uint32) 4 Outputs –fail_code (uint32) –monitor_id (uint32) –persistence_count.
Measurement of a Pond Basics of plane geometry Idea of the Coordinate Plane Confining an Area Practical skill Cooperation in the Group Lake measurement.
Doc.: IEEE Submission January 2010 Rick Roberts (Intel)Slide 1 Project: IEEE P Working Group for Wireless Personal Area Networks.
PIM ECMP Assert draft-hou-pim-ecmp-00 IETF 80, Prague.
Instructions for using this template. Remember this is Jeopardy, so where I have written Answer this is the prompt the students will see, and where I.
M & M’s Counting Activity
Mr Watsons Introduction to Spreadsheets The Quick and Easy guide to using Microsoft Excel.
Mr Watsons Introduction to Spreadsheets The Quick and Easy guide to using Microsoft Excel.
Editing a Spreadsheet ©. End Next Quit Next If for any reason you want to exit from the test, click the Quit.
1 Program verification: flowchart programs (Book: chapter 7)
Rule Learning – Overview Goal: learn transfer rules for a language pair where one language is resource-rich, the other is resource-poor Learning proceeds.
Keystone Problem… Keystone Problem… Set 17 Part 3 © 2007 Herbert I. Gross next.
Free Macro Download from i-present.co.uk by GMARK Ltd.i-present.co.ukGMARK my text Lorem for more information :
On / By / With The building blocks of the Mplus language.
The IF function Bernard Liengme. Objectives To know how to: Construct a condition using the comparison operators =, >=, >, ; Construct a formula using.
Graphs, representation, isomorphism, connectivity
Functional Dependencies (FDs)
11 *Other names and brands may be claimed as the property of others Purpose –The following slides summarize rules and issues for the new mixed-mode format.
Web-pa – the tutors’ view Web-PA – a tutors’ view Peter Willmot (School of Mechanical and Manufacturing Engineering)
CST-094 Basic SpreadSheet Click your left mouse button to proceed... © Delta College CST Faculty.
CS 450: COMPUTER GRAPHICS LINEAR ALGEBRA REVIEW SPRING 2015 DR. MICHAEL J. REALE.
Some non-recursive tricks. The Lambda expression. More on Let, Let*, apply and funcall.
BAYESIAN NETWORKS Ivan Bratko Faculty of Computer and Information Sc. University of Ljubljana.
SATISFIABILITY Eric L. Frederich.
Section 3.4 The Traveling Salesperson Problem Tucker Applied Combinatorics By Aaron Desrochers and Ben Epstein.
1 General Structural Equation (LISREL) Models Week 3 #2 A.Multiple Group Models with > 2 groups B.Relationship to ANOVA, ANCOVA models C.Introduction to.
22 22 33 33 11 11 X1 X2 X3 X4 X5 X6 X7 X8 X9                    2,1  3,1  3,2 2,1 1,1 3,1 4,2 5,2 6,2 7,3 8,3 9,3.
Chapter 4 Systems of Linear Equations; Matrices
Grammars, constituency and order A grammar describes the legal strings of a language in terms of constituency and order. For example, a grammar for a fragment.
1 Introduction to Computability Theory Lecture11: Variants of Turing Machines Prof. Amos Israeli.
15 PARTIAL DERIVATIVES.
Alpha: Symbolization and Inference Bram van Heuveln Minds and Machines Lab RPI.
Comparing Fractions © Math As A Second Language All Rights Reserved next #6T Taking the Fear out of Math
College Algebra Fifth Edition James Stewart Lothar Redlin Saleem Watson.
RDF (Resource Description Framework) Why?. XML XML is a metalanguage that allows users to define markup XML separates content and structure from formatting.
Pairwise Alignment, Part I Constructing the Values and Directions Tables from 2 related DNA (or Protein) Sequences.
LIMITS AND DERIVATIVES 2. We have used calculators and graphs to guess the values of limits.  However, we have learned that such methods don’t always.
10/4/2015Tables1 Spring, 2008 Modified by Linda Kenney 4/2/08.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 Extending the Number System.
Extending the Definition of Exponents © Math As A Second Language All Rights Reserved next #10 Taking the Fear out of Math 2 -8.
Designing a Web Page with Tables. A text table: contains only text, evenly spaced on the Web page in rows and columns uses only standard word processing.
XDI Graph Patterns OASIS XDI TC Submission Drummond Reed This document contains illustrations of basic XDI graph patterns: 1.I-names, i-numbers,
XDI Graph Patterns OASIS XDI TC Submission Drummond Reed This document contains illustrations of basic XDI graph patterns: 1.I-names, i-numbers,
We have used calculators and graphs to guess the values of limits.  However, we have learned that such methods do not always lead to the correct answer.
RDF and XML 인공지능 연구실 한기덕. 2 개요  1. Basic of RDF  2. Example of RDF  3. How XML Namespaces Work  4. The Abbreviated RDF Syntax  5. RDF Resource Collections.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
The Game of Algebra or The Other Side of Arithmetic The Game of Algebra or The Other Side of Arithmetic © 2007 Herbert I. Gross by Herbert I. Gross & Richard.
Tutorial 13 Validating Documents with Schemas
XDI Graph Patterns OASIS XDI TC Submission Drummond Reed, Markus Sabadello This summary document contains XDI introductory materials. The long.
College Algebra Sixth Edition James Stewart Lothar Redlin Saleem Watson.
Learning Objectives for Section 4.5 Inverse of a Square Matrix
Changing Bases. Base 10: example number ³ 10² 10¹ 10 ⁰ ₁₀ 10³∙2 + 10²∙1 + 10¹∙ ⁰ ∙0 = 2120 ₁₀ Implied base 10 Base 8: 4110 ₈ 8³ 8².
Chapter 3 Context-Free Grammars Dr. Frank Lee. 3.1 CFG Definition The next phase of compilation after lexical analysis is syntax analysis. This phase.
5 INTEGRALS.
Copyright © Curt Hill Other Trees Applications of the Tree Structure.
LIMITS Calculating Limits Using the Limit Laws LIMITS In this section, we will: Use the Limit Laws to calculate limits.
2.3 Calculating Limits Using the Limit Laws LIMITS AND DERIVATIVES In this section, we will: Use the Limit Laws to calculate limits.
Lecture 09: Theory of Automata:2014 Asif NawazUIIT, PMAS-Arid Agriclture University Rawalpindi. Kleene’s Theorem and NFA.
XDI Graph Patterns OASIS XDI TC Submission Drummond Reed This document contains illustrations of six basic XDI graph patterns: 1.Simple properties:
An Analysis of the Structure of the Proposed XDI Metaschema
Variables ICS2O.
COMPILER CONSTRUCTION
Presentation transcript:

XDI RDF Cell Graphs V This document introduces a notation for graphing XDI RDF statements called cell graphing. The motivation is to have an easy, intuitive way to illustrate the special capability of XDI RDF to express context, i.e., the ability for RDF graphs to contain other RDF graphs to any depth. In XDI cell graphs, every RDF node and every RDF arc is represented by a cell (shown visually as a rectangle, similar to a spreadsheet cell). The reason cells are used is that with XDI addressing, every segment of an XRI structured identifier (whether an XDI subject, predicate, or object) may itself represent an RDF graph. So a complete XDI address may represent the union of dozens of component RDF graphs. In fact the only XDI addresses that do not represent RDF graphs (because they are graph primitives) are: a) single XRI delimiter characters, and b) literals. See Appendix A for more about these. Below is an illustration of a conventional RDF graph alongside an analogous XDI RDF cell graph. =example.first.person Conventional RDF Graph XDI RDF Cell Graph +mother =example.second.person The following pages illustrate the rules of XDI cell graphing notation using examples based on simple two-character XRIs. Note that some of the examples are relatively unusual XDI statements that would rarely appear in actual practice, but are helpful for illustrating how cell graphs work.

2 XDI RDF statementCell graph Notes (+a) A2 +a A1 +a/+b A4 (+a)/+b A6 +a/(+b) A7 (+a)/(+b) A8 A single cell in the left-hand column represents an XDI RDF subject node. A cell around a cell is reification. The outer cell represents the XDI context containing the node as the inner cell. The outer cell is the new XDI subject node. An XDI RDF predicate is shown diagonally, in the second column, down one row, similar to the visual structure of X3 Simple syntax. +a/+b/+c A5 An XDI RDF object is shown in the third column, down a row, similar to X3 Simple syntax. You cannot put more than three cells in diagonal without starting a XDI subcontext. ((+a)) A3 Nested reification (nested cross- references) are graphed as nested cells. Each is a context containing a subcontext. This pattern can be repeated to any length. +a +b +a +b +c +a +b +a +b +a +b A reified XDI subject is still a first-column cell, and thus acts like any other XDI subject. A reified XDI predicate is still a second- column cell, and thus acts like any other XDI predicate. A reified XDI subject with a reified XDI predicate.

3 XDI RDF statementCell graph Notes +a/(+b/+c) +a/+b+c B3 A +b+c predicate on a +a subject node. (+a/+b)/$has/+c +a+b/$has/+c ((+a/+b)/+c) (+a+b/+c) +a/$has/(+b/+c) +a/$has/+b+c (+a/(+b/+c)) (+a/+b+c) +a+b+c B4 A reification of either #B2 or #B3 above. In both cases, the result is a single XDI subject cell (the outer cell) with the same non-blank cells, +a, +b, and +c, along the diagonal. This means all the different XDI statements on the far right produce the same cell graph and are therefore equivalent. In this respect, XDI $has statements are associative.associative This pattern holds no matter how deeply you nest the $has statements. +a/$has/+b (+a/+b) +a+b (+a/+b)/+c +a+b/+c B1 B2 A reified subject/predicate relationship results in a new XDI subject. All $has statements express reified subject/predicate relationships. See Appendix B for more about $has graphs. A +c predicate added to the +a+b subject node above. +a +b +a +b +c +a +b +c +a +b +c

4 XDI RDF statementCell graph Notes +a/+b// C1 When a blank node is specified as the object of a cell graph, it may be used to begin a subcontext (nested cell graph). +a +b +a/+b//+x C2 Just like with X3, the rules for the cell graph of a subcontext are identical for those of a parent context. +a +b +x +a/+b//+x/+y/+z C3 Here the context +a/+b// contains the subcontext statement +x/+y/+z. +a +b +x +y +z +a/+b//(+x/+y) +a/+b//+x+y C4 +a +b +x +y Reification works identically at all levels of contexts and subcontexts. (+a/+b//(+x/+y)) (+a/+b//+x+y) C5 +a +b +x +y Any valid XDI statement may be reifiied– even it it crosses multiple XDI contexts. For example, this outer cell is now a new XDI subject.

5 XDI RDF statementCell graph Notes +a/+b D1 A literal is represented by a black cell with white text. Note that the address of this data block is the XDI statement that addresses this block. +a +b “example literal” +a/+b//+x/+y D2 A literal can appear as any XDI object in any context or subcontext. +a +b +x +y +a/+b//(+x/+y)/+z +a/+b//+x+y/+z D3 +a +b +x +y A literal can only appear as an XDI object. “example literal” +z “example literal”

6 XDI RDF statementCell graph Notes +a/+b/+c a/+b/+d a/+e//+f/(+g) a/+e//+f/+h a/+e//+i/+j a/+l E1 To extend a cell graph from a single XDI statement to multiple XDI statements, extend the rightmost border of any parent cell to include all its children. This example illustrates a graph of six different XDI statements originating from the XDI subject +a. +a +b +c +d +e +f +g +h +i +j “example literal” +l “example literal”

7 Appendix A: Cell Graphs of XDI Primitives Each of the atomic XRI subsegments shown inside the cells of a cell graph actually represents an XDI $has statement between two XDI primitives: an XRI subsegment delimiter character and an XRI literal string. To put this in RDF terms, the XDI RDF subject +a (shown in X1) actually represents the XDI RDF statement +/$has/a (shown as an RDF graph in X2 and as a XDI cell graph in X3). Since a $has statement represents a reification of an XDI subject/predicate relationship, the cell graph in X3 can be simplified to the cell graph in X4. X4 can in turn be simplified to the single cell graph in X5 representing an atomic XRI subsegment. A different way of visualizing the atomic XDI statement +a shown in graphs X1 through X5 is to see it as the arc between: a) the implicit blank node representing the root of the XDI context in which +a is a subject, and b) the actual RDF subject node identified by the XRI +a. This is illustrated in X6. +a $has +a + a $has + a + a X1 X2 X3 X4 X5 X6

8 Appendix B: $has and $has$a Statements An XDI RDF $has statement is in many ways the basic building block of XDI RDF graphs. However from a pure RDF standpoint it is also one of the most difficult to understand because it has no corollary in RDF. To illustrate this, Y1 is a conventional RDF graph of a single RDF subject node +a. Y2 is a conventional RDF graph of that same subject node plus a single outgoing arc +b. Y3 is how the conventional RDF graph in Y2 is described using an XDI RDF $has$a statement. It says, “subject +a has a arc +b”. This reduces to the XDI RDF statement +a/+b. $has$a statements can have cardinality, since there can be a specific number of arcs +b originating from +a. A $has statement, by contrast, is a statement identifying the relationship between an XDI RDF subject node and an XDI RDF predicate arc. To do that, a $has statement identifies the graph containing the relationship. In Y4, this is depicted as the box drawn around the RDF graph shown in Y2. (Reminder: conventional RDF graph notation has no way to identify a graph itself, or to show graphs within graphs.) Y5 shows the cell graph equivalent to Y4. Note that it is the same as Y3 except for the addition of a cell enclosing the entire graph. This outer cell, representing a new XDI RDF subject node, is the node identified by the $has state- ment. Y6 is another way of visualizing this using the same approach as X6 in Appendix A. +a +b +a +b Y1 Y2 Y3 Y4 X5Y5 Y6 +b +a +b This outer cell, representing the XDI RDF context containing the graph, is the XDI RDF node is addressed by the XDI statement (+a/+b), which is equivalent to +a+b +a/$has$a/+b +a/+b +a/$has/+b (+a/+b) +a+b Because a $has statement identifies a single XDI RDF node, it cannot have cardinality, since there is no assertion of an arc on this node (only an arc within the graph it contains).