"... In PAGE 46: ... Table5 : A snippet of a device profile as RDF statements. It is possible to create complex net graphs with RDF, but fortunately only a simple tree structure has been used in CC/PP.... ..."

"... In PAGE 8: ... Even though there are spaces between the words, using the capitalization rule above it is possible to mechanically parse the sentence even without the human-oriented color cues. Table3 compares RDF and OPM with respect to this example. For each method, the three elements and the respective parts of the example are written first, and below them are the graphical and textual representations of the RDF graph in Figure 1 and the OPD ... In PAGE 9: ...While the OPM model still does not account for namespaces, which are treated in the sequel, comparing this OPL/ViSWeb sentence to the RDF/XML script in Table3 , it is not difficult to see the benefit of using a more human-readable version, which, while still machine-readable, does not require the human reader to act like a mechanical XML parser. Figure 4.... In PAGE 11: ...WW.w3.org/Home/Lassila. quot; does not specify the namespaces which contain the definitions of Person, URI, and the structural link tag (predicate) apos;is the creator of apos;. In contrast, the XML script in Table3 does mention two namespaces, rdf and docs. The namespaces, which are part of the XML tags, enable us to know that we are looking at a Description in the sense defined in the rdf namespace definition, that the value of its about attribute is quot;http://www.... ..."

"... In PAGE 5: ... We defined a set of operator types to cover the language structures of the SPARQL specification. Table1 gives an overview of all defined operator types, their meaning, and their specific properties. If it is not noted otherwise, the values of the properties of an operator are listed in the body part of its box in the graphical representation.... In PAGE 7: ... To model the RDF dataset the algorithm creates a graph operator for the default graph and each named graph (cf. Table1 ). The property iri is set to the IRI of the respective RDF graph.... ..."

"... In PAGE 5: ... The RDF graph and class hierarchy of this ontology can be found at our website2,3. The top ten ranked vocabularies are shown in Table1 . While we treat classes and properties equally as vocabularies in the ranking process, we separate them in the final ranking list.... ..."

"... In PAGE 9: ... Each link is associated with a randomly generated RDF graph from a financial services ontology in OWL that had about 200 concepts, 80 properties and 6000 individuals. The time taken to plan the DAGs are shown in Table1 . The table has columns for the number of streams and PEs in the gener- ated graph, as well as time measurements for the online and offline phases of semantic planning.... ..."

"... In PAGE 28: ...rdf Table 1: The contents of a browser log SDEB 1.6 Metadata Model The Evidence Metadata Files produced by the prototype tool all contain metadata of a similar format to that presented in Table2 in an abridged form. Figure 5 presents a node arc graph of the portions of the same data.... In PAGE 28: ...w3.org/2000/09/xmldsig#sha1 quot; gt;4056e4786fc460d9adbe98a0bc19b29a2104c476 lt;/de:messagedige st gt; lt;/wb:BrowserCacheFile gt; Table2 : XML/RDF content of Evidence Metadata File named jbloggs.... In PAGE 29: ...Figure 6: RDF Graph relating Evidence Context and Digital Evidence Metadata Figure 6 depicts a portion of the RDF graph implied by the content of the Evidence Metadata File discussed above and presented in Table2 . We discriminate here between the Evidence Context Metadata, and Digital Evidence Metadata.... ..."

"... In PAGE 12: ...alues, etc.) and introduce variables, RQL provides a select-from-where lter. Given that the whole description base can be viewed as a collection of nodes/edges, path expressions can be used in RQL lters for the traversal of RDF graphs at arbitrary depths. The formal semantics of RQL lters and path expressions is given in Table2 . Consider, for instance, the following query: Q1: Find the resources having a title property.... ..."

"... In PAGE 11: ...alues, etc.#29 and introduce variables, RQL provides a select-from-where #0Clter. Given that the whole description base can be viewed as a collection of nodes#2Fedges, path expressions can be used in RQL #0Clters for the traversal of RDF graphs at arbitrary depths. The formal semantics of RQL #0Clters and path expressions are given in Table2 . Consider, for instance, the following query: Q1: Find the resources having a title property.... ..."