Computer Science Course Descriptions for Spring of 1999

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 forcein 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). The course uses the university's microcomputer labs, and weekly 90 minute lab sessions are an integral part of the course. 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 120: Introduction to Problem Solving with the Internet

Professor: Lehnert

The Internet is a goldmine of information and software resources for those who know how to plug into it and navigate it. Originally designed for computer scientists, the net is now open to the general public through educational computing accounts and commercial services. Unfortunately, much of the enabling technology associated with net navigation is still aimed at computer specialists. This course will provide non-CMPSCI majors with the basic skills needed to tap the net. We will cover basic UNIX commands, e-mail management, listserv software, Usenet newsgroups, ftp file transfers, telnet sessions, web browsers, basic web page design, strategies for finding things on the web, and PGP-based 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 121: Introduction to Problem Solving with Computers (R2)

Professor: 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 6 programming problems are assigned. In addition there are assigned homework problems, a midterm exam and a final. No computer science prerequisite, although high school algebra and basic math skills (e.g. R1) are assumed. Use of computer is required. 3 credits.

CMPSCI 187: Programming with Data Structures (R2)

Professor: Hanson

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 includepointer variables, 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 187D: Programming with Data Structures

Professor: Moll

CMPSCI 192S: Seminar - Undergraduate Colloquium

Professor: Barrington

Presentations from a variety of computer science faculty, students, and staff, 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 197X: Special Topics - Programming Java

Professor:

CMPSCI 201: Architecture and Assembly Language (E)

Professor: Graham

Lecture, lab. The architecture and machine-level operations of modern computers at the logic, component, and system levels: topics include binary arithmetic, logic gates, Boolean algebra, arithmetic-logic unit, control unit, system bus, memory, addressing modes, interrupts, input-output, floating point arithmetic, and virtual memory. Simple assembly language is used to explore how common computational tasks are accomplished by a computer. Three hours of lecture and one or two lab sessions per week, laboratory exercises, homework exercises, two midterm exams, and a final exam are required. Prerequisite: CMPSCI 187 or equivalent. 4 credits.

CMPSCI 250: Introduction to Computation (E)

Professor: Barrington

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 and regular languages: Myhill-Nerode Theorem, nondeterministic finite automata, Kleene's Theorem. Problem sets, 2-3 midterm exams, timed final. Corequisite: MATH 132/136 or equivalent. Prerequisite: CMPSCI 187 or equivalent. 4 credits.

CMPSCI 287: Programming Language Paradigms

