Computer Science Course Descriptions for Spring of 2003

CMPSCI 105: Computer Literacy (R2)

Professor: Verts

Microcomputers are now used widely not only in academia but in all areas of modern life. For this reason it's important that all students understand how computers work and how computers can be used as a problem-solving tool. The focus of this course is on computer applications. The course stresses the ways in which computers can help you solve problems efficiently and effectively. The course provides a broad introduction to hardware and software aspects of microcomputers. Then four application areas are discussed: word processing, spreadsheets, databases and telecommunications (access to the Internet). Weekly lab assignments are an integral part of the course. Students in lectures A1, A2, D1, D2, D3 use the University's microcomputer labs, all other students are expected to use their own equipment. Students who are more interested in computer programming should take CMPSCI 121 or 187. Prerequisites: reasonable high school math skills. Typing ability is also an important asset for the course. Previous computer experience is not expected. Pre-registration is not available to majors and pre-majors. 3 credits.

CMPSCI 105D1: Computer Literacy (R2)

Professor: Verts

CMPSCI 105D2: Computer Literacy (R2)

Professor: Verts

CMPSCI 105D3: Computer Literacy (R2)

Professor: Verts

CMPSCI 120: Introduction to Problem Solving with the Internet (R2)

Professor: ** Section Deleted

The Internet is a goldmine of information and software resources for those who know how to plug in and navigate it. Originally designed by computer scientists for computer scientists, the net is now a driving force behind life in the information age and a new global economy. This course will provide non-CMPSCI majors with timely skills needed to tap the net. We will cover Web browser features, e-mail management, Web page design, software downloads, strategies for finding information and virtual communities, and public key cryptography. In addition, we will survey key social and political topics that are relevant to the Internet, such as copyright laws, First Amendment issues, privacy in a digital world, and the culture of the Internet. Prerequisites: some hands-on experience with PCs or MACs or UNIX (programming experience is NOT required). CMPSCI majors and pre-majors may not pre-register. 3 credits.

CMPSCI 120H: Introduction to Problem Solving with the Internet (R2)

Professor: ** Section Deleted

See Description CMPSCI 120. Honors students will use the tools of the Internet to perform in-depth research on several topics, some selected by the students and some jointly with the professor. Students will keep a journal of web sites visited during their research, along with notes concerning their contents and applicability to the topics being researched. Project reports will be presented in class by the students, as well as submitted to the professor (along with the research journal). Project topics relate to the Internet and computing, and include but are not limited to the interactions of the Internet with the law and law enforcement, the First Amendment, national and international commerce, digital libraries, political institutions, effects of the Internet on countries in various parts of the world, the notion of the "global village", etc. Prerequisites: some hands-on experience with PCs or MACs or UNIX (programming experience is NOT required). CMPSCI majors and pre-majors may not pre-register. 3 credits.

CMPSCI 121: Introduction to Problem Solving with Computers (R2)

Professor: Eliot, Lehnert

An introductory course in problem solving and computer programming using the programming language Java. The course focuses on the fundamental concepts of problem solving and the techniques associated with the development of algorithms and their implementation as computer programs. This course or its equivalent is required for all additional courses in CMPSCI. Three hours of lecture/recitation per week. About 7 programming problems are assigned. In addition there are assigned homework problems, a midterm exam and a final. No computer science prerequisite, although basic math skills (e.g. R1) and basic computer literacy (as taught in CMPSCI 105) are assumed. Use of computer is required. Prerequisite: R1. 3 credits.

CMPSCI 121H: Introduction to Problem Solving with Computers (R2)

Professor: ** Section Deleted

See description for CMPSCI 121. Honors students will cover some additional topics beyond the curriculum for CMPSCI 121, and will be required to complete one additional programming project. Previous experience with Java or some other programming language is strongly recommended but is not required. 3 credits.

CMPSCI 145: Representing, Storing, and Retrieving Information

Professor: Verts

An introductory course in the use of data in computer systems, intended to become a core course for the Information Technology certificate. Formats for representing text, numbers, sound, images, etc., as strings of bits. Basic information theory, use and limitations of file compression and encryption. Structured databases and how to use them. Information retrieval in heterogenous environments such as the Web. XML as a language for defining new formats for representing data. Review of historical, pre-computer methods of information representation. Analog versus Digital methods of representing information. Electric and electronic circuits, gates, and elementary hardware design. Prerequisites: "Basic computer literacy", i.e., user-level familiarity with a modern operating system and some experience with application programs. Tier I math skills. Recommended for First Year and Sophomore Non-Majors. Prerequisite: R1. 3 credits.

CMPSCI 187: Programming with Data Structures (R2)

Professor: Lehnert

