Courses
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.
Area: Humanities
This course provides first-year computer science majors with an introduction to the field and department. A variety of faculty members will lead weekly small group discussion sections on topics of interest related to the discipline. Upper-year majors will serve as peer mentors for each group (enrollment by permission only). Satisfactory/Unsatisfactory only; counts as elective credits only, not towards CS course credit requirement.
The expansion of artificial intelligence (AI)-enabled use cases across a broad spectrum of domains has underscored the benefits and risks of AI. This course will address the various ethical considerations engineers need to engage with to build responsible and trustworthy AI-enabled autonomous systems. Topics to be covered include: values-based decision making, ethically aligned design, cultural diversity, safety, bias, AI explainability, privacy, AI regulation, the ethics of synthetic life, and the future of work. Case studies will be utilized to illustrate real-world applications. Students will apply learned material to a group research project on a topic of their choice.
Area: Humanities, Engineering
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.
Prerequisite(s): (EN.500.132 OR EN.500.133 OR EN.500.134) OR ( EN.500.112 OR EN.500.113 OR EN.500.114)
Area: Engineering
This course covers the design and implementation of data structures including arrays, stacks, queues, linked lists, binary trees, heaps, balanced trees (e.g. 2-3 trees, AVL-trees) and graphs. Other topics include sorting, hashing, memory allocation, and garbage collection. Course work involves both written homework and Java programming assignments.
Prerequisite(s): EN.500.132 OR (EN.500.112 or EN.601.220) or AP Computer Science or equivalent.
Area: Engineering, Quantitative and Mathematical Sciences
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].
Prerequisite(s): EN.601.220
Area: Engineering
This course provides an introduction to mathematical reasoning and discrete structures relevant to computer science. Topics include propositional and predicate logic, proof techniques including mathematical induction, sets, relations, functions, recurrences, counting techniques, simple computational models, asymptotic analysis, discrete probability, graphs, trees, and number theory.
Prerequisite(s): Student may not enroll if taken EN.601.231.;EN.500.112 OR EN.500.113 OR EN.500.114 OR EN.500.132 OR EN.500.133 OR EN.500.134 OR EN.601.220
Area: Engineering, Quantitative and Mathematical Sciences
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.
Prerequisite(s): Students may not enroll if taken EN.601.230.;EN.550.171/EN.553.171 OR EN.553.172
Area: Engineering, Quantitative and Mathematical Sciences
The course will provide students a development experience focused on learning software engineering skills to deliver software at scale to a broad community of users associated with open source licensed projects. The class work will introduce students to ideas behind open source software with structured modules on recognizing and building healthy project structure, intellectual property basics, community & project governance, social and ethical concerns, and software economics.
Prerequisite(s): EN.601.220 AND EN.601.226
Area: Engineering
Scientific, statistical and logical literacy is a necessary skill for evaluating policy proposals, reading news articles with an appropriately critical eye, and making informed choices as consumers and voters. Misunderstanding of claims made in scientific publications, online publishing platforms, and mass media drives, in part, the spread of malicious misinformation and propaganda online. Further, many actors have the means, the motive and the opportunity to mislead the public in a variety of subtle and not so subtle ways. This class will give you tools to discern valid and invalid forms of inference and discourse, and give you tools to communicate precisely, argue appropriately, and stay on top of research and news with an appropriately skeptical attitude. The class will draw on historical and modern literature on linguistic, logical, and probabilistic fallacies, statistical and logical inference, data visualization, cognitive biases, and the scientific method.
Prerequisite(s): (EN.553.171 OR EN.553.172) OR AS.150.118
Area: Quantitative and Mathematical Sciences, Social and Behavioral Sciences
A full-stack JavaScript developer is a person who can build modern software applications using primarily the JavaScript programming language. Creating a modern software application involves integrating many technologies - from creating the user interface to saving information in a database and everything else in between and beyond. A full-stack developer is not an expert in everything. Rather, they are someone who is familiar with various (software application) frameworks and the ability to take a concept and turn it into a finished product. This course will teach you programming in JavaScript and introduce you to several JavaScript frameworks that would enable you to build modern web, cross-platform desktop, and native/hybrid mobile applications. A student who successfully completes this course will be on the expedited path to becoming a full-stack JavaScript developer.
Prerequisite(s): EN.601.220 OR EN.601.226
Area: Engineering
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.
Prerequisite(s): EN.601.220 AND EN.601.226
Area: Engineering
This is a project-based course focusing on the design and implementation of practical software systems. Students will work in small teams to design and develop useful open-source software products that support our communities. Students will be paired with community partners and will aim to develop software that can be used after the course ends to solve real problems facing those partners today. Instructors will connect with the community partners and determine viable project areas prior to the course start. Students will meet with their community partners to analyze the challenges in their project area, agree on a concrete target project outcome, and gather requirements for their project. Based on these requirements, students will design and implement open-source software systems. [Oral]
Prerequisite(s): EN.601.220 AND EN.601.226
Area: Engineering
Introduction to database management systems and database design, focusing on the relational and object-oriented data models, query languages and query optimization, transaction processing, parallel and distributed databases, recovery and security issues, commercial systems and case studies, heterogeneous and multimedia databases, and data mining. [Systems]
Prerequisite(s): Students can only take one of the following: EN.601.315, EN.601.415, OR EN.601.615.;EN.601.226
Area: Engineering
This course covers fundamental topics related to operating systems theory and practice. Topics include processor management, storage management, concurrency control, multi-programming and processing, device drivers, operating system components (e.g., file system, kernel), modeling and performance measurement, protection and security, and recent innovations in operating system structure. Course work includes the implementation of operating systems techniques and routines, and critical parts of a small but functional operating system.
Prerequisite(s): Students may receive credit for only one of the following: EN.601.318, EN.601.418, OR EN.601.618.;EN.601.226 AND EN.601.229
Area: Engineering
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]
Prerequisite(s): Students may receive credit for only one of the following: EN.601.320, EN.601.420, OR EN.601.620.;EN.601.226 AND EN.601.229
Area: Engineering
This course begins with reviewing basic knowledge of the World Wide Web, and then exploring the central defense concepts behind Web security, such as same-origin policy, cross-origin resource sharing, and browser sandboxing. It will cover the most popular Web vulnerabilities, such as cross-site scripting (XSS) and SQL injection, as well as how to attack and penetrate software with such vulnerabilities. Students will learn how to detect, respond, and recover from security incidents. Newly proposed research techniques will also be discussed. [Systems]
Prerequisite(s): Students may receive credit for only one of 601.340/440/640.;EN.601.226 AND EN.601.229 AND EN.601.280
Area: Engineering
This course will use a project-based approach to introduce undergraduates to research in computational biology and genomics. During the semester, students will take a series of large data sets, all derived from recent research, and learn all the computational steps required to convert raw data into a polished analysis. Data challenges might include the DNA sequences from a bacterial genome project, the RNA sequences from an experiment to measure gene expression, the DNA from a human microbiome sequencing experiment, and others. Topics may vary from year to year. In addition to computational data analysis, students will learn to do critical reading of the scientific iterature by reading high-profile research papers that generated groundbreaking or controversial results. [Applications] Recommended Course Background: Knowledge of the Unix operating system and programming expertise in a language such as Perl or Python.
Area: Engineering
Students may receive credit for EN.601.456 or EN.601.356, but not both. Lecture only version of EN.601.456 (no project). Recommended Course Background: EN.601.455 or instructor permission required.
Prerequisite(s): EN.601.455 or instructor permission.;Students may receive credit for either EN.601.356 orEN.601.456, but not both.
Area: Engineering
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.
Area: Engineering
Computational and network aspects of the brain are explored. The topics covered include structure, operation and connectivity of neurons, general network structure of the neural system, and the connectivity constraints imposed by pre- and post-natal neural development and the desirability of network consistency within a species. Both discrete and continuous aspects of neural computation are covered. Precise mathematical tools and analyses such as logic design, transient and steady state behavior of linear systems, and time and connectivity randomization are discussed. The concepts are illustrated with several applications. Memory formation from the synaptic level to the high level constructs are explored. Students are not expected to master any of the mathematical techniques but are expected to develop a strong qualitative appreciation of their power. Cerebellum, which has a simple network connectivity, will be covered as a typical system.
Prerequisite(s): Students can receive credit for EN.601.404 or EN.601.604, but not both;(EN.553.291 OR ((AS.110.201 OR AS.110.212) AND AS.110.302)) AND (EN.553.420 OR EN.553.421 OR EN.553.211 OR EN.553.310 OR EN.553.311) AND EN.601.433
Area: Engineering
This course is the second half of a two-course sequence and is a continuation of course EN.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]
Prerequisite(s): EN.660.410
Area: Engineering
Software-Defined Networks (SDN) enable programmability of data networks and hence rapid introduction of new services. They use software-based controllers to communicate with underlying hardware infrastructure and direct traffic on a network. This model differs from that of traditional networks, which use dedicated hardware devices (i.e., routers and switches) to control network traffic. This technology is becoming a key part of web scale networks (at companies like Google and Amazon) and 5G/6G networks. Its importance will keep on growing. Many of today’s services and applications, especially when they involve the cloud, could not function without SDN. SDN allows data to move easily between distributed locations, which is critical for cloud applications. A major focus will be on how this technology will be used in 5G and 6G Networks. The course will cover basics of SDN, ongoing research in this area, and the industrial deployments.
Prerequisite(s): Students can receive credit for EN.601.413 or EN.601.613, but not both;EN.601.414 OR EN.601.614
Area: Engineering
Topics covered will include application layer protocols (e.g. HTTP, FTP, SMTP), transport layer protocols (UDP, TCP), network layer protocols (e.g. IP, ICMP), link layer protocols (e.g. Ethernet) and wireless protocols (e.g. IEEE 802.11). The course will also cover routing protocols such as link state and distance vector, multicast routing, and path vector protocols (e.g. BGP). The class will examine security issues such as firewalls and denial of service attacks. We will also study DNS, NAT, Web caching and CDNs, peer to peer, and protocol tunneling. Finally, we will explore security protocols (e.g. TLS, SSH, IPsec), as well as some basic cryptography necessary to understand these. Grading will be based on hands-on programming assignments, homeworks and two exams. [Systems]
Prerequisite(s): EN.601.226 AND EN.601.229 or permission.;Students may receive credit for only one of EN.600.344, EN.600.444, EN.601.414, EN.601.614.
Area: Engineering
Similar material as EN.601.315 covered in more depth for advanced undergraduates. Introduction to database management systems and database design, focusing on the relational and object-oriented data models, query languages and query optimization, transaction processing, parallel and distributed databases, recovery and security issues, commercial systems and case studies, heterogeneous and multimedia databases, and data mining. [Systems] (www.cs.jhu.edu/~yarowsky/cs415.html)
Prerequisite(s): Students may receive credit for only one of the following: EN.601.315, EN.601.415, OR EN.601.615.;EN.601.226
Area: Engineering
Graduate version of 601.317 Systems. Students may receive credit for 601.317 or 601.417 but not both. Recommended Course Background: EN.601.220, EN.601.226
Prerequisite(s): Students may receive credit for only one of the following: EN.601.417 OR EN.601.617;EN.601.220 AND EN.601.226
Area: Engineering
Similar material as EN.601.318, covered in more depth. Intended for advanced undergraduate students. This course covers fundamental topics related to operating systems theory and practice. Topics include processor management, storage management, concurrency control, multi-programming and processing, device drivers, operating system components (e.g., file system, kernel), modeling and performance measurement, protection and security, and recent innovations in operating system structure. Course work includes the implementation of operating systems techniques and routines, and critical parts of a small but functional operating system.
Prerequisite(s): Students may receive credit for only one of the following: EN.601.318, EN.601.418, OR EN.601.618.;EN.601.226 AND EN.601.229
Area: Engineering
Clouds host a wide range of the applications that we rely on today. In this course, we study common cloud applications, traffic patterns that they generate, critical networking infrastructures that support them, and core networking and distributed systems concepts, algorithms, and technologies used inside clouds. We will also study how today's application demand is influencing the network’s design, explore current practice, and how we can build future's networked infrastructure to better enable both efficient transfer of big data and low-latency requirements of real-time applications. The format of this course will be a mix of lectures, discussions, assignments, and a project designed to help students practice and apply the theories and techniques covered in the course. [Systems] Prerequisites: EN.601.226 or permission. Students can only receive credit for one of 601.419/619. Recommended: a course in operating systems, networks or systems programming.
Prerequisite(s): Students may earn credit for EN.601.419 or EN.601.619, but not both.;EN.601.226 (or EN.600.226) AND EN.601.414 or permission from the instructor.
Area: Engineering
This course studies parallelism in data science, drawing examples from data analytics, statistical programming, and machine learning. It focuses mostly on the Python programming ecosystem but will use C/C++ to accelerate Python and Java to explore shared-memory threading. It explores parallelism at all levels, including instruction level parallelism (pipelining and vectorization), shared-memory multicore, and distributed computing. Concepts from computer architecture and operating systems will be developed in support of parallelism, including Moore’s law, the memory hierarchy, caching, processes/threads, and concurrency control. The course will cover modern data-parallel programming frameworks, including Dask, Spark, Hadoop!, and Ray. The course will not cover GPU deep-learning frameworks nor CUDA. The course is suitable for second-year undergraduate CS majors and graduate students from other science and engineering disciplines that have prior programming experience and familiarity with Python. [Systems]
Prerequisite(s): EN.601.226 AND EN.601.229;Students may receive credit for only one of EN.600.320, EN.600.420, EN.601.320, EN.601.420, EN.601.620.
Area: Engineering
This course covers object-oriented software construction methodologies and their application. The main component of the course is a large team project on a topic of your choosing. Course topics covered include object-oriented analysis and design, UML, design patterns, refactoring, program testing, code repositories, team programming, and code reviews. [Systems or Applications]
Prerequisite(s): Students may receive credit for only one of EN.600.321, EN.600.421, EN.601.421, EN.601.621.;EN.601.220 AND EN.601.226 AND (EN.601.280 OR EN.601.290)
Area: Engineering
Studies show that testing can account for over 50% of software development costs. This course presents a comprehensive study of software testing, principles, methodologies, tools, and techniques. Topics include testing principles, coverage (graph coverage, logic coverage, input space partitioning, and syntax-based coverage), unit testing, higher-order testing (integration, system-level, acceptance), testing approaches (white-box, black-box, grey-box), regression testing, debugging, delta debugging, and several specific types of functional and non-functional testing as schedule/interest permits (GUI testing, usability testing, security testing, load/performance testing, A/B testing etc.). For practical topics, state- of-the-art tools/techniques will be studied and utilized. [Systems]
Prerequisite(s): EN.601.290 OR EN.601.421;Students can take EN.601.422 or EN.601.622, but not both.
Area: Engineering
Reliability is an essential quality requirement for all artifacts operating in the real-world, ranging from bridges, cars to power grids. Software systems are no exception. In this computing age when software is transforming even traditional mission-critical artifacts, making sure the software we write is reliable becomes ever more important. This course exposes students to the principles and techniques in building reliable systems. We will study a set of systematic approaches to make software more robust. These include but are not limited to static analysis, testing framework, model checking, symbolic execution, fuzzing, and formal verification. In addition, we will cover the latest research in system reliability.
Prerequisite(s): EN.601.220 AND (EN.601.328 OR EN.601.428)
Area: Engineering
This course introduces modern software systems design, with an emphasis on how to design large-scale systems, assess common system design trade-offs, and tackle system design challenges. It covers non-functional requirements, API design, distributed systems concepts, modern software building blocks (e.g., load balancers, caches, containers, etc.). Additionally, it includes case studies of common system design problems, some drawn from interview questions. Ultimately, this course helps learners become better software engineers.
Prerequisite(s): Students may receive credit for EN.601.425 OR EN.601.625, but not both.;EN.601.315 OR EN.601.415 OR EN.601.615
Area: Engineering
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] Prerequisites include EN.601.226. No Freshmen or Sophomores.
Prerequisite(s): Students can receive credit for EN.601.426 or EN.601.626, but not both;EN.601.226
Area: Engineering, Quantitative and Mathematical Sciences
This course is designed as a follow-on to Principles of Programming languages. It will cover a wide array of fundamental topics in programming languages, including advanced functional programming, the theory of inductive definitions, advanced operational semantics, advanced type systems, program analysis, program verification, theorem provers and SAT solvers. [Analysis]
Prerequisite(s): EN.601.426
Area: Engineering
Introduction to compiler design, including lexical analysis, parsing, syntax-directed translation, symbol tables, runtime environments, and code generation and optimization. Students are required to write a compiler as a course project. [Systems]
Prerequisite(s): EN.601.226 AND EN.601.229
Area: Engineering
How can we effectively use functional programming techniques to build real-world software? This course will primarily focus on using the OCaml programming language for this purpose. Topics covered include OCaml basics, modules, standard libraries, testing, quickcheck, build tools, functional data structures and efficiency analysis, monads, streams, and promises. Students will practice what they learn in lecture via functional programming assignments and a final project.
Prerequisite(s): Students can receive credit for only one of 601.429/601.629.;EN.601.226 OR Instructor Permission
Area: Engineering
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]Recommended Course Background: probability theory and linear algebra
Prerequisite(s): EN.553.171 OR EN.553.172 OR EN.550.171; probability theory and linear algebra recommended.;Students may receive credit for only one of 430/630
Area: Engineering, Quantitative and Mathematical Sciences
This course covers the theoretical foundations of computer science. Topics included will be models of computation from automata to Turing machines, computability, complexity theory, randomized algorithms, inapproximability, interactive proof systems and probabilistically checkable proofs. Students may not take both 601.231 and 601.431/601.631, unless one is for an undergrad degree and the other for grad.
Prerequisite(s): Students who have taken EN.601.631 OR EN.601.231 are not eligible to take EN.601.431.;EN.553.171 OR EN.553.172 OR EN.601.230
Area: Engineering, Quantitative and Mathematical Sciences
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]
Prerequisite(s): EN.601.226 AND (EN.553.171 OR EN.553.172 OR EN.601.230 OR EN.601.231);Students may receive credit for only one of EN.600.363, EN.600.463, EN.601.433, EN.601.633.
Area: Engineering, Quantitative and Mathematical Sciences
The course emphasizes algorithmic design aspects, and how randomization can be a helpful tool. The topics covered include: tail inequalities, linear programming relaxation & randomized rounding, de-randomization, existence proofs, universal hashing, markov chains, metropolis and metropolis-hastings methods, mixing by coupling and by eigenvalues, counting problems, semi-definite programming and rounding, lower bound arguments, and applications of expanders. [Analysis] (www.cs.jhu.edu/~cs464) Recommended Course Background: Probability
Prerequisite(s): Students may receive credit for only one of the following: EN.601.434 OR EN.601.634.;(EN.601.433 OR EN.601.633) AND (EN.553.211 OR EN.553.310 OR EN.553.311 OR EN.553.420)
Area: Engineering, Quantitative and Mathematical Sciences
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 EN.601.435 or EN.601.635, but not both. [Analysis]
Prerequisite(s): EN.600.363 OR EN.601.433 OR EN.601.633 OR permission.
Area: Engineering, Quantitative and Mathematical Sciences
This course provides an introduction to algorithmic game theory: the study of games from the perspective of algorithms and theoretical computer science. There will be a particular focus on games that arise naturally from economic interactions involving computer systems (such as economic interactions between large-scale networks, online advertising markets, etc.), but there will also be broad coverage of games and mechanisms of all sorts. Topics covered will include a) complexity of computing equilibria and algorithms for doing so, b) (in)efficiency of equilibria, and c) algorithmic mechanism design. [Analysis]
Prerequisite(s): EN.600.363 OR EN.600.463 OR EN.601.433 OR EN.601.633
Area: Engineering, Quantitative and Mathematical Sciences
Federated Learning (FL) is an area of machine learning where data is distributed across multiple devices and training is performed without exchanging the data between devices. FL can be contrasted with classical machine learning settings when data is available in a central location. As such, FL faces additional challenges and limitations such as privacy and communication. For example, FL may deal with questions of learning from sensitive data on mobile devices while protecting privacy of individual users and dealing with low power and limited communication. As a result, FL requires knowledge of many interdisciplinary areas such as differential privacy, distributed optimization, sketching algorithms, compression and more. In this course students will learn basic concepts and algorithms for FL and federated analytics, and gain hands-on experience with new methods and techniques. Students will gain understanding in reasoning about possible trade-offs between privacy, accuracy and communication. [Analysis] ML: DL, linear algebra, probability
Prerequisite(s): Students may only earn credit for EN.601.437 OR EN.601.637.;EN.601.433/EN.601.633 AND (EN.601.464/EN.601.664 OR EN.601.475/EN.601.675)
Area: Engineering, Quantitative and Mathematical Sciences
This course begins with reviewing basic knowledge of the World Wide Web, and then exploring the central defense concepts behind Web security, such as same-origin policy, cross-origin resource sharing, and browser sandboxing. It will cover the most popular Web vulnerabilities, such as cross-site scripting (XSS) and SQL injection, as well as how to attack and penetrate software with such vulnerabilities. Students will learn how to detect, respond, and recover from security incidents. Newly proposed research techniques will also be discussed. [Systems]
Prerequisite(s): Students may receive credit for only one of 340/440/640.;EN.601.226 AND EN.601.229 AND EN.601.280
Area: Engineering
This course will introduce students to cryptocurrencies and the main underlying technology of Blockchains. The course will start with the relevant background in cryptography and then proceed to cover the recent advances in the design and applications of blockchains. This course should primarily appeal to students who want to conduct research in this area or wish to build new applications on top of blockchains. It should also appeal to those who have a casual interest in this topic or are generally interested in cryptography. Students are expected to have mathematical maturity. [Analysis]
Prerequisite(s): Students may recieve credit for only one of EN.600.451 OR EN.601.441 OR EN.601.641;EN.601.226 AND (EN.553.211 OR EN.553.310 OR EN.553.311 OR EN.560.348 OR EN.553.420 OR EN.553.421)
Area: Engineering
Modern Cryptography includes seemingly paradoxical notions such as communicating privately without a shared secret, proving things without leaking knowledge, and computing on encrypted data. In this challenging but rewarding course we will start from the basics of private and public key cryptography and go all the way up to advanced notions such as zero-knowledge proofs, functional encryption and program obfuscation. The class will focus on rigorous proofs and require mathematical maturity. [Analysis]
Prerequisite(s): Students may receive credit for only one of EN.600.442, EN.601.442, EN.601.642.;(EN.601.230 OR EN.601.231) AND (EN.553.310 OR EN.553.311 OR EN.553.420 OR EN.553.421)
Area: Engineering, Quantitative and Mathematical Sciences
Lecture topics will include computer security, network security, basic cryptography, system design methodology, and privacy. There will be a heavy work load, including written homework, programming assignments, exams and a comprehensive final. The class will also include a semester-long project that will be done in teams and will include a presentation by each group to the class. [Applications] Recommended Course Background: A basic course in operating systems and networking, or permission of instructor.
Prerequisite(s): EN.601.229 (Computer System Fundamentals);Students may receive credit for only one of EN.600.443, EN.601.443, EN.601.643.
Area: Engineering
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]
Prerequisite(s): EN.600.120 AND EN.600.226 AND ( EN.600.344 OR EN.600.444 ) or permission;Students may receive credit for only one of EN.600.424, EN.650.424, EN.601.444, EN.601.644.
Area: Engineering
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]
Prerequisite(s): Students may receive credit for only one of EN.601.445 OR EN.601.645, but not both.;EN.601.226 AND EN.601.229
Area: Engineering
Many of the world's largest and fastest-growing datasets are text, e.g. DNA sequencing data, web pages, logs and social media posts. Such datasets are useful only to the degree we can query, compare and analyze them. Here we discuss two powerful approaches in this area. We will cover sketching, which enables us to summarize very large texts in small structures that allow us to measure the sizes of sets and of their unions and intersections. This in turn allows us to measure similarity and find near neighbors. Second, we will discuss indexing --- succinct and compressed indexes in particular -- which enables us to efficiently search inside very long strings, especially in highly repetitive texts. [Analysis]
Prerequisite(s): Students can receive credit for EN.601.446 or EN.601.646, but not both;EN.601.226
Area: Engineering
Your genome is the blueprint for the molecules in your body. It's also a string of letters (A, C, G and T) about 3 billion letters long. How does this string give rise to you? Your heart, your brain, your health? This, broadly speaking, is what genomics research is about. This course will familiarize you with a breadth of topics from the field of computational genomics. The emphasis is on current research problems, real-world genomics data, and efficient software implementations for analyzing data. Topics will include: string matching, sequence alignment and indexing, assembly, and sequence models. Course will involve significant programming projects. [Applications]
Prerequisite(s): Students may receive credit for only one of the following: EN.601.447 OR EN.601.647 but not both.;EN.601.220 AND EN.601.226
Area: Engineering
The goal of this course is to study the leading computational and quantitative approaches for comparing and analyzing genomes starting from raw sequencing data. The course will focus on human genomics and human medical applications, but the techniques will be broadly applicable across the tree of life. The topics will include genome assembly & comparative genomics, variant identification & analysis, gene expression & regulation, personal genome analysis, and cancer genomics. The grading will be based on assignments, a midterm exam, class presentations, and a significant class project. Prerequisites: knowledge of the Unix operating system and programming expertise in a language such as R or Python. [Applications]
Prerequisite(s): Students may receive credit for only one of EN.600.449, EN.600.649, EN.601.749.
Area: Engineering
Immunology studies defensive mechanisms of living organisms against external threats. Computational immunogenomics is a new field of bioinformatics that develops and applies computational approaches to the study and interpretation of immunological data, seeking to answer questions about adaptive immune responses in humans and important animals. In this course, students will learn how to design, apply, and benchmark algorithms for solving immunogenomics problems. [Applications] Students may receive credit for only one of EN.601.451, EN.601.651.
Prerequisite(s): Students may receive credit for only one of EN.601.451 OR EN.601.651.;EN.601.220 AND EN.601.226
Area: Engineering
[Co-listed with AS.020.415] This course for advanced undergraduates includes classroom instruction in interdisciplinary research approaches and lab work on an independent research project in the lab of a Bloomberg Distinguished Professor and other distinguished faculty. Lectures will focus on cross-cutting techniques such as data visualization, statistical inference, and scientific computing. In addition to two 50-minute classes per week, students will commit to working approximately 3 hours per week in the lab of one of the professors. The student and professor will work together to schedule the research project. Students will present their work at a symposium at the end of the semester.
Area: Engineering
This course is designed to expand the student’s augmented reality knowledge and introduce relevant topics necessary for developing more meaningful applications and conducting research in this field. The course addresses the fundamental concepts of visual perception and introduces non-visual augmented reality modalities, including auditory, tactile, gustatory, and olfactory applications. The following sessions discuss the importance of integrating user-centered design concepts to design meaningful augmented reality applications. A later module introduces the basic requirements to design and conduct user studies and guidelines on interpreting and evaluating the results from the studies. During the course, students conceptualize, design, implement and evaluate the performance of augmented reality solutions for their use in industrial applications, teaching and training, or healthcare settings. Homework in this course will relate to applying the theoretical methods used for designing, implementing, and evaluating augmented reality applications.
Prerequisite(s): Students may receive credit for only one of EN.601.453 or EN.601.653, but not both.;EN.601.454 OR EN.601.654
Area: Engineering
This course introduces students to the field of Augmented Reality. It reviews its basic definitions, principles, and applications. The course explains how fundamentals concepts of computer vision are applied for the development of Augmented Reality applications. It then focuses on describing the principal components and particular requirements to implement a solution using this technology. The course also discusses the main issues of calibration, tracking, multi-modal registration, advanced visualization, and display technologies. Homework in this course will relate to the mathematical methods used for calibration, tracking, and visualization in augmented reality. [Applications]
Prerequisite(s): Students may receive credit for only one of the following: EN.601.454 OR EN.601.654, but not both.;EN.601.220 AND EN.601.226 AND (AS.110.201 OR AS.110.212 OR EN.553.291 OR EN.553.295)
Area: Engineering
This course focuses on computer-based techniques, systems, and applications exploiting quantitative information from medical images and sensors to assist clinicians in all phases of treatment from diagnosis to preoperative planning, execution, and follow-up. It emphasizes the relationship between problem definition, computer-based technology, and clinical application and includes a number of guest lectures given by surgeons and other experts on requirements and opportunities in particular clinical areas. Recommended Course Background: EN.601.220, EN.601.457, EN.601.461, image processing.
Prerequisite(s): EN.600.226/EN.601.226 AND (AS.110.201 OR AS.110.212 OR EN.553.291) or permission of the instructor.;Students may receive credit for only one of EN.600.445, EN.600.645, EN.601.455, EN.601.655.
Area: Engineering
This weekly lecture/seminar course addresses similar material to EN.601.455, 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 EN.601.455, although it does not have to be. Grades are based both on the project and on classroom recitations. Students who wish to use this course to satisfy the "Team" requirement should register for EN.601.496 instead. Students wishing to attend the weekly lectures as a 1-credit seminar should sign up for EN.601.356. [Applications, Oral]
Prerequisite(s): Students may receive credit for only one of EN.600.446, EN.600.646, EN.601.456, EN.601.496, OR EN.601.656.;EN.601.455 or EN.601.655 or permisssion
Area: Engineering
This course introduces computer graphics techniques and applications, including image processing, rendering, modeling and animation. [Applications]
Prerequisite(s): Students may receive credit for only one of the following: EN.601.457 OR EN.601.657, but not both.;EN.601.220 AND EN.601.226 AND (AS.110.201 OR AS.110.212 OR EN.553.291 OR EN.553.295)
Area: Engineering, Quantitative and Mathematical Sciences
This course will provide an introduction to computational geometry. It will cover a number of topics in two- and three-dimensions, including polygon triangulations and partitions, convex hulls, Delaunay and Voronoi diagrams, arrangements, and spatial queries. Time-permitting, we will also look at kD-trees, general BSP-trees, and quadtrees. [Analysis]
Prerequisite(s): EN.600.120/EN.601.220 AND EN.600.226/EN.601.226 AND (EN.600.363 OR EN.600.463/EN.601.433 OR EN.601.633)
Area: Engineering, Quantitative and Mathematical Sciences
This course provides an overview of fundamental methods in computer vision from a computational perspective. Methods studied include: camera systems and their modelling, computation of 3-D geometry from binocular stereo, motion, and photometric stereo, and objectrecognition, image segmentation, and activity analysis. Elements of machine vision and biological vision are also included.
Prerequisite(s): Students may receive credit for only one of EN.600.361, EN.600.461, EN.600.661, EN.601.461, EN.601.661.;(EN.553.310 OR EN.553.311 OR ((EN.553.420 OR EN.553.421) AND (EN.553.430 OR EN.553.431)) AND (AS.110.201 OR AS.110.212 OR EN.553.291 OR EN.553.295)) AND (EN.500.112 OR EN.500.113 OR EN.500.114 OR EN.601.220 AS.250.205)
Area: Engineering, Quantitative and Mathematical Sciences
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]
Prerequisite(s): Students may receive credit for only one of EN.600.336, EN.600.436, EN.600.636, EN.601.463, EN.601.663.;(AS.110.201 OR AS.110.212 OR EN.553.291 OR EN.553.295) AND AS.110.202 AND EN.601.226 AND (EN.553.211 OR EN.553.310 OR EN.553.311 OR EN.553.420 OR EN.553.421)
Area: Engineering
This course is recommended for scientists and engineers with a genuine curiosity about the fundamental obstacles in getting machines to perform tasks such as deduction, learning, planning and navigation. It covers methods for automated reasoning, automatic problem solversand planners, knowledge representation mechanisms, game playing, machine learning,and statistical pattern recognition. Strong programming skills are expected, as well asbasic familiarity with probability. Students intending to also take courses in machinelearning (e.g. 601.475/675, 601.476/676, 601.482/682) may find it beneficial to take thiscourse first, or concurrently. [Applications]
Prerequisite(s): EN.600.226/EN.601.226;Students may receive credit for only one of EN.600.335, EN.600.435, EN.601.464, EN.601.664.
Area: Engineering
An in-depth introduction to core techniques for analyzing, transforming, and generating human language. The course spans linguistics, modeling, algorithms, and applications. (1) How should linguistic structure and meaning be represented (e.g., trees, morphemes, ?-terms, vectors)? (2) How can we formally model the legal structures and their probabilities (e.g., grammars, automata, features, log-linear models, recurrent neural nets, Transformers)? (3) What algorithms can estimate the parameters of these models (e.g., gradient descent, EM) and efficiently identify probable structures (e.g., dynamic programming, beam search)? (4) Finally, what kinds of systems can be built with these techniques and how are they constructed and evaluated in practice? Detailed assignments guide students through many details of implementing core NLP methods. The course proceeds from first principles, although prior exposure to AI, statistics, ML, or linguistics can be helpful. [Applications] Prerequisite: Data Structures and basic familiarity with Python, partial derivatives, matrix multiplication and probabilities.
Prerequisite(s): EN.600.226/EN.601.226;Students may receive credit for only one of EN.600.465, EN.601.465, EN.601.665.
Area: Engineering
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. Recommended Course Background: EN.601.226
Prerequisite(s): Students can receive credit for EN.601.466 or EN.601.666, but not both;EN.600.226 OR EN.601.226
Area: Engineering
This course gives an overview of basic foundations and applications of human language technology, such as: morphological, syntactic, semantic, and pragmatic processing; machine learning; signal processing; speech recognition; speech synthesis; information retrieval; text classification; topic modelling; informationextraction; knowledge representation; machine translation; dialog systems; etc. [Applications]Pre-req: EN.601.226 Data Structures; knowledge of Python recommended.
Prerequisite(s): Students can receive credit for only one of 601.467/601.647;EN.601.226 OR EN.600.226
Area: Engineering
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.
Prerequisite(s): Students may receive credit for only one of EN.600.468, EN.601.468, EN.601.668.;EN.601.226 AND EN.553.211 OR EN.553.310 OR EN.553.311 OR ((EN.553.420 OR EN.553.421) AND (EN.553.430 OR EN.553.431)))
Area: Engineering
This course covers a number of topics explored in introductory AI, such as knowledge representation, reasoning, and natural language understanding. Unlike introductory AI, we will pursue these topics based on the transformer neural architecture. We will motivate the material through interacting with agents in games: how to build models that understand user commands, how to generate responses back to a user, and how to reason about a synthetic environment to determine a course of action. Assignments will include programming, presentations on readings, and written summaries of readings. [Applications]
Prerequisite(s): (EN.601.475 OR EN.601.675) OR (EN.601.482 OR EN.601.682) OR (EN.601.488 OR EN.601.688) OR (EN.601.486 OR EN.601.686)
Area: Engineering
The rise of massive self-supervised (pre-trained) models have transformed various data-driven fields such as natural language processing (NLP). In this course, students will gain a thorough introduction to self-supervised learning techniques for NLP applications. Through lectures, assignments, and a final project, students will learn the necessary skills to design, implement, and understand their own self-supervised neural network models, using the Pytorch framework. Students should have familiarity with Python/PyTorch.
Prerequisite(s): Students may receive credit for EN.601.471 or EN.601.671, but not both.;EN.601.226 AND (EN.553.211 OR EN.553.310 OR EN.553.311 OR EN.553.420 OR EN.553.421) AND (AS.110.201 OR AS.110.212 OR EN.553.291) AND ((EN.601.464 OR EN.601.664) OR (EN.601.465 OR EN.601.665) OR (EN.601.467 OR EN.601.667) OR (EN.601.468 OR EN.601.668) OR (EN.601.475 OR EN.601.675))
Area: Engineering
This is an undergraduate level course in machine learning. It will provide a formal and in-depth coverage of topics in statistical and computational learning theory. 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 runtime (computational or iteration complexity). We will cover topics including PAC learning, uniform convergence, VC dimension, Rademacher complexity, algorithmic stability, kernel methods, online learning and reinforcement learning, as well as introduce students to current topics in large-scale machine- learning and randomized projections. General focus will be on combining methodology with theoretical and computational foundations. [Analysis]
Prerequisite(s): AS.110.202 AND (((EN.553.420 OR EN.553.421) AND EN.553.430) OR (EN.553.211 OR EN.553.310 OR EN.553.311) AND (AS.110.201 OR AS.110.212 OR EN.553.291 OR EN.553.295)) AND (EN.500.112 OR EN.500.113 OR EN.500.114) OR (EN.601.220 OR AS.250.205 OR EN.580.200 OR EN.601.107)
Area: Engineering, Quantitative and Mathematical Sciences
Machine learning is subfield of computer science and artificial intelligence, whose goal is to develop computational systems, methods, and algorithms that can learn from data to improve their performance. This course introduces the foundational concepts of modern Machine Learning, including core principles, popular algorithms and modeling platforms. This will include both supervised learning, which includes popular algorithms like SVMs, logistic regression, boosting and deep learning, as well as unsupervised learning frameworks, which include Expectation Maximization and graphical models. Homework assignments include a heavy programming components, requiring students to implement several machine learning algorithms in a common learning framework. Additionally, analytical homework questions will explore various machine learning concepts, building on the pre-requisites that include probability, linear algebra, multi-variate calculus and basic optimization. Students in the course will develop a learning system for a final project. [Analysis or Applications]
Prerequisite(s): Students may receive credit for only one of EN.600.475, EN.601.475, EN.601.675.;Linear Algebra, Probability, Statistics, Calc III, and Intro Computing/Programming - AS.110.202 AND (EN.553.211 OR EN.553.310 OR EN.553.311 OR ((EN.553.420 or EN.553.421) AND (EN.553.430 OR EN.553.431)) AND (AS.110.201 OR AS.110.212 OR EN.553.291 OR EN.553.295) AND (EN.500.112 OR EN.500.113 OR EN.500.114 OR (EN.601.220 OR EN.600.120) OR AS.250.205 OR EN.580.200 OR (EN.600.107 OR EN.601.107)).
Area: Engineering
How can robots localize themselves in an environment when navigating? Which factors predict whether patients are at greatest-risk for complications in the hospital? Can we reconstruct the brain's "connectome" from fMRI data? Many such big data questions can be answered using the paradigm of probabilistic models in machine learning. This is the second course on machine learning which focuses on probabilistic graphical models. You will learn about directed and undirected graphical models, inference methods, sampling, structure learning algorithms, latent variables, and temporal models. There will be regular assignments, which include theory and some programming. Students will analyze real data for their final project, applying methods discussed in class and writing up a report of their results. [Analysis or Applications] Students may receive credit for EN.600.476 or EN.600.676, but not both.
Prerequisite(s): EN.600.475/EN.601.475 OR EN.600.675/EN.601.675 or equivalent.;Students may receive credit for only one of EN.600.476, EN.601.476, EN.601.676.
Area: Engineering, Quantitative and Mathematical Sciences
"Big data" is not necessarily "high quality data." Systematically missing records, unobserved confounders, and selection effects present in many datasets make it harder than ever to answer scientifically meaningful questions. This course will teach mathematical tools to help you reason about causes, effects, and bias sources in data with confidence. We will use graphical causal models, and potential outcomes to formalize what causal effects mean, describe how to express these effects as functions of observed data, and use regression model techniques to estimate them. We will consider techniques for handling missing values, structure learning algorithms for inferring causal directionality from data, and connections between causal inference and reinforcement learning. [Analysis] Pre-requisites: familiarity with the R programming language, multivariate calculus, basics of linear algebra and probability.
Prerequisite(s): Students may receive credit for only one of EN.600.477, EN.600.677, EN.601.477, EN.601.677.;EN.601.475 OR (EN.553.211 OR EN.553.311 OR EN.553.420 OR EN.553.421) AND AS.110.202 or permission of instructor.
Area: Engineering, Quantitative and Mathematical Sciences
Deep learning (DL) has emerged as a powerful tool for solving data-intensive learning problems such as supervised learning for classification or regression, dimensionality reduction, and control. As such, it has a broad range of applications including speech and text understanding, computer vision, medical imaging, and perception-based robotics. The goal of this course is to introduce the basic concepts of deep learning (DL). The course will include a brief introduction to the basic theoretical and methodological underpinnings of machine learning, commonly used architectures for DL, DL optimization methods, DL programming systems, and specialized applications to computer vision, speech understanding, and robotics. Students will be expected to solve several DL problems on standardized data sets, and will be given the opportunity to pursue team projects on topics of their choice. [Applications]
Prerequisite(s): Students can receive credit for EN.601.482 or EN.601.682, but not both;EN.601.226 AND AS.110.202 AND (AS.110.201 OR AS.110.212 OR EN.553.291 OR EN.553.295) AND (EN.553.211 OR EN.553.310 OR EN.553.311 OR EN.553.420 OR EN.553.421); Python recommended.
Area: Engineering
There are considerable research thrusts that seek to increase the trustworthiness and perceived reliability of machine learning solutions. One such thrust, interpretable machine learning, attempts to reveal the working mechanisms of a machine learning system. However, other than on-task performance, interpretability is not a property of machine learning algorithms, but an affordance: a relationship between interpretable model and the target users in their context. Successful development of machine learning solutions that afford interpretation thus requires understanding of techniques beyond pure machine learning. In this course, we will first review the basics of machine learning and human-centered design. Then, during student team-delivered lectures, we will learn about contemporary techniques to introduce interpretability to machine learning models and discuss recent literature on the topic. In addition to hands-on homework assignments, students will work in groups to design, justify, implement, and test an interpretable machine learning algorithm for a problem of their choosing. Recommended background in (601.454/654, 601.290, 601.490/690 or 601.491/691) and 601.477/677, and coding in Python/PyTorch.
Prerequisite(s): (EN.601.476 OR EN.601.676) OR (EN.601.464 OR EN.601.664) OR (EN.601.482 OR EN.601.682)
Area: Engineering
The course gives an introduction to computational models of the mammalian visual cortex. It covers topics in low-, mid-, and high-level vision. It briefly discusses the relevant evidence from anatomy, electrophysiology, imaging (e.g., fMRI), and psychophysics. It concentrates on mathematical modelling of these phenomena taking into account recent progress in probabilistic models of computer vision and developments in machine learning, such as deep networks. [Applications or Analysis]. Programming experience (Python preferred).
Prerequisite(s): Students who have taken AS.050.375/AS.050.675/EN.601.685 are not eligible to take EN.601.485.;AS.110.106 OR AS.110.108
Area: Quantitative and Mathematical Sciences
Advances in Artificial intelligence have opened new opportunities for developing systems to aid in numerous areas of society. In order for AI systems to succeed in making constructive and positive changes, we must consider their impact on everyday life. Specifically, AI system designers must evaluate the overall capabilities of the system, consider the resulting human-AI interactions, and ensure that the system behaves in a responsible and ethical manner. In this project-based course you will work in teams of 3-5 students to 1) Identify a need with high-impact implications on everyday life; 2) Articulate principles of Responsible AI relevant to the intended application, 3) Conceptualize and design an AI system targeting this need, and 4) Develop the AI system by refining a demo-able prototype based on feedback received during course presentations. Additionally, we will discuss potential ethical issues that can arise in AI and how to develop Responsible AI principles. Coursework will consist of writing assignments, project presentations, and a project demonstration. Recommended background: Python programming, EN.601.290 or EN.601.454/654 or EN.601.490/690 or EN.601.491/691.
Prerequisite(s): (EN.601.475 OR EN.601.675) OR ( EN.601.464 OR EN.601.664) OR (EN.601.482 OR EN.601.682)
Area: Engineering
This course is designed to introduce undergraduate and graduate students to design techniques and practices in human-computer interaction (HCI), the study of interactions between humans and computing systems. Students will learn design techniques and evaluation methods, as well as current practices and exploratory approaches, in HCI through lectures, readings, and assignments. Students will practice various design techniques and evaluation methods through hands-on projects focusing on different computing technologies and application domains. This course is intended for undergraduate and graduate students in Computer Science/Cognitive Science/Psychology. Interested students from different disciplines should contact the instructor before enrolling in this course. [Applications]Recommended Background: Basic programming skills.
Prerequisite(s): Students can receive credit for either EN.601.490 or EN.601.690, but not both.
Area: Engineering
This course is designed to introduce advanced students to research methods and topics in human-robot interaction (HRI), an emerging research area focusing on the design and evaluation of interactions between humans and robotic technologies. Students will (1) learn design principles for building and research methods of evaluating interactive robot systems through lectures, readings, and assignments, (2) read and discuss relevant literature to gain sufficient knowledge of various research topics in HRI, and (3) work on a substantial project that integrates the principles, methods, and knowledge learned in this course. [Applications]
Prerequisite(s): Students can receive credit for EN.601.491 or EN.601.691, but not both;EN.601.220/EN.600.120 AND EN.601.226/EN.600.226
Area: Engineering
This weekly lecture/seminar course addresses similar material to 600.455, 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 in teams of at least 3 students, under the supervision of the instructor and clinical end users. Typically, this project is an extension of the term project from 600.455, although it does not have to be. Grades are based both on the project and on classroom recitations. Students who prefer to do individual projects must register for EN.601.456 instead. [Applications, Oral]
Prerequisite(s): Students may receive credit for only one of EN.601.456, EN.601.496, OR EN.601.656;EN.601.455 or permission
Area: Engineering
An 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.
Prerequisite(s): You must request Independent Academic Work using the Independent Academic Work form found in Student Self-Service: Registration, Online Forms.
Individual guided study for undergraduate students 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 required.
Prerequisite(s): You must request Independent Academic Work using the Independent Academic Work form found in Student Self-Service: Registration, Online Forms.
Individual research for undergraduates under the direction of a faculty member in the department. The program of research, including the credit to be assigned, must be worked out in advance between the student and the faculty member involved. Permission required.
Prerequisite(s): You must request Independent Academic Work using the Independent Academic Work form found in Student Self-Service: Registration, Online Forms.
Individual work in the field with a learning component, supervised by a faculty member in the department. The program of study and credit assigned must be worked out in advance between the student and the faculty member involved. As a rule of thumb, 40 hours of work is equivalent to one credit. Permission required.
Prerequisite(s): You must request Independent Academic Work using the Independent Academic Work form found in Student Self-Service: Registration, Online Forms.
Independent learning and application for undergraduates under the direction of a faculty member in the department. This course has a regular project group meeting that students are expected to attend. The individual project contributions, including the credit to be assigned, must be worked out in advance between the student and the faculty member involved.
Prerequisite(s): You must request Independent Academic Work using the Independent Academic Work form found in Student Self-Service: Registration, Online Forms.
Independent research for undergraduates under the direction of a faculty member in the department. This course has a weekly research group meeting that students are expected to attend. The program of research, including the credit to be assigned, must be worked out in advance between the student and the faculty member involved.
Prerequisite(s): You must request Independent Academic Work using the Independent Academic Work form found in Student Self-Service: Registration, Online Forms.
The student will undertake a substantial independent research project under the supervision of a faculty member, potentially leading to the notation "Departmental Honors with Thesis" on the final transcript. Students are expected to enroll in both semesters of this course during their senior year. Project proposals must be submitted and accepted in the preceding spring semester (junior year) before registration. Students will present their work publicly before April 1st of senior year. They will also submit a first draft of their project report (thesis document) at that time. Faculty will meet to decide if the thesis will be accepted for honors. Computer science majors only. Students should have a 3.5 GPA in computer science courses at the end of their junior year and permission of faculty sponsor.
Prerequisite(s): You must request Independent Academic Work using the Independent Academic Work form found in Student Self-Service: Registration, Online Forms.
For computer science majors only, a continuation of EN.601.519. Recommended Course Background: EN.601.519
Prerequisite(s): You must request Independent Academic Work using the Independent Academic Work form found in Student Self-Service: Registration, Online Forms.
The student will undertake a substantial independent research project in the area of computer-integrated surgery, under joint supervision of a WSE faculty adviser and a clinician or clinical researcher at the Johns Hopkins Medical School.
Prerequisite(s): You must request Independent Academic Work using the Independent Academic Work form found in Student Self-Service: Registration, Online Forms.;EN.600.445 or permission of instructor.
Computational and network aspects of the brain are explored. The topics covered include structure, operation and connectivity of neurons, general network structure of the neural system, and the connectivity constraints imposed by pre- and post-natal neural development and the desirability of network consistency within a species. Both discrete and continuous aspects of neural computation are covered. Precise mathematical tools and analyses such as logic design, transient and steady state behavior of linear systems, and time and connectivity randomization are discussed. The concepts are illustrated with several applications. Memory formation from the synaptic level to the high level constructs are explored. Students are not expected to master any of the mathematical techniques but are expected to develop a strong qualitative appreciation of their power. Cerebellum, which has a simple network connectivity, will be covered as a typical system. Recommended course background: linear algebra, differential equations, probability, and algorithms.
Prerequisite(s): Students can receive credit for EN.601.404 or EN.601.604, but not both
Area: Engineering
This course is the second half of a two-course sequence and is a continuation of course EN.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]
Prerequisite(s): EN.660.410
Area: Engineering
Software-Defined Networks (SDN) enable programmability of data networks and hence rapid introduction of new services. They use software-based controllers to communicate with underlying hardware infrastructure and direct traffic on a network. This model differs from that of traditional networks, which use dedicated hardware devices (i.e., routers and switches) to control network traffic. This technology is becoming a key part of web scale networks (at companies like Google and Amazon) and 5G/6G networks. Its importance will keep on growing. Many of today’s services and applications, especially when they involve the cloud, could not function without SDN. SDN allows data to move easily between distributed locations, which is critical for cloud applications. A major focus will be on how this technology will be used in 5G and 6G Networks. The course will cover basics of SDN, ongoing research in this area, and the industrial deployments. Required Course Background: computer networks.
Prerequisite(s): Students can receive credit for EN.601.413 or EN.601.613, but not both.
Area: Engineering
Topics covered will include applications layer protocols (e.g. HTTP, FTP, SMTP), transport layer protocols (UDP, TCP), network layer protocols (e.g. IP, ICMP), link layer protocols (e.g. Ethernet) and wireless protocols (e.g. IEEE 802.11). The course will also cover routing protocols such as link state and distance vector, multicast routing, and path vector protocols (e.g. BGP). The class will examine security issues such as firewalls and denial of service attacks. We will also study DNS, Web caching and CDNS, peer to peer, and protocol tunneling. Finally, we will explore security protocols (e.g. TLS, SSH, IPsec), as well as some basic cryptography necessary to understand these. Grading will be based on hands-pn programming assignments, homework and two exams. [Systems]Required course background: C/C++ programming and data structures, or permission.
Prerequisite(s): Students can only receive credit for EN.601.414 or EN.601.614, but not both.
Area: Engineering
Same material as 601.415, for graduate students. Introduction to database management systems and database design, focusing on the relational and object-oriented data models, query languages and query optimization, transaction processing, parallel and distributed databases, recovery and security issues, commercial systems and case studies, heterogeneous and multimedia databases, and data mining. [Systems] (www.cs.jhu.edu/~yarowsky/cs415.html) Required course background: Data Structures
Prerequisite(s): Students may receive credit for only one of EN.600.315, EN.600.415, EN.601.315, EN.601.415, EN.601.615.
Area: Engineering
Graduate version of 601.317 Systems. Students may receive credit for 601.317 or 601.417 but not both. Recommended Course Background: EN.601.220, EN.601.226
Prerequisite(s): Students may receive credit for only one of 417/617
Area: Engineering
Same material as 601.418, for graduate students. This course covers fundamental topics related to operating systems theory and practice. Topics include processor management, storage management, concurrency control, multi-programming and processing, device drivers, operating system components (e.g., file system, kernel), modeling and performance measurement, protection and security, and recent innovations in operating system structure. Course work includes the implementation of operating systems techniques and routines, and critical parts of a small but functional operating system. [Systems] Required course background: Data Structures & Computer System Fundamentals
Prerequisite(s): Students may receive credit for only one of EN.600.318, EN.600.418, EN.601.318, EN.601.418, EN.601.618.
Area: Engineering
Clouds host a wide range of the applications that we rely on today. In this course, we study common cloud applications, traffic patterns that they generate, critical networking infrastructures that support them, and core networking and distributed systems concepts, algorithms, and technologies used inside clouds. We will also study how today's application demand is influencing the network’s design, explore current practice, and how we can build future's networked infrastructure to better enable both efficient transfer of big data and low-latency requirements of real-time applications. The format of this course will be a mix of lectures, discussions, assignments, and a project designed to help students practice and apply the theories and techniques covered in the course. [Systems] Prerequisites: EN.601.226 or permission. Students can only receive credit for one of 601.419/619. Recommended: a course in operating systems, networks or systems programming.
Prerequisite(s): Students may earn credit for EN.601.419 or EN.601.619, but not both.
Area: Engineering
This course studies parallelism in data science, drawing examples from data analytics, statistical programming, and machine learning. It focuses mostly on the Python programming ecosystem but will use C/C++ to accelerate Python and Java to explore shared-memory threading. It explores parallelism at all levels, including instruction level parallelism (pipelining and vectorization), shared-memory multicore, and distributed computing. Concepts from computer architecture and operating systems will be developed in support of parallelism, including Moore’s law, the memory hierarchy, caching, processes/threads, and concurrency control. The course will cover modern data-parallel programming frameworks, including Dask, Spark, Hadoop!, and Ray. The course will not cover GPU deep-learning frameworks nor CUDA. The course is suitable for second-year undergraduate CS majors and graduate students from other science and engineering disciplines that have prior programming experience. Required course background: Data Structures, Computer System Fundamentals, and familiarity with Python. [Systems]
Prerequisite(s): Students may receive credit for only one of EN.601.320, EN.601.420, OR EN.601.620.
Area: Engineering
This course focuses on understanding the history, the vulnerability, and the need to protect our Critical Infrastructure and Key Resources (CIKR). We will start by briefly surveying the policies which define the issues surrounding CIKR and the strategies that have been identified to protect them. Most importantly, we will take a comprehensive approach to evaluating the technical vulnerabilities of the 18 identified sectors, and we will discuss the tactics that are necessary to mitigate the risks associated with each sector. These vulnerabilities will be discussed from the perspective of ACM, IEEE or other technical journals/articles which detail recent and relevant network-level CIKR exploits. We will cover well known vulnerable systems such the Internet, SCADA or PLC and lesser known systems such as E911 and industrial robot. Also, a class project is required. Required course background: intermediate programming, data structures, and experience in mobile or web app development.
Prerequisite(s): Students may receive credit for only one of EN.600.321, EN.600.421, EN.601.421, EN.601.621.
Area: Engineering
Studies show that testing can account for over 50% of software development costs. This course presents a comprehensive study of software testing, principles, methodologies, tools, and techniques. Topics include testing principles, coverage (graph coverage, logic coverage, input space partitioning, and syntax-based coverage), unit testing, higher-order testing (integration, system-level, acceptance), testing approaches (white-box, black-box, grey-box), regression testing, debugging, delta debugging, and several specific types of functional and non-functional testing as schedule/interest permits (GUI testing, usability testing, security testing, load/performance testing, A/B testing etc.). For practical topics, state- of-the-art tools/techniques will be studied and utilized. [Systems]
Prerequisite(s): EN.601.290 OR EN.601.421 OR EN.601.621;Students can only take EN.601.422 or EN.601.622, but not both.
Area: Engineering
Reliability is an essential quality requirement for all artifacts operating in the real-world, ranging from bridges, cars to power grids. Software systems are no exception. In this computing age when software is transforming even traditional mission-critical artifacts, making sure the software we write is reliable becomes ever more important. This course exposes students to the principles and techniques in building reliable systems. We will study a set of systematic approaches to make software more robust. These include but are not limited to static analysis, testing framework, model checking, symbolic execution, fuzzing, and formal verification. In addition, we will cover the latest research in system reliability. Recommended course background: EN.601.220 AND EN.601.628.
Prerequisite(s): Students may receive credit for EN.601.424 OR EN.601.624, but not both.
This course introduces modern software systems design, with an emphasis on how to design large-scale systems, assess common system design trade-offs, and tackle system design challenges. It covers non-functional requirements, API design, distributed systems concepts, modern software building blocks (e.g., load balancers, caches, containers, etc.). Additionally, it includes case studies of common system design problems, some drawn from interview questions. Ultimately, this course helps learners become better software engineers.Required course background: EN.601.315/415/615 Databases, or permission. Students may receive credit for only one of 601.425/625.
Prerequisite(s): Students may take EN.601.425 OR EN.601.625 for credit, but not both.
Same material as EN.601.426, for graduate students. 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: EN.601.226.
Prerequisite(s): Students may only receive credit for one of the following: EN.601.426 or EN.601.626.
Area: Engineering, Quantitative and Mathematical Sciences
This course is designed as a follow-on to Principles of Programming Languages. It will cover a wide array of fundamental topics in programming languages, including advanced functional programming, the theory of inductive definitions, advanced operational semantics, advanced type systems, program analysis, program verification, theorem provers and SAT solvers.[Analysis]
Prerequisite(s): EN.601.426 OR EN.601.626
Introduction to compiler design, including lexical analysis, parsing, syntax-directed translation, symbol tables, runtime environments, and code generation and optimization. Students are required to write a compiler as a course project. [Systems] Required course background: intermediate programming, data structures and computer system fundamentalsRecommended background: automata and computation theory
Prerequisite(s): Students may receive credit for only one of EN.601.428 or 601.628.
Area: Engineering
How can we effectively use functional programming techniques to build real-world software? This course will primarily focus on using the OCaml programming language for this purpose. Topics covered include OCaml basics, modules, standard libraries, testing, quickcheck, build tools, functional data structures and efficiency analysis, monads, streams, and promises. Students will practice what they learn in lecture via functional programming assignments and a final project. Required course background in data structures (601.226)
Prerequisite(s): Students can receive credit for only one of 601.429/601.629.
Area: Engineering
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]Recommended Course Background: probability theory and linear algebra
Prerequisite(s): Students may receive credit for only one of 430/630
Area: Engineering, Quantitative and Mathematical Sciences
This course covers the theoretical foundations of computer science. Topics included will be models of computation from automata to Turing machines, computability, complexity theory, randomized algorithms, inapproximability, interactive proof systems and probabilistically checkable proofs. Students may not take both 601.231 and 601.431/601.631, unless one is for an undergrad degree and the other for grad. [Analysis] Required Background: discrete math or permission; discrete probability theory recommended.
Prerequisite(s): Students can receive credit for only one of EN.601.431/EN.601.631
Area: Engineering, Quantitative and Mathematical Sciences
Same material as EN.601.433, for graduate students.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] Required background: Data Structures and Discrete Math or Automata/Computation Theory
Prerequisite(s): Students may receive credit for only one of EN.600.363, EN.600.463, EN.601.433, EN.601.633, EN.601.226
Area: Engineering, Quantitative and Mathematical Sciences
Same material as 601.434, for graduate students. The course emphasizes algorithmic design aspects, and how randomization can be a helpful tool. The topics covered include: tail inequalities, linear programming relaxation & randomized rounding, de-randomization, existence proofs, universal hashing, markov chains, metropolis and metropolis-hastings methods, mixing by coupling and by eigenvalues, counting problems, semi-definite programming and rounding, lower bound arguments, and applications of expanders. [Analysis] (www.cs.jhu.edu/~cs464) Required course background: EN.600.363 or EN.601.433 or EN.601.633.
Prerequisite(s): Students may receive credit for only one of EN.600.464, EN.600.664, EN.601.434, EN.601.634.
Area: Engineering
Graduate version of EN.601.435. Recommended Background: EN.601.633 or equivalent. Students may receive credit for EN.601.435 or EN.601.635, but not both.
Same material as EN.601.436, for graduate students. This course provides an introduction to algorithmic game theory: the study of games from the perspective of algorithms and theoretical computer science. There will be a particular focus on games that arise naturally from economic interactions involving computer systems (such as economic interactions between large-scale networks, online advertising markets, etc.), but there will also be broad coverage of games and mechanisms of all sorts. Topics covered will include a) complexity of computing equilibria and algorithms for doing so, b) (in)efficiency of equilibria, and c) algorithmic mechanism design. [Analysis]
Prerequisite(s): Students may receive credit for EN.601.436 or EN.601.636, but not both.
Area: Engineering, Quantitative and Mathematical Sciences
Federated Learning (FL) is an area of machine learning where data is distributed across multiple devices and training is performed without exchanging the data between devices. FL can be contrasted with classical machine learning settings when data is available in a central location. As such, FL faces additional challenges and limitations such as privacy and communication. For example, FL may deal with questions of learning from sensitive data on mobile devices while protecting privacy of individual users and dealing with low power and limited communication. As a result, FL requires knowledge of many interdisciplinary areas such as differential privacy, distributed optimization, sketching algorithms, compression and more. In this course students will learn basic concepts and algorithms for FL and federated analytics, and gain hands-on experience with new methods and techniques. Students will gain understanding in reasoning about possible trade-offs between privacy, accuracy and communication. [Analysis] Required:: 433/633 (Algo), 475/675 (ML) or 482/682 (ML: DL), linear algebra, probability
Prerequisite(s): Students may receive credit for only one of 601.437 or 601.637
This course begins with reviewing basic knowledge of the World Wide Web, and then exploring the central defense concepts behind Web security, such as same-origin policy, cross-origin resource sharing, and browser sandboxing. It will cover the most popular Web vulnerabilities, such as cross-site scripting (XSS) and SQL injection, as well as how to attack and penetrate software with such vulnerabilities. Students will learn how to detect, respond, and recover from security incidents. Newly proposed research techniques will also be discussed. [Systems]Required course background: data structures, computer system fundamentals and javascript/web development. Students may receive credit for only one of 601.340/440/640.
Prerequisite(s): Students may receive credit for only one of 601.640/440/640
Same as EN.601.441, for graduate students. This course will introduce students to cryptocurrencies and the main underlying technology of Blockchains. The course will start with the relevant background in cryptography and then proceed to cover the recent advances in the design and applications of blockchains. This course should primarily appeal to students who want to conduct research in this area or wish to build new applications on top of blockchains. It should also appeal to those who have a casual interest in this topic or are generally interested in cryptography. Students are expected to have mathematical maturity. Recommended Course Background: EN.601.226 AND (EN.553.310 OR EN.553.420)
Prerequisite(s): Students may receive credit for only one of EN.600.451 OR EN.601.441 OR EN.601.641
Area: Engineering
Same material as 601.442, for graduate students. Modern Cryptography includes seemingly paradoxical notions such as communicating privately without a shared secret, proving things without leaking knowledge, and computing on encrypted data. In this challenging but rewarding course we will start from the basics of private and public key cryptography and go all the way up to advanced notions such as zero-knowledge proofs, functional encryption and program obfuscation. The class will focus on rigorous proofs and require mathematical maturity. [Analysis] Required course background: Probability & Automata/Computation Theory
Prerequisite(s): Students may receive credit for only one of EN.601.442 OR EN.601.642.
Area: Engineering, Quantitative and Mathematical Sciences
Same material as 601.443, for graduate students. Lecture topics will include computer security, network security, basic cryptography, system design methodology, and privacy. There will be a heavy work load, including written homework, programming assignments, exams and a comprehensive final. The class will also include a semester-long project that will be done in teams and will include a presentation by each group to the class. [Applications] Required course background: C programming and computer system fundamentals.
Prerequisite(s): Students may receive credit for only one of EN.600.443, EN.601.443, EN.601.643.
Area: Engineering
Same material as 601.444, for graduate students. 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]Recommended. Course Background: EN.601.220, EN.601.226 or equivalent
Prerequisite(s): Students may receive credit for only one of EN.600.454, EN.650.454, EN.601.445, EN.601.645.
Area: Engineering
Same material as 601.445, for graduate students. 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]
Prerequisite(s): Students may receive credit for EN.600.454/EN.601.445 or EN.601.645, but not both.
Area: Engineering
Many of the world's largest and fastest-growing datasets are text, e.g. DNA sequencing data, web pages, logs and social media posts. Such datasets are useful only to the degree we can query, compare and analyze them. Here we discuss two powerful approaches in this area. We will cover sketching, which enables us to summarize very large texts in small structures that allow us to measure the sizes of sets and of their unions and intersections. This in turn allows us to measure similarity and find near neighbors. Second, we will discuss indexing --- succinct and compressed indexes in particular -- which enables us to efficiently search inside very long strings, especially in highly repetitive texts. [Analysis]
Prerequisite(s): Students may receive credit for EN.601.446 or EN.601.646, but not both.
Same material as 601.447, for graduate students. Your genome is the blueprint for the molecules in your body. It's also a string of letters (A, C, G and T) about 3 billion letters long. How does this string give rise to you? Your heart, your brain, your health? This, broadly speaking, is what genomics research is about. This course will familiarize you with a breadth of topics from the field of computational genomics. The emphasis is on current research problems, real-world genomics data, and efficient software implementations for analyzing data. Topics will include: string matching, sequence alignment and indexing, assembly, and sequence models. Course will involve significant programming projects. [Applications]Required course background: Intermediate programming (C/C++) and Data Structures
Prerequisite(s): Students may receive credit for only one EN.601.447/647/747
Area: Engineering
The goal of this course is to study the leading computational and quantitative approaches for comparing and analyzing genomes starting from raw sequencing data. The course will focus on human genomics and human medical applications, but the techniques will be broadly applicable across the tree of life. The topics will include genome assembly & comparative genomics, variant identification & analysis, gene expression & regulation, personal genome analysis, and cancer genomics. The grading will be based on assignments, a midterm exam, class presentations, and a significant class project. Prerequisites: knowledge of the Unix operating system and programming expertise in a language such as R or Python. [Applications]
Prerequisite(s): Students may receive credit for only one of EN.601.449/EN.601.649/EN.601.749.
Immunology studies defensive mechanisms of living organisms against external threats. Computational immunogenomics is a new field of bioinformatics that develops and applies computational approaches to the study and interpretation of immunological data, seeking to answer questions about adaptive immune responses in humans and important animals. In this course, students will learn how to design, apply, and benchmark algorithms for solving immunogenomics problems. [Applications]. Required Course Background: Intermediate Programming & Data Structures. Students may receive credit for only one of EN.601.451, EN.601.651.
Prerequisite(s): Students may receive credit for only one of EN.601.451 OR EN.601.651.
This course is designed to expand the student’s augmented reality knowledge and introduce relevant topics necessary for developing more meaningful applications and conducting research in this field. The course addresses the fundamental concepts of visual perception and introduces non-visual augmented reality modalities, including auditory, tactile, gustatory, and olfactory applications. The following sessions discuss the importance of integrating user-centered design concepts to design meaningful augmented reality applications. A later module introduces the basic requirements to design and conduct user studies and guidelines on interpreting and evaluating the results from the studies. During the course, students conceptualize, design, implement and evaluate the performance of augmented reality solutions for their use in industrial applications, teaching and training, or healthcare settings. Homework in this course will relate to applying the theoretical methods used for designing, implementing, and evaluating augmented reality applications. Required course background: intermediate programming (C/C++), data structures, linear algebra; EN.601.654 preferred.
Prerequisite(s): Students may receive credit for only one of EN.601.453 or EN.601.653, but not both.
Area: Engineering
This course introduces students to the field of Augmented Reality. It reviews its basic definitions, principles, and applications. The course explains how fundamentals concepts of computer vision are applied for the development of Augmented Reality applications. It then focuses on describing the principal components and particular requirements to implement a solution using this technology. The course also discusses the main issues of calibration, tracking, multi-modal registration, advanced visualization, and display technologies. Homework in this course will relate to the mathematical methods used for calibration, tracking, and visualization in augmented reality. [Applications] Required course background: intermediate programming (C/C++), data structures, linear algebra.
Prerequisite(s): Students may receive credit for only on EN.601.454/EN.601.654
Same material as 601.455, for graduate students. This course focuses on computer-based techniques, systems, and applications exploiting quantitative information from medical images and sensors to assist clinicians in all phases of treatment from diagnosis to preoperative planning, execution, and follow-up. It emphasizes the relationship between problem definition, computer-based technology, and clinical application and includes a number of guest lectures given by surgeons and other experts on requirements and opportunities in particular clinical areas. [Applications] Required Course Background: data structures and linear algebra or permission.Recommended Course Background: intermediate programming in C/C++, EN.601.457, EN.601.461, image processing.
Prerequisite(s): Students may receive credit for only one of EN.601.455 or EN.601.655.
Area: Engineering
Same material as EN.601.456, for graduate students. This weekly lecture/seminar course addresses similar material to EN.601.655, 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 EN.601.655, 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 EN.601.356. [Applications] Students may receive credit for only one of 601.456/496/656.
Prerequisite(s): Students may receive credit for only one of EN.600.446, EN.600.646, EN.601.456, EN.601.496, OR EN.601.656.;EN.600.445/EN.601.455 OR EN.600.645/EN.601.655 OR permission of the instructor.
Same material as 601.457, for graduate students. This course introduces computer graphics techniques and applications, including image processing, rendering, modeling and animation. [Applications]Permission of instructor is required for students not satisfying a pre-requisite. No Audits.Required course background: EN.601.220 (C++), EN.601.226, linear algebra.
Prerequisite(s): Students may receive credit for only one of EN.601.457 OR EN.601.657.
Area: Engineering, Quantitative and Mathematical Sciences
This course will provide an introduction to computational geometry. It will cover a number of topics in two- and three-dimensions, including polygon triangulations and partitions, convex hulls, Delaunay and Voronoi diagrams, arrangements, and spatial queries. Time-permitting, we will also look at kD-trees, general BSP-trees, and quadtrees. [Analysis] Recommended Course Background: EN.601.220 AND EN.601.226 AND (EN.600.363 OR EN.601.433).
Prerequisite(s): Students may earn credit for EN.601.459 or EN.601.659, but not both.
Area: Engineering, Quantitative and Mathematical Sciences
This course provides an overview of fundamental methods in computer vision from a computational perspective. Methods studied include: camera systems and their modelling, computation of 3¬D geometry from binocular stereo, motion, and photometric stereo, and object recognition, image segmentation, and activity analysis. Elements of machine learning and deep learning are also included. [Applications]Required course background: Intro to Programming, Linear Algebra & prob/stats
Prerequisite(s): Students may receive credit for only one of EN.601.461, EN.601.661, OR EN.601.761.
Area: Engineering
Same material as EN.601.463, for graduate students. 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] Recommended Course Background: EN.601.226, linear algebra, calculus, probability.
Prerequisite(s): Students may receive credit for only one of 601.463/663/763
Area: Engineering
Same material as EN.601.464, for graduate students. This course is recommended for students, scientists, and engineers with a genuine curiosity about the fundamental obstacles in getting machines to perform tasks such as deduction, learning, planning and navigation. It covers methods for automated reasoning, automatic problem solvers and planners, knowledge representation mechanisms, game playing, machine learning, and statistical pattern recognition. Strong programming skills are expected, as well as basic familiarity with probability. Students intending to also take courses in machine learning (e.g. 601.475/675, 601.476/676, 601.482/682) may find it beneficial to take this course first, or concurrently. Recommended Course Background: EN.601.226.
Prerequisite(s): Students may receive credit for only one of EN.601.464 OR EN.601.664.
Area: Engineering
Same material as 601.465, for graduate students. An in-depth introduction to core techniques for analyzing, transforming, and generating human language. The course spans linguistics, modeling, algorithms, and applications. (1) How should linguistic structure and meaning be represented (e.g., trees, morphemes, ?-terms, vectors)? (2) How can we formally model the legal structures and their probabilities (e.g., grammars, automata, features, log-linear models, recurrent neural nets, Transformers)? (3) What algorithms can estimate the parameters of these models (e.g., gradient descent, EM) and efficiently identify probable structures (e.g., dynamic programming, beam search)? (4) Finally, what kinds of systems can be built with these techniques and how are they constructed and evaluated in practice? Detailed assignments guide students through many details of implementing core NLP methods. The course proceeds from first principles, although prior exposure to AI, statistics, ML, or linguistics can be helpful. [Applications] Prerequisite: Data Structures and basic familiarity with Python, partial derivatives, matrix multiplication and probabilities.
Prerequisite(s): Students may receive credit for only one of EN.601.465 OR EN.601.665.
Area: Engineering
Same material as EN.601.466, for graduate students. 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] Recommended Course Background: EN.601.226
Prerequisite(s): Students can receive credit for EN.601.466 or EN.601.666, but not both
Area: Engineering
This course gives an overview of basic foundations and applications of human language technology, such as: morphological, syntactic, semantic, and pragmatic processing; machine learning; signal processing; speech recognition; speech synthesis; information retrieval; text classification; topic modelling; informationextraction; knowledge representation; machine translation; dialog systems; etc. [Applications]Required Background: EN.601.226 Data Structures; knowledge of Python recommended.
Prerequisite(s): Students can receive credit for only one of 601.467/601.647
Same material as 601.468, for graduate students. 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: Data Structures and prob/stats
Prerequisite(s): Students may receive credit for only one of EN.601.468 OR EN.601.668.
Area: Engineering
This course covers a number of topics explored in introductory AI, such as knowledge representation, reasoning, and natural language understanding. Unlike introductory AI, we will pursue these topics based on the transformer neural architecture. We will motivate the material through interacting with agents in games: how to build models that understand user commands, how to generate responses back to a user, and how to reason about a synthetic environment to determine a course of action. Assignments will include programming, presentations on readings, and written summaries of readings. [Applications]
The rise of massive self-supervised (pre-trained) models have transformed various data-driven fields such as natural language processing (NLP). In this course, students will gain a thorough introduction to self-supervised learning techniques for NLP applications. Through lectures, assignments, and a final project, students will learn the necessary skills to design, implement, and understand their own self-supervised neural network models, using the Pytorch framework. Required course background: data structures, linear algebra, probability, familiarity with Python/PyTorch, natural language processing or machine learning.
Prerequisite(s): Students may receive credit for EN.601.471 or EN.601.671, but not both.;((EN.601.464 OR EN.601.664) OR (EN.601.465 OR EN.601.665) OR (EN.601.467 OR EN.601.667) OR (EN.601.468 OR EN.601.668) OR (EN.601.475 OR EN.601.675))
Area: Engineering
This is a graduate level course in machine learning. It will provide a formal and in-depth coverage of topics in statistical and computational learning theory. 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 runtime (computational or iteration complexity). We will cover topics including PAC learning, uniform convergence, VC dimension, Rademacher complexity, algorithmic stability, kernel methods, online learning and reinforcement learning, as well as introduce students to current topics in large-scale machine- learning and randomized projections. General focus will be on combining methodology with theoretical and computational foundations. [Analysis]
Same material as 601.475, for graduate students. Machine learning is subfield of computer science and artificial intelligence, whose goal is to develop computational systems, methods, and algorithms that can learn from data to improve their performance. This course introduces the foundational concepts of modern Machine Learning, including core principles, popular algorithms and modeling platforms. This will include both supervised learning, which includes popular algorithms like SVMs, logistic regression, boosting and deep learning, as well as unsupervised learning frameworks, which include Expectation Maximization and graphical models. Homework assignments include a heavy programming components, requiring students to implement several machine learning algorithms in a common learning framework. Additionally, analytical homework questions will explore various machine learning concepts, building on the pre-requisites that include probability, linear algebra, multi-variate calculus and basic optimization. Students in the course will develop a learning system for a final project. [Applications or Analysis] Required course background: multivariable calculus, probability, linear algebra, intro to computing
Prerequisite(s): Students may receive credit for only one of EN.601.475 OR EN.601.675.
Area: Engineering
Same material as EN.601.476, for graduate students. How can robots localize themselves in an environment when navigating? Which factors predict whether patients are at greatest-risk for complications in the hospital? Can we reconstruct the brain's "connectome" from fMRI data? Many such big data questions can be answered using the paradigm of probabilistic models in machine learning. This is the second course on machine learning which focuses on probabilistic graphical models. You will learn about directed and undirected graphical models, inference methods, sampling, structure learning algorithms, latent variables, and temporal models. There will be regular assignments, which include theory and some programming. Students will analyze real data for their final project, applying methods discussed in class and writing up a report of their results. [Analysis or Applications] Recommended Background: EN.600.475 or EN.601.675 or equivalent. Students may receive credit for EN.600.476 or EN.600.676, but not both.
Prerequisite(s): Students may receive credit for only one of EN.600.476, EN.601.476, EN.601.676.
Area: Engineering, Quantitative and Mathematical Sciences
"Big data" is not necessarily "high quality data." Systematically missing records, unobserved confounders, and selection effects present in many datasets make it harder than ever to answer scientifically meaningful questions. This course will teach mathematical tools to help you reason about causes, effects, and bias sources in data with confidence. We will use graphical causal models, and potential outcomes to formalize what causal effects mean, describe how to express these effects as functions of observed data, and use regression model techniques to estimate them. We will consider techniques for handling missing values, structure learning algorithms for inferring causal directionality from data, and connections between causal inference and reinforcement learning. [Analysis] Pre-requisites: familiarity with the R programming language, multivariate calculus, basics of linear algebra and probability.
Prerequisite(s): Students may receive credit for only one of EN.601.477 OR EN.601.677.
Area: Engineering, Quantitative and Mathematical Sciences
Deep learning (DL) has emerged as a powerful tool for solving data-intensive learning problems such as supervised learning for classification or regression, dimensionality reduction, and control. As such, it has a broad range of applications including speech and text understanding, computer vision, medical imaging, and perception-based robotics. The goal of this course is to introduce the basic concepts of deep learning (DL). The course will include a brief introduction to the basic theoretical and methodological underpinnings of machine learning, commonly used architectures for DL, DL optimization methods, DL programming systems, and specialized applications to computer vision, speech understanding, and robotics. Students will be expected to solve several DL problems on standardized data sets, and will be given the opportunity to pursue team projects on topics of their choice. [Applications]. Required course background: probability and linear algebra, some machine learning; calc III and numerical optimization recommended.
Prerequisite(s): Students may receive credit for EN.601.482 or EN.601.682, but not both.
Area: Engineering
There are considerable research thrusts that seek to increase the trustworthiness and perceived reliability of machine learning solutions. One such thrust, interpretable machine learning, attempts to reveal the working mechanisms of a machine learning system. However, other than on-task performance, interpretability is not a property of machine learning algorithms, but an affordance: a relationship between interpretable model and the target users in their context. Successful development of machine learning solutions that afford interpretation thus requires understanding of techniques beyond pure machine learning. In this course, we will first review the basics of machine learning and human-centered design. Then, during student team-delivered lectures, we will learn about contemporary techniques to introduce interpretability to machine learning models and discuss recent literature on the topic. In addition to hands-on homework assignments, students will work in groups to design, justify, implement, and test an interpretable machine learning algorithm for a problem of their choosing. Required course background: 601.475/675 or 601.464/664 or 601.482/682; coding in Python/PyTorch. Recommended (601.454/654, 601.290, 601.490/690 or 601.491/691) and 601.477/677.
The course gives an introduction to computational models of the mammalian visual cortex. It covers topics in low-, mid-, and high-level vision. It briefly discusses the relevant evidence from anatomy, electrophysiology, imaging (e.g., fMRI), and psychophysics. It concentrates on mathematical modelling of these phenomena taking into account recent progress in probabilistic models of computer vision and developments in machine learning, such as deep networks. [Applications or Analysis]. Programming experience (Python preferred).
Prerequisite(s): Students who have taken AS.050.375/AS.050.675 are not eligible to take EN.601.685.
Area: Quantitative and Mathematical Sciences
Advances in Artificial intelligence have opened new opportunities for developing systems to aid in numerous areas of society. In order for AI systems to succeed in making constructive and positive changes, we must consider their impact on everyday life. Specifically, AI system designers must evaluate the overall capabilities of the system, consider the resulting human-AI interactions, and ensure that the system behaves in a responsible and ethical manner. In this project-based course you will work in teams of 3-5 students to 1) Identify a need with high-impact implications on everyday life; 2) Articulate principles of Responsible AI relevant to the intended application, 3) Conceptualize and design an AI system targeting this need, and 4) Develop the AI system by refining a demo-able prototype based on feedback received during course presentations. Additionally, we will discuss potential ethical issues that can arise in AI and how to develop Responsible AI principles. Coursework will consist of writing assignments, project presentations, and a project demonstration.Required course background: (EN.601.475/675 or EN.601.464/664 or EN.601.482/682) and Python programming. Recommended: 601.290 or 601.454/654 or 601.490/690 or 601.491/691 (experience with human computer interface design).
Prerequisite(s): (EN.601.475 OR EN.601.675) OR ( EN.601.464 OR EN.601.664) OR (EN.601.482 OR EN.601.682)
Area: Engineering
This course is designed to introduce undergraduate and graduate students to design techniques and practices in human-computer interaction (HCI), the study of interactions between humans and computing systems. Students will learn design techniques and evaluation methods, as well as current practices and exploratory approaches, in HCI through lectures, readings, and assignments. Students will practice various design techniques and evaluation methods through hands-on projects focusing on different computing technologies and application domains. This course is intended for undergraduate and graduate students in Computer Science/Cognitive Science/Psychology. Interested students from different disciplines should contact the instructor before enrolling in this course. [Applications]Recommended Background: Basic programming skills.
Prerequisite(s): Students can receive credit for either EN.601.490 or EN.601.690, but not both.
Area: Engineering
This course is designed to introduce graduate students to research methods and topics in human-robot interaction (HRI), an emerging research area focusing on the design and evaluation of interactions between humans and robotic technologies. Students will (1) learn design principles for building and research methods of evaluating interactive robot systems through lectures, readings, and assignments, (2) read and discuss relevant literature to gain sufficient knowledgeof various research topics in HRI, and (3) work on a substantial project that integrates the principles, methods, and knowledge learned in this course. [Applications] Pre-req: EN.601.220 and EN.601.226.
Prerequisite(s): Students may receive credit for EN.601.491 or EN.601.691.
This will be a graduate-level networking course. New applications such as ones for metaverse require networking and computing to be imbedded together. This feature is already beginning to be implemented in 5G and 6G networks; 6G will also allow networks to be used as sensors. These advances are enabled by new technologies such as mobile edge computing, software-defined networking (SDN), network slicing, digital twins, and named-data networking (NDN). This course will start with introductory lectures on these topics. Students will be asked to study new papers and do course projects. These activities should result in longer term research projects. Required Course Background: A course in computer networks (e.g., EN.601.414/614 Computer Network Fundamentals or the equivalent), or permission of the instructor. [Systems]
This is a graduate-level course on computer networks. It provides a comprehensive overview on advanced topics in network protocols and networked systems. The course will cover both classic papers on Internet protocols and recent research results. It will examine a wide range of topics, e.g., routing, congestion control, network architectures, datacenter networks, network virtualization, software-defined networking, and programmable networks, with an emphasize on core networking concepts and principles. The course will include lectures, paper discussions, programming assignments and a research project. Recommended Course Background: One undergraduate course in computer networks (e.g., EN.601.414/614 Computer Network Fundamentals or the equivalent), or permission of the instructor. The course assignments and projects assume students to be comfortable with programming.
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. Recommended Course Background: a systems course (distributed systems, operating systems, computer networks, parallel programming) or permission of instructor.
Students will study advanced operating system topics and be exposed to recent developments in operating systems research. This course involves readings on classic and new papers. Topics include virtual memory management, synchronization and communication, file systems, protection and security, operating system structure and extension techniques, fault tolerance, and history and experience of systems programming. [Systems]
Prerequisite(s): EN.600.318 OR EN.600.418 OR EN.601.318 OR EN.601.418 OR EN.601.618
This course will introduce Language-based Security, an emerging field in cyber security that leverages techniques from compilers and program analysis for security-related problems. Topics include but are not limited to: Control-flow and data-flow graphs, Program slicing, Code property graph (CPG), and Control-flow integrity. Students are expected to read new and classic papers in this area and discuss them in class. Recommended backgrounds are Operating Systems and preferably Compilers.
Topics will vary from year to year, but will focus on applied cryptography and communications, focused on the development of secure and uncensorable communication mechanisms for communities at risk. This course will include topics such as: communication protocol design and analysis, blockchain-based protocols, anonymous communication, cryptographic backdoors, and other topics. Emphasis in this course is on understanding how cryptographic issues impact real systems, while maintaining an appreciation for grounding the work in fundamental science. The course will consist of in-class workshops and interactive discussions. There will be programming assignments and a course project with real world impact. Students will also be expected to read assigned papers and to present at least one research paper and lead a discussion on it. [Systems]
Prerequisite(s): ((EN.601.441 OR EN.601.641) OR (EN.601.442 OR EN.601.642) OR (EN.601.445 OR EN.601.645))
This course will focus on advanced cryptographic topics with an emphasis on open research problems and student presentations.
Prerequisite(s): EN.601.442 OR EN.601.642 or Permission of Instructor.
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. A college level security or crypto course at Hopkins or any other school is required.
This reading and project based course will explore the latest research in the area of applied cryptography and cryptographic engineering. Topics covered will include zero knowledge, efficient multiparty computation, cryptocurrencies, and trusted computing hardware. Readings will be drawn from the latest applied cryptography and security conferences. The course will include both reading, critical analysis, presentations and a course programming project. [Analysis or Applications]
Prerequisite(s): EN.600.454 OR EN.601.445 OR EN.601.645 OR EN.600.442 OR EN.601.442 OR EN.601.642
The goal of this course is to study the leading computational and quantitative approaches for comparing and analyzing genomes starting from raw sequencing data. The course will focus on human genomics and human medical applications, but the techniques will be broadly applicable across the tree of life. The topics will include genome assembly & comparative genomics, variant identification & analysis, gene expression & regulation, personal genome analysis, and cancer genomics. The grading will be based on assignments, a midterm & final exam, class presentations, and a significant class project. [Applications] Expected course background: familiarity with UNIX scripting and/or programming.
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. Recommended Course Background: AS.110.201 and comfort with mathematical derivations.No Audits.
The goal of this course is to explore machine learning and perception algorithms focused on robotic applications. Topics will include robot localization and mapping, pedestrian/obstacle detection/prediction, semantic segmentation, perception-based grasp planning, continual learning for perception algorithms and multimodal sensor fusion. This course will include introductions to the topics by the instructor followed by paper reading and discussions led by the students. In addition, this course will consist of an in-depth semester long project that will emphasize research skills including developing a hypothesis, conducting literature reviews, formulating the problem, defining, and conducting experiments and finally evaluating and reporting results. Required Course Background: Programming, Linear Algebra, Prob/Stat, Computer Vision and (Machine Learning or ML: Deep Learning).
Prerequisite(s): Students may only earn credit for one of the following: EN.600.336, EN.600.436/EN.601.463, EN.600.663, or EN.600.636/EN.601.763.
Area: Engineering, Natural Sciences
This is a project based course focusing on the design and implementation of systems that scale Natural Language Processing methods beyond English. The course will cover both multilingual and cross-lingual methods with an emphasis on zero-shot and few-shot approaches, as well as ‘silver’ dataset creation. Modules will include Cross-Lingual Information Extraction & Semantics, Cross-Language Information Retrieval, Multilingual Question Answering, Multilingual Structured Prediction, Multilingual Automatic Speech Recognition, as well as other non-English centric NLP methods. Students will be expected to work in small groups and pick from one of the modules to create a model based on state-of-the-art methods covered in the class. The course will be roughly two-thirds lecture based and one-third students presenting project updates periodically throughout the semester.
Prerequisite(s): EN.601.465 OR EN.601.665
Area: Engineering, Natural Sciences
This course explores selected topics in the nature of event representations from the perspective of cognitive science, computer science, linguistics, and philosophy. These fields have developed a rich array of scientific theories about the representation of events, and how humans make inferences about them -- we investigate how (and if) such theories could be applied to current research topics and tasks in computational semantics such as inference from text, automated summarization, veridicality assessment, and so on. In addition to classic articles dealing with formal semantic theories, the course considers available machine-readable corpora, ontologies, and related resources that bear on event structure, such as WordNet, PropBank, FrameNet, etc.. The course is aimed to marry theory with practice: students with either a computational or linguistic background are encouraged to participate. [Applications]
The rise of massive self-supervised (pre-trained) models has transformed various data-driven fields such as natural language processing, computer vision, robotics, and medical imaging. This advanced graduate course aims to provide a holistic view of the issues related to these models: We will start with the history of how we got here, and then delve into the latest success stories. We will then focus on the implications of these technologies: social harms, security risks, legal issues, and environmental impacts. The class ends with reflections on the future implications of this trajectory.Required Course Background: knowledge equivalent to EN.601.675 ML, EN.601.664 AI, EN.601.465 NLP; also linear algebra and statistics.
This course will cover advanced topics on all areas of causal inference, including learning causal effects, path-specific effects, and optimal policies from data featuring biases induced by missing data, confounders, selection, and measurement error, techniques for generalizing findings to different populations, complex probabilistic models relevant for causal inference applications, learning causal structure from data, and inference under interference and network effects. The course will feature a final project which would involve either an applied data analysis problem (with a causal inference flavor), a literature review, or theoretical work. [Analysis] Recommended Course Background: EN.601.447/677.
Prerequisite(s): EN.601.477 OR EN.601.677
This course will focus on recent advances in machine learning. Topics will vary from year to year. The course will be project focused and involve presenting and discussing recent research papers.
In the era of data deluge, the development of methods for discovering structure in high-dimensional data is becoming increasingly important. This course will cover state-of-the-art methods from algebraic geometry, sparse and low-rank representations, and statistical learning for modeling and clustering high-dimensional data. The first part of the course will cover methods for modeling data with a single low-dimensional subspace, such as PCA, Robust PCA, Kernel PCA, and manifold learning techniques. The second part of the course will cover methods for modeling data with multiple subspaces, such as algebraic, statistical, sparse and low-rank subspace clustering techniques. The third part of the course will cover applications of these methods in image processing, computer vision, and biomedical imaging. Requistes include Linear Algebra, Optimization, and prior exposure to Machine I.
This is an advanced course on computer vision from a probabilistic and machine learning perspective. It covers techniques such as linear and non-linear filtering, geometry, energy function methods, markov random fields, conditional random fields, graphical models, probabilistic grammars, and deep neural networks. These are illustrated on a set of vision problems ranging from image segmentation, semantic segmentation, depth estimation, object recognition, object parsing, scene parsing, action recognition, and text captioning. [Analysis orApplications] Required course background: calculus, linear algebra (AS.110.201 or equiv.), probability and statistics (AS.550.311 or equiv.), and the ability to program in Python and C++.
This course teaches advanced machine learning methods for the design, implementation, and deployment of trustworthy AI systems. The topics we will cover include but are not limit to different types of robust learning methods, fair learning methods, safe learning methods, and research frontiers in transparency, interpretability, privacy, sustainability, AI safety and ethics. Students will learn the state-of-the-art methods in lectures, understand the recent advances by critiquing research articles, and apply/innovate new machine learning methods in an application. There will be homework assignments and a course project. Recommended course background: EN.601.475/675.
Area: Engineering
Required for all full-time CS PhD students. Recommended for MSE students.
Permission required. Independent research for masters or pre-dissertation PhD students.
Permission required. Individual study in an area of mutual interest to a graduate student and a faculty member in the department.
PhD students will gain valuable teaching experience, working closely with their assigned faculty supervisor. Successful completion of this course fulfills the PhD teaching requirement.(grad students) Permission req'd.
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.
Independent research for PhD students.
This reading seminar will focus on the question of diversity and inclusion in Computer Science (in particular) and engineering (in general). We aim to study the ways in which the curriculum, environment, and structure of computer science within academia perpetuates biases alienating female and minoritized students, and to explore possible approaches for diversifying our field. The seminar will meet on a weekly basis, readings will be assigned, and students will be expected to participate in the discussion.
In this course, we will read, discuss and present classic papers and current research in computer networks. The topic coverage will vary each semester.
Area: Engineering
This course covers latest advances in the research of computer systems including operating systems, distributed system, mobile and cloud computing. Students will read and discuss recent research papers in top systems conferences. Each week, one student will present the paper and lead the discussion for the week. The focus topics covered in the papers vary semester to semester. Example topics include fault-tolerance, reliability, verification, energy efficiency, and virtualization.
Participants will read and discuss seminal and recent foundational research on cloud and networked systems.
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.
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.
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.Recommended Course Background: EN.601.433 or equivalent.
Area: Engineering
In this course students will read, discuss and present current research papers in applied cryptography. Topic coverage will vary each semester. Instructor approval required.
Immunology studies defensive mechanisms of living organisms against external threats. Computational immunogenomics is a new branch of bioinformatics that develops and applies computational approaches to the study and interpretation of immunological data, seeking to answer questions about human adaptive immune responses to various pathogens, including but not limited to flu, HIV, and SARS-CoV-2. In this course, students will attend lectures and present immunogenomics papers in a journal club format.
This weekly seminar will focus on research issues in medical image analysis, including imagesegmentation, registration, statistical modeling, and applications. It will also include selected topicsrelating to medical image acquisition, especially where they relate to analysis. The purpose of thecourse 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 withinthe 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 En.520.746.
In this course we will review current research in computer graphics. We will meet for an hour once a week and one of the participants will lead the discussion for the week.
This course will provide a background in medical imaging modalities and the unique aspects of image processing as it pertains to medical imaging. We will cover what an image is, how it is formed through six imaging modalities, and how images are typically stored, as well as background topics such as image metrics, quantification, filtering and transforms. More advanced topics will be discussed such as visualization, image enhancement, segmentation and registration. The final few weeks will introduce the topic of neural networks in image processing. Students will be expected to read and discuss publications, as well as complete an implementation project and report. Recommended course background: programming & linear algebra.
This is a weekly reading group focused on Natural Language Processing (NLP) outside of English. Whereas methods have gotten very strong in recent years on English NLP tasks, many methods fail on other languages due to both linguistic differences as well as lack of available annotated resources. This course will focus on Cross-Language Information Retrieval, Cross-Lingual Information Extraction, Multilingual Semantics, Massively Multilingual Language Modeling, and other non-English NLP sub-fields. Students will be expected to read, discuss, and present papers. Required course background: EN.601.465/665.
A reading group exploring important current research in the field and potentially relevant material from related fields. In addition to reading and discussing each week's paper, enrolled students are expected to take turns selecting papers and leading the discussion.
Prerequisite(s): EN.601.465 OR EN.601.665.
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.
Students in this course will review, present, and discuss current research in machine translation. Permission of instructor.