Professor: Popplestone

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- (for example 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. 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 businesswith 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. 3 credits.

CMPSCI 311: Introduction to Algorithms

Professor: Sitaraman

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 algorthim to theoretical predictions. Mathematical experience (as provided by CMPSCI 250) is required. You should also be able to program in Pascalor C (or some other closely related language). 4 credits.

CMPSCI 320: Introduction to Software Engineering

Professor: Lerner

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

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 C++, 3 exams, 6 or more written homeworks. Prerequisites: CMPSCI 187, CMPSCI 201. 4 credits.

CMPSCI 383: Artificial Intelligence

Professor: Barto

Introduction to techniques for building intelligent machines: problem solving, state-space representation, heuristic search techniques, game playing, knowledge representation, logical reasoning, planning, reasoning under uncertainty, learning, expert systems, natural language processing, image understanding. Prerequisites: CMPSCI 250 and CMPSCI 287. 3 credits.

CMPSCI 391F: Seminar - HTML for Poets

Professor: Spinelli

An exploration of the Hyper Text Markup Language and its philosophical implications for Society at the threshold of the year 2000. Java Script will also be discussed. Students cannot receive credit for both this course and CMPSCI 591x Seminar-HTML forPoets. 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 VMS and Unix; Editors such as LSE and Pico; one computer language: BASIC; and some elementary HTML. Necessary skills on how to debug Home Pages written in HTML and simple but non trivial programs written in BASIC 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 [2 hrs 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 thantwice. 3 credits.

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

Professor: Spinelli

Description pending. 3 credits.

CMPSCI 401: Formal Language Theory

Professor: Barrington

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 interactive proofs. Problem sets, midterm, final, some group activities. Prerequisites: CMPSCI 250 and 311 or permission of instructor. 3 credits.

CMPSCI 453: Computer Networks

Professor: Towsley

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 five written assignments, three programming assignments (in C), one midterm and a final exam. This course will be lectured to both graduate and undergraduate students. Students enrolled for graduate-level credit will be required to complete additional homework problems and additional readings from the literature. Prerequisites: A rudimentary understanding of computer architecture and operating systems, while not required, would be helpful. Text: Computer Networks, A. Tanenbaum, Prentice Hall, 3rd ed., 1996. Copies of the instructors class notes will be available at Collective Copies (downtown Amherst) and are highly recommended. 3 credits.

CMPSCI 521: Software Engineering: Analysis and Evaluation

Professor: Adrion

Since software is an integral part of our societal infrastructure, we will explore approaches to testing, analysis and evaluation to improve software quality, safety, robustness and reliability across the lifecycle. Laboratory requirement: students will be required to carry out an individual or group project that applies advanced techniques and methods in some depth or which extends existing or synthesizes new techniques and methods. Text: course materials will be drawn from the software engineeringliterature. Prerequisites: CMPSCI 320, Introduction to Software Engineering (or equivalent course). 3 credits.

CMPSCI 530: Programming Languages

Professor: Wileden

This course uses a detailed examination of the Java programming language 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,then comparing and contrasting with the realizations found in other modern languages such as C++, Ada 95, CLOS, ML 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, other paradigms such as the functional and logic programming paradigms are also discussed. Homework problems, programming exercises and projects reinforce the material covered in lectures and readings. Prerequisites: CMPSCI 287, 320 and 377. Corequisite: CMPSCI 401. Honors module when requested. 3 credits.

CMPSCI 530X: Programming Languages

Professor:

CMPSCI 551: Three-Dimensional Animation and Digital Editing

Professor: Woolf

This seminar is dedicated to the production of high quality computer animation using microcomputer based 3-dimensional graphics technology. For example, color 3-D objects are defined and manipulated, digitized images created and altered, and animated sequences produced directly on the computer. Techniques are used to bend and twist shapes around objects or lines and to trace over images including digitized pictures. The course is directed at production of an informative and approachable video of a ten minute 3-dimensional animated piece. Using computer-generated graphical analogies as well as cartoon caricature, the video is designed to educate and entertain. 3 credits.

CMPSCI 551: Supplement to CMPSCI 591K

Professor: Woolf

Supplement to CMPSCI 591K Three-Dimensional Animation and Digital Editing. Students will complete five independent projects and one group project, and will be evaluated based on the quality of animations and participation in the final project. 1 credit.

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 laboratory has had a large collection of computer animation, graphic, and multimedia tools, and is developing new authoring tools. During the first month and a half, the course will concentrate on state-of-the-art multimedia composition and presentation techniques and developing small individual projects. The second half of the semester will emphasize working as a group to create a single, high quality multimedia production. Prerequisite: CMPSCI 591_ Seminar - 3D Computer Animation and Digital Editing. Permission of the instructor required; contact: Beverly Woolf 545-4265. 3 credits.

CMPSCI 575: Combinatorics and Graph Theory

Professor: Moll

This introductory course for advanced undergraduates in computer science, mathematics, and related fields, presents the basics of combinatorics and graph theory with a slight bias towards algorithms and applications in computer science. Topics include: basic counting ideas; generating functions; recurrence relations; principle of inclusion and exclusion; Polya's theory of counting; graph theory basics; planarity and dual graphs; graph coloring; matching and flows. Prerequisites: MATH 235, and either CMPSCI 311 or MATH 411, or permission of instructor. 3 credits.

CMPSCI 591I: Seminar - Java for Embedded Systems

Professor: Popplestone

We may define an embedded system thus: An embedded system is one in which one or more (digital) processors are used as controlling agents of a system that has a significant interaction with the world outside itself. Thus embedded systems can be as simple as a microwave oven and as complex as an aircraft or TGV are embedded systems. In this seminar we'll look at some of the issues involved in the use of the Java language for creating and interacting with embedded systems. To provide focus for the course, we will consider one particular embedded system, namely a model railway which is controlled by a distributed system of micro-controllers, one per track-section. (1) There's a real need to interface embedded systems to the Web.An intelligent house, for example, should be visible to its owner while he or she is away. And it would be convenient to be able to specify actions remotely as well. But such an interface has to be safe - proof against accidental or malicious improper instructions. So one thing we'll look at is how to construct a server that presents the state of an embedded system on the Web, and receives commands, validates them, and if valid executes them. If they're invalid, the server should provide diagnostic information. Currently, the embedded software is written in a mixture of Interactive C and assembly code. I would envisage the server being written in Java, but it'll need some hooks to be put into the embedded system processors themselves. (2) We should also look at the issues involved in writing the actual embedded system code in Java. Processors on which embedded systems run are often small, possibly heterogeneous and in other ways peculiar. So we need to findout what's going on in the world in this direction. In particular, we should look at Sun's Embedded Java, which appears to be targetted exactly at our requirements. Also there's some interesting work being done here in the UMASS Computer Science Department on compiler architectures for heterogeneous systems. Additional credit may be granted by meeting independently of classtime and completing an extended project. 1 credit.

CMPSCI 591N: Seminar - Java for Embedded Systems

Professor: Popplestone

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

Professor: Woolf

Description not on file. 3 credits.

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

Professor: Woolf

Description not on file. 3 credits.

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? Text: Papadimitriou, "Computational Complexity". 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) useful but not required -- students with none may wish to consult Lewis and Papadimitriou, "Elements of the Theory of Computation", or Hopcroft and Ullman, "Introduction to Automata Theory, Languages, and Computation". Course requirements: about six problem sets, timed midterm and final. Also open to qualified undergraduates. 3 credits.

CMPSCI 601X: Computation Theory

Professor:

CMPSCI 603: Robotics

Professor: Grupen

This course is concerned with the design and analysis of adaptive, closed-loop physical systems. The focus will be sensorimotor machines that interpret and manipulate their environments. Techniques for modifying the dynamics of the closed-loop systemin response to cumulative information to achieve goal oriented behavior will be presented. Toward this end, we will study mechanisms (kinematics and dynamics), actuators, sensors (with a focus on active vision), optimal estimators, connectionist approaches to pattern recognition, feedback control theory, application of reinforcement learning (an architecture for organizing behavior). Wherever possible, we will relate these techniques to biological systems. 3 credits.

CMPSCI 603X: Robotics

Professor:

CMPSCI 620X: Advanced Software Engineering: Synthesis and Development

Professor:

CMPSCI 621: Advanced Software Engineering: Analysis and Evaluation

Professor: Adrion

As society increasingly relies on software, we must improve quality, safety, robustness and reliability across the lifecycle. The course covers traditional analysis, software architectures, software safety and concurrent, distributed systems. Laboratory requirement: students will be required to carry out an individual or group project that applies advanced techniques and methods in some depth or which extends existing or synthesizes new techniques and methods. Text: course materials will be drawn from the software engineering literature. Prerequisites: CMPSCI 320, Introduction to Software Engineering (or equivalent course). 3 credits.

CMPSCI 621X: Advanced Software Engineering: Analysis and Evaluation

Professor:

CMPSCI 630: Programming Languages

Professor: Wileden

This course uses a detailed examination of the Java programming language 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,then comparing and contrasting with the realizations found in other modern languages such as C++, Ada 95, CLOS, ML 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, other paradigms such as the functional and logic programming paradigms 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: Programming Languages

Professor:

CMPSCI 635: Modern Computer Architecture

Professor: Weems

This course will examine modern high performance computer architectures, including superscalar, superpipeline, multithreaded, vector, data parallel, control parallel, and heterogeneous systems. The performance, economic, and design considerations leading to each of the architectural approaches will be examined together with the implications for software support of the architectures (both language and OS issues). Prerequisites: CMPSCI 535 and either CMPSCI 377 or CMPSCI 410, or equivalent. 3 credits.

CMPSCI 635X: Modern Computer Architecture

Professor:

CMPSCI 646: Information Retrieval

Professor: Croft

The course will cover basic and advanced techniques for text-based information systems. Topics covered include retrieval models, indexing and text representation, browsing and query formulation, routing, distributed information retrieval, and integration with database systems. The course will include implementation of major elements of an information retrieval system. Prerequisite: CMPSCI 445 or equivalent. 3 credits.

CMPSCI 650: 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 653: Computer Networking

Professor: Towsley

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 five written assignments, three programming assignments (in C), one midterm and a final exam. This course will be lectured to both graduate and undergraduate students. Students enrolled for graduate-level credit will be required to complete additional homework problems and additional readings from the literature. Prerequisites: A rudimentary understanding of computer architecture and operating systems, while not required, would be helpful. Text: Computer Networks, A. Tanenbaum, Prentice Hall, 3rd ed., 1996. Copies of the instructors class notes will be available at Collective Copies (downtown Amherst) and are highly recommended. 3 credits.

CMPSCI 653X: Computer Networking

Professor:

CMPSCI 677: Operating Systems

Professor: Ramamritham

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 686: Reasoning and Acting Under Uncertainty

Professor: Zilberstein

Complex computer systems are frequently required to make decisions based on uncertain and incomplete information. This problem arises in automated diagnosis and repair systems, forecasting, image processing, multi-sensor fusion, and planning. This course covers recently developed methods that allow intelligent systems to reason under uncertainty. It blends theoretical background with efficient reasoning techniques and applications. Topics include the sources of uncertainty in intelligent systems, numeric and symbolic approaches to uncertainty, fundamental concepts of probability theory, probabilistic reasoning with Bayesian networks, decision theory and the value of information, influence diagrams, Depster-Shafer theory of evidence, Fuzzy logic and Zadeh's possibility theory, support logic, nonmonotonic reasoning, and software packages for reasoning under uncertainty. Prerequisites: An undergraduate AI course or permission of instructor. 3 credits.

CMPSCI 691T: Seminar - Cyberlaw

Professor: Rissland

Cyberlaw-the law of computers-is an area of exploding interest and emerging legal problems. In this seminar, we will explore several selected topics in this fast-moving area. We will begin with discussion of selected topics in constitutional law concerning the First Amendment (e.g., free speech) and the Fourth Amendment (e.g., warrantless search and seizure). Next, we will sample some of the on-going controversies in the area of intellectual property law, including the problem of applying traditional copyright and patent law to software. We will also explore the current debate on cryptography. Each topic will involve reading of primary sources, such as appellate case opinions, as well as commentaries on them, such as articles from the computer science, legal, and popular media. Each participant will be responsible for working up one topic in depth for presentation and discussion. We will enlist the expertise of participants to inform our discussions. For instance, a participant well-versed inthe area of computer networks might discuss problems of security and privacy in the context of a networked environment, or a participant well-versed in constitutional law might discuss the broad doctrines of current First Amendment law and their relevance in the context of the internet. Permission of the instructor is required. For graduate students or advanced undergraduates. 3 credits.

CMPSCI 710X: Advanced Compiler Techniques

Professor:

CMPSCI 741: Complexity Theory

Professor: Barrington, Immerman

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 754: Multimedia Systems

Professor: Shenoy

CMPSCI 754 (791K) is an advanced course covering both theoretical and practical issues in designing multimedia systems. Topics to be covered include introduction to multimedia systems, digital video compression techniques, operating system support for digital audio and video, as well as network and transport protocols for multimedia. An emphasis will be placed on current design issues and research topics. The course assumes familiarity with concepts in computer networks and operating system design. 3credits.

CMPSCI 791G: Seminar - Environmental Monitoring by Aerial Image Interpretation

Professor: Schultz, Riseman

There are a series of research collaborations that have been initiated between the Departments of Computer Science and Forestry and Wildlife Management for environmental monitoring by aerial image interpretation. This seminar invites both CS and Forestry students to examine the state-of-the-art methodologies for classification and three-dimensional terrain modeling from multiple aerial images. The class will emphasize hands-on experience with commercial GIS, wildlife and natural resource inventory, and customized research software. Real environmental monitoring applications being employed by USGS, The Nature Conservancy, and Conservation International will be studied. Student will be involved in readings, reports, and/or class projects. Cross-listed with Forestry and Wildlife Management (FOREST 791G). 3 credits.

CMPSCI 791S: Seminar - Optimizing Java

Professor: McKinley, Moss

We will read papers from the nascent literature on optimization of Java programs and virtual machines. The requirements are to read the papers, to take charge of leading discussion of a fair share of them, and to write up an abstract and critique of each paper led for a Web page for use by the students and others at UMass. 1 credit.

CMPSCI 791T: Seminar - Game Theory and Learning

Professor: Barto

This seminar will be a graduate level introduction to the basic concepts of game theory, focusing on relevance to artificial Intelligence. Of particular interest will be ways of applying machine learning in a game theoretic setting and using ideas fromgame theory as inspiration for the design of AI systems. Students will take turns presenting chapters from an introductory textbook and relevant papers. We begin by covering basic ideas from game theory: equilibrium, extensive and strategic forms of games, perfect vs. imperfect information, repeated games. Further topics in game theory and its relationship to AI and machine learning will be determined by participants' interest. 3 credits.

CMPSCI 791U: Seminar - Special Topics in Parallel Algorithms and Architectures

Professor: Rosenberg

This offering of the seminar will concentrate on the problem of scheduling computations on networks of workstations (NOWs). The two desiderata for a scheduling algorithm are (a) to be easy to compute, and (b) to produce efficient schedules. We shall survey the (not very large) literature on analyzed scheduling algorithms for NOWs. After a seed lecture by the instructor, papers will be presented by the students. We shall attempt to create an environment in which some original research will emerge from the seminar. 3 credits.

CMPSCI 791V: Seminar - Workflow, Process, Groupware, and Collaboration Technology

Professor: Ramamritham, Osterweil

This course will examine the issue of how to effectively specify the way in which work gets done and products get made. As computers become increasingly pervasive and active agents in the creation of all sorts of products (both tangible and intangible) more and more of such activities are becoming increasingly automated. This increasing automation of widening classes of activities should compel us to focus more attention on the processes themselves. Surely it is important to develop process descriptions that lend themselves well to automation. But it is not clear that complete automation should be the goal. Increasingly it seems likely that the most effective processes are probably those that smoothly integrate the activities of humans and machines, with each type of agent doing the sorts of work for which it is best suited. This raises important and interesting questions of how to choreograph these sorts of partnerships. In addition, as processes become increasingly automated, it is important to be sure that their descriptions are correct, complete, robust, fair, and reliable. There are important and interesting questions in this area as well. In this seminar we will survey the literature describing efforts to define the processes thathuman/computer partnerships carry out to get work done. We will survey the growing literature in the area of workflow, where there is a thriving marketplace of commercial tools to support the performance of complex work activities. Complementing this is a growing body of research that is steadily adding to the capabilities offered by commercial tools. This body of work bears striking similarities to work in the area of software process. We will survey the software process technology literature as well, where software modelling and programming approaches are used to specify software development processes. Complementing the work in these areas is work in groupware and collaboration technology. Here the emphasis is on helping humans to work together more effectively by specifying how computing and communication technologies can be used for support. We will also examine the literature in these areas. It is expected that the literature surveyed will show that there are important similarities of approach even though the problems addressed may seem to be quite varied. The aim of the course will be to help students understand the basic problems, issues, and approaches that are common to all of these areas, and to also understand inherent differences in underlying problems and suggested approaches. All students will be expected to read all the papers assigned in the course. Students will take turns preparing presentations of papers to the group. A term paper on a topic relevant to the course material will be required. 3 credits.

CMPSCI 791W: Seminar - Components, Heterogeneity and Interoperability

Professor: Wileden

This course will be a graduate seminar exploring the topics of (software) components, heterogeneity in computing systems and interoperability. We will study both existing, commercially supported approaches to these problems, such as CORBA and COM/DCOM, and emerging or research approaches. Readings will come from recent literature and materials available on the World Wide Web. Students will be expected to read, make class presentations, participate in discussions and do some exercises and/or projects.3 credits.

CMPSCI 891S: Theory of Computation

Professor: Barrington

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 H01: Honors Colloquium for CMPSCI 287

Professor: Popplestone

We will examine how the programming paradigms discussed in 287 are exhibited in more modern Functional Languages (SML, Haskell), Logic Languages (Prolog), Object Oriented Languages (C++ & the objectclass extension of Pop-11). Recommended for Juniors, Seniors. 1 credit.

CMPSCI H02: Honors Colloquium for CMPSCI 201

Professor: Graham

We select one or more of the course topics and explore them in more depth than is possible in the main course. In particular, we see how the architectural concepts are applied in a real computer rather than the simple instructional computer used in class. Readings are assigned and discussed in once-a-week meetings. Students are assigned one or more projects using an Intel I86 based computer, such as the IBM PC, that require application of the concepts studied in class. Grades are based on written reports, participation in discussions, and the application of concepts in the projects. 1 credit.

CMPSCI H03: Honors Colloquium for CMPSCI 311

Professor: Sitaraman

We study more advanced material in the theory and implementation of algorithms. Possible topics include approximate string matching, computational biology, computational geometry, cryptography, approximate solution to combinatorial optimization problems, advanced data structures, parallel algorithms, and data compression. Typically, students research an area of mutual interest, and present it to the rest of the class. 1 credit.

CMPSCI H04: Honors Colloquium for CMPSCI 320

Professor: Lerner

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. Honors students will be expected to assume responsibility for some of the more complex aspects as well as to study more advanced concepts. 1 credit.

CMPSCI H05: Honors Colloquium for CMPSCI 530

Professor: Wileden

The Honors section will meet with the instructor one hour per week to conduct additional readings in the area of programming languages. Programming projects are also possible if student interest allows. 1 credit.

CMPSCI H06: Honors Colloquium for CMPSCI 591G (521)

Professor: Adrion

This course explores testing and analysis techniques for software systems, particularly large, complex systems used in life-critical applciations such as medical devices and air traffic control. Honors students will work with the instructor on special projects, depending on their individual interests and opportunities that arise. For example, students might help implement or enhance a specific technique, conduct an experimental study using a small number of techniques, or design a quality assurance plan for a company or project. Recommended for Juniors and Seniors; Majors. 1 credit.

Last automatic generation: 8/4/2005 at 11:48:50 AM