Physical Sciences and Mathematics Commons^™

Implicit Online Learning With Kernels, Li Cheng, S. V. N. Vishwanathan, Dale Schuurmans, Shaojun Wang, Terry Caelli

Kno.e.sis Publications

We present two new algorithms for online learning in reproducing kernel Hilbert spaces. Our first algorithm, ILK (implicit online learning with kernels), employs a new, implicit update technique that can be applied to a wide variety of convex loss functions. We then introduce a bounded memory version, SILK (sparse ILK), that maintains a compact representation of the predictor without compromising solution quality, even in non-stationary environments. We prove loss bounds and analyze the convergence rate of both. Experimental evidence shows that our proposed algorithms outperform current methods on synthetic and real data.

Regression Cubes With Lossless Compression And Aggregation, Yixin Chen, Guozhu Dong, Jiawei Han, Jian Pei, Benjamin W. Wah, Jianyong Wang

Kno.e.sis Publications

As OLAP engines are widely used to support multidimensional data analysis, it is desirable to support in data cubes advanced statistical measures, such as regression and filtering, in addition to the traditional simple measures such as count and average. Such new measures will allow users to model, smooth, and predict the trends and patterns of data. Existing algorithms for simple distributive and algebraic measures are inadequate for efficient computation of statistical measures in a multidimensional space. In this paper, we propose a fundamentally new class of measures, compressible measures, in order to support efficient computation of the statistical models. For …

Active Semantic Electronic Medical Record, Amit P. Sheth, Sangeeta Agrawal, Jonathan Lathem, Nicole Oldham, H. Wingate, K. Gallagher

Kno.e.sis Publications

The healthcare industry is rapidly advancing towards the widespread use of electronic medical records systems to manage the increasingly large amount of patient data and reduce medical errors. In addition to patient data there is a large amount of data describing procedures, treatments, diagnoses, drugs, insurance plans, coverage, formularies and the relationships between these data sets. While practices have benefited from the use of EMRs, infusing these essential programs with rich domain knowledge and rules can greatly enhance their performance and ability to support clinical decisions. Active Semantic Electronic Medical Record (ASEMR) application discussed here uses Semantic Web technologies to …

{Ontology: Resource} X {Matching : Mapping} X {Schema : Instance} :: Components Of The Same Challenge, Amit P. Sheth

Kno.e.sis Publications

Ontologies enable us to elevate syntactic and structural processing in an information system/Web to an information system/Web powered with semantic processing. Experience has shown that monolithic and tightly coupled approaches seldom succeed, and majority of information systems and applications will need to deal with plurality of ontologies in a loosely coupled environment (i.e., independently evolving ontologies and inter-ontology relationships, existence of different contexts for different users/applications etc.) Development of such loosely-coupled multi-ontology environments entails development of techniques for ontology mapping/alignment, multi-ontology query processing, and much more.

How To Reason With Owl In A Logic Programming System, Markus Krotzsch, Pascal Hitzler, Denny Vrandecic, Michael Sintek

Computer Science and Engineering Faculty Publications

Logic programming has always been a major ontology modeling paradigm, and is frequently being used in large research projects and industrial applications, e.g., by means of the F-Logic reasoning engine OntoBroker or the TRIPLE query, inference, and transformation language and system. At the same time, the Web Ontology Language OWL has been recommended by the W3C for modeling ontologies for the Web. Naturally, it is desirable to investigate the interoperability between both paradigms. In this paper, we do so by studying an expressive fragment of OWL DL for which reasoning can be reduced to the evaluation of Horn logic programs. …

On The Complexity Of Horn Description Logics, Markus Krotzsch, Sebastian Rudolph, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Horn-SHIQ has been identified as a fragment of the description logic SHIQ for which inferencing is in PT_IME with respect to the size of the ABox. This enables reasoning with larger ABoxes in situations where the TBox is static, and represents one approach towards tractable description logic reasoning. In this paper, we show that reasoning in Horn-SHIQ, in spite of its low datacomplexity, is E_xpT_IME-hard with respect to the overall size of the knowledge base. While this result is not unexpected, the proof is not a mere modification of existing reductions since …

Magnetopolaron Effect On Shallow Donors In Gan, A. Wysmolek, R. Stepniewski, M. Potemski, B. Chwalisz-Pietka, K. Pakula, J. M. Baranowski, David C. Look, S. S. Park, S. K. Lee

Physics Faculty Publications

