Spring 2015 Courses

See the calendar layout for a convenient listing of course times and room requests.

Courses without end times are assumed to meet for 50 minute periods. Final room assignments will be available on the Registrar's website in January. Changes to the original schedule are noted in red.

600.104 (H)

COMPUTER ETHICS (1) Sheela Kosaraju

Students will examine a variety of topics regarding policy, legal, and moral issues related to the computer science profession itself and to the proliferation of computers in all aspects of society, especially in the era of the Internet. The course will cover various general issues related to ethical frameworks and apply those frameworks more specifically to the use of computers and the Internet. The topics will include privacy issues, computer crime, intellectual property law -- specifically copyright and patent issues, globalization, and ethical responsibilities for computer science professionals. Work in the course will consist of weekly assignments on one or more of the readings and a final paper on a topic chosen by the student and approved by the instructor.

We 6-8p, alternate weeks (start tba)
limit 20, CS majors only

600.107 (E)

INTRO TO PROGRAMMING IN JAVA (3) More

This course introduces fundamental structured and object-oriented programming concepts and techniques, using Java, and is intended for all who plan to use computer programming in their studies and careers. topics covered include variables, arithmetic operators, control structures, arrays, functions, recursion, dynamic memory allocation, files, class usage and class writing. Program design and testing are also covered, in addition to more advanced object-oriented concepts including inheritance and exceptions as time permits.

First-time programmers are strongly advised to take 600.108 concurrently.

Prereq: familiarity with computers. Students may receive credit for 600.107 or 600.112, but not both.

MW 1:30-2:45
limit 140

600.108 (E)

INTRO PROGRAMMING LAB (1) More

Satisfactory/Unsatisfactory only. This course is intended for novice programmers, and must be taken in conjunction with 600.107. The purpose of this course is to give first-time programmers extra hands-on practice with guided supervision. Students will work in pairs each week to develop working programs, with checkpoints for each development phase. Prerequisite: familiarity with computers.

Co-Requisite: 600.107.

Sec 1: Wed 6-9p, limit 24
Sec 2: Thu 4:30-7:30p, limit 24
Sec 3: Fri 1:30-4:30p, limit 16

600.120 (E)

INTERMEDIATE PROGRAMMING (4) Selinski

This course teaches intermediate to advanced programming, using C and C++. (Prior knowledge of these languages is not expected.) We will cover low-level programming techniques, as well as object-oriented class design, and the use of class libraries. Specific topics include pointers, dynamic memory allocation, polymorphism, overloading, inheritance, templates, collections, exceptions, and others as time permits. Students are expected to learn syntax and some language specific features independently. Course work involves significant programming projects in both languages.

Prereq: AP CS, 600.107, 600.111, 600.112 or equivalent.

Sec 01: MWF 1:30-2:45, limit 30
Sec 02: MWF 3:00-4:15, CS majors only, limit 30
Sec 03: MWF 4:30-5:45, limit 70

600.226 (E,Q)

DATA STRUCTURES (4) More

This course covers the design and implementation of data structures including collections, sequences, trees, and graphs. Other topics include sorting, searching, and hashing. Course work involves both written homework and Java programming assignments.

Prereq: AP CS, 600.107 or 600.120.

Sec 01: MWF 12-1:15, CS majors only, limit 40
Sec 02: MWF 12-1:15, limit 40
Sec 03: TuThF 3-4:15, limit 30

600.233 (E)

COMPUTER SYSTEM FUNDAMENTALS (3) Froehlich

[Formerly 600.333/433] We study the design and performance of a variety of computer systems from simple 8-bit micro-controllers through 32/64-bit RISC architectures all the way to ubiquitous x86 CISC architecture. We'll start from logic gates and digital circuits before delving into arithmetic and logic units, registers, caches, memory, stacks and procedure calls, pipelined execution, super-scalar architectures, memory management units, etc. Along the way we'll study several typical instruction set architectures and review concepts such as interrupts, hardware and software exceptions, serial and other peripheral communications protocols, etc. A number of programming projects, frequently done in assembly language and using various processor simulators, round out the course. [Systems]

Prereq: intro programming. Students may receive credit for only one of 600.233, 600.333 or 600.433.

MWF 1:30
Sec 01: CS majors only, limit 30
Sec 02: others, limit 30

600.250 (E)

USER INTERFACES AND MOBILE APPLICATIONS (3) Selinski

This course will provide students with a rich development experience, focused on the design and implementation of user interfaces and mobile applications. A brief overview of human computer interaction will provide context for designing, prototyping and evaluating user interfaces. Students will invent their own mobile applications and implement them using the Android SDK, which is JAVA based. An overview of the Android platform and available technologies will be provided, as well as XML for layouts, and general concepts for effective mobile development. Students will be expected to explore and experiment with outside resources in order to learn technical details independently. There will also be an emphasis on building teamwork skills, and on using modern development techniques and tools.

Prereq: 600.120 and 600.226.

TuTh 3-4:15
limit 35

600.271 (E,Q)

