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

Physical Sciences and Mathematics Commons™

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

Wright State University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 2401 - 2430 of 3840

Full-Text Articles in Physical Sciences and Mathematics

Paraconsistent Resolution For Four-Valued Description Logics, Yue Ma, Pascal Hitzler, Zuoquan Li Jun 2007

Paraconsistent Resolution For Four-Valued Description Logics, Yue Ma, Pascal Hitzler, Zuoquan Li

Computer Science and Engineering Faculty Publications

In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve this in two steps: First we give a simple way to make any ALC based ontology 4-valued satisfiable, and then we study a sound and complete paraconsistent ordered-resolution decision procedure for our 4-valued ALC. Our approach can be viewed as a paraconsistent version of KAON2 algorithm.

Go to article

Foundations Of Refinement Operators For Description Logics, Jens Lehmann, Pascal Hitzler Jun 2007

Foundations Of Refinement Operators For Description Logics, Jens Lehmann, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In order to leverage techniques from Inductive Logic Programming for the learning in description logics (DLs), which are the foundation of ontology languages in the Semantic Web, it is important to acquire a thorough understanding of the theoretical potential and limitations of using refinement operators within the description logic paradigm. In this paper, we present a comprehensive study which analyses desirable properties such operators should have. In particular, we show that ideal refinement operators in general do not exist, which is indicative of the hardness inherent in learning in DLs. We also show which combinations of desirable properties are theoretically …

Go to article

Algorithms For Paraconsistent Reasoning With Owl, Yue Ma, Pascal Hitzler, Zuoquan Lin Jun 2007

Algorithms For Paraconsistent Reasoning With Owl, Yue Ma, Pascal Hitzler, Zuoquan Lin

Computer Science and Engineering Faculty Publications

In an open, constantly changing and collaborative environment like the forthcoming Semantic Web, it is reasonable to expect that knowledge sources will contain noise and inaccuracies. Practical reasoning techniques for ontologies therefore will have to be tolerant to this kind of data, including the ability to handle inconsistencies in a meaningful way. For this purpose, we employ paraconsistent reasoning based on four-valued logic, which is a classical method for dealing with inconsistencies in knowledge bases. Its transfer to OWL DL, however, necessitates the making of fundamental design choices in dealing with class inclusion, which has resulted in differing proposals for …

Go to article

A Refinement Operator Based Learning Algorithm For The Alc Description Logic, Jens Lehmann, Pascal Hitzler Jun 2007

A Refinement Operator Based Learning Algorithm For The Alc Description Logic, Jens Lehmann, Pascal Hitzler

Computer Science and Engineering Faculty Publications

With the advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applications, however, faces a bottleneck due to the lack of available knowledge bases, and it is paramount that suitable automated methods for their acquisition will be developed. In this paper, we provide the first learning algorithm based on refinement operators for the most fundamental description logic ALC. We develop the algorithm from thorough theoretical foundations and report on a prototype implementation.

Go to article

Acquisition Of Owl Dl Axioms From Lexical Resources, Johanna Volker, Pascal Hitzler, Philipp Cimiano Jun 2007

Acquisition Of Owl Dl Axioms From Lexical Resources, Johanna Volker, Pascal Hitzler, Philipp Cimiano

Computer Science and Engineering Faculty Publications

State-of-the-art research on automated learning of ontologies from text currently focuses on inexpressive ontologies. The acquisition of complex axioms involving logical connectives, role restrictions, and other expressive features of the Web Ontology Language OWL remains largely unexplored. In this paper, we present a method and implementation for enriching inexpressive OWL ontologies with expressive axioms which is based on a deep syntactic analysis of natural language definitions. We argue that it can serve as a core for a semi-automatic ontology engineering process supported by a methodology that integrates methods for both ontology learning and evaluation. The feasibility of our approach is …

Go to article

Efficient Owl Reasoning With Logic Programs - Evaluations, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler, Michael Sintek, Denny Vrandecic Jun 2007

Efficient Owl Reasoning With Logic Programs - Evaluations, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler, Michael Sintek, Denny Vrandecic

Computer Science and Engineering Faculty Publications

We report on efficiency evaluations concerning two different approaches to using logic programming for OWL [1] reasoning and show, how the two approaches can be combined.

Go to article

Selecting Labels For News Document Clusters, Krishnaprasad Thirunarayan, Trivikram Immaneni, Mastan Vali Shaik Jun 2007

Selecting Labels For News Document Clusters, Krishnaprasad Thirunarayan, Trivikram Immaneni, Mastan Vali Shaik

Kno.e.sis Publications

This work deals with determination of meaningful and terse cluster labels for News document clusters. We analyze a number of alternatives for selecting headlines and/or sentences of document in a document cluster (obtained as a result of an entity-event-duration query), and formalize an approach to extracting a short phrase from well-supported headlines/sentences of the cluster that can serve as the cluster label. Our technique maps a sentence into a set of significant stems to approximate its semantics, for comparison. Eventually a cluster label is extracted from a selected headline/sentence as a contiguous sequence of words, resuscitating word sequencing information lost …

