Computer Engineering Commons^™

Ceg 360/560-01: 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 433/633-01: 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.

Ceg 434/634-01: Concurrent Software Design, Yong Pei

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 course projects and through readings on operating system design.

Ceg 211-01: Pc Networking Ii, Karen Meyer

Computer Science & Engineering Syllabi

The goal of this course is to prepare students for the real-world challenges of a networking professional. It is designed for students interested in network and server administration. . The text includes extensive hands-on projects, exercises, and review questions in each chapter, which reinforce Microsoft Windows Server 2003 network administration skills as they are learned. Case projects at the end of each chapter allow students to take on the role of a network administrator, making decisions and troubleshooting real-life problems. Specific topic coverage includes: network administration and management, administering active directory, managing group policy, administering file resources, administering web resources …

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: Team Projects I And Ii, John C. Gallagher

Computer Science & Engineering Syllabi

CEG 498 (Team Projects I and II) is a summative computer engineering design project course that builds upon previous engineering, science, mathematics and c01mnunications 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 720-01: Computer Architecture I, Soon M. Chung

Computer Science & Engineering Syllabi

Review of sequential computer architecture and study of parallel computers. Topics include memory hierarchy, reduced instruction set computer, pipeline processing, multiprocessing, various parallel computers, interconnection networks, and fault-tolerant computing. 3 hours lecture and 2 hours lab.

Ceg 724-01: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course covers basic techniques for low-level and some mid-level vision processes. The techniques include: camera geometry, image filtering and edge detection, color and texture analysis, image segmentation, image matching, motion analysis, and stereo depth perception.

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.

Ceg 463/663-01: The Personal Software Development Process, John A. Reisner

Computer Science & Engineering Syllabi