AUTOMATA and COMPUTATION THEORY (3) Checkoway

This course is an introduction to the theory of computing. topics include design of finite state automata, pushdown automata, linear bounded automata, Turing machines and phrase structure grammars; correspondence between automata and grammars; computable functions, decidable and undecidable problems, P and NP problems, NP-completeness, and randomization. Students may not receive credit for 600.271 and 600.471 for the same degree.

Prereq: 550.171.

TuTh 1:30-2:45
limit 75

600.316 (E)

DATABASE SYSTEMS (3) Ahmad

This course serves as an introduction to the architecture and design of modern database management systems. topics include query processing algorithms and data structures, data organization and storage, query optimization and cost modeling, transaction management and concurrency control, high-availability mechanisms, parallel and distributed databases, and a survey of modern architectures including NoSQL, column-oriented and streaming databases. Course work includes programming assignments and experimentation in a simple database framework written in Java. [Systems]

Prereq: 600.120 and 600.226. Students may receive credit for 600.316 or 600.416, but not both.

MW 12-1:15
limit 20

600.320 (E)

PARALLEL PROGRAMMING (3) Burns

This course prepares the programmer to tackle the massive data sets and huge problem size of modern scientific and enterprise computing. Google and IBM have commented that undergraduate CS majors are unable to "break the single server mindset" (http://www.google.com/intl/en/ press/pressrel/20071008_ibm_univ.html). Students taking this course will abandon the comfort of serial algorithmic thinking and learn to harness the power of cutting-edge software and hardware technologies. The issue of parallelism spans many architectural levels. Even ``single server'' systems must parallelize computation in order to exploit the inherent parallelism of recent multi-core processors. The course will examine different forms of parallelism in four sections. These are: (1) massive data-parallel computations with Hadoop!; (2) programming compute clusters with MPI; (3) thread-level parallelism in Java; and, (4) GPGPU parallel programming with NVIDIA's Cuda. Each section will be approximately 3 weeks and each section will involve a programming project. The course is also suitable for undergraduate and graduate students from other science and engineering disciplines that have prior programming experience. [Systems]

Prereq: 600.120 and 600.226; 600.333 recommended. Students may receive credit for 600.320 or 600.420, but not both.

MW 4:30-5:45
limit 30

600.325 (E)

DECLARATIVE METHODS (3) Eisner

Suppose you could simply write down a description of your problem, and let the computer figure out how to solve it. What notation could you use? What strategy should the computer then use? In this survey class, you'll learn to recognize when your problem is an instance of satisfiability, constraint programming, logic programming, dynamic programming, or mathematical programming (e.g., integer linear programming). For each of these related paradigms, you'll learn to reformulate hard problems in the required notation and apply off-the-shelf software that can solve any problem in that notation -- including NP-complete problems and many of the problems you'll see in other courses and in the real world. You'll also gain some understanding of the general-purpose algorithms that power the software. [Analysis]

Prereq: 600.226, Calc II. Students can only receive credit for 600.325 or 600.425, not both.

cancelled (was MWF 3)
limit 30

600.328 (E)

COMPILERS & INTERPRETERS (3) Froehlich

Introduction to compiler design, including lexical analysis, parsing, syntax-directed translation, symbol tables, run-time environments, and code generation and optimization. Students are required to write a compiler as a course project. [Systems]

Prereq: 600.120 & 600.226

MWF 10
limit 30

600.335 (E)

ARTIFICIAL INTELLIGENCE (3) Mitchell

Artificial intelligence (AI) is introduced by studying automated reasoning, automatic problem solvers and planners, knowledge representation mechanisms, game playing, machine learning, and statistical pattern recognition. The class is a recommended for all scientists and engineers with a genuine curiosity about the fundamental obstacles to getting machines to perform tasks such as deduction, learning, and planning and navigation. Strong programming skills and a good grasp of the English language are expected; students will be asked to complete both programming assignments and writing assignments. The course will include a brief introduction to scientific writing and experimental design, including assignments to apply these concepts. [Applications]

Prereq: 600.226, 550.171; Recommended: linear algebra, prob/stat. Students can only receive credit for 600.335 or 600.435, not both.

WF 12-1:15
limit 30

600.344 (E)

COMPUTER NETWORK FUNDAMENTALS (3) DeSimone

This course considers intersystem communications issues. topics covered include layered network architectures; the OSI model; bandwidth, data rates, modems, multiplexing, error detection/correction; switching; queuing models, circuit switching, packet switching; performance analysis of protocols, local area networks; and congestion control. [Systems]

Prereq: 600.333 or 600.433 or permission. Students can only receive credit for 600.344 or 600.444, not both.

TuTh 4:30-5:45
limit 30

600.355 (E)

VIDEO GAME DESIGN PROJECT (3) Froehlich

An intensive capstone design project experience in video game development. Students will work in groups of 4-8 on developing a complete video game of publishable quality. Teams will (hopefully) include programmers, visual artists, composers, and writers. Students will be mentored by experts from industry and academia. Aside from the project itself, project management and communication skills will be emphasized. Enrollment is limited to ensure parity between the various disciplines. [General] May involve travel to MICA.

Prereq: 600.255/256 or permission of instructor; junior or senior standing recommended.

Wed 4:30-7:30p
limit 20

600.363 (E,Q)

INTRODUCTION TO ALGORITHMS (3) Braverman

This course concentrates on the design of algorithms and the rigorous analysis of their efficiency. topics include the basic definitions of algorithmic complexity (worst case, average case); basic tools such as dynamic programming, sorting, searching, and selection; advanced data structures and their applications (such as union-find); graph algorithms and searching techniques such as minimum spanning trees, depth-first search, shortest paths, design of online algorithms and competitive analysis. [Analysis]

Prereq: 600.226 and 550.171 or Perm. Req'd. Students may receive credit for 600.363 or 600.463, but not both.

TuTh 9-10:15
limit 30

600.371 (E)

NEW COURSE!

SOFTWARE TOOLS PRACTICUM (3) Wayner

This course will survey the wide range of tools, frameworks and packages that form a foundation for much of the modern Internet. Each week, a group of students will present a particular software package to the class, exploring the architectural, historical and competitive aspects. The weekly lab work and assignments will focus on testing the software and understanding its contributions to providing the services that support the Internet.

The software will be chosen from a list of popular packages like Hudson, Drupal, Docker, WordPress, Node.js, jQuery, Django, Ruby on Rails, Git, Coffeescript, Ember, Angular, MongoDB, Couch, and others. Students will select one package and work with others to explore the packages, learn how they work and then summarize this knowledge by creating a presentation for the class. [General]

Prereq: 600.120 and 600.226.

Wed 1:30-4p
limit 30

600.402 (E)

MEDICAL INFORMATICS (1) Lehmann

Advances in technology are driving a change in medicine, from personalized medicine to population health. Computers and information technology will be critical to this transition. We shall discuss some of the coming changes in terms of computer technology, including computer-based patient records, clinical practice guidelines, and region-wide health information exchanges. We will discuss the underlying technologies driving these developments - databases and warehouses, controlled vocabularies, and decision support. Prerequisite: none.

Short course meets 4 weeks: 1/26-2/18.

MW 4:30-5:45
4 weeks: 1/26-2/18
limit 30

600.411 (E)

CS INNOVATION AND ENTREPRENEURSHIP II (1) Dabhura & Aronhime

This course is the second half of a two-course sequence and is a continuation of course 660.410.01, CS Innovation and Entrepreneurship, offered by the Center for Leadership Education (CLE). In this sequel course the student groups, directed by CS faculty, will implement the business idea which was developed in the first course and will present the implementations and business plans to an outside panel made up of practitioners, industry representatives, and venture capitalists. [General]

Prerequisites: 660.410 and 600.321/421.

M 3-5:45
limit 10

600.416 (E)

DATABASE SYSTEMS (3) Ahmad

Similar material as 600.316, covered in more depth. Intended for upper-level undergraduates and graduate students. [Systems]

Required course background: 600.120 and 600.226. Students may receive credit for 600.316 or 600.416, but not both.

MW 12-1:15
limit 30

600.420 (E)

PARALLEL PROGRAMMING (3) Burns

Graduate level version of 600.320. Students may receive credit for 600.320 or 600.420, but not both. [Systems]

Required course background: 600.120 or equiv.

MW 4:30-5:45
limit 40

600.424 (E)

NETWORK SECURITY (3) Nielson

[Cross-listed in ISI] This course focuses on communication security in computer systems and networks. The course is intended to provide students with an introduction to the field of network security. The course covers network security services such as authentication and access control, integrity and confidentiality of data, firewalls and related technologies, Web security and privacy. Course work involves implementing various security techniques. A course project is required. [Systems]

Required course background: 600.120, 600.226, 600.344/444 or permission (or equivalent) recommended.

TuTh 3-4:15
limit 30

600.425 (E)

DECLARATIVE METHODS (3) Eisner

Graduate level version of 600.325. [Analysis]

Required course background: 600.226, Calc II. Students can only receive credit for 600.325 or 600.425, not both.

cancelled (was MWF 3)
limit 30

600.426 (E,Q)

PRINCIPLES OF PROGRAMMING LANGUAGES (3) Smith

Functional, object-oriented, and other language features are studied independent of a particular programming language. Students become familiar with these features by implementing them. Most of the implementations are in the form of small language interpreters. Some type checkers and a small compiler will also be written. The total amount of code written will not be overly large, as the emphasis is on concepts. The ML programming language is the implementation language used. [Analysis]

Required course background: 600.226. Freshmen and sophomores by permission only.

MW 1:30-2:45
limit 40

600.428 (E)

COMPILERS & INTERPRETERS (3) Froehlich

Graduate level version of 600.328. Students may receive credit for 600.328 or 600.428, but not both. [Systems]

Prereq: 600.120 & 600.226

MWF 10
limit 30

600.435 (E)

ARTIFICIAL INTELLIGENCE (3) Mitchell

Graduate level version of 600.335. [Applications]

Required course background: 600.226, 550.171; linear algebra, prob/stat. Students can only receive credit for 600.335 or 600.435, not both.

WF 12-1:15
limit 30

600.436 (E)

ALGORITHMS FOR SENSOR-BASED ROBOTICS (3) Hager/Leonard

[Formerly 600.336.] This course surveys the development of robotic systems for navigating in an environment from an algorithmic perspective. It will cover basic kinematics, configuration space concepts, motion planning, and localization and mapping. It will describe these concepts in the context of the ROS software system, and will present examples relevant to mobile platforms, manipulation, robotics surgery, and human-machine systems. [Analysis]

Prereq: 600.226, linear algebra, probability. Students may receive credit for only one of 600.336, 600.436 and 600.636.

TuTh 3-4:15
limit 30

600.441 (E)

New Course!

MACHINE LEARNING FOR GENOMIC DATA - TRENDS AND APPLICATIONS (3) Battle

Genomic data is becoming available in large quantities, but understanding how genetics contributes to human disease and other traits remains a major challenge. Machine learning approaches allow us to automatically analyze and combine genomic data, build predictive models, and identify genetic elements important to disease and cellular processes. This course will cover uses of machine learning in diverse genomic applications. Students will present and discuss current literature. Topics include predicting disease risk from genomic data, integrating diverse genomic data types, gene network reconstruction, and other topics guided by student interest. The course will include a project component with the opportunity to explore publicly available genomic data. [Applications]

Recommended Course Background: coursework in data mining, machine learning. Students may receive credit for 600.441 or 600.641, but not both.

TuTh 1:30-2:45
limit 10

600.444 (E)

COMPUTER NETWORKS (3) DeSimone

Graduate level version of 600.344. [Systems]

Required course background: 600.233/333/433 or permission. Students can only receive credit for 600.344 or 600.444, not both.

TuTh 4:30-5:45
limit 30

600.446 (E)

COMPUTER INTEGRATED SURGERY II (3) Taylor

This weekly lecture/seminar course addresses similar material to 600.445, but covers selected topics in greater depth. In addition to material covered in lectures/seminars by the instructor and other faculty, students are expected to read and provide critical analysis/presentations of selected papers in recitation sessions. Students taking this course are required to undertake and report on a significant term project under the supervision of the instructor and clinical end users. Typically, this project is an extension of the term project from 600.445, although it does not have to be. Grades are based both on the project and on classroom recitations. Students wishing to attend the weekly lectures as a 1-credit seminar should sign up for 600.452. Students may also take this course as 600.646. The only difference between 600.446 and 600.646 is the level of project undertaken. Typically, 600.646 projects require a greater degree of mathematical, image processing, or modeling background. Prospective students should consult with the instructor as to which course number is appropriate. [Applications]

Prereq: 600.445/645 or perm req'd. Students may receive credit for 600.446 or 600.646, but not both.

TuTh 1:30-2:45
limit 35

600.451 (E)

NEW COURSE!

INTRO TO BITCOIN AND OTHER CRYPTO-CURRENCIES (3) Ateniese

This course covers the basics of Bitcoin and the underlying technologies driving it. The course is intended for students interested in the cryptographic techniques devised to make digital currencies and payment systems secure. Topics include Bitcoin transactions, the blockchain, mining, and decentralized consensus. The course will include a brief introduction to public-key cryptography, digital signatures, hash functions, proof of work/space, multisignatures, and elliptic curve cryptography. The course concludes with an overview of the Bitcoin scripting language and Bitcoin 2.0 platforms. [Systems]

Pre-req: 600.226 required; 600.344/444 and 550.171 recommended.

MW 12-1:15
limit 30

600.452 (E)

COMPUTER INTEGRATED SURGERY SEMINAR (1) Taylor

Lecture only version of 600.446 (no project).

Prereq: 600.445 or perm req'd. Students may receive credit for 600.446 or 600.452, but not both.

TuTh 1:30-2:45
limit 5

600.454 (E)

PRACTICAL CRYPTOGRAPHIC SYSTEMS (3) Green

[Co-listed with 650.445.] This semester-long course will teach systems and cryptographic design principles by example: by studying and identifying flaws in widely-deployed cryptographic products and protocols. Our focus will be on the techniques used in practical security systems, the mistakes that lead to failure, and the approaches that might have avoided the problem. We will place a particular emphasis on the techniques of provable security and the feasibility of reverse-engineering undocumented cryptographic systems. [Systems]

MW 3-4:15
limit 20

600.463 (E,Q)

ALGORITHMS I (3) Braverman

Graduate version of 600.363. Students may receive credit for 600.363 or 600.463, but not both. [Analysis]

Required course background: 600.226 and 550.171 or Perm. req'd.

TuTh 9:00-10:15
limit 30

600.466 (E)

INFORMATION RETRIEVAL & WEB AGENTS (3) Yarowsky

An in-depth, hands-on study of current information retrieval techniques and their application to developing intelligent WWW agents. Topics include a comprehensive study of current document retrieval models, mail/news routing and filtering, document clustering, automatic indexing, query expansion, relevance feedback, user modeling, information visualization and usage pattern analysis. In addition, the course explores the range of additional language processing steps useful for template filling and information extraction from retrieved documents, focusing on recent, primarily statistical methods. The course concludes with a study of current issues in information retrieval and data mining on the World Wide Web. Topics include web robots, spiders, agents and search engines, exploring both their practical implementation and the economic and legal issues surrounding their use. [Applications]

Required course background: 600.226.

TuTh 3-4:15
limit 60

600.468 (E)

MACHINE TRANSLATION (3) Koehn

Google translate can instantly translate between any pair of over fifty human languages (for instance, from French to English). How does it do that? Why does it make the errors that it does? And how can you build something better? Modern translation systems learn to translate by reading millions of words of already translated text, and this course will show you how they work. The course covers a diverse set of fundamental building blocks from linguistics, machine learning, algorithms, data structures, and formal language theory, along with their application to a real and difficult problem in artificial intelligence. [Applications]

Required course background: prob/stat, 600.226, 600.465.

TuTh 1:30-2:45
limit 30

600.469 (E,Q)

APPROXIMATION ALGORITHMS Dinitz

This course provides an introduction to approximation algorithms. Topics include vertex cover, TSP, Steiner trees, cuts, greedy approach, linear and semi-definite programming, primal-dual method, and randomization. Additional topics will be covered as time permits. There will be a final project. Students may receive credit for 600.469 or 600.669, but not both. Pre-req: 600.363/463 or permission. [Analysis]

Prereq: 600.363/463 or permission.

TuTh 3-4:15
limit 20

600.470
New course!

COMBINATORICS AND GRAPH THEORY IN CS Li

This is a graduate level course studying the applications of combinatorics and graph theory in computer science. We will start with some basic combinatorial techniques such as counting and pigeon hole principle, and then move to advanced techniques such as the probabilistic method, spectral graph theory and additive combinatorics. We shall see their applications in various areas in computer science, such as proving lower bounds in computational models, randomized algorithms, coding theory and pseudorandomness. [Analysis]

Pre-requisite: discrete math; probability theory and linear algebra recommended.

TuTh 12-1:15
limit 25

600.476 (EQ)

MACHINE LEARNING: DATA TO MODELS (3) Saria

[Formerly "Machine Learning in Complex Domains"] How can robots localize themselves in an environment when navigating? Can we predict which patients are at greatest-risk for complications in the hospital? Which movie should I recommend to this user given his history of likes? Many such big data questions can be answered using the paradigm of probabilistic models in machine learning. These are especially useful when common off-the-shelf algorithms such as support vector machines and k-means fail. You will learn methods for clustering, classification, structured prediction, recommendation and inference. We will use Murphy's book, Machine Learning: a Probabilistic Perspective, as the text for this course. Assignments are solved in groups of size 1-3 students. The class will have 4 interactive sessions during which we brainstorm how to solve example open-ended real-world problems with the tools learnt in class. Students are also required to do a project of their choice within which they experiment with the ideas learnt in class. [Analysis or Applications] Students may receive credit for 600.476 or 600.676, but not both.

Pre-reqs: 1) Proficiency in at least one programming language is expected. 2) A class in probability theory or statistics or introductory machine learning is required.

