Physical Sciences and Mathematics Commons^™

Openws-Transaction: Enabling Reliable Web Service Transactions, Ivan Vasquez, John A. Miller, Kunal Verma, Amit P. Sheth

Kno.e.sis Publications

OpenWS-Transaction is an open source middleware that enables Web services to participate in a distributed transaction as prescribed by the WS-Coordination and WS-Transaction set of specifications. Central to the framework are the Coordinator and Participant entities, which can be integrated into existing services by introducing minimal changes to application code. OpenWS-Transaction allows transaction members to recover their original state in case of operational failure by leveraging techniques in logical logging and recovery at the application level. Depending on transaction style, system recovery may involve restoring key application variables and replaying uncommitted database activity. Transactions are assumed to be defined in …

Demonstrating Dynamic Configuration And Execution Of Web Processes, Karthik Gomadam, Kunal Verma, Amit P. Sheth, John A. Miller

Kno.e.sis Publications

Web processes are next generation workflows on the web, created using Web services. In this paper we demonstrate the METEOR-S Configuration and Execution Environment (MCEE) system. It will illustrate the capabilities of the system to a) Discover partners b) Optimize partner selection using constraint analysis, c) Perform interaction protocol and data mediation. A graphical execution monitor to monitor the various phases of execution will be used to demonstrate various aspects of the system.

Discovering Informative Connection Subgraphs In Multi-Relational Graphs, Cartic Ramakrishnan, William Milnor, Matthew Perry, Amit P. Sheth

Kno.e.sis Publications

Discovering patterns in graphs has long been an area of interest. In most approaches to such pattern discovery either quantitative anomalies, frequency of substructure or maximum flow is used to measure the interestingness of a pattern. In this paper we introduce heuristics that guide a subgraph discovery algorithm away from banal paths towards more "informative" ones. Given an RDF graph a user might pose a question of the form: "What are the most relevant ways in which entity X is related to entity Y?" the response to which is a subgraph connecting X to Y. We use our heuristics to …

Ontoqa: Metric-Based Ontology Quality Analysis, Samir Tartir, I. Budak Arpinar, Michael Moore, Amit P. Sheth, Boanerges Aleman-Meza

Kno.e.sis Publications

As the Semantic Web gains importance for sharing knowledge on the Internet this has lead to the development and publishing of many ontologies in different domains. When trying to reuse existing ontologies into their applications, users are faced with the problem of determining if an ontology is suitable for their needs. In this paper, we introduce OntoQA, an approach that analyzes ontology schemas and their populations (i.e. knowledgebases) and describes them through a well defined set of metrics. These metrics can highlight key characteristics of an ontology schema as well as its population and enable users to make an informed …

Semantics For Scientific Experiments And The Web: The Implicit, The Formal And The Powerful, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Modeling Fuzzy Rules With Description Logics, Sudhir Agarwal, Pascal Hitzler

Computer Science and Engineering Faculty Publications

In real application scenarios, input data and knowledge is often vague. Likewise, it is often the case that exact reasoning over data is impossible due to complex dependencies between input data and target outputs. For practical applications, however, good approximations often suffice, and efficient calculation of an approximate answer is often preferable over complex processing which may take a long time to come up with an exact answer. Fuzzy logic supports both features by providing fuzzy membership functions and fuzzy IF-THEN rule bases. In this paper, we show how fuzzy membership functions and fuzzy rules can be modeled by means …

The Screech Owl Reasoner - Scalable Approximate Abox Reasoning With Owl, Pascal Hitzler, Denny Vrandecic

Computer Science and Engineering Faculty Publications

We present a preliminary version of the approximate OWL reasoning system SCREECH. It builds on the KAON2 system and performs OWL ABox reasoning in an approximate manner. It trades soundness of reasoning for efficiency, with resulting polynomial worst-case data complexity. It has been developed for use in time-critical applications where quick response time is more important than a full guarantee of correctness of answers. The theoretical background for the system is explained in [Hitzler and Vrandecic, 2005] and is being presented at the conference.

Dlp Isn't So Bad After All, Peter Haase, Markus Krotzsch, York Sure, Rudi Studer, Pascal Hitzler

