Results 1 -
7 of
7
Adaptive Personalisation in Self e-Learning Networks
- 1st International Kaleidoscope Learning GRID Special Interest Group Workshop on Distributed eLearning Environments (held in conjunction with the 1st International ELeGI Conference on Advanced Technology for Enhanced Learning
, 2005
"... This paper presents some of the personalisation services designed for self e-learning networks in the SeLeNe project. A self e-learning network consists of web-based learning objects that have been made available to the network by its users, along with metadata descriptions of these learning objects ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
(Show Context)
This paper presents some of the personalisation services designed for self e-learning networks in the SeLeNe project. A self e-learning network consists of web-based learning objects that have been made available to the network by its users, along with metadata descriptions of these learning objects and of the network’s users. The architecture of the network is distributed and service-oriented. The personalisation facilities include: querying learning object descriptions to return results tailored towards users ’ individual goals and preferences; the ability to define views over the learning object metadata; facilities for defining new composite learning objects; and facilities for subscribing to personalised event and change notification services.
Efficient Query Routing in RDF/S Schema-based P2P Systems
- In Fourth Hellenic Data Management Symposium (HDMS’05
, 2005
"... P2P computing gains increasing attention lately, since it provides the means for realizing computing systems that scale to very large numbers of participating peers, while ensuring high autonomy and fault-tolerance. However, existing P2P systems o#er poor data management facilities, limited to IR-st ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
P2P computing gains increasing attention lately, since it provides the means for realizing computing systems that scale to very large numbers of participating peers, while ensuring high autonomy and fault-tolerance. However, existing P2P systems o#er poor data management facilities, limited to IR-style keyword search using eventually a fixed set of document attributes. Schema-based P2P systems have been proposed to support richer facilities in exchanging, querying and integrating structured and semi-structured data hosted by peers. In this paper, we address routing issues for expressive queries in schema-based P2P systems, where peers advertise their local bases using fragments of a community RDF/S schema (i.e., views). We then introduce an original encoding of RDF/S schema fragments, allowing to e#ciently check whether a peer view is subsumed by a query. We rely on this encoding to design an RDF/S view lookup service featuring a centralized and distributed execution over a DHT-based P2P system. We finally evaluate experimentally the proposed framework to demonstrate its scalability for large P2P networks and arbitrary RDF/S schema fragments, as well as, to estimate the number of routing hops required by the two versions of our lookup service.
Indexing views to route queries in a PDMS
, 2008
"... Indexing views to route queries in a PDMS ..."
(Show Context)
Distributed and Parallel Databases manuscript No. (will be inserted by the editor) Indexing Views to Route Queries in a PDMS
"... Abstract P2P computing gains increasing attention lately, since it pro-vides the means for realizing computing systems that scale to very large numbers of participating peers, while ensuring high autonomy and fault-tolerance. Peer Data Management Systems (PDMS) have been proposed to support sophisti ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract P2P computing gains increasing attention lately, since it pro-vides the means for realizing computing systems that scale to very large numbers of participating peers, while ensuring high autonomy and fault-tolerance. Peer Data Management Systems (PDMS) have been proposed to support sophisticated facilities in exchanging, querying and integrating (semi-) structured data hosted by peers. In this paper, we are interested in routing graph queries in a very large PDMS, where peers advertise their local bases using fragments of community RDF/S schemas (i.e., views). We introduce an original encoding for these fragments, in order to efficiently check whether a peer view is subsumed by a query. We rely on this en-coding to design an RDF/S view lookup service featuring a statefull and a 2 Lefteris Sidirourgos et al. stateless execution over a DHT-based P2P infrastructure. We finally evalu-ate experimentally our system to demonstrate its scalability for very large P2P networks and arbitrary RDF/S schema fragments, and to estimate the number of routing hops required by the two versions of our lookup service. 1
Decentralised Indexing for Query Reformulation through Web Services
"... We address the problem of indexing data in distributed systems. We consider the case where a collection of nodes in a distributed system export data and querying capabili-ties over said data through a Web Service interface, while autonomously managing the data. One of the questions that can arise is ..."
Abstract
- Add to MetaCart
(Show Context)
We address the problem of indexing data in distributed systems. We consider the case where a collection of nodes in a distributed system export data and querying capabili-ties over said data through a Web Service interface, while autonomously managing the data. One of the questions that can arise is how distributed summaries over the entire collection of data stored in the system can be developed. This dissertation presents a solution to this problem. We begin by defining the problem and we argue about its importance. We continue by surveying the relevant research area of indexing algo-rithms in distributed systems. Then, we describe the mathematical model and a set of adaptive algorithms that we have created. In order to evaluate the algorithms, we have developed a distributed system which implements them. Finally, we test and evaluate the algorithms and present the conclusions. i Acknowledgements Many thanks to Dr. Stratis Viglas for his assistance during the project. His help was
Visualizing RDF Data for P2P Information Sharing
"... We discuss the problem of assisting the users of RDF-based Peer-to-peer systems for information sharing with visual information about available information and conceptual structures. We focus on the problem of exploring the knowledge available in the P2P network and of formulating queries at the con ..."
Abstract
- Add to MetaCart
We discuss the problem of assisting the users of RDF-based Peer-to-peer systems for information sharing with visual information about available information and conceptual structures. We focus on the problem of exploring the knowledge available in the P2P network and of formulating queries at the conceptual level. After defining requirements for these tasks, we briefly introduce existing visualization tools that work on RDF-based data and discuss their suitability with respect to the identified requirements. We conclude with a discussion of visualization needs that are not supported by available tools and propose some directions for future research.
Semantic ‘ls ’- An Approach for Personal and Private Group Information Management
"... One of the problems in Personal Information Management is handling the huge amount of content one seems accumulate over time on one’s own personal computer related to one’s domain of interest. There is however a related problem as well – that of sharing this knowledge with members of the community o ..."
Abstract
- Add to MetaCart
(Show Context)
One of the problems in Personal Information Management is handling the huge amount of content one seems accumulate over time on one’s own personal computer related to one’s domain of interest. There is however a related problem as well – that of sharing this knowledge with members of the community one belongs to. Many Knowledge Communities are typically small with substantial trust and co-operation within. Typical examples are the research groups one sees in Universities, Labs and even spanning Institutional boundaries. The problem of personal information management can be extended to sharing of information resources amongst such groups extending the PIM to a Group Information Manager (GIM). In this paper we describe an implementation of a Personal Information Manager that does the work of properly arranging the resources, not based on the physical location of the resource but based on the semantic properties of the resource, thus providing an easy to use interface to browse the resources based on their content and not just based on their physical locations. Easy to use searching interfaces based on set theory and Boolean logic are also provided so that novice users can form accurate queries for finding the desired resources easily. These resources might also be required to be shared amongst a community of users that are working on similar domain, so we convert this PIM into a GIM where not only the resources that are available in the local machine are managed but also those resources residing on remote trusted machines connected to each other in a P2P fashion.