TuTh 4:30-5:45
limit 15

600.492 (E)

COMPUTER SCIENCE WORKSHOP II

An independent applications-oriented, computer science project done under the supervision and with the sponsorship of a faculty member in the Department of Computer Science. Computer Science Workshop provides a student with an opportunity to apply theory and concepts of computer science to a significant project of mutual interest to the student and a Computer Science faculty member. Permission to enroll in CSW is granted by the faculty sponsor after his/her approval of a project proposal from the student. Interested students are advised to consult with Computer Science faculty members before preparing a Computer Science Workshop project proposal. Permission of faculty sponsor is required.

See below for faculty section numbers.

600.504

UNDERGRADUATE INDEPENDENT STUDY

Individual guided study for undergraduates, under the direction of a faculty member in the department. The program of study, including the credit to be assigned, must be worked out in advance between the student and the faculty member involved. Permission of faculty sponsor is required.

See below for faculty section numbers.

600.508

UNDERGRADUATE RESEARCH

Permission of faculty sponsor is required.

See below for faculty section numbers.

600.510

COMPUTER SCIENCE INTERNSHIP

Individual work in the field with a learning component, supervised by a faculty member in the department. The program of study must be worked out in advance between the student and the faculty member involved. Students may not receive credit for work that they are paid to do. As a rule of thumb, 40 hours of work is equivalent to one credit, which is the limit per semester.

