UMass Amherst

Department of Computer Science
 

Computer Science Course Descriptions for Spring of 2002

CMPSCI 102: Computers and Society (R2)

Professor: Spinelli

There are three principal components to this course: 1) what computers are, 2) how they are used in society, and 3) how their use affects society. In the first part we explore the origin of computers and the historical, economic, and scientific forces that brought them into existence. We also study the essential hardware components that make up a computer and we learn the basic software methods of programming using the JavaScript language. In the second part, usage of computers by business in the office and in factory automation, by the professions such as medicine, and by artists and scientists is covered; special attention is given to the advent of the Information Super Highway, how to use it and how it can benefit individual users. Finally the economic and socio-political impact that computers are having on society and on the individual are discussed; these issues range from questions of privacy to the impact of robots in the factory, to the use of computers in political action. The primary aim of the course is to impart sufficient computer literacy to enable the student to 1) write simple, but non-trivial programs, 2) make use of and benefit from available computer facilities, and 3) understand why computers have become such a powerful force in the modern society. Pre-Registration not available to majors and pre-majors. 3 credits.

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 1A, 2A, C, V, W, X 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 105C: Computer Literacy (R2)

Professor: Verts

CMPSCI 105V: Computer Literacy (R2)

Professor: Verts

CMPSCI 105X: Computer Literacy (R2)

Professor: Verts

CMPSCI 105Z: Computer Literacy

Professor:

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

Professor: Lehnert

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: Lehnert

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: Spinelli

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 6 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 121 Introduction to Problem Solving with Computers (R2) Christopher Eliot Same description as CMPSCI 121, D. Nico Spinelli.

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

Professor: Spinelli

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(195A): 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 proposed 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. 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: Moll

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. 4 credits. CMPSCI 187 Programming with Data Structures (R2) Robert Moll Same description as CMPSCI 187, ** SECTION DELETED.

CMPSCI 187D: Programming with Data Structures

Professor: Moll

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: Rissland

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-3 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: Ridgway, 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: Moll, Constantine

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: Rosenberg

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, Clarke

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: Hough, Moll

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: Hanson

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 391F: Seminar - HTML for Poets

Professor: Spinelli

An exploration of the Hyper Text Markup Language and its philosophical implications for Society in the New Millennium. Java Script will also be discussed. Students cannot receive credit for both this course and CMPSCI 591x Seminar-HTML for Poets. 3 credits.

CMPSCI 396A: Independent Study - Debugging and Consulting

Professor: Spinelli

In this course we teach students how to consult on topics involving E-mail, e.g., Pine or Goldmail or Mail; Operating Systems such as Unix; Editors such as Pico; one computer language: JavaScript; and most of HTML. Necessary skills on how to debug Home Pages written in HTML and simple but non trivial programs written in JavaScript are also acquired. Consultants are required to attend all weekly meetings [mandatory], consult with CMPSCI 102 students to review basic concepts and help debug programs [2hrs minimum weekly at a terminal]. Consultants are also required to grade programming assignments [6 for each student]. In general each consultant will be responsible for no less than 6 students. May not be repeated for credit more than twice. 3 credits.

CMPSCI 396B: Independent Study - TA for CMPSCI 391F Seminar - HTML for Poets

Professor: Spinelli

In the CMPSCI 391F seminar "HTML for Poets" we cover HTML in the first half, and Javascript during the second half. HTML, Javascript, and Java, form an extremely powerful trio of platform independent languages that allow practically anyone to propagate ideas, create business and retrieve massive amounts of information from the World Wide Web through the creation of Web sites and the use of Web browsers. Throughout the seminar HTML and Javascript are taught as tools to implement elements of design to realize web sites whose content needs to be communicated in a professional and appealing way. Possible political and philosophical consequences are also discussed. Students are required to use HTML and Javascript constructs learned in the seminar to create/improve a Web page of their own. Students are also required to review a professional Web site each week and analyze its content, form, appeal and tools used in its construction. A final project is also required. A large number of working examples are posted on the Web for student perusal. TAs for the Seminar must know and be able to explain the following material: Intro: Overview of the World Wide Web, Browsers and Servers. Basic HTML: Distributing Information with HTML, building blocks of HTML, creating an HTML document, linking HTML documents, graphics and Images. Advanced HTML: Client-side Imagemaps, Tables and Math, Frames, Embedded objects, Sound, MIDI, Animation, Forms and CGI scripts, Dynamic documents. Javascript: Javascript as an event driven, object-based, scripting language. Javascript versus Java. Events and event handlers. Programming basics: Variables, identifiers, types, scope of variables. Expressions, operators: arithmetic, string, logical, assignment, comparison. Statements: variable declaration, comments, conditional statements, loops, object manipulation, Functions. Objects: Objects, classes, inheritance. Objects built in Javascript: navigator, location, buttons, reset, select, submit, text and more. Arrays:built in Arrays, creating Arrays and filling them with data. Methods, properties and functions: math methods, string methods, date, window methods, blur, focus, select and more. Knowledge of Unix and mail filters is also required. 3 credits.