Computer Science and Engineering Faculty Publications

We discuss some of the recent controversies concerning the DLP fragment of OWL. We argue that it is a meaningful fragment and can serve as a basic interoperability layer between OWL and logic programming-based ontology languages.

Functional Characterization Of Core Promoter Elements: The Downstream Core Element Is Recognized By Taf1, Dong-Hoon Lee, Naum I. Gershenzon, Malavika Gupta, Ilya P. Ioshikhes, Danny Reinberg, Brian A. Lewis

Physics Faculty Publications

Downstream elements are a newly appreciated class of core promoter elements of RNA polymerase II-transcribed genes. The downstream core element (DCE) was discovered in the human β-globin promoter, and its sequence composition is distinct from that of the downstream promoter element (DPE). We show here that the DCE is a bona fide core promoter element present in a large number of promoters and with high incidence in promoters containing a TATA motif. Database analysis indicates that the DCE is found in diverse promoters, supporting its functional relevance in a variety of promoter contexts. The DCE consists of …

Evidence For Native-Defect Donors In N-Type Zno, David C. Look, Gary C. Farlow, Pakpoom Reunchan, Sukit Limpijumnong, S. B. Zhang, K. Nordlund

Physics Faculty Publications

Recent theory has found that native defects such as the O vacancy V_O and Zn interstitial Zn_I have high formation energies in n-type ZnO and, thus, are not important donors, especially in comparison to impurities such as H. In contrast, we use both theory and experiment to show that, under N ambient, the complex Zn_I-N_O is a stronger candidate than H or any other known impurity for a 30 meV donor commonly found in bulk ZnO grown from the vapor phase. Since the Zn vacancy is also the dominant acceptor in such material, we must …

Optimal Adaptation In Autonomic Web Processes With Inter-Service Dependencies, Kunal Verma, Prashant Doshi, Karthik Gomadam, John A. Miller, Amit P. Sheth

Kno.e.sis Publications

We present methods for optimally adapting Web processes to exogenous events while preserving inter-service dependencies. For example, in a supply chain process, orders placed by the manufacturer may get delayed in arriving. In response to this event, the manufacturer has the choice of either waiting out the delay or changing the supplier.

Computing For Human Experience And Wellness, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Student Fact Book, Fall 2005, Twenty-Ninth Annual Edition, Wright State University, Office Of Student Information Systems, Wright State University

Wright State University Student Fact Books

The student fact book has general demographic information on all students enrolled at Wright State University for Fall Quarter, 2005.

Ceg 210: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to PC networking hardware, concepts, and technologies. Focus is on LAN Administration.

Ceg 434/634: Concurrent Software Design, Natsuhiko Futamura

Computer Science & Engineering Syllabi

This course provides an introduction to concurrent program design in the UNIX environment. Classical problems of synchronization, concurrency , and their solutions are examined through the course projects and through readings on operating system design.

Ceg 433/633: Operating Systems, Prabhaker Mateti

Computer Science & Engineering Syllabi

The management of resources in multi-user computer systems. Emphasis is on problems of file-system design, process scheduling, memory allocation, protection, and tools needed for solutions. Course projects use the CIC++ language and include the design of portions of an operating system. 4 credit hours.

Ceg 499/699: Mobile Computing, Yong Pei

Computer Science & Engineering Syllabi

This senior/graduate course provides an in-depth study of networking protocol and system design in the area of wireless networking and mobile computing. It will help CEG students establish a solid foundation in wireless networking architecture, protocols, fundamental concepts and principles, network congestion control and flow control design. It will also introduce students to a few hot topics in wireless networking and mobile computing research.

The course will start with a review over fundamental design challenges, architectural principles and philosophy for the Internet and heterogeneous networks. The focus will then move on to an in-depth examination of wireless networking protocols, and …

Ceg 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom

Computer Science & Engineering Syllabi

Terminology and understanding of functional organizations and sequential operatio of a digital computer. Program structure, and machine and assembly language topics including addressing, stacks, argument pasing, arithmetic operations, traps, and input/output. Macros, modularization, linkers, and debuggers are used. Three hours lecture, two hours lab. Prerequisite: CS 242, CEO 260.

