W3C home > Mailing lists > Public > www-ws@w3.org > June 2006

Semantic Matchmaking and Resource Retrieval - CFP + SPECIAL ISSUE

From: Tommaso Di Noia <t.dinoia@poliba.it>
Date: Wed, 7 Jun 2006 17:03:31 +0200
Message-Id: <200606071450.k57Eo2kW013205@mail.poliba.it>
To: <www-ws@w3.org>

[Please Distribute - Apologies for Multiple Postings]

======================= CALL FOR PAPERS ===================================

			SMR 2006
		1st International Workshop on
	Semantic Matchmaking and Resource Retrieval:
		Issues and Perspectives

		Co-located with VLDB 2006
	The Convention and Exhibition Center (COEX)
		Seoul, Korea - September 11, 2006 

Matchmaking is basically the process of discovering, based on a given
request, promising partners for some kind of purpose. It is a process common
to several scenarios in the Internet era, spanning from e-commerce to
web-services, to grid computing, to human resource management, to actual
dating services, to Peer-to-Peer computing. Both requests and partner
descriptions are usually, but not always, given some kind of structure.

Obviously, main issues emerge when the search is not limited to identity
matches but, as in real life, when the objective is finding partners
suitable at least to some extent, or -- when a single partner cannot fulfill
the request
-- find a pool of cooperating partners able to accomplish it.
As this process may lead to various possible matches, the notion of ranking
becomes central, to provide a list of potential partners ordered according
to some criteria.

--- TOPICS ---

Aims of the workshop are:
- Gather researchers from different communities and from both academia and
industry to debate and find common ground on matchmaking issues.
- Present open and emerging issues, and possible solutions to matchmaking
problems, which we summarize in the next section.
- Propose shared and acceptable methods to evaluate effectiveness of
approaches to matchmaking.

Topics of interest include but are not limited to:

	- approximate matchmaking
	- hybrid resource retrieval
	- web services discovery and composition
	- approximate reasoning for resource retrieval
	- non-monotonic reasoning for resource retrieval
	- resource annotation for matchmaking
	- Efficient storage of semantic-based annotations for matchmaking
and retrieval
	- Semantic matchmaking and retrieval applications for:
		* P2P and B2C E-marketplaces
		* Semantic Grid
		* Mobile commerce
		* Workflow composition
		* Business processes
		* Dating systems
		* Competencies management
		* Multimedia


Authors are invited to submit original research contributions (not published
or under consideration in other journals or conferences) on the topics of
the workshop. All submissions must be in English. Submissions must clearly
identify the nature of the paper as research, experience, or position. All
submitted papers will be carefully evaluated based on originality,
significance, technical soundness, and clarity of expression by three
members of the Program Committee.

Authors should submit their papers in PDF format through the conference
management system that can be accessed at http://www.easychair.org/SMR06/.

Submissions must not exceed 15 pages for full length papers and 6 pages for
research-in-progress proposals and must be formatted using templates
available at http://www.springer.de/comp/lncs/authors.html

All accepted papers will be published as on-line proceedings of CEUR-WS vol.
At the workshop, a hard copy of the proceedings will be handed out to the


Authors of selected papers will be invited to submit an extended version of
their papers for inclusion in an upcoming Special Issue on Semantic
Matchmaking and Retrieval of IJEC - International Journal of Electronic
Commerce - http://sisinflab.poliba.it/ijec-si-smr/


The proposed schedule of important dates for the workshop is as follows:
	* Submission Deadline  : June 12, 2006 
	* Notification of Acceptance : July 12, 2006
	* Camera-ready Due : July 24, 2006
	* Early registration deadline : July 31, 2006


    * Boualem Benatallah - The University of New South Wales - Australia
    * Fabio Casati - HP Labs - USA
    * Tommaso Di Noia - Technical University of Bari - Italy
    * Eugenio Di Sciascio - Technical University of Bari - Italy
    * Francesco Donini - University of Tuscia - Italy
    * Lalana Kagal - MIT - USA
    * Mick Kerrigan - DERI - Austria
    * Werner Kießling - Lehrstuhl für Informatik II, Universität Augsburg -
    * Matthias Klusch - DFKI - Germany
    * Ruben Lara - Tecnologìa, Informaciòn y Finanzas - Spain
    * Alain Leger - France Telecom - France
    * Massimo Mecella - University of Rome "La Sapienza" - Italy
    * Massimo Paolucci - DoCoMo Laboratories - Germany
    * Yun Peng - UMBC - USA
    * Euripides Petrakis - Technical University of Crete - Greece
    * Axel Polleres - Universidad Rey Juan Carlos - Spain
    * Marta Sabou - The Open University - UK
    * Ulrike Sattler - University of Manchester - UK
    * Pavel Shvaiko - University of Trento - Italy
    * Robert Stevens - University of Manchester - UK


Tommaso DI NOIA
Politecnico di Bari
Bari, Italy
tel : +39 080 5963903
fax : +39 080 5963410
mail: t.dinoia@poliba.it

Politecnico di Bari
Bari, Italy
tel : +39 080 5963903
fax : +39 080 5963410
mail: disciascio@poliba.it

Francesco M. DONINI
Università della Tuscia
Viterbo, Italy
tel : +39 0761 357 861
fax : +39 0761 357 887
mail: donini@unitus.it
Received on Wednesday, 7 June 2006 15:03:47 UTC

This archive was generated by hypermail 2.4.0 : Friday, 17 January 2020 23:05:18 UTC