Schema and ontology matching play an important part in the field of data integration and semantic web. Given two heterogeneous data sources, meta data matching usually constitutes the first step in the data integration workflow, which refers to the analysis and comparison of two input resources like schemas or ontologies. The result is a list of correspondences between the two schemas or ontologies, which is often called mapping or alignment. Many tools and research approaches have been proposed to automatically determine those correspondences. However, most match tools do not provide any information about the relation type that holds between matching concepts, for the simple but important reason that most common match strategies are too simple and heuristic to allow any sophisticated relation type determination. Knowing the specific type holding between two concepts, e.g., whether they are in an equality, subsumption (is-a) or part-of relation, is very important for advanced data integration tasks, such as ontology merging or ontology evolution. It is also very important for mappings in the biological or biomedical domain, where is-a and part-of relations may exceed the number of equality correspondences by far. Such more expressive mappings allow much better integration results and have scarcely been in the focus of research so far. In this doctoral thesis, the determination of the correspondence types in a given mapping is the focus of interest, which is referred to as semantic mapping enrichment. We introduce and present the mapping enrichment tool STROMA, which obtains a pre-calculated schema or ontology mapping and for each correspondence determines a semantic relation type. In contrast to previous approaches, we will strongly focus on linguistic laws and linguistic insights. By and large, linguistics is the key for precise matching and for the determination of relation types. We will introduce various strategies that make use of these linguistic laws and are able to calculate the semantic type between two matching concepts. The observations and insights gained from this research go far beyond the field of mapping enrichment and can be also applied to schema and ontology matching in general. Since generic strategies have certain limits and may not be able to determine the relation type between more complex concepts, like a laptop and a personal computer, background knowledge plays an important role in this research as well. For example, a thesaurus can help to recognize that these two concepts are in an is-a relation. We will show how background knowledge can be effectively used in this instance, how it is possible to draw conclusions even if a concept is not contained in it, how the relation types in complex paths can be resolved and how time complexity can be reduced by a so-called bidirectional search. The developed techniques go far beyond the background knowledge exploitation of previous approaches, and are now part of the semantic repository SemRep, a flexible and extendable system that combines different lexicographic resources. Further on, we will show how additional lexicographic resources can be developed automatically by parsing Wikipedia articles. The proposed Wikipedia relation extraction approach yields some millions of additional relations, which constitute significant additional knowledge for mapping enrichment. The extracted relations were also added to SemRep, which thus became a comprehensive background knowledge resource. To augment the quality of the repository, different techniques were used to discover and delete irrelevant semantic relations. We could show in several experiments that STROMA obtains very good results w.r.t. relation type detection. In a comparative evaluation, it was able to achieve considerably better results than related applications. This corroborates the overall usefulness and strengths of the implemented strategies, which were developed with particular emphasis on the principles and laws of linguistics.

4 mal im Jahr erscheinende Zeitschrift über aktuelle Themen der TU Chemnitz

Es werden die Homotopiekategorie einer schwachen Thomason-Modellkategorie sowie schwache Thomason-Modellstrukturen auf Diagrammkategorien konstruiert und Kan-Erweiterungen beliebiger Funktoren zwischen Lokalisatoren untersucht.

Recent applications of description logics (DLs) strongly suggest the integration of non-monotonic features into DLs, with particular attention to defeasible inheritance. However, the existing non-monotonic extensions of DLs are usually based on default logic or autoepistemic logic, and have to be seriously restricted in expressive power to preserve the decidability of reasoning. In particular, such DLs allow the modelling of defeasible inheritance only in a very restricted form, where non-monotonic reasoning is limited to individuals that are explicitly identified by constants in the knowledge base. In this paper, we consider non-monotonic extensions of expressive DLs based on circumscription. We prove that reasoning in such DLs is decidable even without the usual, strong restrictions in expressive power. We pinpoint the exact computational complexity of reasoning as complete for NPNEXP and NEXPNP, depending on whether or not the number of minimized and fixed predicates is assumed to be bounded by a constant. These results assume that only concept names (and no role names) can be minimized and fixed during minimization. On the other hand, we show that fixing role names during minimization makes reasoning undecidable.

Diese Arbeit behandelt die Frage, welche Auswirkungen eine EU-Mitgliedschaft der Türkei auf die europäischen Sicherheitsbeziehungen haben würde. Es wird die sicherheitspolitische Situation in- und außerhalb der türkischen Staatsgrenzen analysiert. Auf Basis der Rational Choice Theorie vom Akteurzentrierten Institutionalismus wird gezeigt mit welchen Herausforderungen die Europäische Union konfrontiert wäre und die Frage behandelt, ob eine so genannte Privilegierte Partnerschaft eine mögliche Alternative zu einer Vollmitgliedschaft sein kann. / This work deals with the question which impact an EU-membership of Turkey would have on European security relations. It analyzes the security situation in- and outside Turkeys frontiers. Based on the rational choice theory of Akteurzentrierter Institutionalismus it tries to give a prospect of possible challenges for the European Union and brings up the question whether a so called privileged partnership is a possible altnernative to a full membership.

Ein Vorteil von Mathcad^® ist das übersichtliche Arbeitsblatt. Mathematische Gleichungen werden nicht als verwirrende Kette von Buchstaben und Zahlen dargestellt, sondern in eindeutiger mathematischer Notation. Die Gleichungen werden standardmäßig nach der Eingabe auf Plausibilität geprüft. Viele Funktionen - auch komplexe Lösungsalgorithmen - werden bereits mitgeliefert. Weiterhin können formatierte Textfelder für eine gute Dokumentation genutzt werden, z.B. für Berechnungsnachweise. Daher kann das Arbeitsblatt in sehr kurzer Zeit entwickelt werden und ist für neue Anwender leicht nachzuvollziehen. Jedoch wird jeder Vorteil durch einen Nachteil erkauft. So liegen eine geringere Rechengeschwindigkeit, eingeschränkter Codeschutz und nur wenige Möglichkeiten zur Kommunikation mit anderen Programmen vor. Diese Nachteile können durch dynamische Bibliotheken verringert werden. Dieser Artikel stellt die Vorteile der DLL-Programmierung für Mathcad^® dar und zeigt einige Beispiele zur Erhöhung der Rechengeschwindigkeit, zum Quellcodeschutz und zur Codeportierung. / One advantage of Mathcad^® is the well arranged worksheet. Mathematic equations are not displayed in confusing chains of characters but in clear mathematical notation. The equations normaly are checked of plausibility including units after writing. Many functions - even complex solving algorithms - are already defined. Furthermore formatted comments lead to a good documentation, e.g. for calculation reports. Hence the calculation sheets are developed in a very short time and they are easy to comprehend for new users. However every advantage is bought by a disadvantage. Therefore there is a less calculation speed, limited possibilities for code protection and only few possibilities of communication with other programs. These disadvantages can be removed by using dynamic link libraries (DLL's). This article gives an introduction of programming DLL's in Mathcad^® and shows some examples to increase calculation efficiency, code protection and code transfer.

Humboldt-University, Diss.--Berlin, 2005.

Wiss. Hochsch. für Unternehmensführung, Diss--Vallendar, 2006.

No description available.

No description available.