Computer Engineering Commons^™

Cs 240: Introduction To Computer Science I, Mateen M. Rizki

Computer Science & Engineering Syllabi

No abstract provided.

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 levelprogramming. This course assumes students have never written a program before.

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 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 701: Database Systems And Design I, Guozhu Dong

Computer Science & Engineering Syllabi

An introduction to database design, database system implementation issues and techniques, and advanced data models.

Cs 499/699: 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, and data mining applications. This course is designed for senior year undergraduate students and graduate students. 3 hours lecture, 2 hours lab.

Ceg 476/676-01: Computer Graphics I, Lyubomir Zagorchev

Computer Science & Engineering Syllabi

An introduction to 2-D and 3-D computer graphics and their OpenGL implementations.

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.

Ceg 320/520: Computer Organization And Assembly Language Programming, Jennifer White 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 passing, arithmetic operations, traps, and input/output. Macros, modularization, linkers, and debuggers are used.

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

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 333: Introduction To Unix, Bin Wang

Computer Science & Engineering Syllabi

This is a 2 credit hour course that has 10 50-minute lectures and I 0 50-minute Jab sessions. Introduction to the use of Unix and Unix tools as a problem-solving environment. Emphasis on the shell, files and directories, editing files, user process management, compiling, and debugging.

Cs 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 of interest to engineering, science, and applied mathematics students are an integral part of the course. Special topics presented as schedule permits.

Cs 400/600: Data Structures And Software Design, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

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

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.

Cs 205: Computer Literacy And Office Automation, Terri Bauer

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 480/680: Comparative Languages, Michael T. Cox

Computer Science & Engineering Syllabi

"Comparative Languages" is a graduate/undergraduate level introductory course in programming languages. We will cover several basic topics ranging from syntax (BNF) and semantics formalisms (attribute grammars), to data types, scope and extent, type checking, parameter passing methods, expression parsing and other fundamentals of programming languages and language development. The intent of the course is to provide a background in the concepts and constructs of languages, rather than simply providing just a survey of various computer languages. Nonetheless in this class, we will learn and program in three very different languages: Pascal (an imperative language), Java (an object-oriented language), and LISP …

Ceg 429/629: 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.

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 …

Bottleneck Analysis Of Cports, Sreekalyana Chakravarthy Kajuluri

Electrical & Computer Engineering Theses & Dissertations

CPortS is a transportation logistics simulation that models the flow of military cargo through a seaport and the interaction of the cargo with the port resources and infrastructure. It provides information about the seaport's capabilities, how the cargo has been handled, how many days the cargo took to clear a particular port area, and the overall throughput of the seaport. The model is highly data intensive since it models the huge traffic in a real seaport.

Bottlenecks reduce system performance. Systems that are traffic intensive or simulations of systems, which are data intensive, encounter bottlenecks, which reduce their performance. In …

An Algorithm For Locating Fundamental Frequency (F0) Markers In Speech, Princy Dikshit

Electrical & Computer Engineering Theses & Dissertations

Speech has been the principal form of human communication since it began to evolve at least one hundred thousand years ago. Speech is produced by vibrations of the vocal cords. The rate of vibration of the cords is called fundamental frequency (F0) or pitch. The objective of this thesis is to locate pitch period cycles on a cycle-by-cycle basis. The complexity in identifying pitch cycles stems from the highly irregular nature of human speech. Dynamic programming is used to combine two sources of information for pitch period marking. One source of information is the "local" information corresponding to the location …

Huffman Approach To Opcode Compression, Jason B. Shreve

Electrical & Computer Engineering Theses & Dissertations

Instructions are the building blocks of computer programs. They are composed of opcodes, which uniquely identify each instruction, and the operands or data. In most architectures, the instruction length is a set multiple of the word size. The size and number of operands vary by instruction. Due to programmer usage, program need, or compiler design, opcodes do not occur with a constant distribution. Likely, some opcodes occur very frequently, whereas others occur very infrequently or not at all. If the length of an opcode were representative of its frequency, compression in program size might be achieved.

This thesis is an …

Vector Operations In Superscalar Architectures, Nathan Daniel Flinn

Electrical & Computer Engineering Theses & Dissertations

Vector calculations are very prevalent today. Though the vector-processing computer is quite an old concept, superscalar processors lack hardware support for vector operations. This thesis investigates whether an ordinary superscalar computer architecture can be designed to include hardware support for improved vector operations without drastically changing the existing superscalar design and behavior. A computer architecture design was created and implemented that included the vector multiply (dot product) operation. The design includes a Vector Operations Unit that captures incoming vector operations and generates the necessary set of machine instructions to complete the vector operation internally. It then delivers these instructions to …

Hierarchical Hybrid Multicast An End System Multicast Algorithm Approach, Guillermo Loaisiga

Electrical & Computer Engineering Theses & Dissertations

