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 2101 - 2130 of 3840

Full-Text Articles in Physical Sciences and Mathematics

Ceg 360/560-01: Digital System Design, Travis E. Doom Jul 2008

Ceg 360/560-01: Digital System Design, Travis E. Doom

Computer Science & Engineering Syllabi

Design of digital systems. Topics include flip-flops, registers, counters, programmable logic devices, memory devices, register-level design, and microcomputer system organization. Students must show competency in the design of digital systems. 3 hours lecture, 2 hours lab. Prerequisite: CEG 260.

Go to article

Ceg 433/633-01: Operating Systems, Yong Pei Jul 2008

Ceg 433/633-01: Operating Systems, Yong Pei

Computer Science & Engineering Syllabi

This course provides an introduction to operating system design. Topics to be covered include: Operating system structures, Operating system interfaces, Process management and scheduling, Inter-process communication, File systems and Memory management and Device access.

Go to article

Reproducible Increased Mg Incorporation And Large Hole Concentration In Gan Using Metal Modulated Epitaxy, Shawn D. Burnham, Gon Namkoong, David C. Look, Bruce Claflin, W. Alan Doolittle Jul 2008

Reproducible Increased Mg Incorporation And Large Hole Concentration In Gan Using Metal Modulated Epitaxy, Shawn D. Burnham, Gon Namkoong, David C. Look, Bruce Claflin, W. Alan Doolittle

Physics Faculty Publications

The metal modulated epitaxy (MME) growth technique is reported as a reliable approach to obtain reproducible large hole concentrations in Mg-doped GaN grown by plasma-assisted molecular-beam epitaxy on c-plane sapphire substrates. An extremely Ga-rich flux was used, and modulated with the Mg source according to the MME growth technique. The shutter modulation approach of the MME technique allows optimal Mg surface coverage to build between MME cycles and Mg to incorporate at efficient levels in GaN films. The maximum sustained concentration of Mg obtained in GaN films using the MME technique was above 7×1020 cm−3, leading …

Go to article

Boosting With Incomplete Information, Gholamreza Haffari, Yang Wang, Shaojun Wang, Greg Mori, Feng Jiao Jul 2008

Boosting With Incomplete Information, Gholamreza Haffari, Yang Wang, Shaojun Wang, Greg Mori, Feng Jiao

Kno.e.sis Publications

In real-world machine learning problems, it is very common that part of the input feature vector is incomplete: either not available, missing, or corrupted. In this paper, we present a boosting approach that integrates features with incomplete information and those with complete information to form a strong classifier. By introducing hidden variables to model missing information, we form loss functions that combine fully labeled data with partially labeled data to effectively learn normalized and unnormalized models. The primal problems of the proposed optimization problems with these loss functions are provided to show their close relationship and the motivations behind them. …

Go to article

Semantic Web: Promising Technologies, Current Applications & Future Directions, Amit P. Sheth Jul 2008

Semantic Web: Promising Technologies, Current Applications & Future Directions, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Dependence Of Binary Associations On Co-Occurrence Granularity In News Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni, Mastan Vali Shaik Jul 2008

Dependence Of Binary Associations On Co-Occurrence Granularity In News Documents, Krishnaprasad Thirunarayan, Trivikram Immaneni, Mastan Vali Shaik

Kno.e.sis Publications

We describe and formalize an approach to correlate binary associations (such as between entities and events, between persons and events, etc.) implied by News documents on the co-occurrence granularity (such as document-level, paragraph-level, sentence-level, etc.) of the corresponding text phrases in the documents. Specifically, we present both qualitative and quantitative characterization of searching News documents: former in terms of the nature of the content and the queries, and latter in terms of a metric obtained by adapting the notions of precision and recall. Specifically, the approach tries to reduce the manual effort required to analyze the News documents to compare …

Go to article

Cs 241: Computer Programming Ii, Eric Maston Jul 2008

Cs 241: Computer Programming Ii, Eric Maston

Computer Science & Engineering Syllabi

This is the second course in the Introduction to Computer Programming series. A continuation of CS240. The emphasis is on data abstraction and software development. Prerequisite: CS240.

Go to article

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

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 will be coded in Java 5 and in Scheme.

Go to article

Cs 415: Social Implications Of Computing, Leo Finkelstein Jul 2008

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 242: Computer Programming Iii, Guozhu Dong Jul 2008

Cs 242: Computer Programming Iii, Guozhu Dong

Computer Science & Engineering Syllabi

No abstract provided.

Go to article

Ceg 720-01: Computer Architecture I, Soon M. Chung Jul 2008

Ceg 720-01: Computer Architecture I, Soon M. Chung

Computer Science & Engineering Syllabi

Review of sequential computer architecture and study of parallel computers. Topics include memory hierarchy, reduced instruction set computer; pipeline processing, multiprocessing, various parallel computers, interconnection networks, and fault-tolerant computing. 3 hours lecture and 2 hours lab.