Permission of faculty sponsor is required.

See below for faculty section numbers.

600.520

SENIOR HONORS THESIS (3)

For computer science majors only, a continuation of 600.519.

Prerequisite: 600.519

See below for faculty section numbers.

600.546 (E)

SENIOR THESIS IN COMPUTER INTEGRATED SURGERY (3)

Prereq: 600.445 or perm req'd.

Section 01: Taylor

600.602

COMPUTER SCIENCE SEMINAR

Required for all CS PhD students. Strongly recommended for MSE students.

TuTh 10:30-12
limit 90

600.636

ALGORITHMS FOR SENSOR-BASED ROBOTICS Hager/Leonard

[Formerly 600.436.] Graduate level version of 600.436 (see description above). [Analysis]

Required course background: 600.226, calculus, prob/stat. Students may receive credit for only one of 600.336, 600.436 or 600.636.

TuTh 3-4:15
limit 30

600.641

New Course!

MACHINE LEARNING FOR GENOMIC DATA - TRENDS AND APPLICATIONS Battle

Genomic data is becoming available in large quantities, but understanding how genetics contributes to human disease and other traits remains a major challenge. Machine learning approaches allow us to automatically analyze and combine genomic data, build predictive models, and identify genetic elements important to disease and cellular processes. This course will cover uses of machine learning in diverse genomic applications. Students will present and discuss current literature. Topics include predicting disease risk from genomic data, integrating diverse genomic data types, gene network reconstruction, and other topics guided by student interest. The course will include a project component with the opportunity to explore publicly available genomic data. [Applications]