Ceg 460/660: Introduction To Software Computer Engineering, John A. Reisner

Computer Science & Engineering Syllabi

This course introduces established practices for engineering large-scale software systems. Emphasis is placed on both the technical and managerial aspects of software engineering, and the software development process. This includes techniques for requirements elicitation, analysis, design, testing, and project management. The course emphasizes object-oriented development with the Unified Modeling Language (UML). Hands-on experience is provided through individual homework problems and a group project.

Ceg 724: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course cover basic techniques for low-level and some mid-level vision processing. The techniques include: image filtering, intensity thresholding, edge detection, 2-D shape analysis, line and circle detection, corner detection, pattern matching.

Ceg 402/602: Introduction To Computer Communication, Bin Wang

Computer Science & Engineering Syllabi

This course provides an introduction to basic concepts of communication networks, different types of networks, protocols over different layers, and network applications through lectures, labs, homework, and reading on relevant materials. You will

• Understand networking principles, protocols, and technologies.
• Understand some design and performance issues involved in providing a network service.
• Acquire background for supporting e-commerce, e-government, and education.
• Gain hands-on experience with programming techniques for network protocols.
• Obtain background for original research in computer networks.

Ceg 210: Pc Networking I, Chris P. Fickert

Computer Science & Engineering Syllabi

The objective of the course is to provide an introduction to PC networking hardware, concepts, and technologies with a focus on hardware configuration and LAN administration using in-class, hands-on exercises with Novell NetWare.

Ceg 770: Computer Engineering Mathematics, Yong Pei

Computer Science & Engineering Syllabi

Computer Engineering and Science students need proficiency in relevant applied mathematics to be able to discover and model difficult real-world computer engineering and science problems. The relationship of these problems to mathematical theory will be discussed. This course provides an introduction to linear and nonlinear programming, probability and stochastic process, and queueing theory. In addition to mathematical theory, appropriate applications will be presented.

Ceg 760: Advanced Software Computer Engineering, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course covers advanced topics in software engineering. Aspects of problem specification, design, verification, and evaluation are discussed. We will focus on design methods, including software patterns and software architecture, plus some advanced topics involving formal methods of software specification or evaluation using software metrics. Students will participate in team projects to apply the methods discussed.

Ceg 220: Introduction To C Programming For Engineers I, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. Some programming assignments may involve complex arithmetic and trigonometric and exponential functions. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics).

Ceg 453/653: Design Of Computing Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 260: Digital Computer Hardware Switching Circuits, Eric Matson

Computer Science & Engineering Syllabi

We will discuss and cover basic digital, combinational and sequential logic systems. Labs will be used to gain valuable practical experience in implementing elementary circuits and logic designs.

Ceg 498: Design Experience, Thomas C. Hartrum

Computer Science & Engineering Syllabi

CEG 498 (Design Experience) is a summative computer engineering design project course that builds upon previous engineering, science, mathematics and communications course work. CEG 498 projects are a minimum of two quarters in length and must be completed in groups of at least three students. Projects are selected under the guidance of the course instructor and are tailored to both student interest and formal classroom preparation. Students are evaluated both on their individual contributions as recorded in a graded engineering journals and on the quality of their collective efforts as reflected in group generated products.

Ceg 255: Introduction To The Design Of Information Technology Systems, Eric Matson

Computer Science & Engineering Syllabi

Information systems consist of modem elements such as database systems, networks, multiplatform distributed computing, web infrastructure and multimedia computing. In this course we will address these areas individually and also where they intersect to gain a basic understanding of how information technology can be used to solve real problems.

We will develop techniques to design, develop and implement distributed business software. Emphasis will be on the following areas:

• Graphical User Interfaces (GUI) using Java Swing classes
• Management of data in Relational Database Management Systems (RDBMS) with SQL
• Integration of distributed systems using object brokering systems such as CORBA

Ceg 333: Introduction To Unix, Travis E. Doom

Computer Science & Engineering Syllabi

Introduction to the use of UNIX and UNIX tools as a problem-solving environment. Emphasis on the shell, files and directories, editing files, user process management, compiling, and debugging. Prerequisite: CS 241.