Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

PDF

2009

Institution
Keyword
Publication
Publication Type

Articles 31 - 60 of 376

Full-Text Articles in Engineering

Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan Oct 2009

Cs 340: Programming Language Workshop In Python, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course is designed as a self-study in Python. You are expected to learn the language and solve a set of programming problems assigned to you from Dietel et al using Python available from http://www.python.org. There are no exams. We officially meet only once in the quarter. However, I will be available in the posted office hours for clarifications and discussions about the programming problems.


Cs 405/605-02: Introduction To Database Management Systems, Keke Chen Oct 2009

Cs 405/605-02: Introduction To Database Management Systems, Keke Chen

Computer Science & Engineering Syllabi

This course will cover the following topics: (1) Logical and physical aspects of database management systems (2) Data models including entity-relationship (ER) and relational models (3) Physical implementation (data organization and indexing) methods. (4) Query languages including SQL, relational algebra, and relational calculus. Students will gain experience in creating and manipulating a database, and gain knowledge on professional and ethical responsibility and on the importance of privacy/security of data.


Cs 409/609: Principles Of Artificial Intelligence, Shaojun Wang Oct 2009

Cs 409/609: Principles Of Artificial Intelligence, Shaojun Wang

Computer Science & Engineering Syllabi

No abstract provided.


Cs 475/675: Web Information Systems, Amit P. Sheth Oct 2009

Cs 475/675: Web Information Systems, Amit P. Sheth

Computer Science & Engineering Syllabi

This course covers advanced topics in managing W eh-based resources, with a focus on building applications involving heterogeneous data. It will expose students to the following concept, topics, architectures, techniques, and technologies:

• data, metadata, information, knowledge, and ontologies
• unstructured, semi-structured, structured, multimodal, multimedia, and sensor data syntax,
structural/representational, and semantic aspects of data
• architectures: federated databases, mediator, information brokering
• integration and analysis of Web-based information
• automatic information/metadata extraction (entity identification/recognition, disambiguation)
• Web search engines, social networks, Web 2.0
• Semantic Web and Web 3.0
• relevant Web standards and technologies
• real-world examples that …


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

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 499/699: Special Topics In Information Security, Meilin Liu Oct 2009

Cs 499/699: Special Topics In Information Security, Meilin Liu

Computer Science & Engineering Syllabi

This course gives a comprehensive study of security vulnerabilities in information systems and the basic techniques for developing secure applications and practicing safe computing. Topics include: Conventional encryption; Data Encryption Standard; Advanced Encryption Standard; Hashing functions and data integrity; Basic Number Theory; Public-key encryption (RSA); Digital signature; Security standards and applications; Access Control; Management and analysis of security. After taking this course, students will have the knowledge of several well-known security standards and their applications; and the students should be able to increase system security and develop secure applications.


Cs 705: Introduction To Data Mining, Guozhu Dong Oct 2009

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 Oct 2009

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 Oct 2009

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.


Ceg 770-01: Computer Engineering Mathematics, Yong Pei Oct 2009

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 260-01: Digital Computer Hardware/Switching Circuits, Meilin Liu Oct 2009

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 Oct 2009

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 Oct 2009

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 Oct 2009

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 Oct 2009

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 Oct 2009

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 Oct 2009

Ceg 453/653: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.


Ceg 702-01: Advanced Computer Networks, Yong Pei Oct 2009

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 Oct 2009

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 Oct 2009

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 Oct 2009

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


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

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 …


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

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 Oct 2009

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 …


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

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 …


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

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 …


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

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.


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 Oct 2009

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 …


Cs/Bio 471/671: Algorithms For Bioinformatics, Michael L. Raymer Oct 2009

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 Oct 2009

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).