<rdf:RDF
 xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
 xmlns="http://purl.org/rss/1.0/"
 xmlns:dc="http://purl.org/dc/elements/1.1/"
 xmlns:cc="http://web.resource.org/cc/"
 >
<!--
	This ontology document is licensed under the Creative Commons
	Attribution License. To view a copy of this license, visit
	http://creativecommons.org/licenses/by/2.0/ or send a letter to
	Creative Commons, 559 Nathan Abbott Way, Stanford, California
	94305, USA.
-->
 <channel rdf:about="http://ebiquity.umbc.edu//tags/html/?t=message+passing">
  <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  <title><![CDATA[UMBC ebiquity RSS Tag Search]]></title>
  <link><![CDATA[http://ebiquity.umbc.edu//tags/html/?t=message+passing]]></link>
  <description><![CDATA[UMBC ebiquity RSS Tag Search for message passing]]></description>
  <items>
    <rdf:Seq>
      <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/474/TABEL-A-Domain-Independent-and-Extensible-Framework-for-Inferring-the-Semantics-of-Tables"/>
      <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/447/Generating-Linked-Data-from-Tables-"/>
      <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/30/Agent-Based-Services-for-the-Semantic-Web"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/692/TABEL-A-Domain-Independent-and-Extensible-Framework-for-Inferring-the-Semantics-of-Tables"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/628/Semantic-Message-Passing-for-Generating-Linked-Data-from-Tables"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/790/Modified-Bully-Algorithm-using-Election-Commission"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/789/Modified-Bully-Algorithm-using-Election-Commission"/>
      <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/215/Agent-Based-Services-for-the-Semantic-Web"/>
    </rdf:Seq>
  </items>
 </channel>
 <item rdf:about="http://ebiquity.umbc.edu/event/html/id/474/TABEL-A-Domain-Independent-and-Extensible-Framework-for-Inferring-the-Semantics-of-Tables">
  <title><![CDATA[TABEL -- A Domain Independent and Extensible Framework for Inferring the Semantics of Tables]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/474/TABEL-A-Domain-Independent-and-Extensible-Framework-for-Inferring-the-Semantics-of-Tables</link>
  <description><![CDATA[ 

 Dissertation Defense

Tables are an integral part of documents, reports and Web pages in many scientific and technical domains, compactly encoding important information that can be difficult to express in text. Table-like structures outside documents, such as spreadsheets, CSV files, log files and databases, are widely used to represent and share information. However, tables remain beyond the scope of regular text processing systems which often treat them like free text.

This ...]]></description>
  <dc:date>2015-01-08</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/event/html/id/447/Generating-Linked-Data-from-Tables-">
  <title><![CDATA[Generating Linked Data from Tables.]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/447/Generating-Linked-Data-from-Tables-</link>
  <description><![CDATA[Large amounts of information is stored in tables, spreadsheets, CSV files and databases for a number of domains, including the Web, healthcare, e-science and public policy. The tables' structure facilitates human understanding, yet this very structure makes it difficult for machine understanding. This talk will focus on describing our work on making the intended meaning of tabular data explicit by representing it as RDF linked data, potentially making large amounts of scientific and medical d...]]></description>
  <dc:date>2013-03-24</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/event/html/id/30/Agent-Based-Services-for-the-Semantic-Web">
  <title><![CDATA[Agent-Based Services for the Semantic Web]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/30/Agent-Based-Services-for-the-Semantic-Web</link>
  <description><![CDATA[In the semantic web vision, data and information on the Web are
defined and linked so that they are both human readable and
machine understandable. Machine understandability means that
the data have been explicitly prepared for programs and
software agents to reason about and reuse.  However, most
software agents have not been designed to run in a web
environment: the agents and web components are working in
different models.  For example, most software agent frameworks
and tools do n...]]></description>
  <dc:date>2004-05-06</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/692/TABEL-A-Domain-Independent-and-Extensible-Framework-for-Inferring-the-Semantics-of-Tables">
  <title><![CDATA[TABEL - A Domain Independent and Extensible Framework for Inferring the Semantics of Tables]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/692/TABEL-A-Domain-Independent-and-Extensible-Framework-for-Inferring-the-Semantics-of-Tables</link>
  <description><![CDATA[Tables are an integral part of documents, reports and Web pages, compactly encoding important information that can be difficult to express in text. Table like structures outside documents, such as spreadsheets, CSV files, log files and databases, are widely used to represent and share information. Many scientific and technical domains use tables to compactly depict information which is difficult to express in text. However, tables remain beyond the scope of regular text processing systems whi...]]></description>
  <dc:date>2015-01-08</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/628/Semantic-Message-Passing-for-Generating-Linked-Data-from-Tables">
  <title><![CDATA[Semantic Message Passing for Generating Linked Data from Tables]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/628/Semantic-Message-Passing-for-Generating-Linked-Data-from-Tables</link>
  <description><![CDATA[We describe work on automatically inferring the intended meaning of tables and representing it as RDF linked data, making it available for improving search, interoperability and integration.  We present implementation details of a joint inference module that uses knowledge from the linked open data (LOD) cloud to jointly infer the semantics of column headers, table cell values (e.g., strings and numbers) and relations between columns. The framework generates linked data by mapping column head...]]></description>
  <dc:date>2013-10-21</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/790/Modified-Bully-Algorithm-using-Election-Commission">
  <title><![CDATA[Modified Bully Algorithm using Election Commission]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/790/Modified-Bully-Algorithm-using-Election-Commission</link>
  <description><![CDATA[Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized control IPC, etc. A leader is required to make synchronization between different processes. And different election algorithms are used to elect a coordinator among the available processes in the system such a way that there will be only one coordinator at any time. Bully election algorithm is one of the classical and w...]]></description>
  <dc:date>2009-10-30</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/789/Modified-Bully-Algorithm-using-Election-Commission">
  <title><![CDATA[Modified Bully Algorithm using Election Commission]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/789/Modified-Bully-Algorithm-using-Election-Commission</link>
  <description><![CDATA[Electing leader is a vital issue not only in distributed computing but also in communication network [1, 2, 3, 4, 5], centralized mutual exclusion algorithm [6, 7], centralized control IPC, etc. A leader is required to make synchronization between different processes. And different election algorithms are used to elect a coordinator among the available processes in the system such a way that there will be only one coordinator at any time. Bully election algorithm is one of the classical and w...]]></description>
  <dc:date>2009-10-09</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/215/Agent-Based-Services-for-the-Semantic-Web">
  <title><![CDATA[Agent-Based Services for the Semantic Web]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/215/Agent-Based-Services-for-the-Semantic-Web</link>
  <description><![CDATA[The semantic web suggests having data and information on the web defined
and linked in a way that it is both human readable and machine
understandable. Machine understandability means that data has been
explicitly prepared for programs and softrware agents to reason about and
reuse. However, most current software agents have not been designed to run
in a web environment: the software agents and web components are working
in different models.  For example, most software agent frameworks ...]]></description>
  <dc:date>2004-08-01</dc:date>
 </item>
</rdf:RDF>
