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

Physical Sciences and Mathematics Commons

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

PDF

Wright State University

2004

Discipline
Keyword
Publication
Publication Type

Articles 91 - 106 of 106

Full-Text Articles in Physical Sciences and Mathematics

Semantic Web Research Center Report: Lsdis Lab, Research In Semantic Bioinformatics, Semantic Analytics And Semantic Web Processes, Amit P. Sheth Jan 2004

Semantic Web Research Center Report: Lsdis Lab, Research In Semantic Bioinformatics, Semantic Analytics And Semantic Web Processes, Amit P. Sheth

Kno.e.sis Publications

The LSDIS Lab advances the field of distributed information systems by researching semantic techniques for exploiting heterogeneous multimedia information and improving processes, encompassing the central promise of the Semantic Web initiative. It is pursuing cutting edge research in ontology development for demanding scientific domains, semantic heterogeneity and integration, complex relationships discovery and semantic analytics, and Semantic Web services and processes. Past work of the LSDIS lab can be characterized by keywords: semantic interoperability, syntactic and semantic metadata for text and digital media, metadata based integration of Web content, ontology-driven information systems, multi-ontology query processing, transactional workflows and workflow management. Significant …


Uniqueness Theorems In Bioluminescence Tomography, Ge Wang, Yi Li, Ming Jiang Jan 2004

Uniqueness Theorems In Bioluminescence Tomography, Ge Wang, Yi Li, Ming Jiang

Yi Li

Motivated by bioluminescent imaging needs for studies on gene therapy and other applications in the mouse models, a bioluminescence tomography (BLT) system is being developed in the University of Iowa. While the forward imaging model is described by the well-known diffusion equation, the inverse problem is to recover an internal bioluminescent source distribution subject to Cauchy data. Our primary goal in this paper is to establish the solution uniqueness for BLT under practical constraints despite the ill-posedness of the inverse problem in the general case. After a review on the inverse source literature, we demonstrate that in the general case …


Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 3, January 2004, College Of Engineering And Computer Science, Wright State University Jan 2004

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 20, Number 3, January 2004, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.


The Integration Of Connectionism And First-Order Knowledge Representation And Reasoning As A Challenge For Artificial Intelligence, Sebastian Bader, Steffen Holldobler, Pascal Hitzler Jan 2004

The Integration Of Connectionism And First-Order Knowledge Representation And Reasoning As A Challenge For Artificial Intelligence, Sebastian Bader, Steffen Holldobler, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Intelligent systems based on first-order logic on the one hand, and on artificial neural networks (also called connectionist systems) on the other, differ substantially. It would be very desirable to combine the robust neural networking machinery with symbolic knowledge representation and reasoning paradigms like logic programming in such a way that the strengths of either paradigm will be retained. Current state-of-the-art research, however, fails by far to achieve this ultimate goal. As one of the main obstacles to be overcome we perceive the question how symbolic knowledge can be encoded by means of connectionist systems: Satisfactory answers to this will …


Virtual Exploration Of A Cardiovascular System, Elke Moritz, Thomas Wischgoll, Joerg Meyer Jan 2004

Virtual Exploration Of A Cardiovascular System, Elke Moritz, Thomas Wischgoll, Joerg Meyer

Computer Science and Engineering Faculty Publications

No abstract provided.


Cs 302-01: Client Server Databases, Karen Meyer Jan 2004

Cs 302-01: Client Server Databases, Karen Meyer

Computer Science & Engineering Syllabi

No abstract provided.


Cs/Mth 317/517: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor Jan 2004

Cs/Mth 317/517: Numerical Methods For Digital Computers - Ii, Ronald F. Taylor

Computer Science & Engineering Syllabi

Continuation of CS/MTH/316/516. Introduction to numerical methods used in the sciences. Methods for solving matrix eigenvalue problems, initial value and boundary value problem for ordinary differential equations (ODEs). Study of standard types of partial differential equations (PDEs) with applications. Solution techniques for systems of nonlinear equations. Discussion of sources of errors in numerical methods. Special topics and applications presented as schedule permits. 4 credit hours. Prerequisites: CS 316, MTH 233, 253, or 355. Programming course prerequisites: EGR 153 or CEG 220 or CS 241.


Uniqueness Theorems In Bioluminescence Tomography, Ge Wang, Yi Li, Ming Jiang Jan 2004

Uniqueness Theorems In Bioluminescence Tomography, Ge Wang, Yi Li, Ming Jiang

Mathematics and Statistics Faculty Publications

Motivated by bioluminescent imaging needs for studies on gene therapy and other applications in the mouse models, a bioluminescence tomography (BLT) system is being developed in the University of Iowa. While the forward imaging model is described by the well-known diffusion equation, the inverse problem is to recover an internal bioluminescent source distribution subject to Cauchy data. Our primary goal in this paper is to establish the solution uniqueness for BLT under practical constraints despite the ill-posedness of the inverse problem in the general case. After a review on the inverse source literature, we demonstrate that in the general case …


The Dual Spectral Set Conjecture, Steen Pedersen Jan 2004

