Folded in latest round of glossary edits mostly from Biplav 24-March-13
authorbhyland
Tue, 26 Mar 2013 14:23:32 -0400
changeset 428 a3031853448f
parent 427 5d64aee03ffe
child 429 a03a921d0b75
Folded in latest round of glossary edits mostly from Biplav 24-March-13
glossary/index.html
--- a/glossary/index.html	Tue Mar 26 13:25:29 2013 -0400
+++ b/glossary/index.html	Tue Mar 26 14:23:32 2013 -0400
@@ -32,7 +32,7 @@
 
 <section>
 <h4>5 Star Linked Data</h4>
-Tim Berners-Lee, the inventor of the Web and initiator of the <a href="http://linkeddata.org">Linked Data project</a>, suggested a 5 star deployment scheme for Linked Data.  The 5 Star Linked Data system is cumulative.  Each additional star presumes the data meets the criteria of the previous step(s).  
+5 Star Linked Data refers to an incremental framework for deploying data.  Tim Berners-Lee, the inventor of the Web and initiator of the <a href="http://linkeddata.org">Linked Data project</a>, suggested a 5 star deployment scheme for Linked Data.  The 5 Star Linked Data system is cumulative.  Each additional star presumes the data meets the criteria of the previous step(s).  
 
 <p class="highlight">&#9734;&nbsp;<b>Data is available on the Web, in whatever format.</b>	
 </p>
@@ -64,7 +64,7 @@
 
 <section>
 <h4>Authoritative Open Data</h4>
-Government agencies or authorities are often in a unique position and able to collect data that no other entity can. Open government data is nearly always collected at tax-payers expense and is viewed by the public and government, as valuable if made available with proper context and an open license. Linked Data is seen by many to be a useful approach to publish and consume authoritative open data.  Authoritative open data that conforms to <a href="https://dvcs.w3.org/hg/gld/raw-file/default/bp/index.html" target="_blank">Best Practices for Publishing Linked Data</a> may enjoy a greater chance of being discovered and re-used by others.
+Authoritative open data refers to open data that conforms to <a href="https://dvcs.w3.org/hg/gld/raw-file/default/bp/index.html" target="_blank">Best Practices for Publishing Linked Data</a> and which may be published by government and other responsible agencies.   Government agencies are often in a unique position and able to collect data that no other entity can. Open government data is nearly always collected at tax-payers expense and is viewed by the public and government, as valuable if made available with proper context and an open license. Linked Data is seen by many to be a useful approach to publish and consume authoritative open data.  An authoritative open data is often published by governments in linked data form and enjoys a greater chance of being discovered and re-used by others. See also [Government Open Data]. 
 </section>
 
 <section>
@@ -114,7 +114,7 @@
 
 <section>
 <h4>curl</h4>
-A command line client to retrieve any data over a wide variety of protocols, including machine readable RDF.  
+Curl is a command line client to retrieve any data over a wide variety of protocols, including machine readable RDF. 
 </section>
 
 <section >
@@ -208,6 +208,11 @@
 </section>
 
 <section>
+<h4>Government Open Data</h4>
+Many government authorities have mandated publication of data to the public Web. The broad intention is to facilitate the maintenance of open societies and support governmental accountability and transparency initiatives. However, publication of unstructured data on the World Wide Web is in itself insufficient; in order to realize the goals of efficiency, transparency and accountability, re-use of published data means members of the public must be able to absorb data in ways that can be readily found and absorbed programmatically by machines, and visualized by humans.  <a href="#linked-data-principals">Linked Data Principles</a> address many of the data modeling and format requirements to realize the goals of Open Government Data. 
+</section>
+
+<section>
 <h4>Graph</h4>
 Graph refers to a mathematical structure consisting of a collection of objects, represented by "nodes", and connected by “edges” (also called links), to denote inter-relationships between them. It is well established as the field of Graph Theory.  See also <a href="#directed-graph">Directed Graph</a>.
 </section>
@@ -224,7 +229,7 @@
 
 <section>
 </h4>HTTP URIs</h4>
