<?xml version="1.0" encoding="UTF-8" ?>
<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/tag/advertising/">
  <cc:license rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
  <image rdf:resource="http://ebiquity.umbc.edu/img/logo.jpg" />  <title><![CDATA[RSS Tag Search]]></title>
  <link>http://ebiquity.umbc.edu/tag/advertising/</link>
  <description><![CDATA[RSS Tag Search]]></description>
  <items>
   <rdf:Seq>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/187/Towards-Distributed-Service-Discovery-in-Pervasive-Computing-Environments"/>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/71/eNcentive-A-Framework-for-Intelligent-Marketing-in-Mobile-Peer-To-Peer-Environments"/>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/177/Towards-Distributed-Service-Discovery-in-Pervasive-Computing-Environments"/>
    <rdf:li resource="http://ebiquity.umbc.edu/paper/html/id/75/Allia-Alliance-based-Service-Discovery-for-Ad-Hoc-Environments"/>
    <rdf:li resource="http://ebiquity.umbc.edu/event/html/id/136/Making-Google-Richer-Optimal-Algorithms-for-the-AdWords-Auction"/>
   </rdf:Seq>
  </items>
 </channel>
 <image rdf:about="http://ebiquity.umbc.edu/img/logo.jpg">
  <title>UMBC ebiquity research group</title>
  <link>http://ebiquity.umbc.edu</link>
  <url>http://ebiquity.umbc.edu/img/logo.jpg</url>
 </image>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/187/Towards-Distributed-Service-Discovery-in-Pervasive-Computing-Environments">
  <title><![CDATA[Towards Distributed Service Discovery in Pervasive Computing Environments]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/187/Towards-Distributed-Service-Discovery-in-Pervasive-Computing-Environments</link>
  <description><![CDATA[The paper proposes a novel distributed service discovery protocol for pervasive environments. The protocol
is based on the concepts of peer-to-peer caching of service advertisements and group-based intelligent forwarding
of service requests. It does not require a service to be registered with a registry or lookup server. Services are
described using the Web Ontology Language (OWL). We exploit the semantic class/subClass hierarchy of OWL to
describe service groups and use this semantic inf...]]></description>
  <dc:date>2004-07-15</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/71/eNcentive-A-Framework-for-Intelligent-Marketing-in-Mobile-Peer-To-Peer-Environments">
  <title><![CDATA[eNcentive: A Framework for Intelligent Marketing in Mobile Peer-To-Peer Environments]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/71/eNcentive-A-Framework-for-Intelligent-Marketing-in-Mobile-Peer-To-Peer-Environments</link>
  <description><![CDATA[In recent years, the growth of Mobile Computing, Electronic
Commerce and Mobile Electronic Commerce has created a
new concept of Mobile Electronic Marketing. New marketing
models are being developed and used to target mobile
users. Mobile environments introduces new challenges that
need to be overcome by these marketing models in order to
be successful and effective. This paper proposes a framework,
called eNcentive, which addresses many of the issues
that are characteristic of mobile...]]></description>
  <dc:date>2003-10-03</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/177/Towards-Distributed-Service-Discovery-in-Pervasive-Computing-Environments">
  <title><![CDATA[Towards Distributed Service Discovery in Pervasive Computing Environments]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/177/Towards-Distributed-Service-Discovery-in-Pervasive-Computing-Environments</link>
  <description><![CDATA[The paper proposes a novel distributed service discovery protocol for pervasive environments. The protocol is based on the concepts of peer-to-peer caching of service advertisements and group-based intelligent forwarding of service requests. It does not require a service to be registered with a registry or lookup server. Services are described using the Web Ontology Language (OWL). We exploit the semantic class/subClass hierarchy of OWL to describe service groups and use this semantic informa...]]></description>
  <dc:date>2003-06-11</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/paper/html/id/75/Allia-Alliance-based-Service-Discovery-for-Ad-Hoc-Environments">
  <title><![CDATA[Allia: Alliance-based Service Discovery for Ad-Hoc Environments]]></title>
  <link>http://ebiquity.umbc.edu/paper/html/id/75/Allia-Alliance-based-Service-Discovery-for-Ad-Hoc-Environments</link>
  <description><![CDATA[Static directory based service discovery is unsuitable for m-commerce
 in ad-hoc environments. In this paper, we present Allia: a
 peer-to-peer caching based and policy-driven agent-service discovery
 framework to facilitate cross-platform service discovery in ad-hoc   
 environments for mobile electronic commerce applications. Our
 approach removes the problems associated with structured compound
 formation of agent communities in mobile commerce environment and
 achieves high degree ...]]></description>
  <dc:date>2002-09-12</dc:date>
 </item>
 <item rdf:about="http://ebiquity.umbc.edu/event/html/id/136/Making-Google-Richer-Optimal-Algorithms-for-the-AdWords-Auction">
  <title><![CDATA[Making Google Richer: Optimal Algorithms for the AdWords Auction]]></title>
  <link>http://ebiquity.umbc.edu/event/html/id/136/Making-Google-Richer-Optimal-Algorithms-for-the-AdWords-Auction</link>
  <description><![CDATA[Google's phenomenal success may be ascribed as much to a revolution in advertising as to its superior search results. The key to this online advertising model is an innovative auction run by the search engine companies. Advertisers' bids for search keywords determine which ads are displayed during internet searches. There are a number of algorithmic and game theoretic issues that arise in this context. In particular, the problem of maximizing revenue in such keyword auctions can be formulated...]]></description>
  <dc:date>2006-03-03</dc:date>
 </item>
</rdf:RDF>