The course introduces and develops methods for designing and implementing abstract data types, using the Java programming language. The main focus is on how to build and encapsulate data objects and their associated operations. Specific topics include linked structures, recursive structures and algorithms, binary trees, balanced trees, and hash tables. There will be weekly assignments, consisting of programming and written exercises, a midterm, and a final exam. Prerequisites: CMPSCI 121 (or equivalent-not necessarily in Java) and Basic Math Skills (R1). Basic Java language concepts are introduced quickly. Prior experience with an object-oriented language is very helpful; if unsure of background, contact instructor. 187 Lect B, Computer Science Tap only. 4 credits.

CMPSCI 192S: Seminar - Undergraduate Colloquium

Professor: ** Section Deleted

Presentations from a variety of computer science faculty, students, staff, or other computing professionals, targeted to first-year and second-year undergraduates but open to all. Topics may include introductions to areas of research or any other topics of general interest. Registered students must attend at least eight of the ten sessions and write 1-2 page reaction papers on three of them. 1 credit (may be repeated for credit).

CMPSCI 196A: Independent Study - TA for CMPSCI 120 Problem Solving with the Internet

Professor: Lehnert

To support CMPSCI 120 students in the Edlab. Planned activities include three hours/week in person plus email and help grading student assignments. Reliability, availability, and weekly reports are the criteria for evaluation. 3 credits.

CMPSCI 201: Architecture and Assembly Language (E)

Professor: Graham

Lecture, discussion, lab. The architecture and machine-level operations of modern computers at the logic, component, and system levels. Topics include integer, scaled, and floating point binary arithmetic; Boolean algebra and logic gates; control, arithmetic-logic, and pipeline units; addressing modes; cache, primary, and virtual memory; system buses; input-output and interrupts. Simple assembly language for a modern embedded processor is used to explore how common computational tasks are accomplished by a computer. Two lectures, one discussion, and one lab session per week. Laboratory exercises, homework exercises, in-class quizzes, two midterm exams, and a final exam. Prerequisite: CMPSCI 187 or ECE 242 or equivalent. 4 credits.

CMPSCI 250: Introduction to Computation (E)

Professor: Immerman

Lecture, discussion. Basic concepts of discrete mathematics useful to computer science: set theory, strings and formal languages, propositional and predicate calculus, relations and functions, basic number theory. Induction and recursion: interplay of inductive definition, inductive proof, and recursive algorithms. Elementary combinatorics. Basic graph theory. Finite-state machines, regular languages, nondeterministic finite automata, Kleene's Theorem. Problem sets, 2 midterm exams, timed final. Corequisite: MATH 132/136 or equivalent. Prerequisite: MATH 131 and (CMPSCI 187 or ECE 242). CS ENG majors may take CMPSCI 250 with ECE 242. Contact your Department Advisor. 4 credits.

CMPSCI 287: Programming Language Paradigms

Professor: Moll

Lecture, discussion, programming projects, lab. Programming language paradigms provide a basic philosophy to support the construction of reliable large-scale systems. This course discusses four such paradigms. In the functional paradigm, software is constructed in such a way as to minimize the use of side-effects, thereby simplifying the conceptual structure of programs and making them easier to analyze and understand. The logic paradigm supports the development of software in which the concept of relation (e.g. a relation between people) is more important than the concept of function. In the imperative paradigm we are concerned with principled ways in which software that is state-dependent can be constructed. Finally, in the object-oriented paradigm we are concerned with combining data with code to create "objects" which exhibit behavior. Prerequisite: CMPSCI 187 or ECE 242. Corequisites: CMPSCI 250 and MATH 132. 4 credits.

CMPSCI 305: Social Issues in Computing

Professor: Constantine, Moll

Designed to satisfy the Junior Year writing requirement, CMPSCI 305 introduces the student to technical writing and editing, scientific journalism and the social essay. The course combines practical, scientific writing as found in industry and business with explorative essays that focus attention upon the technological and humanistic concerns inherent in society. Ten written assignments-two longer papers, eight shorter ones and one oral presentation. Prerequisite: ENGLWP 112 or CW. 3 credits.

CMPSCI 311: Introduction to Algorithms

Professor: Siegelmann

This course will introduce you to algorithms in a variety of areas of interest, such as sorting, searching, string-processing, and graph algorithms. You will learn to study the performance of various algorithms within a formal, mathematical framework. There will be a few programming assignments as well to help you relate the empirical performance of an algorithm to theoretical predictions. Mathematical experience (as provided by CMPSCI 250) is required. You should also be able to program in Pascal or C (or some other closely related language). Prerequisite: CMPSCI 250 or MATH 455. 4 credits.

CMPSCI 320: Introduction to Software Engineering

Professor: Fisher

In this course, students learn and gain practical experience with software engineering principles and techniques. The practical experience centers on a semester-long team project in which a software development project is carried through all the stagesof the software life cycle. Topics in this course include requirements analysis, specification, design, abstraction, programming style, testing, maintenance, and software project management. Particular emphasis is placed on designing and developing maintainable software and on the use of object-oriented techniques throughout the software lifecycle. Use of computer required. Two exams, several homeworks, major term project. Prerequisite: CMPSCI 287. 4 credits.

CMPSCI 377: Operating Systems

Professor: Fagg

