On the Move to Meaningful Internet Systems 2007.. OTM 2007

LNCS 4805 - On the Move to Meaningful Internet Systems 2007: OTM 2007 WorkshopsLecture Notes in Computer Science 4805 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen
Editorial Board
Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler University of Surrey, Guildford, UK
Jon M. Kleinberg Cornell University, Ithaca, NY, USA
Friedemann Mattern ETH Zurich, Switzerland
John C. Mitchell Stanford University, CA, USA
Moni Naor Weizmann Institute of Science, Rehovot, Israel
Oscar Nierstrasz University of Bern, Switzerland
C. Pandu Rangan Indian Institute of Technology, Madras, India
Bernhard Steffen University of Dortmund, Germany
Madhu Sudan Massachusetts Institute of Technology, MA, USA
Demetri Terzopoulos University of California, Los Angeles, CA, USA
Doug Tygar University of California, Berkeley, CA, USA
Moshe Y. Vardi Rice University, Houston, TX, USA
Gerhard Weikum Max-Planck Institute of Computer Science, Saarbruecken, Germany
Robert Meersman Zahir Tari Pilar Herrero (Eds.)
On the Move to Meaningful Internet Systems 2007: OTM 2007 Workshops
OTM Confederated International Workshops and Posters AWeSOMe, CAMS, OTM Academy Doctoral Consortium, MONET, OnToContent, ORM, PerSys, PPN, RDDS, SSWS, and SWWS 2007 Vilamoura, Portugal, November 25-30, 2007 Proceedings, Part I
13
Robert Meersman Vrije Universiteit Brussel (VUB), STARLab Bldg G/10, Pleinlaan 2, 1050 Brussels, Belgium E-mail: [email protected]
Zahir Tari RMIT University, School of Computer Science and Information Technology Bld 10.10, 376-392 Swanston Street, VIC 3001, Melbourne, Australia E-mail: [email protected]
Pilar Herrero Universidad Politécnica de Madrid, Facultad de Informática Campus de Montegancedo S/N, 28660 Boadilla del Monte, Madrid, Spain E-mail: [email protected]
Library of Congress Control Number: 2007939492
CR Subject Classification (1998): H.2, H.3, H.4, C.2, H.5, I.2, D.2, K.4
LNCS Sublibrary: SL 3 – Information Systems and Application, incl. Internet/Web and HCI
ISSN 0302-9743 ISBN-10 3-540-76887-4 Springer Berlin Heidelberg New York ISBN-13 978-3-540-76887-6 Springer Berlin Heidelberg New York
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law.
Springer is a part of Springer Science+Business Media
springer.com
© Springer-Verlag Berlin Heidelberg 2007 Printed in Germany
Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper SPIN: 12193509 06/3180 5 4 3 2 1 0
Volume Editors
CAMS
OnToContent
Yoke Sure Tharam S. Dillon
OTM 2007 General Co-chairs’ Message
OnTheMove 2007 held in Vilamoura, Portugal, November 25–30 further consoli- dated the growth of the conference series that was started in Irvine, California in 2002, and then held in Catania, Sicily in 2003, in Cyprus in 2004 and 2005, and in Montpellier last year. It continues to attract a diversifying and representative selection of today’s worldwide research on the scientific concepts underlying new computing paradigms that of necessity must be distributed, heterogeneous and autonomous yet meaningfully collaborative.
Indeed, as such large, complex and networked intelligent information systems become the focus and norm for computing, it is clear that there is an acute and increasing need to address and discuss in an integrated forum the implied software and system issues as well as methodological, semantical, theoretical and application issues. As we all know, e-mail, the Internet, and even video conferences are not sufficient for effective and efficient scientific exchange. This is why the OnTheMove (OTM) Federated Conferences series has been created to cover the increasingly wide yet closely connected range of fundamental technologies such as data and Web Semantics, distributed objects, Web services, databases, information systems, workflow, cooperation, ubiquity, interoperability, mobility, grid and high-performance systems. OnTheMove aspires to be a primary scientific meeting place where all aspects of the development of Internet- and Intranet- based systems in organizations and for e-business are discussed in a scientifically motivated way. This sixth 2007 edition of the OTM Federated Conferences event, therefore, again provided an opportunity for researchers and practitioners to un- derstand and publish these developments within their individual as well as within their broader contexts.
Originally the federative structure of OTM was formed by the co-location of three related, complementary and successful main conference series: DOA (Dis- tributed Objects and Applications, since 1999), covering the relevant infrastructure-enabling technologies, ODBASE (Ontologies, DataBases and Ap- plications of SEmantics, since 2002) covering Web semantics, XML databases and ontologies, CoopIS (Cooperative Information Systems, since 1993) covering the application of these technologies in an enterprise context through, e.g., workflow systems and knowledge management. In 2006 a fourth conference, GADA (Grid computing, high-performAnce and Distributed Applications), was added as a main symposium, and this year the same happened with IS (Information Security). Both started off as successful workshops at OTM, the first covering the large-scale integration of heterogeneous computing systems and data resources with the aim of providing a global computing space, the second covering the issues of security in complex Internet-based information systems. Each of these five conferences en- courages researchers to treat their respective topics within a framework that in-
VIII Preface
corporates jointly (a) theory , (b) conceptual design and development, and (c) applications, in particular case studies and industrial solutions.
Following and expanding the model created in 2003, we again solicited and selected quality workshop proposals to complement the more “archival” nature of the main conferences with research results in a number of selected and more “avant garde” areas related to the general topic of distributed computing. For instance, the so-called Semantic Web has given rise to several novel research areas combining linguistics, information systems technology, and artificial intelligence, such as the modeling of (legal) regulatory systems and the ubiquitous nature of their usage. We were glad to see that no less than eight of our earlier successful workshops (notably AweSOMe, CAMS, SWWS, ORM, OnToContent, MONET, PerSys, RDDS) re-appeared in 2007 with a second or third edition, and that four brand-new workshops emerged to be selected and hosted, and were successfully organized by their respective proposers: NDKM, PIPE, PPN, and SSWS. We know that as before, workshop audiences will productively mingle with another and with those of the main conferences, as is already visible from the overlap in authors! The OTM organizers are especially grateful for the leadership and competence of Pilar Herrero in managing this complex process into a success for the fourth year in a row.
A special mention for 2007 is to be made of third and enlarged edition of the OnTheMove Academy (formerly called Doctoral Consortium Workshop), our “vision for the future” in research in the areas covered by OTM. Its 2007 organizers, Antonia Albani, Torben Hansen and Johannes Maria Zaha, three young and active researchers, guaranteed once more the unique interactive formula to bring PhD students together: research proposals are submitted for evaluation; selected submissions and their approaches are presented by the students in front of a wider audience at the conference, and are independently and extensively analyzed and discussed in public by a panel of senior professors. This year these were once more Johann Eder and Maria Orlowska, under the guidance of Jan Dietz, the incumbent Dean of the OnTheMove Academy. The successful students only pay a minimal fee for the Doctoral Symposium itself and also are awarded free access to all other parts of the OTM program (in fact their attendance is largely sponsored by the other participants!).
All five main conferences and the associated workshops share the distributed aspects of modern computing systems, and the resulting application-pull created by the Internet and the so-called Semantic Web. For DOA 2007, the primary emphasis stayed on the distributed object infrastructure; for ODBASE 2007, it became the knowledge bases and methods required for enabling the use of formal semantics; for CoopIS 2007, the topic as usual was the interaction of such technologies and methods with management issues, such as occur in networked organizations; for GADA 2007, the topic was the scalable integration of heterogeneous computing systems and data resources with the aim of providing a global computing space; and last but not least in the relative newcomer IS 2007 the emphasis was on information security in the networked society. These subject areas overlap naturally and many submissions in fact also treated an envisaged
Preface IX
mutual impact among them. As for the earlier editions, the organizers wanted to stimulate this cross-pollination by a shared program of famous keynote speakers: this year we were proud to announce Mark Little of Red Hat, York Sure of SAP Research, Donald Ferguson of Microsoft, and Dennis Gannon of Indiana Uni- versity. As always, we also encouraged multiple event attendance by providing all authors, also those of workshop papers, with free access or discounts to one other conference or workshop of their choice.
We received a total of 362 submissions for the five main conferences and 241 for the workshops. Not only may we indeed again claim success in attracting an increasingly representative volume of scientific papers, but such a harvest of course allows the Program Committees to compose a higher-quality cross- section of current research in the areas covered by OTM. In fact, in spite of the larger number of submissions, the Program Chairs of each of the three main conferences decided to accept only approximately the same number of papers for presentation and publication as in 2004 and 2005 (i.e., average one paper out of every three to four submitted, not counting posters). For the workshops, the acceptance rate varied but was much stricter than before, consistently about one accepted paper for every two to three submitted. Also for this reason, we separate the proceedings into four books with their own titles, two for main conferences and two for workshops, and we are grateful to Springer for their suggestions and collaboration in producing these books and CD-Roms. The reviewing process by the respective Program Committees was again performed very professionally and each paper in the main conferences was reviewed by at least three referees, with arbitrated e-mail discussions in the case of strongly diverging evaluations. It may be worthwhile to emphasize that it is an explicit OnTheMove policy that all conference Program Committees and Chairs make their selections completely autonomously from the OTM organization itself. Continuing a costly but nice tradition, the OnTheMove Federated Event organizers decided again to make all proceedings available to all participants of conferences and workshops, independently of one’s registration to a specific conference or workshop. Each participant also received a CD-Rom with the full combined proceedings (conferences + workshops).
The General Chairs are once more especially grateful to all the many people directly or indirectly involved in the set-up of these federated conferences, who contributed to making them a success. Few people realize what a large number of individuals have to be involved, and what a huge amount of work, and sometimes risk, the organization of an event like OTM entails. Apart from the persons mentioned above, we therefore in particular wish to thank our 12 main conference PC Co-chairs (GADA 2007: Pilar Herrero, Daniel Katz, Mara S. Perez, Domenico Talia; DOA 2007: Pascal Felber, Aad van Moorsel, Calton Pu; ODBASE 2007: Tharam Dillon, Michele Missikoff, Steffen Staab; CoopIS 2007: Francisco Curbera, Frank Leymann, Mathias Weske; IS 2007: Mario Freire, Simao Melo de Sousa, Vitor Santos, Jong Hyuk Park) and our 36 workshop PC Co-chairs (Antonia Albani, Susana Alcalde, Adezzine Boukerche, George Buchanan, Roy Campbell, Werner Ceusters, Elizabeth Chang, Antonio Coro-
X Preface
nato, Simon Courtenage, Ernesto Damiani, Skevos Evripidou, Pascal Felber, Fernando Ferri, Achille Fokoue, Mario Freire, Daniel Grosu, Michael Gurstein, Pilar Herrero, Terry Halpin, Annika Hinze, Jong Hyuk Park, Mustafa Jarrar, Jiankun Hu, Cornel Klein, David Lewis, Arek Kasprzyk, Thorsten Liebig, Gon- zalo Mendez, Jelena Mitic, John Mylopoulos, Farid Nad-Abdessalam, Sjir Ni- jssen, the late Claude Ostyn, Bijan Parsia, Maurizio Rafanelli, Marta Sabou, Andreas Schmidt, Simao Melo de Sousa, York Sure, Katia Sycara, Thanassis Tiropanis, Arianna D’Ulizia, Rainer Unland, Eiko Yoneki, Yuanbo Guo).
All, together with their many PC members, did a superb and professional job in selecting the best papers from the large harvest of submissions.
We also must heartily thank Jos Valente de Oliveira for the efforts in ar- ranging facilities at the venue and coordinating the substantial and varied local activities needed for a multi-conference event such as ours. And we must all be grateful also to Ana Cecilia Martinez-Barbosa for researching and securing the sponsoring arrangements, to our extremely competent and experienced Con- ference Secretariat and technical support staff in Antwerp, Daniel Meersman, Ana-Cecilia, and Jan Demey, and last but not least to our energetic Publica- tions Chair and loyal collaborator of many years in Melbourne, Kwong Yuen Lai, this year vigorously assisted by Vidura Gamini Abhaya and Peter Dimopoulos.
The General Chairs gratefully acknowledge the academic freedom, logistic support and facilities they enjoy from their respective institutions, Vrije Univer- siteit Brussel (VUB) and RMIT University, Melbourne, without which such an enterprise would not be feasible.
We do hope that the results of this federated scientific enterprise contribute to your research and your place in the scientific network.
August 2007 Robert Meersman Zahir Tari
Organization Committee
The OTM (On The Move) Federated Workshops aim at complementing the more “archival” nature of the OTM Federated Conferences with research results in a number of selected and more “avant garde” areas related to the general topic of distributed computing. In 2007, only 11 workshops were chosen after a rigourous selection process by Pilar Herrero. The 2007 selected international workshops were: AWeSOMe (International Workshop on Agents, Web Services and Ontologies Merging), CAMS (International Workshop on Context-Aware Mobile Systems), OTM Academy Doctoral Consortium, MONET (International Workshop on MObile and NEtworking Technologies for social applications), On- ToContent (International Workshop on Ontology content and evaluation in En- terprise), ORM (International Workshop on Object-Role Modeling), PerSys (In- ternational Workshop on Pervasive Systems), PPN (International Workshop on Peer-to-Peer Networks), RDDS (International Workshop on Reliability in De- centralized Distributed Systems), SSWS (International Workshop on Scalable Semantic Web Knowledge Base Systems), and SWWS (IFIP WG 2.12 and WG 12.4 International Workshop on Semantic Web and Web Semantics). OTM 2007 Federated Workshops were proudly supported by RMIT University (School of Computer Science and Information Technology) and Vrije Universiteit Brussel (Department of Computer Science).
Executive Committee
OTM 2007 General Co-chairs Robert Meersman (Vrije Universiteit Brus- sel, Belgium), Zahir Tari (RMIT University, Australia), and Pilar Herrero (Universidad Politecnica de Madrid, Spain)
AWeSOMe 2007 PC Co-chairs Pilar Herrero (Universidad Politecnica de Madrid, Spain), Gonzalo Medez (Universidad Complutense de Madrid, Spain), and Rainer Unland (University of Duisburg-Essen,
Germany) CAMS 2007 PC Co-chairs George Buchanan (University of Wales
Swansea, UK) and Annika Hinze (University of Waikato, New Zealand)
OTM 2007 Academy Doctoral Consortium PC Co-chairs
Antonia Albani (Delft University of Technol- ogy, The Netherlands), Torben Hansen (Ger- man Research Center for Artificial Intelligence, Germany) and Johannes Maria Zaha (Univer- sity of Duisburg-Essen, Germany)
XII Organization
MONET 2007 PC Co-chairs Fernando Ferri (National Research Council, Italy), Maurizio Rafanelli (National Research Council, Italy) and Arianna D’Ulizia (National Research Council, Italy)
OnToContent 2007 PC Co-chairs
Mustafa Jarrar (Vrije Universiteit Brussel, Belgium), Andreas Schmidt (FZI, Germany), Claude Ostyn (IEEE-LTSC, USA), and Werner Ceusters (University of Buffalo, USA)
ORM 2007 PC Co-chairs Terry Halpin (Neumont University, USA), Sjir Nijssen (PNA, The Netherlands), and Robert Meersman (Vrije Universiteit Brussel, Belgium)
PerSys 2007 PC Co-chairs Skevos Evripidou (University of Cyprus, Cyprus), Roy Campbell (University of Illinois at Urbana-Champaign, USA), Anja Schanzen- berger (Middlesex University, UK)
PPN 2007 PC Co-chairs Farid Nat-Abdesselam (University of Science and Technology of Lille, France), Jiankun Hu (RMIT University, Australia), and Azzedine Boukerche (University of Ottawa, Canada)
RDDS 2007 PC Co-chairs Eiko Yoneki (University of Cambridge, UK) and Pascal Felber (Universite de Neuchatel,
Switzerland) SSWS 2007 PC Co-chairs Achille Fokoue (IBM T.J. Watson Research
Center, USA), Yuanbo Guo (Microsoft Corp, USA), Thorsten Liebig (Ulm University, Germany), and Bijan Parsia (University of
Manchester, UK) SWWS 2007 PC Co-chairs John Mylopoulos (University of Toronto,
Canada), Elizabeth Chang (Curtin University of Technology, Australia), Ernesto Damiani (Milan University, Italy), Yoke Sure (University of Karlsruhe, Germany), and Tharam Dillon (University of Technology Sydney, Australia)
Publication Co-chairs Kwong Yuen Lai (RMIT University, Australia) and Vidura Gamini Abhaya (RMIT University,
Australia) Local Organizing Chair Jose Valente de Oliveira (University of Algarve,
Portugal) Conferences Publicity Chair Jean-Marc Petit (INSA, Lyon, France) Workshops Publicity Chair Gonzalo Mendez (Universidad Complutense de
Madrid, Spain) Secretariat Ana-Cecilia Martinez Barbosa, Jan Demey, and
Daniel Meersman
Organization XIII
AWeSOMe (Agents, Web Services and Ontologies Merging) 2007 Program Committee
M. Brian Blake Jose Luis Bosque Juan A. Bota Blaya Paul Buhler Jose Cardoso Isaac Chao Adam Cheyer Ian Dickinson Jorge Gomez Dominic Greenwood Jingshan Huang Margaret Lyell Dan Marinescu Gregorio Martnez Viviana Mascardi Michael Maximilien Barry Norton Julian Padget Mauricio Paletta
Juan Pavon Jose Pena Mara Perez Ronald Poell Omer Rana Paul Roe Marta Sabou Manuel Salvadores Alberto Sanchez Weisong Shi Marius-Calin Silaghi Ben K.M. Sim Hiroki Suguri Henry Tirri Santtu Toivonen Sander van Splunter Julita Vassileva Yao Wang
CAMS (Context-Aware Mobile Systems) 2007 Program Committee
Pilar Herrero George Buchanan Trevor Collins Keith Cheverst Dan Chalmers Gill Dobbie Tiong Goh Annika Hinze
Reto Krummenacher Johan Koolwaaij Diane Lingrand Gero Muehl Michel Scholl Goce Trajcevski Katarzyna Wac
OTM Academy (International Doctoral Consortium) 2007 Program Committee
Antonia Albani Domenico Beneventano Jaime Delgado Jan Dietz Schahram Dustdar
Johann Eder Torben Hansen Jorg Muller Maria Orlowska Johannes Maria Zaha
XIV Organization
MONET (MObile and NEtworking Technologies for Social Applications) 2007 Program Committee
Russell Beale Yiwei Cao Tiziana Catarci Richard Chbeir Karin Coninx Simon Courtenage Juan De Lara Anna Formica Patrizia Grifoni Otthein Herzog C.-C. Jay Kuo Irina Kondratova David Lewis Stephen Marsh
Rebecca Montanari Michele Missikoff Nuria Oliver Marco Padula Andrew Phippen Tommo Reti Tim Strayer Henri Ter Hofte Thanassis Tiropanis Yoshito Tobe Riccardo Torlone Mikael Wiberg
OnToContent (Ontology Content and Evaluation in Enterprise) 2007 Program Committee
Bill Andersen Keith Baker Ernst Biesalski Paolo Bouquet Simone Braun Christopher Brewster Michael Brown Yannis Charalabidis Ernesto Damiani Aldo Gangemi Fausto Giunchiglia Giancarlo Guizzardi Mohand-Said Hacid Martin Hepp Stijn Heymans Christine Kunzmann Jens Lemcke
Stefanie Lindstaedt Alessandro Oltramari Jeff Pan Paul Piwek Christophe Roch Pavel Shvaiko Miguel-Angel Sicilia Barry Smith Silvie Spreeuwenberg Armando Stellato Andrew Stranieri Karl Stroetmann Sergio Tessaris Robert Tolksdorf Francky Trichet Luk Vervenne
ORM (Object-Role Modeling) 2007 Program Committee
Guido Bakema Herman Balsters Linda Bird
Anthony Bloesch Scott Becker Peter Bollen
Organization XV
Lex Bruil Andy Carver Dave Cuyler Necito dela Cruz Aldo de Moor Olga De Troyer Jan Dietz David Embley Ken Evans Gordon Everest Mario Gutknecht Henri Habrias Pat Hallock Terry Halpin Hank Hermans Stijn Hoppenbrouwers Mike Jackson
Mustafa Jarrar Inge Lemmens Robert Meersman Tony Morgan Maurice Nijssen Sjir Nijssen Baba Piprani Erik Proper Jos Rozendaal Gerhard Skagestein Peter Spyns Deny Smeets Sten Sundblad Jos Vos Theo van der Weide Jan Pieter Zwart
PerSys (Pervasive Systems) 2007 Program Committee
Xavier Alama Jalal Al-Muhtadi Susana Alcalde Bagues Christian Becker Michael Beigl Alastair Beresford Roy Campbell Antonio Coronato Thanos Demiris Hakan Duman Bob Hulsebosch Hesham El-Rewini Skevos Evripidou Alois Ferscha Nikolaos Georgantas Alex Healing
Markus Huebscher Cornel Klein Jelena Mitic Andrew Rice Philip Robison Das Sajal George Samaras Anja Schanzenberger Gregor Schiele Behrooz Shirazi Sotirios Terzis Issarny Valerie Gregory Yovanof Apostolos Zarras Arkady Zaslavsky
PPN (Peer-to-Peer Networks) 2007 Program Committee
Marinho Pilla Barcellos Jalel Ben-Othman Brahim Bensaou Tarek Bijaoui Jean Carle
Song Ci Pilar Herrero Ashfaq Khokhar Nouredine Melab Alberto Montresor
XVI Organization
Florent Nolot Aris Ouksel Douglas Reeves Ahmed Serhrouchni Orazio Tomarchio
Kurt Tutschku Carlos Becker Westphall Sherali Zeadally
RDDS (Reliability in Decentralized Distributed Systems) 2007 Program Committee
Licia Capra Paolo Costa Simon Courtenage Patrick Eugster Pascal Felber Ludger Fiege Christos Gkantsidis Michael Kounavis Marco Mamei Gero Muehl
Jonathan Munson Maziar Nekovee Andrea Passarella Peter Pietzuch Matthieu Roy Francois Taiani Einar Vollset Eiko Yoneki
SSWS (Scalable Semantic Web Knowledge Base Systems) 2007 Program Committee
Pascal Hitzler York Sure Kavitha Srinivas Takahira Yamaguch Raul Garca Castro Aditya Kalyanpur Oscar Corcho Jeff Heflin Ralf Moller Ian Horrocks
Boris Motik Pierre-Antoine Champin Ying Ding Marko Luther Timo Weithoner Andy Seaborne Ulrike Sattler Jan Wielemaker Volker Haarslev
SWWS (Semantic Web and Web Semantics) 2007 Program Committee
Aldo Gangemi Amandeep Sidhu Amit Sheth
Angela Schwering Avigdor Gal Birgit Hofreiter
Organization XVII
Carlos Sierra Carole Goble Chris Bussler Claudia d’Amato David Bell Elena Camossi Elisa Bertino Elizabeth Chang Ernesto Damiani Farookh Hussain Feng Ling Grigoris Antoniou Hai Zhuge Jaiwei Han John Debenham John Mylopoulos Katia Sycara Krzysztof Janowicz Kokou Yetongnon Kyu-Young Whang Ling Liu Lizhu Zhou Lotfi Zadeh Manfred Hauswirth Maria Andrea Rodriguez-Tastets
Masood Nikvesh Mihaela Ulieru Mohand-Said Hacid Monica De Martino Mukesh Mohania Mustafa Jarrar Nicola Guarino Paolo Ceravolo Peter Spyns Pieree Yves Schobbens Pilar Herrero Qing Li Rajugan Rajagopalapillai Ramasamy Uthurusamy Riccardo Albertoni Robert Meersman Robert Tolksdorf Stefan Decker Susan Urban Tharam Dillon Usuama Fayed Wil van der Aalst York Sure Zahir Tari
Table of Contents – Part I
Posters of the 2007 DOA (Distributed Objects and Applications) International Conference
A Deterministic Database Replication Protocol Where Multicast Writesets Never Get Aborted . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
J.R. Juarez-Rodrguez, J.E. Armendariz-Inigo, F.D. Munoz-Esco, J.R. Gonzalez de Mendvil, and J.R. Garitagoitia
AWSM: Infrastructure for Adaptive Web Service Migration . . . . . . . . . . . . 3 Holger Schmidt, Rudiger Kapitza, Franz J. Hauck, and Hans P. Reiser
Generic Proxies—Supporting Data Integration Inside the Database . . . . . 5 Andrei Vancea, Michael Grossniklaus, and Moira C. Norrie
Collaborative Data Synchronization in an Instance-Mapped P2P Data Sharing System . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
Md Mehedi Masud and Iluju Kiringa
Posters of the 2007 ODBASE (Ontologies, Databases, and Applications of Semantics) International Conference
Translating XPath Queries into SPARQL Queries . . . . . . . . . . . . . . . . . . . . 9 Matthias Droop, Markus Flarer, Jinghua Groppe, Sven Groppe, Volker Linnemann, Jakob Pinggera, Florian Santner, Michael Schier, Felix Schopf, Hannes Staffler, and Stefan Zugal
Validating a Tool for Evaluating Automatically Lexical Triples Mined from Texts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
Peter Spyns
Semi-automatic Semantic Enrichment of Raw Sensor Data . . . . . . . . . . . . 13 Nicolas Legeay, Mark Roantree, Gareth J.F. Jones, Noel E. O’Connor, and Alan F. Smeaton
Ontology modelling for Ambient Intelligent Home Environments . . . . . . . 15 Jarmo Kalaoja, Julia Kantorovitch, Ioanna Roussaki, Dimitrios Tsesmetzis, and Ioannis Papaioannou
Implementing OCL as a Database Query Language . . . . . . . . . . . . . . . . . . . 17 Piotr Habela, Krzysztof Kaczmarski, Krzysztof Stencel, and Kazimierz Subieta
XX Table of Contents – Part I
Improving Scalability in Pub-Sub Knowledge-Based Networking by Semantic Clustering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 19
John Keeney, Dominic Jones, Dominik Roblek, David Lewis, and Declan O’Sullivan
A Model for Fuzzy Multidimensional Spaces . . . . . . . . . . . . . . . . . . . . . . . . . 21 Claudia Gonzalez, Raimundo Mirisola, Leonid Tineo, and Angelica Urrutia
Capturing Ontology Evolution Processes by Repeated Sampling of Large Document Collections . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23
Albert Weichselbraun, Arno Scharl, Wei Liu, and Gerhard Wohlgenannt
Information Systems Development: A Trust Ontology . . . . . . . . . . . . . . . . . 25 Kamaljit Kaur Bimrah, Haralambos Mouratidis, and David Preston
Automatic Annotation in Data Integration Systems . . . . . . . . . . . . . . . . . . 27 Sonia Bergamaschi, Laura Po, and Serena Sorrentino
Posters of the 2007 GADA (Grid Computing, High Performance and Distributed Applications) International Conference
Volunteer Computing, an Interesting Option for Grid Computing: Extremadura as Case Study . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 29
Miguel Cardenas Montes, Miguel A. Vega-Rodrguez, Carlos J. Garca Orellana, Manuel Rubio del Solar, Juan A. Gomez-Pulido, Horacio Gonzalez Velasco, Antonio Gomez Iglesias, Juan M. Sanchez-Perez, and Miguel Macas Macas
Replication Heuristics for Efficient Workflow Execution on Grids . . . . . . . 31 J.L. Vazquez-Poletti, E. Huedo, R.S. Montero, and I.M. Llorente
Network-Aware Grid Scheduling . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 33 Agustn Caminero, Blanca Caminero, and Carmen Carrion
Implementing a P2P Network through Updatable Database Views . . . . . 35 Radoslaw Adamus, Hanna Kozankiewicz, Krzysztof Stencel, and Kazimierz Subieta
A Group Selection Pattern Optimizing Job Scheduling in Decentralized Grid Markets . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 37
Isaac Chao, Oscar Ardaiz, and Ramon Sanguesa
A Conceptual Model for Grid Learning Services Automatic Composition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
Gustavo Gutierrez-Carreon, Thanasis Daradoumis, and Josep Jorba
Table of Contents – Part I XXI
Posters of the 2007 IS (Information Security) International Conference
A Multi-party Rational Exchange Protocol . . . . . . . . . . . . . . . . . . . . . . . . . . 42 Almudena Alcaide, Juan M. Estevez-Tapiador, Julio C. Hernandez-Castro, and Arturo Ribagorda
A Texture Based Image Signature Using Second Order Statistics Characterisation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
A. Samia Boucherkha and Mohamed Benmohamed
Expert System for Business Decisions on Security Requirements . . . . . . . 46 Eriks Dobelis
Workshop on Agents, Web Services and Ontologies Merging (AweSOMe)
AWeSOMe 2007 PC Co-chairs’ Message . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 51
Resource Allocation
Daniel Lazaro, Xavier Vilajosana, and Joan Manuel Marques
An Agents-Based Cooperative Awareness Model to Cover Load Balancing Delivery in Grid Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . 64
Pilar Herrero, Jose Luis Bosque, and Mara S. Perez
Semantic Web Approaches
TV Navigation Agent for Measuring Semantic Similarity Between Programs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
Yumiko Mizoguchi-Shimogori, Toshiaki Nakamoto, Kazuma Asakawa, Shinichi Nagano, Masumi Inaba, and Takahiro Kawamura
Engineering an MAS Platform for Semantic Service Integration Based on the SWSA . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85
Ozgur Gumus, Onder Gurcan, Geylani Kardas, Erdem Eser Ekinci, and Oguz Dikenelli
A Planner Infrastructure for Semantic Web Enabled Agents . . . . . . . . . . . 95 Erdem Eser Ekinci, Ali Murat Tiryaki, Onder Gurcan, and Oguz Dikenelli
Agent-Based Applications
From a Goal-Oriented Methodology to a BDI Agent Language: The Case of Tropos and Alan . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 105
Francesco Pagliarecci, Loris Penserini, and Luca Spalazzi
XXII Table of Contents – Part I
A Human-Like SOA-Based Interdisciplinary Framework for Intelligent Virtual Agents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 115
Mauricio Paletta and Pilar Herrero
Short Papers
A Group Selection Pattern for Agent-Based Virtual Organizations Coordination in Grids . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 136
Isaac Chao, Oscar Ardaiz, and Ramon Sanguesa
Web Services System for Distributed Technology Upgrade Within an e-Maintenance Framework . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149
Eduardo Gilabert, Susana Ferreiro, and Aitor Arnaiz
WSBL: Web Service Architecture for Financial Products . . . . . . . . . . . . . . 158 Marcos Aza Hidalgo and Jose Luis Bosque Orero
Workflow Management in Grid Era: From Process-Driven Paradigm to a Goal-Driven One . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 169
Jinlei Jiang, Shaohua Zhang, Johann Schlichter, and Guangwen Yang
BPEL for Semantic Web Services (BPEL4SWS) . . . . . . . . . . . . . . . . . . . . . 179 Jorg Nitzsche, Tammo van Lessen, Dimka Karastoyanova, and Frank Leymann
Workshop on Context Aware Mobile Systems (CAMS)
CAMS 2007 PC Co-chairs’ Message . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191
Users
Context-Awareness in the Wild: An Investigation into the Existing Uses of Context in Everyday Life . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193
Jason Pascoe, Kirsten Thomson, and Helena Rodrigues
‘Guess A Who, Why, Where, When?’: The Visualization of Context Data to Aid the Authoring and Orchestration of a Mobile Pervasive Game . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 203
Michael Wright, Alan Chamberlain, Chris Greenhalgh, Steve Benford, Nick Tandavanitj, Amanda Oldroyd, and Jon Sutton
Modeling
Browsing Semantics in Context-Aware Mobile Hypermedia . . . . . . . . . . . . 211 Cecilia Challiol, Agustin Munoz, Gustavo Rossi, Silvia E. Gordillo, Andres Fortier, and Robert Laurini
Table of Contents – Part I XXIII
Context, Data and Queries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 222 Annika Hinze, George Buchanan, Andrea Schweer, and Matt Jones
Technical Aspects
Wendy Osborn and Annika Hinze
A Peer-to-Peer based Infrastructure for Context Distribution in Mobile and Ubiquitous Environments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 236
Xiaoming Hu, Yun Ding, Nearchos Paspallis, George A. Papadopoulos, Pyrros Bratskas, Paolo Barone, Alessandro Mamelli, Yves Vanrompay and Yolande Berbers
Doctoral Consortium
Information System Development
Elaborating a Decentralized Market Information System . . . . . . . . . . . . . . 245 Rene Brunner and Felix Freitag
COPA-CASE: Methodological Environment for the Generation, Application and Validation of Coordination Patterns . . . . . . . . . . . . . . . . . 255
P.L. Perez-Serrano and M. Sanchez-Alonso
Providing Support for Data Replication Protocols with Multiple Isolation Levels . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 265
J.M. Bernabe-Gisbert
Market Driven Product Ontologies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 275 Davor Meersman
Smart Distribution of Bio-signal Processing Tasks in M-Health . . . . . . . . 284 Hailiang Mei
Service-Oriented Approaches
Dieter Van Nuffel
Sonja Zaplata
Semantic Web Service Offer Discovery . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 314 Jacek Kopecky
Top-Down Modeling Methodology for Model-Driven SOA Construction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 323
Jan Ricken
Workshop on Mobile and Networking Technologies for Social Applications (MONET)
MONET 2007 PC Co-chairs’ Message . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 335
Mobile Learning Environments
Social Knowledge Building in a Mobile Learning Environment . . . . . . . . . 337 Manuel Gentile, Davide Taibi, Luciano Seta, Marco Arrigo, Giovanni Fulantelli, Onofrio Di Giuseppe, and Gaspare Novara
Improving Collaboration and Interaction in Distributed B-learning Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 347
Nidia Moncallo R., Pilar Herrero, and Luis Joyanes
Re-experiencing History in Archaeological Parks by Playing a Mobile Augmented Reality Game . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 357
Carmelo Ardito, Paolo Buono, Maria Francesca Costabile, Rosa Lanzilotti, and Thomas Pederson
Theories and Applications of Multimodal Systems
A Hybrid Grammar-Based Approach to Multimodal Languages Specification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 367
Arianna D’Ulizia, Fernando Ferri, and Patrizia Grifoni
Enabling Rapid Development of Multimodal Data Entry Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 377
Irina Kondratova and Scott Durling
An Approach for Managing Ambiguities in Multimodal Interaction . . . . . 387 Maria Chiara Caschera, Fernando Ferri, and Patrizia Grifoni
Applications of Mobile Technology in Different Social Contexts
Supporting Social Networks by Event-Driven Mobile Notification Services . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 398
Adam Wojciechowski
Realising Context-Sensitive Mobile Messaging . . . . . . . . . . . . . . . . . . . . . . . 407 Jill Freyne, Emil Varga, Daragh Byrne, Alan F. Smeaton, Barry Smyth, and Gareth J.F. Jones
The Mobile Interfaces for Geo-hypermedia Databases . . . . . . . . . . . . . . . . . 417 Yiwei Cao, Ralf Klamma, Satish Srirama, and Kaifei Wang
Personalization in Networked Systems
Personalized Information Access in a Wiki Using Structured Tagging . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 427
Anmol V. Singh, Andreas Wombacher, and Karl Aberer
A Collection-Oriented Framework for Social Applications . . . . . . . . . . . . . 437 Alexandre de Spindler, Michael Grossniklaus, and Moira C. Norrie
A Virtual Shopper Customer Assistant in Pervasive Environments . . . . . 447 Antonella Santangelo, Agnese Augello, Salvatore Sorce, Giovanni Pilato, Antonio Gentile, Alessandro Genco, and Salvatore Gaglio
Profiling Nomadic Users Considering Preferences and Context of Use . . . 457 Angela Carrillo-Ramos, Marlene Villanova-Oliver, Jerome Gensel, and Herve Martin
Networking for Distributed Knowledge Management
ANN-Agent for Distributed Knowledge Source Discovery . . . . . . . . . . . . . . 467 Georgina Stegmayer, M. Caliusco, Omar Chiotti, and M. Rosa Galli
P2P Routing-by-Content on a Lightweight Community Basis . . . . . . . . . . 477 Silvana Castano, Alfio Ferrara, and Stefano Montanelli
Collaborative Systems
Towards a Society of Peers: Expert and Interest Groups in Peer-to-Peer Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 487
Achmad Nizar Hidayanto and Stephane Bressan
Self-organization of Wireless Networks Through Declarative Local Communication (Extended Abstract) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 497
Stephane Grumbach, Jia-liang Lu, and Wenwu Qu
Workshop on Ontology Content and Evaluation in Enterprise (OntoContent)
OnToContent 2007 PC Co-chairs’ Message . . . . . . . . . . . . . . . . . . . . . . . . . . 509
XXVI Table of Contents – Part I
Ontology Design and Evaluation
Evaluation Framework for Automatic Ontology Extraction Tools: An Experiment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 511
Jinsoo Park, Wonchin Cho, and Sangkyu Rho
Ontology Design Risk Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 522 Carlos Ruben Ferreira, Pedro Marques, Andre L. Martins, Sergio Rita, Bruno Grilo, Rudi Araujo, Peyman Sazedj, and H. Sofia Pinto
Ontology-Based Decisions and Dialogues
On Conducting a Decision Group to Construct Semantic Decision Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 534
Yan Tang
Ontology-Based Medical Applications
Federated Ontology Search for the Medical Domain . . . . . . . . . . . . . . . . . . 554 Vasco Calais Pedro, Lucian Vlad Lita, Stefan Niculescu, Bharat Rao, and Jaime Carbonell
An Ontology-Based Technique for Validation of MRI Brain Segmentation Methods . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 566
Bruno Alfano, Marco Comerci, Giuseppe De Pietro, and Amalia Esposito
Workshop on Object-Role Modeling (ORM)
ORM 2007 PC Co-chairs’ Message . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 579
Process Modeling
Fact-Oriented Modeling in the Data-, Process- and Event Perspectives . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 591
Peter Bollen
Declarative Process Modeling with Business Vocabulary and Business Rules . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 603
Stijn Goedertier and Jan Vanthienen
Table of Contents – Part I XXVII
Metamodeling
A NIAM2007 Conceptual Analysis of the ISO and OMG MOF Four Layer Metadata Architectures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 613
Inge Lemmens, Maurice Nijssen, and Sjir Nijssen
A Meta-model for Ontologies with ORM2 . . . . . . . . . . . . . . . . . . . . . . . . . . . 624 Christina Tziviskou and C. Maria Keet
Data Integration
Object Role Modeling Enabled Metadata Repository . . . . . . . . . . . . . . . . . 634 Bryan Shelstad, Pat Hallock, Necito Dela Cruz, and Dick Barden
Using ORM in an Ontology Based Approach for a Common Mapping Across Heterogeneous Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 647
Baba Piprani
Modeling Data Federations in ORM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 657 Herman Balsters and Terry Halpin
Industrial Applications
Promising Chance of Innovation for Conceptual Modeling in Commerzbank . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 667
Mario Gutknecht
Industrial Experience with Fact Based Modeling at a Large Bank . . . . . . 678 Jos Rozendaal
Is There Fact Orientation Life Preceding Requirements? . . . . . . . . . . . . . . 688 Jos Vos
Formal Issues
Reduction Transformations in ORM . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 699 Terry Halpin, Andy Carver, and Kevin M. Owen
Visualizing Formalisms with ORM Models . . . . . . . . . . . . . . . . . . . . . . . . . . 709 S.J. Overbeek, P. van Bommel, H.A. (Erik) Proper, and D.B.B. Rijsenbrij
Advances in FCO-IM (2): A Shorter Algorithm for Determining Intra Fact Type Uniqueness Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 719
Jan Pieter Zwart and Guido Bakema
Description Logics and OWL
Mapping ORM into the SHOIN/OWL Description Logic: Towards a Methodological and Expressive Graphical Notation for Ontology Engineering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 729
Mustafa Jarrar
XXVIII Table of Contents – Part I
Mapping OWL-DL into ORM/RIDL . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 742 Dang Bui Bach, Robert Meersman, Peter Spyns, and Damien Trog
Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 753
J.R. Juarez-Rodrguez1, J.E. Armendariz-Inigo1, F.D. Munoz-Esco2, J.R. Gonzalez de Mendvil1, and J.R. Garitagoitia1
1 Universidad Publica de Navarra, 31006 Pamplona, Spain {jr.juarez,enrique.armendariz,mendivil,joserra}@unavarra.es
2 Instituto Tecnologico de Informatica, 46022 Valencia, Spain [email protected]
Introduction. Several approaches for the full replication of data in distributed databases [1] have been studied. One of the preferred techniques is the eager update everywhere based on the total-order multicast delivery service [2], where the most outstanding va- rieties are: certification-based and weak-voting [1]. Under this approach, the execution flow of a transaction can be split into two different main phases: the first one, all operations are entirely executed at the delegate replica of the transaction; and followed by the second phase, started when the transaction requests its commit, all updates are collected and grouped (denoted as writeset) at the delegate replica and sent to all replicas. The commitment or abortion of a transaction is decided upon the delivery of the message. In the case of certification-based ones, each replica holds an ordered log of already committed transactions and the writeset is certified [3], against the log, to commit or abort the transaction. On the other hand, weak-voting ones atomically apply the delivered writeset at remote replicas whilst the delegate, if it is still active, reliably mul- ticasts [2] a commit message. Thus, the certification-based presents a better behavior in terms of performance, only one message is multicast per transaction, but with higher abortion rates [1]. Recently, due to the use of DBMS providing SI, we have found several certification-based protocols to achieve, actually a weaker form called GSI [3], this isolation level in a replicated setting [3] while quite a few weak-voting ones [4].
Total-order multicast in database replication offers two attractive properties: a) they reliably send the writeset to all replicas; and, b) they provide the same scheduling of transactions and, thus, all replicas reach the same decision for each transaction in the replicated setting. However, if we focus in the scheduling policy, there is a point where certification-based and weak-voting techniques converge: all delivered messages coming from a replica are known to be successfully certified (i.e no need of a log for certification ones) and committed (i.e. no need for the additional message exchange for weak-voting ones). Nevertheless, this may cause the penalization of certain transaction patterns. We propose an eager update-everywhere replication protocol [5] that follows the most straightforward scheduling policy: a round-robin based on replica identifiers that is unique and known by all replicas. At a given slot, only those writesets coming from the replica associated to that slot are allowed to commit, while the conflicting local transactions should be aborted. This generates a unique scheduling configuration of all replicas where all writesets are applied in the same order providing GSI. This work has been partially supported by the EU FEDER and Spanish MEC under grant
TIN2006-14738-C02.
R. Meersman, Z. Tari, P. Herrero et al. (Eds.): OTM 2007 Ws, Part I, LNCS 4805, pp. 1–2, 2007. c© Springer-Verlag Berlin Heidelberg 2007
2 J.R. Juarez-Rodrguez et al.
Outline of the Protocol. The replication protocol is going to be implemented in a middleware system. All operations of a transaction Ti are submitted to the middleware (abort operations are ignored for simplicity) corresponding to its delegate replica (k). Each middleware replica stores the same copy of a list (to work) that determines the scheduling of transactions in the system. Here, for the sake of understanding, it is as- sumed a round robin scheduling based on replica identifiers (N). The to work variable is in charge of deciding which replica can send a message or which writeset has to be applied, respectively. Initially, it is filled with infinite tuples (just for algorithm presentation purposes) of the form order, n mod N, n, ∅ with n ∈ N, sorted by n.
When a transaction requests its commit the writeset is retrieved from the local database replica, if it is an empty one the transaction will be committed. Otherwise, there is a list (WS list) that stores local transactions (with their writesets) that have requested their commit. Concurrent to this, the replica must wait for its turn, i.e. the first position of order, k, n, ∅, in its own to work. Once it reaches its turn, if there are no transactions stored in WS list it will make advance the turn to the next middleware replica by multicasting (reliable) the next, k, n, ∅ to all replicas. Otherwise, it will reliably multicast all the writesets contained in WS list in a to commit, k, n, WS list. Upon delivery of these next and to commit messages they are substituted in their proper positions (which is reflected by n) of the to work list of the delivered replica. All replicas run at different speed and there could be replicas still handling previous positions of their own to work. The next tuples of to work are deleted so it can progress the scheduling of new transactions. We will distinguish two cases of writeset execution: at its delegate replica or at a remote replica. In the first case the transactions will be directly committed. Whereas in the other case a remote transaction is used to apply and commit the transaction. However, it may conflict with local transactions and being involved in a local database deadlock. To partially avoid this fact, we stop the execution of write operations in the system. Nevertheless, this is not enough since the writeset can be involved in a deadlock with local transactions that already wrote in some data item that intersects with the writeset and be aborted. Hence, it must be re-attempted until its successful completion. Further details about its execution flow, correctness, comparing simulations and fault-tolerance issues are given in [5].
References
1. Wiesmann, M., Schiper, A.: Comparison of database replication techniques based on total order broadcast. IEEE TKDE 17(4), 551–566 (2005)
2. Chockler, G., Keidar, I., Vitenberg, R.: Group communication specifications: a comprehensive study. ACM Comput. Surv. 33(4), 427–469 (2001)
3. Elnikety, S., Pedone, F., Zwaenopoel, W.: Database replication using generalized snapshot isolation. In: SRDS, IEEE-CS, Los Alamitos (2005)
4. Juarez, J.R., Armendariz, J.E., de Mendvil, J.R.G., Munoz, F.D., Garitagoitia, J.R.: A weak voting database replication protocol providing different isolation levels. In: NOTERE 2007 (2007)
5. Juarez, J.R., Armendariz, J.E., Munoz, F.D., de Mendvil, J.R.G., Garitagoitia, J.R.: A deterministic database replication protocol where multicast writesets never got aborted. Technical Report ITI-ITE-07/15, ITI (2007)
AWSM: Infrastructure for Adaptive Web
Service Migration
Holger Schmidt1, Rudiger Kapitza2, Franz J. Hauck1, and Hans P. Reiser3
1 Institute of Distributed Systems, Ulm University, Germany {holger.schmidt,franz.hauck}@uni-ulm.de
2 Dept. of Comp. Sciences, Informatik 4, University of Erlangen-Nurnberg, Germany [email protected]
3 LaSIGE, Departamento de Informatica, University of Lisboa, Portugal [email protected]
Abstract. Ubiquitous computing applications have to cope with a highly dynamic and heterogeneous infrastructure. Thus, software must be able to adapt dynamically and react to the environment. Further- more, it should be platform and language independent. We propose an infrastructure for stateful self-adaptive migratable Web services for implementing ubiquitous computing applications. Our infrastructure allows location-transparent, stateful migration at runtime. Unlike related work, we introduce location-independent Web service references. Our Web services support adaptation to the application context by being able to dynamically change the interface, locally available state and implementation at the same time. The concept can be transferred to any Web service platform as we build on top of standard Web service technology.
Keywords: Web Service, Migration, Adaptation, Platform Indepen- dency, Dynamic Loading of Code.
Ubiquitous Computing infrastructures should provide mechanisms to automatically handle heterogeneity and to reduce the complexity of handling adaptivity and reactivity in the applications. State-of-the-art infrastructures have limita- tions in terms of supporting adaptation and handling heterogeneity.
In this paper, we present stateful self-adaptive migratable Web services (SAM- WS). A SAM-WS is comparable to a distributed object, which offers a Web service interface. It can dynamically load the code necessary for the given environment, change its interface on the basis of the current location context, and ad- just the active state that is available at the current node. The novel contribution of our infrastructure is that it combines Web service technology with mobility mechanisms that support adaptation and heterogeneity. The key difference to related work on migratable Web services [1] is the support for adaptation to the current application context by dynamically changing the service interface, the locally available state and the implementation in use. Unlike our previous work on context-aware migration of CORBA objects [2], in this paper we propose the use of standard Web service technology as core mechanism, which highly simplifies interoperability between heterogeneous infrastructures of different vendors and
4 H. Schmidt et al.
allows disconnected operation. On the basis of previous work [3], the presented platform contains a novel dynamic deployment service that allows migration of services to machines on which the corresponding code is unavailable and thus has to be loaded on demand. We support client-transparent migration by intro- ducing persistent Web service references for the whole life-cycle on basis of a globally unique ID for each SAM-WS instance, which is encoded into the service URL, and a location service enabling discovery of the current location.
Figure 1 shows the CORBA life-cycle-service-like interaction among the logical entities for self-adaptive Web service migration. Migration is initiated by storing the Web service’s active state into a state store service for later use. Then, the SAM-WS discovers possible migration targets with the help of a factory finder service. Therefore, the SAM-WS passes criteria to the factory finder service (e.g., required context and desired interface at target location) according to which appropriate factory services (i.e., migration targets) are returned. These factory services enable the remote deployment of arbitrary Web services. The factory service that is returned by the factory finder service allows the creation of the criteria-specified Web service facet (i.e., a specific configuration of interface, state and implementation) at the desired location. Last, the newly created Web service is updated with the necessary state from the state store service, the original Web service is undeployed and references to the Web service are updated by storing the current location in the location service.
Fig. 1. Collaboration of logical entities for self-adaptive Web service migration
Our ongoing work targets the prototype implementation for other Web service platforms, i.e., .NET and the Java Micro Edition. We do not expect interoperability problems, as our infrastructure only relies on standard Web service technology. Additionally, for supporting the development of a SAM-WS, we will investigate the use of a model-driven architecture.
References
1. Hammerschmidt, B.C., Linnemann, V.: Migratable Web Services: Increasing Perfor- mance and Privacy in Service Oriented Architectures. IADIS Int. Journal on Comp. Sci. and Info. Sys. 1(1), 42–56 (2006)
2. Kapitza, R., Schmidt, H., Soldner, G., Hauck, F.J.: A Framework for Adaptive Mobile Objects in Heterogeneous Environments. In: Meersman, R., Tari, Z. (eds.) On the Move to Meaningful Internet Systems 2006: CoopIS, DOA, GADA, and ODBASE. LNCS, vol. 4276, pp. 1739–1756. Springer, Heidelberg (2006)
3. Kapitza, R., Schmidt, H., Bartlang, U., Hauck, F.J.: A Generic Infrastructure for Decentralised Dynamic Loading of Platform-Specific Code. In: DAIS 2007 (2007)
Generic Proxies—Supporting Data Integration
Inside the Database
Institute for Information Systems, ETH Zurich CH-8092 Zurich, Switzerland
{vancea,grossniklaus,norrie}@inf.ethz.ch
Abstract. Existing approaches to data integration generally propose building a layer on top of database systems to perform the necessary data transformations and manage data consistency. We show how support for the integration of heterogeneous data sources can instead be built into a database system through the introduction of a generic proxy concept.
Over the last two decades a great deal of research in the database and information systems communities has addressed the challenges of data integration. Generally, the problem addressed is how to combine data from different sources to provide a unified user view [1]. Various approaches have been proposed depending on the purpose of the integration and the nature of the data sources, but two broad categories of data integration systems that have received a lot of attention in recent years are mediator [2] and data warehousing [3] systems. These systems tend to have a common architectural approach in that integration is achieved by building extra layers on top of the database systems. We believe that adding internal support for data integration in a database system can have positive effects in the development of data integration systems.
In our approach, the integration of external information sources is done using a generic proxy. A generic proxy consists of two parts: the proxy object and the proxy process. The proxy object represents the database view of the external data source. The data from the external source is cached locally, similar to the data warehouse approach. Queries can be executed locally without any communication to the external source. The synchronisation between the database view of the information source and the external information source is done automatically by the database management system in a transparent way. We have defined a proxy programming interface that allows the user to specify how a proxy object interacts with an external source. The user has to write different implementations for different types of external sources. The proxy processes are created from particular implementations of the proxy interface.
When a user wants to create a new proxy object, they must specify the name of the proxy and also the list of arguments that are needed in order to initialize the generic proxy. First, a new proxy object is created and stored in the database. Afterwards, the proxy object must be associated with an existing or newly created proxy process. This association is performed using a chain of responsibil- ity approach. All of the existing proxy processes pertaining to the current proxy
6 A. Vancea, M. Grossniklaus, and M.C. Norrie
type are asked to accept the newly created proxy object using the accept call. The proxy object is associated with the first process that accepts it. If no such process is found, a new one is created and associated with the proxy object. The association between the proxy object and the proxy process cannot be changed at a later time.
A proxy process must handle the bi-directional communication between the database and the external source. When the proxy object is changed, the database system, using the proxy process, sends the modifications to the information source. At the same time, when the external information source is changed the database system is notified by the proxy process. Having a running proxy process for each proxy object is clearly not a feasible solution. We therefore chose to map more than one proxy object to a single proxy process. By using the proxy programming interface, the user can specify how the mapping of proxy objects to proxy processes is done for particular types of proxies.
We maintain a FIFO list that contains the proxy objects that are scheduled for synchronisation with their external information sources. A proxy object is added to this list if the value of one of its attribute is modified or as a result of the modification of the external information source. The proxy objects are ex- tracted, one by one, from the list and are synchronised with the external sources. During the synchronisation process, a new object is created (remoteObject) by reading the data directly from the external source. The values of the two objects (the proxy object and remoteObject) are then merged together, resulting a new object (mergedObject). Potential conflicts are also solved during the merging process. The values of mergedObject are then sent to the information used, using the proxy process. The proxy object is replaced with mergedObject.
By using the generic proxy mechanism, the synchronisation between the external information sources and the database system is done automatically when the information source is changed or when the value of its proxy object is modified. The system does not guarantee that the client will work with the latest versions of the information sources, but the synchronisation is usually done within a reasonable amount of time. We have implemented generic proxies in an object data management framework based on the db4o object storage system [4].
References
1. Lenzerini, M.: Data Integration: A theoretical Perspective. In: Proceedings of ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, Madi- son, WI, USA, pp. 233–246. ACM Press, New York (2002)
2. Wiederhold, G.: Mediators in the Architecture of Future Information Systems. In: Huhns, M.N., Singh, M.P. (eds.) Readings in Agents, Morgan Kaufmann, San Fran- cisco (1997)
3. Widom, J.: Research Problems in Data Warehousing. In: Proceedings of Interna- tional Conference on Information and Knowledge Management, Baltimore, MD, USA (1995)
4. Paterson, J., Edlich, S., Horning, H., Horning, R.: The Definitive Guide to db4o. Apress (2006)
Collaborative Data Synchronization in an
Instance-Mapped P2P Data Sharing System
Md Mehedi Masud and Iluju Kiringa
SITE, University of Ottawa, Canada {mmasud,kiringa}@site.uottawa.ca
Abstract. In this paper, we propose a data synchronizing mechanism between peers in a peer-to-peer (P2P) database network where each peer has an independently created relational database. We assume that data- level mappings are used to resolve data heterogeneity between two peers. According to the strategy, peers resolve update execution conflicts during data synchronization in a collaborative fashion.
Peer-to-peer data sharing deals with the exchange of data between heterogeneous sources whose data need not be interdependent, replicated, and may represent different real world domains. In this paper, we assume that each peer stores heterogeneous relational data which are related to data stored in remote peers through mapping tables [1]. Intuitively, mapping tables are data-level mappings which list pairs of corresponding values between two sources and thereby act as an interface to relate data between two peers. Two peers related through mapping tables are said to be acquainted. In the settings, any peer may initi- ate an update which is executed first locally and then the update is propagated throughout the P2P network among the acquainted peers in order to synchro- nize the data. The authors in [2] introduce the update semantics in such an environment and describe update execution mechanism. The authors also propose a data synchronization mechanism, where each peer independently detects and resolves conflicts and agrees on the same data value with its acquaintees. In this paper we propose a data synchronization technique where peers resolve conflicts in a collaborative fashion where human intervention may be required to resolve conflicts. The approach is applicable where the system tolerates data in- consistency for a certain period of time and update to a peer is not immediately important to other peers. The strategy is described below.
Consider that a peer receives two updates generated from two peers that modify a tuple in the database. Without proper knowledge, the peer is unable make a decision which one to accept or reject. Due to the arbitrary topology of P2P networks, conflict between the same pair of updates may occur at different peers during their propagation. In order to keep the databases consistent, each peer must reach the same decision to execute the updates. According to the strategy, when a peer detects a conflict, the peer consults with its parent about the decision. Note that a peer which forwards an update is a parent and the peer which receives the update is called a child peer. If the parent has no knowledge
8 M.M. Masud and I. Kiringa
Fig. 1. Collaborative approach
about the execution decision, then the parent also asks its parent. This process continues until a peer is found which knows the decision or the inquiry reaches the initiators. The first peer which detects the conflict may have already propagated an inquiry along the path to the initiators and the result is already decided. Hence, other peers which detect the same conflict may receive the result from any intermediate peers along the path to the initiator. After receiving the conflicting updates, both initiators reach an agreement about the conflict resolution. The initiators then propagate the result to the conflicting peers. Each peer along the path stores the result. After receiving the decision, conflicting peers continue the execution of the updates.
The collaborative algorithm is illustrated in Figure 1. Consider that the peers P2, P3, and P4 have a conflict between two updates u1 and u6. Also in peers Pi
and Pj , somewhere in the network, the same pair of updates u1 and u6 involved in conflict. To decide about the execution, P2 enquires its parent about execution decision. In this case the parent is the initiator of u1. Similarly, P3 asks P5 which in turn asks P6, the initiator of u6. P4 also asks P2 and P5 about the decision and waits for the decision. In addition, Pi and Pj also involved in conflict with respect to u1 and u6. Pi and Pj also perform the same procedure by asking their respective parents. In this case Pj asks P7 along the path Pj → · · · → P7. P7
then asks P3. If P3 has already the result then P3 informs P7 about the result. Otherwise, P7 waits for P3 which is also waiting for the result. Similarly, Pi asks P1 along the path Pi → · · · → P1, which is the initiator of u1. During request propagation, if any peer Pk is found which knows the decision, then Pk forwards the result to Pi along the path Pk → · · · → Pi. When the inquiry reaches both P1 and P6, decision is made. In this case users may be involved if the decision cannot be taken automatically. After the decision has been made, the results are propagated to all the inquiring peers. In this way peers resolve the conflict in a P2P network.
References
1. Kementsietsidis, A., Arenas, M., Miller, R.J.: Mapping Data in Peer-to-Peer Sys- tems: Semantics and Algorithmic Issues. In: SIGMOD (2003)
2. Masud, M., Kiringa, I., Ural, H.: Update Propagation and Data Synchronization in Instance Mapped Peer Data Sharing Systems. In: InterDB (2007)
R. Meersman, Z. Tari, P. Herrero et al. (Eds.): OTM 2007 Workshops, Part I, LNCS 4805, pp. 9–10, 2007. © Springer-Verlag Berlin Heidelberg 2007
Translating XPath Queries into SPARQL Queries
M. Droop1, M. Flarer1, J. Groppe2, S. Groppe2, V. Linnemann2, J. Pinggera1, F. Santner1, M. Schier1, F. Schöpf1, H. Staffler1, and S. Zugal1
1 University of Innsbruck, Technikerstrasse 21a, A-6020 Innsbruck, Austria [email protected], [email protected], {Jakob.Pinggera,Florian.Santner}@student.uibk.ac.at,
[email protected], [email protected], {Hannes.Staffler, Stefan.Zugal}@student.uibk.ac.at
2 IFIS, University of Lübeck, Ratzeburger Allee 160, D-23538 Lübeck, Germany {jinghua.groppe,groppe,linnemann}@ifis.uni-luebeck.de
Extended Abstract
The W3C has developed XPath [3] as a query language for XML data. XPath is embedded in many other languages like XQuery and XSLT. The name of XPath derives from its basic concept, the path expression, with which the user can hierarchically address the nodes of the XML data. The user of XPath may not only use simple relationships like parent-child, but also more complex relationships like the descendant relationship, which is the transitive closure of the parent-child relationship. Furthermore, complex filter expressions are allowed in XPath queries.
RDF is a language for representing information about resources in the World Wide Web. SPARQL [2] supports querying RDF by triple and optional patterns, con- and disjunctions and extensible value testing.
<bookstore> <book category="CHILDREN">
<title>Harry Potter</title> <author>J. K. Rowling</author></book> <book/></bookstore>
Fig. 1. An example XML document
The translation process from XPath [3] queries into SPARQL [2] queries consists of (i) the translation of the input data from XML into RDF, (ii) the translation from the XPath query into the translated SPARQL query, and (iii) the translation of the result into a format, which is equivalent to the result of the XPath query.
Fig. 2. Transformed RDF data of Fig. 1
bookstore rel:n
relationship rrel: r
10 M. Droop et al.
We translate the XML data into RDF data by a depth-first traversal of the XML tree and annotate each translated node of the XML data with relationships for annotating the type of the XML node, attribute relationships, namespace relationships, parent-child relationships, its name, its value and two relationships for the usage of a numbering scheme [1] (see Fig. 1 and Fig. 2), as SPARQL queries do not allow the computation of the transitive closure, which is necessary for recursive XPath axes.
With these relationships, we can support all XPath axes in our translation scheme, as we can determine the nodes according to the basic relationships. Note that the XPath location step following::n is equivalent to ancestor-or-self::node()/following- sibling::node()/descendant-or-self::n, and the XPath location step preceding::n is equivalent to ancestor-or-self::node()/preceding-sibling::node()/descendant-or-self::n.
We use standard compiler techniques for the translation of the XPath query into the SPARQL query. See Fig. 3 for the translation of the XPath query /bookstore/parent:: node()/descendant::title/text().
PREFIX rel: <http://uibk.ac.at/relations/> PREFIX xsd:<http://www.w3.org/2001/XMLSchema#> SELECT ?v9 WHERE { ?v0 rel:type "9".
?v0 rel:child ?v1. ?v1 rel:type "1". ?v1 rel:name "bookstore". ?v2 rel:child ?v1. ?v7 rel:start ?v3. ?v2 rel:start ?v5.
?v7 rel:end ?v4. ?v2 rel:end ?v6. ?v7 rel:type "1". ?v7 rel:name "title". ?v7 rel:child ?v8. ?v8 rel:type "3". ?v8 rel:value ?v9. FILTER(xsd:long(?v6)>xsd:long(?v4)). FILTER(xsd:long(?v5)<xsd:long(?v3)).}
Fig. 3. Translated SPARQL query of /bookstore/parent::node()/descendant::title/text()
The result of a SPARQL query is a set of bindings of variables in the SELECT clause of a SPARQL query. We determine the translated SPARQL query in such a way that the retrieved bindings of the variables in the SELECT clause of the SPARQL query represent the resultant XML nodes of the original query. In the module of the translation of the result, we rebuild the subtrees of these resultant XML nodes by considering the information of the original XML tree in the RDF data. Furthermore, we sort the resultant XML trees according to the document order of the original XML tree, as the XPath language specifies the result of an XPath query to be in document order of the queried XML document.
We have developed a prototype to verify our translations and to show the practical usability. We have done a performance analysis to measure the execution times of the translations and the evaluations of the XPath query and the translated SPARQL query. The evaluation of translated SPARQL queries from XPath queries not containing a recursive axis is efficient and not significantly slower than processing the original XPath queries.
References
1. Grust, T., van Keulen, M., Teubner, J.: Accelerating XPath evaluation in any RDBMS. ACM Trans. Database Syst. 29, 91–131 (2004)
2. W3C, SPARQL Query Language for RDF, W3C Candidate Recommendation (2007) 3. W3C: XML Path Language (XPath) 2.0, W3C Recommendation (2007)
R. Meersman, Z. Tari, P. Herrero et al. (Eds.): OTM 2007 Workshops, Part I, LNCS 4805, pp. 11–12, 2007. © Springer-Verlag Berlin Heidelberg 2007
Validating a Tool for Evaluating Automatically Lexical Triples Mined from Texts
Peter Spyns
Vrije Universiteit Brussel, STAR Lab Pleinlaan 2, Gebouw G-10, B-1050 Brussel, Belgium
[email protected] http://www.starlab.vub.ac.be
Abstract. We report on an on-going effort to assess an automated ontology evaluation method that uses lexical frequencies to determine which are relevant lexical triples of a set of triples automatically mined from a textual corpus. The aim is to obtain a light-weight automatic ontology evaluation method that can be easily applied by knowledge engineers to determine whether or not the most important notions and relationships are represented in a set of ontology triples.
1 Problem
More and more ontologies are created automatically to avoid the knowledge acquisition bottleneck. The question then arises of how to enable non ontology engineering skilled individuals to estimate the “value” of ontological material generated automatically. It is our hypothesis that relatively crude evaluation methods suffice to give a general indication of how well the material fits the domain under scrutiny. But even the automated evaluation method needs to be assessed first by human experts and checked on its validity.
2 Methods
Two texts (the EU directives on privacy and VAT) have been selected to be processed by an unsupervised text miner (a combination of a shallow parser and statistically based filters built by CNTS Antwerp). Series of triples (consisting of combinations of noun phrases, verbs and prepositional phrases) have been generated. Some evaluation metrics have been defined using a simple and basic method. First the relevant terms of a text (compared to a neutral corpus) are determined. This allows us to compare the set of relevant words with the vocabulary of the triples generated by the unsupervised miner. In addition, a list of VAT terms and expressions was available to validate the set of terms retrieved automatically. Unfortunately, such a list did not exist for the Privacy domain. Afterwards, the triples themselves are scored as well. A score indicates how many characters of the three triple parts (expressed as an averaged percentage) are matched by relevant words. The evaluation methods can be kept simple and straightforward: it is only meant as a check to determine whether or not the more sophisticated text miner has done a good job. Finally, to assess the quality of
12 P. Spyns
the automatic evaluator, human experts have manually checked the outcomes (for the privacy directive). In the case of the VAT directive no experts were available, but instead the manually created list of relevant terms and expressions had to be used.
3 Discussion
The figure shows how the experiment has been set up. A problem was that the experiments could not be performed completely in parallel. Also, the Privacy experts
inter rater agreement was extremely low (due to their different background).
4 Conclusion
Even if the current experiments give a partially indecisive answer to the simple question whether the automatic evaluation procedure is up to providing a reliable indication on the quality of triples produced by a text miner, this line of research still offers further avenues of research to be explored. The results presented here can serve as a base line. The growing number of recent publications
on ontology evaluation illustrate that the topic itself is becoming a valuable research area on its own.
Acknowledgements
We gratefully thank M.-L. Reinberger (then at CNTS Antwerpen, Belgium), John Borkin (Borking Consultancy, The Netherlands) and Giles Hoghen (then at the EU JRC Ispra, Italy) and Patrick Wille (VAT@ Belgium) for their contributions.
Fig. 1. Flow of the experiment
Semi-automatic Semantic Enrichment of Raw
Sensor Data
Nicolas Legeay, Mark Roantree, Gareth J.F. Jones, Noel E. O’Connor, and Alan F. Smeaton
Adaptive Information Cluster, Dublin City University, Ireland
1 Sensor Network Background
In the XSENSE Project, we gathered a total of 6 biometric sensor data feeds from the participants in our experiments using 3 different sensor devices. These readings were taken during 33 experiments where upto 6 users watched a variety of different films and their reactions were monitored.
Polar S610iTM heart-rate monitor. This consists of a fabric band which fits around a person’s chest and detects and logs their heartrate, sampled every few seconds.
BodyMedia SenseWear R©. This sensor array is worn around the upper arm and measures and logs the following: galvanic skin response, a measure of skin conductivity which is affected by perspiration; skin temperature, which is linearly reflective of the body’s core temperature activities; heat flux which is the rate of heat being dissipated by the body; subject motion using an in-built accelerometer.
Smart Chairs. Each of the chairs used had a specially designed foam-based pressure sensor integrated into its backrest to record changes in viewer posture.
2 Managing a Large Sensor Network
In order to make the process scalable, we developed a peer-to-peer architecture where each sensor was modelled as a peer. Using XSENSE-Peer, a sensor is modelled as a peer. Peers sharing common information are grouped into a cluster and managed by a super-peer. The definition of a cluster is flexible and might contain all heart-monitor data, or all data for a specified experiment, or all experiments that contained no gender mix among the users, for example. Clusters of peers are referenced by domains. Queries are sent to chosen domains and then routed using super-peers to the appropriate clusters. In this example, we have a single domain, CDVPlex, and all clusters belong to this domain.
Each peer makes its sensor data available in the form of a service. A special client peer called a Query Peer reads XPath queries, sends them to Cluster Peers and retrieves responses. A Repository Peer receives metadata queries from both Query Peers or Cluster Peers. A Cluster Peer receives XPath Full Paper available at www.computing.dcu.ie/∼isg/technicalReport.html
14 N. Legeay et al.
queries from Query Peers and passes the query to all Data Peers in its cluster. It aggregates responses and returns the result back to the Query Peer.
1. The Query Peer passes keywords to the Repository Peer requesting ids of suitable Cluster Peers.
2. The query is sent to the ClusterPeers. 3. Cluster Peers request the ids of the Data Peers within their respective clus-
ter from the Repository Peer. This step can be eliminated by loading this information at startup but we chose to leave it in place for our experiments. This was to enable a system where sensors can come and go in a random fashion.
4. Data Peers send results to their Cluster Peers 5. Cluster Peers send the final result to the QueryPeer.
3 Experiments and Conclusions
Experiments were run on 3.2GHz Pentium IV machines, each with 1GB of RAM using the Windows XP Pro operating system and the P2P Query Processor was implemented using Java Virtual Machine (JVM) version 1.5. Each peer required a separate JVM (even on the same machine) to emulate a properly distributed environment and experiments were run three times with their times averaged to produce the final query response time. A P2P query using between 10 and 40 peers required between 2 and 10 seconds, proportional to the number of peers. We discovered that if queries used more than 50 sensor devices, some form of pre-integration or caching is recommended but where clusters are kept to a reasonable size, dynamic queries have good response times.
As sensor networks become more pervasive, the volumes of data generated will pose challenges to managing the stream of data values in an efficient, scalable, and yet useful manner. This data will include data readings from sensing devices, such as the biometric sensing devices we have used in this paper. It will also include data values derived from analysis of raw sensed data, such as the highlights and event detection results from an audio-visual data stream which we have illustrated in this paper through our analysis of movie video. While many differing solutions exist for efficiently managing the raw data values, we are more concerned in the work reported here on allowing semantic enrichment of the raw data to take place and to facilitate subsequent high level queries. To address this we have presented and used the XSENSE architecture, extended with Peer-2-Peer concepts and implementation, to realise scalable management of sensor data at a semantic level. We have demonstrated this in operation using a dataset of 33 experiments covering 29 movies and a total of 171 sensor outputs, realising a data volume of 316 MB of raw data. Our implementation has been tested using a collection of different semantic query types and response time performance, on a standard desktop machine, has been good.
R. Meersman, Z. Tari, P. Herrero et al. (Eds.): OTM 2007 Ws, Part I, LNCS 4805, pp. 15–16, 2007. © Springer-Verlag Berlin Heidelberg 2007
Ontology Modelling for Ambient Intelligent Home Environments
Jarmo Kalaoja1, Julia Kantorovitch1, Ioanna Roussaki2, Dimitrios Tsesmetzis2, and Ioannis Papaioannou2
1 The Technical Research Centre of Finland (VTT), Kaitoväylä 1, 90570 Oulu, Finland {Julia.Kantorovitch,Jarmo.Kalaoja}@vtt.fi
2 School of Electrical & Computer Engineering, National Technical University of Athens, 9 Heroon Polytechneiou Str, 157-73 Zographou, Athens, Greece {nanario,jpapai,dtsesme}@telecom.ntua.gr
Abstract. The research work presented in this paper focuses on the ontologies necessary to describe ambient intelligent home environments.
Keywords: Ontology specification, service modelling, Intelligent Home.
1 Introduction
Ontologies are very essential for the Ambient Intelligent Home (AIH) environment. They act as the means for describing the services provided by networked devices, sensors and appliances, thus facilitating their seamless automatic communication to support the users in their everyday tasks. Even though several ongoing initiatives study the problem of ontology design in pervasive environments, numerous issues remain unresolved. The designed ontologies focus mainly on very specific service aspects, e.g. modelling context [1] or QoS related service properties [2]. The capabilities of services from different functional domains, such as personal computing (PC), mobile communications (MC), consumer electronics (CE), and home automation (HA) (i.e. domotic), are addressed in a minor degree and are not aligned with the non-functional ontologies. Minor attempts have been made to integrate the existing ontologies in AIH environments and facilitate their integration with emerging new technologies for networks, devices and software architectures and platforms. The research presented in this paper addresses the issues above and has been performed within the Amigo integrated project [3]. Utilization of ontologies in Amigo enables the effective description of the heterogeneous services and resources residing in the home. Rich representation of service capabilities with non-functional parameters, such as QoS and context, enable the automated service discovery, selection and composition. The ontology architecture is briefly discussed in the next section. The Amigo ontologies and relevant user and developer guides are available at: http://amigo.gforge.inria.fr/home/index.html.
2 The Architecture of Ontologies
The main rationale behind the overall hierarchy of the Amigo Service Description Vocabulary Ontologies (see Fig.1) is that vocabularies should support maintainability and future evolution of concepts related to Amigo or any other home environment.
16 J. Kalaoja et al.
Fig. 1. Service description vocabularies’ classification and dependencies
The Domain Vocabularies are extendable modules that provide detailed information about technologies and features of a particular class or model of a device in the home. New domain vocabularies can be added to the existing ones (i.e. PC, MC, CE and HA) to cover more device manufacturers. The main part of vocabularies belongs to the Amigo Core Domain vocabularies. Generic ontologies for various domains, such as the Foundation of Intelligent Physical Agents (FIPA) device ontology [4], may be imported or adapted by these ontologies. Furthermore, any semantic service description language such as Amigo-S [4] or OWL-S [5] can be imported. The Amigo Core Concepts layer provides a classification of concepts selected from the Amigo core domain vocabularies that have important cross-domain relations. More information about ontologies and their usage can be found in [6][7].
References
1. Sirin, E., Parsia, B., Hendler, J.: Filtering and selecting semantic web services with interactive composition techniques. IEEE Intelligent Systems 19(4), 42–49 (2004)
2. Maximilien, W.M., Singh, M.P.: A framework and ontology for dynamic web services selection. IEEE Internet Computing 8(5), 84–93 (2004)
3. Amigo Project homepage: http://www.amigoproject.org 4. Amigo Consortium, D3.2: Amigo middleware core, Prototype Implementation (2006) 5. OWL-S 1.1 Release (2004), http://www.daml.org/services/owl-s/1.1/ 6. Kalaoja, J., Kantorovitch, J., Carro, S., Miranda, J.M., Ramos, A., Parra, J.: The vocabulary
ontology engineering for the semantic modelling of home services. In: ICEIS, Funchal, Madeira - Portugal, pp. 461–466 (2006)
7. Tsesmetzis, D.T., Roussaki, I.G., Papaioannou, I.V., Anagnostou, M.E.: QoS awareness support in Web-Service semantics. In: ICIW, Guadeloupe, French Caribbean, pp. 128–134 (2006)
R. Meersman, Z. Tari, P. Herrero et al. (Eds.): OTM 2007 Ws, Part I, LNCS 4805, pp. 17–18, 2007. © Springer-Verlag Berlin Heidelberg 2007
Implementing OCL as a Database Query Language*
Piotr Habela3, Krzysztof Kaczmarski3,4, Krzysztof Stencel2, and Kazimierz Subieta1,3
1 Institute of Computer Sciences of the Polish Academy of Sciences, Warsaw, Poland 2 Institute of Informatics, Warsaw University, Warsaw, Poland
3 Polish-Japanese Institute of Information Technology, Warsaw, Poland 4 Warsaw University of Technology, Warsaw, Poland
{habela,stencel,subieta}@pjwstk.edu.pl, [email protected]
1 Introduction
The approach of model-driven software development sketches the vision of the next big step in raising the level of abstraction and flexibility of programming tools. The key expectation behind MDA is achieving a productivity gain through the automating software construction based on models. In this paper we focus on one of

Documents

On the Move to Meaningful Internet Systems 2007.. OTM 2007