[Gzz-commits] manuscripts/FutureVision oplan.txt

[Benja Fallenstein]

CVSROOT:        /cvsroot/gzz
Module name:    manuscripts
Branch:         
Changes by:     Benja Fallenstein <address@hidden>      03/11/13 04:16:51

Modified files:
        FutureVision   : oplan.txt 

Log message:
        changes from yesterday

CVSWeb URLs:
http://savannah.gnu.org/cgi-bin/viewcvs/gzz/manuscripts/FutureVision/oplan.txt.diff?tr1=1.8&tr2=1.9&r1=text&r2=text

Patches:
Index: manuscripts/FutureVision/oplan.txt
diff -u manuscripts/FutureVision/oplan.txt:1.8 
manuscripts/FutureVision/oplan.txt:1.9
--- manuscripts/FutureVision/oplan.txt:1.8      Wed Nov 12 16:23:24 2003
+++ manuscripts/FutureVision/oplan.txt  Thu Nov 13 04:16:50 2003
@@ -92,6 +92,50 @@
 the definition of hyperstructure above, then discuss it
 in light of the "connotations" of hyperstructure.
 
+    .. The RDF structure (`Lassila and Swick 1999`_) is a graph containing
+       three types of nodes: Nodes identified globally by a URI,
+       "blank" nodes with identifiers local to a graph, and
+       *literals* (explicit values such as strings and numbers).
+       An RDF graph is a set of triples containing a *subject*,
+       *predicate* and *object* nodes (literals can only occur
+       as objects), which are interpreted as edges in the graph;
+       the subject and object are vertices, the predicate
+       is a label.
+
+    
+
+    Our work is based on using the Resource Description Framework
+    (RDF, `Lassila and Swick 1999`_) as a hyperstructure.
+    In the examples we have given above, we have assumed the use of RDF.
+
+    RDF is a directed labelled graph structure in which nodes and edge labels
+    are identified by URIs. Nodes can also be blank, that is,
+    have identifiers local to a particular graph, or literal
+    (explicit values such as strings and numbers, rather than URIs).
+    An RDF graph can be seen as a set of *(subject, predicate,
+    object)* triples, where each triple is an edge between the
+    subject and the object and with the predicate as its label.
+
+    While the zzstructure is simple to browse locally,
+    programming is often easier in RDF, because many-to-many
+    relationships can be represented more naturally.
+
+    Using RDF as a hyperstructure, items are nodes. 
+    Two data structures can independently connect information
+    to the same item by using different properties. Properties
+    are the RDF equivalent to zzstructure's dimensions.
+
+    Visualizations of RDF... [keep current paragraphs here]
+    ...herculean task.
+
+    [Ontorama cloning technique and problems with that]
+
+    These visualizations are therefore not useful for using
+    RDF as a hyperstructure as introduced above.
+    However, it is quite possible to build focus+context
+    views for RDF; we discuss our RDF visualizations
+    in `Section 4.2.1`_.
+
 Then go on to discuss visualization, as currently.
 
 [24] Discuss the GraphViz library, which at least two RDF
@@ -106,12 +150,15 @@
 [30] Examples:
 
 - Expanding on the Carli example (also explaining
-  how to handle large number of neighbours in e-mail case)
+  how to handle large number of neighbours in e-mail case) [6]
 - Real-world example (poems)
 - Connecting thoughts (better than paper).
 
 Use RDF to concretify the examples.
 
+Need to drive home through this how this can "help us
+organize our lives."
+
 Refer to FenPDF section below as giving another example.
 
 
@@ -140,6 +187,9 @@
 RDF visualizations we know, including Ontorama!
 
 (or move related to 5.4?) [24],[26]
+
+Also details about how to handle large numbers of neighbours
+belong here. [6]
 
 
 4.2.2 Buoys