Physical Sciences and Mathematics Commons^™

Cs 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modem 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.

Cs 405/605: Introduction To Database Management Systems, Kenneth Melendez

Computer Science & Engineering Syllabi

Survey of logical and physical aspects of database management systems. Entity Relationship, relational, object-oriented models for databases are presented. Physical Implementation methods are discussed.

Ceg 260-01: Introduction To Digital Hardware, Michael Wier

Computer Science & Engineering Syllabi

This course will introduce the concepts used in designing digital systems.
Number systems, Boolean algebra, logic minimization, combinational and sequential digital circuits will be covered.

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

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 429/629-01: Internet Security, Prabhaker Mateti

Computer Science & Engineering Syllabi

Introduction to security issues arising primarily from computer networks. Topics include node and service authentication, address spoofing, hijacking, SYN floods, smurfing, sniffing, routing tricks, and privacy of data en route. Buffer overruns and other exploitation of software development errors. Hardening of operating systems. Intrusion detection. Firewalls. Ethics. Prerequisites:

Ceg 221-01: 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 220-01: Introduction To C Programming For Engineers, 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).

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 6, April 2006, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

A Comparative Analysis Of Air-To-Ground Engagement Outcomes In The Joint Warfare System (Jwars) And The Jwars-Joint Semi-Automated Forces Federation, Melissa Anne St. Peter

Computational Modeling & Simulation Engineering Theses & Dissertations

Multi-resolution modeling is the process by which a single model is created by connecting multiple individual models to describe phenomena at different levels of resolution [1]. "When we change resolutions, replacing a detailed model by a more aggregate one, we must ask whether results are 'consistent'" [2].

There are many methods of determining if the results of two simulations are 'consistent'. However, they are very entailed and require a detailed understanding of the individual models including their functionality, algorithms, and inner workings. A straight forward and rapid way of assessing potential inconsistencies is through a statistical comparison of the model …

A Multilane Pipelined Architecture For Real Time Enhancement Of Color Video Streams, Adam Redd Livingston

Electrical & Computer Engineering Theses & Dissertations

Video stream enhancement is a key fixture in a wide variety of applications from video surveillance, automatic navigation, medical imagery, to facial/object recognition systems. When a video stream contains non-uniform lighting it can be difficult to obtain what is in the darker regions without over enhancing brighter regions. The Adaptive and Integrated Neighborhood Dependant Approach for Nonlinear Enhancement (AINDANE) algorithm combines a tunable nonlinear transfer function, convolution by a multi-scale Gaussian kernel, and tunable contrast enhancement to address this problem for a single image. Luminance values are tuned based on the global cumulative distribution function (CDF) of an image. Contrast …

Mobius: An Omnidirectional Robotic Platform And Software Architecture For Network Teleoperation, Samuel Aaron Miller

Electrical & Computer Engineering Theses & Dissertations

The following thesis presents the results of a project to develop and test an omnidirectional robotic system (hardware and software) at NASA Langley Research Center's Robotics and Intelligent Machines Lab. The impetus for the project was the unique capabilities of omnidirectional systems. Some of the many potential benefits these systems have include improved material-handling capabilities in constrained environments (such as might be found in extraterrestrial manned habitats), efficient camera-based vehicle teleoperation, and simplified route planning for autonomous robot operations.

The project's focus was to design, build, and test a system that used Mecanum wheels to achieve omnidirectional motion. In addition …

Tuqr: A Topology Unaware Qos Routing Protocol For Manets, Ibrahim Zagli

Electrical & Computer Engineering Theses & Dissertations

In this thesis, the main purpose is to design a new Quality of Service (QoS) Routing Protocol for Mobile ad-hoc Networks that improves packet delivery ratio in QoS constrained communication in comparison to current well known protocols by using distributed multi-path routing. To accomplish that, a new approach to the QoS routing in Mobile ad hoc Networks (MANET) is developed to reduce the effects of the distrustful environment of MANET by keeping a number of suitable paths as high as possible and distributing the decision mechanism among the nodes on the path.

In most current protocols that mainly evaluate and …

Reversing Ticket Based Probing (Rtbp) Routing For Manet, Turgut Yucel

Electrical & Computer Engineering Theses & Dissertations

The delay-constrained maximum-bandwidth routing problem in MANET (Mobile Ad hoc Networks) is to find the maximum bandwidth path which satisfies a given delay constraint. The research challenge for this problem is that the networking information used for routing may be imprecise. The Ticket-Based Probing (TBP) routing algorithm provides a heuristic approach by using two types of ticket. In this thesis a Reversing Ticket-based Probing (RTBP) routing algorithm is proposed. The RTBP has two novel features compared to the original ticket based probing algorithms. The first feature is using just one type ticket, instead of two types of ticket. RTBP generates …

The Reliability Of The Computer Communication Networks Including Mobile Nodes, Sahin Yasar

Electrical & Computer Engineering Theses & Dissertations

The wireless computer networks have an uncertainty in their structures aside from their big advantages for the users. The environmental conditions, changing locations of the mobile hosts and the changing components in the system can easily affect their reliability. In order to know a system capability performing its functions, keep the reliability at a certain level and/or detect the deficiency of the system, it is necessary to analyze the reliability of a computer communication network including the wired and wireless parts. But the above reasons also make the analysis and a unique solution difficult so a set of algorithms is …

