Open Access. Powered by Scholars. Published by Universities.®

Physical Sciences and Mathematics Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 9 of 9

Full-Text Articles in Physical Sciences and Mathematics

Three-Dimensional Stereoscopic Exploration System For The Heart, Thomas Wischgoll Oct 2010

Three-Dimensional Stereoscopic Exploration System For The Heart, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

No abstract provided.


10302 Summary - Learning Paradigms In Dynamic Environments, Barbara Hammer, Pascal Hitzler Jul 2010

10302 Summary - Learning Paradigms In Dynamic Environments, Barbara Hammer, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The seminar centered around problems which arise in the context of machine learning in dynamic environments. Particular emphasis was put on a couple of specific questions in this context: how to represent and abstract knowledge appropriately to shape the problem of learning in a partially unknown and complex environment and how to combine statistical inference and abstract symbolic representations; how to infer from few data and how to deal with non i.i.d. data, model revision and life-long learning; how to come up with efficient strategies to control realistic environments for which exploration is costly, the dimensionality is high and data …


Distance-Based Measures Of Inconsistency And Incoherency For Description Logics, Yue Ma, Pascal Hitzler May 2010

Distance-Based Measures Of Inconsistency And Incoherency For Description Logics, Yue Ma, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Inconsistency and incoherency are two sorts of erroneous information in a DL ontology which have been widely discussed in ontology-based applications. For example, they have been used to detect modeling errors during ontology construction. To provide more informative metrics which can tell the differences between inconsistent ontologies and between incoherent terminologies, there has been some work on measuring inconsistency of an ontology and on measuring incoherency of a terminology. However, most of them merely focus either on measuring inconsistency or on measuring incoherency and no clear ideas of how to extend them to allow for the other. In this paper, …


Modeling And Visualization Of Cardiovascular Systems, Thomas Wischgoll Feb 2010

Modeling And Visualization Of Cardiovascular Systems, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

Modeling complex organs, such as the human heart, requires a detailed understanding of the geometric and mechanical properties of that organ. Similarly, the model is only as accurate as the precision of the underlying properties allow. Hence, it is of great importance that accurate measurements of the geometric configuration are available. This paper describes the different steps that are necessary for creating and visualizing such a vascular model, ranging from determining a basic geometric model, gathering statistical data necessary to extend an existing model up to the visualization of the resulting large-scale vascular models.


A Reasonable Semantic Web, Pascal Hitzler, Frank Van Harmelen Jan 2010

A Reasonable Semantic Web, Pascal Hitzler, Frank Van Harmelen

Computer Science and Engineering Faculty Publications

The realization of Semantic Web reasoning is central to substantiating the Semantic Web vision. However, current mainstream research on this topic faces serious challenges, which forces us to question established lines of research and to rethink the underlying approaches. We argue that reasoning for the Semantic Web should be understood as "shared inference," which is not necessarily based on deductive methods. Model-theoretic semantics (and sound and complete reasoning based on it) functions as a gold standard, but applications dealing with large-scale and noisy data usually cannot afford the required runtimes. Approximate methods, including deductive ones, but also approaches based on …


Approximate Instance Retrieval On Ontologies, Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzler Jan 2010

Approximate Instance Retrieval On Ontologies, Tuvshintur Tserendorj, Stephan Grimm, Pascal Hitzler

Computer Science and Engineering Faculty Publications

With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexity for efficient reasoning. In application cases that require scalable reasoning with expressive ontologies, non-standard reasoning solutions such as approximate reasoning are necessary to tackle the intractability of reasoning in expressive DLs. In this paper, we are concerned with the approximation of the reasoning task of instance retrieval on DL knowledge bases, trading correctness of retrieval results for gain of speed. We introduce our notion of an approximate concept extension and we provide …


Nominal Schemas For Integrating Rules And Ontologies, Frederick Maier, Adila A. Krisnadhi, Pascal Hitzler Jan 2010

Nominal Schemas For Integrating Rules And Ontologies, Frederick Maier, Adila A. Krisnadhi, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We propose a description-logic style extension of OWL DL, which includes DL-safe variable SWRL and seamlessly integrates datalog rules. Our language also sports a tractable fragment, which we call ELP 2, covering OWL EL, OWL RL, most of OWL QL, and variable restricted datalog.


Semantic Web – Interoperability, Usability, Applicability, Pascal Hitzler, Krzysztof Janowicz Jan 2010

Semantic Web – Interoperability, Usability, Applicability, Pascal Hitzler, Krzysztof Janowicz

Computer Science and Engineering Faculty Publications

No abstract provided.


Distributed Reasoning With El++ Using Mapreduce, Frederick Maier, Raghava Mutharaju, Pascal Hitzler Jan 2010

Distributed Reasoning With El++ Using Mapreduce, Frederick Maier, Raghava Mutharaju, Pascal Hitzler

Computer Science and Engineering Faculty Publications

It has recently been shown that the MapReduce framework for distributed computation can be used effectively for large-scale RDF Schema reasoning, computing the deductive closure of over a billion RDF triples within a reasonable time. Later work has carried this approach over to OWL Horst. In this paper, we provide a MapReduce algorithm for classifying knowledge bases in the description logic EL++, which is essentially the OWL 2 profile OWL 2 EL. The traditional EL++ classification algorithm is recast into a form compatible with MapReduce, and it is shown how the revised algorithm can be realized within …