In this course, you will learn about more about one particular way to address some of the challenges and issues associated with successful software development. Specifically, you will learn and use the Personal Software Process (PSP), designed to help individual software practitioners become more adept at their craft through the use of project planning, project tracking, defect analysis, review and verification activities, software measurement, and process management. This course--and the PSP-are somewhat unique in that they aim to help software engineers become more successful, not by examining issues associated with large-scale development (as is the case with many software engineering …

Ceg 453/653-01: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Cs 206: 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 FrontPage, Microsoft Excel, Access, and PowerPoint covering the following topics.
Microsoft Excel 2003:
Tutorial 5: Working with Excel Lists
Tutorial 6: Working with Multiple Worksheets and Workbooks Tutorial 7: Working with
Excel's Editing and Web Tools Tutorial 8: Developing an Excel Application Appendix A:
Working with Logical Functions, Database Functions, and Advanced Filtering Appendix B:
Integrating Excel with Other Window Programs
Microsoft Access 2003:
Tutorial 5: Enhancing …

Ceg 210-01: 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.

Ceg 402/602-01: 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, Jabs, 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.

Cs 240: Computer Programming I, L. Jane Lin

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced. Emphasis is on structured programming and stepwise refinement. Note: Concurrent registration into CS 240L is required.

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.

Cs 840: Advanced Topics In The Theory Of Computation, Thomas Sudkamp

Computer Science & Engineering Syllabi

No abstract provided.

Cs 241: Introduction To Computer Science Ii, Haiyun Bian

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. Concepts introduced in CS 240 are developed in greater detail and depth with the Java programming language. Topics include object oriented programming, basic sorting algorithms, recursion, graphics, development of user interfaces and exception handling. Student must register for one lecture section and one lab section.

Cs 209: Computer Programming For Business Ii, Dennis Kellermeier

Computer Science & Engineering Syllabi

CS 209 is the second 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.

Performance Analysis Of Ieee 802.11b Devices In The Presence Of Interference Aware Scheduling-Adaptive Frequency Hopping Enabled Bluetooth Devices, Deepthi Gopalpet

Electrical & Computer Engineering Theses & Dissertations

Wireless Local Area networks (WLAN) and Wireless Personal Area Networks (WPAN) provide complimentary services using the same unlicensed radio frequency band of operation. The 802.11b WLAN operates in the 2.4 GHz band and uses a Direct Sequence Spread Spectrum technique. It is designed to cover large areas ranging up to 100 meters in diameter, which may connect hundreds of computers. Bluetooth (BT) WPAN also operates in the same frequency band as the IEEE 802.lib and it uses a Frequency Hopping Spread Spectrum technique. BT is primarily used for communications between notebooks, palm units and other personal computing devices within relatively …

Social Network Structures In Open Source Software Development Teams, Y. Long, Keng Siau

Research Collection School Of Computing and Information Systems

Drawing on social network theories and previous studies, this research examines the dynamics of social network structures in open source software (OSS) teams. Three projects were selected from SourceForge.net in terms of their similarities as well as their differences. Monthly data were extracted from the bug tracking systems in order to achieve a longitudinal view of the interaction pattern of each project. Social network analysis was used to generate the indices of social structure. The finding suggests that the interaction pattern of OSS projects evolves from a single hub at the beginning to a corel periphery model as the projects …

Use Of Tabu Search In A Solver To Map Complex Networks Onto Emulab Testbeds, Jason E. Macdonald

Theses and Dissertations

The University of Utah's solver for the testbed mapping problem uses a simulated annealing metaheuristic algorithm to map a researcher's experimental network topology onto available testbed resources. This research uses tabu search to find near-optimal physical topology solutions to user experiments consisting of scale-free complex networks. While simulated annealing arrives at solutions almost exclusively by chance, tabu search incorporates the use of memory and other techniques to guide the search towards good solutions. Both search algorithms are compared to determine whether tabu search can produce equal or higher quality solutions than simulated annealing in a shorter amount of time. It …

Hardware Virtualization Applied To Rootkit Defense, Douglas P. Medley

Theses and Dissertations

This research effort examines the idea of applying virtualization hardware to enhance operating system security against rootkits. Rootkits are sets of tools used to hide code and/or functionality from the user and operating system. Rootkits can accomplish this feat through using access to one part of an operating system to change another part that resides at the same privilege level. Hardware assisted virtualization (HAV) provides an opportunity to defeat this tactic through the introduction of a new operating mode. Created to aid operating system virtualization, HAV provides hardware support for managing and saving multiple states of the processor. This hardware …

Implementation And Optimization Of The Advanced Encryption Standard Algorithm On An 8-Bit Field Programmable Gate Array Hardware Platform, Ryan J. Silva

Theses and Dissertations

The contribution of this research is three-fold. The first is a method of converting the area occupied by a circuit implemented on a Field Programmable Gate Array (FPGA) to an equivalent as a measure of total gate count. This allows direct comparison between two FPGA implementations independent of the manufacturer or chip family. The second contribution improves the performance of the Advanced Encryption Standard (AES) on an 8-bit computing platform. This research develops an AES design that occupies less than three quarters of the area reported by the smallest design in current literature as well as significantly increases area efficiency. …

Using Concept Maps To More Efficiently Create Intelligence Information Models, Christopher E. Coryell

Theses and Dissertations

Information models are a critical tool that enables intelligence customers to quickly and accurately comprehend U.S. intelligence agency products. The Knowledge Pre-positioning System (KPS) is the standard repository for information models at the National Air and Space Intelligence Center (NASIC). The current approach used by NASIC to build a KPS information model is laborious and costly. Intelligence analysts design an information model using a manual, butcher-paper-based process. The output of their work is then entered into KPS by either a single NASIC KPS "database modeler" or a contractor (at a cost of roughly $100K to the organization). This thesis proposes …

On-Demand Key Distribution For Mobile Ad-Hoc Networks, Daniel F. Graham

Theses and Dissertations

Mobile ad-hoc networks offer dynamic portable communication with little or no infrastructure. While this has many benefits, there are additional shortcomings specific to wireless communication that must be addressed. This research proposes gossip-based on-demand key distribution as a means to provide data encryption for mobile ad-hoc networks. This technique uses message keys to avoid encrypting and decrypting a message at every node. Other optimizations used include secure channel caching and joint rekey messages. The use of gossip makes the scheme robust to node failure. Experimental results show only a 15% increase in end-to-end delay with a node failure rate of …

Performance Evaluation Of Ad Hoc Routing In A Swarm Of Autonomous Aerial Vehicles, Matthew T. Hyland

Theses and Dissertations

This thesis investigates the performance of three mobile ad hoc routing protocols in the context of a swarm of autonomous unmanned aerial vehicles (UAVs). It is proposed that a wireless network of nodes having an average of 5.1774 log n neighbors, where n is the total number of nodes in the network, has a high probability of having no partitions. By decreasing transmission range while ensuring network connectivity, and implementing multi-hop routing between nodes, spatial multiplexing is exploited whereby multiple pairs of nodes simultaneously transmit on the same channel. The proposal is evaluated using the Greedy Perimeter Stateless Routing (GPSR), …

Analysis Of Routing Worm Infection Rates On An Ipv4 Network, James Gorsuch

Theses and Dissertations

Malicious logic, specifically worms, has caused monetary expenditure problems to network users in the past. Worms, like Slammer and Code Red, have infected thousands of systems and brought the Internet to a standstill. This research examines the ability of the original Slammer worm, the Slammer based routing worm proposed by Zou et al, and a new Single Slash Eight (SSE) routing worm proposed by this research to infect vulnerable systems within a given address space. This research investigates the Slammer worm's ability to generate a uniform random IP addresses in a given address space. Finally, a comparison of the speed …

Performance Evaluation For Hybrid Architectures, Praveen Krishnamurthy

All Computer Science and Engineering Research

In this dissertation we discuss methologies for estimating the performance of applications on hybrid architectures, systems that include various types of computing resources (e.g. traditional general-purpose processors, chip multiprocessors, reconfigurable hardware). A common use of hybrid architectures will be to deploy coarse pipeline stages of application on "suitable" compute units with communication path for transferring data. The first problem we focus on relates to the sizing the data queues between the different processing elements of an hybrid system. Much of the discussion centers on our analytical models that can be used to derive performance metrics of interest such as, throughput …

Mining Generalized Associations Of Semantic Relations From Textual Web Content, Tao Jiang, Ah-Hwee Tan, We Wang

Research Collection School Of Computing and Information Systems

Traditional text mining techniques transform free text into flat bags of words representation, which does not preserve sufficient semantics for the purpose of knowledge discovery. In this paper, we present a two-step procedure to mine generalized associations of semantic relations conveyed by the textual content of Web documents. First, RDF (resource description framework) metadata representing semantic relations are extracted from raw text using a myriad of natural language processing techniques. The relation extraction process also creates a term taxonomy in the form of a sense hierarchy inferred from WordNet. Then, a novel generalized association pattern mining algorithm (GP-Close) is applied …