Due to the rapid development in the computer and communication technologies, the Internet is experiencing an increasing demand of high-speed, real-time distributed applications, such as live streaming multimedia, videoconferencing, distributed simulations, and multiparty games. Multicast is an efficient transmission mechanism to support these applications. Historically, IP Multicast (IPM) has provided multicast support with well-known benefits, especially in bandwidth savings. However, it has experienced little deployment due to economic and architectural limitations.

Overlay multicast holds promise for the implementation of large scale Internet multicast services. An overlay network is a virtual topology constructed on top of the Internet infrastructure. This concept …

2004 (Fall) Ensi Informer Magazine, Morehead State University. Engineering Sciences Department

ENSI Informer Magazine Archive

The ENSI Informer Magazine published in the fall of 2004.

Micro-Switches With Sputtered Au, Aupd, Au-On-Aupt, And Auptcu Alloy Electric Contacts, Ronald A. Coutu Jr., P. E. Kladitis, R. Cortez, R. E. Strawser, Robert L. Crane

Electrical and Computer Engineering Faculty Research and Publications

This work is the first to report on a new analytic model for predicting micro-contact resistance and the design, fabrication, and testing of microelectromechanical systems (MEMS) metal contact switches with sputtered bi-metallic (i.e. gold (Au)-on-Au-platinum (Pt), (Au-on-Au-(6%)Pt)), binary alloy (i.e. Au-palladium (Pd), (Au-(2%)Pd)), and tertiary alloy (i.e. Au-Pt-copper (Cu), (Au-(5%)Pt-(0.5%)Cu)) electric contacts. The micro-switches with bi-metallic and binary alloy contacts resulted in contact resistance between 1-2 /spl Omega/ and, when compared to micro-switches with sputtered Au electric contacts, exhibited a 3.3 and 2.6 times increase in switching lifetime, respectively. The tertiary alloy exhibited a 6.5 times increase in switch lifetime …

A Comparison Of Micro-Switch Analytic, Finite Element, And Experimental Results, Ronald A. Coutu Jr., P. E. Kladitis, Lavern A. Starman, J. R. Reid

Electrical and Computer Engineering Faculty Research and Publications

Electrostatically actuated, metal contact, micro-switches depend on having adequate contact force to achieve desired, low contact resistance. In this study, higher contact forces resulted from overdriving cantilever beam style switches, after pull-in or initial contact, until the beam collapsed onto the drive or actuation electrode. The difference between initial contact and beam collapse was defined as the useful contact force range. Micro-switch pull-in voltage, collapse voltage, and contact force predictions, modeled analytically and with the CoventorWare finite element software package, were compared to experimental results. Contact resistance was modeled analytically using Maxwellian spreading resistance theory. Contact resistance and contact …

Techniques And Patterns For Safe And Efficient Real-Time Middleware, Angelo Corsaro

All Computer Science and Engineering Research

Over 90 percent of all microprocessors are now used for real-time and embedded applications. The behavior of these applications is often constrained by the physical world. It is therefore important to devise higher-level languages and middleware that meet conventional functional requirements, as well as dependably and productively enforce real-time constraints. Real-Time Java is emerging as a safe, real-time environment. In this thesis we use it as our experimentation platform; however, our findings are easily adapted to other similar platforms. This thesis provides the following contributions to the study of safe and efficient real-time middleware. First, it identifies potential bottlenecks and …

Tcp Processor: Design, Implementation, Operation, And Usage, David V. Schuehler

All Computer Science and Engineering Research

There is a critical need to perform advanced data processing on network traffic. In order to accom-plish this, protocol processing must first be performed to reassemble individual network packets into consistent data streams representing the exact dataset being transferred between end systems. This task is currently performed by protocol stacks running on end systems. Similar protocol processing opera-tions are needed to process the data on the interior of the network. Given millions of network connections operating on multi-gigabit per second network links, this task is extremely difficult. The TCP-Processor addresses this challenge. It is a hardware circuit designed to perform …

A Model Of Computer Science Graduate Admissions Decisions, Nigel Ward

Departmental Technical Reports (CS)

Potential applicants to graduate school find it difficult to predict, even approximately, which schools will accept them. We have created a predictive model of admissions decision-making, packaged in the form of a web page that allows students to enter their information and see a list of schools where they are likely to be accepted. This paper discusses the design of the model and the way its parameters were estimated. Interesting points include the way that weights are assigned dynamically to various factors based on the informativeness of each factor and on the applicant's relative strengths on each factor.

Exact Bounds On Finite Populations Of Interval Data, Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpre, Monica Aviles

Departmental Technical Reports (CS)

In this paper, we start research into using intervals to bound the impact of bounded measurement errors on the computation of bounds on finite population parameters ("descriptive statistics"). Specifically, we provide a feasible (quadratic time) algorithm for computing the lower bound on the finite population variance function of interval data. We prove that the problem of computing the upper bound on the finite population variance function of interval data is, in general, NP-hard. We provide a feasible algorithm that computes this upper bound under reasonable easily verifiable conditions, and provide preliminary results on computing other functions of finite populations.