CMPSCI 401: Formal Language Theory

Professor: Adler

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: 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 453H: Computer Networks

Professor: ** Section Deleted

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

CMPSCI 496A: Independent Study - Real-Time Networked 3-D Game With Expert System

Professor: Hanson

Our objectives for this independent study are as follows: 1. To experience the process of software production by designing and implementing a real-time strategy game. 2. To design and implement a real-time expert system. 3. To design and create an interactive 3D environment based on random terrain generation. 4. To design a network model capable of facilitation multiple users concurrently and in real-time. 5. To study and master the art of low-resolution modeling, and to integrate this art into the game. 6. To produce an intuitive interface which ties all aspects of the game together. This project will explore both new and establised concepts and feature the finest art possible. 3credits.

CMPSCI 515(591S): 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 number theory, ciphers, hashes, key exchange, security services (integrity, availability, confidentiality, etc.), security attacks, vulnerabilities, exploits, countermeasures, and applications of security techniques for new services. Students will make extensiveuse of a lab for experimenting with security attacks and 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 520: Software Engineering: Synthesis and Development

Professor: Osterweil

Software Engineering I: This course introduces students to the principal activities involved in developing high-quality software systems. The course stresses the use of defined, systematic processes in the creation of carefully defined and engineered software products. Among the topics covered are requirements analysis, software architecture, formal specification methods, process definition, software design methods, and test planning. Issues specific to the development of software by teams and groups will also be addressed. Students will be required to read selected papers from the literature and complete homework projects. This course focuses on synthesis activities and complements CMPSCI 521, which focuses on software analysis techniques. Students are encouraged to take both courses but may take either course independently. Students who sign up for 620 will be expected to do more comprehensive projects than those who sign up for 520. Prerequisites: CMPSCI 320 or consent of instructor. 3credits.

CMPSCI 520X: Software Engineering: Synthesis and Development

Professor:

CMPSCI 521X: Software Engineering: Analysis and Evaluation

Professor:

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 530X: Programming Languages

Professor:

CMPSCI 546(591I): Web Search Engines

Professor: Allan

The course will cover the information retrieval techniques needed to build a Web-based search engine. Topics covered will include basic models of retrieval systems, Web crawling, indexing and text representation, efficient storage of indexes, high-throughput query processing, and use of link information to change ranks. The course will include implementation of major parts of a Web-based search engine. 3 credits.

CMPSCI 551: Three-Dimensional Animation and Digital Editing

Professor: Woolf

CMPSCI 552: Interactive Multimedia Production

Professor: Woolf

CMPSCI 553(591U): 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(591V): 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 571(591J): Knowledge-Based Computer Vision

Professor: ** Section Deleted

Building computer systems that can interpret visual information. The construction of computer models which describe the physical world depicted in an image. The basic components required to build vision systems and their possible organizations into functioning systems. The use of general world and domain specific knowledge in image understanding applications. Mathematical and algorithmic techniques to describe images in terms of extracted features which can be related to knowledge structures. The knowledge structures and the control mechanisms necessary to build the interpretation. Prerequisite: CMPSCI 570 Introduction to computer vision course, introduction to AI. The graduate version; CMPSCI 671(691J) has greater homework requirements. 3 credits.

CMPSCI 587(591B): Computing with Artificial Neural Networks

Professor: Barto

Artificial neural networks, also called connectionist systems, are networks of relatively simple processing elements that mimic some of the properties of biological neurons. By studying these abstract nervous systems, researchers hope to improve our understanding of how real nervous systems function as well as to advance the field of artificial intelligence. This course provides an in-depth treatment of the central artificial neural network methods, with an emphasis on their computational capabilities. Prerequisites: basic calculus, linear algebra, basic computer skills. 3 credits.

