<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content=text/html;charset=iso-8859-1>
<META content="MSHTML 6.00.6000.17063" name=GENERATOR></HEAD>
<BODY id=MailContainerBody
style="PADDING-RIGHT: 10px; PADDING-LEFT: 10px; PADDING-TOP: 15px"
bgColor=#ffffff leftMargin=0 topMargin=0 CanvasTabStop="true"
name="Compose message area">
<DIV><FONT face=Arial size=2>
<DIV><FONT face=Verdana>Apologies for cross-postings</FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><FONT
face=Verdana>--------------------------------------------------------------------------<BR>
CALL FOR
PAPERS<BR>--------------------------------------------------------------------------</FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><BR><FONT
face=Verdana>
The Fifth International Workshop on
<BR>
ONTOLOGY
MATCHING<BR>
(OM-2010)<BR>
</FONT><A href="http://om2010.ontologymatching.org/"><FONT
title="http://om2010.ontologymatching.org/
Ctrl + clic per seguire il collegamento"
face=Verdana>http://om2010.ontologymatching.org/</FONT></A><BR><FONT
face=Verdana> November 7, 2010, ISWC'10 Workshop Program,
Shanghai, China </FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><BR><FONT face=Verdana>BRIEF DESCRIPTION AND OBJECTIVES<BR>Ontology
matching is a key interoperability enabler for the Semantic Web, <BR>as well as
a useful tactic in some classical data integration tasks. <BR>It takes the
ontologies as input and determines as output an alignment, <BR>that is, a set of
correspondences between the semantically <BR>related entities of those
ontologies. These correspondences can be used <BR>for various tasks, such as
ontology merging and data translation. <BR>Thus, matching ontologies enables the
knowledge and data expressed <BR>in the matched ontologies to
interoperate.</FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><FONT face=Verdana>The workshop has two goals: <BR>1. To bring together
leaders from academia, industry and user institutions <BR>to assess how academic
advances are addressing real-world requirements. <BR>The workshop will strive to
improve academic awareness of industrial <BR>and final user needs, and therefore
direct research towards those needs. <BR>Simultaneously, the workshop will serve
to inform industry and user <BR>representatives about existing research efforts
that may meet their <BR>requirements. The workshop will also investigate how the
ontology <BR>matching technology is going to evolve. </FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><FONT face=Verdana>2. To conduct an extensive and rigorous evaluation of
ontology matching <BR>approaches through the OAEI (Ontology Alignment Evaluation
Initiative) <BR>2010 campaign: </FONT><A
href="http://oaei.ontologymatching.org/2010/"><FONT
face=Verdana>http://oaei.ontologymatching.org/2010/</FONT></A><FONT
face=Verdana>. <BR>The particular focus of this year's OAEI campaign is on
real-world <BR>specific matching tasks involving, e.g., biomedical ontologies
and <BR>linked data. Therefore, the ontology matching evaluation initiative
<BR>itself will provide a solid ground for discussion of how well <BR>the
current approaches are meeting business needs. </FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><BR><FONT face=Verdana>TOPICS of interest include but are not limited to:
<BR> Business and use cases for matching (e.g., open linked
data); <BR> Requirements to matching from specific domains;
<BR> Application of matching techniques in real-world
scenarios; <BR> Formal foundations and frameworks for ontology
matching; <BR> Ontology matching patterns;
<BR> Instance matching; <BR> Large-scale
ontology matching evaluation; <BR> Performance of matching
techniques; <BR> Matcher selection and self-configuration;
<BR> Uncertainty in ontology matching; <BR>
User involvement (including both technical and organizational aspects);
<BR> Explanations in matching; <BR> Social
and collaborative matching; <BR> Alignment management;
<BR> Reasoning with alignments; <BR>
Matching for traditional applications (e.g., information integration);
<BR> Matching for dynamic applications (e.g., search,
web-services). </FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><BR><FONT face=Verdana>SUBMISSIONS<BR>Contributions to the workshop can be
made in terms of technical papers and <BR>posters/statements of interest
addressing different issues of ontology matching <BR>as well as participating in
the OAEI 2010 campaign. Technical papers should <BR>be not longer than 12 pages
using the LNCS Style:</FONT></DIV>
<DIV><FONT face=Verdana><A
href="http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0">http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0</A></FONT></DIV>
<DIV><FONT face=Verdana>Posters/statements of interest should not exceed 2 pages
and <BR>should be handled according to the guidelines for technical papers.
<BR>All contributions should be prepared in PDF format and should be submitted
<BR>through the workshop submission site at: </FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><A href="http://www.easychair.org/conferences/?conf=om20100"><FONT
face=Verdana>http://www.easychair.org/conferences/?conf=om20100</FONT></A><FONT
face=Verdana> </FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><FONT face=Verdana>Contributors to the OAEI 2010 campaign have to follow
the campaign conditions <BR>and schedule at </FONT><A
href="http://oaei.ontologymatching.org/2010/"><FONT
face=Verdana>http://oaei.ontologymatching.org/2010/</FONT></A><FONT
face=Verdana>. </FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><BR><FONT face=Verdana>*TENTATIVE* IMPORTANT DATES FOR TECHNICAL PAPERS AND
POSTERS: <BR>September 1, 2010: Deadline for the submission of papers.
<BR>September 27, 2010: Deadline for the notification of acceptance/rejection.
<BR>October 12, 2010: Workshop camera ready copy submission. <BR>November 7,
2010: OM-2010, Shanghai International Convention Center, Shanghai,
China</FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><BR><FONT face=Verdana>ORGANIZING COMMITTEE<BR>1. Pavel Shvaiko (Main
contact)<BR>TasLab, Informatica Trentina SpA, Italy</FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><FONT face=Verdana>2. Jérôme Euzenat <BR>INRIA & LIG,
France</FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><FONT face=Verdana>3. Fausto Giunchiglia <BR>University of Trento,
Italy</FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><FONT face=Verdana>4. Heiner Stuckenschmidt <BR>University of Mannheim,
Germany </FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><FONT face=Verdana>5. Ming Mao <BR>SAP Labs, USA </FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><FONT face=Verdana>6. Isabel Cruz <BR>The University of Illinois at
Chicago, USA </FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><BR><FONT face=Verdana>PROGRAM COMMITTEE<BR>Paolo Besana, Universite de
Rennes 1, France <BR>Olivier Bodenreider, National Library of Medicine, USA
<BR>Marco Combetto, Informatica Trentina, Italy <BR>Jérôme David, INRIA &
LIG, France <BR>AnHai Doan, Kosmix, USA <BR>Alfio Ferrara, Universita degli
Studi di Milano, Italy <BR>Tom Heath, Talis, UK <BR>Wei Hu, Nanjing University,
China <BR>Ryutaro Ichise, National Institute of Informatics, Japan <BR>Antoine
Isaac, Vrije Universiteit Amsterdam, Netherlands <BR>Krzysztof Janowicz,
Pennsylvania State University, USA <BR>Bin He, IBM, USA <BR>Yannis Kalfoglou,
Ricoh Europe plc, UK <BR>Monika Lanzenberger, Vienna University of Technology,
Austria <BR>Patrick Lambrix, Linköpings Universitet, Sweden <BR>Maurizio
Lenzerini, University of Rome - Sapienza, Italy <BR>Juanzi Li, Tsinghua
University, China <BR>Vincenzo Maltese, University of Trento, Italy <BR>Fiona
McNeill, University of Edinburgh, UK <BR>Christian Meilicke, University of
Mannheim, Germany <BR>Luca Mion, Informatica Trentina, Italy <BR>Peter Mork, The
MITRE Corporation, USA <BR>Filippo Nardelli, Cogito, Italy <BR>Natasha Noy,
Stanford University, USA <BR></FONT><FONT face=Verdana>Leo Obrst, The MITRE
Corporation, USA <BR>Yefei Peng, Yahoo Labs, USA </FONT></DIV>
<DIV><FONT face=Verdana>Erhard Rahm, University of Leipzig, Germany <BR>François
Scharffe, INRIA, France <BR>Luciano Serafini, Fondazione Bruno Kessler (IRST),
Italy <BR>Kavitha Srinivas, IBM, USA <BR>Umberto Straccia, ISTI-C.N.R., Italy
<BR>Andrei Tamilin, Fondazione Bruno Kessler (IRST), Italy <BR>Lorenzino
Vaccari, EC DG Environment, Italy <BR>Ludger van Elst, DFKI, Germany <BR>Yannis
Velegrakis, University of Trento, Italy <BR>Shenghui Wang, Vrije Universiteit
Amsterdam, Italy <BR>Baoshi Yan, Bosch Research, USA <BR>Rui Zhang, Jilin
University, China <BR>Songmao Zhang, Chinese Academy of Sciences, China
</FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><FONT
face=Verdana>-------------------------------------------------------<BR>More
about ontology matching: <BR></FONT><A
href="http://www.ontologymatching.org/"><FONT
face=Verdana>http://www.ontologymatching.org/</FONT></A><BR><A
href="http://book.ontologymatching.org/"><FONT
face=Verdana>http://book.ontologymatching.org/</FONT></A><BR><FONT
face=Verdana>-------------------------------------------------------</FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><BR><FONT face=Verdana>Best Regards,<BR>Pavel</FONT></DIV>
<DIV><FONT face=Verdana></FONT> </DIV>
<DIV><FONT
face=Verdana>-------------------------------------------------------<BR>Pavel
Shvaiko, PhD<BR>Innovation and Research Project Manager<BR>TasLab, Informatica
Trentina SpA, Italy<BR></FONT><A href="http://www.ontologymatching.org/"><FONT
face=Verdana>http://www.ontologymatching.org/</FONT></A><BR><A
href="http://www.infotn.it/"><FONT
face=Verdana>http://www.infotn.it/</FONT></A><FONT face=Verdana> <BR></FONT><A
href="http://www.dit.unitn.it/~pavel/"><FONT
face=Verdana>http://www.dit.unitn.it/~pavel/</FONT></A><BR></DIV></FONT></DIV></BODY></HTML>