The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05)
DOI: 10.1109/wi.2005.130
|View full text |Cite
|
Sign up to set email alerts
|

Semantic Based Collaborative P2P in Ubiquitous Computing

Abstract: We propose a collaborative environment for semanticenabled mobile devices (e.g. PDAs, cell phones, laptops)

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
14
0

Publication Types

Select...
4
1
1

Relationship

2
4

Authors

Journals

citations
Cited by 13 publications
(14 citation statements)
references
References 20 publications
0
14
0
Order By: Relevance
“…Compression techniques [12,10] have been also employed for making more compact semantic metadata. Furthermore two new tags have been introduced: -<tag k="semantic:ouuid_counter" v="DIG description" /> whose key is the OUUID, i.e., an Ontology Universally Unique IDentifier [9] marking the domain ontology the description refers to. The value field contains a semantically annotated DIG description.…”
Section: Map Enhancementmentioning
confidence: 99%
“…Compression techniques [12,10] have been also employed for making more compact semantic metadata. Furthermore two new tags have been introduced: -<tag k="semantic:ouuid_counter" v="DIG description" /> whose key is the OUUID, i.e., an Ontology Universally Unique IDentifier [9] marking the domain ontology the description refers to. The value field contains a semantically annotated DIG description.…”
Section: Map Enhancementmentioning
confidence: 99%
“…Recall that, as in [27], we postulate the existence of a unique identifier (OUUID) for each ontology, thus allowing an unambiguous identification in the whole Semantic Web. In the following sections we will give a closer look to advertisement, request, and solicit PDUs as well as to the cache content organization of nodes.…”
Section: Data Dissemination Frameworkmentioning
confidence: 99%
“…In particular, we propose a revision of abduction and contraction algorithms presented in [3] in order to allow an exploitation of them in resource-constrained contexts. Building on previous work that enhanced the discovery possibilities offered by standard code-based matching procedures with semantic-based capabilities [10], here we devise a further evolution of matchmaking algorithms allowing to by-pass the presence of fixed and networked servers. This framework and approach has been applied and tested for profile matchmaking in a mobile p2p environment.…”
Section: Introductionmentioning
confidence: 99%