In this course we examine the important problems in operating system design and implementation. The operating system provides a well-known, convenient, and efficient interface between user programs and the bare hardware of the computer on which they run. The operating system is responsible for allowing resources (e.g., disks, networks, and processors) to be shared, providing common services needed by many different programs (e.g., file service, the ability to start or stop processes, and access to the printer), and protecting individual programs from one another. The course will start with a brief historical perspective of the evolution of operating systems over the last fifty years, and then cover the major components of most operating systems. This discussion will cover the tradeoffs that can be made between performance and functionality during the design and implementation of an operating system. Particular emphasis will be given to three major OS subsystems: process management (processes, threads, CPU scheduling, synchronization, and deadlock), memory management (segmentation, paging, swapping), file systems, and operating system support for distributed systems. Assignments: 3 labs in Java, 3 exams, 6 or more written homeworks. Prerequisites: CMPSCI 187 and (CMPSCI 201 or ECE 232). 4 credits.

CMPSCI 383: Artificial Intelligence

Professor: Mahadevan

The course explores heuristic search as a basic building block for intelligent computer systems. The class discussion and the weekly homeworks are organized around three projects: Free Cell, jigsaw puzzles, and Amazons (two person board game). In the final two weeks of the course, we survey a variety of traditional topics in building intelligent systems, showing how heuristic search applies. There are weekly programming assignments, a midterm, and a final. There is no text; material is presented inclass, and made available on the class Web pages. Prerequisites: CMPSCI 250 and CMPSCI 287 and CMPSCI 311. 3 credits.

CMPSCI 391S: Seminar - Fundamentals of Graphic Communication

Professor: Woolf

This course provides an understanding of computer-based design and multimedia production. Basic concepts in the areas of graphic design, animation, video editing and object-oriented programming will be covered preparing students for more advanced studies in 2D and 3D animation and in multimedia programming. Course work consists mainly of several student projects, built incrementally as several smaller sub-projects. Each student s project will be presented via the World Wide Web and discussed in class. Students interaction is encouraged through peer reviews and in-class exercises. Topics include HTML, Cascading Style Sheets (CSS), file transfer, designing and drawing characters, image formats/image compression for the web, modeling and animation.

CMPSCI 401: Formal Language Theory

Professor: Rosenberg

The mathematical classification of computational problems as solvable or unsolvable, and as easy or difficult. Review of finite state machines and regular languages. Introduction to context-free languages and pushdown automata. General models of computation, provably unsolvable problems. Resource-bounded computation, the classes P and NP, further topics in complexity theory such as space complexity. Problem sets, midterm, final, some group activities. Prerequisites: CMPSCI 250 and 311 or permission of instructor. 3 credits.

CMPSCI 453: Computer Networks

Professor: Figueiredo, Kurose

This course provides an introduction to fundamental concepts in the design and implementation of computer communication networks, their protocols, and applications. Topics to be covered include: layered network architectures, applications, network programming interfaces (e.g., sockets), transport, congestion, routing, and data link protocols, local area networks, emerging high-speed networks, network management, and network security. Examples will be drawn primarily from the Internet (e.g., TCP, UDP, and IP) protocol suite. There will be written assignments, programming assignments (in C), one midterm, and a final exam. Prerequisites: A rudimentary understanding of computer architecture and operating systems, while not required, would be helpful. 3 credits.

CMPSCI 515: Introduction to Computer and Network Security

Professor: Levine

This course provides an introduction to the principles and practice of system and network security. A focus on both fundamentals and practical information will be stressed. The three key topics of this course are cryptography, system security, and network security. Subtopics include ciphers, hashes, key exchange, security services (integrity, availability, confidentiality, etc.), security attacks, vulnerabilities, exploits, countermeasures. Students will make extensive use of a lab for experimenting with security countermeasures. Grades will be determined by class participation, lab work, homework, and exams. Prerequisites include 377 and 453 (or 591E) and a familiarity with Unix. Co-taught with Chris Misra and Jake Cunningham of OIT. 3 credits.

CMPSCI 530: Programming Languages

Professor: Wileden

This course uses a detailed examination of the Java and ML programming languages as a basis for studying fundamental principles underlying the design and implementation of modern programming languages. We address a wide range of programming language concepts and issues from both a practical and a theoretical perspective. Some attention is given to such traditional topics as control constructs, type systems and type checking, since these are the foundations for all subsequent developments. The bulk of the course, however, is devoted to more contemporary language features such as object orientation, modularity, polymorphism and concurrency. Our study of both traditional topics and contemporary features is driven by first exploring their realization in Java and ML, then comparing and contrasting with the realizations found in other modern languages such as C++, C#, Ada 95, CLOS and Modula-3. In addition, we consider some emerging concepts and directions for programming languages such as orthogonal persistence, reflection, interoperability and open implementation. While the predominant paradigm for contemporary programming languages -- the imperative, object-oriented paradigm -- is our primary focus, and the functional paradigm is our secondary focus, other paradigms such as the logic programming paradigm are also discussed. Homework problems, programming exercises and projects reinforce the material covered in lectures and readings. Prerequisites: CMPSCI 287, 320 and 377. Corequisite: CMPSCI401. Honors module when requested. 3 credits.