Recommended Course Background: coursework in data mining, machine learning. Students may receive credit for 600.441 or 600.641, but not both.

TuTh 1:30-2:45
limit 20

600.642
Cancelled

ADVANCED TOPICS IN CRYPTOGRAPHY (3) Jain

[Cross-listed in ISI] This course will focus on advanced cryptographic topics with an emphasis on open research problems and student presentations. [Analysis]

Prereq: 600.442 or 600.472 or permission.

Cancelled (was F 1:30-4)
limit 15

600.643

ADVANCED TOPICS IN COMPUTER SECURITY Rubin

[Cross-listed in ISI] Topics will vary from year to year, but will focus mainly on network perimeter protection, host-level protection, authentication technologies, intellectual property protection, formal analysis techniques, intrusion detection and similarly advanced subjects. Emphasis in this course is on understanding how security issues impact real systems, while maintaining an appreciation for grounding the work in fundamental science. Students will study and present various advanced research papers to the class. There will be homework assignments and a course project. [Systems or Applications]

Prereq: 600.443 or 600.424; or permission of instructor.

MW 1:30-2:45
limit 20

600.646

COMPUTER INTEGRATED SURGERY II Taylor

Advanced version of 600.446. [Applications]

Prereq: 600.445/645 or perm req'd. Students may receive credit for 600.446 or 600.646, but not both.