Go to article

A Well-Founded Semantics For Hybrid Mknf Knowledge Bases, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler Jun 2007

A Well-Founded Semantics For Hybrid Mknf Knowledge Bases, Matthias Knorr, Jose Julio Alferes, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In [10], hybrid MKNF knowledge bases have been proposed for combining open and closed world reasoning within the logics of minimal knowledge and negation as failure ([8]). For this powerful framework, we define a three-valued semantics and provide an alternating fixpoint construction for nondisjunctive hybrid MKNF knowledge bases. We thus provide a well-founded semantics which is a sound approximation of the cautious MKNF model semantics, and which also features improved computational properties. We also show that whenever the DL knowledge base part is empty, then the alternating fixpoint coincides with the classical well-founded model.

Go to article

Measuring Inconsistency For Description Logics Based On Paraconsistent Semantics, Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Lin Jun 2007

Measuring Inconsistency For Description Logics Based On Paraconsistent Semantics, Yue Ma, Guilin Qi, Pascal Hitzler, Zuoquan Lin

Computer Science and Engineering Faculty Publications

In this paper, we propose an approach for measuring inconsistency in inconsistent ontologies. We first define the degree of inconsistency of an inconsistent ontology using a four-valued semantics for the description logic ALC. Then an ordering over inconsistent ontologies is given by considering their inconsistency degrees. Our measure of inconsistency can provide important information for inconsistency handling.

Go to article

Runtime Support Of Speculative Optimization For Offline Escape Analysis, Kevin Cleereman, Michelle Cheatham, Krishnaprasad Thirunarayan Jun 2007

Runtime Support Of Speculative Optimization For Offline Escape Analysis, Kevin Cleereman, Michelle Cheatham, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Escape analysis can improve the speed and memory efficiency of garbage collected languages by allocating objects to the call stack, but an offline analysis will potentially interfere with dynamic class loading and an online analysis must sacrifice precision for speed. We describe a technique that permits the safe use of aggressive, speculative offline escape analysis in programs potentially loading classes that violate the analysis results.

Go to article

Using Sawsdl For Semantic Service Interoperability, Kunal Verma, Amit P. Sheth May 2007

Using Sawsdl For Semantic Service Interoperability, Kunal Verma, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Semantic Annotations For Wsdl, Amit P. Sheth, Jacek Kopecky May 2007

Semantic Annotations For Wsdl, Amit P. Sheth, Jacek Kopecky

Kno.e.sis Publications

No abstract provided.

Go to article

Estimating The Cardinality Of Rdf Graph Patterns, Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman May 2007

Estimating The Cardinality Of Rdf Graph Patterns, Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman

Kno.e.sis Publications

Most RDF query languages allow for graph structure search through a conjunction of triples which is typically processed using join operations. A key factor in optimizing joins is determining the join order which depends on the expected cardinality of intermediate results. This work proposes a pattern-based summarization framework for estimating the cardinality of RDF graph patterns. We present experiments on real world and synthetic datasets which confirm the feasibility of our approach.

Go to article

Altering Document Term Vectors For Classification - Ontologies As Expectations Of Co-Occurrence, Meenakshi Nagarajan, Amit P. Sheth, Marcos Aguilera, Kimberly Keeton, Arif Merchant, Mustafa Uysal May 2007

Altering Document Term Vectors For Classification - Ontologies As Expectations Of Co-Occurrence, Meenakshi Nagarajan, Amit P. Sheth, Marcos Aguilera, Kimberly Keeton, Arif Merchant, Mustafa Uysal

Kno.e.sis Publications

In this paper we extend the state-of-the-art in utilizing background knowledge for supervised classification by exploiting the semantic relationships between terms explicated in Ontologies. Preliminary evaluations indicate that the new approach generally improves precision and recall, more so for hard to classify cases and reveals patterns indicating the usefulness of such background knowledge.

Go to article

Semantic Web: Technologies And Applications For The Real-World, Amit P. Sheth May 2007

Semantic Web: Technologies And Applications For The Real-World, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Visualization Of Events In A Spatially And Multimedia Enriched Virtual Environment, Leonidas Deligiannidis, Farshad Hakimpour, Amit P. Sheth May 2007

Visualization Of Events In A Spatially And Multimedia Enriched Virtual Environment, Leonidas Deligiannidis, Farshad Hakimpour, Amit P. Sheth

Kno.e.sis Publications

Semantic Event Tracker (SET) is a highly interactive visualization tool for tracking and associating activities (events) in a spatially and Multimedia Enriched Virtual Environment. SET provides integrated views of information spaces while providing overview and detail to improve perception and evaluation of complex scenarios. We model an event as an object that describes an action and its location, time, and relations to other objects. Real world event information is extracted from Internet sources, then stored and processed using Semantic Web technologies that enable us to discover semantic associations between events. We use RDF graphs to represent semantic metadata and ontologies. …

Go to article

An Experiment In Integrating Large Biomedical Knowledge Resources With Rdf: Application To Associating Genotype And Phenotype Information, Satya S. Sahoo, Olivier Bodenreider, Kelly Zeng, Amit P. Sheth May 2007