CMPSCI 589: Machine Learning

Professor: Utgoff

This course covers a variety of methods that enable a machine to learn. We will cover as much of Duda, Hart, & Stork s Pattern Recognition as time permits. Topics will include Bayesian decision theory, maximum-likelihood estimation, expectation maximization, nearest-neighbor methods, linear discriminants, support vector machines, artificial neural networks, classification and regression trees, ensemble classifiers, clustering, and self-organizing feature maps. There will be weekly problem sets including some programming. There will be a midterm, and a final exam. Homework for CMPSCI 589 will be less demanding than that of CMPSCI 689. Prerequisite: CMPSCI 383. 3 credits.

CMPSCI 591F: Seminar - Software Engineering Management Practicum

Professor: Staff, Moll

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 591N: Computer Networks

Professor: 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 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 591W: Seminar - Process Modeling and Analysis for Business and Government

Professor: ** Section Deleted

Process Modeling & Analysis is a crucial component of Information Systems implementation. It is also a critical but often overlooked activity in new systems development. Transitioning to e-Business or e-Government mandates rigorous process modeling and analysis. In this seminar, we will view tools and applications in business process modeling from multiple perspectives. We will begin with a look at the nature of processes. We will then examine illustrative examples of various kinds of processes, ranging from software development processes, to ecommerce processes such as auctions, to egovernment processes, such as those found in the Mass.Gov portal. We will then look at commercial tools for modeling business processes beginning with flow chart-like tools such as Visio, moving to Object Modeling Tools such as UML, and finally simulation tools such ProActivity. Finally, we will look at current research tools including UMass¡ own Little-JIL. We will attempt to evaluate these tools and systems in the context of the example processes previously studied. Our goal is to help students to understand why there are differences in process modeling approaches and tools, what those differences are, and how to determine which kinds of tools and approaches are likely to be most effective under different circumstances. Objectives: Provide a framework for understanding various kinds of processes; Survey and contrast process measurements and analysis approaches; Gain firsthand exposure and experience with actual process tools. Course Approach: The course meetings will focus on presentations of assigned papers, and general discussions by the class as a whole. Each student will be required to prepare a presentation on an assigned paper at least once during the semester. The instructors may lecture from time to time, but this will be the exception rather than the rule. Guest speakers from government, commercial vendors, and consulting companies will also be invited to provide differing perspectives. Student obligations: As noted above, each student will be responsible from organizing a presentation of one of the assigned papers, and for leading discussion of the paper. Each student will also be required to prepare a research paper on a topic related to the subject of the course. The topic of the paper must be approved by the course instructors. It is expected that each student will make a presentation to the class on their proposed research topic. Students will be expected to attend all class sessions and to participate actively in all discussions. 3 credits.

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

Professor: Woolf

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

Professor: Woolf

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

Professor: Woolf

CMPSCI 596D: Independent Study - Advanced Computer Modeling

Professor: Woolf

CMPSCI 596E: Independent Study - Jigsaw Puzzle Solving Robot Simulator

Professor: Grupen, Utogoff

Creation of a kinematically correct simulator of a robot which solves jigsaw puzzles.

CMPSCI 601: Computation Theory

Professor: Immerman

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: eight problem sets, timed midterm and final. Also open to qualified undergraduates. 3 credits.

CMPSCI 601X: Computation Theory

Professor:

CMPSCI 603: Robotics

Professor: Grupen

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 620: Advanced Software Engineering: Synthesis and Development

Professor: Osterweil

Software Engineering I: This course introduces students to the principal activities involved in developing high-quality software systems. The course stresses the use of defined, systematic processes in the creation of carefully defined and engineered software products. Among the topics covered are requirements analysis, software architecture, formal specification methods, process definition, software design methods, and test planning. Issues specific to the development of software by teams and groups will also be addressed. Students will be required to read selected papers from the literature and complete homework projects. This course focuses on synthesis activities and complements CMPSCI 521, which focuses on software analysis techniques. Students are encouraged to take both courses but may take either course independently. Students who sign up for 620 will be expected to do more comprehensive projects, that emphasize critical and analytic thinking, than those who sign up for 520. 3 credits.

CMPSCI 620X: Advanced Software Engineering: Synthesis and Development

