Physical Sciences and Mathematics Commons^™

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

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. The goal of this course is to blend social implications issues with common technical communication formats you'll need to be familiar with out in the "real world." To do this, the course is built around a research project on a social implications topic …

Cs 205: Computer Literacy And Office Automation, Ann Tirpack

Computer Science & Engineering Syllabi

To understand basic computer operations and the principal components of a computer and connected peripheral devices. To understand and examine current operating systems, software utilities, device drivers and application software. To define and understand current storage technology and learn about logical file storage and management.

To become proficient in using:
-Windows XP
-Spreadsheet Applications
-Database Applications
-Presentation Graphics Applications
-To understand the basics of email

Cs 205-08: Computer Literacy And Office Automation, Kim Gros

Computer Science & Engineering Syllabi

To understand basic computer operations and the principal components of a computer and connected peripheral devices. To understand and examine current operating systems, software utilities, device drivers and application software. To define and understand current storage technology and learn about logical file storage and management. To become proficient in using application software categories that are covered in the seven modules. To understand the basics of e-mail. To introduce networking concepts including the Internet and its components and web browser basics. To learn ways to protect your data and avoid computer disasters.

Cs 207: Advanced Office Productivity Ii, Louis A. Benavides

Computer Science & Engineering Syllabi

This course covers post-advanced microcomputer applications including Microsoft Office Word 2003, Microsoft Office Excel 2003, Microsoft Office Access 2003, and Microsoft Office PowerPoint 2003. Topics include: creating an online form; working with macros and Visual Basic for Applications (VBA); working ·with a master document, an index and a table of contents; linking an Excel worksheet and charting its data in Word; formula auditing, data validation, and complex problem solving in Excel; importing data into Excel; working with PivotCharts, PivotTables, and trendlines in Excel; creating a PivotTable List; advanced Access report and form techniques, and creating multi-page forms; administering a database …

Cs 241: Computer Science Ii, L. Jane Lin

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.

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.

Cs 340: Programming Language Workshop In C#, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in C#. You are expected to learn the language and solve a set of programming problems assigned to you using MS Visual Studio .NET. There are no exams. We officially meet only once in the quarter. However, I will be available in the posted office hours for clarifications and discussions about the programming problems.

Cs 784: Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course introduces concepts related to the specification and design of high-level programming languages. It discusses different programming paradigms, algebraic specification and implementation of data types, and develops interpreters for specifying operationally the various programming language features/constructs. It also introduces attribute grammar formalism and axiomatic semantics briefly. The programming assignments will be coded in Scheme.

Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer

Computer Science & Engineering Syllabi

Theory-oriented approach to the application of contemporary algorithms to bioinformatics. Graph theory, complexity theory, dynamic programming and optimization techniques are introduced in the context of application toward solving specific computational problems in molecular genetics.

Traps In Algan/Gan/Sic Heterostructures Studied By Deep Level Transient Spectroscopy, Z-Q. Fang, David C. Look, D. H. Kim, I. Adesida

Physics Faculty Publications

AlGaN/GaN/SiC Schottky barrier diodes (SBDs), with and without Si₃N₄ passivation, have been characterized by temperature-dependent current-voltage and capacitance-voltage measurements, and deep level transient spectroscopy (DLTS). A dominant trap A₁, with activation energy of 1.0 eV and apparent capture cross section of 2×10⁻¹² cm², has been observed in both unpassivated and passivated SBDs. Based on the well-known logarithmic dependence of DLTS peak height with filling pulse width for a line-defect related trap, A₁, which is commonly observed in thin GaN layers grown by various techniques, is believed to be associated with …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 2, October 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Ga-Facilitated Knn Classifier Optimization With Varying Similarity Measures, Michael R. Peterson, Travis E. Doom, Michael L. Raymer

Kno.e.sis Publications

Genetic algorithms are powerful tools for k-nearest neighbors classifier optimization. While traditional knn classification techniques typically employ Euclidian distance to assess pattern similarity, other measures may also be utilized. Previous research demonstrates that GAs can improve predictive accuracy by searching for optimal feature weights and offsets for a cosine similarity-based knn classifier. GA-selected weights determine the classification relevance of each feature, while offsets provide alternative points of reference when assessing angular similarity. Such optimized classifiers perform competitively with other contemporary classification techniques. This paper explores the effectiveness of GA weight and offset optimization for knowledge discovery using knn classifiers with …

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 1, September 2005, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.

Extracting Reduced Logic Programs From Artificial Neural Networks, Jens Lehmann, Sebastian Bader, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Artificial neural networks can be trained to perform excellently in many application areas. While they can learn from raw data to solve sophisticated recognition and analysis problems, the acquired knowledge remains hidden within the network architecture and is not readily accessible for analysis or further use: Trained networks are black boxes. Recent research efforts therefore investigate the possibility to extract symbolic knowledge from trained networks, in order to analyze, validate, and reuse the structural insights gained implicitly during the training process. In this paper, we will study how knowledge in form of propositional logic programs can be obtained in such …

Integrating First-Order Logic Programs And Connectionist Systems - A Constructive Approach, Sebastian Bader, Andreas Witzel, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Significant advances have recently been made concerning the integration of symbolic knowledge representation with artificial neural networks (also called connectionist systems). However, while the integration with propositional paradigms has resulted in applicable systems, the case of first-order knowledge representation has so far hardly proceeded beyond theoretical studies which prove the existence of connectionist systems for approximating first-order logic programs up to any chosen precision. Advances were hindered severely by the lack of concrete algorithms for obtaining the approximating networks which were known to exist: the corresponding proofs are not constructive in that they do not yield concrete methods for building …