CMPSCI 551: Three-Dimensional Animation and Digital Editing

Professor: Woolf

This seminar is dedicated to the production of high quality 3-dimensional computer animation using graphics technology. For example, color 3-D objects are defined and manipulated, digitized images created and altered, and photo-realistic effects and animated sequences produced. Techniques are used to bend and twist shapes around objects or lines, to provide a variety of light and texture, and to trace over images including digitized pictures. The course is directed at production of an informative and approachable ten minute 3-dimensional animated piece. Using computer-generated graphical analogies as well as cartoon caricature, the video is designed to educate and entertain. The class does not have lab facilities for all students interested in this material and thus we limit the class to students who do well on the first assignment. This assignment will be graded and returned to students before the end of the Add/Drop period. Students are cordially invited to attend the first class, the first Tuesday/Thursday of the semester. At that time we will explain the course, what is expected of students and the entry condition. 3 credits.

CMPSCI 552: Interactive Multimedia Production

Professor: Woolf

This course explores the potential of high quality interactive authoring tools to develop presentation and training systems. Programming languages within professional presentation and editing packages will be used to create systems capable of presenting graphics, animation, text, sound and music, based on the users requests. Students will learn how to define and manipulate classical techniques such as storyboarding, staging, and interactivity. The course will concentrate on state-of-the-art multimedia composition and presentation techniques and developing small individual projects. The class does not have lab facilities for all students interested in this material and thus we limit the class to students who do well on the first assignment. This assignment will be graded and returned to students before the end of the Add/Drop period. Students are cordially invited to attend the first class, the first Tuesday/Thursday of the semester. At that time we will explain the course, what is expected of students and the entry condition. Prerequisite: CMPSCI 551 (591x) - 3D Computer Animation and Digital Editing. Permission of the instructor required; contact: Beverly Woolf 545-4265. 3 credits.

CMPSCI 553: Interactive Web Animation

Professor: Woolf

This course teaches basic animation for the Web, interactivity, color theory, design, action scripting, and transitions. Students maintain their own web sites and submit projects every 2 weeks in Flash. Individual as well as a final project are required. Knowledge of basic Web development, e.g., HTML, Java Script. Prerequisite: CMPSCI 391F; CMPSCI 551 and CMPSCI 552 preferred. Permission of instructor is required. 3 credits.

CMPSCI 554: Multimedia Production Management

Professor: Woolf

This course involves developing a large group 3D animation, beginning with a storyboard, developing models, lighting, background, sound and music. It involves team management, group dynamics, and production techniques. The final project will be demonstrated on the last day of class, to over 100 people. Prerequisite: CMPSCI 551. Permission of instructor is required. 3 credits.

CMPSCI 591E: Seminar - Computer Networking

Professor:

CMPSCI 591F: Seminar - Software Engineering Management Practicum

Professor: Fisher

The purpose of this course is to provide students with practical experience in the management of software development projects. Students in this course will gain this experience by serving as software development team technical managers for teams of software engineering students in CMPSCI 320. As software development team managers, the students in CMPSCI 591F will be responsible for: supervising and managing the work of teams of CMPSCI 320 students; interfacing with the other CMPSCI 591F students managing other teams in the course; interfacing with the course instructor, course TA, and course customer. CMPSCI 591F students will be assigned readings in software engineering project management to provide a theoretical basis for their work in this course. But the majority of work in the course will be related to the actual management of assigned development teams. As team managers, CMPSCI 591F students will set goals and schedules for their teams, track and report team progress, negotiate with leaders of other teams and the course customer, and evaluate the work of members of their teams. CMPSCI 591F course assignments may include: written team goals, plans and schedules; periodic reports on team progress; documentation of agreements reached with other team leaders and customers; evaluations of the applicability of theoretical papers to the work of this course. This course will meet at the same times and places as CMPSCI 320. Additional meetings with team members and other students in CMPSCI 591F are also expected to be arranged by mutual agreement. Enrollment in this course is only by permission of the instructor, and is restricted to students who have previously taken CMPSCI 320, and received a grade of A or AB. 3 credits.

CMPSCI 591G: Seminar - Computer Networking Lab

Professor: Kurose

Description:In this course, students will learn how to put "principles into practice," in a hands-on-networking lab course. The course will cover router and end-system labs in the areas of Single Segment IP Networks, Multiple Segment IP Networks and Static Routing, Dynamic Routing Protocols (RIP and OSPF) LAN switching, Transport Layer Protocols: UDP and TCP, IP Multicast, NAT, DHCP, DNS, SNMP and Network Security. These labs will be done in a networked lab setting consisting of 4 routers, 4 hubs, and 4 end systems. See http://www.tcpip-lab.net for specific lab content.

