<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content=text/html;charset=iso-8859-1 http-equiv=Content-Type>
<META name=GENERATOR content="MSHTML 10.00.9200.16618"></HEAD>
<BODY id=MailContainerBody
style="PADDING-TOP: 15px; PADDING-LEFT: 10px; PADDING-RIGHT: 10px" leftMargin=0
topMargin=0 bgColor=#ffffff CanvasTabStop="true" name="Compose message area">
<DIV><FONT size=2 face=Arial>
<DIV><FONT size=2 face=Arial>Apologies for
cross-postings<BR> <BR>--------------------------------------------------------------------------<BR> Final
CALL FOR
CONTRIBUTIONS<BR>--------------------------------------------------------------------------<BR> <BR> <BR>
The Eighth International Workshop on
<BR>
ONTOLOGY
MATCHING<BR>
(OM-2013)<BR>
<A
title="http://om2013.ontologymatching.org/ Ctrl + clic per seguire il collegamento"
href="">http://om2013.ontologymatching.org/</A><BR>
October 21st or 22nd, 2013, ISWC Workshop Program, Sydney,
Australia <BR> </FONT></DIV>
<DIV><FONT size=2 face=Arial></FONT> </DIV>
<DIV><FONT size=2 face=Arial>******Submission deadline is on July 12th, 2013 (10
days left)******</FONT></DIV>
<DIV><FONT size=2 face=Arial></FONT> </DIV>
<DIV><FONT size=2 face=Arial></FONT> </DIV>
<DIV><FONT size=2 face=Arial>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>dealing with the
semantic heterogeneity problem. It takes the ontologies <BR>as input and
determines as output an alignment, that is, a set of <BR>correspondences between
the semantically related entities of those ontologies. <BR>These correspondences
can be used for various tasks, such as ontology<BR>merging, data translation,
query answering or navigation on the web of data. <BR>Thus, matching ontologies
enables the knowledge and data expressed <BR>in the matched ontologies to
interoperate.<BR> <BR>The workshop has three 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.<BR> <BR>2. To conduct an extensive and rigorous evaluation of
ontology matching <BR>approaches through the OAEI (Ontology Alignment Evaluation
Initiative) <BR>2013 campaign: <A
href="">http://oaei.ontologymatching.org/2013/</A>. <BR>The particular focus of
this year's OAEI campaign is on real-world <BR>specific matching tasks as well
as on evaluation of interactive matchers.<BR>Therefore, the ontology matching
evaluation <BR>initiative itself will provide a solid ground for discussion
<BR>of how well the current approaches are meeting business
needs.<BR> <BR>3. To examine similarities and differences from database
schema matching, <BR>which has received decades of attention but is just
beginning <BR>to transition to mainstream tools.<BR> <BR>This year, in sync
with the main conference, we encourage submissions <BR>specifically devoted to:
(i) repeatable evaluations of the approaches proposed <BR>(not necessarily
within OAEI) and (ii) application of the matching technology <BR>in real-life
scenarios and assessment of its usefulness to the final users.
<BR> <BR> <BR>TOPICS of interest include but are not limited to:
<BR> Business and use cases for matching (e.g., open
government data); <BR> Requirements to matching from specific
domains (e.g., energy); <BR> Application of matching
techniques in real-world scenarios (e.g., with mobile apps);
<BR> Formal foundations and frameworks for matching;
<BR> Matching patterns; <BR> Matching and
big data; <BR> Entity matching;<BR> Instance
matching and data interlinking; <BR> Large-scale matching
evaluation; <BR> Performance of matching techniques;
<BR> Matcher selection and self-configuration;
<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 emerging applications (e.g.,
linked data, search). <BR> <BR> <BR>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 2013 campaign. Technical papers should <BR>be not
longer than 12 pages using the LNCS Style:<BR><A
href="">http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0</A><BR>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:
<BR> <BR><A
href="">https://www.easychair.org/conferences/?conf=om20130</A>
<BR> <BR>Contributors to the OAEI 2013 campaign have to follow the campaign
conditions <BR>and schedule at <A
href="">http://oaei.ontologymatching.org/2013/</A>.
<BR> <BR> <BR>TENTATIVE DATES FOR TECHNICAL PAPERS AND POSTERS:
<BR>July 12, 2013: Deadline for the submission of papers. <BR>August 9,
2013:Deadline for the notification of acceptance/rejection. <BR>October 21th or
22nd, 2013: OM-2013, Sydney Masonic Conference & Function Centre, Sydney,
Australia. <BR> <BR> <BR>ORGANIZING COMMITTEE<BR>1. Pavel Shvaiko
(Main contact)<BR>TasLab, Informatica Trentina SpA, Italy<BR> <BR>2. Jérôme
Euzenat <BR>INRIA & LIG, France<BR> <BR>3. Kavitha Srinivas<BR>IBM, USA
<BR> <BR>4. Ming Mao <BR>eBay, USA <BR> <BR>5. Ernesto
Jiménez-Ruiz<BR>University of Oxford, UK
<BR> <BR> <BR> <BR>PROGRAM COMMITTEE<BR>Manuel Atencia, INRIA
&LIG, France<BR>Michele Barbera, SpazioDati, Italy<BR>Zohra Bellahsene,
LRIMM, France<BR>Chris Bizer, University of Mannheim, Germany<BR>Olivier
Bodenreider, National Library of Medicine, USA<BR>Marco Combetto, Informatica
Trentina, Italy<BR>Gianluca Correndo, University of Southampton, UK<BR>Isabel
Cruz, The University of Illinois at Chicago, USA<BR>Jérôme David, INRIA &
LIG, France<BR>AnHai Doan, University of Wisconsin, USA<BR>Alfio Ferrara,
University of Milan, Italy<BR>Bin He, IBM, USA<BR>Wei Hu, Nanjing University,
China<BR>Ryutaro Ichise, National Institute of Informatics, Japan<BR>Antoine
Isaac, Vrije Universiteit Amsterdam & Europeana, Netherlands<BR>Krzysztof
Janowicz, University of California, USA<BR>Anja Jentzsch, Wikimedia Deutschland,
Germany<BR>Yannis Kalfoglou, Ricoh Europe plc, UK<BR>Anastasios Kementsietsidis,
IBM, USA<BR>Patrick Lambrix, Linköpings Universitet, Sweden<BR>Monika
Lanzenberger, Vienna University of Technology, Austria<BR>Vincenzo Maltese,
University of Trento, Italy<BR>Fiona McNeill, University of Edinburgh,
UK<BR>Christian Meilicke, University of Mannheim, Germany<BR>Peter Mork, Noblis,
USA<BR>Axel-Cyrille Ngonga Ngomo, University of Leipzig, Germany<BR>Andriy
Nikolov, Open University, UK<BR>Leo Obrst, The MITRE Corporation, USA<BR>Heiko
Paulheim, University of Mannheim, Germany<BR>Yefei Peng, Google, USA<BR>Andrea
Perego, European Commission - Joint Research Centre, Italy<BR>François Scharffe,
LIRMM & University of Montpellier, France</FONT></DIV>
<DIV><FONT size=2 face=Arial>Juan Sequeda, University of Texas at Austin, USA
<BR>Luciano Serafini, Fondazione Bruno Kessler - IRST, Italy<BR>Umberto
Straccia, ISTI-C.N.R., Italy<BR>Ondrej Svab-Zamazal, Prague University of
Economics, Czech Republic<BR>Cássia Trojahn, IRIT, France<BR>Raphaël Troncy,
EURECOM, France<BR>Giovanni Tummarello, Fondazione Bruno Kessler - IRST,
Italy<BR>Lorenzino Vaccari, Autonomous Province of Trento, Italy<BR>Ludger van
Elst, DFKI, Germany<BR>Shenghui Wang, Vrije Universiteit Amsterdam,
Netherlands<BR>Baoshi Yan, LinkedIn, USA<BR>Songmao Zhang, Chinese Academy of
Sciences, China<BR> <BR> <BR></DIV>
<DIV></DIV>
<DIV><FONT size=2
face=Arial>-------------------------------------------------------<BR></FONT></DIV>
<DIV><FONT size=2 face=Arial>Download OM-2013 flyer: <BR><A
title="http://om2013.ontologymatching.org/Pictures/CfP_OM2013_flyer.pdf Ctrl + clic per seguire il collegamento"
href="">http://om2013.ontologymatching.org/Pictures/CfP_OM2013_flyer.pdf</A></FONT></DIV>
<DIV></DIV></FONT>
<DIV><FONT size=2
face=Arial>-------------------------------------------------------<BR>More about
ontology matching: <BR><A href="">http://www.ontologymatching.org/</A><BR><A
title="http://book.ontologymatching.org/ Ctrl + clic per seguire il collegamento"
href="">http://book.ontologymatching.org/</A><BR>-------------------------------------------------------<BR> <BR> <BR>Best
Regards,<BR>Pavel<BR> <BR> <BR> <BR>-------------------------------------------------------<BR>Pavel
Shvaiko, PhD<BR>Innovation Program Manager<BR>TasLab, Informatica Trentina SpA,
Italy<BR><A href="">http://www.ontologymatching.org/</A><BR><A
href="">http://www.taslab.eu/</A><BR><A href="">http://www.infotn.it/</A> <BR><A
href="">http://www.dit.unitn.it/~pavel</A></FONT></DIV></FONT></DIV></BODY></HTML>