Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Wright State University

Discipline
Keyword
Publication Year
Publication
Publication Type

Articles 1291 - 1320 of 1814

Full-Text Articles in Computer Engineering

Cs 790: Special Topics On Image Processing: Algorithms, Languages, And Architectures, Nikolaos Bourbakis Oct 2006

Cs 790: Special Topics On Image Processing: Algorithms, Languages, And Architectures, Nikolaos Bourbakis

Computer Science & Engineering Syllabi

Introduction; Image Processing Operators and Morphology; Image Transformations; Image Processing Languages; Image Coding and Compression;
Image Encryption and Hiding; Digital TV and Video


Cs 214: Object-Based Programming, Eric Maston Oct 2006

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/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer Oct 2006

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. 4 credit hours.


Cs 209: Computer Programming For Business Ii, Dennis Kellermeier Oct 2006

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

No abstract provided.


Cs 466/666: Introduction To Formal Languages, Thomas Sudkamp Oct 2006

Cs 466/666: Introduction To Formal Languages, Thomas Sudkamp

Computer Science & Engineering Syllabi

CS 466/666 is an introduction to formal language and automata theory. In this course we will examine methods for defining syntax of languages and recognizing patterns: the syntax of languages can be defined using grammars and patterns can be recognized by the computations of finite state machines. Along with presenting the fundamentals of these two topics, the course will develop and investigate the relationships between language definition and pattern recognition. The text will be the third edition of Languages and Machines: An Introduction to the Theory of Computer Science.


Cs 400/600: Data Structures And Software Design, Natsuhiko Futamura Oct 2006

Cs 400/600: Data Structures And Software Design, Natsuhiko Futamura

Computer Science & Engineering Syllabi

In this course, students will learn basic data structures and how to design and analyze and implement software. Course covers introduction to the fundamentals of complexity and analysis and study of common problems and solutions using various data structures. After taking this course, students are expected to be able to design reasonable software for problems and estimate (evaluate) the performance of them even without writing the software.


Cs 766: Evolutionary Computation, Mateen M. Rizki Oct 2006

Cs 766: Evolutionary Computation, Mateen M. Rizki

Computer Science & Engineering Syllabi

This course explores evolutionary computation from a historical, theoretical, and application viewpoint. An overview of the most common evolutionary search techniques are presented including genetic algorithms, evolutionary programming, evolutionary strategies, and genetic programming. The fundamental issues driving the choice of problem representation and specific genetic operators are discussed. Various applications of evolutionary computation to problems in control, optimization, and pattern recognition are examined.


Cs 241: Introduction To Computer Science Ii, Praveen Kakumanu Oct 2006

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.


Ceg 360/560 Ee 451/651: Digital System Design, Travis E. Doom Oct 2006

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

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.


Ceg 770: Computer Engineering Mathematics, Yong Pei Oct 2006

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 220: Introduction To C Programming For Engineers I, Ronald F. Taylor Oct 2006

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.


Ceg 210: Pc Networking I, Karen Meyer Oct 2006

Ceg 210: Pc Networking I, Karen Meyer

Computer Science & Engineering Syllabi

Introduction to PC networking hardware, 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 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 260: Digital Computer Hardware Switching Circuits, Meilin Liu Oct 2006

Ceg 260: Digital Computer Hardware Switching Circuits, Meilin Liu

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 434/634: Concurrent Software Design, Natsuhiko Futamura Oct 2006

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 210: Pc Networking I, Chris P. Fickert Oct 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 402/602: Introduction To Computer Communication, Bin Wang Oct 2006

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 255: Introduction To The Design Of Information Technology Systems, Eric Matson Oct 2006

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

Computer Science & Engineering Syllabi

Information systems consist of modern elements such as database systems, networks, multi-platform 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:

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


Ceg 221: Advanced C Programming For Engineers, Robert Helt Oct 2006

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 460/660: Introduction To Software Computer Engineering, John A. Reisner Oct 2006

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 498: Design Experience, Thomas C. Hartrum Oct 2006

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 333: Introduction To Unix, Thomas Wischgoll Oct 2006

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 220: Introduction To C Programming For Engineers I, Robert Helt Oct 2006

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 320/520: Computer Organization And Assembly Language Programming, Travis E. Doom Oct 2006

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

Computer Science & Engineering Syllabi

Terminology and understanding of functional organizations and sequential operation 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, CEG 260.


Ceg 433/633: Operating Systems, Prabhaker Mateti Oct 2006

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.


Cs 242: Introduction To Computer Science Iii, Praveen Kakumanu Oct 2006

Cs 242: Introduction To Computer Science Iii, Praveen Kakumanu

Computer Science & Engineering Syllabi

This is the final course in the three course sequence "Introduction to Computer Science" offered by the Computer Science department, WSU. It focuses on building a number of abstract data types such as stacks, queues, trees and tables. We continue to study the C++ object-oriented concepts such as Inheritance, polymorphism and template handling. We also
start learning to analyze the complexity of algorithms in this course.


Cs 790-02: Statistical Natural Language Processing: Models And Methods, Shaojun Wang Oct 2006

Cs 790-02: Statistical Natural Language Processing: Models And Methods, Shaojun Wang

Computer Science & Engineering Syllabi

This course is designed to introduce students to the current statistical techniques for the automatic analysis of natural (human) language data. It develops an in-depth understanding of both the algorithms available for the processing of linguistic information and the underlying computational properties of natural languages. Potential topics include language modeling, finite state models, stochastic grammars, latent semantic analysis, log-linear models in natural language processing. We will explore how these core techniques can be applied to user applications such as information extraction, question answering, automatic speech recognition, statistical machine translation.


Cs/Mth 316/516: Numerical Methods For Digital Computers - I, Ronald F. Taylor Oct 2006

Cs/Mth 316/516: Numerical Methods For Digital Computers - I, Ronald F. Taylor

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences. Methods of interpolation, data smoothing, functional approximation, numerical differentiation and integration. Solution techniques for linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications to engineering, science, and applied mathematics are an integral part of the course. Special topics presented as schedule permits. 4 credit hours.


Cs 705: Introduction To Data Mining, Guozhu Dong Oct 2006

Cs 705: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel knowledge from large amounts of data. This course introduces and studies the concepts, issues, tasks and techniques of data mining. Topics include data preparation and feature selection, association rules, classification, clustering, evaluation and validation, scalability, spatial and sequence mining, privacy, and data mining applications. 3 hours lecture, 2 hours lab.


Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp Oct 2006

Cs 410/610: Theoretical Foundations Of Computing, Thomas Sudkamp

Computer Science & Engineering Syllabi

This course is an introduction to one of the fundamental topics in the theory of computer science: computability theory. Computability theory is concerned with determining whether there is an algorithmic solution to a problem. The study of computability uses the Turing machine as the basic computational model. A Turing machine is a random access, read-write, finite state automaton. Although the Turing machine provides a simple computational framework, the Church-Turing thesis asserts that any problem that can be solved in any algorithmic manner can be solved by a Turing machine.