Physical Sciences and Mathematics Commons^™

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

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 480/680: Comparative Languages, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will introduce fundamental concepts and paradigms underlying the design of modem programming languages. For concreteness, we study the details of an object-oriented language (e.g. Java), and a functional language (e.g., Scheme) . The overall goal is to enable comparison and evaluation of existing languages. The programming assignments will be coded in Java 5 and in scheme.

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.

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.

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

Computer Science & Engineering Syllabi

No abstract provided.

Cs 240: Computer Programming I, Sarah Gothard

Computer Science & Engineering Syllabi

Basic concepts of programming and programming languages are introduced.
Emphasis is on structured programming and stepwise refinement.

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.

Semantics-Preserving Bag-Of-Words Models For Efficient Image Annotation, Lei Wu, Steven C. H. Hoi, Nenghai Yu

Research Collection School Of Computing and Information Systems

The Bag-of-Words (BoW) model is a promising image representation for annotation. One critical limitation of existing BoW models is the semantic loss during the codebook generation process, in which BoW simply clusters visual words in Euclidian space. However, distance between two visual words in Euclidean space does not necessarily reflect the semantic distance between the two concepts, due to the semantic gap between low-level features and high-level semantics. In this paper, we propose a novel scheme for learning a codebook such that semantically related features will be mapped to the same visual word. In particular, we consider the distance between …

Mining Globally Distributed Frequent Subgraphs In A Single Labeled Graph, Xing Jiang, Hui Xiong, Chen Wang, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Recent years have observed increasing efforts on graph mining and many algorithms have been developed for this purpose. However, most of the existing algorithms are designed for discovering frequent subgraphs in a set of labeled graphs only. Also, the few algorithms that find frequent subgraphs in a single labeled graph typically identify subgraphs appearing regionally in the input graph. In contrast, for real-world applications, it is commonly required that the identified frequent subgraphs in a single labeled graph should also be globally distributed. This paper thus fills this crucial void by proposing a new measure, termed G-Measure, to find globally …

Analyzing The Video Popularity Characteristics Of Large-Scale User Generated Content Systems, Meeyoung Cha, Haewoon Kwak, Pablo Rodriguez, Yong-Yeol Ahn, Sue Moon

Research Collection School Of Computing and Information Systems

User generated content (UGC), now with millions of video producers and consumers, is re-shaping the way people watch video and TV. In particular, UGC sites are creating new viewing patterns and social interactions, empowering users to be more creative, and generating new business opportunities. Compared to traditional video-on-demand (VoD) systems, UGC services allow users to request videos from a potentially unlimited selection in an asynchronous fashion. To better understand the impact of UGC services, we have analyzed the world's largest UGC VoD system, YouTube, and a popular similar system in Korea, Daum Videos. In this paper, we first empirically show …

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 …

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 …

Rapid Prototyping Augmented Skin Pathology For Medical Simulation And Training, Annette Castelino

Electrical & Computer Engineering Theses & Dissertations

The goal of this research is to study how augmented reality technology could be applied in training medical students for better clinical practice and diagnosis in the treatment of skin conditions using skin pathology prototypes. Described within this thesis is an innovative method of producing skin abscess prototypes that augment the Standardized Patient (SP) for simulation purposes.

The method adopted is a combination of the cost-effective technique of rapid prototyping (RP) — 3D inkjet printing and 3D graphics modeling. The visual and haptic realism of these developed prototypes along with the use of moulage enable the SP to exhibit realistic …

Fault-Tolerance And Recovery In Wireless Sensor Networks, Kevin M. Somervill

Electrical & Computer Engineering Theses & Dissertations

The topic of Wireless Sensor Networks (WSNs) has gained considerable attention in the research community due to the variety of applications and interesting challenges in developing and deploying such networks. The typical WSN is significantly energy constrained and often deployed in harsh or even hostile environments, resulting in sensor nodes that are prone to failure. Failing nodes alter the topology of the network resulting in segmented routing paths and lost messages, ultimately reducing network efficiency. These issues spur the desire to develop energy-efficient, Fault-Tolerant (FT) algorithms that enable the network to persist in spite of the failed nodes. This work …

Towards Google Challenge: Combining Contextual And Social Information For Web Video Categorization, Xiao Wu, Wan-Lei Zhao, Chong-Wah Ngo

Research Collection School Of Computing and Information Systems

Web video categorization is a fundamental task for web video search. In this paper, we explore the Google challenge from a new perspective by combing contextual and social information under the scenario of social web. The semantic meaning of text (title and tags), video relevance from related videos, and user interest induced from user videos, are integrated to robustly determine the video category. Experiments on YouTube videos demonstrate the effectiveness of the proposed solution. The performance reaches 60% improvement compared to the traditional text based classifiers.