-See <a href="uniform-resource-identifiers">Uniform Resource Identifiers (URI)</a>.
+See <a href="uniform-resource-identifier">Uniform Resource Identifier (URI)</a>.
 </section>
 
 <section>
@@ -249,7 +254,7 @@
 
 <section>
 <h4>JSON-LD</h4>
-JSON-LD (JavaScript Object Notation for Linking Data) [[JSON-LD]] is an attempt to harmonize the representation of Linked Data in JSON.  JSON-LD is a specification that outlines a common JSON representation format for expressing directed graphs, mixing both Linked Data and non-Linked Data in a single document.  JSON-LD is a lightweight Linked Data format that provides data context. <a href="http://json-ld.org/spec/FCGS/json-ld-syntax/20120626/"> JSON-LD Syntax</a> is easy for humans to read and write as well as, easy for machines to parse and generate. JSON-LD is based on the JSON format and provides a way to allow JSON data interoperate at Web-scale.  JSON-LD is an appropropriate Linked Data interchange language for JavaScript environments, Web service and NoSQL databases. 
+JSON-LD (JavaScript Object Notation for Linking Data) [[JSON-LD]] is an attempt to harmonize the representation of Linked Data in JSON.  JSON-LD is a specification that outlines a common JSON representation format for expressing directed graphs, mixing both Linked Data and non-Linked Data in a single document.  JSON-LD is a lightweight Linked Data format that provides data context. <a href="http://json-ld.org/spec/FCGS/json-ld-syntax/20120626/"> JSON-LD Syntax</a> is easy for humans to read and write as well as, easy for machines to parse and generate. JSON-LD is based on the JSON format and provides a way to allow JSON data interoperate at Web-scale.  JSON-LD is an appropriate Linked Data interchange language for JavaScript environments, Web service and NoSQL databases. 
 </section>
 
 <section>
@@ -274,14 +279,13 @@
 
 <section>
 <h4>Linked Data Principles</h4>
-Tim Berners-Lee, the inventor of the Web and initiator of the <a href="http://www.w3.org/DesignIssues/LinkedData.html" target="_blank"> Linked Data</a> project, proposed the following principles upon which Linked Data is based:
+Linked Data Principles provide a common <a href="#api">API</a> for data on the Web which is more convenient than many separately and differently designed APIs published by individual data suppliers.  Tim Berners-Lee, the inventor of the Web and initiator of the <a href="http://www.w3.org/DesignIssues/LinkedData.html" target="_blank"> Linked Data</a> project, proposed the following principles upon which Linked Data is based:
 <ol>
 <li>Use URIs to name things;</li> 
 <li>Use HTTP URIs so that things can be referred to and looked up ("dereferenced") by people and user agents;</li>
 <li>When someone looks up a URI, provide useful information, using the open Web standards such as RDF, SPARQL;</li>
 <li>Include links to other related things using their URIs when publishing on the Web.</li>
 </ol>
-Linked Data Principles provide a common <a href="#api">API</a> for data on the Web which is more convenient than many separately and differently designed APIs published by individual data suppliers.
 </section>
 
 <section>
@@ -296,7 +300,7 @@
 
 <section>
 <h4> Linked Open Data Cloud diagram</h4>
-Refers to the pictoral depiction of the <a href=" http://lod-cloud.net/" target="blank">Linked Data Cloud</a>.  There are various depictions of the Linked Open Data Cloud including color-by-theme describing the various data domains including government, geographic, publications, life sciences and media content.  
+It refers to the pictoral depiction of the <a href=" http://lod-cloud.net/" target="blank">Linked Data Cloud</a>.  There are various depictions of the Linked Open Data Cloud including color-by-theme describing the various data domains including government, geographic, publications, life sciences and media content.  
 </section>
 
 <section>
@@ -311,7 +315,7 @@
 
 <section>
 <h4>Machine Readable Data</h4> 