Resonant interaction between longitudinal-optic (LO) phonons and electrons bound on shallow donors in GaN is studied using magnetoluminescence of neutral-donor bound excitons (D⁰X). The experiments were performed on high-quality freestanding GaN material and heteroepitaxial GaN layers grown on sapphire. In addition to the principal recombination channel of D⁰X, in which donors are left in their ground states, two-electron satellites (TES) involving different excited donor excitations, as well as replicas of the principal D⁰X transition due to LO phonons, were observed for the oxygen and silicon donors. In order to separate transitions involving ground and …

A Framework For Schema-Driven Relationship Discovery From Unstructured Text, Cartic Ramakrishnan, Krzysztof Kochut, Amit P. Sheth

Kno.e.sis Publications

We address the issue of extracting implicit and explicit relationships between entities in biomedical text. We argue that entities seldom occur in text in their simple form and that relationships in text relate the modified, complex forms of entities with each other. We present a rule-based method for (1) extraction of such complex entities and (2) relationships between them and (3) the conversion of such relationships into RDF. Furthermore, we present results that clearly demonstrate the utility of the generated RDF in discovering knowledge from text corpora by means of locating paths composed of the extracted relationships.

Analysis Of Large Scale Image Data Using Out-Of-Core Techniques, Chandrashekara H. Raju, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

No abstract provided.

Student Fact Book, Fall 2006, 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, 2006.

Ceg 210: Pc Networking I, Chris P. Fickert

Computer Science & Engineering Syllabi

An introduction to PC networking hardware, software, concepts, and technologies. Focus is on LAN administration, hardware, and software configuration.

Course Goals

At the end of the quarter the student will be able to:

• design and configure a client/server network
• create and manage network objects
• plan and implement directory services and the network file systems
• plan and implement network security
• design and write network login scripts
• manage and solve problems related to a client/server network

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 text book.

Ceg 333: Introduction To Unix, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you should be able to:

• Describe the basic methodology of UNIX filters, including pipes and redirection of stdin/stdout

• Program simple UNIX utilities at the command-line and shell-script level • Discuss the advantages and disadvantages of common user interfaces {such as UNIX vs. PC/Windows)

• Discuss the philosophy of UNIX development and the open source movement

• Work comfortably in the UNIX environment

• Edit and manage files and user-level security for UNIX development

• Use standard UNIX development tools for C or C++

Ceg 221: Advanced C Programming For Engineers, Robert Helt

Computer Science & Engineering Syllabi

This course introduces advanced constructs, algorithms, and data structures in the C programming language. Emphasis is on problem solving and techniques useful to engineers. Topics include functions, array, pointers, structures as well as sorting algorithms, linked lists, complex numbers, stacks, queues, hash tables, and binary trees. 4 credit hours. Prerequisite: CEG220 (Introduction to C Programming for Engineers).

Ceg 476/676: Computer Graphics I, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you will have learnt techniques for constructing 2-D and 3-D obects as well as manipulating and rendering the objects using OpenGL.

The outline of the course is as follows:

• Introduction

• Geometric primitives

• Attributes of geometric primitives

• Antialiasing techniques

• Homogeneous coordinate system

• 2-D and 3-D viewing transformations

• Structures and hierarchical modeling

• 2-D and 3-D viewing transformations

• Input devices and interactive techniques •

Visible surface detection methods

Ceg 220: Introduction To C Programming For Engineers I, Robert Helt

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. 4 credit hours. Prerequisite: MTH 229 (Calculus I) or EGR 101 (Engineering Mathematics).

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 e-education.

• Gain hands-on experience with programming techniques for network protocols.

• Obtain background for original research in computer networks.

Ceg 420/620: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

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 partnered project.

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

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 360/560 Ee 451/651: 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.

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 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 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 790: Emerging Networks, Bin Wang

Computer Science & Engineering Syllabi

This is a graduate level course on emerging networking technologies. The course involves a reading/lecture/presentation/discussion component, paper review component, and a project component. It will provide an in-depth study on a number of focused areas: dense wavelength division multiplexing (DWDM) optical networks, optical burst switching networks, peer-to-peer networks, and wireless mobile networks (including Ad-hoc wireless networks, sensor networks). Various technical and research issues involved will be studied. These areas of emerging networking technologies will play central roles in future communication networks.

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.

Cs 208: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.

Cs 214: Object-Based Programming, Eric Maston

Computer Science & Engineering Syllabi

This course is a basic introduction to object oriented programming utilizing the Visual Basic programming language.

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.

Cs 241: Introduction To Computer Science Ii, Praveen Kakumanu

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. It focuses on tools for building abstract data types (using structure and class concepts in C++) and Object-Oriented Programming. We also begin the study of data structures in this course.