CMPSCI 591O: Seminar - Character Animation

Professor: Woolf

This class focuses exclusively on character animation techniques. The goal is to attain proficiency in modeling, texturing and animation. Modeling topics include character modeling and bones, designing joints and creating chains with constraints for easy animation, facial modelling and lip sync, designing faces with economical splinage to simplify facial animation, breaking down voice tracks into phonemes and animating facial and body language to match the track. Animation topics include action andpose, timing, overlap, pacing, and simulating and exaggerating physical laws. Student will create their own final project or work in a small team. Prerequisites: CMPSCI 551 (591x)--3D Animation and Digital Editing or equivalent experience and a personal computer. 3 credits.

CMPSCI 591P: Seminar - Programming Languages for the Web

Professor: Wileden

Introduction to concepts, techniques and tools used for building web applications. Tools will be primarily drawn from the Java 2 Enterprise Edition (J2EE) and Microsoft .NET frameworks. Students will gain experience with web application building through projects that make use of the concepts, techniques and tools covered in the course. 3 credits.

CMPSCI 596A: Independent Study - TA for CMPSCI 551 3D Animation

Professor: Woolf

TAs are responsible for developing student assignments weekly and for group grading assignments every two weeks. They typically give one lecture per semester and also spend 6 hours/week in the Animation Lab assisting students. TAs setup and maintain hardware and software needed for lectures - 3 or 4 commercial graphics packages. TAs take a lead role in the final course production, a group effort of 6-8 weeks work. Each TA manages 4-5 students organized in groups for 1) character animation, 2) lighting, 3) special effects, 4) surfaces, and 5) editing. The TA creates weekly tasks for each student in his/her group and makes sure that the work is complete and passed along to the next group on time. Prerequisite: CMPSCI 551 with grade of B or better. 3 credits.

CMPSCI 596B: Independent Study - TA for CMPSCI 552 Interactive Multimedia Production

Professor: Woolf

TAs are responsible for developing student assignments weekly and for group grading of assignments every two weeks. They typically give one lecture per semester, plus spend 6 hours/week in the Animation Lab assisting students. Setup/maintain hardware and software needed for lectures - 1 or 2 commercial graphics packages in addition to Director. Also setup and maintain an internet site into which students put their class assignments. Work with students on individual Director final projects; Maintain communiction between 12-15 students, intstructors and TAs. Prerequisite: CMPSCI 552 with grade of B or better. 3 credits.

CMPSCI 596C: Independent Study - TA for CMPSCI 591O Seminar-Character Animation

Professor: Woolf

TAs are responsible for providing assistance to the instructor and students of CMPSCI 591O Seminar-Character Animation. Activities will include critiquing students work and providing useful feedback. Grading the class projects and homework assignments, and spending at least 6 hours each week in the laboratory to help the students with their daily work for the class. Evaluation will be done by the instructor based upon the quality of assistance to the students, attendance at the lectures and hours spent in the animation laboratory. Grading will also be based on advanced projects by the student and presented at the end of the semester. Prerequisite: CMPSCI 591O with grade of B or better. 3 credits.

CMPSCI 596D: Independent Study - Advanced Computer Modeling

Professor: Woolf

This course focuses on production of high quality models, beginning with simple vases, desks, lamps and moving to character and humanoids. Students will model organic shapes, such as fruit, using splines, lathes, and extrudes. Surfacing topics such as specularity, reflection, trasparency, glow, decals and image maps will be discussed and modeled. Texture and advanced lighting techniques will be developed. Students will develop humanoid characters, modeling torso, shoulders, pelvis, arms, legs and hands feet and eyeballs. Geometry bones will be added to the final characters along with kinematic constraints and Euler Limits. The character's face will "lip sync" to speak or sing. Students will also create low patch proxy models of their characters to be used for blocking and simple motion within a final animation. These characters will be rigged for animation and the models given to students in the Animation Class for creation of the final project. Students will complete five independent modeling assignments and a final project in which their characters are animated by the Animation Class. The class does not have lab facilities for all students interested in this material and thus we limit the class to students who do well on the first assignment. This assignment will be graded and returned to students before the end of the Add/Drop period. Students are cordially invited to attend the first class, the first Tuesday/Thursday of the semester. At that time we will explain the course, what is expected of students and the entry condition. 3 credits.

CMPSCI 601: Computation Theory

Professor: Barrington

An in-depth introduction to the main models and concepts of the mathematical theory of computation, including: Computability: What problems can be solved in principle? How might you prove that a problem can't be solved? Complexity: What problems can be solved within given resource constraints? How do constraints on different resources (e.g., time, space, or parallel time) relate? Logic: What are the best ways to formally specify a problem, and how do these specifications relate to the difficulty of the problem? Prerequisites: Undergraduate-level courses in discrete mathematics (e.g., CMPSCI 250) and analysis of algorithms (e.g., CMPSCI 311 or better yet 611), plus additional mathematical maturity (e.g., CMPSCI 611, A's in 250 or 311, or other mathematical background). Previous background in formal languages (e.g., CMPSCI 401) is quite desirable. Course requirements: about eight problem sets, timed midterm and final. Also open to qualified undergraduates. 3 credits.

