Engineering Commons^™

Cs 705: Introduction To Data Mining, Guozhu Dong

Computer Science & Engineering Syllabi

Data mining is concerned with the extraction of novel and useful knowledge from large amounts of data. This course introduces and studies the fundamental 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 784: Programming Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course introduces concepts related to the specification and design of high-level programming languages. It discusses different programming paradigms, algebraic specification and implementation of data types, and develops interpreters for specifying operationally the various programming language features/constructs. It also introduces attribute grammar formalism and axiomatic semantics briefly. The programming assignments will be coded in Scheme.

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

Computer Science & Engineering Syllabi

Introduction to numerical methods used in the sciences and engineering. Included will be methods for interpolation, data smoothing, integration, differentiation, and solution of systems of linear and nonlinear equations. Discussion of sources of error in numerical methods. Applications to science, engineering and applied mathematics are an
integral part of the course. Special topics presented as schedule permits. Four hours lecture.

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 499/699: Cloud Computing, Keke Chen

Computer Science & Engineering Syllabi

In this course, we will explore a few aspects of cloud computing: distributed data crunching with MapReduce, cloud and datacenter filesystems, virtualization, security&privacy, Amazon Web Services, and interactive web-based applications. Students are expected to finish a few mini projects, read some papers, and take the final exam. Participation in the class discussion is strongly encouraged. Guest speakers might be invited for some particular topics. (3 Hours Lecture+ 1 Hour lab).

Cs 400-01: Data Structures And Algorithms, Sarah Gothard

Computer Science & Engineering Syllabi

No abstract provided.

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.

Ceg 770-01: 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 724-01: Computer Vision I, Arthur A. Goshtasby

Computer Science & Engineering Syllabi

This course covers basic a]algorithms for low-level and mid-level vision. The algorithms deal with reducing image noise and segment images into objects or their parts. Other a]algorithms covered in the course analyze and quantify texture, register images, and recover 3-D shapes from 2-D images.

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.

Ceg 476/676-01: Computer Graphics I, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you will have learnt techniques for constructing 2-D and 3-D objects as well as manipulating and rendering the objects using OpenGL.

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 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: CEG260.

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 320/520-01: Computer Organization, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 221-01: Introduction To C Programming For Engineers, Jay Dejongh

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, and numerical methods applications. 4 credit hours. Prerequisite: CEG220 (Introduction to C Programming for Engineers).

Ceg 402/602-01: Introduction To Computer Communication, Jianing Ma

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 434/634-01: Concurrent Software Design, Douglas J. Kelly

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, homework, and readings on operating system design.

Ceg 433/633-01: Operating Systems, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you should be able to apply the learned concepts to the following:
•Develop, test and debug programs in Unix.
•Improve the performance of programs by tuning virtual memory usage, and file io.
•Design and construct device drivers for Unix.
•Design and build newer file systems for any OS.

During the course we will discuss topics from the following areas:
•Operating system structures
•Operating system interfaces
•Process management and scheduling
•Interprocess communication
•File systems
•Memory management

Ceg 453/653: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 702-01: Advanced Computer Networks, Yong Pei

Computer Science & Engineering Syllabi

This course provides an in-depth examination of the fundamental concepts and principles in communications and computer networks. Topics include: queuing analysis, ATM, frame relay, performance analysis of routings, and flow and congestion controls.

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 760-01: Advanced Software Computer Engineering, Thomas C. Hartrum

Computer Science & Engineering Syllabi

This course covers advanced topics in software engineering. Aspects of problem specification, design, verification, and evaluation are discussed. We will focus on design methods, including software patterns and software architecture, plus some advanced topics involving formal methods of software specification or evaluation using software metrics. Students will participate in team projects to apply the methods discussed.

Ceg 730-01: Distributed Computing Principles, Prabhaker Mateti

Computer Science & Engineering Syllabi