Professor:

CMPSCI 621X: Advanced Software Engineering: Analysis and Evaluation

Professor:

CMPSCI 630(691F): 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 630X(691X): Programming Languages

Professor:

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(691A): Empirical Methods for Computer Science

Professor: Cohen

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 671(691J): Knowledge-Based Computer Vision

Professor: ** Section Deleted

Building computer systems that can interpret visual information. The construction of computer models which describe the physical world depicted in an image. The basic components required to build vision systems and their possible organizations into functioning systems. The use of general world and domain specific knowledge in image understanding applications. Mathematical and algorithmic techniques to describe images in terms of extracted features which can be related to knowledge structures. The knowledge structures and the control mechanisms necessary to build the interpretation. Prerequisite: CMPSCI 570 Introduction to computer vision course, introduction to AI. The graduate version; CMPSCI 671(691J) has greater homework requirements. 3 credits.

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 681(691V): Multi-Agent Problem Solving

Professor: Lesser, , ,

The next generation of complex computer systems will involve large collections of intelligent, heterogeneous agents (both human and machine) working cooperatively and competitively over wide-area distributed processing networks. These networks will be highly reliable in the face of incomplete and possibly inconsistent information and processor failure, will operate in a satisficing mode in which they do the best with available information, will negotiate among themselves to resolve differences, will exploit organizational structuring when there are large numbers of agents, and will reorganize themselves both over the shortterm and longterm, based on the capabilities of the evolving agent set and environment. This course will focus on the intellectual ideas and techniques, both heuristic and formal, involved in building such systems, and the agents that populate them. We will also discuss a number of specific application systems in the areas of distributed situation assessment, distributed planning and resource allocation, cooperative information gathering, concurrent design, electronic commerce, etc., that provide concrete examples. The underlying software architecture that supports the building of such systems will also be analyzed. 3 credits.

CMPSCI 689: Machine Learning

Professor: Utgoff

This course covers a variety of methods that enable a machine to learn. We will cover as much of Duda, Hart, & Stork's Pattern Recognition as time permits. Topics will include Bayesian decision theory, maximum-likelihood estimation, expectation maximization, nearest-neighbor methods, linear discriminants, support vector machines, artificial neural networks, classification and regression trees, ensemble classifiers, clustering, and self-organizing feature maps. There will be weekly problem sets including some programming. There will be a midterm, and a final exam. Homework for CMPSCI 589 will be less demanding than that of CMPSCI 689. Prerequisite: CMPSCI 383. 3 credits.

CMPSCI 691L: Seminar - Statistical Natural Language Processing

Professor: Allan

This course surveys statistical approaches to the construction of tools for the automatic processing of human language. We begin with a presentation of the basic mathematical and linguistic principles necessary for the study of the statistical approaches that will be covered. We continue with the study of techniques for addressing issues encountered by applications containing natural language processing (NLP) components. These tasks include: determining the meaning of an ambiguous word (e.g. bank as a place to put money vs. bank as in river bank); identifying phrases and other ombinations of words that have a specialized meaning (e.g.: hit the hay); learning properties of words automatically from available bodies of text (e.g.: the recipient of contribute is expressed as a prepositional phrase with to); determining the parts of speech of the words in a sentence (e.g.: laugh is a verb in She makes me laugh, and a noun in She enjoys a good laugh); determining the higher-level syntactic structure of a sentence; translating text from one language to another; classifying documents; and retrieving information from large text collections. 3 credits.

CMPSCI 691O: Seminar - Tools for Explanatory and Tutoring Systems

Professor: ** Section Deleted

This seminar examines recent work in explanatory and tutoring systems. We will explore research issues in: Collaboratory Environments, Dialogue Systems, Machine Learning, Teaching Strategies Simulators, Authoring Tools and User Models. The objective of the course is to stimulate awareness of research issues and to promote sound analytic and design skills as they pertain to building knowledge representations and control strategies. Relevant topics and applications will be presented through readings in the recent literature. Each student will prepare written critiques of each paper, lead several in-class discussions and prepare appropriate questions about the research. Several working systems will be available for hands-on critique. Readings for the course are contained in several bound volumes of articles and technical reports available in the main CMPSCI office. 3 credits.

CMPSCI 691S: Seminar - Introduction to Computer Science Research

Professor: ** Section Deleted