Enterprise Applications Of Semantic Web: The Sweet Spot Of Risk And Compliance, Amit P. Sheth

Kno.e.sis Publications

Semantic Web is in the transition from vision and research to reality. In this early state, it is important to study the technical capabilities in the context of real-world applications, and how applications built using the Semantic Web technology meet the real market needs. Beyond push from research, it is the market pull and the ability of the technology to meet real business needs that is a key to ultimate success of any technology. In this paper, we discuss the market of Risk and Compliance which presents unique market opportunity combined with challenging technical requirements. We discuss how the Semantic …

Ontology Learning As A Use-Case For Neural-Symbolic Integration, Pascal Hitzler, Sebastian Bader, Artur Garcez

Computer Science and Engineering Faculty Publications

We argue that the field of neural-symbolic integration is in need of identifying application scenarios for guiding further research. We furthermore argue that ontology learning - as occurring in the context of semantic technologies - provides such an application scenario with potential for success and high impact on neural-symbolic integration.

Introduction And Recovery Of Point Defects In Electron-Irradiated Zno, F. Tuomisto, K. Saarinen, David C. Look, Gary C. Farlow

Physics Faculty Publications

We have used positron annihilation spectroscopy to study the introduction and recovery of point defects in electron-irradiated n -type ZnO. The irradiation ( E_el=2MeV , fluence 6×10¹⁷cm^-2 ) was performed at room temperature, and isochronal annealings were performed from 300 to 600 K. In addition, monochromatic illumination of the samples during low-temperature positron measurements was used in identification of the defects. We distinguish two kinds of vacancy defects: the Zn and O vacancies, which are either isolated or belong to defect complexes. In addition, we observe negative-ion-type defects, which are attributed to O interstitials or …

Peer-To-Peer Discovery Of Semantic Associations, Matthew Perry, Maciej Janik, Cartic Ramakrishnan, Conrad Ibanez, I. Budak Arpinar, Amit P. Sheth

Kno.e.sis Publications

The Semantic Web vision promises an extension of the current Web in which all data is annotated with machine understandable metadata. The relationship-centric nature of this data has led to the definition of Semantic Associations, which are complex relationships between resources. Semantic Associations attempt to answer queries of the form “how are resource A and resource B related?” Knowing how two entities are related is a crucial question in knowledge discovery applications. Much the same way humans collaborate and interact to form new knowledge, discovery of Semantic Associations across repositories on a peer-to-peer network can allow peers to share their …

A Semantic Template Based Designer For Semantic Web Processes, Ranjit Mulye, John A. Miller, Kunal Verma, Karthik Gomadam, Amit P. Sheth

Kno.e.sis Publications

The growing popularity of service oriented computing based on Web services standards is creating a need for paradigms to represent and design business processes. Significant work has been done in the representation aspects with regards to WSBPEL. However, design and modeling of business processes is still an open issue. In this paper, we present a novel designer for business processes, which allows for intuitive modeling of Web processes, as well as using a template based approach for semi-automatically integrating partners either at design time or at deployment time. This work has been done as part of the METEOR-S project, which …

On Embedding Machine-Processable Semantics Into Documents, Krishnaprasad Thirunarayan

Kno.e.sis Publications

Most Web and legacy paper-based documents are available in human comprehensible text form, not readily accessible to or understood by computer programs. Here, we investigate an approach to amalgamate XML technology with programming languages for representational purposes that can enhance traceability, thereby facilitating semiautomatic extraction and update. Specifically, we propose a modular technique to embed machine-processable semantics into a text document with tabular data via annotations, resulting sometimes in ill-formed XML fragments, and evaluate this technique vis a vis document querying, manipulation, and integration. The ultimate aim is to be able to author and extract human-readable and machine-comprehensible parts of …

Faster Owl Using Split Programs, Denny Vrandecic, Pascal Hitzler

Computer Science and Engineering Faculty Publications

Knowledge representation and reasoning on the Semantic Web is done by means of ontologies. While the quest for suitable ontology languages is still ongoing, OWL [5] has been established as a core standard. It comes in three flavours, as OWL Full, OWL DL and OWL Lite, where OWL Full contains OWL DL, which in turn contains OWL Lite. The latter two coincide semantically with certain description logics and can thus be considered fragments of first-order predicate logic.

Cs 240: Computer Science - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. For CS/CEO majors with familiarity of a high-level programming language. Co-requisite: MTH 130 and 131; or MTH 134. 4 credit hours.

Cs 400/600: Data Structures And Software Design, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Cs 466/666: Introduction To Formal Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course introduces the theory of formal languages and automata. The primary focus is on the two methods of defining languages: using generators (e.g., grammars/regular expressions) and using recognizers (e.g., finite state machines). Along with presenting the fundamentals, this course will develop and examine relationships among the various specification methods for the regular languages and the context-free languages, in detail. Overall, we plan to cover the first seven chapters of the text book.

Cs 241: Computer Science Ii, Eric Maston

Computer Science & Engineering Syllabi

This course is the second in the Introduction to Computer Science (24X) series. It focuses on object oriented concepts and an introduction to data structures.

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.

Ceg 720-01: Computer Architecture, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.