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

Digital Commons Network™

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

Wright State University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 4231 - 4260 of 7045

Full-Text Articles in Entire DC Network

Ceg 404/604-01: Wireless Sensor Networks, Bin Wang Jul 2007

Ceg 404/604-01: Wireless Sensor Networks, Bin Wang

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 460/660-01: Introduction To Software Computer Engineering, Eric Maston Jul 2007

Ceg 460/660-01: Introduction To Software Computer Engineering, Eric Maston

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large programs. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent, we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of software, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.

Go to article

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan Jul 2007

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modern programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g., scheme). The overall goal is to enable comparison and evaluation of existing languages. The programming assignments wi11 be coded in Java 5 and in Scheme.

Go to article

Wright State University College Of Education And Human Services Annual Report, July 1, 2006-June 30, 2007, College Of Education And Human Services, Wright State University Jun 2007

Wright State University College Of Education And Human Services Annual Report, July 1, 2006-June 30, 2007, College Of Education And Human Services, Wright State University

College of Education and Human Services Annual Reports

This Wright State University College of Education and Human Services annual report is from July 1, 2006 through June 30, 2007.

Go to article

Relationship Web: Realizing The Memex Vision With The Help Of Semantic Web, Amit P. Sheth Jun 2007

Relationship Web: Realizing The Memex Vision With The Help Of Semantic Web, Amit P. Sheth

Kno.e.sis Publications

Relationship Web takes us from "which document" could have information I need to "what's in the resources" that gives me the insight and knowledge I need for decision making. Dr. Vannevar Bush outlined his vision for Memex in a 1945 Atlantic Monthly article [1]. Describing how the human brain navigates an information space in what he called trailblazing, Dr. Bush said, "It operates by association. With one item in its grasp, it snaps instantly to the next that is suggested by the association of thoughts, in accordance with some intricate web of trails carried by the cells of the brain." …

Go to article

Semantics To Empower Services Science: Using Semantics At Middleware, Web Services And Business Levels, Amit P. Sheth Jun 2007

Semantics To Empower Services Science: Using Semantics At Middleware, Web Services And Business Levels, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Marc Low Interview, Professor Emeritus, Department Of Mathematics And Statistics, Wright State University, Lewis Shupe, Marc Low Jun 2007

Marc Low Interview, Professor Emeritus, Department Of Mathematics And Statistics, Wright State University, Lewis Shupe, Marc Low

Wright State University Retirees Association Oral History Project

Lewis Shupe interviewed Marc Low on June 12, 2007 about the founding of Wright State University and the development of the mathematics and statics program. In the interview Dr. Low discusses his career and his decision to come to Wright State as a founding faculty member.

Go to article

Wsu Board Of Trustees Meeting Minutes, June 7-8, 2007 Jun 2007

Wsu Board Of Trustees Meeting Minutes, June 7-8, 2007

Board of Trustees Minutes

Minutes from the Wright State University Board of Trustees Meeting held on June 7-8, 2007.

Go to article

Alphonso Smith Interview, Professor Emeritus, Department Of Mathematics And Statistics, Wright State University, Lewis Shupe, Alphonso Smith Jun 2007

Alphonso Smith Interview, Professor Emeritus, Department Of Mathematics And Statistics, Wright State University, Lewis Shupe, Alphonso Smith

Wright State University Retirees Association Oral History Project

Lewis Shupe interviewed Alphonso Smith on June 5, 2007 about the founding of Wright State University and the development of the math and statistics program. In the interview Dr. Smith discusses his career and his decision to come to Wright State as a founding faculty member.

Go to article

Faculty Senate Meeting Agenda And Minutes, June 4, 2007 Jun 2007

Faculty Senate Meeting Agenda And Minutes, June 4, 2007

Faculty Senate Minutes and Agendas

Agenda and minutes from the Wright State University Faculty Senate Meeting held on, June 4, 2007.

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

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

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

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

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

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

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

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 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

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

Automatic Composition Of Semantic Web Services Using Process Mediation, Zixin Wu, Karthik Gomadam, Ajith Harshana Ranabahu, Amit P. Sheth, John A. Miller Jun 2007

Automatic Composition Of Semantic Web Services Using Process Mediation, Zixin Wu, Karthik Gomadam, Ajith Harshana Ranabahu, Amit P. Sheth, John A. Miller

Kno.e.sis Publications

Web service composition has quickly become a key area of research in the services oriented architecture community. One of the challenges in composition is the existence of heterogeneities across independently created and autonomously managed Web service requesters and Web service providers. Previous work in this area either involved significant human effort or in cases of the efforts seeking to provide largely automated approaches, overlooked the problem of data heterogeneities, resulting in partial solutions that would not support executable workflow for real-world problems. In this paper, we present a planning-based approach to solve both the process heterogeneity and data heterogeneity problems. …

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

The Guardian, May 09, 2007, Wright State University Student Body May 2007

The Guardian, May 09, 2007, Wright State University Student Body

The Guardian Student Newspaper

Sixteen page issue of The Guardian, the official student-run newspaper for Wright State University. The Guardian has been published regularly since March of 1965.

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

The Guardian, May 02, 2007, Wright State University Student Body May 2007

The Guardian, May 02, 2007, Wright State University Student Body

The Guardian Student Newspaper

Twenty page issue of The Guardian, the official student-run newspaper for Wright State University. The Guardian has been published regularly since March of 1965.

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

First Prev Next Last