-<p>Machine readable gets 2-stars on the <a href="#5-star-linked-data">5-star Linked Data scale</a>. While some open data developers use screen-scrapping techniques to parse machine readable content, using 4-star or 5-star Linked Data is preferable in terms of provenance and ease of reuse.  Anything less than 4-star data gives Web developers more work modeling and transforming data.  By creating and publishing Linked Data, you are increasing the ability of search engines, and thus humans, to find, access and re-use information.
+Machine readable data refers to data which can be seamlessly processed by programs. It often means non-graphics data which gets 2-stars on the  <a href="#5-star-linked-data">5-star Linked Data scale</a>. While some open data developers use screen-scrapping techniques to parse machine readable content, using 4-star or 5-star Linked Data is preferable in terms of provenance and ease of reuse. Anything less than 4-star data gives Web developers more work modeling and transforming data. By creating and publishing Linked Data, you are increasing the ability of search engines, and thus humans, to find, access and re-use information.  
 </p>
 <p>
 To see how a Linked Data representation yields both a human and machine readable version simultaneously, try this exercise. Wikipedia has an interesting page about the color <a href="http://wikipedia.org/wiki/Red" target="_blank">Red</a>.  DBpedia allows you to get the structured content listed on the Wikipedia page for "Red" [<a href="http://wikipedia.org/wiki/Red">http://wikipedia.org/wiki/Red</a>] by changing "wiki" to "data" and appending the appropriate file extension.  
@@ -322,7 +326,7 @@
 
 <section>
 <h4>Message</h4> 
-The basic unit of HTTP communication, consisting of a structured sequence of octets matching the syntax defined as an <a href="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#httpmessage" target="blank">HTTP Message</a> and transmitted via the connection.
+The basic unit of HTTP communication. It consists of a structured sequence of octets matching the syntax defined as an <a href="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#httpmessage" target="blank">HTTP Message</a> and transmitted via the connection.
 </section>
 
 <section>
@@ -480,17 +484,17 @@
 
 <section>
 <h4>Request</h4>
-A request message from a client to a server includes, within the first line of that message, the method to be applied to the resource, the identifier of the resource, and the protocol version in use.  See also <a href="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#request" target="blank">RFC 2616bis</a> for an HTTP Request.
+Request refers to a stage in the HTTP protocol. A request message from a client to a server includes, within the first line of that message, the method to be applied to the resource, the identifier of the resource, and the protocol version in use. See also <a href="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#request" target="blank">RFC 2616bis</a> for an HTTP Request.
 </section>
 
 <section>
 <h4>Resource</h4>
-A network data object or service that can be identified by an HTTP URI. Resources may be available in multiple representations (e.g. multiple languages, data formats, size, and resolutions) or vary in other ways.  See details from RFC 2616bis for details on <a ref="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#uri.303" target="blank">Uniform Resource Identifiers</a>.
+A resource is a network data object or service that can be identified by an HTTP URI. Resources may be available in multiple representations (e.g. multiple languages, data formats, size, and resolutions) or vary in other ways. See details from RFC 2616bis for details on Uniform Resource Identifiers. See details from RFC 2616bis for details on <a ref="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#uri.303" target="blank">Uniform Resource Identifiers</a>.
 </section>
 
 <section>
 <h4>Response</h4>
-After receiving and interpreting a request message, a server responds with an HTTP response message.  See details from [[RFC2616]] bis for an <a ref="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#response" target="blank">HTTP Response</a> message.
+Response refers to a stage in the HTTP protocol. After receiving and interpreting a request message, a server responds with an HTTP response message.   See also [[RFC2616]] bis for an <a ref="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#response" target="blank">HTTP Response</a> message.
 </section>
 
 <section>
@@ -500,12 +504,12 @@
 
 <section>
 <h4>REST API</h4>
-An application program interface based on Representational State Transfer (REST).
+REST API refers to an application program interface based on Representational State Transfer (<a href="#rest-api"> REST</a>). 
 </section>
 
 <section>
 <h4>Schema</h4>
- A data model that represents the relationships between a set of concepts  Some types of schemas include relational database schemas (which define how data is stored and retrieved), taxonomies and ontologies. 
+Schema refers to a data model that represents the relationships between a set of concepts. Some types of schemas include relational database schemas (which define how data is stored and retrieved), taxonomies and ontologies. 
 </section>
 
 <section>
@@ -605,7 +609,7 @@
 
 <section >
 <h4>Uniform Resource Identifier</h4>
-<p>A Uniform Resource Identifier (URI) is a global identifier that uniquely identifies an abstract or physical resource.  URIs were standardized by joint action of the W3C and IETF.  URI’s provide a simple and extensible means for identifying a resource.  URIs play a key role in enabling Linked Data. URIs can be used to uniquely identify virtually anything including a physical building or more abstract concepts like the color red. If you would like to see the URI for the color red for example, the DBpedia project has modified URLs from the Wikipedia entry to create <a href="http://dbpedia.org/page/red">http://dbpedia.org/page/red</a>.  URIs can also be used to refer to other data representatations such as a row in a CSV file or a specific table in a relational database. 
+<p>A Uniform Resource Identifier (URI) is a global identifier that uniquely identifies an abstract or physical resource.  URIs were standardized by joint action of the W3C and IETF.  URI’s provide a simple and extensible means for identifying a resource.  URIs play a key role in enabling Linked Data. URIs can be used to uniquely identify virtually anything including a physical building or more abstract concepts like the color red. If you would like to see the URI for the color red for example, the DBpedia project has modified URLs from the Wikipedia entry to create <a href="http://dbpedia.org/page/red">http://dbpedia.org/page/red</a>.  URIs can also be used to refer to other data representations such as a row in a CSV file or a specific table in a relational database. 
 </p>
 </p>
 As Linked Data builds directly on Web architecture, the term "resource" is used to refer to things of interest that are identified by HTTP URIs.  An HTTP URI may or may not be resolvable on the Web.  URIs have been known by many names: Web addresses, Universal Document Identifiers, Universal Resource Identifiers, and finally the combination of Uniform Resource Identifier.  If you are interested in the history of the many names, read Tim Berners-Lee's design document <a href="http://www.w3.org/DesignIssues/Architecture.html">Web Architecture from 50,000 feet</a>. For definitive information on Uniform Resource Identifiers (URI), see "Uniform Resource Identifier (URI): Generic Syntax," [[!RFC3986]]
@@ -627,7 +631,6 @@
 See <a href="#uniform-resource-locator">Uniform Resource Locator</a>
 </section>
 
-
 <section>
 <h4>Validation Service</h4>
 The W3C offers an RDF validation service to check and validate RDF files.  It is considered a best practice to validate RDF files prior to publishing them on the Web.  See http://www.w3.org/RDF/Validator/.  There are other RDF parsers available, see http://www.w3.org/People/Barstow/#online_parsers.
@@ -645,22 +648,22 @@
 
 <section>
 <h4>Web 2.0</h4>
- A colloquial description of the part of the World Wide Web that implements social networking, blogs, user comments and ratings and related human-centered activities.
+Web 2.0 is a colloquial description of the part of the World Wide Web that implements social networking, blogs, user comments and ratings and related human-centered activities. 
 </section >
 
 <section>
 <h4>Web 3.0</h4>
-A colloquial description of the part of the World Wide Web that implements machine-readable data and the ability to perform distributed queries and analysis on that data.  Considered synonymous with the phrases "Semantic Web" and "The Web of Data".
+Web 3.0 is a colloquial description of the part of the World Wide Web that implements machine-readable data and the ability to perform distributed queries and analysis on that data. It is considered synonymous with the phrases "Semantic Web" and "The Web of Data". 
 </section>
 
 <section>
 <h4>Web of Data</h4>
-A phrase to describe publishing data sets using a Linked Data Principles thereby making the World Wide Web into a global database.
+Web of data is a phrase to describe publishing data sets using a Linked Data Principles thereby making the World Wide Web into a global database.
 </section>
 
 <section>
 <h4>Web Ontology Language (OWL)</h4>
- A family of knowledge representation and vocabulary description languages for authoring ontologies, based on RDF and standardized by the W3C [[!OWL2]].  Standardized variants include OWL Full, OWL DL (for "description logic") and OWL Lite.
+OWL is a family of knowledge representation and vocabulary description languages for authoring ontologies, based on RDF and standardized by the W3C [[!OWL2]].  Standardized variants include OWL Full, OWL DL (for "description logic") and OWL Lite.
 </section >
 
 <section>