Computer Engineering Commons^™

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 434/634-01: Concurrent Software Design, Paul Bender

Computer Science & Engineering Syllabi

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

Ceg 355-01: Introduction To The Design Of Information Technology Systems, Thomas C. Hartrum

Computer Science & Engineering Syllabi

Introduction to the design of information systems comprising modem technologies such as SQL database programming, networks, and distributed computing with CORBA, electronic and hypertext (HTML) documents, and multimedia.

Ceg 725-01: Computer Vision Ii, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 790-01: Medical Image Analysis, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 416-01: Matrix Computations, Ronald F. Taylor

Computer Science & Engineering Syllabi

This course is a survey of numerical methods in linear algebra for application to problems in engineering and the sciences. Emphasis is on using modern software tools on high performance computing systems. This course covers the mathematics of linear equations, eigenvalue problems, singular value decomposition, and least squares. Material covered will be relevant to applications areas such as structural analysis, heat transfer, neural networks, mechanical vibrations, and image processing in biomedical engineering. A familiarity with MATLAB is useful, and the ability to program in languages such as CIC++ or Fortran is very important. A basic knowledge of matrix algebra is …

Ceg 790-01: Introduction To Scientific Visualization, Thomas Wischgoll

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 355-01: Introduction To The Design Of Information Technology Systems, Thomas C. Hartrum

Computer Science & Engineering Syllabi

Introduction to the design of information systems comprising modem technologies such as SQL database programming, networks, and distributed computing with CORBA, electronic and hypertext (HTML) documents, and multimedia.

Cs 206-01: Advanced Concepts/Techniques And Software Productivity Tools, John P. Herzog

Computer Science & Engineering Syllabi

By the end of this course, the students will have a greater depth of understanding in the areas of word processing, spreadsheets, databases, and presentation software and web design using Microsoft Word, Microsoft SharePoint, Microsoft Excel, Access, and PowerPoint covering the following topics.

Microsoft Excel 2007:
Tutorial 4: Creating loan information
Chapter 5: Working with lists, Working with Logical Functions
Chapter 6: Working with Multiple Worksheets and Workbooks, Database Functions, and Filtering, and Integrating Excel with Other Window Programs
Microsoft Access 2007:
Chapter 5: Enhancing a Table's Design, and Creating Advanced Queries Chapter 6: Creating Custom Forms Chapter 7: Creating …

Ceg 320/520-01: Computer Organization, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 460/660-01: Introduction To Software Computer Engineering, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course is concerned with the techniques of designing and constructing large programs. Some of the required basic concepts necessarily have to be developed using small programs as examples. To this extent, we also study programming-in-the-small. The overall objectives are to present an overview of issues in the development of software, to discuss terminology, to illustrate via example case studies, and to give sufficiently detailed advice on how to develop quality software. Hands-on experience is emphasized through the use of homework and a class project.

Ceg 498-01: 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 journal and on the quality of their collective efforts as reflected in group generated products.

Ceg 260-01: 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 477/677-01: Computer Graphics Ii, Thomas Wischgoll

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 233-01: Linux And Windows, Prabhaker Mateti

Computer Science & Engineering Syllabi

Introduction to Linux and Windows systems. GUI and Windowing Systems. Files and Directories. Ownership and Sharing. Programs and Processes. System calls, Libraries. Loading. Dynamic linking. Command Line Shells. Scripting languages. Regular expressions. Clients and Servers. Web browser clients and servers. Secure shell, sftp. SSL/TSL. HTTPS. System Administration. 4 credit hours. 3 hours lectures, 2 hours labs.

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 480/680-01: Comparative Programming Languages, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Evolutionary Methodology For Optimization Of Image Transforms Subject To Quantization Noise, Michael Ray Peterson

Browse all Theses and Dissertations

Lossy image compression algorithms sacrifice perfect imagereconstruction in favor of decreased storage requirements. Modelossy compression schemes, such as JPEG2000, rely upon the discrete wavelet transform (DWT) to achieve high levels of compression while minimizing the loss of information for image reconstruction. Some compression applications require higher levels of compression than those achieved through application of the DWT and entropy coding. In such lossy systems, quantization provides high compression rates at the cost of increased distortion. Unfortunately, as the amount of quantization increases, the performance of the DWT for accurate image reconstruction deteriorates. Previous research demonstrates that a genetic algorithm can …