CMPSCI 601X: Computation Theory

Professor:

CMPSCI 603: Robotics

Professor: Brock

In addtion to traditions rooted in mechanics and dynamics, geometrical reasoning, and artificial intelligence, the study of robot systems is growing to include many issues traditionally part of the computing sciences; distributed and adaptive control, architecture, software engineering, real-time systems, information processing and learning. In robotics, processing and its relationship to mechanical function are dependent on the target platform and the world in which it is situated. Designing an embedded computational system for sensory and motor processes requires that designers appreciate and understand all of these disciplines. This course is concerned with the design and analysis of adaptive, closed-loop physical systems. The focus will be sensory and motor systems that interpret and manipulate their environments. Toward this end, we will study mechanisms (kinematics and dynamics), actuators, sensors (with a focus on active vision), signal processing, associative memory, feedback control theory, supervised and unsupervised learning, and task planning. Interesting examples of integrated sensory, motor, and computational systems can be found in nature, so occassionally we will relate the subject matter to biological systems. Students willexperiment with system identification and control, image processing, path planning, and learning on simulated platforms to reinforce the material presented in class. 3 credits.

CMPSCI 620X: Advanced Software Engineering: Synthesis and Development

Professor:

CMPSCI 621X: Advanced Software Engineering: Analysis and Evaluation

Professor:

CMPSCI 630: Programming Languages

Professor: Wileden

This course uses a detailed examination of the Java and ML programming languages as a basis for studying fundamental principles underlying the design and implementation of modern programming languages. We address a wide range of programming language concepts and issues from both a practical and a theoretical perspective. Some attention is given to such traditional topics as control constructs, type systems and type checking, since these are the foundations for all subsequent developments. The bulk of the course, however, is devoted to more contemporary language features such as object orientation, modularity, polymorphism and concurrency. Our study of both traditional topics and contemporary features is driven by first exploring their realization in Java and ML, then comparing and contrasting with the realizations found in other modern languages such as C++, C#, Ada 95, CLOS and Modula-3. In addition, we consider some emerging concepts and directions for programming languages such as orthogonal persistence, reflection, interoperability and open implementation. While the predominant paradigm for contemporary programming languages -- the imperative, object-oriented paradigm -- is our primary focus, and the functional paradigm is our secondary focus, other paradigms such as the logic programming paradigm are also discussed. Homework problems, programming exercises and projects reinforce the material covered in lectures and readings. Prerequisites: Graduate standing or permission of instructor. 3 credits.

CMPSCI 635: Modern Computer Architecture

Professor: Weems

This course examines the structure of modern computer systems. We explore hardware and technology trends that have led to current machine organizations, then consider specific features and their impact on software and performance. These may include superscalar issue, caches, pipelines, branch prediction, and parallelism. Midterm and final exams, team project, homework, in-class exercises. Prerequisites: CMPSCI 535 or equivalent. 3 credits.

CMPSCI 650: Empirical Methods for Computer Science

Professor: ** Section Deleted

This course introduces methods for collecting, visualizing and uncovering hidden structure in empirical data; designing experiments and evaluative studies; testing hypotheses statistically; evaluating the performance of systems; finding interactions between parameters of systems; finding patterns in time series of instrumented systems; modeling systems; and generalizing results. In short, the goal of the course is to give you the tools that scientists in other fields take for granted, although every effort is made to adapt these tools to computer science. Course requirements: three homeworks, a take-home midterm, a final exam or a class project. 3 credits.

CMPSCI 673X: Performance Evaluation

Professor:

CMPSCI 677: Operating Systems

Professor: Shenoy

This course provides an in-depth examination of principles of distributed operating systems. Covered topics include processes and threads, concurrent programming, distributed interprocess communication, distributed process scheduling, shared virtual memory, distributed file systems. In-depth examples will be taken from current operating systems such as UNIX and MACH. Some coverage of operating system principles for multiprocessors will also be included. Prerequisites: The student should be able to easily program in a high-level language such as C, have had a course on data structures, be familiar with elements of computer architecture and have had previous exposure to the operating system concepts of processes, virtual memory, and scheduling. A previous course on uniprocessor operating systems (e.g., CMPSCI 377) will be helpful but not required. 3 credits.

CMPSCI 677X: Operating Systems

Professor:

CMPSCI 684: Case-Based Reasoning

Professor: Rissland