This course introduces graduate students to basic ideas about conducting a personal research program. Students will learn basic methods for reading technical papers, selecting research topics, devising research questions, planning research, and synthesizing broader theories. The course will be structured around three activities: lectures on basic concepts of research strategy and techniques, discussions of technical papers, and preparation and review of written assignments. Significant reading, reviewing, and writing will be required, and students will be expected to participate actively in class discussions. 3 credits.

CMPSCI 691T: Seminar - Hierarchical Probabilistic Models for AI

Professor: Mahadevan

The last decade has seen probabilistic computing become a cornerstone of many areas of artificial intelligence, including machine learning, natural language, planning, robotics, and vision. Statistical process models (e.g., HMMs, MDPs) have grown enormously in their importance, largely due to their applications to many real-world problems, including information retrieval, networking, perception, robotics, vision, smart rooms, and wearable computing. However, most applications have used "flat" models which scale badly to large problems. This course will focus on recent advances on multiscale decomposable models which are necessary for the next generation of larger-scale applications. In particular, the course will cover the relevant theory, major algorithms for learning (estimation) and control, and the main application areas where these multi-scale models can be used. Topics include (hierarchical) hidden-Markov models, semi-Markov decision processes, hierarchical reinforcement learning, partially observable MDPs, dynamic Bayes nets, probabilistic inference over compact models, and applications of these models. Students should have taken one of the following courses: CMPSCI 683 (AI) or CMPSCI 687 (RL) or CMPSCI 689 (ML). An undergraduate course in probability and statistics will be useful, and an domain expertise in one of the above application areas will be useful in doing a project. Course grading will be based on assignments, a midterm, and a final project. Student presentations (of project and selected papers) will be an integral part of the course. 3 credits.

CMPSCI 691W: Seminar - Introduction to Wearable Computing

Professor: Fagg

With computing devices becoming smaller and smaller, it is now (almost) possible for an an individual to don such a device as easily as one does a hat or a jacket. It is clear that these technologies will enable us to ultimately extend the desktop resources (including memory, computation, and communication) to almost anywhere we travel. More importantly, this constant access, augmented by a battery of body-mounted sensors, will enable our computers to be sensitive to the activities in which we are engaged, and thus allow the computer to participate in a collaborative and active manner as we perform our tasks. Realizing this dream requires the synthesis of many areas of computer science, computer engineering, and psychology. These areas include: operating systems, human-computer interaction, embedded systems, robotics, computer networks, software architectures, computer security, artificial intelligence, machine learning, information retrieval and computer architectures. This course will combine seminar-style reading/discussion of the relevant literature with hands-on work with wearable computers. Grades will be based upon presentation of papers, participation in the lecture, several programming-oriented homework assignments, and a semester-long project (software-oriented, but the potential exists for a hardware component). Topics will include: Context sensing and proactive behavior, Augmented reality, Software organization techniques, Wearable interfaces and connections to distributed sensor networks, Machine learning for context sensing and proactive presentation of information, Audio interfaces, Ad hoc networks, Affective computing. Prerequisites: a background in embedded systems/robotics/vision, machine learning, operating systems,and various "practical" dimensions (perl, C, unix/linux, java, digital electronics) is ideal. Permission of the instructor is sufficient. 3 credits.

CMPSCI 701: Advanced Computer Science Topics

Professor: Immerman

CMPSCI 791B: Seminar - Network Security

Professor: Towsley, Levine, Kurose, Gong

Topics covered include statistical and deterministic techniques for identifying network and host-based intrusions an distributed denial of service (DDOS) attacks, techniques for identifying the source of intrusions and attacks, modeling network virus/worm, measurement studies of worm/virus/intrusion and DDOS activities. Students registered for course will be expected to do the readings, present a paper, and participate in discussions. 1 credit.

CMPSCI 791L: Seminar in Biocomputation

Professor: Sieglemann

Bio-informatics includes the use of computational and mathematical techniques (e.g., algorithms, machine learning, AI, complexity theory, dynamical systems) to decipher complicated information in biological structures, gene sequences, and cellular signals. It also includes the construction of new technologies that have been overlooked before and whose roots are in nature, as is the aim of the IBM Blue gene project. This interdisciplinary field is of critical importance for understanding information from humongous biological sources, as well as for the design and construction of new computational methods, software, and hardware. Main topics include adaptive computational approaches and AI algorithms for structural and functional biology (e.g., protein structure prediction, prediction of proteins function and interactions prediction, fold prediction) , neural computation, "dynamical diseases" (e.g., finding structure in cardiac rhythms), building evolutionary robots, DNA and quantum computers, and more. The course will survey leading trends in bio-computation. Some topics will be introduced by invited lecturers who are active and well known in the field. 3 credits.

