Physical Sciences and Mathematics Commons^™

Cs 801: Advanced Database Systems, Soon M. Chung

Computer Science & Engineering Syllabi

No abstract provided.

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

Computer Science & Engineering Syllabi

No abstract provided.

Cs 865: Advanced Topics In Soft Computing, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

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

Towards Attack-Resilient Geometric Data Perturbation, Keke Chen, Ling Liu

Kno.e.sis Publications

Data perturbation is a popular technique for privacy-preserving data mining. The major challenge of data perturbation is balancing privacy protection and data quality, which are normally considered as a pair of contradictive factors. We propose that selectively preserving only the task/model specific information in perturbation would improve the balance. Geometric data perturbation, consisting of random rotation perturbation, random translation perturbation, and noise addition, aims at preserving the important geometric properties of a multidimensional dataset, while providing better privacy guarantee for data classification modeling. The preliminary study has shown that random geometric perturbation can well preserve model accuracy for several popular …

Cs 207: Advanced Office Productivity Ii, Amanda Hood

Computer Science & Engineering Syllabi

This course covers post-advanced microcomputer applications including Microsoft Office Word 2003, Excel 2003, Access 2003, and PowerPoint 2003. Topics include: creating an online form, working with macros and Visual Basic for Applications (VBA), working with a master document, and index and a table of contents, linking an Excel worksheet and charting its data in Word, formula auditing, data validation, and complex problem solving in Excel, importing data into Excel, working with PivotCharts, PivotTables, and trendlines in Excel, creating a PivotTable List, advanced Access report and form techniques, and creating a multi-page form, administering a database system, creating a self-running presentation …

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 220-01: Introduction To C Programming For Engineers, Robert Helt

Computer Science & Engineering Syllabi

This course provides a general introduction to computers as a problem-solving tool using the C programming language. Emphasis is on algorithms and techniques useful to engineers. Topics include data representation, debugging, and program verification. 4 credit hours. Prerequisite: MTR 229 (Calculus I) or EGR 101 (Engineering Mathematics).

Ceg 221-01: Advanced C Programming For Engineers, Robert Helt

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, stacks, queues, hash tables, and binary trees. 4 credit hours. Prerequisite: CEG220 (Introduction to C Programming for Engineers).

Ceg 320/520-01: Computer Organization And Assembly Language Programming, Sridhar Ramachandran

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. Three hours lecture, two hours lab. Prerequisite: CS 242, CEG 260.

Ceg 333-01: Introduction To Unix, Thomas Wischgoll

Computer Science & Engineering Syllabi

By the end of this quarter, you should be able to:

• Describe the basic methodology of UNIX filters, including pipes and redirection of stdin/stdout

• Program simple UNIX utilities at the command-line and shell-script level

• Discuss the advantages and disadvantages of common user interfaces (such as UNIX vs. PC/Windows)

• Discuss the philosophy of UNIX development and the open source movement

• Work comfortably in the UNIX environment

• Edit and manage files and user-level security for UNIX development

• Use standard UNIX development tools for C or C++

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

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 453/653-01: Embedded Systems, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

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 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 751-01: Microprocessors Ii, Jack Jean

Computer Science & Engineering Syllabi

No abstract provided.

Ceg 790-01: Introduction To Scientific Visualization, Thomas Wischgoll

Computer Science & Engineering Syllabi

No abstract provided.

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.

Spatiotemporal And Thematic Semantic Analytics, Matthew Perry

Kno.e.sis Publications

No abstract provided.

Mining Minimal Distinguishing Subsequence Patterns With Gap Constraints, Xiaonan Ji, James Bailey, Guozhu Dong

Kno.e.sis Publications

Discovering contrasts between collections of data is an important task in data mining. In this paper, we introduce a new type of contrast pattern, called a Minimal Distinguishing Subsequence (MDS). An MDS is a minimal subsequence that occurs frequently in one class of sequences and infrequently in sequences of another class. It is a natural way of representing strong and succinct contrast information between two sequential datasets and can be useful in applications such as protein comparison, document comparison and building sequential classification models. Mining MDS patterns is a challenging task and is significantly different from mining contrasts between relational/transactional …

Cs/Bio 271: Introduction To Bioinformatics, Dan E. Krane, Michael L. Raymer

Computer Science & Engineering Syllabi

No abstract provided.

Cs 790-01: Multimedia Coding And Communication (Ii), Yong Pei

Computer Science & Engineering Syllabi

No abstract provided.

Cs 790-02: Optimizing Compliers For Modern Architectures, Meilin Liu

Computer Science & Engineering Syllabi

This course studies compiler optimization for modem architectures. Between parsing the input program and generating the target machine code, optimizing compilers perform a wide range of program transformations on a program to improve its performance. In this course we focus on data dependence analysis, loop transformations, loop scheduling, cache management, and a combination of these optimizing techniques.

Cs 776: Functional Programming, Krishnaprasad Thirunarayan

Computer Science & Engineering Syllabi

This course will discuss important concepts of functional programming such as recursive definitions, higher-order functions, type inference, polymorphism, abstract data types, modules etc. The programming exercises will illustrate the utility of list-processing, pattern matching, abstraction of data/control, strong typing, and parameterized modules (functors). We also study the mathematical reasoning involved in the design of functional programs and techniques for proving properties about functions so defined.

Cs 714: Machine Learning, Shaojun Wang

Computer Science & Engineering Syllabi

This introductory course on machine learning will give an overview of many concepts, techniques, and algorithms in machine learning that are now widely applied in scientific data analysis, data mining, trainable recognition systems, adaptive resource allocators, and adaptive controllers. The emphasis will be on understanding the fundamental principles that permit effective learning in these systems, realizing their inherent limitations, and exploring the latest advanced techniques employed in machine learning.

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 l, 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 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 400/600: Data Structures And Software Design, Natsuhiko Futamura

Computer Science & Engineering Syllabi

In this course, students will learn basic data structures and how to design and analyze and implement software. Course covers introduction to the fundamentals of complexity and analysis and study of common problems and solutions using various data structures. After taking this course, students are expected to be able to design reasonable software for problems and estimate (evaluate) the performance of them even without writing the software.