Go to article

Ceg 460/660-01: Computer Engineering, Eric Maston Jul 2008

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

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large program. 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

Ceg 233-01: Linux And Windows, Bin Wang Jul 2008

Ceg 233-01: Linux And Windows, Bin Wang

Computer Science & Engineering Syllabi

Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and HTTPS. System Administration. 4 credit hours. 3 hours labs, 2 hours labs. Prerequisites: None.

Go to article

A Framework For Trust And Distrust Networks, Krishnaprasad Thirunarayan Jun 2008

A Framework For Trust And Distrust Networks, Krishnaprasad Thirunarayan

Kno.e.sis Publications

In this age of internet and electronic commerce it is becoming increasingly important to have and to manipulate information about the trustworthiness of the content or service providers in order to make informed decisions. This paper explores realistic models of trust and distrust based on partially ordered discrete values and proposes a framework, which is sensitive to local, relative ordering of values rather than their magnitudes. The framework distinguishes between direct and inferred trust, preferring direct information over possibly conflicting inferred information. It also represents ambiguity or inconsistency explicitly. The framework is capable of handling general trust and belief networks …

Go to article

A Forgetting-Based Approach For Reasoning With Inconsistent Distributed Ontologies, Guilin Qi, Yimin Wang, Peter Haase, Pascal Hitzler Jun 2008

A Forgetting-Based Approach For Reasoning With Inconsistent Distributed Ontologies, Guilin Qi, Yimin Wang, Peter Haase, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In the context of multiple distributed ontologies, we are often confronted with the problem of dealing with inconsistency. In this paper, we propose an approach for reasoning with inconsistent distributed ontologies based on concept forgetting. We firstly define concept forgetting in description logics. We then adapt the notions of recoveries and preferred recoveries in propositional logic to description logics. Two consequence relations are then defined based on the preferred recoveries.

Go to article

Defeasible Inference With Circumscriptive Owl Ontologies, Stephan Grimm, Pascal Hitzler Jun 2008

Defeasible Inference With Circumscriptive Owl Ontologies, Stephan Grimm, Pascal Hitzler

Computer Science and Engineering Faculty Publications

The Web Ontology Language (OWL) adheres to the openworld assumption and can thus not be used for forms of nonmonotonic reasoning or defeasible inference, an acknowledged desirable feature in open Semantic Web environments. We investigate the use of the formalism of circumscriptive description logics (DLs) to realise defeasible inference within the OWL framework. By example, we demonstrate how reasoning with (restricted) circumscribed OWL ontologies facilitates various forms of defeasible inference, also in comparison to alternative approaches. Moreover, we sketch an extension to DL tableaux for handling the circumscriptive case and report on a preliminary implementation.

Go to article

The Rotational Spectrum Of Chlorine Nitrate (Ciono2): V6 And The V5/V6V9 Dyad, Zbigniew Kisiel, Ewa Bialkowska-Jaworska, Rebecca A. H. Butler, Douglas T. Petkie, Paul Helminger, Frank C. De Lucia Jun 2008

The Rotational Spectrum Of Chlorine Nitrate (Ciono2): V6 And The V5/V6V9 Dyad, Zbigniew Kisiel, Ewa Bialkowska-Jaworska, Rebecca A. H. Butler, Douglas T. Petkie, Paul Helminger, Frank C. De Lucia

Physics Faculty Publications

No abstract provided.

Go to article

Infrared Simulations Derived From Submillimeter Wave Analyses, Douglas T. Petkie, Rebecca A. H. Butler, Paul Helminger, Zbigniew Kisiel, Kenneth W. Jucks, Brenda P. Winnewisser, Manfred Winnewisser, Frank C. De Lucia Jun 2008

Infrared Simulations Derived From Submillimeter Wave Analyses, Douglas T. Petkie, Rebecca A. H. Butler, Paul Helminger, Zbigniew Kisiel, Kenneth W. Jucks, Brenda P. Winnewisser, Manfred Winnewisser, Frank C. De Lucia

Physics Faculty Publications

No abstract provided.

Go to article

Empowering Translational Research Using Semantic Web Technologies, Amit P. Sheth Jun 2008

Empowering Translational Research Using Semantic Web Technologies, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Graph Summaries For Subgraph Frequency Estimation, Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman Jun 2008

Graph Summaries For Subgraph Frequency Estimation, Angela Maduko, Kemafor Anyanwu, Amit P. Sheth, Paul Schliekelman

Kno.e.sis Publications

A fundamental problem related to graph structured databases is searching for substructures. One issue with respect to optimizing such searches is the ability to estimate the frequency of substructures within a query graph. In this work, we present and evaluate two techniques for estimating the frequency of subgraphs from a summary of the data graph. In the first technique, we assume that edge occurrences on edge sequences are position independent and summarize only the most informative dependencies. In the second technique, we prune small subgraphs using a valuation scheme that blends information about their importance and estimation power. In both …