A Framework To Support Spatial, Temporal And Thematic Analytics Over Semantic Web Data, Matthew Steven Perry

Browse all Theses and Dissertations

Spatial and temporal data are critical components in many applications. This is especially true in analytical applications ranging from scientific discovery to national security and criminal investigation. The analytical process often requires uncovering and analyzing complex thematic relationships between disparate people, places and events. Fundamentally new query operators based on the graph structure of Semantic Web data models, such as semantic associations, are proving useful for this purpose. However, these analysis mechanisms are primarily intended for thematic relationships. This dissertation proposes a framework built around the RDF data model for analysis of thematic, spatial and temporal relationships between named entities. …

Algorithmic Techniques Employed In The Isolation Of Codon Usage Biases In Prokaryotic Genomes, Douglas W. Raiford Iii

Browse all Theses and Dissertations

While genomic sequencing projects are an abundant source of information for biological studies ranging from the molecular to the ecological in scale, much of the information present may yet be hidden from casual analysis. One such information domain, trends in codon usage, can provide a wealth of information about an organism's genes and their expression. Degeneracy in the genetic code allows more than one triplet codon to code for the same amino acid, and usage of these codons is often biased such that one or more of these synonymous codons is preferred. Isolation of translational efficiency bias can have important …

Energy Efficient Image Video Sensor Networks, Paul Anthony Bender

Browse all Theses and Dissertations

Image Video Sensor Networks are emerging applications for sensor network technologies. The relatively large size of the data collected by image video sensors presents new challenges for the sensor network in terms of energy consumption and channel capacity. We address each of these issues through the use of a high density network deployment utilizing some nodes as dedicated relay nodes.

A high density network allows network nodes to reduce their transmission power. This reduction in transmission power allows each node to conserve power and simultaneously increases the potential for spatially concurrent transmissions within the network, resulting in improved network throughputs. …

Transformation Of Object-Oriented Associations And Embedded References To Them, Sneha Swamy

Browse all Theses and Dissertations

AFIT Wide Spectrum Object Modeling Environment (AWSOME) automatically generates executable code by applying transforms to the formal specifications developed from the domain knowledge. AWSOME uses the specification language called as AFIT Wide Spectrum Language (AWL). All the transforms developed for AWSOME depend on and manipulate Abstract Syntax Trees (ASTs) created by parsing the formal specifications of a model. The main idea is to speed the process of creating error free code, to aid reusability of code and also to make the maintenance changes to be consistent and correct. The AWSOME metamodel contains the structural (object) model, the functional (operations) model …

Two Dimensional Localization Of Passive Uhf Rfid Tags, Bhavik Contractor

Browse all Theses and Dissertations

The advent of GPS has redefined the need of a positioning system in today*#8217;s ubiquitous computing world. While GPS works satisfactorily and is quite a norm in an outdoor environment, it fails to work indoors due to the inherent complexity of an indoor environment. There is an ever increasing need to develop an indoor positioning system and a lot of research has been done to solve the problem of indoor localization. These solutions differ on the basis of cost, dependency on environment, line of sight requirements and so on.

Passive RFID (Radio Frequency Identification) tags pose an interesting solution to …

Ceg 220: Introduction To C Programming For Engineers I, Jay Dejongh

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 405/605: Introduction To Database Management Systems, Soon M. Chung

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.

Cs 240: Computer Programming I, Dale E. Nelson

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. Prerequisite: MTH 130 or MPL 5.

Cs 400/600: Computer Science, Eric Maston

Computer Science & Engineering Syllabi

This is the initial course in the understanding of data structures. This course focuses on data structures with abstract data types, such as trees, stacks, queues and graphs. The course will use projects, developed on UNIX, to create a deeper understanding of data structure and their use.

Cs 466/666: Introduction To Formal Languages, Guozhu Dong

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 accepted by 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, by Thomas Sudkamp.

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