TuTh 1:30-2:45
limit 20

600.660

FFT IN GRAPHICS & VISION (3) Kazhdan

In this course, we will study the Fourier Transform from the perspective of representation theory. We will begin by considering the standard transform defined by the commutative group of rotations in 2D and translations in two- and three-dimensions, and will proceed to the Fourier Transform of the non-commutative group of 3D rotations. Subjects covered will include correlation of images, shape matching, computation of invariances, and symmetry detection. [Applications or Analysis]

Prereq: linear algebra and comfort with mathematical derivations.

MW 1:30-2:45
limit 15

600.666

INFORMATION EXTRACTION Khudanpur

Introduction to statistical methods of speech recognition (automatic transcription of speech) and understanding. The course is a natural continuation of 600.465 but is independent of it. topics include elementary information theory, hidden Markov models, the Baum and Viterbi algorithms, efficient hypothesis search methods, statistical decision trees, the estimation-maximization (EM) algorithm, maximum entropy estimation and estimation of discrete probabilities from sparse data for acoustic and language modeling. Weekly assignments and several programming projects. [Applications]

Prerequisites: 550.310 or equivalent, expertise in C or C++ programming. Co-listed with 050.666 and 520.666.

MWF 1:30
limit 35

600.667

ADVANCED DISTRIBUTED SYSTEMS AND NETWORKS Amir

The course explores the state of the art in distributed systems, networks and Internet research and practice, trying to see what it would take to push the envelop a step further. The course is conducted as a discussion group, where the professor and students brainstorm and pick interesting semester-long projects with high potential future impact. Example areas include robust scalable infrastructure (distributed datacenters, cloud networking, scada systems), real-time performance (remote surgery, trading systems), hybrid networks (mesh networks, 3-4G/Wifi/Bluetooth). Students should feel free to bring their own topics of interest and ideas. [Systems]

Prereq: a systems course (distributed systems, operating systems, computer networks, parallel programming), or permission of instructor.

TuTh 1:30-2:45
limit 10

600.669

APPROXIMATION ALGORITHMS Dinitz

Graduate version of 600.469. Students may earn credit for 600.469 or 600.669, but not both. [Analysis]

Prereq: 600.363/463 or permission.

TuTh 3-4:15
limit 20

600.675

New course!

STATISTICAL MACHINE LEARNING Arora