Go to article

Sa-Rest: Using Semantics To Empower Restful Services And Smashups With Better Interoperability And Mediation, Karthik Gomadam, Amit P. Sheth May 2008

Sa-Rest: Using Semantics To Empower Restful Services And Smashups With Better Interoperability And Mediation, Karthik Gomadam, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Dynamic And Agile Soa Using Sawsdl, Karthik Gomadam, Kunal Verma, Amit P. Sheth May 2008

Dynamic And Agile Soa Using Sawsdl, Karthik Gomadam, Kunal Verma, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

A Framework To Support Spatial, Temporal And Thematic Analytics Over Semantic Web Data, Matthew Perry, Amit P. Sheth May 2008

A Framework To Support Spatial, Temporal And Thematic Analytics Over Semantic Web Data, Matthew Perry, Amit P. Sheth

Kno.e.sis Publications

Spatial and temporal data are critical components in many applications. This is especially true in analytical applications ranging from scientific discovery to national security and criminal investigation. The analytical process often requires uncovering and analyzing complex thematic relationships between disparate people, places and events. Fundamentally new query operators based on the graph structure of Semantic Web data models, such as semantic associations, are proving useful for this purpose. However, these analysis mechanisms are primarily intended for thematic relationships. In this paper, we describe a framework built around the RDF data model for analysis of thematic, spatial and temporal relationships between …

Go to article

The Signed-Graphic Representations Of Wheels And Whirls, Dan Slilaty, Hongxun Qin May 2008

The Signed-Graphic Representations Of Wheels And Whirls, Dan Slilaty, Hongxun Qin

Mathematics and Statistics Faculty Publications

We characterize all of the ways to represent the wheel matroids and whirl matroids using frame matroids of signed graphs. The characterization of wheels is in terms of topological duality in the projective plane and the characterization of whirls is in terms of topological duality in the annulus.

Go to article

Connectivity In Frame Matroids, Dan Slilaty, Hongxun Qin May 2008

Connectivity In Frame Matroids, Dan Slilaty, Hongxun Qin

Mathematics and Statistics Faculty Publications

We discuss the relationship between the vertical connectivity of a biased graph Ω and the Tutte connectivity of the frame matroid of Ω (also known as the bias matroid of Ω).

Go to article

All Elephants Are Bigger Than All Mice, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler May 2008

All Elephants Are Bigger Than All Mice, Sebastian Rudolph, Markus Krotzsch, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We investigate the concept product as an expressive feature for description logics (DLs). While this construct allows us to express an arguably very common and natural type of statement, it can be simulated only by the very expressive DL SROIQ for which no tight worst-case complexity is known. However, we show that concept products can also be added to the DLs SHOIQ and SHOI, and to the tractable DL EL++ without increasing the worst-case complexities in any of those cases. We therefore argue that concept products provide practically relevant expressivity at little cost, making them a good candidate …

Go to article

Ws3: International Workshop On Context-Enabled Source And Service Selection, Integration And Adaptation, Quan Z. Sheng, Ullas Nambiar, Amit P. Sheth, Biplav Srivastava, Zakaria Maamr, Said Elnaffar Apr 2008

Ws3: International Workshop On Context-Enabled Source And Service Selection, Integration And Adaptation, Quan Z. Sheng, Ullas Nambiar, Amit P. Sheth, Biplav Srivastava, Zakaria Maamr, Said Elnaffar

Kno.e.sis Publications

This write-up provides a summary of the International Workshop on Context enabled Source and Service Selection, Integration and Adaptation (CSSSIA 2008), organized in conjunction with WWW2008, at Beijing, China on April 22nd 2008. We outline the motivation for organizing the work-shop, briefly describe the organizational details and program of the workshop, and summarize each of the papers accepted by the workshop. More information about the workshop can be found at http://www.cs.adelaide.edu.au/∼csssia08/.

Go to article

Rdb2rdf: Incorporating Domain Semantics In Structured Data, Satya S. Sahoo Apr 2008

Rdb2rdf: Incorporating Domain Semantics In Structured Data, Satya S. Sahoo

Kno.e.sis Publications

No abstract provided.

Go to article

The Equation, Spring 2008, College Of Science And Mathematics, Wright State University Apr 2008

The Equation, Spring 2008, College Of Science And Mathematics, Wright State University

College of Science and Mathematics Newsletters

This 4 page newsletter discusses various happenings within the College of Science and Mathematics. It begins with a letter from the dean, and continues on with news, events, alumni news, and other community news.

Go to article

Cs 142: Computer Programming - Ii, Haiyun Bian Apr 2008

Cs 142: Computer Programming - Ii, Haiyun Bian

Computer Science & Engineering Syllabi

Concepts introduced in CS 141 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, graphics, development of user interfaces and exception handling. Student must register for both lecture and one lab section. Prerequisite: CS 141

Go to article

First Prev Next Last