An Experiment In Integrating Large Biomedical Knowledge Resources With Rdf: Application To Associating Genotype And Phenotype Information, Satya S. Sahoo, Olivier Bodenreider, Kelly Zeng, Amit P. Sheth

Kno.e.sis Publications

Bridging between genotype and phenotype is generally achieved through the integration of knowledge sources such as Entrez Gene (EG), Online Mendelian Inheritance in Man (OMIM) and the Gene Ontology (GO). Traditionally, such integration implies manual effort or the development of customized software. In this paper, we demonstrate how the Resource Description Framework (RDF) can be used to represent and integrate these resources and support complex queries over the unified resource. We illustrate the effectiveness of our approach by answering a real-world biomedical query linking a specific molecular function, glycosyltransferase, to the disorder congenital muscular dystrophy, which potentially forms a new …

Go to article

Semantic Web Applications In Industry, Government, Health Care And Life Sciences, Amit P. Sheth Apr 2007

Semantic Web Applications In Industry, Government, Health Care And Life Sciences, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Cs 142: Computer Programming - Ii, Eric Maston Apr 2007

Cs 142: Computer Programming - Ii, Eric Maston

Computer Science & Engineering Syllabi

This course provides a continuation to the general introduction of computer programming begun in CS 141. Examples from and applications to a broad range of problems are given. The concepts covered will be applied to the Java programming language. (Students must register for both lecture and laboratory sections.)

Go to article

Cs 141: Computer Programming - I, Michael Ondrasek Apr 2007

Cs 141: Computer Programming - I, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. The concepts covered will be applied to the Java programming language. Students must register for both lecture and one laboratory section. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.

Go to article

Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog Apr 2007

Cs 206: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

By the end of this course, the students will have a greater depth of understanding in the areas of word processing, spreadsheets, databases, and presentation software and web design using Microsoft Word, Microsoft FrontPage, Microsoft Excel, Access, and PowerPoint covering the following topics.
Microsoft Excel 2003:
Tutorial 5: Working with Excel Lists
Tutorial 6: Working with Multiple Worksheets and Workbooks Tutorial 7: Working with
Excel's Editing and Web Tools Tutorial 8: Developing an Excel Application Appendix A:
Working with Logical Functions, Database Functions, and Advanced Filtering Appendix B:
Integrating Excel with Other Window Programs
Microsoft Access 2003:
Tutorial 5: Enhancing …

Go to article

Cs 208: Computer Programming For Business I, Dennis Kellermeier Apr 2007

Cs 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 208 is the first of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming. This course assumes students have never written a program before.

Go to article

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier Apr 2007

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 209 is the second of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming.

Go to article

Cs 214: Visual Basic Programming, Michael Ondrasek Apr 2007

Cs 214: Visual Basic Programming, Michael Ondrasek

Computer Science & Engineering Syllabi

This course provides a general introduction to the fundamentals of object computer programming. Examples from and applications to a broad range of problems are given. No prior knowledge of programming is assumed. However, students should have a familiarity with programming concepts. The concepts covered will be applied in the Visual Basic programming language. 4 credit hours.

Go to article

Cs 241: Introduction To Computer Science Ii, Haiyun Bian Apr 2007

Cs 241: Introduction To Computer Science Ii, Haiyun Bian

Computer Science & Engineering Syllabi

This course is the second in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. Concepts introduced in CS 240 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, basic sorting algorithms, recursion, graphics, development of user interfaces and exception handling. Student must register for one lecture section and one lab section.

Go to article

Cs 242: Computer Programming Iii, Mateen M. Rizki Apr 2007

Cs 242: Computer Programming Iii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 415: Social Implications Of Computing, Leo Finkelstein Apr 2007

Cs 415: Social Implications Of Computing, Leo Finkelstein

Computer Science & Engineering Syllabi

CS 415 is a communication skills course using as its subject matter current salient issues associated with the social implications of computing. In addition to the course text, you will need to use certain reading materials in the library and elsewhere, and you will be responsible for using concepts and theories provided in class lectures and discussions.

Go to article

Cs 470/670: System Simulation, Mateen M. Rizki Apr 2007

Cs 470/670: System Simulation, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Cs 701: Database Systems And Design I, Guozhu Dong Apr 2007

Cs 701: Database Systems And Design I, Guozhu Dong

Computer Science & Engineering Syllabi

An introduction to database design, database system implementation issues and techniques, and advanced data models.

Go to article

Cs 790-03: Information Integration & Analysis, Amit P. Sheth Apr 2007

Cs 790-03: Information Integration & Analysis, Amit P. Sheth

Computer Science & Engineering Syllabi

This course deals with the integration and analysis of heterogeneous data-a topic of significant research as well as practical importance. A typical large organization spends around 30% of all its IT effort and expense for data/information integration. Furthermore, organizations can greatly increase their competitiveness by exploiting the data they collect, and discovering trends and patterns leading to insights. Hugh repositories of public data on the Web also provide opportunity to discovery undiscovered public knowledge.

Go to article

First Prev Next Last