<?xml version="1.0"?>

<!DOCTYPE owl [
	<!ENTITY rdf "http://www.w3.org/1999/02/22-rdf-syntax-ns#">
	<!ENTITY rdfs "http://www.w3.org/2000/01/rdf-schema#">
	<!ENTITY xsd "http://www.w3.org/2001/XMLSchema#">
	<!ENTITY owl "http://www.w3.org/2002/07/owl#">
	<!ENTITY cc "http://web.resource.org/cc/#">
	<!ENTITY project "http://ebiquity.umbc.edu/ontology/project.owl#">
	<!ENTITY person "http://ebiquity.umbc.edu/ontology/person.owl#">
	<!ENTITY pub "http://ebiquity.umbc.edu/ontology/publication.owl#">
	<!ENTITY assert "http://ebiquity.umbc.edu/ontology/assertion.owl#">
]>

<!--

This ontology document is licensed under the Creative Commons
Attribution License. To view a copy of this license, visit
http://creativecommons.org/licenses/by/2.0/ or send a letter to
Creative Commons, 559 Nathan Abbott Way, Stanford, California
94305, USA.

-->

<rdf:RDF 
		xmlns:rdf = "&rdf;"
		xmlns:rdfs = "&rdfs;"
		xmlns:xsd = "&xsd;"
		xmlns:owl = "&owl;"
		xmlns:cc = "&cc;"
		xmlns:project = "&project;"
		xmlns:person = "&person;"
		xmlns:pub = "&pub;"
		xmlns:assert = "&assert;">
	<pub:InProceedings rdf:about="http://ebiquity.umbc.edu/paper/html/id/530/Semantic-based-Optimal-XML-Schema-Matching-A-Mathematical-Programming-Approach">
		<rdfs:label><![CDATA[Semantic-based Optimal XML Schema Matching: A Mathematical Programming Approach]]></rdfs:label>
		<pub:title><![CDATA[Semantic-based Optimal XML Schema Matching: A Mathematical Programming Approach]]></pub:title>
		<pub:publishedOn rdf:datatype="&xsd;dateTime">2010-12-28T00:00:00-05:00</pub:publishedOn>
		<pub:abstract><![CDATA[We propose a novel solution for semantic-based XML schema matching, taking a mathematical programming approach. This method identifies the globally optimal solution for the problem of matching two XML schemas by reducing the tree-to-tree matching problem to simpler problems of path-topath, node-to-node, and word-to-word matching. We formulate these matching problems as maximum weighted bipartite graph matching problems with different constraints, which are solved by different mathematical programming techniques, including integer programming and dynamic programming. Solutions to simpler problems provide weights for the next stage until the optimal tree-to-tree matching solution is obtained. The effectiveness of this approach has been verified and demonstrated by computer experiments.]]></pub:abstract>
		<pub:counter>1613</pub:counter>
		<pub:booktitle><![CDATA[The Proceedings of International Conference on E-business, Management and Economics]]></pub:booktitle>
		<pub:author>
			<rdf:List>
				<rdf:first>
					<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Yun/Peng"><person:name><![CDATA[Yun Peng]]></person:name><rdfs:label><![CDATA[Yun Peng]]></rdfs:label></person:Person>
				</rdf:first>
				<rdf:rest>					<rdf:List>
						<rdf:first>
							<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Nenad/Ivezik"><person:name><![CDATA[Nenad Ivezik]]></person:name><rdfs:label><![CDATA[Nenad Ivezik]]></rdfs:label></person:Person>
						</rdf:first>
						<rdf:rest>							<rdf:List>
								<rdf:first>
									<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Jaewook/Kim"><person:name><![CDATA[Jaewook Kim]]></person:name><rdfs:label><![CDATA[Jaewook Kim]]></rdfs:label></person:Person>
								</rdf:first>
								<rdf:rest>									<rdf:List>
										<rdf:first>
											<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Junho/Shin"><person:name><![CDATA[Junho Shin]]></person:name><rdfs:label><![CDATA[Junho Shin]]></rdfs:label></person:Person>
										</rdf:first>
										<rdf:rest rdf:resource="&rdf;nil" />
									</rdf:List>
								</rdf:rest>
							</rdf:List>
						</rdf:rest>
					</rdf:List>
				</rdf:rest>
			</rdf:List>
		</pub:author>
		<pub:firstAuthor>
<person:Person rdf:about="http://ebiquity.umbc.edu/person/html/Yun/Peng"><person:name><![CDATA[Yun Peng]]></person:name><rdfs:label><![CDATA[Yun Peng]]></rdfs:label></person:Person>
		</pub:firstAuthor>
		<pub:softCopy><pub:SoftCopy>
			<pub:softCopyFormat><![CDATA[PDF Document]]></pub:softCopyFormat>
			<pub:softCopyURI><![CDATA[http://ebiquity.umbc.edu/get/a/publication/556.pdf]]></pub:softCopyURI>
			<pub:softCopySize>430157</pub:softCopySize>
			</pub:SoftCopy>
			</pub:softCopy>
	</pub:InProceedings>

<rdf:Description rdf:about="">
	<cc:License rdf:resource="http://creativecommons.org/licenses/by/2.0/" />
</rdf:Description>

</rdf:RDF>