The Dual Spectral Set Conjecture, Steen Pedersen

Mathematics and Statistics Faculty Publications

Suppose that Λ = (aZ + b) ∪ (cZ + d) where a, b, c, d are real numbers such that a ≠ 0 and c ≠ 0. The union is not assumed to be disjoint. It is shown that the translates Ω + λ, λ is an element of Λ, tile the real line for some bounded measurable set Ω if and only if the exponentials eλ(x) = ei2πλx, λ is an element of Λ, form an orthogonal basis for some bounded measurable set Ω'.


On The Decidability Of The Termination Problem Of Active Database Systems, James Bailey, Guozhu Dong, K. Rammamohanarao Jan 2004

On The Decidability Of The Termination Problem Of Active Database Systems, James Bailey, Guozhu Dong, K. Rammamohanarao

Kno.e.sis Publications

Active database systems enhance the functionality of traditional databases through the use of active rules or ‘triggers’. One of the principal analysis questions for such systems is that of termination—is it possible for the rules to recursively activate one another indefinitely, given an initial triggering event. In this paper, we study the decidability of the termination problem, our aim being to delimit the boundary between the decidable and the undecidable. We present results for two broad types of variations, variations in rule syntax and variations in meta level features. Within each of these, we identify members close to the …


Semantic Integration Of Glycomics Data And Information, William S. York, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller, Christopher Thomas, Karthik Gomadam, X. Yi, Meenakshi Nagarajan Jan 2004

Semantic Integration Of Glycomics Data And Information, William S. York, Amit P. Sheth, Krzysztof J. Kochut, John A. Miller, Christopher Thomas, Karthik Gomadam, X. Yi, Meenakshi Nagarajan

Kno.e.sis Publications

No abstract provided.


Discovering And Ranking Semantic Associations Over A Large Rdf Metabase, Christian Halaschek-Wiener, Boanerges Aleman-Meza, I. Budak Arpinar, Amit P. Sheth Jan 2004

Discovering And Ranking Semantic Associations Over A Large Rdf Metabase, Christian Halaschek-Wiener, Boanerges Aleman-Meza, I. Budak Arpinar, Amit P. Sheth

Kno.e.sis Publications

Information retrieval over semantic metadata has recently received a great amount of interest in both industry and academia. In particular, discovering complex and meaningful relationships among this data is becoming an active research topic. Just as ranking of documents is a critical component of today's search engines, the ranking of relationships will be essential in tomorrow's semantic analytics engines. Building upon our recent work on specifying these semantic relationships, which we refer to as Semantic Associations, we demonstrate a system where these associations are discovered among a large semantic metabase represented in RDF. Additionally we employ ranking techniques to provide …


Exploiting Syntactic, Semantic And Lexical Regularities In Language Modeling Via Directed Markov Random Fields, Shaojun Wang, Shaomin Wang, Russell Greiner, Dale Schuurmans, Li Cheng Jan 2004

Exploiting Syntactic, Semantic And Lexical Regularities In Language Modeling Via Directed Markov Random Fields, Shaojun Wang, Shaomin Wang, Russell Greiner, Dale Schuurmans, Li Cheng

Kno.e.sis Publications

No abstract provided.


Operator-Based Semantics For Logic Programs, Pascal Hitzler Jan 2004

Operator-Based Semantics For Logic Programs, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The question how knowledge can be represented by means of logic programs with negation has been a driving force for the field of non-monotonic reasoning. Implemented systems, known as answer set programming systems, have emerged recently and are currently being used in various application domains like the semantic web.

Intuitively, logic programs are being used for encoding commonsense reasoning, in particular the phenomenon that human reasoning tends to ”jump to conclusions” under incomplete knowledge. Formally, this kind of reasoning is described by interpreting the first-order syntax of logic programs in a more sophisticated way. This, in turn, is most easily …


Semantic Visualization: Interfaces For Exploring And Exploiting Ontology, Knowledgebase, Heterogeneous Content And Complex Relationships, Amit P. Sheth, David Avant Jan 2004

Semantic Visualization: Interfaces For Exploring And Exploiting Ontology, Knowledgebase, Heterogeneous Content And Complex Relationships, Amit P. Sheth, David Avant

Kno.e.sis Publications

Technology platforms and products for ontology-driven process of semantic applications that serve both Enterprise wide and pan-Web needs are both available and being deployed. Similar to the development of enterprise software applications, the creation of an ontology driven semantic application can be described as a set of distinct phases that compose a lifecycle. From conception to deployment, these phases involve human interaction with a broad variety of information, identified as heterogeneous data, metadata, knowledge and ontology. Based on experience spanning academic research at the LSDIS lab through deployed commercial semantic applications based on Semagix Freedom, this paper provides examples of …


Early Work In Database Research On Schema Mapping/Merging/Transformation, Semantic Heterogeneity, And Use Of Ontology And Description Logics For Schematic And Semantic Integration, Amit P. Sheth Jan 2004

Early Work In Database Research On Schema Mapping/Merging/Transformation, Semantic Heterogeneity, And Use Of Ontology And Description Logics For Schematic And Semantic Integration, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.