- From: Tommaso Di Noia <t.dinoia@poliba.it>
- Date: Mon, 11 Jul 2005 22:01:24 +0200
[We apologize for multiple copies] ======================= CALL FOR PAPERS =================================== Semantic-Based Resource Discovery, Retrieval and Composition RDRC http://sisinflab.poliba.it/sac2006/ Technical Track at the 21st ACM Symposium on Applied Computing SAC 2006 http://www.acm.org/conferences/sac/sac2006 The Semantic-Based Resource Discovery, Retrieval and Composition -- RDRC track aims at gathering researchers from various fields, spanning from matchmaking in electronic commerce, to intelligent multimedia retrieval, to planning in artificial intelligence, to web services discovery and composition. We envisage the following topics as central for the track: - matchmaking of resource request and resource providers - planning and scheduling - semantic-based resource negotiation - semantic-based resource negotiation - retrieval of resource descriptions - semantic annotation for multimedia - information integration - supply chain formation - knowledge management - web-service discovery and composition - semantic grid - combinatorial auctions All these topics share as central the notion of "Resource" in general searching problems with respect to a request. A resource is a broad term comprising goods in electronic commerce, information available in remote sites, services announced through Internet, learning objects, digital images, to mention a few. Whatever their nature, the term "resource" is used in a general sense for whatever might be identified atomically and univocally. Hence, the problem of resource matching and retrieval arises in several scenarios. The front-end of a resource is always a description of what the resource is, what it provides, who can access it, possibly with side economic constraints. All this information can be semantically annotated, either directly in XML, or using some upper strata for defining standard terms as in ebXML, or OWL-S. While semantic annotation rules out ambiguities of Natural Language, the problem raises about how well a single resource fits a particular request, or whether there is a pool of resources which - suitably composed - cover a request. Side economic conditions in resource descriptions, such as cost, method of payment, payments delay, can make compositions difficult to be properly formed, while economic constraints in resource request usually filter out some solutions. Authors are invited to submit original papers related, but not limited to, the proposed track topics. Submissions fall into the following categories: - Original and unpublished research work - Reports of innovative computing applications in the arts, sciences, engineering, and business areas - Reports of successful technology transfer to new problem domains - Reports of industrial experience and demos of new innovative systems Peer groups with expertise in the track focus area will blindly review submissions to that track. Accepted papers will be published in the annual conference proceedings. IMPORTANT DATES The proposed schedule of important dates for the track is as follows: - September 3, 2005 Paper Submission deadline - October 15, 2005 Notification of acceptance - November 5, 2005 Camera-ready version deadline - April 23-27, 2006 Track Date PROGRAM COMMITTEE (To be completed) Daniela Berardi - University of Rome "La Sapienza" - Italy Oscar Corcho - Univesity of Manchester - UK Martin Hepp - DERI, University of Innsbruck - Austria Enrico Motta - KMi, The Open University - UK Pavel Shvaiko - University of Trento - Italy .... ORGANIZATION Tommaso DI NOIA Politecnico di Bari Bari, Italy tel : +39 080 5963903 fax : +39 080 5963410 mail: t.dinoia@poliba.it Eugenio DI SCIASCIO 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 ---------------------------------------------------------------- This message was sent using IMP, the Internet Messaging Program.
Received on Tuesday, 12 July 2005 06:45:22 UTC