Post Register Allocation Spill Code Optimization, Christopher Lupo, Kent Wilken

Computer Science and Software Engineering

A highly optimized register allocator should provide an efficient placement of save/restore code for procedures that contain calls. This paper presents a new approach to placing callee-saved save and restore instructions that generalizes Chow's shrink-wrapping technique (Chow 1988). An efficient, profile-guided, hierarchical spill code placement algorithm is used to analyze the structure of a procedure to calculate the minimum dynamic execution count locations to place callee-saved save and restore code. The algorithm is implemented in the Gnu Compiler Collection and has been tested on the SPEC CPU2000 Integer Benchmark suite. Results show that the technique reduces the number of dynamic …

An Adaptable Energy-Efficient Medium Access Control Protocol For Wireless Sensor Networks, Justin T. Kautz

Theses and Dissertations

Wireless networks have become ubiquitous recently and therefore their usefulness has also become more extensive. Wireless sensor networks (WSN) detect environmental information with sensors in remote settings. One problem facing WSNs is the inability to resupply power to these energy-constrained devices due to their remoteness. Therefore to extend a WSN's effectiveness, the lifetime of the network must be increased by making them as energy efficient as possible. An energy efficient medium access control (MAC) can boost a WSN's lifetime. This research creates a MAC protocol called Adaptive sensor Medium Access Control (AMAC) which is based on Sensor Medium Access Control …

Threading And Autodocumenting News Videos: A Promising Solution To Rapidly Browse News Topics, Xiao Wu, Chong-Wah Ngo, Qing Li

Research Collection School Of Computing and Information Systems

This paper describes the techniques in threading and autodocumenting news stories according to topic themes. Initially, we perform story clustering by exploiting the duality between stories and textual-visual concepts through a co-clustering algorithm. The dependency among stories of a topic is tracked by exploring the textual-visual novelty and redundancy of stories. A novel topic structure that chains the dependencies of stories is then presented to facilitate the fast navigation of the news topic. By pruning the peripheral and redundant news stories in the topic structure, a main thread is extracted for autodocumentary

Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, Volume 22, Number 5, February 2006, College Of Engineering And Computer Science, Wright State University

BITs and PCs Newsletter

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

Adaptive Beam Director For A Tiled Fiber Array, Mikhail Vorontsov, Jim F. Riker, Ernst Polnau, Svetlana Lachinova, Venkata S. Rao Gudimetla

Electrical and Computer Engineering Faculty Publications

We present the concept development of a novel atmospheric compensation system based on adaptive tiled fiber array architecture operating with target-in-the-loop scenarios for directed beam applications. The adaptive tiled fiber array system is integrated with adaptive beam director (ABD). Wavefront control and sensing functions are performed directly on the beam director telescope primary mirror. The beam control of the adaptive tiled fiber array aims to compensate atmospheric turbulence-induced dynamic phase aberrations and results in a corresponding brightness increase on the illuminated extended object. The system is specifically designed for tiled fiber system architectures operating in strong intensity scintillation and speckle-modulation …

Cs 790-01: Introduction To Parallel Algorithms, Natsuhiko Futamura

Computer Science & Engineering Syllabi

Low-cost parallel computers such as PC clusters are becoming available, and many previously unsolvable problems can be solved using such computers. However, designing algorithms that perform well on parallel computers is often challenging. The focus of this course is on learning how to design algorithms for parallel computers and how to evaluate them.

Cs 141-01: 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. 4 credit hours. Prerequisite: MTH 127 (College Algebra) or equivalent.

Cs 208-01: Computer Programming For Business I, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 208 is the first of a two quarter sequence in programming for business students. It is required for Management Information Science majors. The courses are designed to help students achieve a high degree of facility in intermediate level programming. This course assumes students have never written a program before.

Cs 240-01: Introduction To Computer Science I, L. Jane Lin

Computer Science & Engineering Syllabi

This course is the first in the three course sequence "Introduction to Computer Science" offered by the Computer Science department at WSU. This course presents a general introduction to C++ programming language. It introduces the fundamental capabilities of C++ language as a problem solving tool. Topics include data representation, debugging and program verification.

Cs 214-01: Visual Basic.Net, Roddy Keish

Computer Science & Engineering Syllabi

No abstract provided.

Cs 241-01: 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 241-01: Computer Science Ii, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

Cs 242-01: Introduction To Computer Science Iii, Eric Maston

Computer Science & Engineering Syllabi

This is the third and final course in the Introduction to Computer Science series. This course focuses on data structures with abstract data types, such as trees, stacks, queues, and tables.

Cs 340-01: Programming Language Workshop In Java, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is designed as a self-study in Java. You are expected to work independently to learn the Java language and solve a set of programming problems assigned to you using latest Java SDK available at http://java.sun.com or other software as approved by the instructor. There are no exams. We officially meet only once in a quarter. However, I will be available in the posted office hours for clarifications and general discussion of the programming assignments. Do not expect support in debugging badly documented code.

Cs 302-01: Client Server Databases, Karen Meyer

Computer Science & Engineering Syllabi

No abstract provided.

Cs 340-01: 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.