CMPSCI 791S: Seminar - Evaluating Finite State Verification Tools for Distributed Systems

Professor: Clarke

Finite state verification (FSV) is a promising approach for verifying properties about distributed systems. Unlike testing, FSV techniques can determine that a property is valid for all executions of a system or provide a counter example showing where an inconsistency might occur. Unlike theorem proving based verification techniques, FSV requires considerably less mathematical expertise. Model checking FSV approaches have successfully been applied to hardware and there is growing support for handling the complexity and scale of distributed systems. In this class we will evaluate a number of different FSV approaches including SPIN, SMV, VeriSoft, Java PathFinder, and some home grown systems such as INCA and FLAVERS. We will consider their ability to: verify properties, handle the complexity and scale of software systems, provide automated support for system abstractions and precision improvements, represent property specifications, and generate helpful counter examples. CMPSCI Graduate Majors Only. Undergraduates with permission of Instructor. 3 credits.

CMPSCI 791T: Seminar - Graph Separators and Their Algorithmic Applications

Professor: Rosenberg

The world of computation is heavily populated by graphs. Graphs have been used to advantage in modeling computational structures/phenomena as varied as: logic circuits, interconnection networks, data and control flow in programs, inter-word/phrase affinities in documents, inter-variable dependencies in algorithms, and on and on. In many computational situations, one can garner algorithmic advantage from understanding the decomposition structure of the modeling graph, as revealed by its "separators:" sets of edges or nodes whose removal partitions the graph into subgraphs of appropriate size or structure. In this seminar, we shall survey: 1. APPLICATIONS: the use of graph separators in the construction of provably good algorithms for a variety of problems; 2. ALGORITHMS: a variety of algorithms and heuristics for finding good separators in (large classes of) graphs; 3. LOWER BOUNDS: techniques for bounding from below the sizes of graph separators, as measured by the sizes of their separators. All presentations will be based on my book: A.L. Rosenberg and L.S. Heath: "Graph Separators, with Applications." Kluwer Academic/Plenum Publishing, 2001. Students will be expected to present sections of the book in class and to attempt to advance the state of the art via a piece of original research on a topic chosen in consultation with the instructor. (The research component will hopefully be done in groups.) The seminar is open only to students who have passed CMPSCI 611. 3 credits.

CMPSCI 791U: Seminar - Robot Intentionality-The Content of Robot Representations

Professor: Cohen

Intentionality is among the fundamental problems in philosophy of mind. The questions of intentionality we will address in this seminar include, what is a representation, how can a representation have meaning, and does meaning have a causal role in mental life. We will ask these questions of robots, and try to answer them by reference to the data structures and algorithms that produce behavior in robots. We will be especially concerned with the genesis of meaningful representations, and the fuzzy (non)boundary between engineered and autonomous systems. We will read Dretske, Dennett, Searle (but only a little), Fodor, and others. 3 credits.

CMPSCI 791V: Seminar - Current Topics in Computer Vision

Professor: Riseman, Schultz

The seminar will focus on a wide range of current topics in Computer Vision. The goal is to familiarize students with current research topics and to apply recent finding to research programs currently underway in the Vision and Robotics Laboratories. 3 credits.

CMPSCI 891S: Theory of Computation

Professor: Rosenberg

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

CMPSCI H02: Honors Colloquium for CMPSCI 287

Professor: Ridgway, Moll

Description not on file. 1 credit.

CMPSCI H03: Honors Colloquium for CMPSCI 320

Professor: ** Section Deleted

CMPSCI H04: Honors Colloquium for CMPSCI 530

Professor: Wileden

CMPSCI H06: Honors Colloquium for CMPSCI 453

Professor: 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. 1 credit.


Last automatic generation: 10/17/2008 at 9:38:55 AM


Comments:
www-admin@cs.umass.edu

© 2004 University of Massachusetts Amherst. Site Policies.
This site is maintained by the Department of Computer Science.