Case-based reasoning is a technique to solve new problems by reusing solutions to previously solved, similar problems, for instance to interpret new fact situations by analogizing them with existing precedents or to create new plans by adapting old ones. This course covers key ingredients of CBR, classic CBR systems, and state-of-the-art research and applications. We will begin by introducing the basic concepts and issues in case-based reasoning and the design of CBR systems including case representation, indexing, retrieval, and similarity assessment, and the relationship between CBR and other areas of machine learning. We will then examine in depth a few systems that exemplify various approaches to CBR across a variety of task domains, such as legal reasoning, medical diagnosis, planning, and design. We will examine the use of CBR in concert with other techniques such as rule-based reasoning, constraint satisfaction, and information retrieval. We will explore how CBR can be used to give pro-con analyses and support decision making and advocacy. Prerequisites: CMPSCI 383 or CMPSCI 683. For graduates or advanced undergraduate students. 3 credits.

CMPSCI 691Q: System Building for Mobile Devices

Professor: Levine, Shenoy

Personal Digital Assistants (PDAs) are becoming an outstanding platform for supporting mobile networking. This course presents a chance to build systems and networking software for PDAs in a collaborative learning environment. We will use the Strongarm-based Sharp Zaurus running linux as a base for building a collection of open-source applications, services, and libraries. This course will evaluate students based on the creativity of their self-designed projects, the success of their implementations, and class and web-community participation. This course assumes students are already proficient programmers in C/C++ or python and familiar with linux.

CMPSCI 691Y: Seminar - Adversary Search

Professor: Utgoff

This course examines approaches to constructing programs that perform well in a competitive environment. The focus will be on the game-playing literature, where the degree of success in balancing search and knowledge is measured directly by performance against one or more adversaries. The course is intended for advanced undergraduates and all graduates. We will use Heinz's `Scalable Search in Computer Chess' as a text, augmented with selected papers from the research literature. A central activity of the course is competition of student programs, using the game Ammazons, which is of current interest in the game-playing community. Software for running competitions is available, allowing anyone to invoke any player programs at any time. Required work consists of readings, exercises, active on-going participation in the class competition of player programs, a midterm, a final, and a project write-up. Prerequisite: CMPSCI 383, or CMPSCI 683, or permission of the instructor. 3 credits.

CMPSCI 691Z: Machine Learning: Advanced Methods

Professor: Barto, Mahadevan, Siegelmann, Utgoff

This course presents advanced methods for computational machine learning. Hidden Markov models, principal component analysis, selected methods for numerical function approximation, momentum, weight decay, hints, recurrent networks, quickprop, Rprop, dynamic modification of the network architecture, learning vector quantization, self-organizing maps, Bayesian belief netwworks, expectation maximization (EM), probablistic neural networks, linear programming, Boltzman learning, genetic algorithms, genetic programming, computational learning theory, PAC learning, grammar induction, Ockam's razor, representational bias, minimum desccription length principle, bagging, boosting, ensemble classifiers, comparing classifiers, hierarchical clustering, co-training, explanation-based learning, inductive logic programming, relational learning, knowledge discovery, data mining. There will be written exercises, programming exercises, a semester-long project, a midterm, and a final exam. Prerequisites: CMPSCI 689. Course is open to undergraduates. 3 credits.

CMPSCI 701: Advanced Computer Science Topics

Professor: Immerman

This is a 6 credit reading course corresponding to the master s project. The official instructor is the GPD although the student does the work with and is evaluated by the readers of his or her master s project.

CMPSCI 710: Advanced Compiler Techniques

Professor: Berger

Advanced compiler techniques will study the construction of optimizing compilers with a focus on uniprocessor architectures. The course will cover data-flow analysis, program optimization, and code generation across basic blocks, procedures, and complete programs. Classical topics such as interprocedural and intraprocedural analysis, intermediate representations, register allocation, and scheduling will be presented in the context of modern uniprocessors. The course will also cover dependence analysis and loop transformations: the building blocks for optimizing for memory hierarchies and parallel machines. 3 credits.

CMPSCI 711: Parallel Algorithms and Architectures

Professor: Adler

A study of parallel algorithms and architectures, emphasizing theoretical formulations and developments. Two classes of algorithmic problems will be studied. In the realm of "application-oriented algorithms", the development will flow from idealized shared-memory algorithmic paradigms that ignore communication costs, to distributed-memory emulations of shared memory, to distributed-memory algorithmic paradigms. Concepts will be illustrated via important applications such as sorting. In the realm of"systems-oriented algorithms", discussions will center on problems such as task scheduling, load balancing, message routing, and latency hiding. Sources will include research and survey articles, and Leighton's recent book. Each student will take detailed lecture notes on some topic, for distribution to the class. Additionally, each student will prepare an in-depth report on a topic selected in consultation with the instructor. Prerequisite: CMPSCI 611 or equivalent, or consent of the instructor.3 credits.

CMPSCI 741: Complexity Theory

Professor: Immerman, Barrington

The study of the resources required to solve different problems in various abstract models of computation. Sequential computation: Turing machines, non-determinism, alternation, algebraic automaton theory. Parallel computation: Boolean circuits, branching programs, uniformity. Lower bounds for circuit models. Descriptive Complexity. Possible optional topics depending on student interest: Approximation of NP-complete prob- lems, interactive proofs, non-uniform finite automata, dynamic complexity. Prerequisite: CMPSCI 601 or permission of instructor. Intended for inter- ested general graduate students as well as those concentrating in theory. Course format: Probably 2-3 problem sets, class presentation (may be survey or actual research, might lead to a synthesis paper). Textbook: Xeroxed notes and research papers, plus sections of Prof. Immerman's new book, "Descriptive Complexity". 3 credits.