This is a second graduate level course in machine learning. It will provide a formal and an in-depth coverage of topics at the interface of statistical theory and computational sciences. We will revisit popular machine learning algorithms and understand their performance in terms of the size of the data (sample complexity), memory needed (space complexity), as well as the overall computational runtime (computation or iteration complexity). We will cover topics including nonparametric methods, kernel methods, online learning and reinforcement learning, as well as introduce students to current topics in large-scale machine-learning and randomized projections. Topics will vary from year-to-year but the general focus would be on combining methodology with theoretical and computational foundations. [Analysis or Applications]

Pre-req: 600.475 or 600.476/676 or permission.

Th 12-2:30
limit 20

600.676

MACHINE LEARNING: DATA TO MODELS Saria

[Formerly "Machine Learning in Complex Domains"] Graduate version of 600.476. [Analysis or Applications] Students may receive credit for 600.476 or 600.676, but not both.

Pre-reqs: 1) Proficiency in at least one programming language is expected. 2) A class in probability theory or statistics or introductory machine learning is required.

TuTh 4:30-5:45
limit 20

580.688

FOUNDATIONS OF COMPUTATIONAL BIOLOGY AND BIOINFORMATICS II Karchin

[Cross-listed from BME - CS students can count as a CS course.] This course will introduce probabilistic modeling and information theory applied to biological sequence analysis, focusing on statistical models of protein families, alignment algorithms, and models of evolution. topics will include probability theory, score matrices, hidden Markov models, maximum likelihood, expectation maximization and dynamic programming algorithms. Homework assignments will require programming in Python. Foundations of Computational Biology I is not a prereq. [Analysis]

Required course background: math through linear algebra and differential equations, at least one statistics and probability course, 580.221 or equiv., 600.226 or equiv. Undergrads may enroll by permission only.

MW 4:30-5:45
limit 20

580.689

New course!

COMPUTATIONAL PERSONAL GENOMICS Salzberg

[Cross-listed from BME - CS students can count as a CS course.] What can we learn from the genome sequence of an individual? Genomic technology now makes it possible to generate huge amounts of DNA sequence data for a single individual at a relatively low cost. To make sense of this data, we need to employ sophisticated computational methods to identify genetic variations that influence an individual.s health.

In this course, we will first review the state of the art in sequencing technology, and discuss how this technology is being applied to study human biology and disease. We will then explore the computational methods used to turn raw sequence data into knowledge. Topics will include genetic variant detection; discovery of chromosomal rearrangements and fusions; methods to measure gene expression from RNA; and measurements of the microbiome living inside our bodies. [Applications]

Recommended prerequisites: 600.439/639, CS 600.363/463, 580.488/688, or permission of the instructor (any one is sufficient).

TuTh 9-10:15

520.702

CURRENT TOPICS IN LANGUAGE AND SPEECH PROCESSING Khudanpur

CLSP seminar series, for any students interested in current topics in language and speech processing.

Tu & Fr 12-1:15

600.707

SELECTED TOPICS IN CS EDUCATION Selinski

This course will explore current issues and research in computer science education. Topics will be drawn from literature, news items, and participant experience. Current faculty and students with interests in academic careers are encouraged to attend.

tbd
limit 15

600.716

SELECTED TOPICS ON INNOVATIVE DATA SYSTEMS Ahmad

This weekly reading group will survey and dissect the cutting-edge on innovative data systems research. Topics will encompass methods and abstraction in core systems and data management areas (e.g., cloud computing, scalable programming and storage), as well as use-cases and "war" stories from industry, and science and engineering applications. Our semester schedule is posted at damsel.cs.jhu.edu/blockparty.

Th 1:30-2:30

600.726

SELECTED TOPICS IN PROGRAMMING LANGUAGES Smith

This seminar course covers recent developments in the foundations of programming language design and implementation. topics covered include type theory, process algebra, higher-order program analysis, and constraint systems. Students will be expected to present papers orally.

Wed 10-12

600.728

SELECTED TOPICS IN CATEGORY THEORY Filardo

Students in this course will read a sampling of standard texts in Category Theory (e.g. the books by Awodey, Mac Lane, Pierce, or others) and papers relevant to the research of participants.

W 4:30-5:30

500.745

SEMINAR IN COMPUTATIONAL SENSING AND ROBOTICS Kazanzides, Whitcomb, Vidal, Etienne-Cummings

Seminar series in robotics. Topics include: Medical robotics, including computer-integrated surgical systems and image-guided intervention. Sensor based robotics, including computer vision and biomedical image analysis. Algorithmic robotics, robot control and machine learning. Autonomous robotics for monitoring, exploration and manipulation with applications in home, environmental (land, sea, space), and defense areas. Biorobotics and neuromechanics, including devices, algorithms and approaches to robotics inspired by principles in biomechanics and neuroscience. Human-machine systems, including haptic and visual feedback, human perception, cognition and decision making, and human-machine collaborative systems. Cross-listed with Mechanical Engineering, Computer Science, Electrical and Computer Engineering, and Biomedical Engineering.

