201. Computer Science Seminar. (2)
Seminar, four hours; outside study, two hours. Designed for graduate computer science students. Seminars on current research topics in computer science. May be repeated for credit. S/U grading. (F,W,Sp)
202. Advanced Computer Science Seminar. (4)
Seminar, four hours; outside study, eight hours. Preparation: completion of major field examination in computer science. Current computer science research into theory of, analysis and synthesis of, and applications of information processing systems. Each member completes one tutorial and one or more original pieces of work in the specialized area. May be repeated for credit. Letter grading. Ms. Estrin (F,W,Sp)
211. Network Protocol and Systems Software Design for Wireless and Mobile Internet. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 118. Designed for graduate students. In-depth study of network protocol and systems software design in area of wireless and mobile Internet. Topics include (1) networking fundamentals: design philosophy of TCP/IP, end-to-end arguments, and protocol design principles, (2) networking protocols: 802.11 MAC standard, packet scheduling, mobile IP, ad hoc routing, and wireless TCP, (3) mobile computing systems software: middleware, file system, services, and applications, and (4) topical studies: energy-efficient design, security, location management, and quality of service. Letter grading. Mr. Lu (F)
212A. Queueing Systems Theory. (4)
Lecture, four hours; outside study, eight hours. Requisites: course 112, Electrical Engineering 131A. Resource sharing issues and theory of queueing (waiting-line) systems. Review of Markov chains and baby queueing theory. Method of stages. M/E r /1. E r /M/1. Bulk arrival and bulk service systems. Series-parallel stages. Fundamentals of open and closed queueing networks. Intermediate queueing theory: M/G/1; G/M/m. Collective marks. Advanced queueing theory: G/G/1; Lindley integral equation; spectral solution. Inequalities, bounds, approximations. Letter grading. Mr. Gerla (W)
212B. Queueing Applications: Scheduling Algorithms and Queueing Networks. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 212A. Priority queueing. Applications to time-sharing scheduling algorithms: FB, Round Robin, Conservation Law, Bounds. Queueing networks: definitions; job flow balance; product form solutions -- local balance, M→M; computational algorithms for performance measures; asymptotic behavior and bounds; approximation techniques -- diffusion -- iterative techniques; applications. Letter grading. Mr. Muntz
213. Distributed Embedded Systems. (4)
Lecture, four hours; outside study, eight hours. Requisites: courses 111, 118. Designed for graduate students. Important class of distributed networks are those that support monitoring and manipulation of physical spaces through wireless sensor networks. Study of distributed protocols needed to realize these systems. Topics include design implications of energy and otherwise resource-constrained nodes, network self-configuration and adaptation, localization and time synchronization, programming paradigm, applications, and usage issues such as human interfaces, safety, and security. Letter grading. Ms. Estrin (W)
214. Data Transmission in Computer Communications. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 112. Limited to graduate computer science students. Discrete data streams, formats, rates, transductions; digital data transmissions via analog signaling in computer communication; media characteristics, systems methodologies, performance analysis; modem designs; physical interfaces in computer communication links; national/international standards; tests and measurements. Letter grading. Mr. Carlyle
215. Computer Communications and Networks. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 112. Resource sharing; computer traffic characterizations; multiplexing; network structure; packet switching and other switching techniques; ARPANET and other computer network examples; network delay and analysis; network design and optimization; network protocols; routing and flow control; satellite and ground radio packet switching; local networks; commercial network services and architectures. Optional topics include extended error control techniques; modems; SDLC, HDLC, X.25, etc.; protocol verification; network simulation and measurement; integrated networks; communication processors. Letter grading. Mr. Chu (F)
216. Distributed Multiaccess Control in Networks. (4)
Lecture, four hours; outside study, eight hours. Requisites: courses 212A, 215. Topics from the field of distributed control and access in computer networks, including terrestrial distributed computer networks; satellite packet switching; ground radio packet switching; local network architecture and control. Letter grading. Mr. Kleinrock (Sp)
217. Advanced Topics in Internet Research. (4)
Lecture, four hours; outside study, eight hours. Designed for graduate students. Overview of Internet development history and fundamental principles underlying TCP/IP protocol design. Discussion of current research topics, including multicast routing protocols, multicast transport protocols (e.g., real-time, transport protocol, RTP, and SRM), support for integrated services, World Wide Web, multimedia applications on Internet. Fundamental issues in network protocol design and implementations. Letter grading. Ms. Zhang
218. Advanced Computer Networks. (4)
Lecture, four hours; outside study, eight hours. Requisites: courses 112, 118. Review of seven-layer ISO-OSI model. High-speed networks: LANs, MANs, ATM. Flow and congestion control; bandwidth allocation. Internetting. Letter grading. Mr. Gerla (W)
219. Current Topics in Computer System Modeling Analysis. (2 to 12)
Lecture, four hours; outside study, eight hours. Review of current literature in an area of computer system modeling analysis in which instructor has developed special proficiency as a consequence of research interests. Students report on selected topics. May be repeated for credit with consent of instructor. Letter grading.
M222. Control and Coordination in Economics. (4)
(Same as Economics M222A.) Lecture, three hours. Recommended preparation: appropriate mathematics course. Designed for graduate economics and engineering students. Stabilization policies, short- and long-run dynamics and stability analysis; decentralization, coordination in teams; certainty equivalence and separation theorems; stochastic and learning models. Bayesian approach to price and output rate adjustment. S/U or letter grading.
230A. Models of Information and Computation. (4)
Lecture, four hours; outside study, eight hours. Requisites: courses 131, 181. Paradigms, models, frameworks, and problem solving; UML and metamodeling; basic information and computation models; axiomatic systems; domain theory; least fixed point theory; well-founded induction. Logical models: sentences, axioms and rules, normal forms, derivation and proof, models and semantics, propositional logic, first-order logic, logic programming. Functional models: expressions, equations, evaluation; combinators; lambda calculus; functional programming. Program models: program derivation and verification using Hoare logic, object models, standard templates, design patterns, frameworks. Letter grading. Mr. Bagrodia, Mr. Parker, Mr. Zaniolo
233A. Parallel Programming. (4)
Lecture, four hours; outside study, eight hours. Requisites: courses 111, 131. Mutual exclusion and resource allocation in distributed systems; primitives for parallel computation: specification of parallelism, interprocess communication and synchronization, atomic actions, binary and multiway rendezvous; synchronous and asynchronous languages: CSP, ADA, LINDA, MAISIE, UC, and others; introduction to parallel program verification. Letter grading. Mr. Bagrodia
233B. Verification of Concurrent Programs. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 233A. Formal techniques for verification of concurrent programs. Topics include safety, liveness, program and state assertion-based techniques, weakest precondition semantics, Hoare logic, temporal logic, UNITY, and axiomatic semantics for selected parallel languages. Letter grading.
239. Current Topics in Computer Science: Programming Languages and Systems. (2 to 12)
Lecture, four hours; outside study, eight hours. Review of current literature in an area of computer science programming languages and systems in which instructor has developed special proficiency as a consequence of research interests. May be repeated for credit with topic change. Letter grading.
240A. Databases and Knowledge Bases. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 143. Theoretical and technological foundation of Intelligent Database Systems, which merge database technology, knowledge-based systems, and advanced programming environments. Rule-based knowledge representation, spatio-temporal reasoning, and logic-based declarative querying/programming are salient features of this technology. Other topics include object-relational systems and data mining techniques. Letter grading. Mr. Zaniolo (F)
240B. Advanced Data and Knowledge Bases. (4)
(Formerly numbered 249.) Lecture, four hours; outside study, eight hours. Requisites: courses 143, 240A. Logical models for data and knowledge representations. Rule-based languages and nonmonotonic reasoning. Temporal queries, spatial queries, and uncertainty in deductive databases and object relational databases (ORDBs). Abstract data types and user-defined column functions in ORDBs. Data mining algorithms. Semistructured information. Letter grading. Mr. Muntz, Mr. Parker, Mr. Zaniolo
241A. Object-Oriented and Semantic Database Systems. (4)
Lecture, three and one-half hours; discussion, 30 minutes; laboratory, one hour; outside study, seven hours. Requisite: course 143. Object database principles and requirements. Data models, accessing, and query languages. Object data management standards. Extended relational-object systems. Database systems architecture and functional components. Systems comparison. Commercial products. Database design, organization, indexing, and performance. Future directions. Other topics at discretion of instructor. Letter grading. Mr. Cardenas
241B. Pictorial and Multimedia Database Systems. (4)
Lecture, three and one-half hours; discussion, 30 minutes; laboratory, one hour; outside study, seven hours. Requisites: courses 143, 241A. Multimedia data: alphanumeric, long text, images/pictures, video, and voice. Multimedia information systems requirements. Data models and accessing. Querying, visual languages, and communication. Database design and organization, logical and physical. Search by content and indexing methods. Internet multimedia streaming. Data heterogeneity and distribution. Other topics at discretion of instructor. Letter grading. Mr. Cardenas
244A. Distributed Database Systems. (4)
Lecture, four hours; outside study, eight hours. Requisites: courses 215 and/or 241A. File allocation, intelligent directory design, transaction management, deadlock, strong and weak concurrency control, commit protocols, semantic query answering, multidatabase systems, fault recovery techniques, network partitioning, examples, trade-offs, and design experiences. Letter grading. Mr. Chu (Sp)
245A. Intelligent Information Systems. (4)
Lecture, four hours; outside study, eight hours. Requisites: courses 241A, 255A. Knowledge discovery in database, knowledge-base maintenance, knowledge-base and database integration architectures, and scale-up issues and applications to cooperative database systems, intelligent decision support systems, and intelligent planning and scheduling systems; computer architecture for processing large-scale knowledge-base/database systems. Letter grading. Mr. Chu
249. Current Topics in Data Structures. (2 to 12)
Lecture, four hours; outside study, eight hours. Review of current literature in an area of data structures in which instructor has developed special proficiency as a consequence of research interests. Students report on selected topics. May be repeated for credit with consent of instructor. Letter grading.
251A. Advanced Computer Architecture. (4)
Lecture, four hours; outside study, eight hours. Requisite: course M151B. Recommended: course 111. Design and implementation of high-performance systems, advanced memory hierarchy techniques, static and dynamic pipelining, superscalar and VLIW processors, branch prediction, speculative execution, software support for instruction-level parallelism, simulation-based performance analysis and evaluation, state-of-the-art design examples, introduction to parallel architectures. Letter grading. Mr. Ercegovac, Mr. Tamir (F)
251B. Parallel Computer Architectures. (4)
Lecture, four hours; outside study, eight hours. Requisite: course M151B. Recommended: course 251A. SIMD and MIMD systems, symmetric multiprocessors, distributed-shared-memory systems, messages-passing systems, clusters, interconnection networks, user-level host-network interfaces, switching element design, communication primitives, cache coherency, memory consistency models, synchronization primitives, state-of-the-art design examples. Letter grading. Mr. Ercegovac, Mr. Tamir (W)
252A. Arithmetic Algorithms and Processors. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 251A. Number systems: conventional, redundant, signed-digit, and residue. Types of algorithms and implementations. Complexity measures. Fast algorithms and implementations for two-operand addition, multioperand addition, multiplication, division, and square root. On-line arithmetic. Evaluation of transcendental functions. Floating-point arithmetic and numerical error control. Arithmetic error codes. Residue arithmetic. Examples of contemporary arithmetic ICs and processors. Letter grading. Mr. Ercegovac (F)
253A. Design of Fault-Tolerant Systems. (4)
Lecture, four hours; outside study, eight hours. Requisite or corequisite: course 251A. Fundamental concepts of dependable computing. Design methodology for fault-tolerant systems. Analytic models and measures, modeling tools. Design for critical applications: long-life, real-time, and high-availability systems. Tolerance of design faults: design diversity and fault-tolerant software. Letter grading. Mr. Rennels (W)
253C. Testing and Testable Design of VLSI Systems. (4)
Lecture, four hours; outside study, eight hours. Requisite: course M51A. Detailed study of various problems in testing and testable designs of VLSI systems, including fault modeling, fault simulation, testing for single stuck faults and multiple stuck faults, functional testing, design for testability, compression techniques, and built-in self-test. Letter grading. Mr. Cong
254A. Computer Memories and Memory Systems. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 251A. Generic types of memory systems; control, access modes, hierarchies, and allocation algorithms. Characteristics, system organization, and device considerations of ferrite memories, thin film memories, and semiconductor memories. Letter grading. Mr. Chu, Mr. Rennels (Sp)
255A. Distributed Processing Systems. (4)
Lecture, four hours; outside study, eight hours. Requisites: courses 215 and/or 251A. Task partitioning and allocation, interprocess communications, task response time model, process scheduling, message passing protocols, replicated file systems, interface, cache memory, actor model, fine grain multicomputers, distributed operating system kernel, error recovery strategy, performance monitoring and measurement, scalability and maintainability, prototypes and commercial distributed systems. Letter grading. Mr. Chu (W)
256A. Advanced Scalable Architectures: Systems, Building Blocks, and Technology. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 251A. State-of-the-art scalable multiprocessors and multicomputers. High-performance VLSI building blocks. Capabilities and limitations of VLSI technology. Interdependency among implementation technology, packaging, chip microarchitecture, and system architecture. Mechanisms for exploiting parallelism. Current research areas. Examples of chips and systems. Letter grading. Mr. Tamir (Sp)
M258A. Design of VLSI Circuits and Systems. (4)
(Same as Electrical Engineering M216A.) Lecture, four hours; discussion, one hour; laboratory, four hours; outside study, three hours. Requisites: course M51A or Electrical Engineering M16, and Electrical Engineering 115A. Recommended: Electrical Engineering 115C. LSI/VLSI design and application in computer systems. Fundamental design techniques that can be used to implement complex integrated systems on a chip. Letter grading. Mr. Rennels
M258B-M258C. LSI in Computer System Design. (4-4)
(Same as Electrical Engineering M216B-M216C.) Lecture, four hours; laboratory, four hours. Requisite: course M258A. LSI/VLSI design and application in computer systems. In-depth studies of VLSI architectures and VLSI design tools. In Progress and S/U or letter grading. Mr. Rennels
258E. Foundations of VLSI CAD Algorithms. (4)
Lecture, four hours; outside study, eight hours. Preparation: one course in analysis and design of algorithms. Basic theory of combinatorial optimization for VLSI physical layout, including mathematical programming, network flows, matching, greedy and heuristic algorithms, and stochastic methods. Emphasis on practical application to computer-aided physical design of VLSI circuits at high-level phases of layout: partitioning, placement, graph folding, floorplanning, and global routing. Letter grading. Mr. Kahng
258F. Physical Design Automation of VLSI Systems. (4)
Lecture, four hours; outside study, eight hours. Detailed study of various physical design automation problems of VLSI circuits, including logic partitioning, floorplanning, placement, global routing, channel and switchbox routing, planar routing and via minimization, compaction and performance-driven layout. Discussion of applications of a number of important optimization techniques, such as network flows, Steiner trees, simulated annealing, and generic algorithms. Letter grading. Mr. Cong (W)
258G. Logic Synthesis of Digital Systems. (4)
Lecture, four hours; outside study, eight hours. Requisites: courses M51A, 180. Detailed study of various problems in logic-level synthesis of VLSI digital systems, including two-level Boolean network optimization; multilevel Boolean network optimization; technology mapping for standard cell designs and field-programmable gate-array (FPGA) designs; retiming for sequential circuits; and applications of binary decision diagrams (BDDS). Letter grading. Mr. Cong
258H. Analysis and Design of High-Speed VLSI Interconnects. (4)
Lecture, four hours; outside study, eight hours. Requisites: courses M258A, 258F. Detailed study of various problems in analysis and design of high-speed VLSI interconnects at both integrated circuit (IC) and packing levels, including interconnect capacitance and resistance, lossless and lossy transmission lines, cross-talk and power distribution noise, delay models and power dissipation models, interconnect topology and geometry optimization, and clocking for high-speed systems. Letter grading. Mr. Cong
259. Current Topics in Computer Science: System Design/Architecture. (2 to 12)
Lecture, four hours; outside study, eight hours. Review of current literature in an area of computer science system design in which instructor has developed special proficiency as a consequence of research interests. Students report on selected topics. May be repeated for credit with topic change. Letter grading.
261A. Problem Solving and Search. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 23. Examination in depth of that part of artificial intelligence concerned with problem-solving behavior, including problem spaces, brute-force search, heuristic search, two-player game searches, planning, subgoaling, GPS, macro-operators, and abstraction. Emphasis on mathematical rigor and complexity analyses of search algorithms. Letter grading. Mr. Korf (W)
262A. Reasoning with Partial Beliefs. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 112 or Electrical Engineering 131A. Review of several formalisms for representing and managing uncertainty in reasoning systems; presentation of comprehensive description of Bayesian inference using belief networks representation. Letter grading. Mr. Pearl
262B. Knowledge-Based Systems. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 262A. Machine representation of judgmental knowledge and uncertain relationships. Inference on inexact knowledge bases. Rule-based systems -- principles, advantages, and limitations. Signal understanding. Automated planning systems. Knowledge acquisition and explanation producing techniques. Letter grading. Mr. Pearl
(Formerly numbered 262C.) (Same as Statistics M241.) Lecture, four hours; outside study, eight hours. Requisite: course 112 or equivalent probability theory course. Techniques of using computers to interpret, summarize, and form theories of empirical observations. Mathematical analysis of trade-offs between computational complexity, storage requirements, and precision of computerized models. Letter grading. Mr. Pearl
262Z. Current Topics in Cognitive Systems. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 262A. Additional requisites for each offering announced in advance by department. Theory and implementation of systems which emulate or support human reasoning. Current literature and individual studies in artificial intelligence, knowledge-based systems, decision support systems, computational psychology, and heuristic programming theory. May be repeated for credit with topic change. Letter grading. Mr. Pearl
263A. Language and Thought. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 130 or 131 or 161. Introduction to natural language processing (NLP), with emphasis on semantics. Presentation of process models for variety of tasks, including question answering, paraphrasing, machine translation, word-sense disambiguation, narrative and editorial comprehension. Examination of both symbolic and statistical approaches to language processing and acquisition. Letter grading. Mr. Dyer
263B. Connectionist Natural Language Processing. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 161 or 163 or 263A. Examination of connectionist/ANN architectures designed for natural language processing. Issues include localist vs. distributed representations, variable binding, instantiation and inference via spreading activation, acquisition of language and world knowledge (for instance, via back propagation in PDP networks and competitive learning in self-organizing feature maps), and grounding of symbols in sensory/motor experience. Letter grading. Mr. Dyer (Sp)
263C. Animats-Based Modeling. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 130 or 131 or 161. Animats are mobile/sensing animal-like software agents embedded in simulated dynamic environments. Emphasis on modeling: goal-oriented behavior via neurocontrollers, adaptation via reinforcement learning, evolutionary programming. Animat-based tasks include foraging, mate finding, predation, navigation, predator avoidance, cooperative nest construction, communication, and parenting. Letter grading. Mr. Dyer (F)
264A. Automated Reasoning: Theory and Applications. (4)
Lecture, four hours; laboratory, four hours; outside study, four hours. Requisite: course 161. Introduction to theory and practice of automated reasoning using propositional and first-order logic. Topics include syntax and semantics of formal logic; algorithms for logical reasoning, including satisfiability and entailment; syntactic and semantic restrictions on knowledge bases; effect of these restrictions on expressiveness, compactness, and computational tractability; applications of automated reasoning to diagnosis, planning, design, formal verification, and reliability analysis. Letter grading. Mr. Darwiche (F)
Lecture, four hours; outside study, eight hours. Requisites: courses 263A, 264A. Introduction to machine learning. Learning by analogy, inductive learning, modeling creativity, learning by experience, role of episodic memory organization in learning. Examination of BACON, AM, EURISKO, HACKER, teachable production systems. Failure-driven learning. Letter grading. Mr. Dyer
Lecture, four hours; outside study, eight hours. Designed for graduate students. Review of major neurophysiological milestones in understanding brain architecture and processes. Focus on brain theories that are important for modern computer science and, in particular, on models of sensory perception, sensory-motor coordination, and cerebellar and cerebral structure and function. Students required to prepare a paper analyzing research in one area of interest. Letter grading. Mr. Vidal
267B. Artificial Neural Systems and Connectionist Computing. (4)
Lecture, four hours; outside study, eight hours. Designed for graduate students. Analysis of major connectionist computing paradigms and underlying models of biological and physical processes. Examination of past and current implementations of artificial neural networks along with their applications to associative knowledge processing, general multisensor pattern recognition including speed and vision, and adaptive robot control. Students required to prepare a paper analyzing research in one area of interest. Letter grading. Mr. Vidal
Lecture, four hours; outside study, eight hours. Designed for graduate students. Computational aspects of processing visual and other sensory information. Unified treatment of early vision in man and machine. Integration of symbolic and iconic representations in process of image segmentation. Computing multimodal sensory information by "neural-net" architectures. Letter grading. Mr. Dyer
268S. Seminar: Computational Neuroscience. (2)
Seminar, two hours; outside study, six hours. Designed for students undertaking thesis research. Discussion of advanced topics and current research in computational neuroscience. Neural networks and connectionism as a paradigm for parallel and concurrent computation in application to problems of perception, vision, multimodal sensory integration, and robotics. May be repeated for credit. S/U grading.
269. Seminar: Current Topics in Artificial Intelligence. (2 to 4)
Seminar, to be arranged. Review of current literature and research practicum in an area of artificial intelligence in which instructor has developed special proficiency as a consequence of research interests. Students report on selected topics. May be repeated for credit with topic change. Letter grading.
270A. Computer Methodology: Advanced Numerical Methods. (4)
Lecture, four hours; outside study, eight hours. Requisite: Electrical Engineering 103 or Mathematics 151B or comparable experience with numerical computing. Designed for graduate computer science and engineering students. Principles of computer treatment of selected numerical problems in algebraic and differential systems, transforms and spectra, data acquisition and reduction; emphasis on concepts pertinent to modeling and simulation and the applicability of contemporary developments in numerical software. Computer exercises. Letter grading. Mr. Carlyle (F)
271A. Modeling and Simulation of Lumped Parameter Systems. (4)
Lecture, eight hours. Recommended preparation: course 270A. Characterization of electrical, electromechanical, and other engineering problems by systems of nonlinear ordinary differential equations. Survey of integration algorithms. Digital simulation languages for continuous systems. Real-time simulation using array processor and multiprocessor computer systems. Letter grading. (W)
271B. Modeling and Simulation of Distributed Parameter Systems. (4)
Lecture, eight hours. Recommended preparation: course 270A. Mathematical formulation of engineering field problems governed by partial differential equations. Finite difference and finite element approximations. Principal algorithms for solving elliptic, parabolic, and hyperbolic partial differential equations. Supercomputers, vector processors, multiprocessors, and array processors. Letter grading. (Sp)
271C. Seminar: Advanced Simulation Methods. (2)
Seminar, two hours; outside study, six hours. Requisite: course 271A. Discussion of advanced topics in simulation of systems characterized by ordinary and partial differential equations. Topics include (among others) simulation languages, dataflow machines, array processors, and advanced mathematical modeling techniques. Topics vary each term. May be repeated for credit. S/U grading.
272. Advanced Discrete Event Simulation and Modeling Techniques. (4)
Lecture, four hours; outside study, eight hours. In-depth study in discrete event simulation and modeling techniques, including building valid and credible simulation models, output analysis of systems, comparisons of alternative system configurations. Variance reduction techniques, simulation models of computer systems and manufacturing systems. Letter grading.
273A. Digital Processing of Engineering and Statistical Data. (4)
Lecture, four hours; outside study, eight hours. Computer methods for processing engineering and statistical data. Algorithms to evaluate recursive filter functions, Fourier series, power spectral, analysis correlation computations, and statistical testing. Letter grading.
M276A. Pattern Recognition and Machine Learning. (4)
(Formerly numbered 276A.) (Same as Statistics M231.) Lecture, three hours. Designed for graduate students. Fundamental concepts, theories, and algorithms for pattern recognition and machine learning that are used in computer vision, image processing, speech recognition, data mining, statistics, and computational biology. Topics include Bayesian decision theory, parametric and nonparametric learning, clustering, complexity (VC-dimension, MDL, AIC), PCA/ICA/TCA, MDS, SVM, boosting. S/U or letter grading. Mr. Zhu
276B. Structured Computer Vision. (4)
Lecture, four hours; outside study, eight hours. Designed for graduate students. Methods for computer processing of image data. Systems, concepts, and algorithms for image analysis, radiologic and robotic applications. Letter grading. Mr. Klinger
276C. Speech and Language Communication in Artificial Intelligence. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 276A or 276B. Topics in human-computer communication: interaction with pictorial information systems, sound and symbol generation by humans and machines, semantics of data, systems for speech recognition and understanding. Use of speech and text for computer input and output in applications. Letter grading. Mr. Klinger
279. Current Topics in Computer Science: Methodology. (2 to 12)
Lecture, four hours; outside study, eight hours. Review of current literature in an area of computer science methodology in which instructor has developed special proficiency as a consequence of research interests. Students report on selected topics. May be repeated for credit with topic change. Letter grading. (F,W,Sp)
280A-280ZZ. Algorithms. (4 each)
Lecture, four hours; outside study, eight hours. Requisite: course 180. Additional requisites for each offering announced in advance by department. Selections from design, analysis, optimization, and implementation of algorithms; computational complexity and general theory of algorithms; algorithms for particular application areas. Subtitles of some current sections: Principles of Design and Analysis (280A); Distributed Algorithms (280D); Graphs and Networks (280G). May be repeated for credit with consent of instructor and with topic change. Letter grading. Ms. Greibach (F,W,Sp)
281A. Computability and Complexity. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 181 or compatible background. Concepts fundamental to study of discrete information systems and theory of computing, with emphasis on regular sets of strings, Turing-recognizable (recursively enumerable) sets, closure properties, machine characterizations, nondeterminisms, decidability, unsolvable problems, "easy" and "hard" problems, PTIME/NPTIME. Letter grading. Ms. Greibach, Mr. Parker
281D. Discrete State Systems. (4)
Lecture, four hours; outside study, eight hours. Recommended requisite: course 181. Finite-state machines, transducers, and their generalizations; regular expressions, transduction expressions, realizability; decomposition, synthesis, and design considerations; topics in state and system identification and fault diagnosis, linear machines, probabilistic machines, applications in coding, communication, computing, system modeling, and simulation. Letter grading. Mr. Carlyle
Lecture, four hours; outside study, eight hours. Requisite: course 180. Basics of cryptography: symmetric and asymmetric cryptosystems; DES, RSA, EIGamal, elliptic curves. Schemes for signature, key distribution and key agreement, identification, authentication, and secret sharing. Advanced topics may include pseudo-random number generation, zero-knowledge proofs, and oblivious traffic. Letter grading. Mr. Gafni
284A-284ZZ. Topics in Automata and Languages. (4 each)
Lecture, four hours; outside study, eight hours. Requisite: course 181. Additional requisites for each offering announced in advance by department. Selections from families of formal languages, grammars, machines, operators; pushdown automata, context-free languages and their generalizations, parsing; multidimensional grammars, developmental systems; machine-based complexity. Subtitles of some current and planned sections: Context-Free Languages (284A), Parsing Algorithms (284P). May be repeated for credit with consent of instructor and with topic change. Letter grading. Ms. Greibach
287A. Theory of Program Structure. (4)
Lecture, four hours; outside study, eight hours. Requisite: course 181. Models of computer programs and their syntax and semantics; emphasis on programs and recursion schemes; equivalence, optimization, correctness, and translatability of programs; expressive power of program constructs and data structures; selected current topics. Letter grading. Ms. Greibach
288S. Seminar: Theoretical Computer Science. (2)
Seminar, two hours; outside study, six hours. Requisites: courses 280A, 281A. Intended for students undertaking thesis research. Discussion of advanced topics and current research in such areas as algorithms and complexity models for parallel and concurrent computation, and formal language and automata theory. May be repeated for credit. S/U grading. Ms. Greibach (F,W,Sp)
289A-289ZZ. Current Topics in Computer Theory. (2 to 12 each)
Lecture, four hours; outside study, eight hours. Review of current literature in an area of computer theory in which instructor has developed special proficiency as a consequence of research interests. Students report on selected topics. Letter grading:
289OA. Online Algorithms. (4) Lecture, four hours; outside study, eight hours. Requisite: course 180. Introduction to decision making under uncertainty and competitive analysis. Review of current research in online algorithms for problems arising in many areas, such as data and memory management, searching and navigating in unknown terrains, and server systems. Letter grading. Mr. Koutsoupias (Sp, alternate years)
289RA. Randomized Algorithms. (4) Lecture, four hours; outside study, eight hours. Basic concepts and design techniques for randomized algorithms, such as probability theory, Markov chains, random walks, and probabilistic method. Applications to randomized algorithms in data structures, graph theory, computational geometry, number theory, and parallel and distributed systems. Letter grading. Mr. Koutsoupias
M296A. Advanced Modeling Methodology for Dynamic Biomedical Systems. (4)
(Same as Biomedical Engineering M296A and Medicine M270C.) Lecture, four hours; outside study, eight hours. Requisite: Electrical Engineering 141 or 142 or Mathematics 115A or Mechanical and Aerospace Engineering 171A. Development of dynamic systems modeling methodology for physiological, biomedical, pharmacological, chemical, and related systems. Control system, multicompartmental, noncompartmental, and input/output models, linear and nonlinear. Emphasis on model applications, limitations, and relevance in biomedical sciences and other limited data environments. Problem solving in PC laboratory. Letter grading. Mr. DiStefano (F)
M296B. Optimal Parameter Estimation and Experiment Design for Biomedical Systems. (4)
(Same as Biomathematics M270, Biomedical Engineering M296B, and Medicine M270D.) Lecture, four hours; outside study, eight hours. Requisite: course M296A or Biomathematics 220. Estimation methodology and model parameter estimation algorithms for fitting dynamic system models to biomedical data. Model discrimination methods. Theory and algorithms for designing optimal experiments for developing and quantifying models, with special focus on optimal sampling schedule design for kinetic models. Exploration of PC software for model building and optimal experiment design via applications in physiology and pharmacology. Letter grading. Mr. DiStefano
M296C. Advanced Topics and Research in Biomedical Systems Modeling and Computing. (4)
(Same as Biomedical Engineering M296C and Medicine M270E.) Lecture, four hours; outside study, eight hours. Requisite: course M296A. Recommended: course M296B. Research techniques and experience on special topics involving models, modeling methods, and model/computing in biological and medical sciences. Review and critique of literature. Research problem searching and formulation. Approaches to solutions. Individual M.S.- and Ph.D.-level project training. Letter grading. Mr. DiStefano
M296D. Introduction to Computational Cardiology. (4)
(Same as Biomedical Engineering M296D.) Lecture, four hours; outside study, eight hours. Requisite: course M196B. Introduction to mathematical modeling and computer simulation of cardiac electrophysiological process. Ionic models of action potential (AP). Theory of AP propagation in 1D and 2D cardiac tissue. Simulation on sequential and parallel supercomputers, choice of numerical algorithms, to optimize accuracy and to provide computational stability. Letter grading. Mr. DiStefano, Mr. Kogan (Sp)
CM296L. Biomedical Systems/Biocybernetics Research Laboratory. (2 to 4)
(Formerly numbered C296L.) (Same as Biomedical Engineering CM296L.) Lecture, two hours; laboratory, two hours. Requisite: course M196B. Special laboratory techniques and experience in biocybernetics research. Laboratory instruments, their use, design, and/or modification for research in life sciences. Special research hardware, firmware, software. Use of simulation in experimental laboratory. Laboratory automation and safety. Comprehensive experiment design. Radioactive isotopes and kinetic studies. Experimental animals, controls. Concurrently scheduled with course CM196L. Letter grading. Mr. DiStefano
298. Research Seminar: Computer Science. (2 to 4)
Seminar, two to four hours; outside study, four to eight hours. Designed for graduate computer science students. Discussion of advanced topics and current research in algorithmic processes that describe and transform information: theory, analysis, design, efficiency, implementation, and application. May be repeated for credit. S/U grading. (F,W,Sp)
375. Teaching Apprentice Practicum. (1 to 4)
Seminar, to be arranged. Preparation: apprentice personnel employment as a teaching assistant, associate, or fellow. Teaching apprenticeship under active guidance and supervision of a regular faculty member responsible for curriculum and instruction at the University. May be repeated for credit. S/U grading. (F,W,Sp)
495. Teaching Assistant Training Seminar. (2)
Seminar, two hours; outside study, six hours. Limited to graduate Computer Science Department students. Seminar on communication of computer science materials in classroom: preparation, organization of material, presentation, use of visual aids, grading, advising, and rapport with students. S/U grading.
495B. Teaching with Technology. (2)
Seminar, two hours; outside study, four hours. Limited to graduate Computer Science Department teaching assistants. Seminar for teaching assistants covering how technology can be used to aid instruction in and out of classroom. S/U grading. Mr. Korf
497D-497E. Field Projects in Computer Science. (4-4)
Fieldwork, to be arranged. Students are divided into teams led by instructor; each team is assigned an external company or organization which they investigate as a candidate for possible computerization, submitting a team report of their findings and recommendations. In Progress and S/U or letter grading. Mr. Cardenas
596. Directed Individual or Tutorial Studies. (2 to 8)
Tutorial, to be arranged. Limited to graduate computer science students. Petition forms to request enrollment may be obtained from assistant dean, Graduate Studies. Supervised investigation of advanced technical problems. S/U grading.
597A. Preparation for M.S. Comprehensive Examination. (2 to 12)
Tutorial, to be arranged. Limited to graduate computer science students. Reading and preparation for M.S. comprehensive examination. S/U grading.
597B. Preparation for Ph.D. Preliminary Examinations. (2 to 16)
Tutorial, to be arranged. Limited to graduate computer science students. S/U grading.
597C. Preparation for Ph.D. Oral Qualifying Examination. (2 to 16)
Tutorial, to be arranged. Limited to graduate computer science students. Preparation for oral qualifying examination, including preliminary research on dissertation. S/U grading.
598. Research for and Preparation of M.S. Thesis. (2 to 12)
Tutorial, to be arranged. Limited to graduate computer science students. Supervised independent research for M.S. candidates, including thesis prospectus. S/U grading.
599. Research for and Preparation of Ph.D. Dissertation. (2 to 16)
Tutorial, to be arranged. Limited to graduate computer science students. Petition forms to request enrollment may be obtained from assistant dean, Graduate Studies. S/U grading.