CMPSCI 791S: Statistical Information Extraction

Professor: McCallum

The Web is the world's largest knowledge base. However, its data is in a form intended for human reading, not manipulation, mining and reasoning by computers. Today's search engines help people find web pages. Tomorrow's search engines will also help people find "things" (like people, jobs, companies, products), facts and their relations. Information extraction is the process of filling fields in a database by automatically extracting sub-sequences of human readable text. It is a rich and difficult problem involving the need to combine many sources of evidence using complex models that have many parameters---all estimated with limited labeled training data. This course will survey many of the sub-problems and methods of information extraction, including use of finite state machines and context-free grammars, language and formatting features, generative and conditional models, rule-learning and Bayesian techniques. We will discuss segmentation of text streams, classification of segments into fields, association of fields into records, and clustering and de-duplication of records. Along the way we will explore many of the mainstays of statistical modeling, including maximum likelihood, expectation maximization, estimation of multinomial and Dirichlet distributions, maximum entropy methods, discriminative training, Bayesian networks, factored Markov models, variational approximations, mixture models, semi-supervised training methods. Most of all we will have a tremendous amount of fun together learning new things in a dynamic, challenging, yet safe-for-silly-questions environment. Pre-requisites: CMPSCI 689 or STATS 511. 3 credits.

CMPSCI 791T: Seminar - Multi-Agent Organizations

Professor: Lesser, Corkill

In this seminar, we explore issues in using designed and emergent organizational coordination in multi-agent systems. We will survey classic and recent work in organizational control of multi-agent systems, management and social organization theories, coalition formation and teaming, statistical and economic control techniques, and computational organization research. Participants will prepare presentations of papers and lead class discussions in assessing relevance to the development of effective organizational control capabilities.

CMPSCI 791U: Seminar - Advanced Information Retrieval

Professor: Croft, Allan

A seminar in which we will read, present and discuss research papers on the latest topics in information retrieval.

CMPSCI 791W: Seminar - Requirements Engineering

Professor: Clarke

Requirements engineering is concerned with defining the problem to be solved. A good requirements specification for a software system helps designers understand what is being requested and serves as a contract to determine if the developed system satisfies that request. Mistakes and omissions in a requirements specification can be very costly, especially if they are not uncovered until late in the development process. Thus, there has been considerable work on developing techniques for specifying software requirements. These techniques range from natural language descriptions, to GUI templates, to mathematical formalisms. In this class we will survey the major approaches, apply them to some small case studies, and evaluate their strengths and weaknesses.

CMPSCI 791Y: Seminar - Network Measurement, Modeling and Inferencing

Professor: Towsley, Kurose

The Internet is a complex system, consisting of 100,000s of routers organized in over 12,000 autonomous networks (autonomous systems, ASes), serving 100s of millions of users. Integral components to understanding the Internet are measurments and models based on these measurements. This seminar covers topics ranging from workload and traffic characterization to protocol characterization (e.g., routing protocol such as BGP) and networked application characterization. In addition the seminar will cover analysis and modelling techniques based on measurements within the network and those based on end-to-end measurements. The course prerequisites includes a course on networking and reasonable statistics and/or probability sophistication. To register for this seminar, you need to fill out a course override form and get one of the instructors' signature.

CMPSCI 891S: Theory of Computation

Professor: Adler

Lectures on various topics in the theory of computation by CMPSCI theory faculty, possible guest speakers, and seminar students. May be repeated for credit. Prerequisite: Graduate standing in CMPSCI or permission of the instructor. 1 credit.

CMPSCI 899: PhD Dissertation

Professor: Staff

CMPSCI H01: Honors Colloquium for CMPSCI 201

Professor: Graham

Several concepts are explored in more depth than is possible in the CMPSCI 201 lectures and discussions. Readings are assigned and explored in once-a-week discussion sessions. Students are assigned projects using an Intel I86 based computer, such as the IBM PC, that requires application of the material discussed in both the CMPSCI H01 weekly discussions and in CMPSCI 201. Grades are based on written reports, participation in the weekly H01 discussions, and the application of discussed concepts in the assigned projects. Registration in CMPSCI 201 is required.

CMPSCI H02: Honors Colloquium for CMPSCI 287

Professor: Moll

Description not on file. 1 credit.

CMPSCI H03: Honors Colloquium for CMPSCI 401

Professor: Rosenberg

CMPSCI H04: Honors Colloquium for CMPSCI 377

Professor: Fagg

Description not on file. 1 credit.

CMPSCI H05: Honors Colloquium for CMPSCI 530

Professor: Wileden

Last automatic generation: 8/4/2005 at 1:27:12 PM