Wed 12-1:30
limit 80

600.746

SELECTED TOPICS IN MEDICAL IMAGE ANALYSIS Taylor & Prince

This weekly seminar will focus on research issues in medical image analysis, including image segmentation, registration, statistical modeling, and applications. It will also include selected topics relating to medical image acquisition, especially where they relate to analysis. The purpose of the course is to provide the participants with a thorough background in current research in these areas, as well as to promote greater awareness and interaction between multiple research groups within the University. The format of the course is informal. Students will read selected papers. All students will be assumed to have read these papers by the time the paper is scheduled for discussion. But individual students will be assigned on a rotating basis to lead the discussion on particular papers or sections of papers. Co-listed with 520.746.

Tu 3-4:50

600.760

New!

CS THEORY SEMINAR Braverman, Dinitz, Li

Seminar series in theoretical computer science. Topics include algorithms, complexity theory, and related areas of TCS. Speakers will be a mix of internal and external researchers, mostly presenting recently published research papers.

W 12
limit 30

600.764

SEMINAR IN ALGORITHMS Braverman

This course will explore algorithms and theoretical computer science with a focus on algorithms for massive data. Examples of topics include streaming algorithms, approximation algorithms, online algorithms. Students will be encouraged to select a paper and lead a discussion. External speakers will be invited to present current work as well. This course is a good opportunity for motivated students to learn modern algorithmic methods. Prereq: 600.463 or equivalent.

W 4-6
limit 20

600.765

SELECTED TOPICS IN NATURAL LANGUAGE PROCESSING Eisner

A reading group exploring important current research in the field and potentially relevant material from related fields. Enrolled students are expected to present papers and lead discussion.

Required course background: 600.465 or permission of instructor.

Th 12-1:15

600.766

SELECTED TOPICS IN MEANING, TRANSLATION AND GENERATION OF TEXT VanDurme

This weekly reading group will review current research and survey articles on the topics of computational semantics, statistical machine translation, and natural language generation. Enrolled students will present papers and lead discussions.

Fr 10-10:50
limit 15

600.768

New!

SELECTED TOPICS IN MACHINE TRANSLATION Koehn

Students in this course will review, present, and discuss current research in machine translation.

Prereq: permission of instructor.

T 9:30-10:30
limit 15

600.775

SELECTED TOPICS IN MACHINE LEARNING Dredze, Saria, Arora

This seminar is recommended for all students interested in data intensive computing research areas (e.g., machine learning, computer vision, natural language processing, speech, computational social science). The meeting format is participatory. Papers that discuss best practices and the state-of-the-art across application areas of machine learning and data intensive computing will be read. Student volunteers lead individual meetings. Faculty and external speakers present from time-to-time.

Required course background: a machine learning course or permission of instructor.

Mon 12-1:15

600.780

NEW LISTING!

SELECTED TOPICS IN COMPUTATIONAL GENOMICS Langmead

This course will survey current areas where computer science approaches have been applied to genomics research. Chiefly, the course focuses on DNA sequencing data analysis, including sequence alignment, de novo assembly, error correction, and DNA data compression. Subject matter will be partially guided by student interests. Students will present papers orally.

M 11
limit 20

600.802

DISSERTATION RESEARCH

See below for faculty section numbers.

600.804

GRADUATE RESEARCH

Independent research for masters or pre-dissertation PhD students. Permission required.

See below for faculty section numbers.

600.810

GRADUATE INDEPENDENT STUDY

Permission Required.

See below for faculty section numbers.

Faculty section numbers for all independent type courses, undergraduate and graduate.

01 - Xin Li
02 - Rao Kosaraju
03 - Yanif Ahmad
04 - Russ Taylor
05 - Scott Smith
06 - Joanne Selinski
07 - Harold Lehmann
08 - John Sheppard
09 - Greg Hager
10 - Larry Wolff
11 - Sanjeev Khudhanpur
12 - Yair Amir
13 - David Yarowsky
14 - Noah Cowan
15 - Randal Burns
16 - Jason Eisner
17 - Mark Dredze
18 - Michael Dinitz
19 - Rachel Karchin
20 - Guiseppe Ateniese
21 - Avi Rubin
22 - Matt Green
23 - Andreas Terzis
24 - Raman Arora
25 - Rai Winslow
26 - Misha Kazhdan
27 - Chris Callison-Burch
28 - Peter Froehlich
29 - Alex Szalay
30 - Peter Kazanzides
31 - Jerry Prince
32 - Rajesh Kumar
33 - Nassir Navab
34 - Rene Vidal
35 - Alexis Battle
36 - Emad Boctor
37 - Joel Bader
38 - Ben VanDurme
39 - Jeff Siewerdsen
40 - Vladimir Braverman
41 - Suchi Saria
42 - Ben Langmead
43 - Steven Salzberg
44 - Stephen Checkoway
45 - Liliana Florea
46 - Adam Lopez
47 - Philipp Koehn
48 - Abhishek Jain
49 - Anton Dabhura