[4 Credit Hours] Communicating sequential processes, clients and servers, remote procedure calls, stub generation, weak and strong semaphores, split-binary-semaphores, and distributed termination. Example languages: SR, Linda. Prerequisite: CEG 633

Reinforcement-Learning-Based Output-Feedback Control Of Nonstrict Nonlinear Discrete-Time Systems With Application To Engine Emission Control, Peter Shih, Brian C. Kaul, Jagannathan Sarangapani, J. A. Drallmeier

Electrical and Computer Engineering Faculty Research & Creative Works

A novel reinforcement-learning-based output adaptive neural network (NN) controller, which is also referred to as the adaptive-critic NN controller, is developed to deliver the desired tracking performance for a class of nonlinear discrete-time systems expressed in nonstrict feedback form in the presence of bounded and unknown disturbances. The adaptive-critic NN controller consists of an observer, a critic, and two action NNs. The observer estimates the states and output, and the two action NNs provide virtual and actual control inputs to the nonlinear discrete-time system. The critic approximates a certain strategic utility function, and the action NNs minimize the strategic utility …

A Service Choice Model For Optimizing Taxi Service Delivery, Shih-Fen Cheng, Xin Qu

Research Collection School Of Computing and Information Systems

Taxi service has undergone radical revamp in recent years. In particular, significant investments in communication system and GPS devices have improved quality of taxi services through better dispatches. In this paper, we propose to leverage on such infrastructure and build a service choice model that helps individual drivers in deciding whether to serve a specific taxi stand or not. We demonstrate the value of our model by applying it to a real-world scenario. We also highlight interesting new potential approaches that could significantly improve the quality of taxi services.

Analysis Of Tradeoffs Between Buffer And Qos Requirements In Wireless Networks, Raphael Rom, Hwee-Pink Tan

Research Collection School Of Computing and Information Systems

In this paper, we consider the scheduling problem where data packets from K input-flows need to be delivered to K corresponding wireless receivers over a heterogeneous wireless channel. Our objective is to design a wireless scheduler that achieves good throughput and fairness performance while minimizing the buffer requirement at each wireless receiver. This is a challenging problem due to the unique characteristics of the wireless channel. We propose a novel idea of exploiting both the long-term and short-term error behavior of the wireless channel in the scheduler design. In addition to typical first-order Quality of Service (QoS) metrics such as …

Distribution-Based Concept Selection For Concept-Based Video Retrieval, Juan Cao, Hongfang Jing, Chong-Wah Ngo, Yongdong Zhang

Research Collection School Of Computing and Information Systems

Query-to-concept mapping plays one of the keys to concept-based video retrieval. Conventional approaches try to find concepts that are likely to co-occur in the relevant shots from the lexical or statistical aspects. However, the high probability of co-occurrence alone cannot ensure its effectiveness to distinguish the relevant shots from the irrelevant ones. In this paper, we propose distribution-based concept selection (DBCS) for query-to-concept mapping by analyzing concept score distributions of within and between relevant and irrelevant sets. In view of the imbalance between relevant and irrelevant examples, two variants of DBCS are proposed respectively by considering the two-sided and onesided …

Accurate Extraction Of Morphological Information From Volumetric Imagery, Thomas Wischgoll

Computer Science and Engineering Faculty Publications

No abstract provided.

Scalable Detection Of Partial Near-Duplicate Videos By Visual-Temporal Consistency, Hung-Khoon Tan, Chong-Wah Ngo, Richang Hong, Tat-Seng Chua

Research Collection School Of Computing and Information Systems

Following the exponential growth of social media, there now exist huge repositories of videos online. Among the huge volumes of videos, there exist large numbers of near-duplicate videos. Most existing techniques either focus on the fast retrieval of full copies or near-duplicates, or consider localization in a heuristic manner. This paper considers the scalable detection and localization of partial near-duplicate videos by jointly considering visual similarity and temporal consistency. Temporal constraints are embedded into a network structure as directed edges. Through the structure, partial alignment is novelly converted into a network flow problem where highly efficient solutions exist. To precisely …