School of Computer Science

Martial Hebert, Dean

Thomas Cortina, Associate Dean for Undergraduate Programs

Veronica Peet, Assistant Dean for Undergraduate Experience

Location: GHC 4115
www.cs.cmu.edu/undergraduate-programs

Carnegie Mellon founded one of the first Computer Science departments in the world in 1965. As research and teaching in computing grew at a tremendous pace at Carnegie Mellon, the university formed the School of Computer Science (SCS) at the end of 1988. Carnegie Mellon was one of the first universities to elevate Computer Science into its own academic college at the same level as the Mellon College of Science and the College of Engineering. Today, SCS consists of seven departments and institutes, including the Computer Science Department that started it all, along with the Ray and Stephanie Lane Computational Biology Department, the Human-Computer Interaction Institute, the Language Technologies Institute, the Machine Learning Department, the Robotics Institute and the Software and Societal Systems Department (formerly the Institute for Software Research). Together, these units make SCS a world leader in research and education. Over the last seven years, SCS has launched four new primary undergraduate majors in Computational Biology, Artificial Intelligence (the first of its kind in the United States), Human-Computer Interaction, and Robotics. These new majors, along with the highly-ranked Computer Science major, give students in SCS distinct paths in the field of computing with ample opportunities in industry and advanced research.

The School of Computer Science offers the following majors and minors:

B.S. in Artificial Intelligence
B.S. in Computational Biology
B.S. in Computer Science
B.S. in Human-Computer Interaction
B.S. in Robotics
Bachelor's in Computer Science and Art (joint with the College of Fine Arts)
Additional major in Artificial Intelligence
Additional major in Computational Biology
Additional major in Computer Science
Additional major in Human-Computer Interaction (Interdisciplinary)
Additional major in Robotics
Minor in Artificial Intelligence
Minor in Computational Biology
Minor in Computer Science
Minor in Human-Computer Interaction
Minor in Information Security, Privacy and Policy
Minor in Language Technologies
Minor in Machine Learning
Minor in Neural Computation
Minor in Robotics
Minor in Software Engineering

Information for these majors and minors can be found through the navigation menu or through the links below:

Artificial Intelligence (B.S. degree, additional major, minor)
Computational Biology (B.S. degree, additional major, minor)
Computer Science (B.S. degree, additional major, minor)
Human-Computer Interaction (B.S. degree, additional interdisciplinary major, minor)
Robotics (B.S. degree, additional major, minor)
SCS additional majors and minors

Students who apply to, and are directly admitted into, the School of Computer Science can choose between five primary majors: Artificial Intelligence, Computational Biology, Computer Science, Human-Computer Interaction and Robotics. Students with artistic and computing interests may be given the option to pursue a major in Computer Science and Art. Suitably prepared students from other Carnegie Mellon colleges are eligible to apply for internal transfer to the School of Computer Science and will be considered for transfer if grades in specific requirements are sufficiently high and space is available. Consult the program websites for specific requirements for transfer requests. Computation-oriented programs are also available within the Mellon College of Science, the Dietrich College of Humanities and Social Sciences, the College of Engineering and the College of Fine Arts.

Policies & Procedures

Academic Standards and Actions

Grading Practices

Grades given to record academic performance in SCS are detailed under Grading Practices at Undergraduate Academic Regulations.

Dean's List WITH HIGH HONORS

SCS recognizes each semester those undergraduates who have earned outstanding academic records by naming them to the Dean's List with High Honors. The criterion for such recognition is a semester quality point average of at least 3.75 while completing a minimum of 36 factorable units and earning no incomplete grades.

Academic Actions

To maintain good academic standing, students from SCS must attain a quality point average (QPA) of at least 2.0 for each semester and a cumulative QPA of 2.0 and maintain adequate progress toward completing their degree requirements. For students with incomplete grade(s), default grade(s) will be used in the QPA calculation. For SCS, adequate progress toward completing degree requirements includes passing foundational courses of 15-112, 15-122, 15-151 (or 21-127 if applicable), 21-120 and 21-122 with grades of C or higher by the end of the sophomore year. A review of a student’s academic record is completed after each Fall and Spring semester.

A student will no longer be in good standing if they meet any of the following criteria:

Their semester QPA is below 2.00.
Their cumulative QPA is below 2.00.
They fail to complete a required foundational CS or math course after two or more attempts with a C or higher. These courses include: 15-112, 15-122, 15-151 (or 21-127), 21-120, 21-122.
They do not complete their required foundational CS and math requirements by the end of the sophomore year.

Students who are not in good standing are first put on Academic Warning for the following semester. After that following semester, if the student is still not in good standing, the student will be put on Academic Suspension. However, a student on Academic Warning who is meeting the semester QPA requirement but is not yet meeting other requirements may be continued on Academic Warning. If the QPA is impacted by an incomplete grade, the action will be reviewed once the final grade is posted, and the action will be rescinded if appropriate.

A student is removed from Academic Warning and returned to good academic standing when both the semester and cumulative quality point averages are at least 2.0, and if adequate progress toward completing degree requirements is being made (i.e. completing foundational courses).

The minimum period of Academic Suspension is one academic year (two non-summer semesters). Academic suspension is meant to allow a student to take a pause from their academic studies to address the issues that are causing poor academic performance. At the end of that period a student may return to campus (on Final Academic Warning) by:

completing a Return from Leave form from the HUB and submitting this form to their academic advisor, and
submitting an additional written statement to their academic advisor and the SCS Associate Dean for Undergraduate Programs, minimum one page, that outlines what the student did while on leave to address the issues that led to the suspension and that would indicate future success on return, and
(optional) submitting up to two letters of support from individuals supporting the student's return to the academic advisor and the SCS Associate Dean for Undergraduate Programs.

Upon review by the student's academic advisor and the Associate Dean for Undergraduate Programs, in consultation with the Office of Student Affairs and the Office of International Education as appropriate, the student may be approved to continue their studies.

SCS students who return from Academic Suspension will be placed on Final Academic Warning for up to 2 semesters to allow them to return to good academic standing or transfer to another major that is more suitable to their interests and abilities. Students who return to good standing after a return from suspension will be removed from Final Academic Warning. Students who return to good standing after suspension but then do not meet one or more conditions as outlined above will return to Final Academic Warning.

Students who fail to return to good academic standing after two semesters on Final Academic Warning will be dropped from the School of Computer Science. Students who have been dropped and are not admitted to another program at the university are required to absent themselves from the campus (including residence halls and Greek houses) within a maximum of two days after the action.

Students may appeal an academic warning, suspension or drop decision in writing within 10 business days of notification. Students should consult with their academic advisor before appealing, and should typically only appeal if they believe that an academic action was not correctly determined by the above criteria or if they have substantial additional information which was not available when the academic action was decided and which indicates a timely return to good academic standing. Instructions on the appeal process are given in the warning, suspension or drop letter that is sent to the student.

Leave of Absence and Return from Leave of Absence

SCS undergraduate students may elect to take a leave of absence for a variety of reasons, after consultation with their academic advisor. Students who wish to take a leave of absence must do so by the last day of classes before final exams begin and before final grades are posted (in case this is earlier). Students requesting a leave of absence must complete a form from the HUB and have this signed by their academic advisor and SCS Associate Dean for Undergraduate Programs. Students who take a leave of absence up to the last day to drop classes will have all of their classes dropped. Students who take a leave of absence after the last day to drop classes will be assigned a grade of W (withdrawal) for all of their classes.

Students returning from a leave of absence are required to submit a Return from Leave of Absence form to their academic advisor for approval by the student's academic advisor and the SCS Associate Dean for Undergraduate Programs. In addition, for students taking a leave for academic performance reasons, the student must also supply a letter that explains the reason for the leave, the actions that were performed during the leave to prepare the student for a successful return, and a description of the on-campus resources, if required, that would be used by the student in order to increase the likelihood of success. Students returning from a leave are also encouraged to provide up to two letters of support from people close to the student (e.g. family, friends, clergy, teachers, coaches, others as appropriate). Requests to return are reviewed by the student's academic advisor, the Associate Dean and the Student Affairs liaison to determine eligibility and any resources that need to be put into place to assist the student upon return. Contact the SCS Undergraduate Office (GHC 4115) for more information.

Internal Transfer within SCS

First year students admitted to SCS are considered undeclared during their first year. These students declare their SCS major in the middle of the second semester of their first year of study. SCS students who wish to transfer from one SCS major to another SCS major may do so by applying for transfer by mid-semester break during the semester the transfer is desired (or the end of the summer session for summer transfers). These students should consult with their academic advisor and the program director of the intended major for more information about specific course requirements and academic plans. Internal SCS transfers do not have any grade requirements. Transfers are approved based on demonstrated interest, ability, and available space in the intended major. Consult the website for the individual SCS major for more information about expected courses to take to demonstrate interest and ability. The transfer request form is available on the SCS website.

Transfer into SCS / Dual-Degree

Undergraduate students admitted to colleges at CMU other than SCS and wishing to transfer to SCS or pursue a dual degree in SCS should consult with the Director or Program Coordinator of the desired SCS major during their first year. See the individual program pages for the names of the current directors and program coordinators, along with their contact information.

For the Artificial Intelligence primary major, students must complete 15-122, 15-150, 15-281, 10-315, one of 15-210, 15-213 or 15-251, and one of 36-225, 21-325, 36-218 or 15-259, with an expected overall QPA over these six courses of 3.6 or higher.and an overall QPA of at least 3.0, in order to be considered for transfer or dual degree.
For the Computational Biology primary major, students must complete 21-127 (or equivalent), 15-122, 15-251, 15-351 (or 15-210*), 03-121 and either 02-251 or 02-250 with an expected overall QPA over these six courses of 3.6 or higher and an overall QPA of at least 3.0, in order to be considered for transfer or dual degree. (*Students who take 15-210 will need to also take 15-150; this course is not required for the B.S. in Computational Biology but can count as an elective.)
For the Computer Science primary major, students must complete 21-127 (or equivalent), 15-122, 15-150, 15-210, 15-213, 15-251 with an expected overall QPA over these six courses of 3.6 or higher and an overall QPA of at least 3.0, in order to be considered for transfer or dual degree.
For the Human-Computer Interaction primary major, students must complete 21-127 (or equivalent), 15-122, 15-150, 05-410, one of 15-210 or 15-213, and one of 05-470 or 05-651, with an expected overall QPA over these six courses of 3.6 or higher and an overall QPA of at least 3.0, in order to be considered for transfer or dual degree.
For the Robotics primary major, students must complete 21-127 (or equivalent), 15-122, 15-213, 15-251, one of the following robotics courses: 16-211, 16-299, 16-311 (or Robot Building when launched), and one of 36-225, 21-325, 36-218 or 15-259, with an expected overall QPA over these 6 courses of 3.6 or higher and an overall QPA of at least 3.0, in order to be considered for transfer or dual degree.

Students may apply for transfer by the start of the mid-semester break in the semester when the final course(s) of the six required courses will be completed (or the end of the summer session for summer transfer requests). In the case of course(s) in progress, the mid-semester grades will be used in the QPA calculation. The decision to allow transfer or dual degree will be made by committee based on the student's academic performance (in the specified courses and in their courses overall if necessary), additional involvement in SCS and other computing-related activities, and availability of space in the student's class level. Students should consult the SCS Undergraduate Office for complete information concerning minimum requirements, instructions and deadlines.

External Transfer

A student currently enrolled at another university or college who wishes to transfer to SCS should first apply through the Office of Admission. If the Office of Admission believes the applicant meets admission guidelines, the student's record is sent to SCS for evaluation. Admission is based on seat availability, overall academic performance and course rigor from the student's current institution, ability to complete the rigorous SCS program on time, and the application material including recommendations and reflection essay(s). It is important to note that extremely few external transfers are admitted to the SCS program at Carnegie Mellon University due to space limitations.

Graduation Requirements

A requirement for graduation is the completion of the program specified for a degree with a cumulative quality point average of 2.00 or higher for all courses taken at CMU.
Students must be recommended for a degree by the faculty of SCS.
A candidate for the bachelor's degree must complete at the University a minimum of four semesters of full-time study, or the equivalent of part-time study, comprising at least 180 units of course work.
Students will be required to have met all financial obligations to the university before being awarded a degree.

General Education Requirements

All undergraduate degrees in the School of Computer Science include depth in their particular field of study but also breadth through the general education requirements. General education requirements are part of SCS degrees to give students an opportunity to learn more about the world from scientific and humanistic points of view. These additional skills are useful for graduates since computing is often embedded in domains that are not entirely within the bounds of computing. SCS students will need to use their computing skills to solve problems alongside scientists and engineers, artists, social and cognitive scientists, historians, linguists, economists and business experts, and SCS students will need to communicate effectively and understand the ethical implications of their work. The general education requirements help SCS students gain this broad perspective so they can work well in a wide variety of domains.

Science and Engineering

All candidates for a B.S. degree in the School of Computer Science must complete a minimum of 36 units offered by the Mellon College of Science and/or the College of Engineering (CIT). This includes at least four courses in science and engineering, 9 units or more for each course, where at least one course must have a laboratory component and at least two courses must be from the same department. Consult with your SCS undergraduate advisor for possible use of any mini course for this requirement which needs to be reviewed by your advisor and the SCS Associate Dean for Undergraduate Programs.

For Computational Biology majors, consult the Computational Biology program page for specific science and engineering requirements. The required science and engineering courses for the Computational Biology major also satisfy the General Education requirement for SCS by default. For other SCS majors, consult the lists given below for approved courses.

Non-lab courses that satisfy this requirement are given in the list below. (Consult your academic advisor for additional choices available each semester.)

03-121	Modern Biology	9
or 03-151	Honors Modern Biology
03-125	Evolution	9
03-132	Basic Science to Modern Medicine	9
03-133	Neurobiology of Disease	9
03-135	Structure and Function of the Human Body	9
03-140	Ecology and Environmental Science	9
03-161	Molecules to Mind	9
06-100	Introduction to Chemical Engineering	12
06-223	Chemical Engineering Thermodynamics	12
06-261	Fluid Mechanics	9
09-105	Introduction to Modern Chemistry I	10
09-106	Modern Chemistry II	10
09-217	Organic Chemistry I	9
09-218	Organic Chemistry II	9
09-225	Climate Change: Chemistry, Physics and Planetary Science	9
09-348	Inorganic Chemistry	10
12-100	Exploring CEE: Infrastructure and Environment in a Changing World	12
12-201	Geology	9
12-212	Statics	9
12-231	Solid Mechanics	9
12-351	Environmental Engineering	9
18-095	Getting Started in Electronics: An Experiential Approach	9
18-100	Introduction to Electrical and Computer Engineering	12
18-220	Electronic Devices and Analog Circuits	12
18-240	Structure and Design of Digital Systems	12
24-101	Fundamentals of Mechanical Engineering	12
24-221	Thermodynamics	10
24-231	Fluid Mechanics	10
24-292	Renewable Energy Engineering	9
24-358	Culinary Mechanics	9
24-381	Environmental Systems on a Changing Planet	12
27-215	Thermodynamics of Materials	12
33-114	Physics of Musical Sound	9
33-120	Science and Science Fiction	9
33-121	Physics I for Science Students	12
or 33-141	Physics I for Engineering Students
or 33-151	Matter and Interactions I
33-142	Physics II for Engineering and Physics Students	12
or 33-152	Matter and Interactions II
33-211	Physics III: Modern Essentials	10
33-224	Stars, Galaxies and the Universe	9
33-225	Quantum Physics and Structure of Matter	9
33-226	Physics of Energy	9
42-101	Introduction to Biomedical Engineering (can be paired with a course in Biology 03-xxx for two courses in one department)	12
42-202	Physiology (can be paired with a course in Biology 03-xxx for two courses in one department)	9
85-219	Foundations of Brain and Behavior (can be paired with a course in Biology 03-xxx for two courses in one department)	9

At present, courses meeting the lab requirement include:

02-261	Quantitative Cell and Molecular Biology Laboratory (can be paired with a course in Biology 03-xxx for two courses in one department)	9
02-262	Computation and Biology Integrated Research Lab (can be paired with a course in Biology 03-xxx for two courses in one department)	Var.
03-124	Modern Biology Laboratory	9
09-101	Introduction to Experimental Chemistry (This 3 unit lab together with 09-105 satisfies the lab requirement.)	3
09-221	Laboratory I: Introduction to Chemical Analysis	12
27-100	Engineering the Materials of the Future	12
33-104	Experimental Physics	9
33-228	Electronics I	10
42-203	Biomedical Engineering Laboratory	9
85-310	Research Methods in Cognitive Psychology	9
85-314	Cognitive Neuroscience Research Methods	9

The following MCS and CIT courses cannot be used to satisfy the Science and Engineering requirement (see note below this list for additional exceptions and conditions):

03-511	Computational Molecular Biology and Genomics	9
04-330	Fundamentals of Software Development and Problem Solving	12
06-262	Mathematical Methods of Chemical Engineering	12
09-103	Atoms, Molecules and Chemical Change	9
09-108	The Illusion and Magic of Food	6
09-109	Kitchen Chemistry Sessions	3
09-110	The Design and Making of Skin and Hair Products	3
09-114	Basics of Food Science	3
09-204	Professional Communication Skills in Chemistry	3
09-209	Kitchen Chemistry Sessions	3
09-231	Mathematical Methods for Chemists	9
12-215	Introduction to Professional Writing in CEE	9
12-271	Computation and Data Science for Civil & Environmental Engineering	9
18-090	Twisted Signals: Multimedia Processing for the Arts	10
18-200	ECE Sophomore Seminar	1
18-202	Mathematical Foundations of Electrical Engineering	12
18-213	Introduction to Computer Systems	12
18-330	Introduction to Computer Security	12
18-334	Network Security	12
18-335	Secure Software Systems	12
18-411	Computational Techniques for Data Science and Engineering	12
18-441	Computer Networks	12
18-460	Optimization	12
18-461	Introduction to Machine Learning for Engineers	12
18-462	Principles and Engineering Applications of AI	12
18-465	Advanced Probability & Statistics for Engineers	12
18-482	Telecommunications Technology and Policy for the Internet Age	12
18-487	Introduction to Computer Security	12
18-540	Rapid Prototyping of Computer Systems	12
19-101	Introduction to Engineering and Public Policy	12
19-211	Ethics and Policy Issues in Computing (or 17-200)	9
19-213	The American Railroad: Decline and Renaissance in the Age of Deregulation	6
19-301	Decision Making Methods for Engineers and Scientists	9
19-303	Cryptocurrencies, Blockchains and Applications	9
19-351	Applied Methods for Technology-Policy Analysis	9
19-402	Telecommunications Technology and Policy for the Internet Age	12
19-403	Policies of Wireless Systems	12
19-411	Science and Innovation Leadership for the 21st Century: Firms, Nations, and Tech	9
19-421	Emerging Energy Policies	9
19-425	Sustainable Energy for the Developing World	9
19-433	Data Science for Technology, Innovation and Policy	9
19-534	Usable Privacy and Security	9
19-608	Privacy Policy, Law, and Technology	12
24-281	Introduction to Scientific Computing	2
24-311	Numerical Methods	10
27-410	Computational Techniques in Engineering	12
33-100	Basic Experimental Physics	6
33-115	Physics for Future Presidents	9
33-124	Introduction to Astronomy	9
33-232	Mathematical Methods of Physics	10
42-201	Professional Issues in Biomedical Engineering	3
49-300	Integrated Product Conceptualization	12

All Electrical and Computer Engineering graduate courses [18-6xx, 18-7xx, 18-8xx, 18-9xx] cannot be used for this requirement. Students interested in Engineering & Public Policy (19-xxx) courses that are not excluded above, including special topics courses, must consult with their SCS undergraduate advisor and the SCS Associate Dean for Undergraduate Programs to determine suitability for this requirement. In general, any MCS or CIT courses that are cross-listed with SCS courses or have significant mathematical or computational content cannot be used for this requirement. Students must consult with an SCS undergraduate advisor about any course to be used for the Science and Engineering requirement before registration.

Humanities and Arts

All candidates for a B.S. degree in the School of Computer Science must complete a minimum of 63 units offered by the College of Humanities & Social Sciences and/or the College of Fine Arts as prescribed below. Students pursuing a Bachelor's in Computer Science and Art should consult the general education requirements for that program.

A. Freshman Writing Requirement (9 units)

Complete one of the following writing options for 9 units:
76-101	Interpretation and Argument	9
76-102	Advanced First Year Writing: Special Topics (by invitation only)	9
or two of these three writing minis for 9 units total:
76-106	Writing about Literature, Art and Culture	4.5
76-107	Writing about Data	4.5
76-108	Writing about Public Problems	4.5

B. Breadth Requirement (minimum 27 units: 9 units each)
Complete three courses, one each from Category 1, Category 2, and Category 3. Students may use two minis totaling 9 units or more to satisfy one of the categories, with permission of the Associate Dean for Undergraduate Education, if the minis meet the goals of the desired category. NOTE: Artificial Intelligence majors replace Category 1 with Category 1A: Cognitive Studies which is a subset of Category 1.

Category 1 (for all SCS majors except Artificial Intelligence): Cognition, Choice and Behavior - this requirement explores the process of thinking, decision making, and behavior in the context of the individual.
70-311	Organizational Behavior	9
70-318	Managing Effective Work Teams	9
70-385	Consumer Behavior	9
80-101	Dangerous Ideas in Science and Society	9
80-130	Introduction to Ethics	9
80-150	Nature of Reason	9
80-180	Nature of Language: An Introduction to Linguistics	9
80-221	Philosophy of Social Science	9
80-252	Kant	9
80-270	Problems of Mind and Body: Meaning and Doing	9
80-271	Mind and Body: The Objective and the Subjective	9
80-275	Metaphysics	9
80-330	Ethical Theory	9
85-102	Introduction to Psychology	9
85-104	Psychopathology	9
85-211	Cognitive Psychology	9
85-213	Human Information Processing and Artificial Intelligence	9
85-221	Principles of Child Development	9
85-241	Social Psychology	9
85-251	Personality	9
85-261	Psychopathology	9
85-370	Perception	9
85-408	Visual Cognition	9
85-414	Cognitive Neuropsychology	9
85-421	Language and Thought	9
88-120	Reason, Passion and Cognition	9
88-230	Human Intelligence and Human Stupidity	9
88-231	Thinking in Person vs. Thinking Online	9

Category 1A (for Artificial Intelligence majors): Cognitive Studies - this requirement explores how the brain and the mind work.
85-211	Cognitive Psychology	9
85-213	Human Information Processing and Artificial Intelligence	9
85-370	Perception	9
85-408	Visual Cognition	9
85-421	Language and Thought	9

Category 2 (all SCS majors): Economic, Political and Social Institutions - this requirement explores the processes by which institutions organize individual preferences and actions into collective outcomes.
19-101	Introduction to Engineering and Public Policy	12
36-303	Sampling, Survey and Society	9
66-221	Topics of Law: Introduction to Intellectual Property Law	9
70-332	Business, Society and Ethics	9
73-102	Principles of Microeconomics	9
73-103	Principles of Macroeconomics	9
73-104	Principles of Microeconomics Accelerated	9
76-425	Rhetoric, Science, and the Public Sphere	9
79-101	Making History: How to Think About the Past (and Present)	9
79-189	Democracy and History: Thinking Beyond the Self	9
79-237	Comparative Slavery	9
79-244	Women in American History	9
79-253	Imperialism and Decolonization in South Asia	9
79-275	Introduction to Global Studies	9
79-300	Controversial Topics in the History of American Public Policy	9
79-320	Women, Politics, and Protest	9
79-321	Documenting Human Rights	9
79-331	Body Politics: Women and Health in America	9
79-370	Technology in the United States	9
79-383	The History of Capitalism	9
79-391	Nations and Nationalisms in South Asia	9
79-392	Europe and the Islamic World	9
80-135	Introduction to Political Philosophy	9
80-136	Social Structure, Public Policy & Ethics	9
80-244	Environmental Ethics	9
80-245	Medical Ethics	9
80-324	Philosophy of Economics	9
80-335	Social and Political Philosophy	9
80-334	Social and Political Philosophy	9
80-348	Health, Human Rights, and International Development	9
84-104	Decision Processes in American Political Institutions	9
84-110	The Economics of Politics, Policy, and Technology	9
84-275	Comparative Politics	9
84-322	Nonviolent Conflict and Revolution	9
84-324	The Future of Democracy	9
84-352	Representation and Voting Rights	9
84-362	Diplomacy and Statecraft	9
84-365	The Politics of Fake News and Misinformation	9
84-380	US Grand Strategy	9
84-386	The Privatization of Force	9
84-387	Remote Systems and the Cyber Domain in Conflict	9
84-389	Terrorism and Insurgency	9
84-390	Social Media, Technology, and Conflict	9
84-393	Legislative Decision Making: US Congress	9
84-402	Judicial Politics and Behavior	9
84-405	The Future of Warfare	9
88-281	Topics in Law: 1st Amendment	9
88-284	Topics of Law: The Bill of Rights	9

Category 3 (all SCS majors): Cultural Analysis - this requirement seeks to recognize cultures that have shaped and continue to shape the human experience; courses in this category are usually either broad in place, time, or cultural diversity.
48-240	History of World Architecture, I	9
48-241	History of Modern Architecture	9
57-173	Survey of Western Music History	9
60-105	Cultural History of the Visual Arts	9
60-106	Cultural History of the Visual Arts - the Modern Period	9
62-371	Photography, The First 100 Years, 1839-1939	9
70-342	Managing Across Cultures	9
70-348	Cross-Cultural Business Communications	9
76-221	Books You Should Have Read By Now	9
76-230	Literature & Culture in the 19th Century	9
76-232	Introduction to Black Literature	9
76-239	Introduction to Film Studies	9
76-241	Introduction to Gender Studies	9
76-339	Topics in Film and Media	9
76-386	Language & Culture	9
79-104	Global Histories	9
79-145	Genocide and Weapons of Mass Destruction	9
79-201	Introduction to Anthropology	9
79-202	Flesh and Spirit: Early Modern Europe, 1400-1750	9
79-211	Modern Southeast Asia: Colonialism, Capitalism, and Cultural Exchange	9
79-223	Mexico: From the Aztec Empire to the Drug War	9
79-226	African History: Earliest Times to 1780	9
79-229	The Origins of the Palestinian-Israeli Conflict, 1880-1948	9
79-230	The Arab-Israeli Conflict and Peace Process Through 1948 to Present	9
79-234	Technology and Society	9
79-240	Development of American Culture	9
79-242	African American History: Reconstruction to the Present	9
79-245	Capitalism and Individualism in American Culture	9
79-248	U.S. Constitution & the Presidency	9
79-261	The Last Emperors: Chinese History and Society, 1600-1900	9
79-262	Modern China: From the Birth of Mao ... to Now	9
79-265	Russian History: Game of Thrones	9
79-281	Introduction to Religion	9
79-282	Europe and the World Since 1800	9
79-288	Bananas, Baseball, and Borders: Latin America and the United States	9
79-293	Inward Odyssey	9
79-316	Photography, the First 100 Years, 1839-1939	9
79-329	LGBTQ+ History	9
79-345	Roots of Rock & Roll	9
79-350	Early Christianity	9
79-378	Gender in South Asia	9
79-393	Institutions of the Roman Church	9
79-395	The Arts in Pittsburgh	9
79-396	Music, Art, and Society in 19th and 20th Century Europe and the U.S.	9
79-465	The Arts in Qatar	9
80-100	Introduction to Philosophy	9
80-250	Ancient Philosophy	9
80-251	Modern Philosophy	9
80-253	Continental Philosophy	9
80-254	Analytic Philosophy	9
80-255	Pragmatism: Making Ideas Work	9
80-261	Experience, Reason, and Truth	9
80-276	Philosophy of Religion	9
82-119	Arabic Calligraphy Culture & Skills	9
82-267	Beyond the Mafia and Michelangelo	9
82-273	Introduction to Japanese Language and Culture	9
82-279	Anime - Visual Interplay between Japan and the World	9
82-280	Billingual & Bicultural Experiences in the US	9
82-282	Interpreting Global Texts & Cultures	9
82-283	Language Diversity & Cultural Identity	9
82-286	Of Minorities and Migrants: Exploring Germany from the Margins Germany Today	9
82-293	Russian Cinema: From the Bolshevik Revolution to Putin's Russia	9
82-294	19th Century Russian Masterpieces	9
82-303	French & Francophone Cultures	9
82-304	French & Francophone Sociolinguistics	9
82-313	Topics in Modern Arabic Language, Literature and Culture	9
82-314	Literature of the Arabic-speaking World	9
82-327	The Emergence of the German Speaking World	9
82-333	Introduction to Chinese Language and Culture	9
82-342	Spain: Language and Culture	9
82-343	Latin America Language and Culture	9
82-344	U.S. Latine Cultures	9
82-345	Using Spanish in Social Contexts	9
82-436	Introduction to Classical Chinese	9

C. Humanities and Arts Electives (minimum 27 units)
Complete 3 non-technical courses of at least 9 units each from any of the departments in the Dietrich College of Humanities & Social Sciences or the College of Fine Arts. Some of the courses taught in these units are considered technical courses and may not be used to satisfy this requirement (see Deletions below). Additionally, a select set of courses from Business Administration and from Environmental and Public Policy can also count for this requirement (see Additions below). Students may combine humanities/arts courses with lower units together to form a single course of 9 units or more with advisor approval in consultation with the SCS Associate Dean for Undergraduate Programs. Students are encouraged, but not required, to take courses from different departments to gain additional breadth and to create new opportunities for engagement with the university community.

Deletions

Some courses from the Dietrich College or the College of Fine Arts may not count toward the unconstrained electives in Humanities and Arts in SCS due to the technical (computing and/or mathematical) nature of the courses. Courses from the following departments do not count toward the unconstrained Humanities and Arts electives:

Statistics and Data Science (36), except 36-303 Sampling, Survey and Society
Information Systems (67)
Economics (73), except 73-102 Principles of Microeconomics, 73-103 Principles of Macroeconomics, 73-104 Principles of Microeconomics Accelerated, and 73-369 Islamic Economics.

Additionally, the following courses do NOT count toward the unconstrained Humanities and Arts electives:

51-257	Introduction to Computing for Creative Practices	10
51-327	Design Center: Introduction to Web Design	9
51-328	Design Center: Design for Digital Systems	9
76-388	Coding for Humanists	9
76-481	Introduction to Multimedia Design	12
76-487	Information Architecture & Content Strategy	9
80-210	Logic and Proofs	9
80-211	Logic and Mathematical Inquiry	9
80-212	Arguments and Logical Analysis	9
80-305	Game Theory	9
80-306	Decision Theory	9
80-310	Formal Logic	9
80-311	Undecidability and Incompleteness	9
80-315	Logics for Knowledge and Belief	9
80-316	Logic and AI	9
80-325	Foundations of Causation and Machine Learning	9
80-411	Proof Theory	9
80-413	Category Theory	9
80-419	Interactive Theorem Proving	9
80-514	Categorical Logic	9
80-521	Seminar on Formal Epistemology: Belief and Evidence	Var.
85-219	Foundations of Brain and Behavior	9
85-310	Research Methods in Cognitive Psychology	9
85-314	Cognitive Neuroscience Research Methods	9
85-414	Cognitive Neuropsychology	9
85-426	Learning in Humans and Machines	9
88-251	Empirical Research Methods	9
88-372	Social and Emotional Brain	9

Additions

The following courses outside of Dietrich College and the College of Fine Arts may count toward the unconstrained Humanities and Arts electives:

07-135	Grand Challenge First-Year Seminar: Designing Better Human-AI Futures	9
11-423	ConLanging: Lrng. Ling. & Lang Tech via Constru Artif. Lang.	12
16-161	ROB Seminar: Artificial Intelligence and Humanity	12
16-397	Art, Conflict and Technology	12
17-333	Privacy Policy, Law, and Technology	9
17-562	Law of Computer Technology	9
19-101	Introduction to Engineering and Public Policy	12
19-351	Applied Methods for Technology-Policy Analysis	9
19-402	Telecommunications Technology and Policy for the Internet Age	12
19-403	Policies of Wireless Systems	12
19-411	Science and Innovation Leadership for the 21st Century: Firms, Nations, and Tech	9
21-150	Mathematics and the Arts	9
32-201	Leadership & Management	9
32-402	Leadership and Ethics	9
70-100	Global Business	9
70-311	Organizational Behavior	9
70-318	Managing Effective Work Teams	9
70-321	Negotiation and Conflict Resolution	9
70-332	Business, Society and Ethics	9
70-340	Business Communications	9
70-341	Team Dynamics and Leadership	9
70-342	Managing Across Cultures	9
70-345	Business Presentations	9
70-348	Cross-Cultural Business Communications	9
70-350	Acting for Business	9
70-352	Business Acting	3
70-364	Business Law	6
70-365	International Trade and International Law	9
70-381	Marketing I	9
70-430	International Management	9
70-443	Digital Marketing and Social Media Strategy	9

Honors Research Thesis

Students considering going on to graduate school in Computer Science or related disciplines should take a wide variety of Computer Science and Mathematics courses, as well as consider getting involved in independent research as early as possible. This would be no later than the junior year and can begin even earlier. Students interested in graduate school in computer science or its related areas are strongly encouraged to participate in the SCS Honors Undergraduate Research Thesis program. Additionally, graduate CS courses can be taken with permission of the instructor and in consultation with an academic advisor.

The goal of the SCS Honors Undergraduate Research Thesis Program is to introduce students to the breadth of tasks involved in independent research, including library work, problem formulation, experimentation, analysis, technical writing and public speaking. In particular, students write a short paper summarizing prior results and current progress in their desired area of research, present a public poster session in December of their senior year describing their current progress, present their final results with a poster and an oral presentation in the year-end university-wide Undergraduate Research Symposium (Meeting of the Minds) and submit a written thesis at the end of their senior year. Students work closely with faculty research advisors to plan and carry out their research. The 07-599 SCS Honors Undergraduate Research Thesis typically starts in the fall semester of the senior year, and spans the entire senior year. Students receive a total of 36 units of academic credit for the thesis work, 18 units per semester. Students should prepare their research prospectus (i.e. proposal of work) during the spring semester of their junior year, and students in this program are advised to plan their schedules carefully to ensure there is ample time to perform the required research for the thesis during the senior year.

Students interested in research are urged to consult with their undergraduate advisor and the SCS Associate Dean for Undergraduate Programs no later than the end of their sophomore year in order to plan their workload effectively. Although there is no specific QPA requirement to participate, students are expected to have at least a 3.5 QPA in the core SCS topics relevant to their proposed research to be successful in their work. For those students with no background in research, they may consider using 07-300 Research and Innovation in Computer Science (9 units) as an introduction to the research process in their junior year since this course will introduce students to various research projects going on in the School of Computer Science and important skills that are needed to be an effective researcher. This course leads to a subsequent research practicum, 07-400 Research Practicum in Computer Science (12 units), that allows students to complete a small-scale research study or experiment and present a research poster. Students who use this practicum to start their senior thesis can use the 12 units toward the required 36 units. Students should consult with their academic advisor concerning how the units earned toward the senior thesis can be used toward elective requirements for their major.

Interested juniors should submit a project prospectus of 3-4 pages by the end of their junior year, although submissions over the summer prior to the senior year will also be considered for review. A prospectus must include:

The name of the research advisor (an SCS faculty member)
A short abstract (two paragraphs, max)
A description of the problem to be worked on and its significance
A tactical description of the proposed research plan, including:
- a description of the background reading to be carried out,
- a description of the research contribution,
- a description of the expected results of the research, and
- a reasonably detailed timeline for the thesis work
A bibliography of related work (all references belong here)
The signature of the research advisor, signifying endorsement of the project and willingness to supervise and evaluate it (or an email confirmation from the research advisor)

Students who need help finding potential advisors should get in touch with their academic advisor or the Associate Dean for Undergraduate Programs. Applications to the program are due by the start of the senior year, although submission of applications in the junior year is encouraged.

Students completing an outstanding senior thesis based on the judgement of the SCS Undergraduate Review Committee will earn SCS College Honors and can compete for various SCS research awards given out during commencement.

About Course Numbers:

Each Carnegie Mellon course number begins with a two-digit prefix that designates the department offering the course (i.e., 76-xxx courses are offered by the Department of English). Although each department maintains its own course numbering practices, typically, the first digit after the prefix indicates the class level: xx-1xx courses are freshmen-level, xx-2xx courses are sophomore level, etc. Depending on the department, xx-6xx courses may be either undergraduate senior-level or graduate-level, and xx-7xx courses and higher are graduate-level. Consult the Schedule of Classes each semester for course offerings and for any necessary pre-requisites or co-requisites.

School of Computer Science Courses

Undergraduate students within SCS are encouraged to explore courses college-wide which may be available to them.

SCS Interdisciplinary Courses

07-070 Teaching Techniques for Computer Science: Fall and Spring: 2 units
This course is a broad introduction to teaching techniques and DEI issues in the context of computer science education. It is targeted to first-time undergraduate and graduate SCS TAs, with the goal of providing instruction, hands-on practice, and feedback to TAs to improve their instructional proficiency.

07-090 Artificial Intelligence Practicum: All Semesters: 3 units
This course is for Artificial Intelligence students who wish to have an internship experience as part of their curriculum. Students are required to write a one-page summary statement prior to registration that explains how their internship connects with their AI curriculum, specifically on how it uses material they have learned as well as prepares them for future courses. Near the end of the internship, students will be required to submit a reflection paper that describes the work they did in more detail, including lessons learned about the work experience and how they utilized their AI education to work effectively. International students should consult with the Office of International Education for appropriate paperwork and additional requirements before registration. Units earned count toward the total required units necessary for degree completion; students should speak with an academic advisor for details. This course may be taken at most 3 times for a total of 9 units maximum. Students normally register for this course for use during the summer semester.

07-120 Introduction to Software Construction: Fall and Spring: 6 units
Writing software can be very challenging. While software is often written to solve difficult problems, or implement complex algorithms, there are also challenges in the writing of software itself. In this course, students will learn the software construction skills that will help them throughout their career, both as students, and beyond. Students should expect to learn how to decompose an assignment/problem into subtasks, how to track their progress using milestones, evaluating sub regions of code for correctness, as well as finding and fixing faults in code. Students should expect to participate in a variety of in class activities, as well as work on a project implementing the skills they are learning in class.
Prerequisite: 15-112

07-128 First Year Immigration Course: Fall: 3 units
The First Year Immigration Course is taken by first-semester School of Computer Science students on the Pittsburgh campus. The course is designed to acquaint incoming students with computer science at CMU. Talks range from historical perspectives in the field to descriptions of the cutting edge research being conducted in the School of Computer Science. Enrollment is limited to SCS First Year students ONLY.

07-129 Freshmen Immigration Course: Fall: 3 units
The Freshman Immigration Course is taken by first-semester Computer Science majors on the Doha campus. The course is designed to acquaint incoming majors with computer science at CMU. Talks range from historical perspectives in the field to descriptions of the cutting edge research being conducted in the School of Computer Science. Enrollment is limited to SCS Freshmen ONLY.

07-131 Great Practical Ideas for Computer Scientists: Fall: 2 units
SECTION A IS OPEN TO SCS FIRST YEAR STUDENTS ONLY. Throughout your education as a Computer Scientist at Carnegie Mellon, you will take courses on programming, theoretical ideas, logic, systems, etc. As you progress, you will be expected to pick up the so-called "tools of the trade." This course is intended to help you learn what you need to know in a friendly, low-stress, high-support way. We will discuss UNIX, LaTeX, debugging and many other essential tools. Laptop required. Only undergraduate students will be able to enroll in this course.

07-135 Grand Challenge First-Year Seminar: Designing Better Human-AI Futures: Spring: 9 units
This course will explore the societal impacts of artificial intelligence (AI) based decision-making systems, especially focusing on the societal biases they may enhance or reduce. Students will gain a fundamental understanding of how these systems are designed and work, as well as the role of data in mitigating or enhancing biases. The course is multidisciplinary in nature and brings together social scientists, engineers, data scientists, and designers to tackle the grand challenge of dealing with issues of bias and fairness in Human-AI collaborative systems, ranging from the data that is used to train them, to their human creators that are responsible for deciding how they work and get used. Students will investigate policy, technology and societal elements aimed at reducing and mitigating the impact of AI biases that can negatively impact society, especially its vulnerable members.

07-180 Concepts in Artificial Intelligence: Spring: 5 units
The course will introduce students to the main foundational concepts and techniques used in Artificial Intelligence (AI), including representation, heuristic search, probabilistic reasoning, decision making, and machine learning. Concepts will be grounded in a range of real-world applications in which AI is currently used. Students will be introduced to ethical issues surrounding AI, as well as the potential future of a world in which AI is commonplace. Programming and written assignments will enable students to get a feel for how to implement and use AI techniques.
Prerequisites: 15-112 or 15-122
Course Website: https://canvas.cmu.edu/courses/8266

07-300 Research and Innovation in Computer Science: Fall: 9 units
This Fall course is the first part of a two-course sequence that is designed to help prepare students to invent the future state-of-the-art in the field of computer science. Course topics will include the following: an overview of important things to know about how research and innovation works in the field of computer science; a survey of the current cutting- edge of computer science research, both here at Carnegie Mellon and elsewhere; critical thinking skills when reading research publications that disagree with each other; strategies for coping with open-ended problems; and technical communication skills for computer scientists. Students will also match up with a faculty mentor for a potential Technology Innovation Project (to be performed in the Spring), put together a detailed plan of attack for that project, and start to get up to speed (including background reading, etc.). This course can be used to satisfy the Technical Communications requirement for the CS major.
Prerequisites: 76-101 Min. grade C or 76-102 Min. grade C or (76-106 Min. grade C and 76-107 Min. grade C) or (76-106 Min. grade C and 76-108 Min. grade C) or (76-107 Min. grade C and 76-108 Min. grade C)

07-400 Research Practicum in Computer Science: Spring: 12 units
This Spring course is the second part of a two-course sequence that is designed to help prepare students to invent the future state-of-the-art in the field of computer science. Building directly upon 15-300 (the prerequisite for this course), students will conduct a semester-long independent research project, under the guidance of both the course staff and a faculty project mentor. The course does not meet for lecture or recitations. Instead, the students will spend their time working on their research projects, and will also meet with course staff on a bi-weekly basis to discuss their progress. Students will prepare a written report and a poster presentation at the end of the semester to describe what they have accomplished.
Prerequisites: 07-300 or 15-300

07-590 Independent Study in CS Education (Undergraduate): Fall and Spring
Description: An independent study course to allow motivated students to work on CS education projects under the supervision of a faculty advisor. Includes the development of a pedagogical study, reading of research papers or texts on CS education, or other suitable activities to learn about the teaching of computer science. Presentation of research or study results required. Independent studies are usually one semester in duration and require prior approval from the faculty advisor and the School of Computer Science.

07-599 SCS Honors Undergraduate Research Thesis: Fall and Spring
Available only to students registered in the CS Senior Research Thesis Program.

07-690 Independent Study in CS Education (Masters): Fall and Spring
Description: An independent study course to allow motivated students to work on CS education projects under the supervision of a faculty advisor. Includes the development of a pedagogical study, reading of research papers or texts on CS education, or other suitable activities to learn about the teaching of computer science. Presentation of research or study results required. Independent studies are usually one semester in duration and require prior approval from the faculty advisor and the School of Computer Science.

Computational Biology Courses

02-112 Programming for Scientists: Intermittent: 12 units
Provides a practical introduction to programming for students with little or no prior programming experience who are interested in science. Fundamental scientific algorithms will be introduced, and extensive programming assignments will be based on analytical tasks that might be faced by scientists, such as parsing, simulation, and optimization. Principles of good software engineering will also be stressed. The course will introduce students to the Go programming language, an industry-supported, modern programming language, the syntax of which will be covered in depth. Other assignments will be given in other programming languages such as Python and Java to highlight the commonalities and differences between languages. No prior programming experience is assumed, and no biology background is needed. Analytical skills and mathematical maturity are required.

02-180 Great Ideas in Computational Biology I: Spring: 5 units
This course introduces great ideas that have formed the foundation for the recent transformation of life sciences into a fully-fledged computational discipline. Extracting biological understanding from both large and small data sets now requires the use and design of novel algorithms, developed in the field of computational biology. The course is designed as a gateway exposure to computational biology for first-year undergraduates in the School of Computer Science, although it is open to other computationally minded students who are interested in exploring the field. This course is the first in a two-course sequence, showing students fundamental algorithmic techniques that are used in modern biological investigations. This first course focuses on algorithmic techniques for genomics, or the study of DNA, and it addresses questions like and amp;quot;How do we reconstruct the sequence of a genome? and amp;quot;, How do we compare genes and genomes?, and and amp;quot;How can we build evolutionary trees to infer relationships among many species? and amp;quot; Previous exposure to molecular biology is not required.
Prerequisites: (15-112 or 02-201) and (21-128 or 21-127 or 15-151)

02-181 Great Ideas in Computational Biology IIx: Spring: 5 units
This course introduces great ideas that have formed the foundation for the recent transformation of life sciences into a fully-fledged computational discipline. Extracting biological understanding from both large and small data sets now requires the use and design of novel algorithms, developed in the field of computational biology. This course is the second in a two-course sequence, offering a gateway exposure for students showing fundamental algorithmic techniques that are used in modern biological investigations. It is designed for first-year undergraduates in the School of Computer Science, although it is open to other computationally minded students who are interested in exploring the field. Whereas the first course in the sequence focuses on genomics, this second course largely introduces topics outside of DNA, from proteins, to neural networks, to a study of algorithms that nature has evolved to solve problems. Previous exposure to molecular biology is not required. After completion of the course, students will be well equipped to tackle advanced computational challenges in biology.
Prerequisites: (02-201 or 15-112) and (15-151 or 21-127 or 21-128)

02-201 Programming for Scientists: Fall and Spring: 10 units
Provides a practical introduction to programming for students with little or no prior programming experience who are interested in science. Fundamental scientific algorithms will be introduced, and extensive programming assignments will be based on analytical tasks that might be faced by scientists, such as parsing, simulation, and optimization. Principles of good software engineering will also be stressed. The course will introduce students to the Go programming language, an industry-supported, modern programming language, the syntax of which will be covered in depth. Other assignments will be given in other programming languages such as Python and Java to highlight the commonalities and differences between languages. No prior programming experience is assumed, and no biology background is needed. Analytical skills and mathematical maturity are required. Course not open to CS majors.

02-218 Introduction to Computational Medicine: All Semesters: 3 units
This course is an introduction to computational methods relevant to the diagnosis and treatment of human diseases. It is the microcourse version of 02-518, Computational Medicine. The course begins with an introduction to the field of Medicine, and an overview of the primary clinical tasks associated with Computational Medicine (phenotyping; biomarker discovery; predictive modeling). Next, we provide an introduction to several Machine Learning techniques, and how those techniques can be used to perform the clinical tasks. For the remainder of the course, students will be guided through the analysis of a clinical data set to gain experience with these techniques. No prior experience with Medicine, Machine Learning, or computer programming is required. Students will be graded based on quizzes and one homework.

02-223 Personalized Medicine: Understanding Your Own Genome: Fall: 9 units
Do you want to know how to discover the tendencies hidden in your genome? Since the first draft of a human genome sequence became available at the start of this century, the cost of genome sequencing has decreased dramatically. Personal genome sequencing will likely become a routine part of medical exams for patients for prognostic and diagnostic purposes. Personal genome information will also play an increasing role in lifestyle choices, as people take into account their own genetic tendencies. Commercial services such as 23andMe have already taken first steps in this direction. Computational methods for mining large-scale genome data are being developed to unravel the genetic basis of diseases and assist doctors in clinics. This course introduces students to biological, computational, and ethical issues concerning use of personal genome information in health maintenance, medical practice, biomedical research, and policymaking. We focus on practical issues, using individual genome sequences (such as that of Nobel prize winner James Watson) and other population-level genome data. Without requiring any background in biology or CS, we begin with an overview of topics from genetics, molecular biology, stats, and machine learning relevant to the modern personal genome era. We then cover scientific issues such as how to discover your genetic ancestry and how to learn from genomes about migration and evolution of human populations. We discuss medical aspects such as how to predict whether you will develop diseases such as diabetes based on your own genome, how to discover disease-causing genetic mutations, and how genetic information can be used to recommend clinical treatments.

02-250 Introduction to Computational Biology: Spring: 12 units
This class provides a general introduction to computational tools for biology. The course is divided into two halves. The first half covers computational molecular biology and genomics. It examines important sources of biological data, how they are archived and made available to researchers, and what computational tools are available to use them effectively in research. In the process, it covers basic concepts in statistics, mathematics, and computer science needed to effectively use these resources and understand their results. Specific topics covered include sequence data, searching and alignment, structural data, genome sequencing, genome analysis, genetic variation, gene and protein expression, and biological networks and pathways. The second half covers computational cell biology, including biological modeling and image analysis. It includes homework requiring modification of scripts to perform computational analyses. The modeling component includes computer models of population dynamics, biochemical kinetics, cell pathways, and neuron behavior. The imaging component includes the basics of machine vision, morphological image analysis, image classification and image-derived models. The course is taught under two different numbers. The lectures are the same for both but recitations and examinations are separate. 02-250 is intended primarily for computational biology, computer science, statistics or engineering majors at the undergraduate or graduate level who have had prior experience with computer science or programming. 03-250 is intended primarily for biological sciences or biomedical engineering majors who have had limited prior experience with computer science or programming. Students may not take both 02-250 and 03-250 for credit. Prerequisite: (02-201 or 15-110 or 15-112), or permission of the instructors.
Prerequisites: (02-201 or 15-112 or 15-110) and (03-131 or 03-151 or 03-121)

Course Website: http://www.cbd.cmu.edu/education/undergraduate-courses/introduction-to-computational-biology/

02-251 Great Ideas in Computational Biology: Spring: 12 units
This 12-unit course provides an introduction to many of the great ideas that have formed the foundation for the recent transformation of life sciences into a fully-fledged computational discipline. Extracting biological understanding from both large and small data sets now requires the use and design of novel algorithms, developed in the field of computational biology. This gateway course is intended as a first exposure to computational biology for first-year undergraduates in the School of Computer Science, although it is open to other computationally minded 6students who are interested in exploring the field. Students will learn fundamental algorithmic and machine learning techniques that are used in modern biological investigations, including algorithms to process string, graph, and image data. They will use these techniques to answer questions such as "How do we reconstruct the sequence of a genome?", "How do we infer evolutionary relationships among many species?", and "How can we predict each gene's biological role?" on biological data. Previous exposure to molecular biology is not required, as the instructors will provide introductory materials as needed. After completion of the course, students will be well equipped to tackle advanced computational challenges in biology.
Prerequisites: (15-112 or 02-201) and (21-128 or 15-151 or 21-127)

02-261 Quantitative Cell and Molecular Biology Laboratory: Fall and Spring
This is an introductory laboratory-based course designed to teach basic biological laboratory skills used in exploring the quantitative nature of biological systems and the reasoning required for performing research in computational biology. Over the course of the semester, students will design and perform multiple modern experiments and quantitatively analyze the results of these experiments. During this course students will also have an opportunity to use techniques learned during the course to experimentally answer an open question. Designing the experiments will require students to think critically about the biological context of the experiments as well as the necessary controls to ensure interpretable experimental results. During this course students will gain experience in many aspects of scientific research, including: sequencing DNA, designing and performing PCR for a variety of analyses, maintaining cell cultures, taking brightfield and fluorescent microscopy images, developing methods for automated analysis of cell images, communicating results to peers and colleagues. Course Outline: (1) 3-hour lab per week, (1) 1-hour lecture per week.
Prerequisites: 02-201 or 15-112

02-262 Computation and Biology Integrated Research Lab: All Semesters
Modern biological research is heavily interdisciplinary in nature requiring the use of a diverse set of experimental techniques and computational analysis. This course provides students with a modern research experience while training them to communicate and collaborate in an interdisciplinary setting to better prepare them to join the workforce as members of interdisciplinary teams. This will be accomplished by focusing efforts on a real research problem requiring sophisticated experimentation and computation for success. Class time will include both laboratory research time (wet lab and computational) and activities designed to teach and practice communication methods for interdisciplinary teams. Students are expected to have a strong background in biology or computation and an interest in both. Pre-requisites include either (03-117 or 03-124 or 03-343) or (15-112 or equivalent)

02-317 Algorithms in Nature: Intermittent: 9 units
Computer systems and biological processes often rely on networks of interacting entities to reach joint decisions, coordinate and respond to inputs. There are many similarities in the goals and strategies of biological and computational systems which suggest that each can learn from the other. These include the distributed nature of the networks (in biology molecules, cells, or organisms often operate without central control), the ability to successfully handle failures and attacks on a subset of the nodes, modularity and the ability to reuse certain components or sub-networks in multiple applications and the use of stochasticity in biology and randomized algorithms in computer science. In this course we will start by discussing classic biologically motivated algorithms including neural networks (inspired by the brain), genetic algorithms (sequence evolution), non-negative matrix factorization (signal processing in the brain), and search optimization (ant colony formation). We will then continue to discuss more recent bi-directional studies that have relied on biological processes to solve routing and synchronization problems, discover Maximal Independent Sets (MIS), and design robust and fault tolerant networks. In the second part of the class students will read and present new research in this area. Students will also work in groups on a final project in which they develop and test a new biologically inspired algorithm. No prior biological knowledge required.
Prerequisites: 15-210 and 15-251
Course Website: http://www.algorithmsinnature.org

02-319 Genomics and Epigenetics of the Brain: Fall: 9 units
This course will provide an introduction to genomics, epigenetics, and their application to problems in neuroscience. The rapid advances in single cell sequencing and other genomic technologies are revolutionizing how neuroscience research is conducted, providing tools to study how different cell types in the brain produce behavior and contribute to neurological disorders. Analyzing these powerful new datasets requires a foundation in molecular neuroscience as well as key computational biology techniques. In this course, we will cover the biology of epigenetics, how proteins sitting on DNA orchestrate the regulation of genes. In parallel, programming assignments and a project focusing on the analysis of a primary genomic dataset will teach principles of computational biology and their applications to neuroscience. The course material will also serve to demonstrate important concepts in neuroscience, including the diversity of neural cell types, neural plasticity, the role that epigenetics plays in behavior, and how the brain is influenced by neurological and psychiatric disorders. Although the course focuses on neuroscience, the material is accessible and applicable to a wide range of topics in biology.
Prerequisites: (03-121 or 03-151) and (03-221 or 03-220) and (15-112 or 15-121 or 02-201 or 15-110)

02-331 Modeling Evolution: Spring: 12 units
Some of the most serious public health problems we face today, from drug-resistant bacteria, to cancer, all arise from a fundamental property of living systems and #8212; their ability to evolve. Since Darwin's theory of natural selection was first proposed, we have begun to understand how heritable differences in reproductive success drive the adaptation of living systems. This makes it intuitive and tempting to view evolution from an optimization perspective. However, genetic drift, phenotypic trade-offs, constraints, and changing environments, are among the many factors that may limit the optimizing force of natural selection. This tug-of-war between selection and drift, between the forces that produce variation in a population, and the forces suppressing this variation, make evolutionary processes much more complex to model and understand than previously thought. The aim of this class is to provide an introduction into the theoretical formalism necessary to understand how biological systems are shaped by the forces and constraints driving evolutionary dynamics.
Prerequisites: 15-112 and 21-241 and (15-259 or 36-218 or 21-325 or 36-225)

02-402 Computational Biology Seminar: Fall and Spring: 3 units
This course consists of weekly invited presentations on current computational biology research topics by leading scientists. Attendance is mandatory for a passing grade. You must sign in and attend at least 80% of the seminars. See course website for seminar locations. Some will be at the University of Pittsburgh and some will be at Carnegie Mellon.

02-403 Special Topics: Graph Representation Learning in Biology: Intermittent: 12 units
Biological and cellular systems are often modeled as graphs (networks) of interacting elements. This approach has been highly successful owing to the theory, methodology and algorithms that support analysis and learning on graphs. However, recent advances in deep learning techniques have led to a surge in research on graph representation learning. In particular, these advances have led to new state-of-the-art results in biomedicine and healthcare. This course will provide a synthesis and overview of graph representation learning within systems biology and medicine. We will begin with a discussion of the goals of graph representation learning, as well as key methodological foundations in graph theory and network analysis. We next review traditional methods such as topological descriptors, graph kernels, and spectral graph theory. We then introduce techniques for learning node embeddings, including random-walk based methods and applications to knowledge graphs. We finally provide a technical synthesis and introduction to the highly successful graph neural network formalism as well as recent advancements in deep generative models for graphs.
Prerequisites: (02-250 Min. grade C or 03-250 Min. grade C) and 03-121 Min. grade C

02-414 String Algorithms: Intermittent: 12 units
Provides an in-depth look at modern algorithms used to process string data, particularly those relevant to genomics. The course will cover the design and analysis of efficient algorithms for processing enormous amounts of collections of strings. Topics will include string search; inexact matching; string compression; string data structures such as suffix trees, suffix arrays, and searchable compressed indices; and the Borrows-Wheeler transform. Applications of these techniques in genomics will be presented, including genome assembly, transcript assembly, whole-genome alignment, gene expression quantification, read mapping, and search of large sequence databases.
Prerequisites: 15-127 or 15-151 or 21-128

02-421 Algorithms for Computational Structural Biology: Intermittent: 12 units
Some of the most interesting and difficult challenges in computational biology and bioinformatics arise from the determination, manipulation, or exploitation of molecular structures. This course will survey these challenges and present a variety of computational methods for addressing them. Topics will include: molecular dynamics simulations, computer-aided drug design, and computer-aided protein design. The course is appropriate for both students with backgrounds in computer science and those in the life sciences.

02-425 Computational Methods for Proteogenomics and Metabolomics: Spring: 9 units
Proteomics and metabolomics are the large scale study of proteins and metabolites, respectively. In contrast to genomes, proteomes and metabolomes vary with time and the specific stress or conditions an organism is under. Applications of proteomics and metabolomics include determination of protein and metabolite functions (including in immunology and neurobiology) and discovery of biomarkers for disease. These applications require advanced computational methods to analyze experimental measurements, create models from them, and integrate with information from diverse sources. This course specifically covers computational mass spectrometry, structural proteomics, proteogenomics, metabolomics, genome mining and metagenomics.
Prerequisites: 02-250 or 02-604 or 02-251

02-450 Automation of Scientific Research: Spring: 9 units
Automated scientific instruments are used widely in research and engineering. Robots dramatically increase the reproducibility of scientific experiments, and are often cheaper and faster than humans, but are most often used to execute brute-force sweeps over experimental conditions. The result is that many experiments are "wasted" on conditions where the effect could have been predicted. Thus, there is a need for computational techniques capable of selecting the most informative experiments. This course will introduce students to techniques from Artificial Intelligence and Machine Learning for automatically selecting experiments to accelerate the pace of discovery and to reduce the overall cost of research. Real-world applications from Biology, Bioengineering, and Medicine will be studied. Grading will be based on homeworks and two exams. The course is intended to be self-contained, but students should have a basic knowledge of biology, programming, statistics, and machine learning.
Prerequisites: (10-701 or 10-315) and 15-122

02-499 Independent Study in Computational Biology: Fall and Spring
The student will, under the individual guidance of a faculty member, read and digest process papers or a textbook in an advanced area of computational biology not offered by an existing course at Carnegie Mellon. The student will demonstrate their mastery of the material by a combination of one or more of the following: oral discussions with the faculty member; exercises set by the faculty member accompanying the readings; and a written summary synthesizing the material that the student learned. Permission required.

02-500 Undergraduate Research in Computational Biology: Fall and Spring
This course is for undergraduate students who wish to do supervised research for academic credit with a Computational Biology faculty member. Interested students should first contact the Professor with whom they would like to work. If there is mutual interest, the Professor will direct you to the Academic Programs Coordinator who will enroll you in the course. 02-250 is a suggested pre-requisite.

Course Website: https://forms.gle/S1AJX65btkTxwNCw9

02-510 Computational Genomics: Spring: 12 units
Dramatic advances in experimental technology and computational analysis are fundamentally transforming the basic nature and goal of biological research. The emergence of new frontiers in biology, such as evolutionary genomics and systems biology is demanding new methodologies that can confront quantitative issues of substantial computational and mathematical sophistication. From the computational side this course focuses on modern machine learning methodologies for computational problems in molecular biology and genetics, including probabilistic modeling, inference and learning algorithms, data integration, time series analysis, active learning, etc. This course counts as a CSD Applications elective
Prerequisites: 15-122 Min. grade C and (36-235 or 36-218 or 15-259 or 36-225)

02-512 Computational Methods for Biological Modeling and Simulation: Fall: 9 units
This course covers a variety of computational methods important for modeling and simulation of biological systems. It is intended for graduates and advanced undergraduates with either biological or computational backgrounds who are interested in developing computer models and simulations of biological systems. The course will emphasize practical algorithms and algorithm design methods drawn from various disciplines of computer science and applied mathematics that are useful in biological applications. The general topics covered will be models for optimization problems, simulation and sampling, and parameter tuning. Course work will include problem sets with significant programming components and independent or group final projects.
Prerequisites: (15-259 or 36-225 or 36-235 or 36-219 or 21-325 or 36-218 or 36-217) and (21-240 or 21-242 or 21-241) and (02-201 or 15-110 or 15-112) and 21-121

02-514 String Algorithms: Fall: 12 units
Provides an in-depth look at modern algorithms used to process string data, particularly those relevant to genomics. The course will cover the design and analysis of efficient algorithms for processing enormous collections of strings. Topics will include string search; inexact matching; string compression; string data structures such as suffix trees, suffix arrays, and searchable compressed indices; and the Burrows-Wheeler transform. Applications of these techniques in biology will be presented, including genome assembly, transcript assembly, whole-genome alignment, gene expression quantification, read mapping, and search of large sequence databases. No knowledge of biology is assumed, and the topics covered will be of use in other fields involving large collections of strings. Programming proficiency is required.
Prerequisite: 15-251

02-515 Advanced Topics in Computational Genomics: Spring: 12 units
Research in biology and medicine is undergoing a revolution due to the availability of high-throughput technology for probing various aspects of a cell at a genome-wide scale. The next-generation sequencing technology is allowing researchers to inexpensively generate a large volume of genome sequence data. In combination with various other high-throughput techniques for epigenome, transcriptome, and proteome, we have unprecedented opportunities to answer fundamental questions in cell biology and understand the disease processes with the goal of finding treatments in medicine. The challenge in this new genomic era is to develop computational methods for integrating different data types and extracting complex patterns accurately and efficiently from a large volume of data. This course will discuss computational issues arising from high-throughput techniques recently introduced in biology, and cover very recent developments in computational genomics and population genetics, including genome structural variant discovery, association mapping, epigenome analysis, cancer genomics, and transcriptome analysis. The course material will be drawn from very recent literature. Grading will be based on weekly write-ups for ciritiques of the papers to be discussed in the class, class participation, and a final project. It assumes a basic knowledge of machine learning and computational genomics.

02-518 Computational Medicine: Fall: 12 units
Modern medical research increasingly relies on the analysis of large patient datasets to enhance our understanding of human diseases. This course will focus on the computational problems that arise from studies of human diseases and the translation of research to the bedside to improve human health. The topics to be covered include computational strategies for advancing personalized medicine, pharmacogenomics for predicting individual drug responses, metagenomics for learning the role of the microbiome in human health, mining electronic medical records to identify disease phenotypes, and case studies in complex human diseases such as cancer and asthma. We will discuss how machine learning methodologies such as regression, classification, clustering, semi-supervised learning, probabilistic modeling, and time-series modeling are being used to analyze a variety of datasets collected by clinicians. Class sessions will consist of lectures, discussions of papers from the literature, and guest presentations by clinicians and other domain experts. Grading will be based on homework assignments and a project. 02-250 is a suggested pre-requisite.

Course Website: https://sites.google.com/view/computationalmedicine/

02-530 Cell and Systems Modeling: Fall: 12 units
This course will introduce students to the theory and practice of modeling biological systems from the molecular to the organism level with an emphasis on intracellular processes. Topics covered include kinetic and equilibrium descriptions of biological processes, systematic approaches to model building and parameter estimation, analysis of biochemical circuits modeled as differential equations, modeling the effects of noise using stochastic methods, modeling spatial effects, and modeling at higher levels of abstraction or scale using logical or agent-based approaches. A range of biological models and applications will be considered including gene regulatory networks, cell signaling, and cell cycle regulation. Weekly lab sessions will provide students hands-on experience with methods and models presented in class. Course requirements include regular class participation, bi-weekly homework assignments, a take-home exam, and a final project. The course is designed for graduate and upper-level undergraduate students with a wide variety of backgrounds. The course is intended to be self-contained but students may need to do some additional work to gain fluency in core concepts. Students should have a basic knowledge of calculus, differential equations, and chemistry as well as some previous exposure to molecular biology and biochemistry. Experience with programming and numerical computation is useful but not mandatory. Laboratory exercises will use MATLAB as the primary modeling and computational tool augmented by additional software as needed.
Prerequisites: (33-121 or 03-151 or 03-121) and (03-231 or 03-232) and 21-112 and 09-105

02-540 Bioimage Informatics: Intermittent: 12 units
With the rapid advance of bioimaging techniques and fast accumulation of bioimage data, computational bioimage analysis and modeling are playing an increasingly important role in understanding of complex biological systems. The goals of this course are to provide students with the ability to understand a broad set of practical and cutting-edge computational techniques to extract knowledge from bioimages.
Prerequisites: 02-620 or 10-301 or 10-701 or 10-601 or 10-315

02-601 Programming for Scientists: Fall and Spring: 12 units
Provides a practical introduction to programming for students with little previous programming experience who are interested in science. Fundamental scientific algorithms will be introduced, and extensive programming assignments will be based on analytical tasks that might be faced by scientists, such as parsing, simulation, and optimization. Principles of good software engineering will also be stressed. The course will introduce students to the Go programming language, an industry-supported, modern programming language, the syntax of which will be covered in depth. Other assignments may be given in other programming languages to highlight the commonalities and differences between languages. No biology background is needed. Analytical skills, an understanding of programming basics, and mathematical maturity are required. A preparatory self-paced bootcamp on programming basics is provided to students to complete before beginning the course

02-602 Professional Issues for Computational and Automated Scientists: Fall and Spring: 3 units
This course gives Master's in Computational Biology and Master's in Automated Science students the opportunity to develop the professional skills necessary for a successful career in either academia or industry. This course, required in the first semester of both programs, will include assistance with elevator pitches, interview preparation, resume and cover letter writing, networking, and presentation skills. The course will also include opportunities to connect with computational biology professionals as part of industry outreach. The course will meet once a week and is pass/fail only.

02-604 Fundamentals of Bioinformatics: Spring: 12 units
How do we find potentially harmful mutations in your genome? How can we reconstruct the Tree of Life? How do we compare similar genes from different species? These are just three of the many central questions of modern biology that can only be answered using computational approaches. This 12-unit course will delve into some of the fundamental computational ideas used in biology and let students apply existing resources that are used in practice every day by thousands of biologists. The course offers an opportunity for students who possess an introductory programming background to become more experienced coders within a biological setting. As such, it presents a natural next course for students who have completed 02-601.

02-605 Professional Issues in Automated Science: Spring: 3 units
This course gives MS in Automated Science students an opportunity to develop professional skills necessary for a successful career in computational biology. This course will include assistance with resume writing, interview preparation, presentation skills, and job search techniques. This course will also include opportunities to network with computational biology professionals and academic researchers.

02-613 Algorithms and Advanced Data Structures: Fall and Spring: 12 units
The objective of this course is to study algorithms for general computational problems, with a focus on the principles used to design those algorithms. Efficient data structures will be discussed to support these algorithmic concepts. Topics include: Run time analysis, divide-and-conquer algorithms, dynamic programming algorithms, network flow algorithms, linear and integer programming, large-scale search algorithms and heuristics, efficient data storage and query, and NP-completeness. Although this course may have a few programming assignments, it is primarily not a programming course. Instead, it will focus on the design and analysis of algorithms for general classes of problems. This course is not open to CS graduate students who should consider taking 15-651 instead. 02-250 is a suggested prerequisite for undergraduates.

02-614 String Algorithms: Intermittent: 12 units
Provides an in-depth look at modern algorithms used to process string data, particularly those relevant to genomics. The course will cover the design and analysis of efficient algorithms for processing enormous amounts of collections of strings. Topics will include string search; inexact matching; string compression; string data structures such as suffix trees, suffix arrays, and searchable compressed indices; and the Borrows-Wheeler transform. Applications of these techniques in genomics will be presented, including genome assembly, transcript assembly, whole-genome alignment, gene expression quantification, read mapping, and search of large sequence databases.
Prerequisites: 15-151 or 15-127 or 21-128

02-620 Machine Learning for Scientists: Spring: 12 units
With advances in scientific instruments and high-throughput technology, scientific discoveries are increasingly made from analyzing large-scale data generated from experiments or collected from observational studies. Machine learning methods that have been widely used to extract complex patterns from large speech, text, and image data are now being routinely applied to answer scientific questions in biology, bioengineering, and medicine. This course is intended for graduate students interested in learning machine learning methods for scientific data analysis and modeling. It will cover classification and regression techniques such a logistic regression, random forest regression, Gaussian process regression, decision trees, and support vector machines; unsupervised learning methods such as clustering algorithms, mixture models, and hidden Markov models; probabilistic graphical models and deep learning methods; and learning theories such as PAC learning and VC dimension. The course will focus on applications of these methods in genomics and medicine. Programming skills and basic knowledge of linear algebra, probability, statistics are assumed.
Prerequisite: 02-680

02-651 New Technologies and Future Markets: Fall: 12 units
This course focuses on technological trends and how these trends can help shape or disrupt new and existing markets. Students will learn to identify, analyze, and synthesize emerging trends and perform detailed research on how these trends can influence and create markets. By understand the drivers behind these trends students will be able to identify key market opportunity inflection points in biotechnology as well as the relationship between business processes and information technology (IT). Students will also learn to assess some information technologies and the potential of applying them to solve problems and create commercially viable solutions. The course is designed for the student interested in finding new venture opportunities on the cutting edge of technology and finding and evaluating the opportunities for further development. For MS Biotechnology Innovation and Computation students only.
Prerequisite: 11-695

02-654 Biotechnology Enterprise Development: Fall: 12 units
In this course students learn how to develop a biotech start-up, create a Minimum Viable Product (MVP), business model and strategy for the product. Students will learn about business modeling, customer development, customer validation, proposal, product branding, and marketing for their product. The course will require students to spend most time to validate their start up concept and prototypes with potential customers and adapt to critical feedback and revise their respective value propositions accordingly. Students learn to balance technical product development with customer requirements, business strategy and budget constraints. This course provides real world, hands-on learning on what it is like to start a company. Different business modeling will be covered. By understand customer discovery and validation concepts will aid students to effectively modify their original concepts to meet market demands. Student teams will learn how to revise, improve their prototype by the end of the term. This is a fast paced course in which students are expected to spend most of the time outside of the classroom to interact with potential customers to validate, test, verify, and integrate essentials elements for their start-up business proposal. Up to now, students have been learning some technologies and methods for solving problems in the life science industry and build a prototype for their start-up. However, a new venture proposal is not a collection of isolated bits. It should be thorough validated via customer's inputs and market needs to tell a single story of how the venture will reach its end goals. Final deliverable is creation and presentation of a well explicated, business proposal in addition to a product prototype corresponding to the business proposal.
Prerequisites: 02-651 and 11-695

02-680 Essential Mathematics and Statistics for Scientists: Fall: 9 units
This course rigorously introduces fundamental topics in mathematics and statistics to first-year master's students as preparation for more advanced computational coursework. Topics are sampled from information theory, graph theory, proof techniques, phylogenetics, combinatorics, set theory, linear algebra, neural networks, probability distributions and densities, multivariate probability distributions, maximum likelihood estimation, statistical inference, hypothesis testing, Bayesian inference, and stochastic processes. Students completing this course will obtain a broad skillset of mathematical techniques and statistical inference as well as a deep understanding of mathematical proof. They will have the quantitative foundation to immediately step into an introductory master's level machine learning or automation course. This background will also serve students well in advanced courses that apply concepts in machine learning to scientific datasets, such as 02-710 (Computational Genomics) or 02-750 (Automation of Biological Research). The course grade will be computed as the result of homework assignments, midterm tests, and class participation.

02-699 Independent Study in Computational Biology: Fall and Spring
The student will, under the individual guidance of a faculty member, read and digest process papers or a textbook in an advanced area of computational biology not offered by an existing course at Carnegie Mellon. The student will demonstrate their mastery of the material by a combination of one or more of the following: oral discussions with the faculty member; exercises set by the faculty member accompanying the readings; and a written summary synthesizing the material that the student learned. Permission required.

02-700 M.S. Thesis Research: Fall and Spring
This course is for M.S. students who wish to do supervised research for academic credit with a Computational Biology faculty member. Interested students should first contact the Professor with whom they would like to work. If there is mutual interest, the Professor will direct you to the Academic Programs Coordinator, who will enroll you in the course.

Course Website: https://forms.gle/tDKDs1EujvXAApYK7

02-702 Computational Biology Seminar: Fall and Spring: 3 units
This course consists of weekly invited presentations on current computational biology research topics by leading scientists. Attendance is mandatory for a passing grade. You must sign in and attend at least 80 percent of the seminars. See course website for seminar locations. Some will be at the University of Pittsburgh and some will be at Carnegie Mellon.

Course Website: https://www.compbio.cmu.edu/seminar-series/index.html

02-703 Special Topics: Graph Representation Learning in Biology: Intermittent: 12 units
Biological and cellular systems are often modeled as graphs (networks) of interacting elements. This approach has been highly successful owing to the theory, methodology and algorithms that support analysis and learning on graphs. However, recent advances in deep learning techniques have led to a surge in research on graph representation learning. In particular, these advances have led to new state-of-the-art results in biomedicine and healthcare. This course will provide a synthesis and overview of graph representation learning within systems biology and medicine. We will begin with a discussion of the goals of graph representation learning, as well as key methodological foundations in graph theory and network analysis. We next review traditional methods such as topological descriptors, graph kernels, and spectral graph theory. We then introduce techniques for learning node embeddings, including random-walk based methods and applications to knowledge graphs. We finally provide a technical synthesis and introduction to the highly successful graph neural network formalism as well as recent advancements in deep generative models for graphs.

02-704 Special Topics: Introduction to Statistical Genetics: Intermittent: 12 units
This course will cover quantitative topics in human statistical genetics, including the HapMap project, linkage disequilibrium, population structure and stratification, natural selection, genome-wide association studies, estimating and partitioning heritability, association testing, statistical fine-mapping, disease gene mapping, expression quantitative trait loci, single-cell genomics, and polygenic risk prediction. The course will emphasize hands-on analysis of large empirical data sets, thus requiring prior experience with a general-purpose high-level programming language such as Python. After taking this course, each student will have the experience and skills to develop and apply statistical methods to population genetic data.
Prerequisites: (02-601 or 15-112) and (02-680 or 36-226 or 36-236 or 15-259 or 15-260 or 36-218)

02-710 Computational Genomics: Spring: 12 units
Dramatic advances in experimental technology and computational analysis are fundamentally transforming the basic nature and goal of biological research. The emergence of new frontiers in biology, such as evolutionary genomics and systems biology is demanding new methodologies that can confront quantitative issues of substantial computational and mathematical sophistication. From the computational side this course focuses on modern machine learning methodologies for computational problems in molecular biology and genetics, including probabilistic modeling, inference and learning algorithms, data integration, time series analysis, active learning, etc. This course counts as a CSD Applications elective

02-711 Computational Molecular Biology and Genomics: Spring: 12 units
An advanced introduction to computational molecular biology, using an applied algorithms approach. The first part of the course will cover established algorithmic methods, including pairwise sequence alignment and dynamic programming, multiple sequence alignment, fast database search heuristics, hidden Markov models for molecular motifs and phylogeny reconstruction. The second part of the course will explore emerging computational problems driven by the newest genomic research. Course work includes four to six problem sets, one midterm and final exam.
Prerequisites: (03-121 or 03-151) and 15-122

02-712 Computational Methods for Biological Modeling and Simulation: Fall: 12 units
This course covers a variety of computational methods important for modeling and simulation of biological systems. It is intended for graduates and advanced undergraduates with either biological or computational backgrounds who are interested in developing computer models and simulations of biological systems. The course will emphasize practical algorithms and algorithm design methods drawn from various disciplines of computer science and applied mathematics that are useful in biological applications. The general topics covered will be models for optimization problems, simulation and sampling, and parameter tuning. Course work will include problem sets with significant programming components and independent or group final projects.
Prerequisites: (02-601 or 15-112 or 15-110) and (15-259 or 21-325 or 36-218 or 36-219 or 02-680 or 36-217 or 36-235 or 36-225)

02-714 String Algorithms: Fall: 12 units
Provides an in-depth look at modern algorithms used to process string data, particularly those relevant to genomics. The course will cover the design and analysis of efficient algorithms for processing enormous collections of strings. Topics will include string search; inexact matching; string compression; string data structures such as suffix trees, suffix arrays, and searchable compressed indices; and the Borrows-Wheeler transform. Applications of these techniques in biology will be presented, including genome assembly, transcript assembly, whole-genome alignment, gene expression quantification, read mapping, and search of large sequence databases. No knowledge of biology is assumed, and the topics covered will be of use in other fields involving large collections of strings. Programming proficiency is required.
Prerequisite: 15-251

02-715 Advanced Topics in Computational Genomics: Spring: 12 units
Research in biology and medicine is undergoing a revolution due to the availability of high-throughput technology for probing various aspects of a cell at a genome-wide scale. The next-generation sequencing technology is allowing researchers to inexpensively generate a large volume of genome sequence data. In combination with various other high-throughput techniques for epigenome, transcriptome, and proteome, we have unprecedented opportunities to answer fundamental questions in cell biology and understand the disease processes with the goal of finding treatments in medicine. The challenge in this new genomic era is to develop computational methods for integrating different data types and extracting complex patterns accurately and efficiently from a large volume of data. This course will discuss computational issues arising from high-throughput techniques recently introduced in biology, and cover very recent developments in computational genomics and population genetics, including genome structural variant discovery, association mapping, epigenome analysis, cancer genomics, and transcriptome analysis. The course material will be drawn from very recent literature. Grading will be based on weekly write-ups for ciritiques of the papers to be discussed in the class, class participation, and a final project. It assumes a basic knowledge of machine learning and computational genomics.

02-717 Algorithms in Nature: Fall: 12 units
Computer systems and biological processes often rely on networks of interacting entities to reach joint decisions, coordinate and respond to inputs. There are many similarities in the goals and strategies of biological and computational systems which suggest that each can learn from the other. These include the distributed nature of the networks (in biology molecules, cells, or organisms often operate without central control), the ability to successfully handle failures and attacks on a subset of the nodes, modularity and the ability to reuse certain components or sub-networks in multiple applications and the use of stochasticity in biology and randomized algorithms in computer science. In this course we will start by discussing classic biologically motivated algorithms including neural networks (inspired by the brain), genetic algorithms (sequence evolution), non-negative matrix factorization (signal processing in the brain), and search optimization (ant colony formation). We will then continue to discuss more recent bi-directional studies that have relied on biological processes to solve routing and synchronization problems, discover Maximal Independent Sets (MIS), and design robust and fault tolerant networks. In the second part of the class students will read and present new research in this area. Students will also work in groups on a final project in which they develop and test a new biologically inspired algorithm. See also: www.algorithmsinnature.org no prior biological knowledge required.

02-718 Computational Medicine: Fall: 12 units
Modern medical research increasingly relies on the analysis of large patient datasets to enhance our understanding of human diseases. This course will focus on the computational problems that arise from studies of human diseases and the translation of research to the bedside to improve human health. The topics to be covered include computational strategies for advancing personalized medicine, pharmacogenomics for predicting individual drug responses, metagenomics for learning the role of the microbiome in human health, mining electronic medical records to identify disease phenotypes, and case studies in complex human diseases such as cancer and asthma. We will discuss how machine learning methodologies such as regression, classification, clustering, semi-supervised learning, probabilistic modeling, and time-series modeling are being used to analyze a variety of datasets collected by clinicians. Class sessions will consist of lectures, discussions of papers from the literature, and guest presentations by clinicians and other domain experts. Grading will be based on homework assignments and a project. 02-250 is a suggested pre-requisite.
Prerequisites: 10-315 or (10-701 and 10-601 and 10-401)

Course Website: https://sites.google.com/view/computationalmedicine/

02-719 Genomics and Epigenetics of the Brain: Fall: 12 units
This course will provide an introduction to genomics, epigenetics, and their application to problems in neuroscience. The rapid advances in single cell sequencing and other genomic technologies are revolutionizing how neuroscience research is conducted, providing tools to study how different cell types in the brain produce behavior and contribute to neurological disorders. Analyzing these powerful new datasets requires a foundation in molecular neuroscience as well as key computational biology techniques. In this course, we will cover the biology of epigenetics, how proteins sitting on DNA orchestrate the regulation of genes. In parallel, programming assignments and a project focusing on the analysis of a primary genomic dataset will teach principles of computational biology and their applications to neuroscience. The course material will also serve to demonstrate important concepts in neuroscience, including the diversity of neural cell types, neural plasticity, the role that epigenetics plays in behavior, and how the brain is influenced by neurological and psychiatric disorders. Although the course focuses on neuroscience, the material is accessible and applicable to a wide range of topics in biology.
Prerequisites: (03-121 or 03-151) and 03-220 and (15-110 or 15-121 or 02-201)

02-721 Algorithms for Computational Structural Biology: Intermittent: 12 units
Some of the most interesting and difficult challenges in computational biology and bioinformatics arise from the determination, manipulation, or exploitation of molecular structures. This course will survey these challenges and present a variety of computational methods for addressing them. Topics will include: molecular dynamics simulations, computer-aided drug design, and computer-aided protein design. The course is appropriate for both students with backgrounds in computer science and those in the life sciences.

02-725 Computational Methods for Proteogenomics and Metabolomics: Spring: 12 units
Proteomics and metabolomics are the large scale study of proteins and metabolites, respectively. In contrast to genomes, proteomes and metabolomes vary with time and the specific stress or conditions an organism is under. Applications of proteomics and metabolomics include determination of protein and metabolite functions (including in immunology and neurobiology) and discovery of biomarkers for disease. These applications require advanced computational methods to analyze experimental measurements, create models from them, and integrate with information from diverse sources. This course specifically covers computational mass spectrometry, structural proteomics, proteogenomics, metabolomics, genome mining and metagenomics.
Prerequisites: 02-250 or 02-251 or 02-604

02-730 Cell and Systems Modeling: Fall: 12 units
This course will introduce students to the theory and practice of modeling biological systems from the molecular to the organism level with an emphasis on intracellular processes. Topics covered include kinetic and equilibrium descriptions of biological processes, systematic approaches to model building and parameter estimation, analysis of biochemical circuits modeled as differential equations, modeling the effects of noise using stochastic methods, modeling spatial effects, and modeling at higher levels of abstraction or scale using logical or agent-based approaches. A range of biological models and applications will be considered including gene regulatory networks, cell signaling, and cell cycle regulation. Weekly lab sessions will provide students hands-on experience with methods and models presented in class. Course requirements include regular class participation, bi-weekly homework assignments, a take-home exam, and a final project. The course is designed for graduate and upper-level undergraduate students with a wide variety of backgrounds. The course is intended to be self-contained but students may need to do some additional work to gain fluency in core concepts. Students should have a basic knowledge of calculus, differential equations, and chemistry as well as some previous exposure to molecular biology and biochemistry. Experience with programming and numerical computation is useful but not mandatory. Laboratory exercises will use MATLAB as the primary modeling and computational tool augmented by additional software as needed. *THIS COURSE WILL BE AT PITT
Prerequisites: (33-121 or 03-121 or 03-151) and (03-231 or 03-232) and 21-112 and 09-105
Course Website: https://sites.google.com/site/cellandsystemsmodeling/

02-731 Modeling Evolution: Spring: 12 units
Some of the most serious public health problems we face today, from drug-resistant bacteria, to cancer, all arise from a fundamental property of living systems and #8212; their ability to evolve. Since Darwin's theory of natural selection was first proposed, we have begun to understand how heritable differences in reproductive success drive the adaptation of living systems. This makes it intuitive and tempting to view evolution from an optimization perspective. However, genetic drift, phenotypic trade-offs, constraints, and changing environments, are among the many factors that may limit the optimizing force of natural selection. This tug-of-war between selection and drift, between the forces that produce variation in a population, and the forces suppressing this variation, make evolutionary processes much more complex to model and understand than previously thought. The aim of this class is to provide an introduction into the theoretical formalism necessary to understand how biological systems are shaped by the forces and constraints driving evolutionary dynamics.
Prerequisites: 15-112 and 21-241 and (36-225 or 15-259 or 36-218 or 21-325)

02-740 Bioimage Informatics: Intermittent: 12 units
With the rapid advance of bioimaging techniques and fast accumulation of bioimage data, computational bioimage analysis and modeling are playing an increasingly important role in understanding of complex biological systems. The goals of this course are to provide students with the ability to understand a broad set of practical and cutting-edge computational techniques to extract knowledge from bioimages.

02-750 Automation of Scientific Research: Spring: 12 units
Automated scientific instruments are used widely in research and engineering. Robots dramatically increase the reproducibility of scientific experiments, and are often cheaper and faster than humans, but are most often used to execute brute-force sweeps over experimental conditions. The result is that many experiments are "wasted" on conditions where the effect could have been predicted. Thus, there is a need for computational techniques capable of selecting the most informative experiments. This course will introduce students to techniques from Artificial Intelligence and Machine Learning for automatically selecting experiments to accelerate the pace of discovery and to reduce the overall cost of research. Real-world applications from Biology, Bioengineering, and Medicine will be studied. Grading will be based on homeworks and two exams. The course is intended to be self-contained, but students should have a basic knowledge of biology, programming, statistics, and machine learning.
Prerequisites: 10-601 or 10-701 or 02-620

02-760 Laboratory Methods for Computational Biologists: Fall and Spring: 9 units
Computational biologists frequently focus on analyzing and modeling large amounts of biological data, often from high-throughput assays or diverse sources. It is therefore critical that students training in computational biology be familiar with the paradigms and methods of experimentation and measurement that lead to the production of these data. This one-semester laboratory course gives students a deeper appreciation of the principles and challenges of biological experimentation. Students learn a range of topics, including experimental design, structural biology, next generation sequencing, genomics, proteomics, bioimaging, and high-content screening. Class sessions are primarily devoted to designing and performing experiments in the lab using the above techniques. Students are required to keep a detailed laboratory notebook of their experiments and summarize their resulting data in written abstracts and oral presentations given in class-hosted lab meetings. With an emphasis on the basics of experimentation and broad views of multiple cutting-edge and high-throughput techniques, this course is appropriate for students who have never taken a traditional undergraduate biology lab course, as well as those who have and are looking for introductory training in more advanced approaches. Grading: Letter grade based on class participation, laboratory notebooks, experimental design assignments, and written and oral presentations. 02-250 is a suggested pre-requisite.

02-761 Laboratory Methods for Automated Biology I: Fall: 12 units
In order to rapidly generate reproducible experimental data, many modern biology labs leverage some form of laboratory automation to execute experiments. In the not so distant future, the use of laboratory automation will continue to increase in the biological lab to the point where many labs will be fully automated. Therefore, it is critical for automation scientists to be familiar with the principles, experimental paradigms, and techniques for automating biological experimentation with an eye toward the fully automated laboratory. In this laboratory course, students will learn about various automatable experimental methods, design of experiments, hardware for preparing samples and executing automated experiments, and software for controlling that hardware. These topics will be taught in lectures as well as through laboratory experience using multi-purpose laboratory robotics. During weekly laboratory time, students will complete and integrate parts of two larger projects. The first project will be focused on liquid handling, plate control, plate reading, and remote control of the automated system based on experimental data. The second project will be focused on the design, implementation, and analysis of a high content screening campaign using fluorescence microscopy, image analysis, and tissue culture methods.

02-762 Laboratory Methods for Automated Biology II: Spring: 12 units
This laboratory course provides a continuation and extension of experiences in 02-761. Instruction will consist of lectures and laboratory experience using multi-purpose laboratory robotics. During weekly laboratory time, students will complete and integrate parts of two larger projects. The first project will be focused on the execution of a molecular biology experiment requiring nucleic acid extraction, library preparation for sequencing, and quality control. The second project will be focused on the implementation and execution of automated methods using active learning techniques to direct the learning of a predictive model for a large experimental space (such as learning the effects of many possible drugs on many possible targets). Grading will be based on lab and project completion and quality.
Prerequisite: 02-761

02-764 Automated Science Capstone II: Spring: 12 units
This course consists of small group projects on development, implementation and/or execution of automated science campaigns in collaboration with industry and/or academic partners. This course may only be taken as part of a continuous sequence with 02-763. Enrollment is only open to M.S. in Automated Science students.

Computer Science Courses

15-050 Study Abroad: All Semesters
Students who are interested in studying abroad should first contact the Office of International Education. More information on Study Abroad is available on OIE's Study Abroad page and at the CS Undergraduate Office.

15-090 Computer Science Practicum: All Semesters: 3 units
This course is for Computer Science students who wish to have an internship experience as part of their curriculum. Students are required to write a one-page summary statement prior to registration that explains how their internship connects with their CS curriculum, specifically on how it uses material they have learned as well as prepares them for future courses. Near the end of the internship, students will be required to submit a reflection paper that describes the work they did in more detail, including lessons learned about the work experience and how they utilized their CS education to work effectively. International students should consult with the Office of International Education for appropriate paperwork and additional requirements before registration. Units earned count toward the total required units necessary for degree completion; students should speak with an academic advisor for details. This course may be taken at most 3 times for a total of 9 units maximum. Students normally register for this course for use during the summer semester.

Course Website: https://csd.cs.cmu.edu/course-profiles/15-090-Computer-Science-Practicum

15-104 Introduction to Computing for Creative Practice: Fall: 10 units
An introduction to fundamental computing principles and programming techniques for creative cultural practices, with special consideration to applications in music, design and the visual arts. Intended for students with little to no prior programming experience, the course develops skills and understanding of text-based programming in a procedural style, including idioms of sequencing, selection, iteration, and recursion. Topics include data organization (arrays, files, trees), interfaces and abstraction (modular software design, using sensor data and software libraries), basic algorithms (searching and sorting), and computational principles (randomness, concurrency, complexity). Intended for students participating in IDeATe courses or minors who have not taken 15-112.

Course Website: https://csd.cs.cmu.edu/course-profiles/15-104-Introduction-to-Computing-for-Creative-Practice

15-106 Introduction to Computing for Data Analysis: Spring: 5 units
[Course Pilot] An introductory course in programming for students in statistics-related disciplines using R. Fundamental data types and data structures: booleans, numbers, characters, vectors, matrices, data frames, and lists. Programming constructs: assignment, conditionals, loops, function calls. Processing data: vectorization, "apply" functions, text processing, plotting tools. Additional topics, time permitting: writing functions, using data files, random number generation and simulation. This course is not for credit for SCS majors.

Course Website: http://www.cs.cmu.edu/~mrmiller/15-106/

15-110 Principles of Computing: All Semesters: 10 units
A course in fundamental computing principles for students with minimal or no computing background. Programming constructs: sequencing, selection, iteration, and recursion. Data organization: arrays and lists. Use of abstraction in computing: data representation, computer organization, computer networks, functional decomposition, and application programming interfaces. Use of computational principles in problem-solving: divide and conquer, randomness, and concurrency. Classification of computational problems based on complexity, non-computable functions, and using heuristics to find reasonable solutions to complex problems. Social, ethical and legal issues associated with the development of new computational artifacts will also be discussed.

Course Website: https://www.cs.cmu.edu/~15110/

15-112 Fundamentals of Programming and Computer Science: All Semesters: 12 units
A technical introduction to the fundamentals of programming with an emphasis on producing clear, robust, and reasonably efficient code using top-down design, informal analysis, and effective testing and debugging. Starting from first principles, we will cover a large subset of the Python programming language, including its standard libraries and programming paradigms. We will also target numerous deployment scenarios, including standalone programs, shell scripts, and web-based applications. This course assumes no prior programming experience. Even so, it is a fast-paced and rigorous preparation for 15-122. Students seeking a more gentle introduction to computer science should consider first taking 15-110. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course.

Course Website: https://www.cs.cmu.edu/~112/

15-121 Introduction to Data Structures: Fall: 10 units
A continuation of the process of program design and analysis for students with some prior programming experience (functions, loops, and arrays, not necessarily in Java). The course reinforces object-oriented programming techniques in Java and covers data aggregates, data structures (e.g., linked lists, stacks, queues, trees, and graphs), and an introduction to the analysis of algorithms that operate on those data structures.
Prerequisite: 15-112
Course Website: http://www.cs.cmu.edu/~mjs/121/index.html

15-122 Principles of Imperative Computation: All Semesters: 12 units
For students with a basic understanding of programming (variables, expressions, loops, arrays, functions). Teaches imperative programming and methods for ensuring the correctness of programs. Students will learn the process and concepts needed to go from high-level descriptions of algorithms to correct imperative implementations, with specific application to basic data structures and algorithms. Much of the course will be conducted in a subset of C amenable to verification, with a transition to full C near the end. This course prepares students for 15-213 and 15-210. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course.
Prerequisite: 15-112 Min. grade C

Course Website: http://www.cs.cmu.edu/~15122/home.shtml

15-128 Freshman Immigration Course: Fall: 1 unit
The Freshman Immigration Course is taken by first-semester Computer Science majors on the Pittsburgh campus. The course is designed to acquaint incoming majors with computer science at CMU. Talks range from historical perspectives in the field to descriptions of the cutting edge research being conducted in the School of Computer Science. Enrollment is limited to SCS Freshmen ONLY.

15-129 Freshman Immigration II: Fall: 3 units
This course is ONLY offered at Carnegie Mellon in Qatar. Students and instructors will solve different problems each week by searching the Web and other likely places for answers. The problems will be submitted by other faculty who will grade the quality of the answers. Students will learn strategies and techniques for finding information on the Web more efficiently; learn when to start with a search engine, a subject-oriented directory, or other tools; explore and practice using advanced search syntax for major search engines; experience specialized search engines for images, sound, multimedia, newsgroups, and discussion lists as well as subject-specific search engines; discover valuable resources to help keep you up-to-date in this fast-changing environment.

15-131 Great Practical Ideas for Computer Scientists: Fall: 2 units
THIS COURSE IS OPEN TO CS FRESHMAN ONLY. Throughout your education as a Computer Scientist at Carnegie Mellon, you will take courses on programming, theoretical ideas, logic, systems, etc. As you progress, you will be expected to pick up the so-called "tools of the trade." This course is intended to help you learn what you need to know in a friendly, low-stress, high-support way. We will discuss UNIX, LaTeX, debugging and many other essential tools. Laptop required. (Laptops will be available for those without their own laptops.)

Course Website: https://www.cs.cmu.edu/~15131/f17/

15-150 Principles of Functional Programming: All Semesters: 12 units
An introduction to programming based on a "functional" model of computation. The functional model is a natural generalization of algebra in which programs are formulas that describe the output of a computation in terms of its inputs and #8212;-that is, as a function. But instead of being confined to real- or complex-valued functions, the functional model extends the algebraic view to a very rich class of data types, including not only aggregates built up from other types, but also functions themselves as values. This course is an introduction to programming that is focused on the central concepts of function and type. One major theme is the interplay between inductive types, which are built up incrementally; recursive functions, which compute over inductive types by decomposition; and proof by structural induction, which is used to prove the correctness and time complexity of a recursive function. Another major theme is the role of types in structuring large programs into separate modules, and the integration of imperative programming through the introduction of data types whose values may be altered during computation. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course.
Prerequisites: (21-128 Min. grade C or 15-151 Min. grade C or 21-127 Min. grade C) and 15-112 Min. grade C

Course Website: http://www.cs.cmu.edu/~15150/

15-151 Mathematical Foundations for Computer Science: Fall: 12 units
*CS majors only* This course is offered to incoming Computer Science freshmen and focuses on the fundamental concepts in Mathematics that are of particular interest to Computer Science such as logic, sets,induction, functions, and combinatorics. These topics are used as a context in which students learn to formalize arguments using the methods of mathematical proof. This course uses experimentation and collaboration as ways to gain better understanding of the material. Open to CS freshmen only. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course.
Prerequisite: 21-120
Course Website: https://www.math.cmu.edu/~jmackey/151_128/welcome.html

15-155 The Computational Lens: Spring: 9 units
What is knowable, in principle and in practice? - What does it mean to be intelligent? - Can creativity be automated? - What is the role of randomness in the universe? - How can we achieve provable guarantees of security, privacy, fairness, etc. in various settings? - What does the social network of the world look like? - Do we live in a simulation? Despite their differences, all of these questions are fundamentally about the notion of computation. And all these questions can be put under the following single umbrella: What is computation and how does it shape our understanding of life, science, technology, and society? This course is for anyone interested in these questions and more broadly, anyone interested in the algorithmic lens to tackle hard, foundational problems. Our goal will be to find reliable explanations through modeling and rigorous reasoning. We will discuss great and powerful ideas from the field of theory of computation and see how these ideas shed new light on human reasoning, laws of nature, life, technology, and society.
Prerequisites: 15-112 or 15-110 or 15-104
Course Website: http://computationallens.com

15-181 Demystifying AI: Spring: 9 units
This course will pull back the curtains on artificial intelligence, helping you learn what it is, what it can do, how to use it, how it works, and what can go wrong. This course is designed for students that want to learn about AI and machine learning but don't have the course schedule bandwidth to build up the math and computing background required for full-fledged intro AI and ML courses, such as 15-281 and 10-301. Leveraging high school algebra and basic Python programming skills from 15-110, we'll help you implement key pieces of AI techniques from the nearest neighbor algorithm to simple neural networks. Through in-class activities, weekly recitations, and course assignments, you'll start to learn how to use AI systems, including how to make them "intelligent", what data might be needed, and what can go wrong. Ethical discussions will be woven throughout the course to enable you to think critically about how AI impacts our society.
Prerequisites: 15-112 or 15-110

15-182 Artificial Intelligence for Medicine: Intermittent: 6 units
This course introduces Artificial Intelligence (AI) and its recent applications in medicine for students with no background in computer science. It starts by motivating and defining AI, before folding over to a survey of some of its newest applications to medicine, including diagnosis, prognosis, drug discovery, and recommendations of individualized treatments, to mention just a few. Afterwards, it provides a birds-eye view of some of the major AI techniques, including machine learning, deep neural networks, recommendation systems, ranked retrieval, and probabilistic graphical models. Finally, it concludes with a discussion on some of the concerns related to AI, including ethical issues, job security, society, and healthcare institutions, among others

15-195 Competition Programming I: All Semesters: 5 units
Each year, Carnegie Mellon fields several teams for participation in the ICPC Regional Programming Contest. During many recent years, one of those teams has earned the right to represent Carnegie Mellon at the ICPC World Finals. This course is a vehicle for those who consistently and rigorously train in preparation for the contests to earn course credit for their effort and achievement. Preparation involves the study of algorithms, the practice of programming and debugging, the development of test sets, and the growth of team, communication, and problem solving skills. Neither the course grade nor the number of units earned are dependent on ranking in any contest. Students are not required to earn course credit to participate in practices or to compete in ACM-ICPC events. Students who have not yet taken 15-295 should register for 15-195; only students who have already taken 15-295 should register for 15-295 again.
Prerequisite: 15-122 Min. grade C

15-199 Special Topics: Discovering Logic: Intermittent: 3 units
This course is ONLY offered at Carnegie Mellon in Qatar. This course has the purpose of introducing first-year Computer Science students to elements of formal logic as well as to the historical context in which this discipline developed. As all subsequent courses in the CS curriculum rely on students having mastered basic logical notions and skills, it will test and enhance your preparation, thereby putting you in a better position to succeed in the program. It will also help you understand and appreciate how CS came about since Computer Science grew out of logic. The specific knowledge and skills you will learn in is course include: an enhanced ability to research topics, give presentations and write technical prose, some elementary logic, some historical depth into Computer Science, mathematics and logic itself. This course is open to Computer Science freshmen only.

15-210 Parallel and Sequential Data Structures and Algorithms: Fall and Spring: 12 units
Teaches students about how to design, analyze, and program algorithms and data structures. The course emphasizes parallel algorithms and analysis, and how sequential algorithms can be considered a special case. The course goes into more theoretical content on algorithm analysis than 15-122 and 15-150 while still including a significant programming component and covering a variety of practical applications such as problems in data analysis, graphics, text processing, and the computational sciences. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course. Register for Lecture 1. All students will be waitlisted for Lecture 2 until Lecture 1 is full.
Prerequisites: 15-150 Min. grade C and 15-122 Min. grade C

Course Website: http://www.cs.cmu.edu/~15210/

15-213 Introduction to Computer Systems: All Semesters: 12 units
This course provides a programmer's view of how computer systems execute programs, store information, and communicate. It enables students to become more effective programmers, especially in dealing with issues of performance, portability and robustness. It also serves as a foundation for courses on compilers, networks, operating systems, and computer architecture, where a deeper understanding of systems-level issues is required. Topics covered include: machine-level code and its generation by optimizing compilers, performance evaluation and optimization, computer arithmetic, memory organization and management, networking technology and protocols, and supporting concurrent computation. NOTE FOR GRADUATE STUDENTS: This course is not open to graduate students beginning Spring 2015. Graduate students must register for 15-513 instead.
Prerequisite: 15-122 Min. grade C

Course Website: https://www.cs.cmu.edu/~213/

15-214 Principles of Software Construction: Objects, Design, and Concurrency: Fall and Spring: 12 units
Software engineers today are less likely to design data structures and algorithms from scratch and more likely to build systems from library and framework components. In this course, students engage with concepts related to the construction of software systems at scale, building on their understanding of the basic building blocks of data structures, algorithms, program structures, and computer structures. The course covers technical topics in four areas: (1) concepts of design for complex systems, (2) object oriented programming, (3) static and dynamic analysis for programs, and (4) concurrent and distributed software. Student assignments involve engagement with complex software such as distributed massively multi-player game systems and frameworks for graphical user interaction.
Prerequisites: (15-122 Min. grade C or 15-121 Min. grade C) and (21-127 Min. grade C or 15-151 Min. grade C or 21-128 Min. grade C)

15-217 Logic and Mechanized Reasoning: Fall: 9 units
Symbolic logic is fundamental to computer science, providing a foundation for the theory of programming languages, database theory, AI, knowledge representation, automated reasoning, interactive theorem proving, and formal verification. Formal methods based on logic complement statistical methods and machine learning by providing rules of inference and means of representation with precise semantics. These methods are central to hardware and software verification, and have also been used to solve open problems in mathematics. This course will introduce students to logic on three levels: theory, implementation, and application. It will focus specifically on applications to automated reasoning and interactive theorem proving. We will present the underlying mathematical theory, and students will develop the mathematical skills that are needed to design and reason about logical systems in a rigorous way. We will also show students how to represent logical objects in a functional programming language, Lean, and how to implement fundamental logical algorithms. We will show students how to use contemporary automated reasoning tools, including SAT solvers, SMT solvers, and first-order theorem provers to solve challenging problems. Finally, we will show students how to use Lean as an interactive theorem prover.
Prerequisites: (15-151 Min. grade C or 21-128 Min. grade C or 21-127 Min. grade C) and 15-150 Min. grade C

Course Website: http://www.cs.cmu.edu/~mheule/15217-f21/

15-236 Special Topics: Saving Humanity With Computational Models: Intermittent: 9 units
We live in a complex society and on a complex planet; but we tend to think about the world through simplified models and assumptions. How do we know if our simplified mental models make sense? Computational modeling is an approach to understanding our understanding of the world wherein we write down our mental models as computer code, mix in a bit of real data, and run it to see what we can learn. Models can help us to understand ourselves, the world around us, and how to shape the future. This course will teach the basics of computational modeling through hands-on exercises investigating student-directed topics. We will cover the basics of computational modeling, finding and processing data, visualization, modularity, and interactivity. Students will build a series of models throughout the course, starting with smaller warm-ups and culminating in a final project in which students will work together to create a high-quality model and interactive web-based visualization with the goal of informing public discourse and policymaking. This course is designed for CS sophomores and most "seats" in the course will be reserved for CS sophomores.
Prerequisites: 15-112 Min. grade C and 21-120 Min. grade C

15-237 Special Topic: Cross-Platform Mobile Web Apps: Intermittent: 12 units
An introduction to writing cross-platform mobile web apps. Using a tool chain based on HTML5, CSS3, JavaScript, and a variety of supporting frameworks, we will write apps that are effectively designed both for desktop and mobile browsers, and which can be converted into native apps for Android, iOS, and Windows Phone 7 devices. Additional topics will include designing user interfaces for mobile devices, accessing mobile device API's (such as accelerometer, GPS, compass, or camera), and power management issues. While this course focuses on browser-side technologies, we will briefly explore JavaScript-based server-side technologies (though students should consider 15-437 for extensive treatment of server-side topics). Note that we will not be writing native apps in Objective-C for iOS nor in Java for Android, though we may include some brief exposure to these technologies near the end of the course.
Prerequisite: 15-112 Min. grade C

15-251 Great Ideas in Theoretical Computer Science: Fall and Spring: 12 units
This course is about how to use theoretical ideas to formulate and solve problems in computer science. It integrates mathematical material with general problem solving techniques and computer science applications. Examples are drawn from algorithms, complexity theory, game theory, probability theory, graph theory, automata theory, algebra, cryptography, and combinatorics. Assignments involve both mathematical proofs and programming. NOTE: students must achieve a C or better in order to use this course to satisfy the pre-requisite for any subsequent Computer Science course.
Prerequisites: (15-150 Min. grade C or 15-122 Min. grade C) and (15-151 Min. grade C or 21-127 Min. grade C or 21-128 Min. grade C)

Course Website: http://www.cs.cmu.edu/~15251/

15-259 Probability and Computing: Spring: 12 units
Probability theory is indispensable in computer science today. In areas such as artificial intelligence and computer science theory, probabilistic reasoning and randomization are central. Within networks and systems, probability is used to model uncertainty and queuing latency. This course gives an introduction to probability as it is used in computer science theory and practice, drawing on applications and current research developments as motivation. The course has 3 parts: Part I is an introduction to probability, including discrete and continuous random variables, heavy tails, simulation, Laplace transforms, z-transforms, and applications of generating functions. Part II is an in-depth coverage of concentration inequalities, like the Chernoff bound and SLLN bounds, as well as their use in randomized algorithms. Part III covers Markov chains (both discrete-time and continuous-time) and stochastic processes and their application to queuing systems performance modeling. This is a fast-paced class which will cover more material than the other probability options and will cover it in greater depth.
Prerequisites: 15-251 Min. grade C or 21-228 Min. grade C

15-260 Statistics and Computing: Spring: 3 units
Statistics is essential for a wide range of fields including machine learning, artificial intelligence, bioinformatics, and finance. This mini course presents the fundamental concepts and methods in statistics in six lectures. The course covers key topics in statistical estimation, inference, and prediction. This course is only open to students enrolled in 15-259. Enrollment for 15-260, mini 4, starts around mid semester.
Prerequisites: 21-241 Min. grade C and 21-259 Min. grade C and 15-251 Min. grade C

15-281 Artificial Intelligence: Representation and Problem Solving: Fall and Spring: 12 units
This course is about the theory and practice of Artificial Intelligence. We will study modern techniques for computers to represent task-relevant information and make intelligent (i.e. satisficing or optimal) decisions towards the achievement of goals. The search and problem solving methods are applicable throughout a large range of industrial, civil, medical, financial, robotic, and information systems. We will investigate questions about AI systems such as: how to represent knowledge, how to effectively generate appropriate sequences of actions and how to search among alternatives to find optimal or near-optimal solutions. We will also explore how to deal with uncertainty in the world, how to learn from experience, and how to learn decision rules from data. We expect that by the end of the course students will have a thorough understanding of the algorithmic foundations of AI, how probability and AI are closely interrelated, and how automated agents learn. We also expect students to acquire a strong appreciation of the big-picture aspects of developing fully autonomous intelligent agents. Other lectures will introduce additional aspects of AI, including natural language processing, web-based search engines, industrial applications, autonomous robotics, and economic/game-theoretic decision making.
Prerequisites: 15-122 Min. grade C and (21-240 Min. grade C or 18-202 Min. grade C or 21-241 Min. grade C or 21-254 Min. grade C) and (21-127 Min. grade C or 15-151 Min. grade C or 21-128 Min. grade C)

Course Website: https://www.cs.cmu.edu/~15281/

15-282 Artificial Intelligence for Medicine: Intermittent: 10 units
This course introduces Artificial Intelligence (AI) and its recent applications in medicine for students with only a little background in computer science. It starts by motivating and defining AI, before folding over to a survey of some of its newest applications to medicine, including diagnosis, prognosis, drug discovery, and recommendations of individualized treatments, to mention just a few. Afterwards, it provides a birds-eye view of some of the major AI techniques, including machine learning, deep neural networks, recommendation systems, ranked retrieval, and probabilistic graphical models. Finally, it concludes with a discussion on some of the concerns related to AI, including ethical issues, job security, society, and healthcare institutions, among others. The course comprises a balance of lectures, case studies, live demonstrations of some medical AI applications, problem-solving and amp; programming assignments, and research tasks. The students will be exposed to industry- and research-based perspectives on AI for medicine. In addition, they will learn through a course project the nuances of working with medical data and applying AI models to solve concrete problems in healthcare.
Prerequisite: 15-112 Min. grade C

15-288 Special Topic: Machine Learning in a Nutshell: Fall and Spring: 9 units
THIS COURSE RUNS IN CMU QATAR ONLY. This course is about the application of machine learning (ML) concepts and models to solve challenging real-world problems. The emphasis of the course is on the methodological and practical aspects of designing, implementing, and using ML solutions. Course topics develop around the notion of ML process pipeline, that identifies the multi-staged process of building and deploying an ML solution. An ML pipeline includes: de nition of the problem, objectives, and performance metrics; collection and management of relevant operational data; data wrangling (transforming, cleaning, ltering, scaling); perform feature engineering on the available data in terms of feature selection, feature extraction, feature processing; selection of appropriate ML models based on problem requirements and available data; implementation, application, testing, and evaluation of the selected model(s); deployment of the final ML model. The course tackles all the stages of the ML pipeline, presenting conceptual insights and providing algorithmic and software tools to select and implement effective ways of proceeding and dealing with the challenges of the different stages.
Prerequisite: 15-112 Min. grade C

15-292 History of Computing: Spring: 5 units
This course traces the history of computational devices, pioneers and principles from the early ages through the present. Topics include early computational devices, mechanical computation in the 19th century, events that led to electronic computing advances in the 20th century, the advent of personal computing and the Internet, and the social, legal and ethical impact of modern computational artifacts. This course also includes a history of programming languages, operating systems, processors and computing platforms. Students should have an introductory exposure to programming prior to taking this course.
Prerequisites: (76-108 or 76-106 or 76-101 or 76-102 or 76-107) and (15-112 or 15-122 or 15-150 or 15-110)

15-294 Special Topic: Rapid Prototyping Technologies: Fall and Spring: 5 units
This mini-course introduces students to rapid prototyping technologies with a focus on laser cutting and 3D printing. The course has three components: 1) A survey of rapid prototyping and additive manufacturing technologies, the maker and open source movements, and societal impacts of these technologies; 2) An introduction to the computer science behind these technologies: CAD tools, file formats, slicing algorithms; 3) Hands-on experience with SolidWorks, laser cutting, and 3D printing, culminating in student projects (e.g. artistic creations, functional objects, replicas of famous calculating machines, etc.).
Prerequisites: 15-104 Min. grade C or 15-110 Min. grade C or 15-112 Min. grade C

Course Website: https://www.cs.cmu.edu/afs/cs.cmu.edu/academic/class/15294-f21/

15-295 Competition Programming II: Fall and Spring: 5 units
Each year, Carnegie Mellon fields several teams for participation in the ICPC Regional Programming Contest. During many recent years, one of those teams has earned the right to represent Carnegie Mellon at the ICPC World Finals. This course is a vehicle for those who consistently and rigorously train in preparation for the contests to earn course credit for their effort and achievement. Preparation involves the study of algorithms, the practice of programming and debugging, the development of test sets, and the growth of team, communication, and problem solving skills. Neither the course grade nor the number of units earned are dependent on ranking in any contest. Students are not required to earn course credit to participate in practices or to compete in ACM-ICPC events. Students who have not yet taken 15-295 should register for 15-195; only students who have already taken 15-295 should register for 15-295 again.
Prerequisites: (15-295 Min. grade C or 15-195 Min. grade C) and 15-122 Min. grade C

Course Website: https://contest.cs.cmu.edu/295/

15-300 SEE 07-300 Research and Innovation in Computer Science: Fall: 9 units
This Fall course is the first part of a two-course sequence that is designed to help prepare students to invent the future state-of-the-art in the field of computer science. Course topics will include the following: an overview of important things to know about how research and innovation works in the field of computer science; a survey of the current cutting- edge of computer science research, both here at Carnegie Mellon and elsewhere; critical thinking skills when reading research publications that disagree with each other; strategies for coping with open-ended problems; and technical communication skills for computer scientists. Students will also match up with a faculty mentor for a potential Technology Innovation Project (to be performed in the Spring), put together a detailed plan of attack for that project, and start to get up to speed (including background reading, etc.). This course can be used to satisfy the Technical Communications requirement for the CS major.
Prerequisites: (76-101 Min. grade C and 15-210 Min. grade C and 15-213 Min. grade C) or (15-251 Min. grade C and 15-213 Min. grade C and 76-101 Min. grade C) or (15-251 Min. grade C and 15-210 Min. grade C and 76-101 Min. grade C)

15-311 Logic and Mechanized Reasoning: All Semesters: 9 units
Symbolic logic is fundamental to computer science, providing a foundation for the theory of programming languages, database theory, AI, knowledge representation, automated reasoning, interactive theorem proving, and formal verification. Formal methods based on logic complement statistical methods and machine learning by providing rules of inference and means of representation with precise semantics. These methods are central to hardware and software verification, and have also been used to solve open problems in mathematics. This course will introduce students to logic on three levels: theory, implementation, and application. It will focus specifically on applications to automated reasoning and interactive theorem proving. We will present the underlying mathematical theory, and students will develop the mathematical skills that are needed to design and reason about logical systems in a rigorous way. We will also show students how to represent logical objects in a functional programming language, Lean, and how to implement fundamental logical algorithms. We will show students how to use contemporary automated reasoning tools, including SAT solvers, SMT solvers, and first-order theorem provers to solve challenging problems. Finally, we will show students how to use Lean as an interactive theorem prover.
Prerequisites: (21-128 Min. grade C or 15-151 Min. grade C or 21-127 Min. grade C) and 15-150 Min. grade C

15-312 Foundations of Programming Languages: Fall and Spring: 12 units
This course discusses in depth many of the concepts underlying the design, definition, implementation, and use of modern programming languages. Formal approaches to defining the syntax and semantics are used to describe the fundamental concepts underlying programming languages. A variety of programming paradigms are covered such as imperative, functional, logic, and concurrent programming. In addition to the formal studies, experience with programming in the languages is used to illustrate how different design goals can lead to radically different languages and models of computation.
Prerequisites: 15-150 Min. grade C and (21-228 Min. grade C or 15-251 Min. grade C)

15-313 Foundations of Software Engineering: Fall: 12 units
Students gain exposure to the fundamentals of modern software engineering. This includes both core CS technical knowledge and the means by which this knowledge can be applied in the practical engineering of complex software. Topics related to software artifacts include design models, patterns, coding, static and dynamic analysis, testing and inspection, measurement, and software architecture and frameworks. Topics related to software process include modeling, requirements engineering, process models and evaluation, team development, and supply chain issues including outsourcing and open source. This course has a strong technical focus, and will include both written and programming assignments. Students will get experience with modern software engineering tools.
Prerequisite: 15-214

15-314 Programming Language Semantics: Spring: 12 units
This lecture course introduces the foundational concepts and techniques of programming language semantics. The aim is to demonstrate the utility of a scientific approach, based on mathematics and logic, with applications to program analysis, language design, and compiler correctness. We focus on the most widely applicable frameworks for semantic description: denotational, operational, and axiomatic semantics. We use semantics to analyze program behavior, guide the development of correct programs, prove correctness of a compiler, validate logics for program correctness, and derive general laws of program equivalence. We will discuss imperative and functional languages, sequential and parallel, as time permits.
Prerequisites: 15-150 Min. grade C and 15-251 Min. grade C

15-316 Software Foundations of Security and Privacy: Fall: 9 units
Security and privacy issues in computer systems continue to be a pervasive issue in technology and society. Understanding the security and privacy needs of software, and being able to rigorously demonstrate that those needs are met, is key to eliminating vulnerabilities that cause these issues. Students who take this course will learn the principles needed to make these assurances about software, and some of the key strategies used to make sure that they are correctly implemented in practice. Topics include: policy models and mechanisms for confidentiality, integrity, and availability, language-based techniques for detecting and preventing security threats, mechanisms for enforcing privacy guarantees, and the interaction between software and underlying systems that can give rise to practical security threats. Students will also gain experience applying many of these techniques to write code that is secure by construction.
Prerequisite: 15-213 Min. grade C

Course Website: https://15316-cmu.github.io/2023/index.html

15-317 Constructive Logic: Fall and Spring: 9 units
This multidisciplinary junior-level course is designed to provide a thorough introduction to modern constructive logic, its roots in philosophy, its numerous applications in computer science, and its mathematical properties. Some of the topics to be covered are intuitionistic logic, inductive definitions, functional programming, type theory, realizability, connections between classical and constructive logic, decidable classes.
Prerequisite: 15-150 Min. grade C

Course Website: https://lfcps.org/course/constlog.html

15-319 Cloud Computing: Fall and Spring: 12 units
This course gives students an overview of Cloud Computing, which is the delivery of computing as a service over a network, whereby distributed resources are rented, rather than owned, by an end user as a utility. Students will study its enabling technologies, building blocks, and gain hands-on experience through projects utilizing public cloud infrastructures. Cloud computing services are widely adopted by many organizations across domains. The course will introduce the cloud and cover the topics of data centers, software stack, virtualization, software defined networks and storage, cloud storage, and programming models. We will start by discussing the clouds motivating factors, benefits, challenges, service models, SLAs and security. We will describe several concepts behind data center design and management, which enable the economic and technological benefits of the cloud paradigm. Next, we will study how CPU, memory and I/O resources, network (SDN) and storage (SDS) are virtualized, and the key role of virtualization to enable the cloud. Subsequently, students will study cloud storage concepts like data distribution, durability, consistency and redundancy. We will discuss distributed file systems, NoSQL databases and object storage using HDFS, CephFS, HBASE, MongoDB, Cassandra, DynamoDB, S3, and Swift as case studies. Finally, students will study the MapReduce, Spark and GraphLab programming models. Students will work with Amazon Web Services and Microsoft Azure, to rent and provision compute resources and then program and deploy applications using these resources. Students will develop and evaluate scaling and load balancing solutions, work with cloud storage systems, and develop applications in several programming paradigms. 15619 students must complete an extra team project which entails designing and implementing a cost- and performance-sensitive web-service for querying big data.
Prerequisite: 15-213 Min. grade C

Course Website: https://csd.cs.cmu.edu/course-profiles/15-319-619-Cloud-Computing

15-322 Introduction to Computer Music: Spring: 9 units
Computers are used to synthesize sound, process signals, and compose music. Personal computers have replaced studios full of sound recording and processing equipment, completing a revolution that began with recording and electronics. In this course, students will learn the fundamentals of digital audio, basic sound synthesis algorithms, and techniques for digital audio effects and processing. Students will apply their knowledge in programming assignments using a very high-level programming language for sound synthesis and composition. In a final project, students will demonstrate their mastery of tools and techniques through music composition or by the implementation of a significant sound-processing technique.
Prerequisites: 15-122 Min. grade C or 15-112 Min. grade C

Course Website: https://courses.ideate.cmu.edu/15-322

15-323 Computer Music Systems and Information Processing: Spring: 9 units
This course presents concepts and techniques for representing and manipulating discrete music information, both in real time and off line. Representations of music as explicitly timed event sequences will be introduced, and students will learn how to build efficient run-time systems for event scheduling, tempo control, and interactive processing. The MIDI protocol is used to capture real-time performance information and to generate sound. The course will also cover non-real-time processing of music data, including Markov models, style recognition, computer accompaniment, query-by-humming, and algorithmic composition. This course is independent of, and complementary to 15-322, Introduction to Computer Music, which focuses on sound synthesis and signal processing.
Prerequisite: 15-122 Min. grade C

15-326 Computational Microeconomics: Intermittent: 9 units
Use of computational techniques to operationalize basic concepts from economics. Expressive marketplaces: combinatorial auctions and exchanges, winner determination problem. Game theory: normal and extensive-form games, equilibrium notions, computing equilibria. Mechanism design: auction theory, automated mechanism design.
Prerequisites: (21-128 Min. grade C or 15-151 Min. grade C or 80-210 or 80-211 Min. grade C or 21-127 Min. grade C) and (36-225 or 36-218 or 36-235 or 21-325)

15-327 Monte Carlo Methods and Applications: Fall: 9 units
The Monte Carlo method uses random sampling to solve computational problems that would otherwise be intractable, and enables computers to model complex systems in nature that are otherwise too difficult to simulate. This course provides a first introduction to Monte Carlo methods from complementary theoretical and applied points of view, and will include implementation of practical algorithms. Topics include random number generation, sampling, Markov chains, Monte Carlo integration, stochastic processes, and applications in computational science. Students need a basic background in probability, multivariable calculus, and some coding experience in any language.
Prerequisites: (21-268 Min. grade C or 21-266 Min. grade C or 21-256 Min. grade C or 21-259 Min. grade C or 21-254 Min. grade C or 21-269 Min. grade C) and (36-235 Min. grade C or 18-465 Min. grade C or 36-218 Min. grade C or 21-325 Min. grade C or 15-259 Min. grade C or 36-219 Min. grade C or 36-225 Min. grade C)

Course Website: http://www.cs.cmu.edu/~kmcrane/random/

15-330 Introduction to Computer Security: Fall and Spring: 12 units
Security is becoming one of the core requirements in the design of critical systems. This course will introduce students to the intro-level fundamental knowledge of computer security and applied cryptography. Students will learn the basic concepts in computer security including software vulnerability analysis and defense, networking and wireless security, and applied cryptography. Students will also learn the fundamental methodology for how to design and analyze security critical systems.
Prerequisite: 15-213 Min. grade C

Course Website: https://www.andrew.cmu.edu/course/18-330/

15-346 Computer Architecture: Design and Simulation: Intermittent: 12 units
This course will help students develop an understanding of basic microarchitectural principles and designs. Starting with creating benchmarks and simulators, students will learn the practice of computer architecture design. The emphasis will be on how processors exploit instruction-level parallelism for performance, as well as the supporting technologies such as caches and branch prediction that are required. Several frontiers of current research will be explored in energy efficiency and security threats.
Prerequisite: 15-213 Min. grade C

15-348 Embedded Systems: Spring: 9 units
This course is offered only at Carnegie Mellon's campus in Qatar. This course covers the broad range of foundational skills that apply across all embedded computer system application areas, from thermostats to self-driving vehicles. The emphasis is at the layer where hardware meets software. Topics include microcontroller hardware, assembly language, embedded C programming, analog I/O, timers, code optimization, interrupts, and concurrency. Real world engineering practices, constraints, and example applications are integrated throughout the course. Weekly hands-on hardware and software experiences with an industry-strength automotive embedded controller are coordinated with the lecture content to reinforce core skills.
Prerequisite: 15-122 Min. grade C

15-349 Introduction to Computer and Network Security: Fall: 9 units
This course is ONLY offered at Carnegie Mellon in Qatar. This course is meant to offer Computer Science undergraduate students in their junior or senior year a broad overview of the field of computer security. Students will learn the basic concepts in computer security including software vulnerability analysis and defense, networking and wireless security, applied cryptography, as well as ethical, legal, social and economic facets of security. Students will also learn the fundamental methodology for how to design and analyze security critical systems.
Prerequisite: 15-122

15-351 Algorithms and Advanced Data Structures: Fall and Spring: 12 units
The objective of this course is to study algorithms for general computational problems, with a focus on the principles used to design those algorithms. Efficient data structures will be discussed to support these algorithmic concepts. Topics include: Run time analysis, divide-and-conquer algorithms, dynamic programming algorithms, network flow algorithms, linear and integer programming, large-scale search algorithms and heuristics, efficient data storage and query, and NP-completeness. Although this course may have a few programming assignments, it is primarily not a programming course. Instead, it will focus on the design and analysis of algorithms for general classes of problems. This course is not open to CS graduate students who should consider taking 15-651 instead. THIS COURSE IS NOT OPEN TO COMPUTER SCIENCE MAJORS OR MINORS.
Prerequisites: 15-122 or 15-121
Course Website: https://www.csd.cs.cmu.edu/course-profiles/15-351-Algorithms-and-Advanced-Data-Structures

15-354 Computational Discrete Mathematics: Fall: 12 units
This course is about the computational aspects of some of the standard concepts of discrete mathematics (relations, functions, logic, graphs, algebra, automata), with emphasis on efficient algorithms. We begin with a brief introduction to computability and computational complexity. Other topics include: iteration, orbits and fixed points, order and equivalence relations, propositional logic and satisfiability testing, finite fields and shift register sequences, finite state machines, and cellular automata. Computational support for some of the material is available in the form of a Mathematica package.
Prerequisites: 21-228 Min. grade C or 15-251 Min. grade C

Course Website: http://www.cs.cmu.edu/~cdm/

15-355 Modern Computer Algebra: Spring: 9 units
The goal of this course is to investigate the relationship between algebra and computation. The course is designed to expose students to algorithms used for symbolic computation, as well as to the concepts from modern algebra which are applied to the development of these algorithms. This course provides a hands-on introduction to many of the most important ideas used in symbolic mathematical computation, which involves solving system of polynomial equations (via Groebner bases), analytic integration, and solving linear difference equations. Throughout the course the computer algebra system Mathematica will be used for computation.
Prerequisites: 15-251 Min. grade C or 21-228 Min. grade C

Course Website: http://www.andrew.cmu.edu/course/15-355/

15-356 Introduction to Cryptography: Spring: 12 units
This course is aimed as an introduction to modern cryptography. This course will be a mix of applied and theoretical cryptography. We will cover popular primitives such as: pseudorandom functions, encryption, signatures, zero-knowledge proofs, multi-party computation, and Blockchains. In addition, we will cover the necessary number-theoretic background. We will cover formal definitions of security, as well as constructions based on well established assumptions like factoring. Please see the course webpage for a detailed list of topics.
Prerequisites: 15-251 Min. grade C or 21-228
Course Website: http://www.cs.cmu.edu/~goyal/15356/

15-359 Probability & Computing: Randomized Algs and Markov Chains: Intermittent: 12 units
Probability theory has become indispensable in computer science. In areas such as artificial intelligence and computer science theory, probabilistic methods and ideas based on randomization are central. In other areas such as networks and systems, probability is becoming an increasingly useful framework for handling uncertainty and modeling the patterns of data that occur in complex systems. This course is a follow-up course to 15-259, Probability and Computing. It will cover Chapters 18-27 of the same textbook, "Introduction to Probability for Computing", by Prof. Harchol-Balter. Topics include concentration inequalities, various randomized algorithms including number theoretic routines, Markov chains and their many applications, and queuing theory. The course will assume familiarity with multivariate calculus and linear algebra.
Prerequisites: 21-325 Min. grade C or 15-259 Min. grade C

15-362 Computer Graphics: Fall and Spring: 12 units
This course provides a comprehensive introduction to computer graphics modeling, animation, and rendering. Topics covered include basic image processing, geometric transformations, geometric modeling of curves and surfaces, animation, 3-D viewing, visibility algorithms, shading, and ray tracing.
Prerequisites: (21-240 Min. grade C and 15-122 Min. grade C and 21-122 Min. grade C) or (15-122 Min. grade C and 21-122 Min. grade C and 21-241 Min. grade C) or (15-122 Min. grade C and 21-254 Min. grade C) or (15-122 Min. grade C and 18-202 Min. grade C)

15-365 Experimental Animation: Intermittent: 12 units
This class will explore animation from the student's perspective with a sense of investigation toward both form and content. Topics in the class will include non-linear narrative, visual music, puppet and non-traditional materials, manipulation of motion and performance capture data, immersive environments.
Prerequisite: 15-213 Min. grade C

15-367 Algorithmic Textiles Design: Intermittent: 12 units
Textile artifacts are and #8212; quite literally and #8212; all around us; from clothing to carpets to car seats. These items are often produced by sophisticated, computer-controlled fabrication machinery. In this course we will discuss everywhere code touches textiles fabrication, including design tools, simulators, and machine control languages. Students will work on a series of multi-week, open-ended projects, where they use code to create patterns for modern sewing/embroidery, weaving, and knitting machines; and then fabricate these patterns in the textiles lab. Students in the 800-level version of the course will additionally be required to create a final project that develops a new algorithm, device, or technique in textiles fabrication.

Course Website: http://graphics.cs.cmu.edu/courses/15-869K-s21/

15-369 Special Topics: Perceptual Computing: Intermittent: 9 units
This course is ONLY offered at Carnegie Mellon in Qatar. What can today's computers see, hear, and feel? This project-based course is designed to provide students exposure to the state-of-the-art in machine perception and the algorithms behind them. Student groups will design a perceptual computing project around Intel's Creative Camera or Microsoft's Kinect. Students will learn to use tools in face detection and recognition, hand and finger tracking, and speech recognition, along with algorithms to make decisions based on these input modalities.
Prerequisites: 15-122 and 21-241

15-382 Collective Intelligence: Spring: 9 units
This course is about the study of distributed control and intelligence systems involving a large number of autonomous components that interact with each other, dynamically adapting to their changing environment as a result of mutual interactions. Examples of such components include cars in city traffic, pedestrians moving in crowds, firms competing in a market, ants foraging for food, or mobile robots in a swarm or multi-robot system. Under certain conditions, such systems can produce useful system-level behaviors, display self-organized spatial-temporal patterns, effectively perform computations, information dissemination, and decision-making. Loosely speaking, when this happens we can say that the system is displaying a form of "collective intelligence". Collective intelligence will expose students to relevant mathematical and computational models from following fields and domains: Cellular automata and Random boolean networks, Social choice, Game theory, Distributed consensus, Task allocation, Swarm intelligence, Social networks, Pattern formation, and Self-organizing maps. The course will also help bridge the gap between theory and practice via assignments where students will implement system models and explore their properties in application domains of practical interest.
Prerequisite: 15-122 Min. grade C

15-383 Introduction to Text Processing: Fall: 6 units
Text processing is a mini-course about text basic techniques of processing human language in text format. The course has theoretical and hands-on components. In the theoretical component, the course will discuss challenges in processing human languages, and review the basics of statistics and probability theory and their application to language problems. In the hands-on part, students will learn about Python programming and use it to process large volumes of text using various techniques. The processing will range from simple steps such as tokenization and part-of-speech tagging to full-fledged applications such as statistical machine translation, search and document/topic classification. The course is suited for junior and senior students in CS and IS.
Prerequisites: 15-121 Min. grade C or 15-122 Min. grade C

15-385 Introduction to Computer Vision: Spring: 6 units
An introduction to the science and engineering of computer vision, i.e. the analysis of the patterns in visual images with the view to understanding the objects and processes in the world that generate them. Major topics include image formation and sensing, fourier analysis, edge and contour detection, inference of depth, shape and motion, classification, recognition, tracking, and active vision. The emphasis is on the learning of fundamental mathematical concepts and techniques and applying them to solve real vision problems. The discussion will also include comparison with human and animal vision from psychological and biological perspectives. Students will learn to think mathematically and develop skills in translating ideas and mathematical thoughts into programs to solve real vision problems.
Prerequisites: 15-122 Min. grade C and 21-241

15-386 Neural Computation: Spring: 9 units
Computational neuroscience is an interdisciplinary science that seeks to understand how the brain computes to achieve natural intelligence. It seeks to understand the computational principles and mechanisms of intelligent behaviors and mental abilities and #8212; such as perception, language, motor control, and learning and #8212; by building artificial systems and computational models with the same capabilities. This course explores how neurons encode and process information, adapt and learn, communicate, cooperate, compete and compute at the individual level as well as at the levels of networks and systems. It will introduce basic concepts in computational modeling, information theory, signal processing, system analysis, statistical and probabilistic inference. Concrete examples will be drawn from the visual system and the motor systems, and studied from computational, psychological and biological perspectives. Students will learn to perform computational experiments using Matlab and quantitative studies of neurons and neuronal networks.
Prerequisites: (15-122 Min. grade C or 15-112 Min. grade C) and 21-122

15-387 Computational Perception: Fall and Spring: 9 units
In this course, we will first cover the biological and psychological foundational knowledge of biological perceptual systems, and then apply computational thinking to investigate the principles and mechanisms underlying natural perception. The course will focus on vision this year, but will also touch upon other sensory modalities. You will learn how to reason scientifically and computationally about problems and issues in perception, how to extract the essential computational properties of those abstract ideas, and finally how to convert these into explicit mathematical models and computational algorithms. Topics include perceptual representation and inference, perceptual organization, perceptual constancy, object recognition, learning and scene analysis. Prerequisites: First year college calculus, some basic knowledge of linear algebra and probability and some programming experience are desirable.
Prerequisites: 21-122 and 21-241 and 15-112 Min. grade C

15-388 Practical Data Science: Intermittent: 9 units
Data science is the study and practice of how we can extract insight and knowledge from large amounts of data. This course provides a practical introduction to the "full stack" of data science analysis, including data collection and processing, data visualization and presentation, statistical model building using machine learning, and big data techniques for scaling these methods. Topics covered include: collecting and processing data using relational methods, time series approaches, graph and network models, free text analysis, and spatial geographic methods; analyzing the data using a variety of statistical and machine learning methods include linear and non-linear regression and classification, unsupervised learning and anomaly detection, plus advanced machine learning methods like kernel approaches, boosting, or deep learning; visualizing and presenting data, particularly focusing the case of high-dimensional data; and applying these methods to big data settings, where multiple machines and distributed computation are needed to fully leverage the data.Students will complete weekly programming homework that emphasize practical understanding of the methods described in the course. In addition, students will develop a tutorial on an advanced topic, and will complete a group project that applies these data science techniques to a practical application chosen by the team; these two longer assignments will be done in lieu of a midterm or final.
Prerequisites: 15-122 Min. grade C or 15-112 Min. grade C

Course Website: http://www.datasciencecourse.org

15-390 Entrepreneurship for Computer Science: Fall: 9 units
This course is designed to develop skills related to entrepreneurship and innovation for non-business undergraduate and graduate students in the School of Computer Science. The course assumes no background courses in business and is appropriate for those who are interested in bringing innovations to market either through new companies or existing companies. The course provides an overview of entrepreneurship and innovation, develops an entrepreneurial frame of mind, and provides a framework for learning the rudiments of how to generate ideas. Students come up with or are presented with potential ideas and learn how to develop these ideas into opportunities, and to explore their potential for becoming viable businesses. They learn how to do market research, to develop go-to-market strategies, value propositions and to differentiate their products or services from potential competitors. The focus is on understanding and developing strategies for approaching the key elements of the entrepreneurial process...opportunity, resources and team. The course consists of a balance of lectures, case studies and encounters with entrepreneurs, investors and business professionals. The students are exposed to financial and intellectual property issues, and encounter a real world perspective on entrepreneurship, innovation and leadership. The output of the course is a mini-business plan or venture opportunity screening document that can be developed into a business plan in a subsequent course entitled New Venture Creation or through independent study.
Prerequisite: 15-112 Min. grade C

15-392 Special Topic: Secure Programming: Spring: 9 units
This course provides a detailed explanation of common programming errors in C and C++ and describes how these errors can lead to software systems that are vulnerable to exploitation. The course concentrates on security issues intrinsic to the C and C++ programming languages and associated libraries. It does not emphasize security issues involving interactions with external systems such as databases and web servers, as these are rich topics on their own. Topics to be covered include the secure and insecure use of integers, arrays, strings, dynamic memory, formatted input/output functions, and file I/O.
Prerequisite: 15-213 Min. grade C

Course Website: https://www.securecoding.cert.org/confluence/display/sci/15392+Secure+Programming

15-394 Intermediate Rapid Prototyping: Fall and Spring: 5 units
This course covers additional topics in rapid prototyping beyond the content of 15-294. Example topics include mechanism design, procedural shape generation using Grasshopper, 3D scanning and mesh manipulation, and advanced SolidWorks concepts. The only prerequisite is basic familiarity with SolidWorks, which can be obtained via 15-294, from other CMU courses, or from online tutorials.

Course Website: https://www.cs.cmu.edu/afs/cs.cmu.edu/academic/class/15394-f21/

15-400 SEE 07-400 Research Practicum in Computer Science: Spring: 12 units
This Spring course is the second part of a two-course sequence that is designed to help prepare students to invent the future state-of-the-art in the field of computer science. Building directly upon 15-300 (the prerequisite for this course), students will conduct a semester-long independent research project, under the guidance of both the course staff and a faculty project mentor. The course does not meet for lecture or recitations. Instead, the students will spend their time working on their research projects, and will also meet with course staff on a bi-weekly basis to discuss their progress. Students will prepare a written report and a poster presentation at the end of the semester to describe what they have accomplished.
Prerequisite: 15-300 Min. grade C

15-405 Engineering Distributed Systems: Spring: 9 units
This is a course for students with strong design and implementation skills who are likely to pursue careers as software architects and lead engineers. It may be taken by well-prepared undergraduates with excellent design and implementation skills in low-level systems programing. The course assumes a high level of proficiency in all aspects of operating system design and implementation. This course will help students prepare for leadership roles in creating and evolving the complex, large-scale computer systems that society will increasingly depend on in the future. The course will teach the organizing principles of such systems, identifying a core set of versatile techniques that are applicable across many system layers. Students will acquire the knowledge base, intellectual tools, hands-on skills and modes of thought needed to build well-engineered computer systems that withstand the test of time, growth in scale, and stresses of live use. Topics covered include: caching, prefetching, damage containment, scale reduction, hints, replication, hash-based techniques, and fragmentation reduction. A substantial project component is an integral part of the course. A high level of proficiency in systems programming is expected. If you do not have the 15-410 prerequisite you will need to get approval from the faculty.
Prerequisite: 15-410 Min. grade B

15-410 Operating System Design and Implementation: Fall and Spring: 15 units
Operating System Design and Implementation is a rigorous hands-on introduction to the principles and practice of operating systems. The core experience is writing a small Unix-inspired OS kernel, in C with some x86 assembly language, which runs on a PC hardware simulator (and on actual PC hardware if you wish). Work is done in two-person teams, and "team programming" skills (source control, modularity, documentation) are emphasized. The size and scope of the programming assignments typically result in students significantly developing their design, implementation, and debugging abilities. Core concepts include the process model, virtual memory, threads, synchronization, and deadlock; the course also surveys higher-level OS topics including file systems, interprocess communication, networking, and security. Students, especially graduate students, who have not satisfied the prerequisite at Carnegie Mellon are strongly cautioned - to enter the class you must be able to write a storage allocator in C, use a debugger, understand 2's-complement arithmetic, and translate between C and x86 assembly language. The instructor may require you to complete a skills assessment exercise before the first week of the semester in order to remain registered in the class. Auditing: this course is usually full, and we generally receive many more requests to audit than we can accept. If you wish to audit, please have your advisor contact us before the semester begins to discuss your educational goals.
Prerequisites: 15-411 Min. grade B or 15-418 Min. grade B or 15-440 Min. grade B or 15-441 Min. grade B or 15-445 Min. grade B or 18-447 Min. grade B

Course Website: https://www.csd.cs.cmu.edu/course-profiles/15-410_605-Operating-System-Design-and-Implementation

15-411 Compiler Design: Spring: 15 units
This course covers the design and implementation of compiler and run-time systems for high-level languages, and examines the interaction between language design, compiler design, and run-time organization. Topics covered include syntactic and lexical analysis, handling of user-defined types and type-checking, context analysis, code generation and optimization, and memory management and run-time organization.
Prerequisite: 15-213 Min. grade C

Course Website: https://www.cs.cmu.edu/~janh/courses/411/23/index.html

15-412 Operating System Practicum: Fall
The goal of this class is for students to acquire hands-on experience with operating-system code as it is developed and deployed in the real world. Groups of two to four students will select, build, install, and become familiar with an open-source operating system project; propose a significant extension or upgrade to that project; and develop a production-quality implementation meeting the coding standards of that project. Unless infeasible, the results will be submitted to the project for inclusion in the code base. Variations on this theme are possible at the discretion of the instructor. For example, it may be possible to work within the context of a non-operating-system software infrastructure project (window system, web server, or embedded network device kernel) or to extend a 15-410 student kernel. In some situations students may work alone. Group membership and unit count (9 units versus 12) will be decided by the third week of the semester. Contributing to a real-world project will involve engaging in some mixture of messy, potentially open-ended activities such as: learning a revision control system, writing a short design document, creating and updating a simple project plan, participating in an informal code review, synthesizing scattered information about hardware and software, classifying and/or reading large amounts of code written by various people over a long period of time, etc.
Prerequisite: 15-410

15-413 SEE 17-413 Software Engineering Practicum: Spring: 12 units
CHANGED TO 17-413 STARTING SPRING 2018. This course is a project-based course in which students conduct a semester-long project for a real client in small teams. The project defines real world needs for the client in their company. This is not a lecture-based course; after the first few weeks the course consists primarily of weekly team meetings with the course instructors, with teams making regular presentations on their software development process. Teams will give presentations and deliver documents on topics such as: risk management project planning requirements architecture detailed design quality assurance final product presentations reflections on the experience Evaluation will be based on the in-class presentations, process and project documentation, how well the teams follow software engineering (SE) practices, and the client's satisfaction with the product. Individual grades will be influenced by peer reviews, individual reflection documents, mentor impressions, and presentation performance. Students will leave the course with a firsthand understanding of the software engineering realities that drive SE practices, will have concrete experience with these practices, and will have engaged in active reflection on this experience. They will have teamwork, process, and product skills to support immediate competency in a software engineering organization, along with a deeper understanding that prepares them to evaluate the new processes and techniques they will encounter in the workplace.

15-414 Bug Catching: Automated Program Verification: Spring: 9 units
Many CS and ECE students will be developing software and hardware that must be ultra reliable at some point in their careers. Logical errors in such designs can be costly, even life threatening. There have already been a number of well publicized errors like the Intel Pentium floating point error and the Arian 5 crash. In this course we will study tools for finding and preventing logical errors. Three types of tools will be studied: automated theorem proving, state exploration techniques like model checking and tools based on static program analysis. Although students will learn the theoretical basis for such tools, the emphasis will be on actually using them on real examples. This course can be used to satisfy the Logic and amp; Languages requirement for the Computer Science major.
Prerequisites: 15-122 Min. grade C and 15-251 Min. grade C

Course Website: http://www.cs.cmu.edu/~15414/

15-415 Database Applications: Fall: 12 units
This course covers the fundamental topics for Database Management Systems: Database System Architectural Principles (ACID properties; data abstraction; external, conceptual, and internal schemata; data independence; data definition and data manipulation languages), Data models (entity-relationship and relational data models; data structures, integrity constraints, and operations for each data model; relational query languages: SQL, algebra, calculus), Theory of database design (functional dependencies; normal forms; dependency preservation; information loss), Query Optimization (equivalence of expressions, algebraic manipulation; optimization of selections and joins), Storage Strategies (indices, B-trees, hashing), Query Processing (execution of sort, join, and aggregation operators), and Transaction Processing (recovery and concurrency control).
Prerequisites: 15-210 Min. grade C and 15-213 Min. grade C

Course Website: http://15415.courses.cs.cmu.edu/

15-417 HOT Compilation: Intermittent: 12 units
The course covers the implementation of compilers for higher-order, typed languages such as ML and Haskell, and gives an introduction to type-preserving compilation. Topics covered include type inference, elaboration, CPS conversion, closure conversion, garbage collection, phase splitting, and typed assembly language.
Prerequisites: 15-312 or 15-317
Course Website: https://www.cs.cmu.edu/~crary/hotc/

15-418 Parallel Computer Architecture and Programming: Fall and Spring: 12 units
The fundamental principles and engineering tradeoffs involved in designing modern parallel computers, as well as the programming techniques to effectively utilize these machines. Topics include naming shared data, synchronizing threads, and the latency and bandwidth associated with communication. Case studies on shared-memory, message-passing, data-parallel and dataflow machines will be used to illustrate these techniques and tradeoffs. Programming assignments will be performed on one or more commercial multiprocessors, and there will be a significant course project.
Prerequisite: 15-213 Min. grade C

Course Website: http://15418.courses.cs.cmu.edu

15-421 Information Security and Privacy: Fall: 12 units
As layers upon layers of technology mediate our activities, issues of information security and privacy are becoming increasingly pervasive and complex. This course takes a multi-disciplinary perspective of information security and privacy, looking at technologies as well as business, legal, policy and usability issues. The objective is to prepare students to identify and address critical security and privacy issues involved in the design, development and deployment of robust computer and information systems. Examples used to introduce concepts covered in the class range from enterprise systems to mobile computing, the Internet of Things, social networking and digital currencies. Topics Covered: Information Security and Privacy: the big picture; A gentle introduction to cryptography; Certificates, PKI, Decentralized Trust Management; Authentication; Internet Security protocols; Risk management; Trusted Computing; Systems security; Web attacks; Cybercrime; Understanding the cyber security legal landscape; Information Privacy: Fundamental concepts and amp; legal landscape; Privacy and Big Data; Privacy Enhancing Technologies; Privacy Engineering; Usable Security and Privacy; Electronic payments and digital currencies; Emerging Security and Privacy challenges (e.g. Cloud Security and Privacy, Mobile and IoT Security and Privacy, Social Networking Security and Privacy)
Prerequisites: 76-101 and 15-112
Course Website: http://www.normsadeh.com/isp-content

15-423 Special Topic: Digital Signal Processing for Computer Science: Spring: 12 units
Digital signals comprise a large fraction of the data analyzed by computer scientists. Sound, e.g. speech and music, images, radar and many other signal types that were conventionally considered to be the domain of the Electrical engineer are now also in the domain of computer scientists, who must analyze them, make inferences, and develop machine learning techinques to analyze, classify and reconstruct such data. In this course we will cover the basics of Digital Signal Processing. We will concentrate on the basic mathematical formulations, rather than in-depth implementation details. We will cover the breadth of topics, beginning with the basics of signals and their representations, the theory of sampling, important transform representations, key processing techniques, and spectral estimation.
Prerequisites: (15-122 Min. grade C or 15-112 Min. grade C) and (15-359 or 36-625 or 21-325 or 36-217 or 36-225)

15-424 Logical Foundations of Cyber-Physical Systems: Intermittent: 12 units
Cyber-physical systems (CPSs) combine cyber capabilities (computation and/or communication) with physical capabilities (motion or other physical processes). Cars, aircraft, and robots are prime examples, because they move physically in space in a way that is determined by discrete computerized control algorithms. Designing these algorithms to control CPSs is challenging due to their tight coupling with physical behavior. At the same time, it is vital that these algorithms be correct, since we rely on CPSs for safety-critical tasks like keeping aircraft from colliding. This course pursues the fundamental question: "How can we provide people with cyber-physical systems they can bet their lives on?"
Prerequisites: 15-122 Min. grade C and 21-120 Min. grade C

Course Website: http://lfcps.org/course/lfcps.html

15-435 Foundations of Blockchains: Fall: 12 units
In this course, students will learn the mathematical foundations of blockchains, including how to construct distributed consensus protocols and prove them secure, cryptography for blockchains, and mechanism design for blockchains. This course will take a mathematically rigorous approach. Students are expected to have mathematical maturity and be able to write formal mathematical proofs. Students may also be expected to implement some consensus or cryptographic algorithms. This course is cross-listed with 15-635. Undergraduates should enroll in 15-435. Graduates students should enroll in 15-635.
Prerequisites: 15-251 Min. grade C or 15-210 Min. grade C or 15-330

15-437 Web Application Development: Fall and Spring: 12 units
This course will introduce concepts in programming web application servers. We will study the fundamental architectural elements of programming web sites that produce content dynamically. The primary technology introduced will be the Django framework for Python, but we will cover related topics as necessary so that students can build significant applications. Such topics include: HTTP, HTML, CSS, Javascript, XML, Design Patterns, Relational and Non-relational Databases, Object-Relation Mapping tools, Security, Web Services, Cloud Deployment, Internationalization, and Scalability and Performance Issues. Students must have programming and software design experience equivalent to about a typical Junior CS major and #8212;-a sequence of three college CS courses or more. Python-specific experience is not necessary. Students must provide their own computer hardware for this course. Please see the Related URL above for more information.
Prerequisite: 15-214

15-439 Special Topics: Blockchains and Cryptocurrencies: Intermittent: 12 units
Introduction to Blockchains and Cryptocurrencies. We focus on the cryptographic and mathematical foundations of Blockchains. The course will start from the basics and will cover the latest research in this area towards the end.

15-440 Distributed Systems: Fall and Spring: 12 units
The goals of this course are twofold: First, for students to gain an understanding of the principles and techniques behind the design of distributed systems, such as locking, concurrency, scheduling, and communication across the network. Second, for students to gain practical experience designing, implementing, and debugging real distributed systems. The major themes this course will teach include scarcity, scheduling, concurrency and concurrent programming, naming, abstraction and modularity, imperfect communication and other types of failure, protection from accidental and malicious harm, optimism, and the use of instrumentation and monitoring and debugging tools in problem solving. As the creation and management of software systems is a fundamental goal of any undergraduate systems course, students will design, implement, and debug large programming projects. As a consequence, competency in both the C and Java programming languages is required.
Prerequisite: 15-213 Min. grade C

Course Website: https://www.synergylabs.org/courses/15-440/

15-441 Networking and the Internet: Fall: 12 units
The emphasis in this course will be on the basic performance and engineering trade-offs in the design and implementation of computer networks. To make the issues more concrete, the class includes several multi-week projects requiring significant design and implementation. The goal is for students to learn not only what computer networks are and how they work today, but also why they are designed the way they are and how they are likely to evolve in the future. We will draw examples primarily from the Internet. Topics to be covered include: network architecture, routing, congestion/flow/error control, naming and addressing, peer-to-peer and the web, internetworking, and network security.
Prerequisite: 15-213 Min. grade C

15-442 Machine Learning Systems: Spring: 12 units
The goal of this course is to provide students an understanding and overview of elements in modern machine learning systems. Throughout the course, the students will learn about the design rationale behind the state-of-the-art machine learning frameworks and advanced system techniques to scale, reduce memory, and offload heterogeneous compute resources. We will also run case studies of large-scale training and serving systems used in practice today. This course offers the necessary background for students who would like to pursue research in the area of machine learning systems or continue to work in machine learning engineering.
Prerequisites: (21-128 Min. grade C or 15-151 Min. grade C or 21-127 Min. grade C) and 21-241 Min. grade C and (11-485 or 10-701 or 10-315 or 10-301 or 15-281) and (15-513 Min. grade C or 15-213 Min. grade C or 18-600 Min. grade C or 18-213 Min. grade C)

15-445 Database Systems: Fall: 12 units
This course is on the design and implementation of database management systems. Topics include data models (relational, document, key/value), storage models (n-ary, decomposition), query languages (SQL, stored procedures), storage architectures (heaps, log-structured), indexing (order preserving trees, hash tables), transaction processing (ACID, concurrency control), recovery (logging, checkpoints), query processing (joins, sorting, aggregation, optimization), and parallel architectures (multi-core, distributed). Case studies on open-source and commercial database systems will be used to illustrate these techniques and trade-offs. The course is appropriate for students with strong systems programming skills.
Prerequisite: 15-213 Min. grade C

Course Website: http://15445.courses.cs.cmu.edu

15-449 Engineering Distributed Systems: Spring: 9 units
This is a course for students with strong design and implementation skills who are likely to pursue careers as software architects and lead engineers. It may be taken by well-prepared undergraduates with excellent design and implementation skills in low-level systems programing. The course assumes a high level of proficiency in all aspects of operating system design and implementation. This course will help students prepare for leadership roles in creating and evolving the complex, large-scale computer systems that society will increasingly depend on in the future. The course will teach the organizing principles of such systems, identifying a core set of versatile techniques that are applicable across many system layers. Students will acquire the knowledge base, intellectual tools, hands-on skills and modes of thought needed to build well-engineered computer systems that withstand the test of time, growth in scale, and stresses of live use. Topics covered include: caching, prefetching, damage containment, scale reduction, hints, replication, hash-based techniques, and fragmentation reduction. A substantial project component is an integral part of the course. A high level of proficiency in systems programming is expected. If you do not have the 15-410 prerequisite you will need to get approval from the faculty.
Prerequisite: 15-410 Min. grade B

15-451 Algorithm Design and Analysis: Fall and Spring: 12 units
This course is about the design and analysis of algorithms. We study specific algorithms for a variety of problems, as well as general design and analysis techniques. Specific topics include searching, sorting, algorithms for graph problems, efficient data structures, lower bounds and NP-completeness. A variety of other topics may be covered at the discretion of the instructor. These include parallel algorithms, randomized algorithms, geometric algorithms, low level techniques for efficient programming, cryptography, and cryptographic protocols.
Prerequisites: 15-210 Min. grade C and 21-241 Min. grade C and (21-228 Min. grade C or 15-251 Min. grade C)

Course Website: https://www.csd.cs.cmu.edu/course-profiles/15-451-Algorithm-Design-and-Analysis

15-453 Formal Languages, Automata, and Computability: Intermittent: 9 units
An introduction to the fundamental ideas and models underlying computing: finite automata, regular sets, pushdown automata, context-free grammars, Turing machines, undecidability, and complexity theory.
Prerequisites: 21-228 Min. grade C or 15-251 Min. grade C

15-455 Undergraduate Complexity Theory: Fall and Spring: 9 units
Complexity theory is the study of how much of a resource (such as time, space, parallelism, or randomness) is required to perform some of the computations that interest us the most. In a standard algorithms course, one concentrates on giving resource efficient methods to solve interesting problems. In this course, we concentrate on techniques that prove or suggest that there are no efficient methods to solve many important problems. We will develop the theory of various complexity classes, such as P, NP, co-NP, PH, #P, PSPACE, NC, AC, L, NL, UP, RP, BPP, IP, and PCP. We will study techniques to classify problems according to our available taxonomy. By developing a subtle pattern of reductions between classes we will suggest an (as yet unproven!) picture of how by using limited amounts of various resources, we limit our computational power.
Prerequisite: 15-251 Min. grade C

15-456 Computational Geometry: Intermittent: 9 units
How do you sort points in space? What does it even mean? This course takes the ideas of a traditional algorithms course, sorting, searching, selecting, graphs, and optimization, and extends them to problems on geometric inputs. We will cover many classical geometric constructions and novel algorithmic methods. Some of the topics to be covered are convex hulls, Delaunay triangulations, graph drawing, point location, geometric medians, polytopes, configuration spaces, linear programming, and others. This course is a natural extension to 15-451, for those who want to learn about algorithmic problems in higher dimensions.
Prerequisite: 15-451 Min. grade C

15-457 Special Topics in Theory: Advanced Algorithms: Intermittent: 12 units
Selected advanced topics in algorithms and computational theory. Topics vary from semester to semester.
Prerequisite: 15-451 Min. grade B

15-458 Discrete Differential Geometry: Spring: 12 units
This course focuses on three-dimensional geometry processing, while simultaneously providing a first course in traditional differential geometry. Our main goal is to show how fundamental geometric concepts (like curvature) can be understood from complementary computational and mathematical points of view. This dual perspective enriches understanding on both sides, and leads to the development of practical algorithms for working with real-world geometric data. Along the way we will revisit important ideas from calculus and linear algebra, putting a strong emphasis on intuitive, visual understanding that complements the more traditional formal, algebraic treatment. The course provides essential mathematical background as well as a large array of real-world examples and applications. It also provides a short survey of recent developments in digital geometry processing and discrete differential geometry. Topics include: curves and surfaces, curvature, connections and parallel transport, exterior algebra, exterior calculus, Stokes' theorem, simplicial homology, de Rham cohomology, Helmholtz-Hodge decomposition, conformal mapping, finite element methods, and numerical linear algebra. Applications include: approximation of curvature, curve and surface smoothing, surface parameterization, vector field design, and computation of geodesic distance.
Prerequisites: (02-201 Min. grade C or 15-110 Min. grade C or 15-122 Min. grade C or 15-112 Min. grade C) and (21-254 Min. grade C or 21-242 Min. grade C or 21-240 Min. grade C or 21-241 Min. grade C or 21-341 Min. grade C) and (21-259 Min. grade C or 21-254 Min. grade C or 21-269 Min. grade C or 21-256 Min. grade C or 21-268 Min. grade C)

Course Website: http://geometry.cs.cmu.edu/ddg

15-459 Undergraduate Quantum Computation: Intermittent: 9 units
This undergraduate course will be an introduction to quantum computation and quantum information theory, from the perspective of theoretical computer science. Topics include: Qubit operations, multi-qubit systems, p=artial measurements, entanglement, quantum teleportation and quantum money, quantum circuit model, Deutsch-Jozsa and Simon's algorithm, number theory and Shor's Algorithm, Grover's Algorithm, quantum complexity theory, limitations and current practical developments.
Prerequisites: (15-210 Min. grade C or 15-251 Min. grade C) and (36-225 or 36-218 or 33-341 or 21-325 or 15-259) and (33-341 or 21-241 Min. grade C or 21-242)

15-462 Computer Graphics: Fall and Spring: 12 units
This course provides a comprehensive introduction to computer graphics modeling, animation, and rendering. Topics covered include basic image processing, geometric transformations, geometric modeling of curves and surfaces, animation, 3-D viewing, visibility algorithms, shading, and ray tracing.
Prerequisites: (21-240 Min. grade C and 21-259 Min. grade C and 15-213 Min. grade C) or (21-241 Min. grade C and 15-213 Min. grade C and 21-259 Min. grade C) or (18-213 Min. grade C and 18-202 Min. grade C)

15-463 Computational Photography: Fall: 12 units
Computational photography is the convergence of computer graphics, computer vision and imaging. Its role is to overcome the limitations of the traditional camera, by combining imaging and computation to enable new and enhanced ways of capturing, representing, and interacting with the physical world. This advanced undergraduate course provides a comprehensive overview of the state of the art in computational photography. At the start of the course, we will study modern image processing pipelines, including those encountered on mobile phone and DSLR cameras, and advanced image and video editing algorithms. Then we will proceed to learn about the physical and computational aspects of tasks such as 3D scanning, coded photography, lightfield imaging, time-of-flight imaging, VR/AR displays, and computational light transport. Near the end of the course, we will discuss active research topics, such as creating cameras that capture video at the speed of light, cameras that look around walls, or cameras that can see through tissue. The course has a strong hands-on component, in the form of seven homework assignments and a final project. In the homework assignments, students will have the opportunity to implement many of the techniques covered in the class, by both acquiring their own images of indoor and outdoor scenes and developing the computational tools needed to extract information from them. For their final projects, students will have the choice to use modern sensors provided by the instructors (lightfield cameras, time-of-flight cameras, depth sensors, structured light systems, etc.). This course requires familarity with linear algebra, calculus, programming, and doing computations with images. The course does not require prior experience with photography or imaging.
Prerequisites: 16-720 Min. grade C or 15-462 Min. grade C or 16-385 Min. grade C or 18-793 Min. grade C

Course Website: http://graphics.cs.cmu.edu/courses/15-463/

15-464 Technical Animation: Spring: 12 units
This course introduces techniques for computer animation such as keyframing, procedural methods, motion capture, and simulation. The course also includes a brief overview of story-boarding, scene composition, lighting and sound track generation. The second half of the course will explore current research topics in computer animation such as dynamic simulation of flexible and rigid objects,automatically generated control systems, and evolution of behaviors. The course should be appropriate for graduate students in all areas and for advanced undergraduates.
Prerequisite: 15-462 Min. grade C

15-465 Animation Art and Technology: Spring: 12 units
Animation, Art, and Technology is an interdisciplinary, Art and Computer Science, cross-listed course. Faculty and teaching assistants from computer science and art teach the class as a team. It is a project-based course in which interdisciplinary teams of students can produce animations across platforms from single channel to augmented reality. Most of the animations have a substantive technical component and the students are challenged to consider innovation with content to be equal with the technical. The class includes basic tutorials for work in Maya and Unity leading toward more advanced applications and extensions of the software such as motion capture and algorithms for animating cloth, hair, particles, and immersive technologies.
Prerequisites: 15-213 Min. grade C or 18-213 Min. grade C

15-466 Computer Game Programming: Fall: 12 units
The goal of this course is to acquaint students with the code required to turn ideas into games. This includes both runtime systems and #8212; e.g., AI, sound, physics, rendering, and networking and #8212; and the asset pipelines and creative tools that make it possible to author content that uses these systems. In the first part of the course, students will implement small games that focus on specific runtime systems, along with appropriate asset editors or exporters. In the second part, students will work in groups to build a larger, polished, open-ended game project. Students who have completed the course will have the skills required to extend and #8212; or build from scratch and #8212; a modern computer game. Students wishing to take this class should be familiar with the C++ language and have a basic understanding of the OpenGL API. If you meet these requirements but have not taken Computer Graphics (the formal prerequisite), please contact the instructor.
Prerequisite: 15-462
Course Website: http://graphics.cs.cmu.edu/courses/15-466/

15-468 Physics-Based Rendering: Spring: 12 units
This course is an introduction to physics-based rendering at the advanced undergraduate and introductory graduate level. During the course, we will cover fundamentals of light transport, including topics such as the rendering and radiative transfer equation, light transport operators, path integral formulations, and approximations such as diffusion and single scattering. Additionally, we will discuss state-of-the-art models for illumination, surface and volumetric scattering, and sensors. Finally, we will use these theoretical foundations to develop Monte Carlo algorithms and sampling techniques for efficiently simulating physically-accurate images. Towards the end of the course, we will look at advanced topics such as rendering wave optics, neural rendering, and differentiable rendering. The course has a strong programming component, during which students will develop their own working implementation of a physics-based renderer, including support for a variety of rendering algorithms, materials, illumination sources, and sensors. The project also includes a final project, during which students will select and implement some advanced rendering technique, and use their implementation to produce an image that is both technically and artistically compelling. The course will conclude with a rendering competition, where students submit their rendered images to win prizes. Cross-listing: This is both an advanced undergraduate and introductory graduate course, and it is cross-listed as 15-468 (for undergraduate students), 15-668 (for Master's students), and 15-868 (for PhD students). Please make sure to register for the section of the class that matches your current enrollment status.
Prerequisites: 16-385 or 16-720 or 15-462
Course Website: http://graphics.cs.cmu.edu/courses/15-468/

15-469 Special Topic: Visual Computing Systems: Intermittent: 12 units
Visual computing tasks such as computational imaging, image/video understanding, and real-time graphics are key responsibilities of modern computer systems ranging from sensor-rich smart phones to large datacenters. These workloads demand exceptional system efficiency and this course examines the key ideas, techniques, and challenges associated with the design of parallel, heterogeneous systems that accelerate visual computing applications. This course is intended for graduate and advanced undergraduate-level students interested in architecting efficient graphics, image processing, and computer vision platforms.
Prerequisites: 15-418 or 16-385 or 15-462

15-472 Real-Time Graphics: Intermittent: 12 units
Real-time computer graphics is about building systems that leverage modern CPUs and GPUs to produce detailed, interactive, immersive, and high-frame-rate imagery. Students will build a state-of-the-art renderer using C++ and the Vulkan API. Topics explored will include efficient data handling strategies; culling and scene traversal; multi-threaded rendering; post-processing, depth of field, screen-space reflections; volumetric rendering; sample distribution, spatial and temporal sharing, and anti-aliasing; stereo view synthesis; physical simulation and collision detection; dynamic lights and shadows; global illumination, accelerated raytracing; dynamic resolution, "AI" upsampling; compute shaders; parallax occlusion mapping; tessellation, displacement; skinning, transform feedback; debugging, profiling, and accelerating graphics algorithms.
Prerequisite: 15-462
Course Website: http://graphics.cs.cmu.edu/courses/15-472-s24/

15-473 Visual Computing Systems: Intermittent: 12 units
Visual computing tasks such as computational imaging, image/video understanding, and real-time graphics are key responsibilities of modern computer systems ranging from sensor-rich smart phones to large datacenters. These workloads demand exceptional system efficiency and this course examines the key ideas, techniques, and challenges associated with the design of parallel, heterogeneous systems that accelerate visual computing applications. This course is intended for graduate and advanced undergraduate-level students interested in architecting efficient graphics, image processing, and computer vision platforms.

15-482 Autonomous Agents: Fall: 12 units
Autonomous agents use perception, cognition, actuation, and learning to reliably achieve desired goals, where the agents can be smart homes, mobile robots, intelligent factories, self-driving cars, etc. The goal of this course is to introduce students to techniques needed for developing complete, integrated AI-based autonomous agents. Topics include architectures for intelligent agents; autonomous behaviors, perception, and execution; reasoning under uncertainty; optimization; execution monitoring; machine learning; scheduling; and explanation. A focus of the course will be on the integration and testing of autonomous systems to achieve reliable and robust behavior in the face of sensor noise and uncertainty. The course is project-oriented where small teams of students will design, implement, and evaluate agents that can grow plants autonomously, without human intervention.
Prerequisites: 15-281 or 10-315 or 10-601 or 10-301
Course Website: http://www.cs.cmu.edu/~15482

15-483 Truth, Justice, and Algorithms: Intermittent: 9 units
Truth, Justice, and Algorithms is an interdisciplinary course that covers selected theoretical topics at the interface of computer science and economics, focusing on the algorithmic side of incentives and fairness. The course's topics include: computational social choice, e.g., voting rules as maximum likelihood estimators, the axiomatic approach to ranking systems and crowdsourcing, manipulation of elections and ways to circumvent it; cooperative games, focusing on solution concepts such as the core and the Shapley value, and their computation; fair division algorithms for allocating divisible and indivisible goods, and approximate notions of fairness; online matching algorithms (competitive analysis, not dating) and kidney exchange; noncooperative games, including Nash equilibrium and correlated equilibrium, their computation, connections to learning theory, Stackelberg security games, and the price of anarchy in congestion and routing games; and topics in social networks such as the diffusion of technologies and influence maximization. NOTE: This course is cross-listed with 15-896. Undergraduates may enroll into 15-896 but be aware of work load difference. The two courses are identical in terms of lectures, content, and homework assignments. The only difference is in the final project requirement. In 483, students will prepare a summary of several papers and #8212; this will require 10-20 hours of work. In 896, students will carry out a research project with the goal of obtaining novel results, and present their results in class and #8212; a good project will require 50-60 hours of work. Also note that 483 is 9 units, and 896 is 12 units.
Prerequisite: 15-451 Min. grade C

Course Website: http://www.cs.cmu.edu/~arielpro/15896s16/

15-487 Introduction to Computer Security: Fall: 12 units
This course will introduce students to the fundamentals of computer security and applied cryptography. Topics include software security, networking and wireless security, and applied cryptography. Students will also learn the fundamental methodology for how to design and analyze security critical systems.
Prerequisite: 15-213

15-491 Special Topic: CMRoboBits: AI and Robots for Daily-Life Problems: Fall: 12 units
This course will be a project-based course in which we will look at AI and robotics artifacts and techniques to automate solutions to real-world problems, in particular related to life in cities. The course will start by collecting and brainstorming about real problems biased to ones that involve the physical space in addition to the cyber information space, such as traffic rush hour, noise in cities, 3D building inspection, service and data gathering. We will then formalize the chosen problems and analyze existing real data. The course will proceed by possibly enabling the students to prototype their projects beyond simulation, and using the CORAL lab robots, e.g., the CoBot or NAO robots or drones. The course work will be a single large project, performed by groups of up to 3 students. The projects will be divided in three phases, due at the end of February, March, and the end of the course. Students are expected to have programming experience in C++ or python.
Prerequisite: 15-122 Min. grade C

15-492 Special Topic: Speech Processing: Fall: 12 units
Speech Processing offers a practical and theoretical understanding of how human speech can be processed by computers. It covers speech recognition, speech synthesis and spoken dialog systems. The course involves practicals where the student will build working speech recognition systems, build their own synthetic voice and build a complete telephone spoken dialog system. This work will be based on existing toolkits. Details of algorithms, techniques and limitations of state of the art speech systems will also be presented. This course is designed for students wishing understand how to process real data for real applications, applying statistical and machine learning techniques as well as working with limitations in the technology.
Prerequisite: 15-122 Min. grade C

Course Website: http://www.speech.cs.cmu.edu/15-492/

15-494 Cognitive Robotics: The Future of Robot Toys: Spring: 12 units
This course will explore the future of robot toys by analyzing and programming Anki Cozmo, a new robot with built-in artificial intelligence algorithms. Como is distinguished from earlier consumer robots by its reliance on vision as the primary sensing mode and its sophisticated use of A.I. Its capabilities include face and object recognition, map building, path planning, and object pushing and stacking. Although marketed as a pre-programmed children's toy, Cozmo's open source Python SDK allows anyone to develop new software for it, which means it can also be used for robotics education and research. The course will cover robot software architecture, human-robot interaction, perception, and planning algorithms for navigation and manipulation. Prior robotics experience is not required, just strong programming skills.
Prerequisite: 15-122 Min. grade C

15-495 Topics of Algorithmic Problem Solving: Intermittent: 12 units
This course aims to give implementation motivated perspectives on some algorithmic ideas that fall outside of the scopes of most courses. It is intended for graduate students, as well as undergraduate students who have high grades in 15-210, 15-251, 15-259 (and preferably 15-451). Evaluation will consist of about 30 auto-graded coding tasks, plus either participation in the East Central NA ICPC Regional Contest, or presentations of problem-solving reports from the Chinese IOI Team Selection Camp. The first half of the course will discuss floating point precision, numerical approximation schemes, heuristic search, usage of optimization packages, and vectorization. The second half will provide high-level surveys of 2-D range update and amp; query data structures, proactive propagation, palindromic automata, automated recurrence finding, and maximum adjacency search.
Prerequisites: (21-235 Min. grade C or 15-259 Min. grade C) and 15-210 Min. grade C and 15-251 Min. grade C

15-503 This course is now 15-356 / 856 Introduction to Cryptography: Spring: 9 units
This course is aimed as an introduction to theoretical cryptography for graduate and advanced undergraduate students. We will cover formal definitions of security, as well as constructions of some of the most useful and popular primitives in cryptography: pseudorandom generators, encryption, signatures, zero-knowledge, multi-party computation, etc. In addition, we will cover the necessary number-theoretic background.
Prerequisites: 15-251 Min. grade C and 15-210 Min. grade C

Course Website: http://www.cs.cmu.edu/~goyal/15503.html

15-539 Computer Science Pedagogy: Spring: 9 units
The objective of this course is to build skills in the area of collaborative product design in an educational context. The first part of the course will focus on how to communicate with and engage an audience in an ever-growing virtual environment, using computer science education as the medium. The goal will be to learn how to present information in a creative yet intrinsically pedagogical way. Throughout the course, students will work both independently and in groups to create content for high school students using CMU CS Academy's computer programming curriculum. Contact ecawley@andrew.cmu.edu if you are interested in taking this class as it is special permission only.

15-591 Independent Study in Computer Science: Fall and Spring
The School of Computer Science offers Independent Study courses, which allow motivated students to work on projects under the supervision of a faculty advisor while receiving academic credit. Independent studies are usually one semester in duration and require prior approval from the faculty member and the School of Computer Science.

15-592 Independent Study in Computer Science: Fall and Spring
The School of Computer Science offers Independent Study courses, which allow motivated students to work on projects under the supervision of a faculty advisor while receiving academic credit. Independent studies are usually one semester in duration and require prior approval from the faculty member and the School of Computer Science.

15-593 Independent Study in Computer Science: Fall and Spring
The School of Computer Science offers Independent Study courses, which allow motivated students to work on projects under the supervision of a faculty advisor while receiving academic credit. Independent studies are usually one semester in duration and require prior approval from the faculty member and the School of Computer Science.

15-594 Independent Study in Computer Science: Fall and Spring
The School of Computer Science offers Independent Study courses, which allow motivated students to work on projects under the supervision of a faculty advisor while receiving academic credit. Independent studies are usually one semester in duration and require prior approval from the faculty member and the School of Computer Science.

15-599 SCS Honors Undergraduate Research Thesis: Fall and Spring
Available only to students registered in the CS Senior Research Thesis Program.

15-627 Monte Carlo Methods and Applications: Fall: 9 units
The Monte Carlo method uses random sampling to solve computational problems that would otherwise be intractable, and enables computers to model complex systems in nature that are otherwise too difficult to simulate. This course provides a first introduction to Monte Carlo methods from complementary theoretical and applied points of view, and will include implementation of practical algorithms. Topics include random number generation, sampling, Markov chains, Monte Carlo integration, stochastic processes, and applications in computational science. Students need a basic background in probability, multivariable calculus, and some coding experience in any language.

Course Website: http://www.cs.cmu.edu/~kmcrane/random/

15-635 Foundations of Blockchains: Fall: 12 units
In this course, students will learn the mathematical foundations of blockchains, including how to construct distributed consensus protocols and prove them secure, cryptography for blockchains, and mechanism design for blockchains. This course will take a mathematically rigorous approach. Students are expected to have mathematical maturity and be able to write formal mathematical proofs. Students may also be expected to implement some consensus or cryptographic algorithms. This course is crosslisted with 15-435. Graduate students should take 15-635. Undergraduates should take 15-435.
Prerequisites: 15-210 Min. grade C or 15-251 Min. grade C or 15-330

15-642 Machine Learning Systems: Spring: 12 units
The goal of this course is to provide students an understanding and overview of elements in modern machine learning systems. Throughout the course, the students will learn about the design rationale behind the state-of-the-art machine learning frameworks and advanced system techniques to scale, reduce memory, and offload heterogeneous compute resources. We will also run case studies of large-scale training and serving systems used in practice today. This course offers the necessary background for students who would like to pursue research in the area of machine learning systems or continue to work in machine learning engineering.

15-653 Logic and Mechanized Reasoning: Spring: 12 units
Symbolic logic is fundamental to computer science, providing a foundation for the theory of programming languages, database theory, AI, knowledge representation, automated reasoning, interactive theorem proving, and formal verification. Formal methods based on logic complement statistical methods and machine learning by providing rules of inference and means of representation with precise semantics. These methods are central to hardware and software verification, and have also been used to solve open problems in mathematics. This course will introduce students to logic on three levels: theory, implementation, and application. It will focus specifically on applications to automated reasoning and interactive theorem proving. We will present the underlying mathematical theory, and students will develop the mathematical skills that are needed to design and reason about logical systems in a rigorous way. We will also show students how to represent logical objects in a functional programming language, Lean, and how to implement fundamental logical algorithms. We will show students how to use contemporary automated reasoning tools, including SAT solvers, SMT solvers, and first-order theorem provers to solve challenging problems. Finally, we will show students how to use Lean as an interactive theorem prover.

15-658 Compiler Design: Spring: 15 units
This course covers the design and implementation of compiler and run-time systems for high-level languages, and examines the interaction between language design, compiler design, and run-time organization. Topics covered include syntactic and lexical analysis, handling of user-defined types and type-checking, context analysis, code generation and optimization, and memory management and run-time organization.

Course Website: https://csd.cs.cmu.edu/course-profiles/15-411_611-compiler-design

15-668 Physics-Based Rendering: Spring: 12 units
This course is an introduction to physics-based rendering at the advanced undergraduate and introductory graduate level. During the course, we will cover fundamentals of light transport, including topics such as the rendering and radiative transfer equation, light transport operators, path integral formulations, and approximations such as diffusion and single scattering. Additionally, we will discuss state-of-the-art models for illumination, surface and volumetric scattering, and sensors. Finally, we will use these theoretical foundations to develop Monte Carlo algorithms and sampling techniques for efficiently simulating physically-accurate images. Towards the end of the course, we will look at advanced topics such as rendering wave optics, neural rendering, and differentiable rendering.
Prerequisites: 16-385 or 16-720 or 15-462
Course Website: http://graphics.cs.cmu.edu/courses/15-468/

15-669 Special Topics: Visual Computing Systems: Intermittent: 12 units
Visual computing tasks such as computational imaging, image/video understanding, and real-time graphics are key responsibilities of modern computer systems ranging from sensor-rich smart phones to large datacenters. These workloads demand exceptional system efficiency and this course examines the key ideas, techniques, and challenges associated with the design of parallel, heterogeneous systems that accelerate visual computing applications. This course is intended for graduate and advanced undergraduate-level students interested in architecting efficient graphics, image processing, and computer vision platforms.
Prerequisites: 16-385 or 15-462 or 15-418

15-705 Engineering Distributed Systems: Spring: 12 units
This course is for students with strong design and implementation skills who are likely to pursue careers as software architects and lead engineers. It may be taken by well-prepared undergraduates with excellent design and implementation skills in low-level systems programing. The course assumes a high level of proficiency in all aspects of operating system design and implementation. This course will help students prepare for leadership roles in creating and evolving the complex, large-scale computer systems that society will increasingly depend on in the future. The course will teach the organizing principles of such systems, identifying a core set of versatile techniques that are applicable across many system layers. Students will acquire the knowledge base, intellectual tools, hands-on skills and modes of thought needed to build well-engineered computer systems that withstand the test of time, growth in scale, and stresses of live use. Topics covered include: caching, prefetching, damage containment, scale reduction, hints, replication, hash-based techniques, and fragmentation reduction. A substantial project component is an integral part of the course. A high level of proficiency in systems programming is expected. Please refer to course website for the most recent schedule updates.

Course Website: http://www.cs.cmu.edu/~csd-grad/courseschedules14.html

15-719 Advanced Cloud Computing: Spring: 12 units
Computing in the cloud has emerged as a leading paradigm for cost-effective, scalable, well-managed computing. Users pay for services provided in a broadly shared, power efficient datacenter, enabling dynamic computing needs to be met without paying for more than is needed. Actual machines may be virtualized into machine-like services, or more abstract programming platforms, or application-specific services, with the cloud computing infrastructure managing sharing, scheduling, reliability, availability, elasticity, privacy, provisioning and geographic replication This course will survey the aspects of cloud computing by reading about 30 papers and articles, executing cloud computing tasks on a state of the art cloud computing service, and implementing a change or feature in a state of the art cloud computing framework. There will be no final exam, but there will be two in class exams. Grades will be about 50 project work and about 50 examination results.
Prerequisites: 15-213 Min. grade B or 15-513 Min. grade B or 18-213 Min. grade B

Course Website: http://www.cs.cmu.edu/~15719/

15-721 Advanced Database Systems: Intermittent: 12 units
This course is a comprehensive study of the internals of modern database management systems. It will cover the core concepts and fundamentals of the components that are used in large-scale analytical systems (OLAP). The class will stress both efficiency and correctness of the implementation of these ideas.

Course Website: https://15721.courses.cs.cmu.edu

15-749 Post-von Neumann Computer Architecture: Intermittent: 12 units
Computing has been dominated by von Neumann CPU architectures for seventy years. The von Neumann architecture is familiar and flexible, but it is also extremely inefficient, wasting upwards of 99% of energy. As computing is now energy-limited across all scales, from IoT to data center, von Neumann's inefficiency can no longer be tolerated. Recently, industry has adopted heterogeneous "accelerator" hardware to boost performance and efficiency. However, accelerators have limited programmability, sacrificing the main benefit of CPU architectures and putting future innovation at risk. This class will survey non-von Neumann general-purpose architectures, recent work on specialized hardware accelerators, and cutting-edge research on "programmable accelerators".

Course Website: http://www.cs.cmu.edu/~15-749/

15-751 CS Theory Toolkit: Spring: 12 units
This course will take a random walk through various mathematical topics that come in handy for theoretical computer science. It is intended mainly for students earlier in their graduate studies (or very strong undergraduates) who want to do theory research. The idea for the course comes from other courses by Arora (2002, 2007), Håstad (2004/05), Kelner (2007, 2009), and Tulsiani (2013). Students should have a solid undergraduate background in math (e.g., elementary combinatorics, graph theory, discrete probability, basic algebra/calculus) and theoretical computer science (running time analysis, big-O/Omega/Theta, P and NP, basic fundamental algorithms).

Course Website: https://www.cs.cmu.edu/~odonnell/toolkit20

15-859 Randomized Algorithms: Fall: 12 units
A graduate-level course on how to use randomization to design algorithms and data structures with strong provable guarantees.

15-883 Computational Models of Neural Systems: Intermittent: 12 units
This course is an in-depth study of information processing in real neural systems from a computer science perspective. We will examine several brain areas, such as the hippocampus and cerebellum, where processing is sufficiently well understood that it can be discussed in terms of specific representations and algorithms. We will focus primarily on computer models of these systems, after establishing the necessary anatomical, physiological, and psychophysical context. There will be some neuroscience tutorial lectures for those with no prior background in this area.

Course Website: http://www.cs.cmu.edu/afs/cs/academic/class/15883-f19/

Human-Computer Interaction Courses

05-090 Human-Computer Interaction Practicum: All Semesters: 3 units
This course is for HCII students who wish to have an internship experience as part of their curriculum. Students are required to write a one-page summary statement prior to registration that explains how their internship connects with their HCI curriculum, specifically on how it uses material they have learned as well as prepares them for future courses. Near the end of the internship, students will be required to submit a reflection paper that describes the work they did in more detail, including lessons learned about the work experience and how they utilized their HCI education to work effectively. International students should consult with the Office of International Education for appropriate paperwork and additional requirements before registration. Units earned count toward the total required units necessary for degree completion; students should speak with an academic advisor for details. This course may be taken at most 3 times for a total of 9 units maximum. Students normally register for this course for use during the summer semester.

05-180 Introduction to Human-Computer Interaction: Spring: 5 units
This course is for first-year students who are interested in learning more about HCI, especially first-year SCS students considering the primary HCI major.

05-200 Ethics and Policy Issues in Computing: Intermittent: 9 units
Should autonomous robots make life and death decisions on their own? Should we allow them to select a target and launch weapons? To diagnose injuries and perform surgery when human doctors are not around? Who should be permitted to observe you, find out who your friends are, what you do and say with them, what you buy, and where you go? Do social media and personalized search restrict our intellectual horizons? Do we live in polarizing information bubbles, just hearing echoes of what we already know and believe? As computing technology becomes ever more pervasive and sophisticated, we are presented with an escalating barrage of decisions about who, how, when, and for what purposes technology should be used. This course will provide an intellectual framework for discussing these pressing issues of our time, as we shape the technologies that in turn shape us. We will seek insight through reading, discussion, guest lectures, and debates. Students will also undertake an analysis of a relevant issue of their choice, developing their own position, and acquiring the research skills needed to lend depth to their thinking. The course will enhance students' ability to think clearly about contentious technology choices, formulate smart positions, and support their views with winning arguments.

05-291 Learning Media Design: Fall: 12 units
[IDeATe collaborative course] Learning is a complex human phenomenon with cognitive, social and personal dimensions that need to be accounted for in the design of technology enhanced learning experiences. In this studio course students will apply learning science concepts to critique existing forms of learning media, establish a set of design precedents to guide project work and produce a series of design concepts that support learning interactions in a real-world context. Collaborating in small interdisciplinary teams, students will partner with a local informal learning organization (e.g. museum, after school program provider, maker space) to conduct learning design research studies, synthesize findings, establish learning goals and iteratively prototype and assess design concepts. As final deliverables, students will present their design research findings, design concepts, and prototypes to stakeholders, and draft a media-rich proposal for their learning media concept to pitch to a local funder. Please note that there may be usage/materials fees associated with this course. Please note that there may be usage/materials fees associated with this course.

05-292 IDeATe: Learning in Museums: Spring: 12 units
Learning in Museums brings together students from across the disciplines to consider the design of mediated learning experiences though a project-based inquiry course. Students will be introduced to a range of design research methods and associated frameworks that explore the cognitive, social and affective dimensions of learning in everyday contexts through readings, invited lectures, in-class activities and assignments. Students will conduct a series of short design research studies to define learning goals and develop supporting design concepts that improve learning outcomes for diverse participants in informal learning settings (e.g. museums, after school programs, maker spaces or online). In concept development, we will look at how to position technology and question its role in the setting to engage and foster positive learning interactions. This course will culminate in a media-rich presentation of design concepts and a prototype to a stakeholder audience, and include an evaluation plan describing how learning outcomes for the project would be assessed.

05-300 HCI Undergraduate Pro Seminar: All Semesters: 2 units
HCI is a broad field that brings together approaches from design, computer science, and psychology. This course provides an introduction to the field of HCI and to the HCI community at CMU. Guest speakers from around campus will provide a general introduction to these approaches and how they are pursued at CMU, and will describe research opportunities that are available to undergraduates. The course will also discuss career options in both industry and academia for students of HCI, and will include presentations from HCI alumni and sessions on preparing resumes, creating portfolios, and interviewing for jobs. The course is designed for current or potential HCI majors and minors but is open to anyone with an interest in applying for the HCI major/minor.

Course Website: https://hcii.cmu.edu/academics/courses

05-315 Persuasive Design: Fall: 12 units
This project-based course focuses on the ethical, human-centered design and evaluation of persuasive technologies that aim to change users' attitudes, emotions, or behaviors in ways that benefit the self and/or society. In addition to exposing students to an array of psychological theories and strategies for implicit and explicit persuasion, the course will cover a variety of topics illustrating both the pitfalls and possibilities in designing for positive impact in HCI. The focal point of the class will be the semester project, for which student teams will iteratively conceptualize, prototype, implement, and evaluate a tool, system, or change to a ubiquitous computing environment that intends to stimulate and sustain belief or behavior change (such as reducing cognitive or social biases, building healthy or prosocial habits, or resisting other persuasive forces one encounters on a daily basis).

05-317 Design of Artificial Intelligence Products: Intermittent: 12 units
This course teaches students how to design new products and services that leverage the capabilities of AI and machine learning to improve the quality of peoples lives. Students will learn to follow a matchmaking design, user-centered design, and service design process. Students will learn to ideate; reframing problematic situations by envisioning many possible products and services. Students will learn to iteratively refine and assess their ideas with real users/customers. Class projects will focus on the challenges of deploying systems that generate errors and the challenges of situating intelligent systems such that they harmonize the best qualities of human and machine intelligence.

Course Website: https://hcii.cmu.edu/academics/courses

05-318 Human AI Interaction: Intermittent: 12 units
Artificial Intelligence is inspired by human intelligence, made powerful by human data, and ultimately only useful in how it positively affects the human experience. This course is an introduction to harnessing the power of AI so that it is beneficial and useful to people. We will cover a number of general topics: agency and initiative, AI and ethics, bias and transparency, confidence and errors, human augmentation and amplification, trust and explainability, mixed-initiative systems, and programming by example. These topics will be explored via projects in dialog and speech-controlled systems, automatic speech recognition, computer vision, data science, recommender systems, text summarization, learning science, UI personalization, and visualization. Students will complete individual weekly mini-projects in which they will design and build AI systems across a wide variety of domains. Students should be comfortable with programming; assignments will be primarily in Python and Javascript. Prior experience with AI/machine learning will be useful but is not required. Students will also be responsible for weekly readings and occasional presentations to the class.

Course Website: http://www.hcii.cmu.edu/academics/courses

05-319 Data Visualization: Fall: 12 units
This course is an introduction to key design principles and techniques for interactively visualizing data. The major goals of this course are to understand how visual representations can help in the analysis and understanding of complex data, how to design effective visualizations, and how to create your own interactive visualizations using modern web-based frameworks.

Course Website: https://dig.cmu.edu/courses/2022-fall-datavis.html

05-320 Social Web: Intermittent: 12 units
With the growth of online environments like MySpace, Second Life, World of Warcraft, Wikipedia, blogs, online support groups, and open source development communities, the web is no longer just about information. This course, jointly taught by a computer scientist and a behavioral scientist, will examine a sampling of the social, technical and business challenges social web sites must solve to be successful, teach students how to use high-level tools to analyze, design or build online communities, and help them understand the social impact of spending at least part of their lives online. This class is open to advanced undergraduates and graduate students with either technical or non-technical backgrounds. Course work will include lectures and class discussion, homework, class presentations, and a group research or design project.

05-321 Transformational Game Design Studio: Fall: 12 units
TBA

05-333 Gadgets, Sensors and Activity Recognition in HCI: Fall: 12 units
Recent advances in HCI have been driven by new capabilities to deliver inexpensive devices to users, to display information in mobile and other contexts, to sense the user and their environment, and use these sensors to create models of a user's context and actions. This course will consider both concepts surrounding these new technological opportunities through discussion of current literature - and practical considerations the skills needed to actually build devices. About 1/3 of this class will review current advances in this area. The remainder will be devoted to development of individual skills so that students leaving the class will have an ability to actually build small devices for human interaction (in short: "HCI gadgets"). In particular, the course will concentrate on the basics of building simple microcontroller-based devices and will also provide very basic coverage of the machine learning techniques needed for simple sensor-driven statistical models. The course is designed to be accessible to students with a wide range of backgrounds including both technically-oriented and non-technical students (especially Designers) interested in HCI. The class will be project oriented with 4-5 electronic prototype building projects during the semester. At least two of these projects will be self-defined in nature and can be adapted to the existing skills and interests of each student. There are no formal prerequisites for this class. However, the class will involve programming and debugging of micro-controllers. Some coverage of the language used to do this will be provided, and if required by your background, the programming component of the projects can be made comparatively small (but, in that case some other aspect of the projects will need to be expanded). However, you should not take this course if you have no programming background. This course assumes no background in electronics.

Course Website: http://www.hcii.cmu.edu/courses/applied-gadgets-sensors-and-activity-recognition-hci

05-341 Organizational Communication: All Semesters: 9 units
Most of management is communication. You communicate to get information that will be the basis of decisions, coordinate activity, to provide a vision for the people who work for and with you, to and to sell yourself and your work. The goal of this course is to identify communication challenges within work groups and organizations and ways to overcome them. To do this requires that we know how communication normally works, what parts are difficult, and how to fix it when it goes wrong. The focus of this course is on providing you with a broad understanding of the way communication operates within dyads, work groups, and organizations. The intent is to give you theoretical and empirical underpinnings for the communication you will undoubtedly participate in when you move to a work environment, and strategies for improving communication within your groups. Because technology is changing communication patterns and outcomes both in organizations and more broadly in society, the course examines these technological changes. Readings come primarily from the empirical research literature.

Course Website: http://www.hcii.cmu.edu/courses/organizational-communication

05-360 Interaction Design Fundamentals: Fall and Spring: 12 units
IXD Fundamentals introduces the human-centered design process as well as fundamental interaction design principles, methods, and practices. The course is for both students who may only enroll in one interaction design course and those who intend to build upon their HCI learning by taking advanced interaction design courses. Students must work effectively as individuals and in small teams to learn interaction design concepts and apply them to real-world problems. By the end of this course students should be able to; -Apply appropriate interaction design methods in a human-centered design process. -Create persuasive interim and final design artifacts that demonstrate communication design fundamentals. -Facilitate productive and structured critique across the class and with instructors. -Explain and apply fundamental interaction design principles. -Create clarity and readability in artifacts, including GUIs and deliverables, through the disciplined application of visual design principles such as typography, color and composition. -Practice reframing a given problem in order to create opportunities that drive generating multiple solutions. -Demonstrate habits that foster the creative process, including drawing, divergent thinking, and creative experimentation. -Identify and explore with interaction design materials. This course serves as a prerequisite for Advanced Interaction Design Studio (number TBD). Students who are required to take this course have priority and will be enrolled first. No coding is required.

05-361 Advanced Interaction Design: Spring: 12 units
Advanced Interaction Design follows Interaction Design for Human-Computer Interaction (05-360/05-660). Students are expected to build on the basic interaction design principles they learned in Interaction Design Fundamentals by applying advanced methods to solve more complex problems using emerging technologies in user experiences that cross devices, modalities and contexts. Students learn how to design with advanced technologies that predict, assist and automate, and make through a design system. Systems thinking, data as a design material, and UI design are emphasized in projects which are designed to give students experience solving complex problems that they are likely to encounter as practitioners. Advanced Interaction Design prepares students to become interaction designers that take a rigorous and principled approach to solving enterprise-scale problems where many systems and applications serve many stakeholders.
Prerequisites: 05-392 or 05-651 or 05-360

05-380 Prototyping Algorithmic Experiences: Intermittent: 15 units
This project-based course provides an overview and hands-on introduction to iterative prototyping methods in HCI, with an emphasis on current and emerging technologies such as data-driven algorithmic systems, AI and machine learning, spatial computing, and IoT. Students will learn and implement approaches for creating and using prototypes to iteratively inform the creation of new technologies. The course will help students learn to strategically evaluate whether a given prototyping approach is a good fit for a given design or research question. In addition to HCI undergraduate majors, the course is open to undergraduate and graduate level students with proficiency in programming and prior courses or experience in user-centered research, design, and/or evaluation. Some exceptions to the course prerequisites will be granted with permission of the instructor.
Prerequisites: 15-112 and (15-121 or 15-122 or 15-150 or 15-210) and (05-650 or 05-651 or 05-391 or 05-410 or 05-392 or 05-470 or 05-317 or 05-360 or 05-452)

05-391 Designing Human Centered Software: All Semesters: 12 units
"Why are things so hard to use these days? Why doesn't this thing I just bought work? Why is this web site so hard to use? These are frustrations that we have all faced from systems not designed with people in mind. The question this course will focus on is: how can we design human-centered systems that people find useful and usable? This course is a broad introduction to designing, prototyping, and evaluating user interfaces. If you take only one course in Human-Computer Interaction, this is the course for you. We will cover theory as well as practical application of ideas from Human-Computer Interaction. Coursework includes lectures, class discussion, homework, class presentations, and group projects. This class is open to all undergrads and grad students, with either technical or non-technical majors. However, there is a programming prerequisite. "
Prerequisites: 15-112 or 15-110 or 15-122 or 15-104
Course Website: http://www.hcii.cmu.edu/courses/designing-human-centered-software

05-392 Interaction Design Overview: Fall: 9 units
This studio course offers a broad overview of communication and interaction design. Students will learn design methodologies such as brainstorming, sketching, storyboarding, wire framing, and prototyping. Students learn to take a human-centered design approach to their work. Assignments include short in-class exercises as well as individual and team-based projects. Students take part in studio critiques, engaging in critical discussions about the strengths and weaknesses of their own work and the work of others. No coding is required. When registering for this course, undergraduate students are automatically placed the wait list.

05-395 Applications of Cognitive Science: Spring: 9 units
The goal of this course is to examine cases where basic research on cognitive science, including cognitive neuroscience, has made its way into application, in order to understand how science gets applied more generally. The course focuses on applications that are sufficiently advanced as to have made an impact outside of the research field per se; for example, as a product, a change in practice, or a legal statute. Examples are virtual reality (in vision, hearing, and touch), cognitive tutors, phonologically based reading programs, latent semantic analysis applications to writing assessment, and measures of consumers' implicit attitudes. The course will use a case-study approach that considers a set of applications in detail, while building a general understanding of what it means to move research into the applied setting. The questions to be considered include: What makes a body of theoretically based research applicable? What is the pathway from laboratory to practice? What are the barriers - economic, legal, entrenched belief or practice? The format will emphasize analysis and discussion by students. They should bring to the course an interest in application; extensive prior experience in cognitive science is not necessary. The course will include tutorials on basic topics in cognitive science such as perception, memory, and spatial cognition. These should provide sufficient grounding to discuss the applications.

Course Website: http://www.hcii.cmu.edu/courses/applications-cognitive-science

05-410 User-Centered Research and Evaluation: Fall: 12 units
This course provides an overview and introduction to the field of human-computer interaction (HCI). It introduces students to tools, techniques, and sources of information about HCI and provides a systematic approach to design. The course increases awareness of good and bad design through observation of existing technology and teaches the basic skills of generative and evaluative research methods. This is a companion course to courses in visual design (51-422) and software implementation (05-430, 05-431). When registering for this course, undergraduate students are automatically placed the wait list. Students will be then moved into the class, based on if they are in the BHCI second major and year in school e.g. seniors, juniors, etc. In the Fall, this course is NOT open to students outside the HCI major. The Spring offering is open to all students. This course is a core requirement for students in the HCI additional major.
Prerequisites: 85-421 or 85-408 or 85-370 or 85-251 or 85-213 or 85-211 or 85-241 or 88-120

05-413 Human Factors: Fall: 9 units
This course uses theory and research from human factors, cognitive science, and social science to understand and design the interactions of humans with the built world, tools, and technology. The course emphasizes current work in applied domains such as automotive design, house construction, medical human factors, and design of information devices. The course also will emphasize not only individual human factors (e.g., visual response, anthropometry) but also the organizational arrangements that can amplify or correct human factors problems. Through reading, discussion, and projects, you will learn about human perceptual, cognitive, and physical processes that affect how people interact with, and use, technology and tools. You will learn why we have so many automobile accidents, voting irregularities, and injuries from prescription medication. You will learn some tried and true solutions for human factors problems, and some of the many problems in human factors that remain. You will also have gained experience in research in this field.

Course Website: http://www.hcii.cs.cmu.edu

05-417 Computer-mediated Communication: Spring: 6 units
This course examines fundamental aspects of interpersonal communication and considers how different types of computer-mediated communications (CMC) technologies affect communication processes. Among the topics we will consider are: conversational structure and CMC, tools to support nonverbal and paralinguistic aspects of communication such as gesture and eye gaze, and social and cultural dimensions of CMC. Students will be expected to post to weekly discussion lists, to write a paper on a specific aspect of CMC, and to present a talk on their final project to the class. The course should be appropriate for graduate students in all areas and for advanced undergraduates.

05-418 Design Educational Games: Spring: 12 units
The potential of digital games to improve education is enormous. However, it is a significant challenge to create a game that is both fun and educational. In this course, students will learn to meet this challenge by combining processes and principles from game design and instructional design. Students will also learn to evaluate their games for fun, learning, and the integration of the two. They will be guided by the EDGE framework for the analysis and design educational games. The course will involve a significant hands-on portion, in which students learn a design process to create educational games digital or non-digital. They will also read about existing educational games and discuss game design, instructional design, learning and transfer, and the educational effectiveness of digital games. They will analyze an educational game and present their analysis to the class.

Course Website: https://www.hcii.cmu.edu/course/design-of-educational-games

05-430 Programming Usable Interfaces: Spring: 15 units
This course is combines lecture, and an intensive programming lab and design studio. It is for those who want to express their interactive ideas in working prototypes. It will cover the importance of human-computer interaction/interface design, iterative design, input/output techniques, how to design and evaluate interfaces, and research topics that will impact user interfaces in the future. In lab, you will learn how to design and program effective graphical user interfaces, and how to perform user tests. We will cover a number of prototyping tools and require prototypes to be constructed in each, ranging from animated mock-ups to fully functional programs. Assignments will require implementing UIs, testing that interface with users, and then modifying the interface based on findings. Some class sessions will feature design reviews of student work. This course is for HCII Masters students and HCI dual majors with a minimal programming background. Students will often not be professional programmers, but will need to interact with programmers. RECITATION SELECTION: Students taking this course can sign up for either Prototyping Lab recitation. PREREQUISITES: Proficiency in a programming language, program structure, algorithm analysis, and data abstraction. Normally met through an introductory programming course using C, C++, Pascal or Java, such as 15100, 15112, 15127 or equivalent. Students entering this course should be able to independently write a 300-line program in 48 hours. This course is NOT open to students outside of the BHCI program.
Prerequisites: 15-110 or 15-104 or 15-112 or 15-127 or 15-100

05-431 Software Structures for User Interfaces: Fall: 12 units
This course considers the basic and detailed concepts for building software to implement user interfaces (UIs). It considers factors of input, output, application interface, and related infrastructure as well as the typical patterns used to implement them. It considers how these aspects are organized and managed within a well-structured object oriented system. We will cover a variety of "front-end" programming contexts, including conventional graphical user interface (GUI) programming for mobile apps (phones, watches), web apps, and regular desktop applications, across a variety of frameworks. We will also cover programming for data-driven and conversational (AI) user interfaces. We will briefly touch on front-end programming for visualizations, games, 3D, and virtual and artificial reality (VR and AR), along with interactive UI tools such as prototypers and resource editors. The homeworks and project in this course will involve extensive object-oriented programming, likely in both Java and JavaScript, so this course is only appropriate for students with a strong programming background. Note that this is not an HCI methods course and #8212; we do not cover user-centered design or evaluation methods. This course is designed for students in the SCS HCI undergrad Major, but it also available to any undergrad or graduate student with an interest in the topic and solid prior programming experience who wish to understand the structures needed for professional development of interactive systems. Note that all students who register for this class will initially be placed on a waitlist. Priority for getting into the class are students in the HCII programs (more senior students first), and then others. The graduate (05-631) and undergraduate (05-431) numbers are for the same course with the same work.
Prerequisites: 17-437 or 17-514 or 17-214 or 15-214 or 15-213 or 18-213 or 15-513 or 14-513

05-432 Personalized Online Learning: Fall: 12 units
Online learning has become widespread (e.g., MOOCs, online and blended courses, and Khan Academy) and many claim it will revolutionize higher education and K-12. How can we make sure online learning is maximally effective? Learners differ along many dimensions and they change over time. Therefore, advanced learning technologies must adapt to learners to provide individualized learning experiences. This course covers a number of proven personalization techniques used in advanced learning technologies. One of the techniques is the use of cognitive modeling to personalize practice of complex cognitive skills in intelligent tutoring systems. This approach, developed at CMU, may well be the most significant application of cognitive science in education and is commercially successful. We will also survey newer techniques, such as personalizing based on student meta-cognition, affect, and motivation. Finally, we will look at personalization approaches that are widely believed to be effective but have not proven to be so. The course involves readings and discussion of different ways of personalizing instruction, with an emphasis on cognitive modeling approaches. Students will learn to use the Cognitive Tutor Authoring Tools (CTAT) to implement tutor prototypes that rely on computer-executable models of human problem solving to personalize instruction. The course is meant for graduate or advanced undergraduate students in Human-Computer Interaction, Psychology, Computer Science, Design, or related fields, who are interested in educational applications. Students should either have some programming skills or experience in the cognitive psychology of human problem solving, or experience with instructional design.

Course Website: http://www.hcii.cmu.edu/courses/personalized-online-learning

05-433 Programming Usable Interfaces OR Software Structures for Usable Interfaces: Fall: 6 units
Section A: Programming Usable Interfaces Section B: Software Structures for Usable Interfaces This is a lecture-only course (see 05-430/05-630 or 05-431/631 for the lecture + lab version of these courses) that is intended for those who want to learn how to design and evaluate user interfaces. We will cover the importance of human-computer interaction and interface design, the iterative design cycle used in HCI, an overview of input and output techniques, how to design and evaluate interaction techniques, and end with a discussion of hot topics in research that will impact user interfaces in the coming years. This course is only intended for HCII Masters students or HCI undergraduate majors who have already taken an associated User Interface lab, or non-MHCI/BHCI students interested in the design of user interfaces. WAITLIST LOGISTICS: Note that ALL students who register for this class will initially be placed on a waitlist. Your position on the waitlist is not an indication of whether you will be accepted into the class. Contacting the instructor will not move you off the waitlist. Priority for getting off the waitlist are MHCI students, BHCI students (more senior students first), and then others.

05-434 Machine Learning in Practice: Fall and Spring: 12 units
Machine Learning is concerned with computer programs that enable the behavior of a computer to be learned from examples or experience rather than dictated through rules written by hand. It has practical value in many application areas of computer science such as on-line communities and digital libraries. This class is meant to teach the practical side of machine learning for applications, such as mining newsgroup data or building adaptive user interfaces. The emphasis will be on learning the process of applying machine learning effectively to a variety of problems rather than emphasizing an understanding of the theory behind what makes machine learning work. This course does not assume any prior exposure to machine learning theory or practice. In the first 2/3 of the course, we will cover a wide range of learning algorithms that can be applied to a variety of problems. In particular, we will cover topics such as decision trees, rule based classification, support vector machines, Bayesian networks, and clustering. In the final third of the class, we will go into more depth on one application area, namely the application of machine learning to problems involving text processing, such as information retrieval or text categorization. 05-834 is the HCII graduate section. If you are an LTI student, please sign up for the LTI graduate course number (11-663) ONLY to count properly towards your degree requirements. 05-434 is the HCII undergraduate section. If you are an LTI student, please sign up for the LTI undergraduate course number (11-344) ONLY to count properly towards your degree requirements.

Course Website: http://www.hcii.cmu.edu/courses/applied-machine-learning

05-435 Applied Fabrication for HCI: Fall: 12 units
This course will consider how new fabrication techniques such as 3D printing, laser cutting, CNC machining and related computer controlled technologies can be applied to problems in Human-Computer Interaction. Each offering will concentrate on a particular application domain for its projects. This year the course will consider assistive technology. This course will be very hands-on and skills-oriented, with the goal of teaching students the skills necessary to apply these technologies to HCI problems such as rapid prototyping of new device concepts. To this end? Every student in this course will build and take home a 3D printer. (There will be $400-$500 cost associated with this course to make that possible. Details on this are still to be determined.)

05-436 Usable Privacy and Security: Spring: 9 units
There is growing recognition that technology alone will not provide all of the solutions to security and privacy problems. Human factors play an important role in these areas, and it is important for security and privacy experts to have an understanding of how people will interact with the systems they develop. This course is designed to introduce students to a variety of usability and user interface problems related to privacy and security and to give them experience in designing studies aimed at helping to evaluate usability issues in security and privacy systems. The course is suitable both for students interested in privacy and security who would like to learn more about usability, as well as for students interested in usability who would like to learn more about security and privacy. Much of the course will be taught in a graduate seminar style in which all students will be expected to do a weekly reading assignment and each week different students will prepare a presentation for the class. Students will also work on a group project throughout the semester. The course is open to all graduate students who have technical backgrounds. The 12-unit course numbers (08-734 and 5-836) are for PhD students and masters students. Students enrolled in these course numbers will be expected to play a leadership role in a group project that produces a paper suitable for publication. The 9-unit 500-level course numbers (08-534 and 05-436) are for juniors, seniors, and masters students. Students enrolled in these course numbers will have less demanding project and presentation requirements.

Course Website: http://www.hcii.cmu.edu/courses/usuable-privacy-and-security

05-439 The Big Data Pipeline: Collecting and Using Big Data for Interactive Systems: Spring: 12 units
This course covers techniques and technologies for creating data driven interfaces. You will learn about the entire data pipeline from sensing to cleaning data to different forms of analysis and computation.

Course Website: http://data.cmubi.org

05-440 Interaction Techniques: Intermittent: 12 units
This course will provide a comprehensive study of the many ways to interact with computers and computerized devices. An "interaction technique" starts when the user does something that causes an electronic device to respond and includes the direct feedback from the device to the user. Examples include physical buttons and switches, on-screen menus and scroll bars operated by a mouse, touch screen widgets and gestures such as flick-to-scroll, text entry on computers or touch screens, game controllers, interactions in 3D and virtual/augmented reality, consumer electronic controls such as remote controls, and adaptations of all of these for people with disabilities. We will start with a history of the invention and development of these techniques, discuss the various options used today, and continue on to the future with the latest research on interaction techniques presented at conferences such as ACM CHI and UIST. Appropriate design and evaluation methods for interaction techniques will also be covered. Guest lectures from inventors of interaction techniques are planned. Students will have a choice for final projects that can focus on historical or novel interaction techniques.

Course Website: http://www.cs.cmu.edu/~bam/uicourse/05440inter/

05-452 Service Design: Fall: 12 units
In this course, we will collectively define and study services and product service systems, and learn the basics of designing them. We will do this through lectures, studio projects, and verbal and written exposition. Classwork will be done individually and in teams.

05-470 Digital Service Innovation: Intermittent: 12 units
Attention entrepreneurs, designers, and engineers! This course teaches you to invent digital services. You will learn about value-creation in the service sector and a human-centered design process including brainstorming, story-boarding, interviewing, video sketches, and pitching. Students work in small, interdisciplinary teams to discover unmet needs of users. They conceive of a digital service and assess its technical feasibility, financial viability, and desirability. Then they produce a plan with a business model and a video sketch and pitch it to industry professionals. Grades will be determined primarily by the quality of the team's products.

Course Website: https://www.hcii.cmu.edu/course/digital-service-innovation

05-499 Special Topics in HCI: Fall and Spring: 12 units
Special Topics in HCI is an opportunity for students interested in HCI to gain a deeper understanding of a specific area in this field. Each class is designed to cover an emerging research area within HCI, from designing large-scale peer learning systems to designing games around audience agency. All sections will help students: (1) build a more comprehensive understanding of an area of study within HCI, (2) work closely with faculty and peers to create mini-projects or team assignments that help students master the course material, (3) explore evidence-based research methods and techniques in HCI. Sections will vary in topic and often change from semester to semester. Because of this, students can take multiple sections, as they are individual classes. Undergraduate sections are listed as 499 and graduate sections are listed as 899. For descriptions of specific sections for this academic year, visit the "Courses" section on the Human-Computer Interaction Institute website.

Course Website: http://www.hcii.cmu.edu/academics/courses

05-540 Rapid Prototyping of Computer Systems: Spring: 12 units
This is a project-oriented course, which will deal with all four aspects of project development: the application, the artifact, the computer-aided design environment, and the physical prototyping facilities. The class consists of students from different disciplines who must synthesize and implement a system in a short period of time. Upon completion of this course the student will be able to: generate systems specifications from a perceived need; partition functionality between hardware and software; produce interface specifications for a system composed of numerous subsystems; use computer-aided development tools; fabricate, integrate, and debug a hardware/software system; and evaluate the system in the context of an end user application. The class consists of students from different disciplines who must synthesize and implement a system in a short period of time.

Course Website: http://www.hcii.cmu.edu/courses/rapid-prototyping-computer-systems

05-571 Undergraduate Project in HCI: Spring: 12 units
Experiential learning is a key component of the MHCI program. Through a substantial team project, students apply classroom knowledge in analysis and evaluation, implementation and design, and develop skills working in multidisciplinary teams. Student teams work with Carnegie Mellon University-based clients or external clients to iteratively design, build and test a software application which people directly use.
Prerequisites: 05-631 Min. grade B or 05-410 Min. grade B or 05-430 Min. grade B or 05-431 Min. grade B or 05-610 Min. grade B or 05-630 Min. grade B

Course Website: http://www.hcii.cmu.edu/courses/undergraduate-project-hci

05-589 Independent Study in HCI-UG: All Semesters
In collaboration with and with the permission of the professor, undergraduate students may engage in independent project work on any number of research projects sponsored by faculty. Students must complete an Independent Study Proposal, negotiate the number of units to be earned, complete a contract, and present a tangible deliverable. The Undergraduate Program Advisor's signature is required for HCI undergraduate-level Independent Study courses. Registration is through the HCII Undergraduate Programs Manager only.

05-600 HCI Pro Seminar: Fall: 6 units
This course is only for MHCI students. This course is specifically built to expose students to the world of HCI through research and industry talks, as well as strengthening HCI communication skills for work in industry. Seminar Component:To expose students to the world of HCI through research and industry expert talks with written assignments. Conflict Management Component:To educate students on conflict management, teamwork, active listening skills, and communication skills in order to give them tools to collaborate and work more efficiently on multi-disciplinary teams. Professional Series Component: To expose students to the world of HCI through guest speakers, prepare students to navigate job hunting through resume and portfolio workshops and to provide industry insights into HCI and the profession through guest speakers and panel discussions.

Course Website: http://www.hcii.cs.cmu.edu

05-602 IDeATe: Learning in Museums: Spring: 12 units
Learning in Museums brings together students from across the disciplines to consider the design of mediated learning experiences in a project-based inquiry course. Students will be introduced to a range of design research methods and associated frameworks that explore the cognitive, social and affective dimensions of learning in everyday contexts through readings, invited lectures, in-class activities and assignments. Students will conduct a series of short design research studies to define learning goals and develop supporting design concepts intended to improve learning outcomes for diverse participants in informal learning settings (e.g. museums, after-school programs, maker spaces or online). In concept development, we will look at how to position technology and question its role in the setting to engage and foster positive learning interactions and conversation. This semester we will be working with the Carnegie Museum of Natural History as our primary stakeholder. The course will culminate in a media-rich presentation of design concepts and a fielded prototype to a review panel and include a piloted evaluation plan describing how learning outcomes for the project would be assessed. In consultation with the instructor, students in the graduate section of the course will be assigned an HCI/learning research literature review and presentation related to their project topic.

05-610 User-Centered Research and Evaluation: Fall: 12 units
This course provides and overview and introduction to the field of human-computer interaction (HCI). It introduces students to tools, techniques, and sources of information about HCI and provides a systematic approach to design. The course increases awareness of good and bad design through observation of existing technology, and teaches the basic skills of generative and evaluative research methods. This is a companion course to software implementation (05-430, 05-431 05-380). When registering for this course, undergraduate students are automatically placed the wait list. Students will be then moved into the class, based on if they are in the BHCI primary or second major and year in school e.g. seniors, juniors, etc. Freshman are not permitted to register in this course. In the Fall, this course is NOT open to students outside the HCI major or MHCI. The Spring offering is open to all students. This course is a core requirement for students in the HCI additional major and the MHCI program.
Prerequisites: 85-213 or 85-211 or 85-241 or 88-120 or 85-370 or 85-408 or 85-421 or 85-251
Course Website: http://www.hcii.cs.cmu.edu

05-615 Persuasive Design: Fall: 12 units
This project-based course focuses on the ethical, human-centered design and evaluation of persuasive technologies that aim to change users' attitudes, emotions, or behaviors in ways that benefit the self and/or society. In addition to exposing students to an array of psychological theories and strategies for implicit and explicit persuasion, the course will cover a variety of topics illustrating both the pitfalls and possibilities in designing for positive impact in HCI. The focal point of the class will be the semester project, for which student teams will iteratively conceptualize, prototype, implement, and evaluate a tool, system, or change to a ubiquitous computing environment that intends to stimulate and sustain belief or behavior change (such as reducing cognitive or social biases, building healthy or prosocial habits, or resisting other persuasive forces one encounters on a daily basis).

05-618 Human AI Interaction: Intermittent: 12 units
Artificial Intelligence is inspired by human intelligence, made powerful by human data, and ultimately only useful in how it positively affects the human experience. This course is an introduction to harnessing the power of AI so that it is beneficial and useful to people. We will cover a number of general topics: agency and initiative, AI and ethics, bias and transparency, confidence and errors, human augmentation and amplification, trust and explainability, mixed-initiative systems, and programming by example. These topics will be explored via projects in dialog and speech-controlled systems, automatic speech recognition, computer vision, data science, recommender systems, text summarization, learning science, UI personalization, and visualization. Students will complete individual weekly mini-projects in which they will design and build AI systems across a wide variety of domains. Students should be comfortable with programming; assignments will be primarily in Python and Javascript. Prior experience with AI/machine learning will be useful but is not required. Students will also be responsible for weekly readings and occasional presentations to the class.

Course Website: https://www.hcii.cmu.edu/academics/courses

05-619 Data Visualization: Fall: 12 units
This course is an introduction to key design principles and techniques for interactively visualizing data. The major goals of this course are to understand how visual representations can help in the analysis and understanding of complex data, how to design effective visualizations, and how to create your own interactive visualizations using modern web-based frameworks.

Course Website: https://dig.cmu.edu/courses/2022-fall-datavis.html

05-650 Interaction Design Studio II: Spring: 12 units
This course follows Interaction Design Fundamentals (05-651). Students are expected to apply what they have learned about design thinking and methodologies as a starting point for all assignments. Students will work in teams to perform guerrilla research, synthesize data, and consider the needs of multiple stakeholders in their design of mobile services and other intelligent systems. Design concepts go beyond user interfaces to include sensors, controls, and ubiquitous computing. Emphasis is placed on the quality of the students ideas and their ability to give form to their design concepts. By completing and presenting their work, students will gain skills related to professional UX design practice.
Prerequisite: 05-651
Course Website: http://www.hcii.cmu.edu/courses/interaction-design-studio

05-651 Interaction Design Studio 1: Fall: 12 units
This studio course introduces students to design thinking and the basic practices of interaction design. We follow a human-centered design process that includes research, concept generation, prototyping, and refinement. Students must work effectively as individuals and in small teams to design mobile information systems and other interactive experiences. Assignments approach design on three levels: specific user interactions, contexts of use, and larger systems. Students will become familiar with design methodologies such as sketching, storyboarding, wire framing, prototyping, etc. No coding is required. This course serves as a prerequisite for Interaction Design Studio (05-650). Students who are required to take this course have priority and will be enrolled first.

05-660 Interaction Design Fundamentals: Fall and Spring: 12 units
IXD Fundamentals introduces the human-centered design process as well as fundamental interaction design principles, methods, and practices. The course is for both students who may only enroll in one interaction design course and those who intend to build upon their HCI learning by taking advanced interaction design courses. Students must work effectively as individuals and in small teams to learn interaction design concepts and apply them to real-world problems. By the end of this course students should be able to; -Apply appropriate interaction design methods in a human-centered design process. -Create persuasive interim and final design artifacts that demonstrate communication design fundamentals. -Facilitate productive and structured critique across the class and with instructors. -Explain and apply fundamental interaction design principles. -Create clarity and readability in artifacts, including GUIs and deliverables, through the disciplined application of visual design principles such as typography, color and composition. -Practice reframing a given problem in order to create opportunities that drive generating multiple solutions. -Demonstrate habits that foster the creative process, including drawing, divergent thinking, and creative experimentation. -Identify and explore with interaction design materials. This course serves as a prerequisite for Advanced Interaction Design Studio (number TBD). Students who are required to take this course have priority and will be enrolled first. No coding is required.

05-661 Advanced Interaction Design: Spring: 12 units
Advanced Interaction Design (05-361/05-661) follows Interaction Design for Human-Computer Interaction (05-360/05-660). Students are expected to build on the basic interaction design principles they learned in Interaction Design Fundamentals by applying advanced methods to solve more complex problems using emerging technologies in user experiences that cross devices, modalities and contexts. Students learn how to design with advanced technologies that predict, assist and automate, and make through a design system. Systems thinking, data as a design material, and UI design are emphasized in projects which are designed to give students experience solving complex problems that they are likely to encounter as practitioners. Advanced Interaction Design prepares students to become interaction designers that take a rigorous and principled approach to solving enterprise-scale problems where many systems and applications serve many stakeholders.
Prerequisites: 05-651 or 05-692 or 05-660

05-670 Digital Service Innovation: Fall: 12 units
Attention entrepreneurs, designers, and engineers! This course teaches you to invent digital services. You will learn about value-creation in the service sector and a human-centered design process including brainstorming, story-boarding, interviewing, video sketches, and pitching. Students work in small, interdisciplinary teams to discover unmet needs of users. They conceive of a digital service and assess its technical feasibility, financial viability, and desirability. Then they produce a plan with a business model and a video sketch and pitch it to industry professionals. Grades will be determined primarily by the quality of the team's products.

Course Website: https://www.hcii.cmu.edu/course/digital-service-innovation

05-674 Ethics and Policy Issues in Computing: Intermittent: 9 units
Should autonomous robots make life and death decisions on their own? Should we allow them to select a target and launch weapons? To diagnose injuries and perform surgery when human doctors are not around? Who should be permitted to observe you, find out who your friends are, what you do and say with them, what you buy, and where you go? Do social media and personalized search restrict our intellectual horizons? Do we live in polarizing information bubbles, just hearing echoes of what we already know and believe? As computing technology becomes ever more pervasive and sophisticated, we are presented with an escalating barrage of decisions about who, how, when, and for what purposes technology should be used. This course will provide an intellectual framework for discussing these pressing issues of our time, as we shape the technologies that in turn shape us. We will seek insight through reading, discussion, guest lectures, and debates. Students will also undertake an analysis of a relevant issue of their choice, developing their own position, and acquiring the research skills needed to lend depth to their thinking. The course will enhance students' ability to think clearly about contentious technology choices, formulate smart positions, and support their views with winning arguments.

05-680 Independent Study in HCI - METALS: All Semesters
With the permission of the professor, METALS students may engage in independent project work on any number of innovative research projects sponsored by faculty. Students must complete an Independent Study Proposal, negotiate the number of units to be earned, submit a contract, and present a tangible deliverable. The Program Advisor's signature is required for the METALS Independent Study course.

05-685 Prototyping Algorithmic Experiences: Intermittent: 15 units
This project-based, technical studio course provides an overview and hands-on introduction to iterative prototyping methods in HCI. Students learn methods and strategies to iteratively prototype novel technologies with users. Students will practice strategically evaluating whether a given prototyping approach is a good fit for a given design or research question (e.g., in terms of expected time, effort, and informativeness). Through a series of rapid course projects, students will explore the cutting-edge of HCI methods for prototyping complex interactive experiences with challenging design materials, such as AI and machine learning, social computing, and spatial computing. In addition to HCI undergraduate majors, the course is open to undergraduate and graduate level students with proficiency in programming and prior courses or experience in user-centered research, design, and/or evaluation. Some exceptions to the course prerequisites will be granted with permission of the instructor.
Prerequisites: 15-112 and (15-210 or 15-150 or 15-122 or 15-121) and (05-891 or 05-651 or 05-650 or 05-652 or 05-610 or 05-617 or 05-660 or 05-392 or 05-670)

05-738 Evidence-Based Educational Design: Fall: 12 units
In this course, we will explore the essential principles of educational design, focusing on creating inclusive environments for diverse learners and promoting positive behavior. We will explore effective strategies for measuring learning outcomes, enhancing student engagement, and assessing educational effectiveness. Students will prepare for careers as instructional designers, learning engineers, educators, and researchers as we cover the range of topics in this class. The coursework includes a thorough examination of current research in learning sciences through various papers and textbooks. Additionally, students will apply these theoretical principles practically by completing two hands-on projects, seeing the direct application of the concepts to real-world use cases. Class time will be spent discussing the weekly readings, highlighting relevant case studies, and engaging in group activities that foster collaboration and practical application of the material covered. This course will prepare students for real-world challenges in educational design and help integrate learning science knowledge through practical experience, enabling them to create effective educational designs and strategies.

05-823 E-Learning Design Principles and Methods: Fall: 12 units
Good design is a continuous improvement process that combines scientific principles and data-driven methods to achieve desired outcomes. E-learning design is no exception. In this course, you will learn how to design innovative e-learning, that is, online interactions and technology that make learning more effective and efficient. You will practice instructional design using learning science theories and principles and learning engineering using data-driven methods to discover insights about how learners think. Instructional designers explain and use principles of learning and instruction such as proven ways to support learning-by-doing, like deliberate practice and self-explanation, and proven ways to support multimedia learning from text, visuals, and audio. They employ "backward design": designing and aligning learning goals, the assessments that measure them, and the instruction that achieves them. But today's learning engineers do not simply design in sequence and #8212; goals then assessments then instruction and #8212; but are agile and iterative. They collect qualitative data, for example, by having an expert "think aloud" while performing one of their assessments and use the results to add or change goals. They collect and use quantitative data, for example, by mining learning data from online course interactions or by comparing alternative designs in an A/B experiment. By using data, learning engineers create innovative and effective designs unlike the results of others who rely on science and intuition alone. You will do so too in an end-to-end e-learning design project, where you develop an e-learning module of your choice, continuously improve it, and test it in an A/B experiment.

Course Website: https://www.hcii.cmu.edu/course/e-learning-design-principles

05-839 Interactive Data Science: Spring: 12 units
This course covers techniques and technologies for creating data driven interfaces. You will learn about the entire data pipeline from sensing to cleaning data to different forms of analysis and computation.

Course Website: https://hcii.cmu.edu/academics/courses

05-840 Tools for Online Learning: Fall: 12 units
In this course, we will explore issues that pertain to interaction and interface design. The class will focus on elements of the larger interaction design process including basic design principles, information architecture and navigation, planning and brainstorming methods, and techniques for developing rapid sketches and prototypes. Course Requirements: This class will not focus on learning specific software tools. Students are expected to have prior experience using a variety of design and programming tools. Please speak with the instructor if you have questions regarding these prerequisites. This course was design for students in the METALS program.

Institute for Software Research Courses

08-200 Ethics and Policy Issues in Computing: Spring: 9 units
In this course, students will study the social impacts of computing technology and systems. The course will provide a brief introduction to ethics and to the new and difficult ethical questions modern computing technology presents us with. It will focus on a number of areas in which computers and information technology are having an impact on society including data privacy, social media, and autonomous technologies.

08-722 Data Structures for Application Programmers: Fall and Spring: 6 units
This course is an introduction to Data Structures and a few fundamental algorithms for students with some prior programming experience (functions, loops and arrays mainly in Java). It covers the conceptual and implementation views of some common data structures and algorithms. It also goes over the Java Collections (such as List, ArrayList, LinkedList, Set, HashSet, TreeSet, Map, HashMap, TreeMap, PriorityQueue) to solidify the understanding of the data structures. There is an introduction to the analysis of algorithms that operate on them. Following learning-by-doing methodology, there will be many repetitions of writing code and reviews of the items covered in lectures. Students are required to be familiar with Java Programming before taking this course. Those who are not are encouraged to take 08-671 in mini 1 before taking this course. Students are required to have a reasonably modern laptop computer on which install the Java software used for this course.

Language Technologies Institute Courses

11-291 Applied Computational Intelligence Lab: Intermittent: 9 units
What would an "intelligent" picture on the wall do? What if it could see and hear you? What should it say if it could talk? What if your pantry, wardrobe or medicine cabinet could sense, think and act? What should they do and say? What should your cell phone be saying to you? These are not whimsical or theoretical questions...they inevitably arise as ordinary everyday objects around us acquire the ability to sense changes in their environment, think about their implications, and act in pursuit of their goals. These objects are connected to the web and become conduits for services, erasing the distinction between products and services. The ability to invent and build smart products/services is becoming a key skill in the new technology-driven services economy. The focus of the course will be on building "ordinary" objects that can sense, think and act in the real world and on exploring the implications of these capabilities. Students will select their own project and by the end of the semester will create a working prototype that will be exhibited in a public place. Prizes will be offered for the most creative projects. In the course of their projects, students will learn how to use state-of-the-art tools for: Object detection using video cameras, microphones and other sensors Movement and gesture detection Speech recognition and generation Reasoning and planning: While the course organizers have many ideas for specific projects, students will be encouraged to design their own projects. Students are expected to work in small groups on their own time and receive faculty advice as needed. There will be weekly meetings of the whole class.
Prerequisites: 21-127 Min. grade C and 15-122 Min. grade C

11-324 Human Language for Artificial Intelligence: Fall: 12 units
An enduring aspect of the quest to build intelligent machines is the challenge of human language. This course introduces students with a background in computer science and a research interest in artificial intelligence fields to the structure of natural language, from sound to society. It covers phonetics (the physical aspects of speech), phonology (the sound-structure of language), morphology (the structure of words), morphosyntax (the use of word and phrase structure to encode meaning), syntactic formalisms (using finite sets of production rules to characterize infinite configurations of structure), discourse analysis and pragmatics (language in discourse and communicative context), and sociolinguistics (language in social context and social meaning). Evaluation is based on seven homework assignments, a midterm examination, and a final examination.

11-344 Machine Learning in Practice: Fall and Spring: 12 units
Machine Learning is concerned with computer programs that enable the behavior of a computer to be learned from examples or experience rather than dictated through rules written by hand. It has practical value in many application areas of computer science such as on-line communities and digital libraries. This class is meant to teach the practical side of machine learning for applications, such as mining newsgroup data or building adaptive user interfaces. The emphasis will be on learning the process of applying machine learning effectively to a variety of problems rather than emphasizing an understanding of the theory behind what makes machine learning work. This course does not assume any prior exposure to machine learning theory or practice. In the first 2/3 of the course, we will cover a wide range of learning algorithms that can be applied to a variety of problems. In particular, we will cover topics such as decision trees, rule based classification, support vector machines, Bayesian networks, and clustering. In the final third of the class, we will go into more depth on one application area, namely the application of machine learning to problems involving text processing, such as information retrieval or text categorization.

11-345 Undergrad Independent Study: All Semesters
No course description provided.

11-364 An Introduction to Knowledge-Based Deep Learning and Socratic Coaches: Spring: 12 units
The subject of this course will be deep learning, one of the most dynamic and exciting emerging areas of computer science. Deep learning deals with and is conquering the problems resulting from the enormous quantity of data that now surrounds us. Furthermore, the course will explore knowledge-based deep learning, a new methodology invented by the instructor that offers many potential advantages over conventional deep learning. This is a learn-by-doing, team-project based course, which will be divided into four phases. In phase one, each student will read and present a number of papers describing state-of-the-art deep learning systems and successful applications. In phase two, each team will implement the system described in one of the papers. In phase three, each team will scale that implementation to one of the large benchmark datasets. In phase four, each team will do a special research project implementing a knowledge-based deep learning system based on pending patent applications of Professor Baker. As a potential follow-on for successful projects, students may participate in a summer course on entrepreneurial applications of deep learning or work as interns in a bootstrap startup based on the knowledge-based deep learning projects. Prerequisite: Strong quantitative aptitude, programming skill, ability to quickly absorb new ideas, teamwork skills.

11-390 LTI Minor Project - Juniors: All Semesters: 12 units
No course description provided.

11-411 Natural Language Processing: Intermittent: 12 units
This course is about a variety of ways to represent human languages (like English and Chinese) as computational systems, and how to exploit those representations to write programs that do neat stuff with text and speech data, like translation, summarization, extracting information, question answering, natural interfaces to databases, and conversational agents. This field is called Natural Language Processing or Computational Linguistics, and it is extremely multidisciplinary. This course will therefore include some ideas central to Machine Learning and to Linguistics. We'll cover computational treatments of words, sounds, sentences, meanings, and conversations. We'll see how probabilities and real-world text data can help. We'll see how different levels interact in state-of-the-art approaches to applications like translation and information extraction. From a software engineering perspective, there will be an emphasis on rapid prototyping, a useful skill in many other areas of Computer Science.
Prerequisite: 15-122

11-422 Grammar Formalisims: Spring: 12 units
TBA

11-423 ConLanging: Lrng. Ling. & Lang Tech via Constru Artif. Lang.: Spring: 12 units
Students will work individually or in small groups to create artificial human(oid) languages for fictional human cultures or SciFi worlds. Students will implement language technologies for their languages. In the course of creating the languages, students will learn about the building blocks of human language such as phones, phonemes, morphemes, and morpho-syntactic constructions including their semantics and pragmatics. Class instruction will focus specifically on variation among human languages so that the students can make conlangs that are not just naively English-like. We will also touch on philosophical issues in philosophy of language and on real-world socio-political issues related to language policy. Students will be required to use at least one of the following technologies: language documentation tools that are used for field linguistics and corpus annotation, automatic speech recognition, speech synthesis, morphological analysis, parsing, or machine translation. Learning Objectives: 1. The building blocks (phonemes, morphemes, etc.) of language, how languages are built from them, and how they interact 2. Metalinguistic awareness and knowledge about variation in human language 3. Language, thought, and culture: how does language reflect thought and culture, and vice versa. Why wouldn't Elvish be a good language for Klingons? 4. Language policy in the real world: For students who want to manipulate real languages. 5. Historical linguistics and language change: for students who want to manipulate real languages or make families of related conlangs for fictional worlds. 6. Practical experience with a language technology. http://tts.speech.cs.cmu.edu/11-823/
Course Website: http://tts.speech.cs.cmu.edu/11-823

11-424 Subword Modeling: Intermittent: 12 units
The goal of this course is to lead students to engage broadly with the existing NLP and computational linguistics research on subword modeling and develop new computational approaches to problems in morphology, orthography, and phonology. In addition to three other miniprojects, students will be expected to produce one piece of research that can be developed into a conference or workshop paper (though submission is not a course requirement). The paper should be suitable for the Phonology, Morphology, and Word Segmentation tracks of the *ACL conferences, the SIGMORPHON workshop, Coling, or LREC.
Prerequisites: 11-611 or 11-711 or 11-411

11-439 Designing Around Patents on Machine Learning and NLP Technology: Spring: 9 units
This course uses Machine Learning and Natural Language Processing as vehicles to teach principles in designing software to avoid patents. After introducing students to the basics of patents, we investigate how to use students software skills to design around patents that is, create new technology that avoids a patent while maintaining some, or even all, of the performance and value of the patented technology. Designing around a patent can be viewed as a puzzle that requires technical skill, understanding the business value of technology, knowledge of patents, and creativity. Students will also be able to help design patents that cannot be easily designed-around. Not only does this add a valuable new dimension to the student's skill set, the course material is organized as a vehicle for refining knowledge of ML and NLP techniques. We will practice by designing around patents on well-known ML and NLP algorithms. Students study the basic algorithm, learn the patents that cover those algorithms, and then experiment with software modifications that avoid the patent while preserving as much of the algorithm's performance as possible. In essence, students will view the presence of particular patents as a design constraints, akin to designing for limited memory, bandwidth, or processor speed. Students must have already taken courses in Natural Language Processing (e.g., 11-411) and Machine Learning (e.g., 10-315). Law of Computer Technology 17-562, 17-662, 17-762 or Patents, Licensing, and Innovation 19-473, 19-673 are helpful but not required.

11-441 Machine Learning with Graphs: Fall and Spring: 9 units
Graphs offer a natural way to represent complex relationships among objects of all kinds. Neural network learning with graphs has become important in both academic research and industrial applications. This course (for graduate and undergraduate students who meet the prerequisites) offers a mixture of fundamental concepts, algorithms, basic and advanced models, and broad applications, ranging from social popularity analysis and knowledge graph reasoning to deep learning for solving NP-complete problems.
Prerequisites: 15-213 and (21-241 or 21-341) and 21-325 and (10-701 or 10-601)

Course Website: https://cmu-ml4graph.github.io/s2024/

11-442 Search Engines: Fall: 9 units
This course studies the theory, design, and implementation of text-based search engines. The core components include statistical characteristics of text, representation of information needs and documents, several important retrieval models, and experimental evaluation. The course also covers common elements of commercial search engines, for example, integration of diverse search engines into a single search service ("federated search", "vertical search"), personalized search results, diverse search results, and sponsored search. The software architecture components include design and implementation of large-scale, distributed search engines.
Prerequisites: (36-225 or 15-259 or 21-325 or 36-218) and 15-210 Min. grade C and 15-213 Min. grade C and 21-241
Course Website: http://boston.lti.cs.cmu.edu/classes/11-642/

11-485 Introduction to Deep Learning: Intermittent: 9 units
Neural networks have increasingly taken over various AI tasks, and currently produce the state of the art in many AI tasks ranging from computer vision and planning for self-driving cars to playing computer games. Basic knowledge of NNs, known currently in the popular literature as "deep learning", familiarity with various formalisms, and knowledge of tools, is now an essential requirement for any researcher or developer in most AI and NLP fields. This course is a broad introduction to the field of neural networks and their "deep" learning formalisms. The course traces some of the development of neural network theory and design through time, leading quickly to a discussion of various network formalisms, including simple feedforward, convolutional, recurrent, and probabilistic formalisms, the rationale behind their development, and challenges behind learning such networks and various proposed solutions. We subsequently cover various extensions and models that enable their application to various tasks such as computer vision, speech recognition, machine translation and playing games. Instruction Unlike prior editions of 11-785, the instruction will primarily be through instructor lectures, and the occasional guest lecture. Evaluation Students will be evaluated based on weekly continuous-evaluation tests, and their performance in assignments and a final course project. There will be six hands-on assignments, requiring both low-level coding and toolkit-based implementation of neural networks, covering basic MLP, convolutional and recurrent formalisms, as well as one or more advanced tasks, in addition to the final project.
Prerequisites: 15-112 and 21-120 and 21-241

11-488 Concepts in Digital Multimedia and Cyber Forensics: Spring: 12 units
This course covers the use of computational methods in crime investigation (forensics) and prevention (intelligence). In almost all areas of forensics and intelligence, computational methods continue to aid, and sometimes entirely replace, human expertise in tracking crime. This is desirable since automation can address the problems associated with scale and global crime linkage through diverse data computational tools can potentially overcome and surpass human capabilities for crime investigation. This course is of a cross-disciplinary nature. It amalgamates knowledge from criminology, forensic sciences, computer science, statistics, signal processing, machine learning, AI, psychology, medicine and many other fields. Students from all departments and schools are welcome to take this course.

Course Website: https://forensics-ai.github.io/gh-syllabus/

11-490 LTI Minor Project - Seniors: All Semesters: 12 units
No course description provided.

11-492 Speech Technology for Conversational AI: Spring: 12 units
This course provides both practical and theoretical knowledge on how we can leverage speech processing technologies to build a conversational AI system. The course encompasses speech recognition, speaker recognition, speech synthesis, speech enhancement, speech translation, spoken dialogue systems, speech foundation models, and other speech and audio processing tasks. In practical sessions, students will learn to build functional speech recognition and synthesis systems or utilize existing large speech and language models and integrate them to create a speech interface using existing toolkits. The course will also present details of algorithms, techniques, evaluation metrics, and limitations of state-of-the-art speech systems. This course is particularly designed for students who want to learn how to process actual data for real-world applications, applying AI and machine learning techniques while also being aware of the current technology limitations.
Prerequisite: 15-210

11-546 Applied Legal Analytics & Artificial Intelligence: Spring: 12 units
Technological advances are affecting the legal profession and enable innovation by experts proficient in both law and AI technology. This joint course, co-taught by instructors from the University of Pittsburgh School of Law and Carnegie Mellon Universitys Language Technologies Institute, provides a hands-on practical introduction to the fields of artificial intelligence and law, machine learning, and natural language processing as they are being applied to support the work of legal professionals, researchers, and administrators, such as extracting semantic information from legal documents and using it to solve legal problems. Meanwhile, LegalTech companies and startups have been tapping into the industrys need to make large-scale document analysis tasks more efficient, and to use predictive analytics for better decision making. This course is intended to bring students of law and technical disciplines together into a collaborative classroom setting to learn about the technologies at the intersection of law and AI through lectures and programming exercises, as well as gain practical experience through collaborative project work. Topics in focus include machine learning and natural language applied to legal data, computational models of legal reasoning, and selected legal issues that relate to AI technologies. Students should come from either a (pre-) law background with a strong interest in gaining practical experience with legal analytics, or from a technical discipline with a equally strong interest in tackling the challenges posed by legal analytics tasks and data.

Course Website: https://luimagroup.github.io/appliedlegalanalytics/

11-590 LTI Minor Project - Advanced: All Semesters: 12 units
No course description provided.

11-603 Python for Data Science: Summer: 12 units
Students learn the concepts, techniques, skills, and tools needed for developing programs in Python. Core topics include types, variables, functions, iteration, conditionals, data structures, classes, objects, modules, and I/O operations. Students get an introductory experience with several development environments, including Jupyter Notebook, as well as selected software development practices, such as test-driven development, debugging, and style. Course projects include real-life applications on enterprise data and document manipulation, web scraping, and data analysis.

Course Website: https://canvas.andrew.cmu.edu

11-624 Human Language for Artificial Intelligence: Fall: 12 units
An enduring aspect of the quest to build intelligent machines is the challenge of human language. This course introduces students with a background in computer science and a research interest in artificial intelligence fields to the structure of natural language, from sound to society. It covers phonetics (the physical aspects of speech), phonology (the sound-structure of language), morphology (the structure of words), morphosyntax (the use of word and phrase structure to encode meaning), syntactic formalisms (using finite sets of production rules to characterize infinite configurations of structure), discourse analysis and pragmatics (language in discourse and communicative context), and sociolinguistics (language in social context and social meaning). Evaluation is based on seven homework assignments, a midterm examination, and a final examination.

11-630 MCDS Practicum Internship: Summer
The MCDS Practicum course is used for recording CDS students summer internships for the MCDS Program.

11-639 Designining Around Patents on Machine Learning and NLP Technology: Spring: 12 units
This course uses Machine Learning and Natural Language Processing as vehicles to teach principles in designing software to avoid patents. After introducing students to the basics of patents, we investigate how to use students software skills to design around patents that is, create new technology that avoids a patent while maintaining some, or even all, of the performance and value of the patented technology. Designing around a patent can be viewed as a puzzle that requires technical skill, understanding the business value of technology, knowledge of patents, and creativity. Students will also be able to help design patents that cannot be easily designed-around. Not only does this add a valuable new dimension to the students skill set, the course material is organized as a vehicle for refining knowledge of ML and NLP techniques. We will practice by designing around patents on well-known ML and NLP algorithms. Students study the basic algorithm, learn the patents that cover those algorithms, and then experiment with software modifications that avoid the patent while preserving as much of the algorithms performance as possible. In essence, students will view the presence of particular patents as a design constraints, akin to designing for limited memory, bandwidth, or processor speed. Students must have already taken courses in Natural Language Processing (e.g., 11-411) and Machine Learning (e.g., 10-315). Law of Computer Technology 17-562, 17-662, 17-762 or Patents, Licensing, and Innovation 19-473, 19-673 are helpful but not required.

11-646 Applied Legal Analytics & Artificial Intelligence: Spring: 12 units
Technological advances are affecting the legal profession and enable innovation by experts proficient in both law and AI technology. This joint course, co-taught by instructors from the University of Pittsburgh School of Law and Carnegie Mellon Universitys Language Technologies Institute, provides a hands-on practical introduction to the fields of artificial intelligence and law, machine learning, and natural language processing as they are being applied to support the work of legal professionals, researchers, and administrators, such as extracting semantic information from legal documents and using it to solve legal problems. Meanwhile, LegalTech companies and startups have been tapping into the industrys need to make large-scale document analysis tasks more efficient, and to use predictive analytics for better decision making. This course is intended to bring students of law and technical disciplines together into a collaborative classroom setting to learn about the technologies at the intersection of law and AI through lectures and programming exercises, as well as gain practical experience through collaborative project work. Topics in focus include machine learning and natural language applied to legal data, computational models of legal reasoning, and selected legal issues that relate to AI technologies. Students should come from either a (pre-) law background with a strong interest in gaining practical experience with legal analytics, or from a technical discipline with a equally strong interest in tackling the challenges posed by legal analytics tasks and data.

Course Website: https://luimagroup.github.io/appliedlegalanalytics/

11-661 Language and Statistics: Fall: 12 units
Language technologies (search, text mining, information retrieval, speech recognition, machine translation, question answering, biological sequence analysis...) are at the forefront of this century's information revolution. In addition to their use of machine learning, these technologies rely centrally on classic statistical estimation techniques. Yet most CS and engineering undergraduate programs do not prepare students in this area beyond an introductory prob and amp;stats course. This course is designed to plug this hole. The goal of "Language and Statistics" is to ground the data-driven techniques used in language technologies in sound statistical methodology. We start by formulating various language technology problems in both an information theoretic framework (the source-channel paradigm) and a Bayesian framework (the Bayes classifier). We then discuss the statistical properties of words, sentences, documents and whole languages, and the computational formalisms used to represent language. These discussions naturally lead to specific concepts in statistical estimation. Topics include: Zipf's distribution and type-token curves; point estimators, Maximum Likelihood estimation, bias and variance, sparseness, smoothing and clustering; interpolation, shrinkage, and backoff; entropy, cross entropy and mutual information; decision tree models applied to language; latent variable models and the EM algorithm; hidden Markov models; exponential models and maximum entropy; semantic modeling and dimensionality reduction; probabilistic context-free grammars and syntactic language models. The course is designed for LTI and amp; SCS graduate students, but others are welcome. CS UG upperclassmen who've taken it have done well, though they found it challenging. The 11-661 version does not require the course project. Prerequisites: Strong quantitative aptitude. Comfort with basic UG-level probability. Some programming skill.

Course Website: http://www.cs.cmu.edu/~roni/11661/

11-667 Large Language Models Methods and Application: Fall: 12 units
This course provides a broad foundation for understanding, working with, and adapting existing tools and technologies in the area of Large Language Models like BERT, T5, GPT, and others. It begins with a short history of the area of language models and quickly transitions to a broad survey of the area, offering exposure to the gamut of topics including systems, data, data filtering, training objectives, RLHF/instruction tuning, ethics, policy, evaluation, and other human facing issues. Students will delve into Transformer architectures more broadly and how they work, as well as exploring the reasons why they are better than LSTM-based seq2seq, decoding strategies, etc. Students will learn through readings and hands-on assignments where they will explore techniques for pretraining, attention, prompting, etc. They will then apply these skills in a semester-long course project, making use of locally sourced model instances that offer the opportunity to explore behind the curtain of commercial APIs.
Prerequisites: 11-711 or 11-785 or 11-685 or 10-701 or 10-601

11-696 MIIS Capstone Planning Seminar: Spring: 6 units
The MIIS Capstone Planning Seminar prepares students to complete the MIIS Capstone Project in the following semester. Students are organized into teams that will work together to complete the capstone project. They define project goals, requirements, success metrics, and deliverables; and they identify and acquires data, software, and other resources required for successful completion of the project. The planning seminar must be completed in the semester prior to taking the capstone project.

11-697 Introduction to Question Answering with Large Language Models: Fall: 12 units
This course is designed to be accessible to Masters and advanced undergraduate students who seek the basic skills necessary to implement practical Question Answering (QA) applications using Large Language Models (LLMs) in specific information domains. The syllabus includes learning materials on the core concepts of QA and LLMs, and how they are applied in closed commercial systems (e.g. ChatGPT) as well as open systems (e.g. Llama, T5). Students complete a set of hands-on exercises in Python that develop skills in applying LLMs for various open-source QA datasets. The course is also a prerequisite for 11-797 Question Answering (an advanced project-oriented course).

Course Website: https://www.cs.cmu.edu/~ehn/11-697/

11-711 Advanced Natural Language Processing: Fall: 12 units
Advanced natural language processing is an introductory graduate-level course on natural language processing aimed at students who are interested in doing cutting-edge research in the field. In it, we describe fundamental tasks in natural language processing such as syntactic, semantic, and discourse analysis, as well as methods to solve these tasks. The course focuses on modern methods using neural networks, and covers the basic modeling and learning algorithms required therefore. The class culminates in a project in which students attempt to reimplement and improve upon a research paper in a topic of their choosing.

11-716 Graduate Seminar on Dialog Processing: All Semesters: 6 units
Dialog systems and processes are becoming an increasingly vital area of interest both in research and in practical applications. The purpose of this course will be to examine, in a structured way, the literature in this area as well as learn about ongoing work. The course will cover traditional approaches to the problem, as exemplified by the work of Grosz and Sidner, as well as more recent work in dialog, discourse and evaluation, including statistical approaches to problems in the field. We will select several papers on a particular topic to read each week. While everyone will do all readings, a presenter will be assigned to overview the paper and lead the discussion. On occasion, a researcher may be invited to present their own work in detail and discuss it with the group. A student or researcher taking part in the seminar will come away with a solid knowledge of classic work on dialog, as well as familiarity with ongoing trends.

11-721 Grammars and Lexicons: All Semesters: 12 units
Grammars and Lexicons is an introductory graduate course on linguistic data analysis and theory, focusing on methodologies that are suitable for computational implementations. The course covers major syntactic and morphological phenomena in a variety of languages. The emphasis will be on examining both the diversity of linguistic structures and the constraints on variation across languages. Students will be expected to develop and defend analyses of data, capturing linguistic generalizations and making correct predictions within and across languages. The goal is for students to become familiar with the range of phenomena that occur in human languages so that they can generalize the insights into the design of computational systems. The theoretical framework for syntactic and lexical analysis will be Lexical Functional Grammar. Grades will be based on problem sets and take-home exams.

11-722 Grammar Formalisms: Intermittent: 12 units
The goal of this course is to familiarize students with grammar formalisms that are commonly used for research in computational lingusitics, language technologies, and lingusitics. We hope to have students from a variety disciplines (linguistics, computer science, psychology, modern languages, philosophy) in order to cover a broad perspective in class discussions. Comparison of formalisms will lead to a deeper understanding of human language and natural language processing algorithms. The formalisms will include: Head Driven Phrase Structure Grammar, Lexical Functional Grammar, Tree Adjoining Grammar and Categorial Grammar. If time permits, we will cover Penn Treebank, dependency grammar, and Construction Grammar. We will cover the treatment of basic syntactic and semantic phenomena in each formalism, and will also discuss algorithms for parsing and generating sentences for each formalism. If time permits, we may discuss formal language theory and generative capacity. The course is taught jointly by the following faculty of the Language Technologies Institute: Alan Black Alon Lavie Lori Levin (main coordinator)

11-724 Human Language for Artificial Intelligence: Fall: 12 units
An enduring aspect of the quest to build intelligent machines is the challenge of human language. This course introduces students with a background in computer science and a research interest in artificial intelligence fields to the structure of natural language, from sound to society. It covers phonetics (the physical aspects of speech), phonology (the sound-structure of language), morphology (the structure of words), morphosyntax (the use of word and phrase structure to encode meaning), syntactic formalisms (using finite sets of production rules to characterize infinite configurations of structure), discourse analysis and pragmatics (language in discourse and communicative context), and sociolinguistics (language in social context and social meaning). Evaluation is based on seven homework assignments, a midterm examination, and a final examination.

Course Website: http://www.lti.cs.cmu.edu/Courses/11-724-desc.htm

11-731 Machine Translation and Sequence-to-Sequence Models: Spring: 12 units
Instructors: Graham Neubig. Prerequisites: This course has no official pre-requisites, although 11-711 "Algorithms for NLP" or 10-701 "Machine Learning" would be helpful. Course Description: Machine Translation and Sequence-to-Sequence Models is an introductory graduate-level course surveying the primary approaches and methods for developing systems to translate between human languages, or other sequential data. The main objective of the course is to obtain basic understanding and implementation skills for modern methods for MT and sequence transduction, including how to design models, how to learn the model parameters, how to search for the best output, and how to create training data. The course will focus on machine translation, but also briefly cover tasks such as dialog response generation, image caption generation, and others.

11-737 Multilingual Natural Language Processing.: Fall: 12 units
11737 Multilingual Natural Language Processing is an advanced graduate-level course on natural language processing techniques applicable to many languages. Students who take this course should be able to develop linguistically motivated solutions to core and applied NLP tasks for any language. This includes understanding and mitigating the difficulties posed by lack of data in low-resourced languages or language varieties, and the necessity to model particular properties of the language of interest such as complex morphology or syntax. The course will introduce modeling solutions to these issues such as multilingual or cross-lingual methods, linguistically informed NLP models, and methods for effectively bootstrapping systems with limited data or human intervention. The project work will involve building an end-to-end NLP pipeline in a language you don't know.

Course Website: https://www.cs.cmu.edu/~leili/course/11737mnlp23fa/

11-739 Designing Around Patents on Machine Learning and NLP Technology: Spring: 12 units
This course uses Machine Learning and Natural Language Processing as vehicles to teach principles in designing software to avoid patents. After introducing students to the basics of patents, we investigate how to use students software skills to design around patents that is, create new technology that avoids a patent while maintaining some, or even all, of the performance and value of the patented technology. Designing around a patent can be viewed as a puzzle that requires technical skill, understanding the business value of technology, knowledge of patents, and creativity. Students will also be able to help design patents that cannot be easily designed-around. Not only does this add a valuable new dimension to the student's skill set, the course material is organized as a vehicle for refining knowledge of ML and NLP techniques. We will practice by designing around patents on well-known ML and NLP algorithms. Students study the basic algorithm, learn the patents that cover those algorithms, and then experiment with software modifications that avoid the patent while preserving as much of the algorithm's performance as possible. In essence, students will view the presence of particular patents as a design constraints, akin to designing for limited memory, bandwidth, or processor speed. Students must have already taken courses in Natural Language Processing (e.g., 11-411) and Machine Learning (e.g., 10-315). Law of Computer Technology 17-562, 17-662, 17-762 or Patents, Licensing, and Innovation 19-473, 19-673 are helpful but not required.

11-741 Machine Learning with Graphs: Fall and Spring: 12 units
Graphs offer a natural way to represent complex relationships among objects of all kinds. Neural network learning with graphs has become important in both academic research and industrial applications. This course (for graduate and undergraduate students who meet the prerequisites) offers a mixture of fundamental concepts, algorithms, basic and advanced models, and broad applications, ranging from social popularity analysis and knowledge graph reasoning to deep learning for solving NP-complete problems.
Prerequisites: 15-213 and (21-241 or 21-341) and 21-325 and (10-601 or 10-701)

Course Website: https://cmu-ml4graph.github.io/s2024/

11-747 Neural Networks for NLP: All Semesters: 12 units
Neural networks provide powerful new tools for modeling language, and have been used both to improve the state-of-the-art in a number of tasks and to tackle new problems that were not easy in the past. This class will start with a brief overview of neural networks, then spend the majority of the class demonstrating how to apply neural networks to natural language problems. Each section class will introduce a particular problem or phenomenon in natural language, describe why it is difficult to model, and demonstrate several models that were designed to tackle this problem. In the process of doing so, the class will cover different techniques that are useful in creating models, including handling variably sized and structured sentences, efficient handling of large data, semi-supervised and unsupervised learning, structured prediction, and multilingual modeling. There are no official pre-requisites, but a natural language processing course such as 11-411, 11-611, or 11-711, or other experience with implementing natural language processing models is highly recommended.

11-751 Speech Recognition and Understanding: All Semesters: 12 units
The technology to allow humans to communicate by speech with machines or by which machines can understand when humans communicate with each other is rapidly maturing. This course provides an introduction to the theoretical tools as well as the experimental practice that has made the field what it is today. We will cover theoretical foundations, essential algorithms, major approaches, experimental strategies and current state-of-the-art systems and will introduce the participants to ongoing work in representation, algorithms and interface design. This course is suitable for graduate students with some background in computer science and electrical engineering, as well as for advanced undergraduates. Prerequisites: Sound mathematical background, knowledge of basic statistics, good computing skills. No prior experience with speech recognition is necessary. This course is primarily for graduate students in LTI, CS, Robotics, ECE, Psychology, or Computational Linguistics. Others by prior permission of instructor.

11-752 Speech II: Phonetics, Prosody, Perception and Synthesis: Spring: 12 units
The goal of the course is to give the student basic knowledge from several fields that is necessary in order to pursue research in automatic speech processing. The course will begin with a study of the acoustic content of the speech signal. The students will use the spectrographic display to examine the signal and discover its variable properties. Phones in increasingly larger contexts will be studied with the goal of understanding coarticulation. Phonological rules will be studied as a contextual aid in understanding the spectrographic display. The spectrogram will then serve as a first introduction to the basic elements of prosody. Other displays will then be used to study the three parts of prosody: amplitude, duration, and pitch. Building on these three elements, the student will then examine how the three interact in careful and spontaneous speech. Next, the students will explore perception. Topics covered will be: physical aspects of perception, psychological aspects of perception, testing perception processes, practical applications of knowledge about perception. The second part of this course will cover all aspects of speech synthesis. Students need only have a basic knoweldge of speech and language processing. Some degree of programming and statistical modelling will be beneficial, but not required. Taught every other year

11-755 Machine Learning for Signal Processing: Fall: 12 units
Signal Processing is the science that deals with extraction of information from signals of various kinds. This has two distinct aspects and #8212; characterization and categorization. Traditionally, signal characterization has been performed with mathematically-driven transforms, while categorization and classification are achieved using statistical tools. Machine learning aims to design algorithms that learn about the state of the world directly from data. A increasingly popular trend has been to develop and apply machine learning techniques to both aspects of signal processing, often blurring the distinction between the two. This course discusses the use of machine learning techniques to process signals. We cover a variety of topics, from data driven approaches for characterization of signals such as audio including speech, images and video, and machine learning methods for a variety of speech and image processing problems.

11-761 Language and Statistics: Fall: 12 units
Language technologies (search, text mining, information retrieval, speech recognition, machine translation, question answering, biological sequence analysis...) are at the forefront of this century's information revolution. In addition to their use of machine learning, these technologies rely centrally on classic statistical estimation techniques. Yet most CS and engineering undergraduate programs do not prepare students in this area beyond an introductory prob and amp;stats course. This course is designed to plug this hole. The goal of "Language and Statistics" is to ground the data-driven techniques used in language technologies in sound statistical methodology. We start by formulating various language technology problems in both an information theoretic framework (the source-channel paradigm) and a Bayesian framework (the Bayes classifier). We then discuss the statistical properties of words, sentences, documents and whole languages, and the computational formalisms used to represent language. These discussions naturally lead to specific concepts in statistical estimation. Topics include: Zipf's distribution and type-token curves; point estimators, Maximum Likelihood estimation, bias and variance, sparseness, smoothing and clustering; interpolation, shrinkage, and backoff; entropy, cross entropy and mutual information; decision tree models applied to language; latent variable models and the EM algorithm; hidden Markov models; exponential models and maximum entropy; semantic modeling and dimensionality reduction; probabilistic context-free grammars and syntactic language models. The course is designed for LTI and amp; SCS graduate students, but others are welcome. CS UG upperclassmen who've taken it have done well, though they found it challenging. The 11-661 version does not require the course project. Prerequisites: Strong quantitative aptitude. Comfort with basic UG-level probability. Some programming skill.

Course Website: http://www.cs.cmu.edu/~roni/11761/

11-762 Language and Statistics II: Fall: 12 units
This course will cover modern empirical methods in natural language processing. It is designed for language technologies students who want to understand statistical methodology in the language domain, and for machine learning students who want to know about current problems and solutions in text processing. Students will, upon completion, understand how statistical modeling and learning can be applied to text, be able to develop and apply new statistical models for problems in their own research, and be able to critically read papers from the major related conferences (EMNLP and ACL). A recurring theme will be the tradeoffs between computational cost, mathematical elegance, and applicability to real problems. The course will be organized around methods, with concrete tasks introduced throughout. The course is designed for SCS graduate students. Prerequisite: Language and Statistics (11-761) or permission of the instructor. Recommended: Algorithms for Natural Language Processing (11-711), Machine Learning (15-681, 15-781, or 11-746).
Prerequisite: 11-761

11-763 Structured Prediction for Language and other Discrete Data: Fall: 12 units
This course seeks to cover statistical modeling techniques for discrete, structured data such as text. It brings together content previously covered in Language and Statistics 2 (11-762) and Information Extraction (10-707 and 11-748), and aims to define a canonical set of models and techniques applicable to problems in natural language processing, information extraction, and other application areas. Upon completion, students will have a broad understanding of machine learning techniques for structured outputs, will be able to develop appropriate algorithms for use in new research, and will be able to critically read related literature. The course is organized around methods, with example tasks introduced throughout.

Course Website: http://www.cs.cmu.edu/~nasmith/SPFLODD/

11-776 Multimodal Affective Computing: Fall: 12 units
Humans are highly social creatures and have evolved complex mechanisms for signaling information about their thoughts, feelings, and intentions (both deliberately and reflexively). In turn, humans have also evolved complex mechanisms for receiving these signals and inferring the thoughts, feelings, and intentions of others. Proper understanding of human behavior, in all its nuance, requires careful consideration and integration of verbal, vocal, and visual information. These communication dynamics have long been studied in psychology and other social sciences. More recently, the field of multimodal affective computing has sought to enhance these studies using techniques from computer science and artificial intelligence. Common topics of study in this field include affective states, cognitive states, personality, psychopathology, social processes, and communication. As such, multimodal affective computing has broad applicability in both scientific and applied settings ranging from medicine and education to robotics and marketing. The objectives of this course are: (1) To give an overview of the components of human behavior (verbal, vocal, and visual) and the computer science areas that measure them (NLP, speech processing, and computer vision) (2) To provide foundational knowledge of psychological constructs commonly studied in multimodal affective computing (e.g., emotion, personality, and psychopathology) (3) To provide practical instruction on using statistical tools to study research hypotheses (4) To provide information about computational predictive models that integrate multimodal information from the verbal, vocal, and visual modalities (5) To give students practical experience in the computational study of human behavior and psychological constructs through an in-depth course project

11-777 Multimodal Machine Learning: Fall: 12 units
Multimodal machine learning (MMML) is a vibrant multi-disciplinary research field which addresses some of the original goals of artificial intelligence by integrating and modeling multiple communicative modalities, including linguistic, acoustic and visual messages. With the initial research on audio-visual speech recognition and more recently with language vision projects such as image and video captioning, this research field brings some unique challenges for multimodal researchers given the heterogeneity of the data and the contingency often found between modalities. The course will present the fundamental mathematical concepts in machine learning and deep learning relevant to the five main challenges in multimodal machine learning: (1) multimodal representation learning, (2) translation and amp; mapping, (3) modality alignment, (4) multimodal fusion and (5) co-learning. These include, but not limited to, multimodal auto-encoder, deep canonical correlation analysis, multi-kernel learning, attention models and multimodal recurrent neural networks. We will also review recent papers describing state-of-the-art probabilistic models and computational algorithms for MMML and discuss the current and upcoming challenges. The course will discuss many of the recent applications of MMML including multimodal affect recognition, image and video captioning and cross-modal multimedia retrieval. This is a graduate course designed primarily for PhD and research master students at LTI, MLD, CSD, HCII and RI; others, for example (undergraduate) students of CS or from professional master programs, are advised to seek prior permission of the instructor. It is required for students to have taken an introduction machine learning course such as 10-401, 10-601, 10-701, 11-663, 11-441, 11-641 or 11-741. Prior knowledge of deep learning is recommended."

Course Website: https://piazza.com/cmu/fall2018/11777/home

11-792 Intelligent Information Systems Project - HEINZ STUDENTS ONLY: Spring: 12 units
The Software Engineering for IS sequence combines classroom material and assignments in the fundamentals of software engineering (11-791) with a self-paced, faculty-supervised directed project (11-792). The two courses cover all elements of project design, implementation, evaluation, and documentation. Students may elect to take only 11-791; however, if both parts are taken, they should be taken in proper sequence. Prerequisite: 11-791. The course is required for VLIS students.
Prerequisites: 11-791 or 15-393

11-801 Quantitative Evaluation of Language Technologies: Spring: 12 units
Evaluating NLP models for properties like quality, fluency, safety, or revenue generation is a fundamental part of model development in research and engineering contexts. This course will present fundamental principles of evaluation, focusing on both offline contexts such as benchmark datasets and online environments such as production systems. Material will be organized into two parts. The first part will focus on measurement of system decisions, covering the principles of metric design (i.e., what makes a metric appropriate for a given NLP task), data elicitation (i.e., how can we gather data associated with what we are trying to measure), and modeling system properties (i.e., how can we formally model the properties like quality). The second part will focus on comparing systems given a set of measured values. We will cover dataset construction and hypothesis testing in both offline and online contexts. The course will include lectures from external researchers and practitioners using evaluation techniques to audit systems, design new benchmarks, and deploy production models.

11-824 Subword Modeling: Intermittent: 12 units
The goal of this course is to lead students to engage broadly with the existing NLP and computational linguistics research on subword modeling and develop new computational approaches to problems in morphology, orthography, and phonology. In addition to three other miniprojects, students will be expected to produce one piece of research that can be developed into a conference or workshop paper (though submission is not a course requirement). The paper should be suitable for the Phonology, Morphology, and Word Segmentation tracks of the *ACL conferences, the SIGMORPHON workshop, Coling, or LREC.
Prerequisites: 11-711 or 11-611 or 11-411

11-851 Talking to Robots: Fall
Household robots need to move beyond simple programmed tasks like those a roomba, and become full-fledged digital assistants. A robotic agent that exists (physically) in the world, gains access to rich and personalized knowledge of its environment. How much do things weigh? What's fragile? Where you store the extra chocolates that you don't want anyone to find because they are just for you. Building an agent that can accomplish tasks requires the integration of a diverse set of technologies and engineering. Language models, SLAM, semantic mapping, task planning, understanding affordances, and end effector control. This course will cover both foundational works in grounding language to action and analyze (or reimplement) state-of-the-art Large Language Model based task planners.

Course Website: https://talkingtorobots.com/11-851/

11-868 Large Language Model Systems: Spring: 12 units
Recent progress of Artificial Intelligence has been largely driven by advances in large language models (LLMs) and other generative methods. These models are often very large (e.g. 175 billion parameters for GPT3) and requires increasingly larger data to train (e.g. 300 billion tokens for ChatGPT). Training, serving, fine-tuning, and evaluating LLMs require sophisticated engineering with modern hardware and software stacks. Developing scalable systems for large language models is critical to advance AI. In this course, students will learn the essential skills to design and implement LLM systems. This includes algorithms and system techniques to efficiently train LLMs with huge data, efficient embedding storage and retrieval, data efficient fine-tuning, communication efficient algorithms, efficient implementation of reinforcement learning with human feedback, acceleration on GPU and other hardware, model compression for deployment, and online maintenance. We will cover the latest advances about LLM systems in machine learning, natural language processing, and system research.
Prerequisites: 11-711 and 11-785

Course Website: https://llmsystem.github.io/

11-877 Advanced Topics in Multimodal Machine Learning: Spring
This course is designed to be a graduate-level course covering recent research papers in multimodal machine learning, a vibrant multi-disciplinary research field which studies modeling, alignment, and fusion of heterogeneous data from multiple modalities, including language, vision, and acoustic. The course will focus on discussions and understanding of recent research papers in this field. Students are expected to have already taken 11-777 Multimodal Machine Learning course or have equivalent research experience (instructor approval required). The course is planned for 6 credit units. Optionally, students can register for 12 credit units, with the expectation to do a comprehensive research project as part of the semester. These course projects are expected to be done in teams, with the research topic to be in the realm of multimodal machine learning and pre-approved by the course instructors.
Prerequisite: 11-777 Min. grade C

11-891 Neural Code Generation: Spring
This course is a graduate-level course introducing research topics in neural code generation: modeling and synthesizing programs using deep-learning methods, with an emphasis on neural language models. The course covers (1) foundational advances in neural language models that are relevant to code generation (2) code-specific formal methods for training, inference, and evaluation and (3) research frontiers such as long document lengths, domain adaptation, and downstream interactive and production-ready uses of the final code generation models. The course combines lectures and paper discussions, as well as a final research project for students taking the course for 12 units. This is a graduate course designed primarily for PhD and research master students at LTI, S3D, MLD, CSD, HCII and RI; others, for example (undergraduate) students of CS or from professional master programs, are advised to seek prior permission of the instructors. It is required for students to have taken an introductory ML course or an ML project-based course such as 10-401, 10-601, 10-701, 11-663, 11-441, 11-641, 11-667, 11-741, 11-711, or 11-777. Prior knowledge of deep learning is recommended.

11-927 MIIS Capstone Project: Fall: 36 units
The capstone project course is a group-oriented demonstration of student skill in one or more areas covered by the degree. Typically the result of the capstone project is a major software application. The capstone project course consists of two components. The classroom component guides students in project planning, team management, development of requirements and design specifications, and software tools for managing group-oriented projects. The lab component provides project-specific technical guidance and expertise, for example in the development of a question answering system, dialog, or sentiment analysis application. Thus, each project receives two types of supervision, often from two separate members of the faculty.

Machine Learning Courses

10-301 Introduction to Machine Learning: Fall and Spring: 12 units
Machine Learning is concerned with computer programs that automatically improve their performance through experience (e.g., programs that learn to recognize human faces, recommend music and movies, and drive autonomous robots). This course covers the theory and practical algorithms for machine learning from a variety of perspectives. We cover topics such as decision tree learning, neural networks, statistical learning methods, unsupervised learning and reinforcement learning. The course covers theoretical concepts such as inductive bias, the PAC learning framework, Bayesian learning methods, and Occam's Razor. Programming assignments include hands-on experiments with various learning algorithms. This course is designed to give a graduate-level student a thorough grounding in the methodologies, technologies, mathematics and algorithms currently needed by people who do research in machine learning. 10-301 and 10-601 are identical. Undergraduates must register for 10-301 and graduate students must register for 10-601. 10-301 is recommended for undergraduates who are not SCS majors. (SCS majors should instead take 10-315.)
Prerequisites: 15-122 Min. grade C and (15-151 Min. grade C or 21-128 Min. grade C or 21-127 Min. grade C) and (36-217 Min. grade C or 21-325 Min. grade C or 36-235 Min. grade C or 15-359 Min. grade C or 36-218 Min. grade C or 36-225 Min. grade C or 36-220 Min. grade C or 15-259 Min. grade C or 36-219 Min. grade C)

Course Website: http://mlcourse.org

10-315 Introduction to Machine Learning (SCS Majors): Fall and Spring: 12 units
Machine learning is a subfield of computer science with the goal of exploring, studying, and developing learning systems, methods, and algorithms that can improve their performance with learning from data. This course is designed to give undergraduate students a one-semester-long introduction to the main principles, algorithms, and applications of machine learning and is specifically designed for the SCS undergrad majors. After completing the course, students will be able to: *select and apply an appropriate supervised learning algorithm for classification problems and understand its underlying assumptions (e.g., naive Bayes, perceptron, support vector machine, logistic regression). *select and apply an appropriate supervised learning algorithm for regression problems and understand its underlying assumptions (e.g., linear regression, ridge regression). *recognize different types of unsupervised learning problems, and select and apply appropriate algorithms (e.g., clustering, linear and nonlinear dimensionality reduction). *work with probabilities (Bayes rule, conditioning, expectations, independence), linear algebra (vector and matrix operations, eigenvectors), and calculus (gradients) to derive machine learning methods such as linear regression, naive Bayes, and principal components analysis. *understand machine learning principles such as model selection, overfitting, and underfitting, and techniques such as cross-validation and regularization. *implement machine learning algorithms such as logistic regression via stochastic gradient descent, linear regression (using a linear algebra toolbox), perceptron, or k-means clustering. *run appropriate supervised and unsupervised learning algorithms on real and synthetic data sets and interpret the results.
Prerequisites: 15-122 Min. grade C and (21-128 Min. grade C or 15-151 Min. grade C or 21-127 Min. grade C) and (15-259 Min. grade C or 21-325 Min. grade C or 15-359 Min. grade C or 36-219 Min. grade C or 36-235 Min. grade C or 36-217 Min. grade C or 36-225 Min. grade C or 36-218 Min. grade C) and (21-240 Min. grade C or 21-241 Min. grade C or 21-242 Min. grade C)

Course Website: https://goo.gl/mmR2eL

10-335 Art and Machine Learning: Intermittent: 12 units
ARS, the Latin origin of the word 'art', encompasses both Art and Science. Over time, these two disciplines, once separated, are now converging in various area. One such intersection is the fusion of art and machine learning. In recent years, art has been propelled forward by the rapid advancements in technology and scientific discoveries, while machine learning (ML) stands at the forefront of computer science innovation. The increasing popularity and accessibility of neural network-based AI models have garnered significant attention for the amalgamation of art and ML techniques. This project-based course is designed to introduce the synergy between art and machine learning to a wide range of students, including majoring in art and computer science. We will impart knowledge through examples, technologies, and discussions that bridge the realms of art and machine learning. Students will explore example codes and make creative applications and artworks using ML methods. No prior knowledge of machine learning or experience in art practice is required, but students should have a basic understanding of Python. Additionally, an open-minded approach is essential, as occasionally we will delve into the necessary mathematical foundations and engage in discussions on the conceptual development and artistic value of your projects.

Course Website: https://sites.google.com/view/artml23s

10-403 Deep Reinforcement Learning & Control: Spring: 12 units
This course brings together many disciplines of Artificial Intelligence (including computer vision, robot control, reinforcement learning, language understanding) to show how to develop intelligent agents that can learn to sense the world and learn to act by imitating others, maximizing sparse rewards, and/or satisfying their curiosity.
Prerequisites: 10-401 Min. grade C or 10-315 Min. grade C or 10-301 Min. grade C or 10-601 Min. grade C or 10-701 Min. grade C

Course Website: https://cmudeeprl.github.io/Spring202010403website/

10-405 Machine Learning with Large Datasets (Undergraduate): Spring: 12 units
Large datasets are difficult to work with for several reasons. They are difficult to visualize, and it is difficult to understand what sort of errors and biases are present in them. They are computationally expensive to process, and often the cost of learning is hard to predict - for instance, and algorithm that runs quickly in a dataset that fits in memory may be exorbitantly expensive when the dataset is too large for memory. Large datasets may also display qualitatively different behavior in terms of which learning methods produce the most accurate predictions. This course is intended to provide a student practical knowledge of, and experience with, the issues involving large datasets. Among the issues considered are: scalable learning techniques, such as streaming machine learning techniques; parallel infrastructures such as map-reduce; practical techniques for reducing the memory requirements for learning methods, such as feature hashing and Bloom filters; and techniques for analysis of programs in terms of memory, disk usage, and (for parallel methods) communication complexity. The class will include programming assignments, and a one-month short project chosen by the student. The project will be designed to compare the scalability of variant learning algorithms on datasets. An introductory course in machine learning, like 10-601 or 10-701, is a prerequisite or a co-requisite. If you plan to take this course and 10-601 concurrently please tell the instructor. The course will include several substantial programming assignments, so an additional prerequisite is 15-211, or 15-214, or comparable familiarity with Python and good programming skills.
Prerequisites: (15-211 or 17-214 or 15-214 or 15-210) and (10-401 or 10-301 or 10-715 or 10-701 or 10-315 or 10-601)

Course Website: https://10605.github.io/

10-414 Deep Learning Systems: Algorithms and Implementation: Intermittent: 12 units
The goal of this course is to provide students an understanding and overview of the "full stack" of deep learning systems, ranging from the high-level modeling design of modern deep learning systems, to the basic implementation of automatic differentiation tools, to the underlying device-level implementation of efficient algorithms. Throughout the course, students will design and build from scratch a complete deep learning library, capable of efficient GPU-based operations, automatic differentiation of all implemented functions, and the necessary modules to support parameterized layers, loss functions, data loaders, and optimizers. Using these tools, students will then build several state-of-the-art modeling methods, including convolutional networks for image classification and segmentation, recurrent networks and self-attention models for sequential tasks such as language modeling, and generative models for image generation.
Prerequisites: (15-213 Min. grade C or 15-513 Min. grade C) and (21-240 Min. grade C or 21-241 Min. grade C) and (15-151 Min. grade C or 21-127 Min. grade C or 21-128 Min. grade C) and (10-301 Min. grade C or 10-701 Min. grade C or 10-601 Min. grade C or 10-315 Min. grade C or 10-715 Min. grade C)

10-417 Intermediate Deep Learning: Fall: 12 units
Building intelligent machines that are capable of extracting meaningful representations from data lies at the core of solving many AI related tasks. In the past decade, researchers across many communities, from applied statistics to engineering, computer science and neuroscience, have developed deep models that are composed of several layers of nonlinear processing. An important property of these models is that they can learn useful representations by re-using and combining intermediate concepts, allowing these models to be successfully applied in a wide variety of domains, including visual object recognition, information retrieval, natural language processing, and speech perception. The goal of this course is to introduce students to both the foundational ideas and the recent advances in deep learning. The first part of the course will focus on supervised learning, including neural networks, back-propagation algorithm, convolutional models, recurrent neural networks, and their extensions with applications to image recognition, video analysis, and language modelling. The second part of the course will cover unsupervised learning, including variational autoencoders, sparse-coding, Boltzmann machines, and generative adversarial networks. This course will assume a reasonable degree of mathematical maturity and will require strong programming skills.
Prerequisites: 10-701 Min. grade C or 10-601 Min. grade C or 10-301 Min. grade C or 10-315 Min. grade C or 10-715 Min. grade C

Course Website: https://deeplearning-cmu-10417.github.io

10-418 Machine Learning for Structured Data: Intermittent: 12 units
A key challenge in machine learning is that of structured prediction: taking unstructured data as input and producing a structured output. Structured prediction problems abound throughout application areas such as natural language processing, speech processing, computational biology, computer vision, healthcare, and many others. In this course, we will study modern approaches to structured prediction building on probabilistic graphical models, deep learning, and search. The course will focus on three key aspects: models, inference, and learning. The models we consider will focus on both generative and discriminative models such as Bayesian networks, Markov random fields (MRFs), conditional random fields (CRFs), and deep neural networks including convolutional neural networks (CNNs) and recurrent neural networks (RNNs) and #8212; as well as hybrids of graphical models and neural networks. The course will explore approaches to exact and approximate inference: junction tree algorithm, approximate marginal inference by Markov chain Monte Carlo (MCMC) and variational methods, approximate MAP inference by integer linear programming (ILP) and search. We will explore unsupervised, semi-supervised, and supervised learning using different formulations of the learning problem: MLE, Bayesian inference, structured perceptron, M3Ns, learning to search, and autoencoders. Covered applications will include machine translation, speech recognition, DNA sequence analysis, scene understanding, medical diagnosis. This course is cross-listed as 10-418 and 10-618; students registered for 10-618 will do a course project.
Prerequisites: 10-715 Min. grade C or 10-701 Min. grade C or 10-601 Min. grade C or 10-401 Min. grade C or 10-301 Min. grade C or 10-315 Min. grade C

10-422 Foundations of Learning, Game Theory, and Their Connections: Intermittent: 12 units
In the past decades, researchers have discovered a number of important and deep connections between machine learning theory and algorithmic game theory. This course will explore these connections, both introducing fundamental topics in each area and describing how ideas from each area can shed light on the other.
Prerequisites: (36-218 Min. grade C or 36-217 Min. grade C or 15-259 Min. grade C or 21-325 Min. grade C or 36-225 Min. grade C or 36-219 Min. grade C) and (15-251 Min. grade C or 10-601 Min. grade C or 10-315 Min. grade C or 10-301 Min. grade C) and (21-240 Min. grade C or 21-241 Min. grade C or 21-242 Min. grade C)

10-423 Generative AI: Intermittent: 12 units
From generating images and text to generating music and art, the goal of generative modeling has long been a key challenge for artificial intelligence. This course explores the techniques from machine learning and artificial intelligence that are driving the recent advances in generative modeling and foundation models. Students will understand, develop, and apply state-of-the-art algorithms that enable machines to generate realistic and creative content. Core topics will include: the fundamental mechanisms of learning; how to build generative models and other large foundation models (e.g. transformers for vision and language, diffusion models); how to train such models (pre-training, fine-tuning) and efficiently adapt them (adapters, in-context learning); how to scale up to massive datasets (multi-GPU/distributed optimization); how to employ existing models for everyday use (generating code, coding with a generative model in the loop). Students will also explore the theoretical foundations and empirical attempts to understand their inner workings as well as learn about the ways in which things can go wrong (bias, hallucination, adversarial attacks, data contamination) and ways to combat these problems. Students in the course will develop understanding of modern techniques through implementation, but they will also employ existing libraries and models to explore their generative capabilities and limitations. The course is designed for students who have completed an introductory course in machine learning or deep learning.
Prerequisites: 10-601 Min. grade C or 10-701 Min. grade C or 10-715 Min. grade C or 11-485 Min. grade C or 11-685 Min. grade C or 10-301 Min. grade C or 11-785 Min. grade C or 10-315 Min. grade C

Course Website: https://www.cs.cmu.edu/~mgormley/courses/10423

10-425 Introduction to Convex Optimization: Intermittent: 12 units
As machine learning grows in prominence, so also has optimization become a mainstay for machine learning, particularly techniques for convex optimization. Most learning problems are formulated as optimization of some objective function, sometimes subject to constraints. This course explores the optimization algorithms used to solve these machine learning problems. We characterize the properties of the optimization problems that enable these techniques to be efficient (e.g. convexity, smoothness, linearity, separability) as well as properties that inhibit efficient optimization (e.g. nonconvexity). Core topics include first order methods (gradient descent, subgradient methods, proximal and stochastic gradient descent), duality and linear programming, and second-order/quasi-Newton methods. We also consider advanced techniques ranging from those that have spurred the growth of deep learning (e.g. adaptive gradient methods, momentum) and those that enable large-scale distributed optimization. The course will focus both on theory and practical applications, frequently drawing motivation from examples in machine learning. The course is designed so that a machine learning (ML) course could be taken after or before this one; ML is not a prerequisite. Students will gain the tools to both implement and analyze modern optimization techniques.
Prerequisites: (21-240 Min. grade C or 21-241 Min. grade C) and (21-325 Min. grade C or 36-219 Min. grade C or 36-217 Min. grade C or 15-359 Min. grade C) and (21-254 Min. grade C or 11-485 Min. grade C or 10-315 Min. grade C or 10-301 Min. grade C or 21-256 Min. grade C or 21-259 Min. grade C) and (15-151 Min. grade C or 21-127 Min. grade C) and 15-122 Min. grade C

Course Website: https://www.cs.cmu.edu/~mgormley/courses/10425

10-500 Senior Research Project: All Semesters
Register for this course if you are minoring in Machine Learning. This course is intended for research with a faculty member that would count towards the minor.

10-520 Independent Study: All Semesters
Independent Study intended to work on research with a Machine Learning faculty member.

10-600 Mathematical background for Machine Learning: Fall and Spring: 12 units
This course provides a place for students to practice the necessary mathematical background for further study in machine learning and #8212; particularly for taking 10-601 and 10-701. Topics covered include probability, linear algebra (inner product spaces, linear operators), multivariate differential calculus, optimization, and likelihood functions. The course assumes some background in each of the above, but will review and give practice in each. (It does not provide from-scratch coverage of all of the above, which would be impossible in a course of this length.) Some coding will be required: the course will provide practice with translating the above mathematical concepts into concrete programs. This course supersedes the two mini-courses 10-606 and 10-607.

10-601 Introduction to Machine Learning (Master's): Fall and Spring: 12 units
Machine Learning is concerned with computer programs that automatically improve their performance through experience (e.g., programs that learn to recognize human faces, recommend music and movies, and drive autonomous robots). This course covers the theory and practical algorithms for machine learning from a variety of perspectives. We cover topics such as decision tree learning, neural networks, statistical learning methods, unsupervised learning and reinforcement learning. The course covers theoretical concepts such as inductive bias, the PAC learning framework, Bayesian learning methods, and Occam's Razor. Programming assignments include hands-on experiments with various learning algorithms. This course is designed to give a graduate-level student a thorough grounding in the methodologies, technologies, mathematics and algorithms currently needed by people who do research in machine learning. 10-301 and 10-601 are identical. Undergraduates must register for 10-301 and graduate students must register for 10-601. 10-301 is recommended for undergraduates who are not SCS majors. (SCS majors should instead take 10-315.)
Prerequisites: 15-122 Min. grade C and (21-127 Min. grade C or 21-128 Min. grade C or 15-151 Min. grade C) and (36-219 Min. grade C or 36-218 Min. grade C or 36-217 Min. grade C or 15-259 Min. grade C or 36-220 Min. grade C or 36-235 Min. grade C or 21-325 Min. grade C or 15-359 Min. grade C or 36-225 Min. grade C)

Course Website: http://mlcourse.org

10-605 Machine Learning with Large Datasets: Fall and Spring: 12 units
Large datasets are difficult to work with for several reasons. They are difficult to visualize, and it is difficult to understand what sort of errors and biases are present in them. They are computationally expensive to process, and often the cost of learning is hard to predict - for instance, and algorithm that runs quickly in a dataset that fits in memory may be exorbitantly expensive when the dataset is too large for memory. Large datasets may also display qualitatively different behavior in terms of which learning methods produce the most accurate predictions. This course is intended to provide a student practical knowledge of, and experience with, the issues involving large datasets. Among the issues considered are: scalable learning techniques, such as streaming machine learning techniques; parallel infrastructures such as map-reduce; practical techniques for reducing the memory requirements for learning methods, such as feature hashing and Bloom filters; and techniques for analysis of programs in terms of memory, disk usage, and (for parallel methods) communication complexity. The class will include programming assignments, and a one-month short project chosen by the student. The project will be designed to compare the scalability of variant learning algorithms on datasets. An introductory course in machine learning, like 10-601 or 10-701, is a prerequisite or a co-requisite. If you plan to take this course and 10-601 concurrently please tell the instructor. The course will include several substantial programming assignments, so an additional prerequisite is 15-211, or 15-214, or comparable familiarity with Python and good programming skills.
Prerequisites: (15-211 or 17-214 or 15-210 or 15-214) and (10-601 or 10-401 or 10-715 or 10-701 or 10-301 or 10-315)

Course Website: https://10605.github.io/

10-606 Mathematical Foundations for Machine Learning: Fall: 6 units
This course provides a place for students to practice the necessary mathematical background for further study in machine learning. Topics covered include probability (random variables, modeling with continuous and discrete distributions), linear algebra (inner product spaces, linear operators), and multivariate differential calculus (partial derivatives, matrix differentials). The course assumes some background in each of the above, but will review and give practice in each. (It does not provide from-scratch coverage of all of the above, which would be impossible in a course of this length.) Some coding will be required: the course will provide practice with translating the above mathematical concepts into concrete programs. This course is one of two minis intended to prepare students for further study in machine learning and #8212; particularly for taking 10-601 and 10-701. One of the courses 10-606 focuses on mathematical background, and the other course 10-607 focuses on computational background. Most students take both mini courses, but this is not required. 10-606 is not a prerequisite of 10-607.

10-607 Computational Foundations for Machine Learning: Fall: 6 units
This course provides a place for students to practice the necessary computational background for further study in machine learning. Topics covered include computational complexity, analysis of algorithms, proof techniques, optimization, dynamic programming, recursion, and data structures. The course assumes some background in each of the above, but will review and give practice in each. (It does not provide from-scratch coverage of all of the above, which would be impossible in a course of this length.) Some coding will be required: the course will provide practice with translating the above computational concepts into concrete programs. This course is one of two minis intended to prepare students for further study in machine learning and #8212; particularly for taking 10-601 and 10-701. One of the courses 10-606 focuses on mathematical background, and the other course 10-607 focuses on computational background. Most students take both mini courses, but this is not required. 10-606 is not a prerequisite of 10-607.

10-608 Conversational Machine Learning: Intermittent: 12 units
Machine Learning today is largely about finding patterns in large amounts of data. But as personal devices that interact with us in natural language become ubiquitous (e.g., Siri, Google Now), they open an amazing possibility of letting users teach machines in natural language, similar to how we teach each other. Conversation, as an interface to machine learning systems, opens a new paradigm that both unifies several existing machine learning paradigms (e.g., active learning, supervised learning), but also brings a unique set of advantages and challenges that lie at the intersection of machine learning and natural language processing. This course will be structured as a well-defined mini-challenge (project) course. We will present you with several well-defined open problems and provide you with recently collected datasets that can get you started immediately! But you will be free to define your own problem using that data as well, or come up with your own problem entirely. There are no other constraints, and since this is a new area of research, you can (and should) be creative and as crazy in coming up with methods to tackle them. At the same time, we will provide guidance via readings and class-based hacking sessions. This course is a great way to get introduced to open problems in a collaborative and structured environment. Challenges Building a classifier with zero examples. Telling sequence to sequence models about their mistakes Letting machine learning models ask questions
Prerequisites: 10-715 Min. grade C or 10-601 Min. grade C or 10-401 Min. grade C or 10-701 Min. grade C

10-613 Machine Learning Ethics and Society: Intermittent: 12 units
The practice of Machine Learning (ML) increasingly involves making choices that impact real people and society at large. This course covers an array of ethical, societal, and policy considerations in applying ML tools to high-stakes domains, such as employment, education, lending, criminal justice, medicine, and beyond. We will discuss: (1) the pathways through which ML can lead to or amplify problematic decision-making practices (e.g., those exhibiting discrimination, inscrutability, invasion of privacy, and beyond); (2) recent technological methods and remedies to capture and alleviate these concerns; and (3) the scope of applicability and limitations of technological remedies in the context of several contemporary application domains. The course's primary goals are: (a) to raise awareness about the social, ethical, and policy implications of ML, and (b) to prepare students to critically analyze these issues as they emerge in the ever-expanding use of ML in socially consequential domains.
Prerequisites: 10-315 or 10-601 or 10-715 or 10-701 or 10-301
Course Website: http://www.cs.cmu.edu/~hheidari/mles-spring-23.html

10-617 Intermediate Deep Learning: Fall: 12 units
Building intelligent machines that are capable of extracting meaningful representations from data lies at the core of solving many AI related tasks. In the past decade, researchers across many communities, from applied statistics to engineering, computer science and neuroscience, have developed deep models that are composed of several layers of nonlinear processing. An important property of these models is that they can learn useful representations by re-using and combining intermediate concepts, allowing these models to be successfully applied in a wide variety of domains, including visual object recognition, information retrieval, natural language processing, and speech perception. The goal of this course is to introduce students to both the foundational ideas and the recent advances in deep learning. The first part of the course will focus on supervised learning, including neural networks, back-propagation algorithm, convolutional models, recurrent neural networks, and their extensions with applications to image recognition, video analysis, and language modelling. The second part of the course will cover unsupervised learning, including variational autoencoders, sparse-coding, Boltzmann machines, and generative adversarial networks. This course will assume a reasonable degree of mathematical maturity and will require strong programming skills.
Prerequisites: 10-601 Min. grade C or 10-701 Min. grade C or 10-315 Min. grade C or 10-301 Min. grade C or 10-715 Min. grade C

Course Website: https://deeplearning-cmu-10417.github.io

10-618 Machine Learning for Structured Data: Intermittent: 12 units
A key challenge in machine learning is that of structured prediction: taking unstructured data as input and producing a structured output. Structured prediction problems abound throughout application areas such as natural language processing, speech processing, computational biology, computer vision, healthcare, and many others. In this course, we will study modern approaches to structured prediction building on probabilistic graphical models, deep learning, and search. The course will focus on three key aspects: models, inference, and learning. The models we consider will focus on both generative and discriminative models such as Bayesian networks, Markov random fields (MRFs), conditional random fields (CRFs), and deep neural networks including convolutional neural networks (CNNs) and recurrent neural networks (RNNs) and #8212; as well as hybrids of graphical models and neural networks. The course will explore approaches to exact and approximate inference: junction tree algorithm, approximate marginal inference by Markov chain Monte Carlo (MCMC) and variational methods, approximate MAP inference by integer linear programming (ILP) and search. We will explore unsupervised, semi-supervised, and supervised learning using different formulations of the learning problem: MLE, Bayesian inference, structured perceptron, M3Ns, learning to search, and autoencoders. Covered applications will include machine translation, speech recognition, DNA sequence analysis, scene understanding, medical diagnosis. This course is cross-listed as 10-418 and 10-618; students registered for 10-618 will do a course project.
Prerequisites: 10-301 Min. grade C or 10-715 Min. grade C or 10-701 Min. grade C or 10-601 Min. grade C or 10-315 Min. grade C or 10-401 Min. grade C

10-623 Generative AI: Intermittent: 12 units
From generating images and text to generating music and art, the goal of generative modeling has long been a key challenge for artificial intelligence. This course explores the techniques from machine learning and artificial intelligence that are driving the recent advances in generative modeling and foundation models. Students will understand, develop, and apply state-of-the-art algorithms that enable machines to generate realistic and creative content. Core topics will include: the fundamental mechanisms of learning; how to build generative models and other large foundation models (e.g. transformers for vision and language, diffusion models); how to train such models (pre-training, fine-tuning) and efficiently adapt them (adapters, in-context learning); how to scale up to massive datasets (multi-GPU/distributed optimization); how to employ existing models for everyday use (generating code, coding with a generative model in the loop). Students will also explore the theoretical foundations and empirical attempts to understand their inner workings as well as learn about the ways in which things can go wrong (bias, hallucination, adversarial attacks, data contamination) and ways to combat these problems. Students in the course will develop understanding of modern techniques through implementation, but they will also employ existing libraries and models to explore their generative capabilities and limitations. The course is designed for students who have completed an introductory course in machine learning or deep learning.
Prerequisites: 10-301 Min. grade C or 11-785 Min. grade C or 11-685 Min. grade C or 11-485 Min. grade C or 10-715 Min. grade C or 10-701 Min. grade C or 10-601 Min. grade C or 10-315 Min. grade C

Course Website: https://www.cs.cmu.edu/~mgormley/courses/10423

10-625 Introduction to Convex Optimization: Intermittent: 12 units
As machine learning grows in prominence, so also has optimization become a mainstay for machine learning, particularly techniques for convex optimization. Most learning problems are formulated as optimization of some objective function, sometimes subject to constraints. This course explores the optimization algorithms used to solve these machine learning problems. We characterize the properties of the optimization problems that enable these techniques to be efficient (e.g. convexity, smoothness, linearity, separability) as well as properties that inhibit efficient optimization (e.g. nonconvexity). Core topics include first order methods (gradient descent, subgradient methods, proximal and stochastic gradient descent), duality and linear programming, and second-order/quasi-Newton methods. We also consider advanced techniques ranging from those that have spurred the growth of deep learning (e.g. adaptive gradient methods, momentum) and those that enable large-scale distributed optimization. The course will focus both on theory and practical applications, frequently drawing motivation from examples in machine learning. The course is designed so that a machine learning (ML) course could be taken after or before this one; ML is not a prerequisite. Students will gain the tools to both implement and analyze modern optimization techniques.
Prerequisites: (21-240 Min. grade C or 21-241 Min. grade C) and (36-219 Min. grade C or 21-325 Min. grade C or 36-217 Min. grade C or 15-359 Min. grade C) and (10-315 Min. grade C or 21-259 Min. grade C or 10-301 Min. grade C or 21-256 Min. grade C or 21-254 Min. grade C or 11-485 Min. grade C) and (21-127 Min. grade C or 15-151 Min. grade C) and 15-122 Min. grade C

Course Website: https://www.cs.cmu.edu/~mgormley/courses/10425

10-701 Introduction to Machine Learning: Fall and Spring: 12 units
Machine learning studies the question: "how can we build adaptive algorithms that automatically improve their performance (on a given task) as they acquire more experience?" This can cover a dizzying array of technologies depending on what sort of task we have in mind, and we take to constitute experience. Through this framing, we might view classical statistics problems, like estimating the likelihood that a coin lands on heads as an ML problem: the task is to produce an estimate, and the experience would consist of observations. But ML can also include robotics challenges, where the experience is acquired dynamically as our artificial agent interacts with the real world. Other grand challenges in machine learning relate to personalized medicine, natural language processing, and most recently generating media artifacts like photographs and essays (but don't ask chatGPT to do your homework). This course is designed to give PhD students a solid foundation in the methods, mathematics, and algorithms of modern machine learning. Students entering the class with a pre-existing working knowledge of probability, statistics and algorithms will be at an advantage, but the class has been designed so that anyone with a strong mathematical and computer science background can catch up and fully participate. If you are interested in this topic, but are not a PhD student, or are a PhD student not specializing in machine learning, you might consider the master's level course on Machine Learning, 10-601. This class may be appropriate for MS and undergrad students who are interested in the theory and algorithms behind ML.
Prerequisites: 15-122 Min. grade C and (21-128 Min. grade C or 15-151 Min. grade C or 21-127 Min. grade C) and (21-325 Min. grade C or 36-217 Min. grade C or 36-219 Min. grade C or 36-225 Min. grade C or 36-218 Min. grade C or 15-259 Min. grade C or 15-359 Min. grade C)

Course Website: https://machinelearningcmu.github.io/F23-10701/

10-702 Statistical Machine Learning: Spring: 12 units
Statistical Machine Learning is a second graduate level course in advanced machine learning, assuming that students have taken Machine Learning (10-701) or Advanced Machine Learning (10-715), and Intermediate Statistics (36-705). The term ?statistical? in the title reflects the emphasis on statistical theory and methodology. This course is mostly focused on methodology and theoretical foundations. It treats both the ?art? of designing good learning algorithms and the ?science? of analyzing an algorithm?s statistical properties and performance guarantees. Theorems are presented together with practical aspects of methodology and intuition to help students develop tools for selecting appropriate methods and approaches to problems in their own research. Though computation is certainly a critical component of what makes a method successful, it will not receive the same central focus as methodology and theory. We will cover topics in statistical theory that are important for researchers in machine learning, including consistency, minimax estimation, and concentration of measure. We will also cover statistical topics that may not be covered in as much depth in other machine learning courses, such as nonparametric density estimation, nonparametric regression, and Bayesian estimation.
Prerequisites: (10-705 or 36-705) and (10-701 or 10-715)

Course Website: http://www.stat.cmu.edu/~larry/=sml/

10-703 Deep Reinforcement Learning & Control: Spring: 12 units
This course will cover latest advances in Reinforcement Learning and Imitation learning. This is a fast developing research field and an official textbook is available only for about one fourth of the course material. The rest will be taught from recent research papers. This course brings together many disciplines of Artificial Intelligence to show how to develop intelligent agent that can learn to sense the world and learn to act imitating others or maximizing sparse rewards Particular focus will be given in incorporating visual sensory input and learning suitable visual state representations.
Prerequisites: 10-315 Min. grade B or 10-401 Min. grade B or 10-301 Min. grade B or 10-701 Min. grade B or 10-601 Min. grade B or 10-715 Min. grade B

Course Website: https://cmudeeprl.github.io/703website/

10-707 Advanced Deep Learning: Fall and Spring: 12 units
Models that are capable of extracting complex, hierarchical representations from high-dimensional data lie at the core of solving many ML and AI domains, such as visual object recognition, information retrieval, natural language processing, and speech perception. While the usefulness of such deep learning techniques is undisputed, our understanding of them is still in many ways nascent. The goal of this course is to introduce students to recent and exciting developments (both theoretical and practical) in these methods. This is an advanced graduate course, designed for Masters and Ph.D. level students, and will assume a substantial degree of mathematical maturity. Prerequisite: ML: 10-701 or 10-715, and strong programming skills.
Prerequisites: 10-715 Min. grade C or 10-401 Min. grade C or 10-315 Min. grade C or 10-701 Min. grade C or 10-601 Min. grade C

10-708 Probabilistic Graphical Models: Spring: 12 units
Many of the problems in artificial intelligence, statistics, computer systems, computer vision, natural language processing, and computational biology, among many other fields, can be viewed as the search for a coherent global conclusion from local information. The probabilistic graphical models framework provides an unified view for this wide range of problems, enabling efficient inference, decision-making and learning in problems with a very large number of attributes and huge datasets. This graduate-level course will provide you with a strong foundation for both applying graphical models to complex problems and for addressing core research topics in graphical models. The class will cover three aspects: The core representation, including Bayesian and Markov networks, and dynamic Bayesian networks; probabilistic inference algorithms, both exact and approximate; and, learning methods for both the parameters and the structure of graphical models. Students entering the class should have a pre-existing working knowledge of probability, statistics, and algorithms, though the class has been designed to allow students with a strong numerate background to catch up and fully participate. It is expected that after taking this class, the students should have obtain sufficient working knowledge of multi-variate probabilistic modeling and inference for practical applications, should be able to formulate and solve a wide range of problems in their own domain using GM, and can advance into more specialized technical literature by themselves. Students are required to have successfully completed 10701 or 10715, or an equivalent class.
Prerequisites: 10-701 Min. grade C or 10-601 Min. grade C or 10-301 Min. grade C or 10-315 Min. grade C or 10-715 Min. grade C

Course Website: https://andrejristeski.github.io/10708-22/

10-714 Deep Learning Systems: Algorithms and Implementation: Fall: 12 units
The goal of this course is to provide students an understanding and overview of the "full stack" of deep learning systems, ranging from the high-level modeling design of modern deep learning systems, to the basic implementation of automatic differentiation tools, to the underlying device-level implementation of efficient algorithms. Throughout the course, students will design and build from scratch a complete deep learning library, capable of efficient GPU-based operations, automatic differentiation of all implemented functions, and the necessary modules to support parameterized layers, loss functions, data loaders, and optimizers. Using these tools, students will then build several state-of-the-art modeling methods, including convolutional networks for image classification and segmentation, recurrent networks and self-attention models for sequential tasks such as language modeling, and generative models for image generation.
Prerequisites: (15-513 Min. grade C or 15-213 Min. grade C) and (21-240 Min. grade C or 21-241 Min. grade C) and (21-128 Min. grade C or 21-127 Min. grade C or 15-151 Min. grade C) and (10-315 Min. grade C or 10-601 Min. grade C or 10-701 Min. grade C or 10-715 Min. grade C or 10-301 Min. grade C)

10-715 Advanced Introduction to Machine Learning: Fall: 12 units
Machine Learning is the primary pillar that Artificial Intelligence is built upon. This course is designed for Ph.D. students whose primary field of study is machine learning, and who intend to make machine learning methodological research a main focus of their thesis. It will give students a thorough grounding in the algorithms, mathematics, theories, and insights needed to do in-depth research and applications in machine learning. The topics of this course will in part parallel those covered in the general PhD-level machine learning course (10-701), but with a greater emphasis on depth in theory. Students entering the class are expected to have a pre-existing strong working knowledge of linear algebra, probability, statistics, and algorithms. The course will also involve programming in Python. If you are interested in this topic, but do not have the required background or are not planning to work on a PhD thesis with machine learning as the main focus, you might consider the general PhD-level Machine Learning course (10-701) or the Masters-level Machine Learning course (10-601). You can find a webpage to the Intro to ML course comparison page, which includes a self-assessment exam to help you choose which Intro to ML course to take, in the Course URL field.
Prerequisites: 15-122 Min. grade C and (15-151 Min. grade C or 21-127 Min. grade C or 21-128 Min. grade C) and (15-359 Min. grade C or 36-225 Min. grade C or 36-217 Min. grade C or 21-325 Min. grade C or 15-259 Min. grade C or 36-218 Min. grade C)

Course Website: https://www.cs.cmu.edu/~nihars/teaching/10715-Fa23/index.html

10-716 Advanced Machine Learning: Theory and Methods: Spring: 12 units
Advanced Machine Learning is a graduate level course introducing the theoretical foundations of modern machine learning, as well as advanced methods and frameworks used in modern machine learning. The course assumes that students have taken graduate level introductory courses in machine learning (Introduction to Machine Learning, 10-701 or 10-715), as well as Statistics (Intermediate Statistics, 36-700 or 36-705). The course treats both the art of designing good learning algorithms, as well as the science of analyzing an algorithm's computational and statistical properties and performance guarantees. Theorems are presented together with practical aspects of methodology and intuition to help students develop tools for selecting appropriate methods and approaches to problems in their own research. We will cover advanced machine learning methods such as nonparametric and deep compositional approaches to density estimation and regression; advanced theory such as fundamentals of clustering, classification, boosting; theory and methods at the intersection of statistical and computational efficiency; as well as vignettes of theoretical results on some hot topics such as robustness and explainability.
Prerequisites: (10-701 Min. grade C or 10-715 Min. grade C) and (36-705 Min. grade C or 36-700 Min. grade C)

Course Website: http://www.cs.cmu.edu/~pradeepr/716/

10-725 Convex Optimization: Intermittent: 12 units
Nearly every problem in machine learning can be formulated as the optimization of some function, possibly under some set of constraints. This universal reduction may seem to suggest that such optimization tasks are intractable. Fortunately, many real world problems have special structure, such as convexity, smoothness, separability, etc., which allow us to formulate optimization problems that can often be solved efficiently. This course is designed to give a graduate-level student a thorough grounding in the formulation of optimization problems that exploit such structure, and in efficient solution methods for these problems. The main focus is on the formulation and solution of convex optimization problems, though we will discuss some recent advances in nonconvex optimization. These general concepts will also be illustrated through applications in machine learning and statistics. Students entering the class should have a pre-existing working knowledge of algorithms, though the class has been designed to allow students with a strong numerate background to catch up and fully participate. Though not required, having taken 10-701 or an equivalent machine learning or statistical modeling class is strongly encouraged, as we will use applications in machine learning and statistics to demonstrate the concepts we cover in class. Students will work on an extensive optimization-based project throughout the semester.
Prerequisites: (21-240 Min. grade C or 10-606 Min. grade C or 21-671 Min. grade C or 21-242 Min. grade C or 21-341 Min. grade C) and (21-254 Min. grade C or 21-259 Min. grade C or 21-268 Min. grade C) and (15-259 Min. grade C or 36-218 Min. grade C or 36-219 Min. grade C or 36-225 Min. grade C or 21-325 Min. grade C or 15-359 Min. grade C or 36-217 Min. grade C)

Course Website: https://sites.google.com/view/convexopt-10725-2023f

10-735 Responsible AI: Intermittent: 12 units
The development and deployment of artificial intelligence (AI) systems increasingly involves choices that impact people's lives and society at large. The responsible development and use of AI requires the integration of ethical, societal, and policy considerations into the use of AI tools and the development of AI systems in high-stakes domains, such as employment, education, lending, criminal justice, medicine, and beyond. We will discuss: (1) the pathways through which AI can lead to or amplify problematic decision-making practices (e.g., discrimination, inscrutability, invasion of privacy, and beyond); (2) recent technological methods and remedies to capture and alleviate these concerns; and (3) the scope of applicability and limitations of technological remedies in the context of several contemporary application domains. The course's primary goals are: (a) to raise awareness about the social, ethical, and policy implications of AI, and (b) to prepare students to critically analyze these issues as they emerge in the ever-expanding use of AI in socially consequential domains.
Prerequisites: 15-122 Min. grade C and (21-127 Min. grade C or 15-151 Min. grade C or 21-128 Min. grade C) and (36-217 Min. grade C or 21-325 Min. grade C or 36-218 Min. grade C or 36-219 Min. grade C or 15-259 Min. grade C or 36-235 Min. grade C or 36-225 Min. grade C or 15-359 Min. grade C)

Course Website: https://www.cs.cmu.edu/~hheidari/rai-spring-24.html

10-737 Creative AI: Intermittent
Artificial intelligence (AI) systems now generate authentic paintings, compose music pieces, and find out-of-box solutions to real-life problems in our world. Creativity, which was considered to be a moon shot for AI, does not seem to be too far any more. Is that true? Are we close to see creative AI? The answer is yes and no. We are moving closer with meaningful developments in Machine Learning, however there are several questions to be explored further to achieve the creative AI. What kind of creativity we want to represent? How do we translate creativity into what machines can understand? How do we design ML algorithms to be more creative? This course is where we explore these questions through seminars and projects. Our goal is to design computational models that present the very possibility of the creative AI. The instructors who are specialized in Machine Learning Art and Robotics lead this course together. We introduce related examples and possible methods including multi-modal data-driven learning, learning from demonstration, and combined learning from data and human demonstrations. Students are welcome to bring in their expertise and passion from diverse backgrounds to explore this topic together.

Course Website: http://kangeunsu.com/creativeai19f/

10-745 Scalability in Machine Learning: Fall: 12 units
The goal of this course is to provide a survey into some of the recent advances in the theory and practice of dealing with scalability issues in machine learning. We will investigate scalability issues along the following dimensions: Challenges with i) large datasets, ii) high-dimensions, and iii) complex data structure. The course is intended to prepare students to write research papers about scalability issues in machine learning. This is an advanced-level, fast-paced course that requires students to already have a solid understanding of machine learning (e.g. by taking an intro to ML class), good programming skills in Python, and being comfortable with dealing with abstract mathematical concepts and reading research papers. The course will have significant overlap with 10-405/605/805, but 10-745 will be faster-paced and go deeper into the theoretical investigations of the methods. Some of the classes will be flipped that will require students to watch a video lecture or read a research paper before the class, and the content will be discussed during the class time. The class will include a course project, HW assignments, and two-in class exams.
Prerequisites: 10-601 Min. grade B or 10-315 Min. grade B or 10-701 Min. grade B or 10-401 Min. grade B or 10-301 Min. grade B or 10-715 Min. grade B

10-777 Historical Advances in Machine Learning: Intermittent: 12 units
We will read (before class) and discuss (in class) a variety of historically important papers in ML (and to some extent AI). Not all of these were initially published in the ML/AI literature (eg: Bellman in math, VC in probability, bandits in statistics, fuzzy sets in control, optimization work in OR, etc, but now play central roles in ML and/or AI). Since "historical" is always ambiguous, we're going to go with "presented/published before the instructor was born" as a definition (pre-1988). While the content of the paper will be the primary focus, we will also attempt to understand the research context in which the paper was written. For example, what questions were other researchers asking at the time? Was the paper immediately recognized as a breakthrough or did it take a long time? Do we view the contents of the paper today as "obvious in hindsight" or is there still a lot of material in the paper that is nontrivial and even surprising or underappreciated? Who was the author, were they already relatively well known when they wrote the paper, or was it the paper itself that made them famous? What else did these authors work on before/after the paper?
Prerequisites: 10-601 Min. grade C or 10-701 Min. grade C or 10-715 Min. grade C or 10-315 Min. grade C or 10-301 Min. grade C

10-805 Machine Learning with Large Datasets: Spring: 12 units
Large datasets pose difficulties across the machine learning pipeline. They are difficult to visualize and introduce computational, storage, and communication bottlenecks during data preprocessing and model training. Moreover, high capacity models often used in conjunction with large datasets introduce additional computational and storage hurdles during model training and inference. This course is intended to provide a student with the mathematical, algorithmic, and practical knowledge of issues involving learning with large datasets. Among the topics considered are: data cleaning, visualization, and pre-processing at scale; principles of parallel and distributed computing for machine learning; techniques for scalable deep learning; analysis of programs in terms of memory, computation, and (for parallel methods) communication complexity; and methods for low-latency inference. The class will include programming and written assignments to provide hands-on experience applying machine learning at scale. An introductory machine learning course (10-301, 10-315, 10-601, 10-701, or 10-715) is a prerequisite. A strong background in programming will also be necessary; suggested prerequisites include 15-210, 15-214, or equivalent. Students are expected to be familiar with Python or learn it during the course.
Prerequisites: (17-214 or 15-211 or 15-210 or 15-214) and (10-301 or 10-315 or 10-701 or 10-401 or 10-601 or 10-715)

Course Website: https://10605.github.io/

10-806 Foundations of Machine Learning and Data Science: Fall: 12 units
This course will cover fundamental topics in Machine Learning and Data Science, including powerful algorithms with provable guarantees for making sense of and generalizing from large amounts of data. The course will start by providing a basic arsenal of useful statistical and computational tools, including generalization guarantees, core algorithmic methods, and fundamental analysis models. We will examine questions such as: Under what conditions can we hope to meaningfully generalize from limited data? How can we best combine different kinds of information such as labeled and unlabeled data, leverage multiple related learning tasks, or leverage multiple types of features? What can we prove about methods for summarizing and making sense of massive datasets, especially under limited memory? We will also examine other important constraints and resources in data science including privacy, communication, and taking advantage of limited interaction. In addressing these and related questions we will make connections to statistics, algorithms, linear algebra, complexity theory, information theory, optimization, game theory, and empirical machine learning research. Topics to be covered will include: - Fundamental measures of complexity for generalization, including VC-dimension and Rademacher complexity. - Core algorithmic tools including boosting, regularization, and online optimization with connections to game theory. - Spectral methods, streaming algorithms and other approaches for handling massive data. - Foundations and algorithms for addressing important constraints or externalities such as privacy, limited memory, and communication constraints. - Foundations for modern learning paradigms including semi-supervised learning, never-ending learning, interactive learning, and deep learning.

Course Website: http://www.cs.cmu.edu/~ninamf/courses/806/10-806-index.html

10-807 Topics in Deep Learning: Fall: 12 units
Building intelligent machines that are capable of extracting meaningful representations from high-dimensional data lies at the core of solving many AI related tasks. In the past few years, researchers across many different communities, from applied statistics to engineering, computer science and neuroscience, have developed deep (hierarchical) models and #8212; models that are composed of several layers of nonlinear processing. An important property of these models is that they can learn useful representations by re-using and combining intermediate concepts, allowing these models to be successfully applied in a wide variety of domains, including visual object recognition, information retrieval, natural language processing, and speech perception. This is an advanced graduate course, designed for Master's and Ph.D. level students, and will assume a reasonable degree of mathematical maturity. The goal of this course is to introduce students to the recent and exciting developments of various deep learning methods. Some topics to be covered include: restricted Boltzmann machines (RBMs) and their multi-layer extensions Deep Belief Networks and Deep Boltzmann machines; sparse coding, autoencoders, variational autoencoders, convolutional neural networks, recurrent neural networks, generative adversarial networks, and attention-based models with applications in vision, NLP, and multimodal learning. We will also address mathematical issues, focusing on efficient large-scale optimization methods for inference and learning, as well as training density models with intractable partition functions. Prerequisite: ML: 10-701 or 10-715, and strong programming skills.
Prerequisites: 10-715 Min. grade C or 10-701 Min. grade C

10-822 Presentation Skills: Fall and Spring: 6 units
This course provides a forum for students to learn and refine public speaking and technical reading skills. The course will include brief workshops embedded throughout the semester to cover such things as effective structure of presentations and papers, how to give a short talk (think NIPS spotlights), "elevator" talks, structure of a research paper, conference presentations, proposal writing (think thesis and beyond), slide crafting, posters, critical evaluation, and public communications for research. Students will be expected to prepare and present a number of practice talks throughout the semester.

10-830 Machine Learning in Policy: Spring: 12 units
Machine learning, a field derived primarily from computer science and statistics, has matured and gained wide adoption over past decades. Alongside exponential increases in data measurement and availability, the ability to develop appropriate and tailored analyses is in demand. As practitioners in the social sciences consider machine learning methods, however, we are identifying limitations and externalities of the applications of machine learning techniques, such as overconfidence in settings with concept drift, lack of generalizability due to selection bias, and magnification of inequities. Machine Learning and Policy seeks to (1) demonstrate motivations and successes of machine learning, to (2) contrast them with more classical methods, and to (3) investigate the promise and cautions of machine learning for public policy. The course will cover variety of topics, including: Basics of machine learning; probability/Bayes/likelihood/conjugacy, terminology, code/algorithm design, evaluation, mathematical formulations Popular and well-performing methods; random forests/trees/ensembles, neural networks/backpropagation/embeddings/generalized adversarial networks, generalized linear models/shrinkage/convexity/basis functions, support vector machines/kernels/optimization/Lagrangian Leveraging other data sources; natural language processing/topic modeling/relational (non-i.i.d.)/relational (Markov logic networks)/temporal data Additional topics: causality/confounding/propensity scoring/inverse weighting/causal directed acyclic graphs, fairness/ethics, interpretation/explanation/visualization, anomaly detection, semi-supervised and active learning, reinforcement learning.

Course Website: https://www.andrew.cmu.edu/user/jweiss2/mlp/

10-831 Special Topics in Machine Learning and Policy: Spring: 6 units
Special Topics in Machine Learning and Policy (90-921/10-831) is intended for Ph.D. students in Heinz College, MLD, and other university departments who wish to engage in detailed exploration of a specific topic at the intersection of machine learning and public policy. Qualified master's students may also enroll with permission of the instructor; all students are expected to have some prior background in machine learning and data mining (10-601, 10-701, 90-866, 90-904/10-830, or a similar course). We will explore state-of-the-art methods for detection of emerging events and other relevant patterns in massive, high-dimensional datasets, and discuss how such methods can be applied usefully for the public good in medicine, public health, law enforcement, security, and other domains. The course will consist of lectures, discussions on current research articles and future directions, and course projects. Specific topics to be covered may include: anomaly detection, change-point detection, time series monitoring, spatial and space-time scan statistics, pattern detection in graph data, submodularity and LTSS properties for efficient pattern detection, combining multiple data sources, scaling up pattern detection to massive datasets, applications to public health, law enforcement, homeland security, and health care. A sample syllabus is available at: http://www.cs.cmu.edu/~neill/courses/90921-S10.html
Course Website: http://www.cs.cmu.edu/~neill/courses/90921-S10.html

Robotics Courses

16-161 ROB Seminar: Artificial Intelligence and Humanity: Fall and Spring: 12 units
In 1965 British mathematician I.J. Good wrote, An ultraintelligent machine could design even better machines; there would then unquestionably be an intelligence explosion, and the intelligence of man would be left far behind. As we enter an age where companies like Uber are testing driverless cars in Pittsburgh and innovative interfaces like IBMs Watson can play jeopardy and learn techniques for medical diagnoses, how are we to negotiate an intelligence explosion that for many individuals might threaten the very notions of what it means to be human? The future of human-to-machine relationships will likely define our historical epoch and yet, many young technologists and humanists underestimate the downstream impact of technological innovations on human society. Presently, we have little choice but to attend to this rapidly anxiety-ridden question. This seminar will attend to the challenge of present existential questions on what it means to be human (read not machine) in the context of a rapidly advancing technological age. We will consider human narratives throughout history that exam how governments and individual citizens defined humanity in the context of slavery and colonialism as a framework for exploring and projecting what it means to be human in the age of rapidly advancing intelligent machines. We will trace the technological advancements of the recent five decades and identify historical precedents and speculative narratives that help us to consider issues like labor, economic disparity, negotiations of power, human dignity and ethical responsibility within the context of human relations with advancing technological tools that are now coined, artificial intelligence.

16-170 Concepts of Robotics: Spring: 5 units
The course will introduce students to the main foundational concepts and techniques used in robotics including perception, cognition, and action. Concepts will be grounded in a range of real-world robotic systems to highlight the use of common robotics components such as sensor selection, sensor processing and fusion, path planning algorithms, mechanism design, reasoning about interactions with the environment, and systems integration. Applications of robotics will be discussed along with methods for mapping application requirements to design choices for robotic systems. Students will also be introduced to ethical issues surrounding robotics, including considerations around potential future of uses of robotics technologies. The course will contain programming and written assignments designed to give students a feel for the practical aspects of robot sensing, planning, and actuation.
Prerequisite: 15-112 Min. grade C

16-211 Foundational Mathematics of Robotics: Fall: 12 units
This course will cover core mathematics concepts used in many advanced robotics courses at the RI. Perhaps unlike prior courses in math, the focus of this class will be to ground concepts in robotics algorithms or applications. For example: How to move and manipulate objects in 3D space (coordinate transforms, rotations). How to move an articulated robots end-effector in Cartesian space (Jacobians, gradient optimization). How to have a robot learn to recognize a vision input (neural networks, back propagation). How to plan navigate a robot optimally (dynamic programming, A* Search).
Prerequisites: 21-122 and 21-241

16-220 Robot Building Practices: Fall: 12 units
This course is designed to provide students with a comprehensive set of mechanical and electronics skills required for designing, prototyping, building, and troubleshooting robotic systems. Students will learn about basic robotic components and how to obtain, build, or fix them to create functional robotic systems. The course will cover mechanical skills specific to robotics, including sketching, 3D CAD modeling, 3D printing, laser cutting and other machine shop tools. Students will also learn the fundamentals of circuit design, breadboarding, and PCB layout using CAD tools, as well as how to use measurement equipment and soldering techniques. They will gain hands-on experience with motor controllers and microcontrollers, essential components for controlling robots. The class project will give students the opportunity to learn how to design and implement power transmission systems and prototype mechanical components required in building a functional robotic module and later a full robotic system. The course will include robot-specific topics such as kinematics, robot actuators, sensors, and perception algorithms. Upon completion of this course, students will have a solid foundation in electronics and mechanical prototyping for robotics and be able to create innovative robots for a variety of applications.
Prerequisite: 15-122 Min. grade C

16-223 IDeATe Portal: Creative Kinetic Systems: Fall: 10 units
The art and science of machines which evoke human delight through physical movement is founded on a balance of form and computation. This introductory physical computing course addresses the practical design and fabrication of robots, interactive gadgets, and kinetic sculptures. The emphasis is on creating experiences for human audiences through the physical behavior of devices which embody computation with mechanism, sensing, and actuation. Specific topics include basic electronics, elementary mechanical design, embedded programming, and parametric CAD. A key objective is gaining an intuitive understanding of how information and energy move between the physical, electronic, and computational domains to create a compelling behavior. The final projects are tested in the field on children and adults. This interdisciplinary course is an IDeATe Portal Course open to students from all colleges. For students choosing to follow an IDeATe program it is an entry into either Physical Computing or Intelligent Environments. The structure of the class revolves around collaborative exercises and projects which introduce core physical computing and system engineering techniques in a human-centric context. Students apply system and design thinking across multiple domains, work together to make and test several devices, and participate in wide-ranging critique which considers both technical and artistic success.

Course Website: https://courses.ideate.cmu.edu/16-223

16-224 IDeATe: Re-Crafting Computational Thinking with Soft Technologies: Spring: 12 units
This course focuses on teaching introductory concepts of Robotics, Mechatronics, and Computer Science using an arts-based approach. During the course, students will build their own weaving robot, program it, and learn how weaving art is connected to computer programming and matrix mathematics. Students will also learn the history of weaving, how to design beautiful patterns, and how to extract the features of those patterns into mathematical equations and computer programs.

16-235 Fantastic Robots and How to Fold Them: Spring: 9 units
This course will focus on the basics of robotics through a hands-on approach. Students will build their own robots by designing a mechanical structure and embedding actuators, sensors, and controllers. They will then use these robots to solve a simple maze with obstacles. The course content will be delivered through lectures, workshops, and a course-long team project. In classical robotics, we explore the three main behaviors of robots through the work frame of "sense-plan-act". Robots are more than just these behaviors, and students will learn about how to make the physical embodiments of robots through an overview of design and manufacturing techniques for robot mechanisms. Students will be able to make their own mechanisms, improve the system through hardware or software, and learn how to analyze the kinematics and dynamics of these mechanisms to understand and control the motion.
Prerequisites: 15-110 Min. grade C or 15-112 Min. grade C or 15-104 Min. grade C

16-264 Humanoids: Spring: 12 units
This course surveys perception, cognition, and movement in humans, humanoid robots, and humanoid graphical characters. Application areas include more human-like robots, video game characters, and interactive movie characters.

Course Website: http://www.cs.cmu.edu/~cga/humanoids-ugrad/

16-299 Introduction to Feedback Control Systems: Spring: 12 units
This course is designed as a first course in feedback control systems for computer science majors. Course topics include classical linear control theory (differential equations, Laplace transforms, feedback control), linear state-space methods (controllability/observability, pole placement, LQR), nonlinear systems theory, and an introduction to control using computer learning techniques. Priorities will be given to computer science majors with a robotics major or minor.
Prerequisites: 21-122 and 15-122
Course Website: http://www.cs.cmu.edu/~cga/controls-intro/

16-311 Introduction to Robotics: Spring: 12 units
This course presents an overview of robotics in practice and research with topics including vision, machine learning, motion planning, mobile mechanisms, kinematics, inverse kinematics, and sensors. In course projects, students construct LEGO robots which are driven by a microcontroller, with each project reinforcing the basic principles developed in lectures. Students usually work in teams of three: an electrical engineer, a mechanical engineer, and a computer scientist. Groups are typically self-formed except for the first lab. This course will also expose students to some of the contemporary happenings in robotics, including current robotics research, applications, robot contests and robots in the news. Students registering for this course must register for both Mon/Wed mornings and Tuesday afternoon sections.
Prerequisites: 18-202 Min. grade C or 21-240 Min. grade C or 21-241 Min. grade C or 24-311 Min. grade C or 21-260 Min. grade C

Course Website: http://www.cs.cmu.edu/afs/cs.cmu.edu/academic/class/16311/www/current/

16-322 Modern Sensors for Intelligent Systems: Spring: 12 units
The class aims at introducing sensing technologies for robots and other intelligent systems. The course will cover the physical principles of traditional sensors, sensor calibration and evaluation, signal processing algorithms for different sensors, and examples of sensor applications for robots or other intelligent systems. On the sensing system design part, the course will cover the common sensor fusion design and algorithms, and provide examples of sensing systems for different robots or intelligent systems, such as wearable sensors, self-driving cars, autonomous vehicles, assistant robots, and field robots in extreme conditions. The class will contain lectures, two lab sessions, and a course project.

16-350 Planning Techniques for Robotics: Spring: 12 units
Planning is one of the core components that enable robots to be autonomous. Robot planning is responsible for deciding in real-time what should the robot do next, how to do it, where should the robot move next and how to move there. This class does an in-depth study of popular planning techniques in robotics and examines their use in ground and aerial robots, humanoids, mobile manipulation platforms and multi-robot systems. The students learn the theory of these methods and also implement them in a series of programming-based projects. To take the class students should have taken an Intro to Robotics class and have a good knowledge of programming and data structures.

Course Website: http://www.cs.cmu.edu/~maxim/classes/robotplanning/

16-362 Mobile Robot Algorithms Laboratory: Fall: 12 units
This course is an introduction to the theory and algorithms of multirotor vehicle autonomy. Students will work individually to develop a multirotor simulator in Python and C++, add sensors, plan, and perform exploration. Lectures will cover topics to advance the capabilities of the simulator. Homeworks will be designed to increase the autonomy capabilities of the multirotor vehicle. The class will culminate in an individual project that pushes the autonomy capabilities developed throughout the course and may cover multi-robot aerial autonomy, dynamic environment modeling, or advanced planning and control. In order to succeed in the course, students must have a 2nd year science/engineering level background in mathematics (matrices, vectors, coordinate systems) and have already mastered at least one object-oriented programming language like C++ or Python. When the course is over, students will have written a single software system that has been incrementally extended in functionality and regularly debugged throughout the semester.

16-371 Personalized Responsive Environments: Spring: 9 units
[IDeATe collaborative course]. Environmental factors have a significant impact on mood and productivity. Creating responsive environments necessitates the design of surroundings that are able to metamorphose in order to optimize user strengths and available resources and evolve in stride with user needs. This course will investigate the development of spaces that adapt to user preferences, moods, and task specific demands. Both the design and engineering of such personalized environments will be explored. Central course concepts will include, understanding the user, integrating various modalities (e.g., light, heat, sound) to support the changing needs of task and user, and the creation of adaptive environments that learn user preferences over time. Please note that there may be usage/materials fees associated with this course.
Prerequisites: 60-223 Min. grade C or 62-150 Min. grade C or 18-090 Min. grade C or 15-104 Min. grade C

16-374 IDeATe: Art of Robotic Special Effects: Spring: 12 units
Inspired by the early "trick" films of George Melies, this project-oriented course brings together robotics and film production technique to infuse cinema with the wonder of live magic. Students will learn the basics of film production using animatronics, camera motion control, and compositing. The projects apply these techniques to create innovative physical effects for short films, all the way from concept to post-production. The course emphasizes real-time practical effects to explore the immediacy and interactivity of improvisation and rehearsal. The robotics topics include animatronic rapid prototyping and programming human-robot collaborative performance. The course includes a brief overview of the history of special effects and robotics to set the work in context.

Course Website: https://courses.ideate.cmu.edu/16-374

16-375 IDeATe: Robotics for Creative Practice: Fall: 10 units
Robots come in all shapes and sizes: it is the integration of software and hardware that can make any machine surprisingly animate. This project-oriented course brings art and engineering together to build performance systems using embodied behavior as a creative medium. Students learn skills for designing, constructing and programming automated systems for storytelling and human interaction, then explore the results through exhibition and performance. Technical topics include closed-loop motion control, expressive physical and computational behavior, machine choreography, and performance conceptualization. Discussion topics include both contemporary kinetic sculpture and robotics research. This interdisciplinary course is part of IDeATe Physical Computing but is open to any student.
Prerequisites: 15-110 or 15-104 or 15-112 or 99-361 or 60-212 or 60-210

Course Website: https://courses.ideate.cmu.edu/16-375

16-376 IDeATe: Kinetic Fabrics: Spring: 10 units
Kinetic Fabrics brings together the fields of robotics and textiles to explore their unified creative and expressive potential. It is a wide-open frontier for kinetic art, wearable art, and architectural installation. In this course students will build a variety of performative systems combining fabrics and robotic technologies. Students will apply modular actuation and sensing to textile artworks, using software designed to facilitate fluid explorations, rapid iterations, and playful experimentation. Students will learn basic textile skills, such as hand and machine sewing, as well as gain facility and familiarity with the characteristics of multiple type of fabrics. Historical precedents as well as contemporary examples of works will support students creative growth and knowledge of the field. Students' course work will include short-term and long-term projects, sampling and prototyping, critique, and documentation. Additionally, students will organize an end-of-semester event where they will perform a developed kinetic fabric work for a public audience.

Course Website: https://courses.ideate.cmu.edu/16-376

16-384 Robot Kinematics and Dynamics: Fall: 12 units
Foundations and principles of robotic kinematics. Topics include transformations, forward kinematics, inverse kinematics, differential kinematics (Jacobians), manipulability, and basic equations of motion. Course also include programming on robot arms.
Prerequisites: 15-122 Min. grade C or 16-311 or 18-202 or 21-241 or 24-311

16-385 Computer Vision: Fall and Spring: 12 units
This course provides a comprehensive introduction to computer vision. Major topics include image processing, detection and recognition, geometry-based and physics-based vision, sensing and perception, and video analysis. Students will learn basic concepts of computer vision as well as hands on experience to solve real-life vision problems. This course is for undergraduate students only.
Prerequisites: (18-202 Min. grade C and 15-122 Min. grade C) or (21-259 Min. grade C and 15-122 Min. grade C and 21-241 Min. grade C) or (21-241 Min. grade C and 21-256 Min. grade C and 15-122 Min. grade C) or (24-282 Min. grade C and 15-122 Min. grade C and 21-241 Min. grade C) or (21-254 Min. grade C and 15-122 Min. grade C and 21-241 Min. grade C)

Course Website: http://www.cs.cmu.edu/~16385/

16-397 Art, Conflict and Technology: Spring: 12 units
This course considers the period of violence in Northern Ireland from 1968 to 1998 known as The Troubles, and recent issues pertaining to sovereignty and borders caused by Brexit, Britain's proposed exit from the European Union, as a point of comparison between societies rife with strife, division and predilections to violence. We investigate the ways in which visual art to literature to theatrical performance explores and interrogates societal conflict and emergence from conflict, and how evolving technological systems influence political power dynamics and modes of artistic practice. We will use the legacy of societal conflict in Ireland and Northern Ireland to compare concepts and physical manifestations of borders, barriers and bridges in the region and in global contexts. We will examine fluctuating development of democratic processes in Ireland and Northern Ireland, individual and group public performance, and the influence of technologically crude and highly sophisticated tools on communities emerging from strife. We will use our analytical lens to focus on figurative and literal borders, barriers and bridges to explore work produced in Belfast, Derry and Dublin, alongside circumstances and artistic practice in present-day Pittsburgh, Cuidad Juarez, Jerusalem and Soweto. On a visit to Ireland and Northern Ireland over spring break, students will meet with artists, writers, legislators, community organizers, academics and ex-combatants, to learn about their past experience and current motivations. Students will analyze artistic practice, peacekeeping initiatives and performance of identity in relation to the historical framework from which it emerges in Ireland and Northern Ireland. We will use this foundation as a point of comparison to practices throughout the world. Students will process their experience and developing analytical skills by documenting their responses through original creative work.

16-421 Vision Sensors: Spring: 12 units
This course covers the fundamentals of vision cameras and other sensors - how they function, how they are built, and how to use them effectively. The course presents a journey through the fascinating five hundered year history of "camera-making" from the early 1500's "camera obscura" through the advent of film and lenses, to today's mirror-based and solid state devices (CCD, CMOS). The course includes a significant hands-on component where students learn how to use the sensors and understand, model and deal with the uncertainty (noise) in their measurements. While the first half of the course deals with conventional "single viewpoint" or "perspective" cameras, the second half of the course covers much more recent "multi-viewpoint" or "multi-perspective" cameras that includes a host of lenses and mirrors.
Prerequisites: 21-111 and 21-241
Course Website: http://www.cs.cmu.edu/~ILIM/courses/vision-sensors/

16-423 Designing Computer Vision Apps: Fall: 12 units
Computer vision is a discipline that attempts to extract information from images and videos. Nearly every smart device on the planet has a camera, and people are increasingly interested in how to develop apps that use computer vision to perform an ever expanding list of things including: 3D mapping, photo/image search, people/object tracking, augmented reality etc. This course is intended for students who are not familiar with computer vision, but want to come up to speed rapidly with the latest in environments, software tools and best practices for developing computer vision apps. No prior knowledge of computer vision or machine learning is required although a strong programming background is a must (at a minimum good knowledge of C/C++). Topics will include using conventional computer vision software tools (OpenCV, MATLAB toolboxes, VLFeat, CAFFE), and development on iOS devices using mobile vision libraries such as GPUImage and fast math libraries like Armadillo and Eigen. For consistency, all app development will be in iOS and it is expected that all students participating in the class have access to an Intel-based MAC running OS X Mavericks or later. Although the coursework will be focussed on a single operating system, the knowledge gained from this class is intended to generalize to other mobile platforms such as Android etc.
Prerequisites: (21-240 and 15-213) or (21-241 and 15-213) or (18-202 and 18-213)

Course Website: http://16423.courses.cs.cmu.edu

16-425 Medical Image Analysis: Spring: 12 units
Students will gain theoretical and practical skills in 2D, 3D, and 4D biomedical image analysis, including skills relevant to general image analysis. The fundamentals of computational medical image analysis will be explored, leading to current research in applying geometry and statistics to segmentation, registration, visualization, and image understanding. Additional and related covered topics include de-noising/restoration, morphology, level sets, and shape/feature analysis. Students will develop practical experience through projects using the latest version of the National Library of Medicine Insight Toolkit ( ITK ) and SimpleITK, a popular open-source software library developed by a consortium of institutions including Carnegie Mellon University and the University of Pittsburgh. In addition to image analysis, the course will include interaction with radiologists and pathologist(s). *** Lectures are at CMU and students will visit clinicians at UPMC. Some or all of the class lectures may also be videoed for public distribution, but students may request to be excluded from distributed video. 16-725 is a graduate class, and 16-425 is a cross-listed undergraduate section. 16-425 is new this year, and has substantially reduced requirements for the final project and for the larger homework assignments, nor does it require shadowing the clinicians. Prerequisites: Knowledge of vector calculus, basic probability, and either C++ or python, including basic command-line familiarity and how to pass arguments to your own command-line programs. Extensive expertise with C++ and templates is not necessary, but some students may find it helpful.

Course Website: http://www.cs.cmu.edu/~galeotti/methods_course/

16-441 Advanced CP/SIS: Urban Intervention: Fall and Spring: 12 units
This course introduces students to theories, practices, and communities for critical investigation of urban spaces and play within them. The course unfolds along two parallel trajectories: research (literature review, lectures, readings, demonstrations) and design (three iterated individualized projects and a fourth larger scale final project). The first half of the course will introduce students to a wide range of theories and techniques within urban intervention that draw from fluxus, the situationist international, activism and hacktivism, as well as public policy, philosophy, psychology and economics. Students will study theoretical and practical frameworks for artistic intervention into public urban spaces, while concurrently researching actual sites and communities within Pittsburgh for experimentation. Students are required to conceptualized projects on larger (urban) scales, and find ways to implement their projects safely and legally by pursuing the necessary administrative, social, technical, financial steps required to create meaningful interventions in public spaces. This class will specifically explore three media for urban intervention: Sound Outdoor video projection Robotics, Autonomy and Mobility in the way of remote control vehicles (e.g. cars, quad-copters, etc.). For each theme, students are required to produce one project that is iterated twice or more. The undergraduate (60441) and graduate (60741) sections of the course meet concurrently and follow the same syllabus and assignments. In addition to the coursework documented in the syllabus, Graduate level students are expected to write a research paper suitable for submission to a notable relevant academic conference. This process includes a rough draft, revisions and a completed and formatted paper ready for submission

16-450 Robotics Systems Engineering: Fall: 12 units
Systems engineering examines methods of specifying, designing, analyzing and testing complex systems. In this course, principles and processes of systems engineering are introduced and applied to the development of robotic devices. The focus is on robotic system engineered to perform complex behavior. Such systems embed computing elements, integrate sensors and actuators, operate in a reliable and robust fashion, and demand rigorous engineering from conception through production. The course is organized as a progression through the systems engineering process of conceptualization, specification, design, and prototyping with consideration of verification and validation. Students completing this course will engineer a robotic system through its compete design and initial prototype. The project concept and teams can continue into the Spring-semester (16-474 Robotics Capstone) for system refinement, testing and demonstration.
Prerequisites: 16-311 Min. grade B and (16-299 Min. grade B or 18-370 Min. grade B or 24-451 Min. grade B)

16-455 IDeATe: Human-Machine Virtuosity: Spring: 12 units
[IDeATe course] Human dexterous skill embodies a wealth of physical understanding which complements computer-based design and machine fabrication. This project-oriented course explores the duality between hand and machine through the practical development of innovative design and fabrication systems. These systems fluidly combine the expressivity and intuition of physical tools with the scalability and precision of the digital realm. Students will develop novel hybrid design and production workflows combining analog and digital processes to support the design and fabrication of their chosen projects. Specific skills covered include 3D modeling (CAD), 3D scanning, algorithmic geometric modeling, digital and robotic fabrication (additive and subtractive manufacturing), motion capture and computer based sensing, and human-robot interaction design. Areas of interest include architecture, art, and product design.

Course Website: https://courses.ideate.cmu.edu/16-455

16-456 Reality Computing Studio: Fall: 12 units
[IDeATe collaborative course] Reality computing encompasses a constellation of technologies focused around capturing reality (laser scanning, photogrammetry), working with spatial data (CAD, physical modeling, simulation), and using data to interact with and influence the physical world (augmented / virtual reality, projector systems, 3d printing, robotics). Taught in collaboration with the school of architecture, this studio asks students to apply these technologies to real world problems such as residential design, sustainability, and infrastructure monitoring.

Course Website: http://ideate.cmu.edu/about-ideate/departments/robotics-institute/reality-computing/

16-457 Reality Computing II: Spring: 12 units
[IDeATe collaborative course] Reality computing encompasses a constellation of technologies focused around capturing reality (laser scanning, photogrammetry), working with spatial data (CAD, physical modeling, simulation), and using data to interact with and influence the physical world (augmented / virtual reality, projector systems, 3d printing, robotics). This iteration of the reality computing course will focus on "design realization": the translation from digital design to fully realized tangible artifact. Collaborating with the UDBS design studio, and within the context of a full-scale residential prototype, students will investigate how reality computing technologies can be used to accelerate and advance the process of design realization by using reality computing to understand existing homes, map design data into the real world, and highlight conflicts between design and reality. Topics of special focus within the course are residential design (John Folan) and augmented reality and robotics (Pyry Matikainen).

Course Website: http://ideate.cmu.edu/about-ideate/departments/robotics-institute/reality-computing/

16-461 Experimental Capture: Fall: 9 units
Performance capture is used in applications as varied as special effects in movies, animation, sports training, physical rehabilitation, and human-robot/human-computer interaction. This course will survey state-of-the-art techniques and emerging ideas, in the industry and in academia, to capture, model, and render human performances. The course will be a mix between lectures and discussion of recent progress in human motion capture and analysis. The course evaluation will be project-based, in which students will capture their own body and face motion, and build projects around the data they collect individually and as a group. We will cover: 1. Capture Techniques: We will describe and use various systems including motion capture, video-based capture, depth sensors, scanners, and eye-gaze trackers; 2. Modeling and Representation: We will cover classic and contemporary representations of face and body pose and motion, including statistical and physics-based techniques; 3. Rendering Applications: As new rendering paradigms emerge, new applications continue to develop. We will study recent progress in animation, synthesis, classification, and rehabilitation on new forms of displays. Please note that there may be usage/materials fees associated with this course.
Prerequisites: 60-422 or 15-365

16-465 Game Engine Programming: Spring: 10 units
This course is designed to help students understand, modify, and develop game engines. Game engines consist of reusable runtime and asset pipeline code. They provide game-relevant abstractions of low-level system services and libraries, making it easier to write bug-free games that work across multiple platforms. Game engines also handle artistic content, providing or integrating with authoring tools to ease the process of creating high-fidelity games. In this course, we will discuss the problems game engines attempt to solve, examine how current state-of-the-art engines address these problems, and create our own engines based on what we learn. We will cover both the content authoring and runtime aspects of engines. Coursework will consist of frequent, tightly-scoped programming and system design assignments; expeditions through game engine source code; and two group projects and #8212; one in an engine created from scratch, and one that requires modification of an existing engine. Prerequisites: Students will be expected to be fluent in at least one programming language. We will be working with C++, Javascript, and a smattering of Python. We will be using git for version control and code sharing. The assignments in the course will be designed to be completed on an OSX or Linux workstation (e.g. the IDeATe "virtual cluster"). Working with Windows will be possible, but might require extra effort. We will be building a 3D model pipeline around Blender, but no prior knowledge of the tool will be assumed.
Prerequisites: 62-150 Min. grade C or 15-213 Min. grade C or 15-104 Min. grade C or 15-112 Min. grade C

16-467 Introduction to Human Robot Interaction: Spring: 12 units
The field of human-robot interaction (HRI) is fast becoming a significant area of research in robotics. The basic objective is to create natural and effective interactions between people and robots. HRI is highly interdisciplinary, bringing together methodologies and techniques from robotics, artificial intelligence, human-computer interaction, psychology, education, and other fields. This course is primarily lecture-based, with in-class participatory mini-projects, homework assignments, a group term project that will enable students to put theory to practice, and a final. The topics covered will include technologies that enable human-robot interactions, the psychology of interaction between people and robots, how to design and conduct HRI studies, and real-world applications such as assistive robots. This course has no prerequisites, but some basic familiarity with robots is recommended (programming knowledge is not necessary, but is useful for the term project).

Course Website: http://harp.ri.cmu.edu/courses

16-469 Innovation and Shared Prosperity: Community-engagement for change: Fall: 12 units
How might we, as a community of learners, utilize our collective talents for innovation and shift our society towards greater justice? In this course we will cover the historical and social context of university-community engagement, discuss best practices in engagement efforts, and operationalize emergent strategy alongside design justice principles. Learnings from this course will foster the growth of lifelong dispositions and habits that can empower learners to chart a course for their personal careers that are consonant with community empowerment and societal equity. This class is for individuals interested in pursuing a career at the intersection of technology and societal equity or for individuals who are interested in issues of justice and equity more broadly. Learning methods for this course will include readings, reflections, and in-class discussions. Students in this class will be asked to draw on their own experiences and to explore case studies. We also anticipate that students will directly engage with local community as facilitated through existing connections with the Center for Shared Prosperity.

16-474 Robotics Capstone: Spring: 12 units
In this course students refine the design of, build, integrate, test, and demonstrate the robot they designed in the prerequisite Systems Engineering course (16-450). The students are expected to continue to apply the process and methods of systems engineering to track requirements, evaluate alternatives, refine the cyberphysical architectures, plan and devise tests, verify the design, and validate system performance. The course consists of lectures, class meetings, reviews, and a final demonstration. Lectures cover special topics in project management. During class meetings the students and instructor review progress on the project and discuss technical and project-execution challenges. There are three major reviews, approximately at the end of each of the first three months of the semester. For each review, students give a presentation and submit an updated version of the System Design and Development Document. The course culminates in a System Performance Validation Demonstration at the end of the semester. Students also hold a special demonstration of their robotic system for the broader Robotics community.
Prerequisite: 16-450 Min. grade C

16-480 IDeATe: Creative Soft Robotics: Spring: 10 units
This experimental course offers unique topics situated at the intersection of robotics research and the arts, with a specific research focus that varies each semester. In this course, students survey the state of an emerging research area, then design and fabricate experimental systems and artworks on the theme. Students are guided through literature search and technical paper analysis to identify opportunities and techniques. The textual study spans contemporary robotics and arts literature. The project component is research-focused and explores novel techniques in design, fabrication, programming, and control. The project sequence culminates in the collaborative design of expressive robotic systems which match technical innovation with a human need or artistic expression. The initial iteration of the course focuses on soft robotics, an emerging discipline centered on devices constructed from compliant materials that incorporate sensing and actuation. The literature survey spans soft robotics and kinetic sculpture. The projects center on fabricating forms that incorporate actuators and sensors using silicone rubber cast into 3D-printed and laser-cut molds. This course is offered by IDeATe and this iteration will satisfy minor requirements for IDeATe Soft Technologies or IDeATe Physical Computing.

Course Website: https://courses.ideate.cmu.edu/16-480

16-595 Undergraduate Independent Study: All Semesters
For students to pursue an independent study with a Robotics Institute faculty member.

16-597 Undergraduate Reading and Research: All Semesters
Undergraduate Reading and Research enables students to gain academic credits for conducing independent studies in robotics. Students must work with a robotics faculty advisor to devise a specific objective, activities (such as reading, evaluating, designing, coding, building, or testing robotic systems) and metrics for evaluation of their performance by their advisor.

16-621 MSCV Project I: Spring: 12 units
The MSCV capstone project course is designed to give project teams additional feedback on their capstone project from peers and faculty. Every week, capstone teams will present their project PPFs (Past-Present-Future) reports. For the presenting teams, the capstone course will help develop presentation and communication skills. For the students participating as peer-reviewers, it will help develop critical thinking and the ability to give constructive advice.

Course Website: https://piazza.com/cmu/spring2019/16621

16-622 MSCV Capstone: Fall: 12 units
The MSCV capstone project course is designed to give project teams additional feedback on their capstone project from peers and faculty. Every week, capstone teams will present their project PPFs (Past-Present-Future) reports. For the presenting teams, the capstone course will help develop presentation and communication skills. For the students participating as peer-reviewers, it will help develop critical thinking and the ability to give constructive advice.

16-623 Advanced Computer Vision Apps.: Fall: 12 units
Computer vision is a discipline that attempts to extract information from images and videos. Nearly every smart device on the planet has a camera, and people are increasingly interested in how to develop apps that use computer vision to perform an ever expanding list of things including: 3D mapping, photo/image search, people/object tracking, augmented reality etc. This course is intended for graduate students who are familiar with computer vision, and are keen to learn more about the applying state of the art vision methods on smart devices and embedded systems. A strong programming background is a must (at a minimum good knowledge of C/C++), topics will include using conventional computer vision software tools (OpenCV, MATLAB toolboxes, VLFeat, CAFFE, Torch 7), and development on iOS devices using mobile vision libraries such as GPUImage, Metal and fast math libraries like Armadillo and Eigen. For consistency, all app development will be in iOS and it is expected that all students participating in the class have access to an Intel-based MAC running OS X Mavericks or later. Although the coursework will be focused on a single operating system, the knowledge gained from this class will easily generalize to other mobile platforms such as Android etc.
Prerequisites: 16-385 or 16-720
Course Website: http://16623.courses.cs.cmu.edu

16-627 MSCV Seminar: Fall
(Only open to MSCV students.) MSCV students will be required to participate in this one-semester seminar course which will prepare them for the MSCV project starting in the Spring semester. The first part of this course will cover talks by computer vision and related faculty about the ongoing research, development programs related to Computer Vision at CMU. The second part of this course will include student/faculty tutorial on topics such as OpenCV, Dataset Creation, Mechanical Turk etc. The goal of this series is to get students acquainted with practical knowledge for a successful project. In the last month of the course, each lecture will cover upto four possible MSCV projects pitched by faculty or industrial sponsors. At the end of the course students will turn in their choices, and a faculty committee will assign them the final projects.

16-633 Special Topic: Robot Cognition and Learning: Spring: 12 units
This is open to both Grad and Undergrad students. This project class focuses on developing cognitive and learning systems for robots. Students will become familiar with and use state of the art software tools to build prototype systems, as well as how to evaluate these systems. The course project will involve implementing a cognitive/learning system on a real robot. For undergraduates, this course is an elective for the Robotics Major.

Course Website: https://www.cs.cmu.edu/~cga/cog/

16-639 Special Topic: Scalable Robotic Systems: Infrastructure Development/Deployment: Spring: 12 units
As robots continue to permeate various sectors such as healthcare, manufacturing, and autonomous transportation, the ability to build and scale robust robotic systems has become increasingly crucial. This course aims to bridge the gap between single-robot deployments and large-scale robotic systems, providing students with a comprehensive understanding of the processes and tools necessary to scale their robotic projects.

16-663 F1Tenth Autonomous Racing: Spring: 12 units
This hands-on, lab-centered course is for senior undergraduates and graduate students interested in the fields of artificial perception, motion planning, control theory, and applied machine learning. It is also for studentsinterested in the burgeoning field of autonomous driving. This course introduces the students to the hardware, software and algorithms involved in building and racing an autonomous race car. Every week, students take two lectures and complete an extensive hands-on lab. By Week 6, the students will have built, programmed and driven a 1/10th scale autonomous race car. By Week 10, the students will have learned fundamental principles in perception, planning and control and will race using map-based approaches. In the last 6 weeks, they develop and implement advanced racing strategies, computer vision and machine learning algorithms that will give their team the edge in the race that concludes the course.

16-664 Self-Driving Cars: Perception & Control: Fall: 12 units
This course will teach the theoretical underpinnings of self-driving car algorithms and the practical application of the material in hands-on labs. Topics will include deep learning, computer vision, sensor fusion, localization, trajectory optimization, obstacle avoidance, and vehicle dynamics.

16-665 Robot Mobility on Air, Land, & Sea: Fall: 12 units
Required core course for MRSD first-year students. Many robots are designed to move through their environments. Three prevalent environments on earth are land, air, and water. This course will explore the modeling, control, and navigation of ground-based (wheeled and legged), air-based (rotorcraft such as quadcopters), and water-based robots.

16-667 Autonomous Air Vehicle Design and Development: All Semesters: 12 units
OPEN TO GRADUATE AND UNDERGRADUATE STUDENTS; Autonomous Air Vehicles are finding new applications in Civil Air Transportation and Emergency Response scenarios. They carry passengers and valuable supplies and must be certified to operate in both urban and rural areas, close to people, buildings, highways, mountains, and dense forest canopies. This presents significant challenges to perception, control systems, and navigation through austere environments. The design limits and flight operations of the aircraft must be understood to be certified by the FAA. In Autonomous Air Vehicle Development, students will design, develop, and test prototype autonomous aircraft for specific missions defined by the new HeroX GoAero Challenge. This multidisciplinary course will go from concept to test and challenge students to apply sound theoretic approaches to a practical design. Students will learn how to design and build resilient autonomous air vehicle systems and the challenges of real-world design, operations, certification, and testing.

Course Website: https://www.herox.com/goaero

16-675 Manufacturing Futures: Spring: 12 units
The course will introduce an array of technologies that will contribute to the future of making things and will be organized into 4 logical modules that will culminate in a team-based design project. Module 1 (Manufacturing Visions and Design Methodolgy): David Bourne. Module 2 (Manufacturing Processes and Process Tradeoffs): Brandon Bodily. Module 3 (Electronic Manufacturing): Rahul Panat. Module 4 (Workforce Development) : David Bourne.

16-682 Robotic Systems Development Project Course II: Fall: 15 units
Required core course for MRSD second-year students. This course is the second semester in a two-semester sequence intended to enable student teams to design and implement robot systems from the requirements development phase through implementation, verification, and demonstration of a working prototype. Teams of 4-5 students continue work on a project provided by industrial and academic partners, refine design requirements, refine or create new subsystems, and integrate and demonstrate the full system.

16-714 Advanced Control for Robotics: Fall: 12 units
This course will discuss advanced control algorithms that can make robots behave more intelligently. This course is directed to studentsprimarily graduate although talented undergraduates are welcome as wellinterested in advanced control.
Prerequisite: 16-711 Min. grade C

16-715 Advanced Robot Dynamics and Simulation: Fall: 12 units
This course explores the fundamental mathematics behind modeling the physics of robots, as well as state-of-the-art algorithms for robot simulation. We will review classical topics like Lagrangian mechanics and Hamilton's Principle of Least Action, as well as modern computational methods like discrete mechanics and fast linear-time algorithms for dynamics simulation. A particular focus of the course will be rigorous treatments of 3D rotations and non-smooth contact interactions (impacts and friction) that are so prevalent in robotics applications. We will use numerous case studies to explore these topics, including quadrotors, fixed-wing aircraft, wheeled vehicles, quadrupeds, humanoids, and manipulators. Homework assignments will focus on practical implementation of algorithms and a course project will encourage students to apply simulation methods to their own research.

16-720 Computer Vision: Fall and Spring: 12 units
Section A is a required core course for MRSD first-year students, and Section B is a required core course for MSCV students. This course introduces the fundamental techniques used in computer vision, that is, the analysis of patterns in visual images to reconstruct and understand the objects and scenes that generated them. Topics covered include image formation and representation, camera geometry, and calibration, computational imaging, multi-view geometry, stereo, 3D reconstruction from images, motion analysis, physics-based vision, image segmentation and object recognition. The material is based on graduate-level texts augmented with research papers, as appropriate. Evaluation is based on homeworks and a final project. The homeworks involve considerable Python programming exercises. Texts recommended but not required: Title: "Computer Vision Algorithms and Applications" Author: Richard Szeliski Series: Texts in Computer Science Publisher: Springer ISBN: 978-1-84882-934-3 Title: "Computer Vision: A Modern Approach" Authors: David Forsyth and Jean Ponce Publisher: Prentice Hall ISBN: 0-13-085198-1

Course Website: http://www.andrew.cmu.edu/course/16-720/

16-725 (Bio)Medical Image Analysis: Spring: 12 units
Students will gain theoretical and practical skills in 2D, 3D, and 4D biomedical image analysis, including skills relevant to general image analysis. The fundamentals of computational medical image analysis will be explored, leading to current research in applying geometry and statistics to segmentation, registration, visualization, and image understanding. Additional and related covered topics include de-noising/restoration, morphology, level sets, and shape/feature analysis. Students will develop practical experience through projects using the latest version of the National Library of Medicine Insight Toolkit ( ITK ) and SimpleITK, a popular open-source software library developed by a consortium of institutions including Carnegie Mellon University and the University of Pittsburgh. In addition to image analysis, the course will include interaction with radiologists and pathologist(s). *** Lectures are at CMU and students will visit clinicians at UPMC. Some or all of the class lectures may also be videoed for public distribution, but students may request to be excluded from distributed video. 16-725 is a graduate class, and 16-425 is a cross-listed undergraduate section. 16-425 is new this year, and has substantially reduced requirements for the final project and for the larger homework assignments, nor does it require shadowing the clinicians. Prerequisites: Knowledge of vector calculus, basic probability, and either C++ or python, including basic command-line familiarity and how to pass arguments to your own command-line programs. Extensive expertise with C++ and templates is not necessary, but some students may find it helpful.

Course Website: http://www.cs.cmu.edu/~galeotti/methods_course/

16-726 Learning-based Image Synthesis: Spring: 12 units
This course introduces machine learning methods for image and video synthesis. The objectives of synthesis research vary from modeling statistical distributions of visual data, through realistic picture-perfect recreations of the world in graphics, and all the way to providing interactive tools for artistic expression. Key machine learning algorithms will be presented, ranging from classical learning methods (e.g., nearest neighbor, PCA) to deep learning models (e.g., ConvNets, NeRF, deep generative models, including GANs, VAEs, autoregressive models, and diffusion models). Finally, we will discuss image and video forensics methods for detecting synthetic content. In this class, students will learn to build practical applications and create new visual effects using their own photos and videos.

16-730 Robotics Business: Spring: 12 units
This course introduces and develops business concepts that will be useful to new and existing companies, while focusing on robotic technology exemplars. The concepts begin with how to identify a new idea to for a business that can be effectively started. Initial ideas often start as a grandiose plan to change the world and these plans are legitimately the fuel that drive new businesses forward. However, when a company starts (e.g., builds a prototype or writes a first line of code), what is the least product a company can produce that customers still want and need? This kernel and #8212; extracted from the "big plan" and #8212; is a Minimal Viable Product (MVP). Once an MVP business kernel is formulated, we will learn and study how to understand customer needs, how to market a new idea and how raise and manage money for a new business entity. These steps abridge information that can be found in an MBA curriculum, but engineers and scientists focused on the technical side will need this information to participate in the process of building companies. In parallel, we will investigate the marketplace through the stock market. The stock market is a powerful window into the world of business. In other words, when a new business is built it has to live inside the competitive environment of every other business. To understand this eco-system, we will follow several companies in-situ as they go through their own ups-and-downs within the business world. The course is project based. Each student will either build their own business concept, or they will build an improvement plan that would be targeted to improve an existing business. Professor Bourne is a founding member of the Robotics Institute(1979) and has taught business concepts within the Tepper Business School and the Robotics Institute since 1988. In addition, he is the President of his own company Design One Software.

16-735 Ethics and Robotics: Intermittent: 12 units
This course contextualizes robotics, AI, and machine learning within cultural conversation, ethics, and power relationships in society. It will draw upon "AI and Humanity" as well as numerous other texts, including Mindless by Simon Head, Drone Theory by Gr and #233;goire Chamayou, and news articles. The course will culminate in team-based design and futuring project addressing the ways in which robotic technologies will influence society and values in the near future. Our target audience is students who will participate in computer science and robotics research and can use this course to inform future research and career decisions.

Course Website: https://vdean.github.io/16-735-ethics-robotics.html

16-737 Special Topic: Research to Startup: creating a startup from robotics research: Intermittent: 12 units
(This course is offered only to Ph.D. students in SCS, or with instructor permission.) This course is for Ph.D. students interested in exploring turning their research into a startup. Advances in AI and robotics have opened exciting opportunities for robotics-based startups. But with that comes challenges. In this class, students will form small teams to take an idea based in part on their research and work through the early steps of converting it into a company. This will require taking a dispassionate view of your research as a product or service and assessing its market and value. Each team will work through customer discovery, vetting ideas, creating and communicating a vision and strategy, fundraising, and building a product. We will have guest lectures and discussions where we will learn from the experiences of people who have created startups. We will learn about CMU resources to help with IP and technology transfer and discuss open-source strategies. We will discuss leveraging Ph.D. students' honed research skills to be successful company founders and #8212;e.g., related work investigations, presentations, and time management. We will emphasize the difference between research and commercial software and provide tools, technologies, and methodologies for a software development lifecycle. We cannot cover everything you need to know in one semester, but we will expose you to the essential aspects necessary to get started.

16-740 AI for Manipulation: Spring: 12 units
Manipulation is the process of changing the state of objects through direct physical interactions. To perform manipulation tasks in unstructured environments, autonomous robots will need to learn about the objects in their surroundings as well as the skills required to manipulate and change the state of these objects. In this course, we explore the use of machine learning and data-driven algorithms for robot manipulation. The course introduces students to the wide variety of challenges posed by manipulation tasks, and how these challenges can be formulated as learning problems. Students are taught how these problems can be solved using machine learning techniques. The types of machine learning methods covered in this course include supervised, unsupervised, active, and reinforcement learning methods. The course includes both lectures and guided paper discussions.

16-741 Mechanics of Manipulation: Fall: 12 units
Mechanics of Manipulation is a graduate level course that dives into the fundamentals of robotic manipulation. Through this course you will learn the kinematics, statics, and dynamics of robotic manipulators as they interact with the world to accomplish tasks. You will gain experience with the intelligent use of kinematic constraint, gravity, and frictional forces. Additional topics include rigid body mechanics, automatic planning based on mechanics, deformable manipulation, and simulation of dynamic manipulation. Applications of robotic manipulation are drawn from physical human-robot interaction, manufacturing, and other domains.

Course Website: http://www.cs.cmu.edu/afs/cs/academic/class/16741-s07/www/index.html

16-742 Geometry of Locomotion: Fall: 12 units
This course introduces geometric methods for the analysis of locomoting systems. Focusing on the kinematics of locomoting systems, the course covers topics from differential geometry, geometric mechanics, and motion planning . Specific topics include configuration spaces, manifolds, groups, Lie groups, representations of velocity, holonomic and nonholonomic constraints, constraint curvature, response to cyclic inputs and distance metrics. The primary goal of this class is to develop an intuitive understanding of these concepts and how they are used in locomoting systems, rather than working through a set of formal proofs and derivations. We do, however, incorporate enough mathematical formalism for this class to serve as a starting point for further investigation into this topic area. We also call upon biological data, when available, and relate to the mathematical formalisms in the class.

16-745 Optimal Control and Reinforcement Learning: Spring: 12 units
This is a course about how to make robots move through and interact with their environment with speed, efficiency, and robustness. We will survey a broad range of topics from nonlinear dynamics, linear systems theory, classical optimal control, numerical optimization, state estimation, system identification, and reinforcement learning. The goal is to provide students with hands-on experience applying each of these ideas to a variety of robotic systems so that they can use them in their own research.

Course Website: http://www.cs.cmu.edu/~cga/dynopt/

16-748 Underactuated Robots: Fall: 12 units
People and animals move through and interact with the world in a fundamentally dynamic way. In the vast majority of cases the same cannot be said for robots. In fact, many conventional approaches to motion planning and robot control attempt to explicitly cancel out the dynamics associated with different tasks. This class will consider underactuated robots, systems that do not have full control over their state and therefore cannot be planned for or controlled via conventional methods. Our goal will be to make novel locomoting robots act more "naturally." This class will highlight the relationship between conventional ideas from deterministic motion planning and control design (e.g., dynamic programming and linear-quadratic regulators) and their contemporary counterparts, many of which help form the analytical basis for the probabilisitic reasoning that underlies contemporary AI systems (e.g., POMDPs). Note that this course is inspired by and, for the most part, will follow the format of "Underactuated Robotics: Learning, Planning, and Control for Efficient and Agile Machines" created by Prof. Russ Tedrake at MIT. We will take several tangents, but the course materials provided by Prof. Tedrake through MIT Open Courseware are an incredible resource for this course (and really just in general).

16-761 Mobile Robots: Spring: 12 units
The course is targeted to graduate level students. The lectures will develop the fundamentals for enabling autonomy of multi rotor aerial vehicles. Students will individually complete assignments related to autonomous quadrotor flight, including motion planning, control, dynamics, state estimation, and perception. The class will culminate in a final project in which students may work together in groups or individually to enhance the autonomy capabilities developed through the assignments.

Course Website: https://mr-cmu.github.io

16-762 Mobile Manipulation: Spring: 12 units
In this project-based course, you'll learn about mobile manipulation through hands-on experience working with real mobile manipulators. You'll gain experience with teleoperation, autonomy, perception, navigation, manipulation, and human-robot interaction, all within the context of mobile manipulators. You'll also learn about robot design, collaborative research, and applications for mobile manipulators.

16-765 Robotics & AI for Agriculture: Spring: 12 units
Robotics and artificial intelligence technologies have the potential to increase the efficiency, long-term sustainability, and profitability of agricultural production methods. This class will introduce common aspects of agricultural systems, the AI/Robotics tools that are being used to address them, and key research challenges looking forward. Technical topics include IoT sensor networks, in-field computer vision, 3D crop mapping and modeling, mobile robot navigation, and robotic manipulation of plants. Course sessions will be split evenly between lectures by the instructor and student-led discussion of relevant papers from the contemporary research literature.

16-778 Mechatronic Design: Spring: 12 units
Mechatronics is the synergistic integration of mechanism, electronics, and computer control to achieve a functional system. This course is a semester-long multidisciplinary capstone hardware project design experience in which small (typically four-person) teams of electrical and computer engineering, mechanical engineering and robotics students deliver an end-of-course demonstration of a final integrated system capable of performing a mechatronic task. Throughout the semester, the students design, configure, implement, test and evaluate in the laboratory devices and subsystems culminating in the final integrated mechatronic system. Lectures will complement the laboratory experience with comparative surveys, operational principles, and integrated design issues associated with the spectrum of mechanism, microcontroller, electronic, sensor, and control components.

Course Website: http://www.ece.cmu.edu/courses/items/18578.html

16-782 Planning and Decision-making in Robotics: Fall: 12 units
Planning and Decision-making are critical components of autonomy in robotic systems. These components are responsible for making decisions that range from path planning and motion planning to coverage and task planning to taking actions that help robots understand the world around them better. This course studies underlying algorithmic techniques used for planning and decision-making in robotics and examines case studies in ground and aerial robots, humanoids, mobile manipulation platforms and multi-robot systems. The students will learn the algorithms and implement them in a series of programming-based projects.

16-785 Integrated Intelligence in Robotics: Vision Language Planning: Intermittent: 12 units
This is a project-oriented course that covers interdisciplinary topics on cognitive intelligence in robotic systems. Cognitive abilities constitute high-level, humanlike intelligence that exhibits reasoning or problem-solving skills. Such abilities as semantic perception, use of language, and task planning can be built on top of low-level robot autonomy. The topics covered generally bridge across multiple technical areas, for example, vision-language intersection and language-action/plan grounding. The project theme in Spring 2023 is "movie making" that presents various robotics and machine learning challenges ranging from content generation such as scenario generation or scene/video synthesis/editing to robotics automation such as autonomous camera control or autonomous stop-motion control. This course is composed of 50% lectures and 50% seminar classes. The course objectives will also put a special emphasis on learning research skills, e.g., problem formulation, literature review, ideation, evaluation planning, results analysis, and hypothesis verification. The course is discussion intensive, and thus attendance is required.

Course Website: http://www.cs.cmu.edu/~jeanoh/16-785/

16-791 Applied Data Science: Spring: 12 units
This course explores the rapidly developing field of data science in the context of its pragmatic applications. Applied Data Science strives to achieve three main goals. The first is to optimize the efficacy of decision making by human managers. The second is to maximize the utilization of available data, so that no important clue is ever missed. The third is to improve understanding of data and the underlying processes that produce it. This course aims at building skills required to systematically achieve those goals in practice. The students will gain and solidify awareness of the most prevalent contemporary methods of Data Science, and develop intuition needed for assessing practical utility of the studied topics in application scenarios. They will be able to learn how to formulate analytic tasks in support of project objectives, how to define successful analytic projects, and how to evaluate utility of existing and potential applications of the discussed technologies in practice.

16-792 Applied Machine Learning: Intermittent
This course explores the rapidly developing field of machine learning in the context of its pragmatic applications. The domain of Applied Machine Learning strives to achieve three main goals. The first is to build effective models to optimize the efficacy of decision-making. The second is to maximize the utilization of available data so that no important clue is ever missed. The third is to gain or improve an understanding of data and the underlying processes that produce it. Students are required to register for 9 units to receive credit for lectures but may also register for 12 units which will include 3 units of capstone project.

16-820 Advanced Computer Vision: Fall: 12 units
16-820 is a required core course for MSCV students and is intended to move at a slightly faster pace compared to 16-720. This course introduces the fundamental techniques used in computer vision, that is, the analysis of patterns in visual images to reconstruct and understand the objects and scenes that generated them. Topics covered include camera geometry and calibration, multi-view stereo, 3D reconstruction, image detection, segmentation, and tracking, and physics-based vision. The homeworks involve considerable Python programming exercises.

16-823 Physics-based Methods in Vision (Appearance Modeling): Intermittent: 12 units
Everyday, we observe an extraordinary array of light and color phenomena around us, ranging from the dazzling effects of the atmosphere, the complex appearances of surfaces and materials, and underwater scenarios. For a long time, artists, scientists, and photographers have been fascinated by these effects, and have focused their attention on capturing and understanding these phenomena. In this course, we take a computational approach to modeling and analyzing these phenomena, which we collectively call "visual appearance". The first half of the course focuses on the physical fundamentals of visual appearance, while the second half of the course focuses on algorithms and applications in a variety of fields such as computer vision, graphics and remote sensing and technologies such as underwater and aerial imaging.
Prerequisites: 16-385 or 16-720 or 15-462 or 16-820
Course Website: http://www.cs.cmu.edu/afs/cs/academic/class/16823-f06/

16-824 Visual Learning and Recognition: Spring: 12 units
This graduate-level computer vision course focuses on representation and reasoning for large amounts of data (images, videos, associated tags, text, GPS locations, etc.) toward understanding the visual world surrounding us. We will be reading an eclectic mix of classic and recent papers on topics including Theories of Perception, Mid-level Vision (Grouping, Segmentation, Poses), Object and Scene Recognition, 3D Scene Understanding, Action Recognition, Multimodal Perception, Language and Vision Models, Deep Generative Models, Efficient Neural Networks, and more. We will cover a wide range of supervised, semi-supervised, self-supervised, and unsupervised approaches for each topic above.
Prerequisites: 15-781 Min. grade B or 16-720 Min. grade B or 16-722 Min. grade B or 10-701 Min. grade B or 16-385 Min. grade B

Course Website: https://visual-learning.cs.cmu.edu/

16-825 Learning for 3D Vision: Spring: 12 units
Any autonomous agent we develop must perceive and act in a 3D world. The ability to infer, model, and utilize 3D representations is therefore of central importance in AI, with applications ranging from robotic manipulation and self-driving to virtual reality and image manipulation. While 3D understanding has been a longstanding goal in computer vision, it has witnessed several impressive advances due to the rapid recent progress in (deep) learning techniques e.g. differentiable rendering, single-view 3D prediction. The goal of this course is to explore this confluence of 3D Vision and Learning-based Methods.

16-831 Introduction to Robot Learning: Fall and Spring: 12 units
Robots need to make sequential decisions to operate in the world and generalize to diverse environments. How can they learn to do so? This is what we call the "robot learning" problem and it spans topics in machine learning, visual learning and reinforcement learning. In this course, we will learn the fundamentals of topics in machine/deep/visual/reinforcement-learning and how such approaches are applied to robot decision making. We will study fundamentals of: 1) machine (deep) learning with emphasis on approaches relevant for cognition, 2) reinforcement learning: model-based, model-free, on-policy (policy gradients), off-policy (q-learning), etc.; 2) imitation learning: behavior cloning, dagger, inverse RL and offline RL.; 3) visual learning geared towards cognition and decision making including topics like generative models and their use for robotics, learning from human videos, passsive internet videos, language models; and 4) leveraging simulations, building differentiable simulations and how to transfer policies from simulation to the real world; 5) we will also briefly touch topics in neuroscience and psychology that provide cognitive motivations for several techniques in decision making. Throughout the course, we will look at many examples of how such methods can be applied to real robotics tasks as well as broader applications of decision making beyond robotics (such as online dialogue agents etc.). The course will provide an overview of relevant topics and open questions in the area. There will be a strong emphasis on bridging the gap between many different fields of AI. The goal is for students to get both the high-level understanding of important problems and possible solutions, as well as low level understanding of technical solutions. We hope that this course will inspire you to approach problems in congnition and embodied learning from different perspectives in your research. (As of 3/21/2023)

Course Website: https://docs.google.com/document/d/1Lx2IkUMvtETH52ZMl7eySZX3yLWQnED746ET9g_tte0/edit?usp=sharing

16-833 Robot Localization and Mapping: Spring: 12 units
Robot localization and mapping are fundamental capabilities for mobile robots operating in the real world. Even more challenging than these individual problems is their combination: simultaneous localization and mapping (SLAM). Robust and scalable solutions are needed that can handle the uncertainty inherent in sensor measurements, while providing localization and map estimates in real-time. We will explore suitable efficient probabilistic inference algorithms at the intersection of linear algebra and probabilistic graphical models. We will also explore state-of-the-art systems.

Course Website: http://frc.ri.cmu.edu/~kaess/teaching/16833/Spring2018

16-845 Insects and Robots: Fall: 12 units
This course will cover all facets of modeling, design, fabrication, and analysis of robots operating on the insect scale, with a microrobotics perspective. Insects can perform different tasks, such as manipulation or locomotion, with their small scale bodies varying from 200m to 16cm length. Similarly, we can define a micro-robotic system as an autonomous or semi-autonomous device with features on the micron scale or that make use of micron-scale physics for mobility or manipulation of objects. Due to their small size scales, microrobots will encounter difficulties unlike their macro-scale counterparts, in terms of fabrication and autonomy. In this project-based course, our aim will be on learning the physics of scaling, fabrication paradigms, actuation and sensing strategies, with numerous case studies, and to build an insect-inspired robotic system. We will also discuss multiple applications such as surgical robotics, mobile microrobots, multi-agent systems, and micro/nano manipulation.

16-848 Hands: Design and Control for Dexterous Manipulation: Spring: 12 units
Research related to hands has increased dramatically over the past decade. Robot hand innovation may be at an all time high, with new materials and manufacturing techniques promoting an explosion of ideas. Hands have become a priority in virtual reality and telepresence. Even the study of how people use their hands is seeing the growth of new ideas and themes. With all of this attention on hands, are we close to a breakthrough in dexterity, or are we still missing some things needed for truly dexterous manipulation? In this course, we will survey robotic hands and learn about the human hand with the goal of pushing the frontiers on hand design and control for dexterous manipulation. We will consider the necessary kinematics and dynamics for dexterity, what sensors are required to carry out dexterous interactions, the importance of reflexes and compliance, the role of machine learning in grasping and manipulation, and the challenge of uncertainty. We will explore state of the art manufacturing and design techniques, including innovations in soft robotics and embedded sensing. We will examine the human hand: its structure, sensing capabilities, human grasp choice and control strategies for inspiration and benchmarking. Students will be asked to present one or two research papers, participate in discussions and short research or design exercises, and carry out a final project.

Course Website: http://graphics.cs.cmu.edu/nsp/course/16899-s18/

16-855 Special Topics: Tactile Sensing and Haptics: Spring: 12 units
Touch is an important perception modality for both humans and robots. This course aims at providing an overview of the touch perception system for both robots and humans, and provide students with some hands-on experience with the popular touch sensors and devices. On the side of robot sensing, the course will cover the topics on the working principles and designs of robot touch sensors, signal processing algorithms for tactile sensing, and the application of tactile sensing in different robotic tasks; on the side of haptics, the course will introduce the neurological and cognitive study in human haptic system, and the designs and applications of haptic devices that provide a human-machine interface. The human-machine interface is a core part of Virtual Reality (VR) and teleoperation of robots when touch is involved. The course includes lectures, research paper presentation and discussion, and course projects with tactile sensors or haptic devices.

16-873 Spacecraft Design-Build-Fly Laboratory: Fall and Spring: 12 units
Spacecraft design is a truly interdisciplinary subject that draws from every branch of engineering. This course integrates broad skillsets from mechanical engineering, electrical and computer engineering, computer science, and robotics toward the goal of designing, building, testing, and flying a small spacecraft over the course of two semesters. Students will engage directly in all aspects of the spacecraft mission lifecycle from initial requirements definition through mission operations. YES, WE ARE REALLY GOING TO LAUNCH A SATELLITE INTO SPACE AS PART OF THIS COURSE. Students will work in subsystem teams, each focusing on some aspect of the spacecraft, but will be exposed to many different disciplines and challenges. Practical, hands-on, engineering skills will be emphasized, along with building and testing physical hardware and flight software.

16-874 Spacecraft Design-Build-Fly Laboratory 2: Spring: 12 units
(ENROLLMENT IS BY INSTRUCTOR APPROVAL ONLY) This course is a continuation of 16-/18-873, and together these two courses make a sequence culminating in the launch of the satellite designed and built over two consecutive semesters. Spacecraft design is a truly interdisciplinary subject that draws from every branch of engineering. This course integrates broad skillsets from mechanical engineering, electrical and computer engineering, computer science, and robotics toward the goal of designing, building, testing, and flying a small spacecraft over the course of two semesters. In this, the second semester of the two-semester sequence, students will work in subsystem teams to fabricate spacecraft components and finally integrate them into a complete spacecraft by the end of the semester. YES, WE ARE REALLY GOING TO LAUNCH A SATELLITE INTO SPACE AS PART OF THIS COURSE. Practical, hands-on, engineering skills will be emphasized, along with building and testing physical hardware and flight software.

16-878 Advanced Mechatronic Design: Fall: 12 units
This course is designed for students who have a background in mechatronics by having taken a mechatronics design course or through practice. The course will be a combination of laboratories and lectures and will culminate in a class project. The topics covered will be microcontroller hardware subsystems: timer systems, PWM, interrupts; analog circuits, operational amplifiers, comparators, signal conditioning, interfacing to sensors, actuator characteristics and interfacing; C language features for embedded software, register level programming, hardware abstraction layers, event driven programming, state machines, state charts.

16-879 Medical Robotics: Fall: 12 units
This course presents an overview of medical robotics intended for graduate students and advanced undergraduates. Topics include robot kinematics, registration, navigation, tracking, treatment planning, and technical and medical aspects of specific applications. The course will include guest lectures from robotics researchers and surgeons, as well as observation of surgical cases. The course is open to non-majors who have the requisite background.

16-880 Special Topics: Engineering Haptic Interfaces: Spring: 12 units
This course focuses on addressing challenges in the field of haptics from an engineer's perspective. We will begin by studying human haptic perception and an introduction into psychophysics. We will then study the design and control of haptic systems which provide touch feedback to a user. The class format will include lectures, discussion, paper presentations, laboratories and assignments using hardware that will be shipped to the students, and a class project. This class is designed to be a graduate/advanced undergraduate course and requires a background in dynamic systems, mechatronics, and basic programming. Mechanical prototyping, robotics, and feedback control knowledge are useful skills for this class but are not required.

16-881 Seminar Deep Reinforcement Learning for Robotics: Spring: 12 units
Deep RL has a lot of promise to teach robots how to choose actions to optimize sequential decision-making problems, but how can we make deep RL work in the real world? This is a seminar course in which we read papers related to deep learning for robotics and analyze the tradeoffs between different approaches. We will read mostly state-of-the-art papers that were very recently published (e.g. recent CoRL, RSS), but we will also look at some older papers that use different approaches. The goals of the course are to 1) understand what is needed to make deep learning work for robotics 2) analyze the tradeoffs between different approaches. Each class, 2 papers will be presented. These papers will both achieve a similar robotics task but will use different learning-based approaches. The class will discuss these papers and try to understand the strengths and limitations of the approach described in each paper. The list of papers that we will be discussing this year is still to be determined; please see the website for the list of papers that we have used in past semesters: https://sites.google.com/view/16-881-cmu/paper-lists?authuser=0 The seminar is a great followup course to 16-831, 16-884, 10-403, or 10-703.

Course Website: https://sites.google.com/view/16-881-cmu/home?authuser=0

16-882 Systems Engineering and Applied Robotics: Spring: 12 units
This course is intended for graduate students of all disciplines who are interested in learning about Systems Engineering and its application in the development of interdisciplinary technical systems. The first part of the course introduces students to the models, methods, and techniques of Systems Engineering. The second part of the course is a study on the adaptation of Systems Engineering in the development of novel robotic systems in applied fields. Each student in the class will perform a semester long study on a special topic in Systems Engineering and a critical evaluation of the process in the development of innovative robotics for applications in space, mining, agriculture, mining, and others.

16-883 Special Topics: Provably Safe Robotics: Spring: 12 units
Safe autonomy has become increasingly critical in many application domains. It is important to ensure not only the safety of the ego robot, but also the safety of other agents (humans or robots) that directly interact with the autonomy. For example, robots should be safe to human workers in human-robot collaborative assembly; autonomous vehicles should be safe to other road participants. For complex autonomous systems with many degrees of freedom, safe operation depends on the correct functioning of all system components, i.e., accurate perception, optimal decision making, and safe control. This course deals with both the design and the verification of safe robotic systems. From the design perspective, we will talk about how to assure safety through planning, prediction, learning, and control. From the verification perspective, we will talk about verification of deep neural networks, safety or reachability analysis for closed loop systems, and analysis of multi-agent systems.

Course Website: http://www.cs.cmu.edu/~cliu6/provably-safe-robotics.html

16-884 Deep Learning for Robotics: Fall: 12 units
The goal of this course is to study relevant topics towards building intelligent robots that can learn to act and perceive in the real world. The course material should be a self-contained collection of key topics from the intersection of four research areas geared towards this common goal: a) Robot Learning and amp; Deep RL; (b) Computer Vision; (c) Control; (d) Psychology and amp; Neuroscience. This course is geared mainly towards learning and brainstorming. There will be two classes every week. In this first class, instructor will present an in-depth overview of a topic, and then in the second class, students will present instructor-assigned papers related to that topic. There will be no homeworks and just a course project. In the first quarter, we will cover state-of-the-art topics in robot learning (deep RL, inverse RL, etc.) and control (optimal control, dynamic movement primitives, etc.) by studying classical and recent papers in the area. In the second quarter, we will study the role of perception in control and vice-versa to build methods that can learn from high-dimensional raw sensory input. In the third quarter, we will discuss the state of the current understanding of how the brain integrates action and perception. We will also discuss relevant papers from ontogeny (child development literature in Psychology) and phylogeny (evolutionary development literature in Biology) of biological animals that have inspired ideas in learning and robotics. Finally, in the fourth quarter, we will bring these ideas together to brainstorm potential high-level directions that could guide the development of intelligent robots.

16-885 Special Topics: Tactile Sensing and Haptics: Fall: 12 units
Touch is an important perception modality for both humans and robots. This course aims at providing an overview of the touch perception system for both robots and humans. On the side of robot sensing, the course will cover the designs of robot touch sensors, signal processing algorithms for tactile sensing, and the application of tactile sensing in different robotic tasks; on the side of haptics, the course will introduce the neurological and cognitive study in the human haptic system, and the designs and applications of haptic devices that provide a human-machine interface. The course incorporates lectures, research paper presentations, and discussion. The combination of different modules aims to present both the basics and state-of-art research directions in the field.

16-886 Special Topics: Models & Algorithms for Interactive Robotics: Spring: 12 units
Robot interaction with humans is inevitable: autonomous cars navigate through crowded cities, assistive robots help end-users with daily living tasks, and human engineers iteratively tune robot objective functions. In this graduate seminar class, we will build the mathematical foundations for modeling human-robot interaction, investigate algorithms for robot learning from human data, and develop the tools to analyze the safety and reliability of robots deployed around people. The approaches covered will draw upon a variety of tools such as optimal control, dynamic game theory, Bayesian inference, and modern machine learning. Throughout the class, there will also be several guest lectures from experts in the field. Students will practice essential research skills including reviewing papers, debating, writing project proposals, and technical communication.

16-887 Special Topic: Robotic Caregivers and Intelligent Physical Collaboration: Spring: 12 units
Robotics researchers and futurists have long dreamed of robots that can serve as caregivers. In this project-based course, you'll learn about intelligent physical human-robot collaboration and opportunities for robots that contribute to caregiving. You'll gain hands-on experience with teleoperation, autonomy, perception, navigation, manipulation, human-robot interaction, and machine learning. You'll also learn about robot design, collaborative research, and healthcare robotics.

Course Website: https://zackory.com/rc2023/

16-888 Special Topic: Foldable Robots: Origami-inspired design meets mechatronics: Intermittent: 12 units
The way we make robots have changed dramatically since the limitations on the material space was removed. Instead of using "nuts-and-bolts" approach that helped us to make robust, rigid, industrial robots, we can make light-weight, compliant, conformable robots out of paper, fabric, and polymers. In this class, we will explore foldable robots with a multifaceted perspective: Kinematics, design, fabrication, control, and application. We will design and manufacture mechanisms for targeted applications, such as manipulation, bio-inspiration, medical, architecture, using laminates with integrated joints and limited number of actuators.

16-889 Special Topic: Learning for 3D Vision: Spring: 12 units
Any autonomous agent we develop must perceive and act in a 3D world. The ability to infer, model, and utilize 3D representations is therefore of central importance in AI, with applications ranging from robotic manipulation and self-driving to virtual reality and image manipulation. While 3D understanding has been a longstanding goal in computer vision, it has witnessed several impressive advances due to the rapid recent progress in (deep) learning techniques e.g. differentiable rendering, single-view 3D prediction. The goal of this course is to explore this confluence of 3D Vision and Learning-based Methods.

16-890 Special Topic: Robot Cognition for Manipulation: Intermittent: 12 units
This seminar course will cover a mixture of modern and classical methods for robot cognition. We will review papers related to task planning and control using both symbolic and numeric methods. The goal of this course is to give students an overview of the current state of research on robot cognition.

16-891 Multi-Robot Planning and Coordination: Spring: 12 units
The course provides a graduate-level introduction to the field of multi-robot planning and coordination from both AI and robotics perspectives. Topics for the course include multi-robot cooperative task planning, multi-robot path/motion planning, learning for coordination, coordinating robots under uncertainty, etc. The course will particularly focus on state-of-the-art Multi-Agent Path Finding (MAPF) algorithms that can coordinate hundreds of robots with rigorous theoretical guarantees. Current applications for these technologies will be highlighted, such as mobile robot coordination for warehouses, drone swarm control, and multi-arm assembly. The course includes lectures, research paper presentations and discussions, and course projects.

16-892 Seminar: Multimodal Foundational Models: Fall: 12 units
This course will discuss recent foundation models proposed in the literature, with a focus on vision-language models. Topics include large language models, vision-language models, and vision-audio models. As time allows, this course will also discuss application of such models to visual, audio, and video content generation.
Prerequisite: 16-820

16-895 Understanding and Critiquing Generative Computer Vision: Spring: 12 units
In recent years, there have been significant advances in the field of large-scale generative modeling for visual data, such as DALL·E 2 and Stable Diffusion. This seminar course explores these advances beyond just reading and discussion. The goal is to not only inform state of the art but also develop critical and philosophical thinking among students. The course will involve reading papers, presentations, and discussions. The course will also involve reviewing and developing critical thinking.

16-901 RI-JEDI: Intro to Justice, Equity, Diversity, and Inclusion in Robotics: Fall and Spring: 3 units
This course will be offered in the first six weeks of the Fall semester, and will cover topics related to diversity, equity, and inclusion. This will be a companion course to CS-JEDI: 15-996. The course will be discussion-based and feature guest speakers. This course is offered to both graduate and undergraduate students in the RI. Designed specifically with the needs of PhD students in mind, the course is short, flexible, literature-based, framed through the lens of robotics and computer science, and is geared towards building community. We expect the students to spend and lt; 3 hours per week, almost all self-contained within the class time.

Software Engineering Courses

17-200 Ethics and Policy Issues in Computing: Fall and Spring: 9 units
Should autonomous robots make life and death decisions on their own? Should we allow them to select a target and launch weapons? To diagnose injuries and perform surgery when human doctors are not around? Who should be permitted to observe you, find out who your friends are, what you do and say with them, what you buy, and where you go? Do social media and personalized search restrict our intellectual horizons? Do we live in polarizing information bubbles, just hearing echoes of what we already know and believe? As computing technology becomes ever more pervasive and sophisticated, we are presented with an escalating barrage of decisions about who, how, when, and for what purposes technology should be used. This course will provide an intellectual framework for discussing these pressing issues of our time, as we shape the technologies that in turn shape us. We will seek insight through reading, discussion, guest lectures, and debates. Students will also undertake an analysis of a relevant issue of their choice, developing their own position, and acquiring the research skills needed to lend depth to their thinking. The course will enhance students' ability to think clearly about contentious technology choices, formulate smart positions, and support their views with winning arguments.

17-210 Introduction to Social Networks: Spring: 12 units
Course Description What makes a recommendation system on social media effective? Why do YouTube mega-influencers with tens of millions of subscribers exist, yet we have not heard of most of them? Why do echo chambers form and polarization deepen in social media platforms despite the utopian promise of the free flow of information and fluid connectivity between people that these platforms had envisioned? How do professionals land their dream jobs? How does mass adoption of technological innovations happen (e.g., Python, Bitcoin)? Underlying these seemingly unrelated questions is the powerful influence of social networks, the collection of social connections that people form on and offline. This course offers an introduction to the study of social networks as a powerful tool for understanding a wide range of questions and for solving real-world problems arising at the intersection of human social behavior and technological systems. The course first introduces network concepts and their mathematical operationalizations that give social network analysis the versatility for rigorous quantitative analysis. Students will subsequently learn how these building blocks have been applied to analyze and solve a wide range of online social phenomena. Finally, the course will introduce statistical models of networks that enable principled investigation of network formation mechanisms. Throughout this course, students will work towards a final team project that applies network concepts and measures to either (a) describe and/or explain an empirically puzzling social phenomenon with network data, (b) develop a network data collection pipeline that aims to solve a real-world problem, or (c) build a system utiziling the insights from the course that solves a real-world problem. The following class activities throughout the course are intended to support and augment the final project.

17-213 Network Analysis: The Hidden Structures behind the Webs We Weave: Fall: 12 units
Have you wondered how Linux and the subsequent development of open-source software ecosystems could thrive despite weak economic incentives? Why do large-scale complex software systems sometimes fail despite well-developed guardrails and practices? What makes a recommendation system on social media so effective and so toxic at the same time? Why do YouTube mega-influencers with tens of millions of subscribers exist, yet each of us only recognize a handful of them at best? Why do echo chambers form and polarization deepen in social media platforms despite the utopian promise of frictionless connectivity that these platforms initially envisioned? How can you land your dream jobs? How does mass adoption of technological innovations happen (e.g., Python, Bitcoin)? Underlying these seemingly unrelated questions is the powerful influence of social networks, the collection of on- and offline social connections, communications, and collaborations that people form with one another. This course offers an introduction to the study of social networks as a powerful tool for formalizing these wide range of questions, for understanding social dynamics in various settings, and for solving real-world problems arising at the intersection of human social behavior and technological systems. The course first introduces network science concepts and their mathematical operationalizations that give rigorous definitions to fuzzy words we use to describe the social world, such as "status" and "social group". Students will subsequently learn how these network concepts were used to analyze and solve a wide range of puzzling online social phenomena. Finally, the course will introduce statistical models of networks that enable principled investigation of network formation mechanisms.

17-214 Principles of Software Construction: Objects, Design, and Concurrency: Fall and Spring: 12 units
Software engineers today are less likely to design data structures and algorithms from scratch and more likely to build systems from library and framework components. In this course, students engage with concepts related to the construction of software systems at scale, building on their understanding of the basic building blocks of data structures, algorithms, and program and computer structures. The course covers technical topics in four areas: (1) concepts of design for complex systems, (2) object-oriented programming, (3) static and dynamic analysis for programs, and (4) concurrency. At the conclusion of this course, students will have substantial experience building medium-sized software systems in Java or JavaScript.
Prerequisites: (15-122 Min. grade C or 15-121 Min. grade C) and (15-151 Min. grade C or 21-127 Min. grade C or 21-128 Min. grade C)

Course Website: https://www.cs.cmu.edu/~ckaestne/17214/f2021/

17-224 Influence, Persuasion, and Manipulation Online: Fall: 9 units
This course will introduce the fundamental behavioral science of influence, persuasion, and manipulation, and the application of these scientific principles to online campaigns to influence attitudes and behavior. In particular, we will discuss the psychology of persuasion, nudging, social influence, bias, persuasive design, and the ethics of persuasion. Against this background, we will analyze case studies drawn from recent, high profile events such as election campaigns, targeted advertising, sowing political division, memes and virality, impact of social media, and propagation of "fake news." Countermeasures to these tactics will be explored, including personal measures, technologies, and policy.

17-301 Special Topics in Societal Computing: Understanding Cyber Teams: Fall: 9 units
Were you the victim of a ransomware attack today? No? Then you should probably thank your cyber security team! Nowadays, nearly everything modern organizations do is protected by some semblance of a cyber team. These cyber teams come in many forms: security operations center, malware analysis, threat emulation, information technology departments, etc. So what do we know about how these cyber teams operate? In this course cyber teams will be studied through the lens of computational organization theory. Different types of cyber teams will be presented with how they operate within the organization. An array of computational organization theory principles will be explored such as network science, information diffusion, policy analysis, and performance theory. A final project will be completed by each student. This project can be of many types such as policy analysis, virtual experimentation, dynamic network analysis, validation, etc. Students will be using the NetLogo scripting language to complete a project. The project will be created, developed, and presented by the student and approved by the instructor.

17-302 Independent Study Mini Undergraduate: Intermittent
Independent Study Mini

17-303 Cryptocurrencies, Blockchains and Applications: Fall and Spring: 9 units
Cryptocurrencies such as Bitcoin have gained large popularity in recent years, in no small part due to the fantastic potential applications they could facilitate. This course will first provide an overview of the technological mechanisms behind cryptocurrencies and distributed consensus and distributed ledgers ("blockchains"), introducing along the way the necessary cryptographic tools. It will then focus on more advanced blockchain applications, such as "smart contracts," that is, contracts written as code. Finally, the course will also introduce some of the legal and policy questions surrounding cryptocurrencies.

17-313 Foundations of Software Engineering: Fall and Spring: 12 units
Students gain exposure to the fundamental principles of software engineering. This includes both core CS technical knowledge and the means by which this knowledge can be applied in the practical engineering of complex software in real-world settings. Topics related to software artifacts include coding, software architecture, measurement, and quality assurance of various qualities (e.g., robustness, security, performance, maintainability) with static and dynamic analysis, testing, code review, and inspection. Topics related to software process include requirements engineering, process models and evaluation, personal and team development, and supply chain issues including outsourcing and open source. This course has a strong technical focus, a strong focus on developing team skills, and will include both written and programming assignments. Students will get experience with the latest software engineering tools and practices.
Prerequisites: 15-121 or 15-122
Course Website: https://www.cs.cmu.edu/~ckaestne/17313/

17-314 Formal Methods: Fall: 6 units
Scientific foundations for software engineering depend on the use of precise, abstract models for describing and reasoning about properties of software systems. This course considers a variety of standard models for representing sequential and concurrent systems, such as state machines, algebras, and traces. It shows how different logics can be used to specify properties of systems, such as functional correctness, deadlock freedom, and internal consistency. Concepts such as compositionality, abstraction, invariants, non-determinism, and inductive definitions are recurrent themes throughout the course. After completing this course, students will: 1. Understand the strengths and weaknesses of certain models and logics including state machines, algebraic and process models, and temporal logic; 2. Be able to select and describe appropriate abstract formal models for certain classes of systems, describe abstraction relations between different levels of description, and reason about the correctness of refinements; 3. Be able to prove elementary properties about systems described by the models introduced in the course; and 4. Understand some of the strengths and weakness of formal automated reasoning tools. Prerequisites: Undergraduate discrete math including first-order logic, sets, functions, relations, and simple proof techniques such as induction.

17-320 Machine Learning and Sensing for Healthcare: Fall: 12 units
Today's health infrastructure makes it challenging for individuals to equitably access even basic medical resources. In this course, we will learn how to create modern health sensing systems that reimagine the way that healthcare delivery is performed. Specifically, we will learn how to transform ubiquitous smart devices around us like smartphones, speakers, and watches, as well as emerging wearables like earables and smartglasses, into personal medical tricorders that have the ability to provide access to health testing at our fingertips. We will learn how to tap into the rich sensor data streams (e.g. acoustic, vision, IMU) from these devices and understand core techniques in applied signal processing and machine learning to intelligently transform sensor data into clinically-relevant biomarkers which can be used to screen and diagnose diseases at scale. Beyond these techniques, this course delves into the full lifecycle of system building including ideation of frugal designs, iterative prototyping, pilot data collection, visualization, and debugging. Finally, to ensure our systems will have impact in the real-world we will cover important issues of privacy-preserving techniques and regulatory pathways which are important considerations when deploying health research. The course will focus on class discussions, hands-on demonstrations, and tutorials. Students will be evaluated on their class participation, multiple mini projects, and a final team project.

Course Website: https://docs.google.com/spreadsheets/d/1OoZfohCyawAkynDMAQD3k9nH6hHvJ8vueVurtuZs0vo/edit?usp=sharing

17-322 Agile Methods: Fall: 6 units
Agile methods refers to a number of software development approaches that adopt self-organization, adaptive planning, evolutionary development, frequent delivery and working closely with and incorporating feedback from customers throughout the development process as their principles of operation to achieve responsiveness. This course will introduce students to two well known agile methods: Scrum and Kanban, connecting their practices to established group dynamics and knowledge management theories to explain why they work and under what circumstances

17-323 Quality Assurance: Fall: 6 units
This class is fundamentally about software quality assurance and control. This course will introduce various quality assurance tools and techniques to software engineering students. Students will build their "quality toolbox" not only with useful tools and techniques, but with the knowledge of when those tools should be used, how to evaluate their results, and what assurances they can provide. The key learning objectives of the course include: 1. Understand software quality: how to define it, analyze it, and measure it. 2. Select the proper analytical tool/technique for a given situation and explore how to analyze results. 3. Understand the strengths and weaknesses of different quality assurance techniques, such as software testing, static analysis, code review, and demonstration. 4. Learn to collect, manage, and evaluate quality metrics. 5. Analyze and verify a variety of software properties including, but not limited to, functionality, security, reliability, and performance. 6. Gain experience with real quality assurance tools including static analysis tools, software testing frameworks, and software quality measurement tools

17-324 Advanced Formal Methods: Fall: 6 units
This course builds on the introductory Models class to cover more advanced techniques for modeling and reasoning about complex software systems. Concepts introduced in this course include abstraction and refinement, declarative specifications, advanced temporal logics, and probabilistic modeling. The course will also explore applications of modeling and automated reasoning techniques in various domains, such as security, distributed computing, and cyber-physical systems. After completing this course, students will: 1. Understand how to specify and reason about operations over complex system structures, 2. Understand relationships between software artifacts at different levels of abstraction; 3. Be able to model and reason about systems with uncertainty and stochastic behaviors; and 4. Understand potential applications of modeling techniques to practical software engineering problems. Prerequisites: Completion of Mini 1: Models of Software Systems. Sections D, PP and G are NOT available for on-campus students. Admission to the class is by approval from the instructor: If you are not a software engineering master's student, send email to garlan@cs.cmu.edu for permission to enroll. The email should briefly describe your background, whether you have taken a course with similar materials as in Mini 1, and why you would like to take the course. The course must be taken for a letter grade (not pass/fail). This is a graduate level course.
Prerequisite: 17-314 Min. grade B

17-331 Information Security, Privacy, and Policy: Fall: 12 units
As layers upon layers of technology mediate increasingly rich business processes and social interactions, issues of information security and privacy are growing more complex too. This course takes a multi-disciplinary perspective of information security and privacy, looking at technologies as well as business, legal, policy and usability issues. The objective is to prepare students to identify and address critical security and privacy issues involved in the design, development and deployment of information systems. Examples used to introduce concepts covered in the class range from enterprise systems to mobile and pervasive computing as well as social networking. Format: Lectures, short student presentations on topics selected together with the instructor, and guest presentations. Target Audience: Primarily intended for motivated undergraduate and masters students with CS background. Also open to PhD students interested in a more practical, multi-disciplinary understanding of information security and privacy.

17-332 Software Project Management: Spring: 6 units
Projects are temporary organizations set up to achieve a one time objective in an agreed time frame. They are characterized by requiring the execution of interrelated, normally non repeating activities, by multidisciplinary groups. Because of its temporary nature and the interrelatedness of its activities, projects require prescriptive planning, budgeting, staffing and risk management. This course will introduce student to fundamental project management techniques and tools such as activity planning, milestone planning, estimation, work breakdown structures, critical paths. The course will also look at hybrid methods such as Milestone Driven Agile Execution and Disciplined Agile Delivery.

17-333 Privacy Policy, Law, and Technology: Fall: 9 units
This course focuses on policy issues related to privacy from the perspectives of governments, organizations, and individuals. We will begin with a historical and philosophical study of privacy and then explore recent public policy issues. We will examine the privacy protections provided by laws and regulations, as well as the way technology can be used to protect privacy. We will emphasize technology-related privacy concerns and mitigation, for example: social networks, smartphones, behavioral advertising (and tools to prevent targeted advertising and tracking), anonymous communication systems, big data, and drones. This is part of a series of courses offered as part of the MSIT-Privacy Engineering masters program. These courses may be taken in any order or simultaneously. Foundations of Privacy (Fall semester) offers more in-depth coverage of technologies and algorithms used to reason about and protect privacy. Engineering Privacy in Software (Spring semester) focuses on the methods and tools needed to design systems for privacy. This course is intended primarily for graduate students and advanced undergraduate students with some technical background. Programming skills are not required. 8-733, 19-608, and 95-818 are 12-unit courses for PhD students. Students enrolled under these course numbers will have extra assignments and will be expected to do a project suitable for publication. 8-533 is a 9-unit course for undergraduate students. Masters students may register for any of the course numbers permitted by their program. This course will include a lot of reading, writing, and class discussion. Students will be able to tailor their assignments to their skills and interests. However, all students will be expected to do some writing and some technical work.

17-334 Usable Privacy and Security: Spring: 9 units
There is growing recognition that technology alone will not provide all of the solutions to security and privacy problems. Human factors play an important role in these areas, and it is important for security and privacy experts to have an understanding of how people will interact with the systems they develop. This course is designed to introduce students to a variety of usability and user interface problems related to privacy and security and to give them experience in designing studies aimed at helping to evaluate usability issues in security and privacy systems. The course is suitable both for students interested in privacy and security who would like to learn more about usability, as well as for students interested in usability who would like to learn more about security and privacy. Much of the course will be taught in a graduate seminar style in which all students will be expected to do a weekly reading assignment and each week different students will prepare a presentation for the class. Students will also work on a group project throughout the semester. The course is open to all graduate students who have technical backgrounds. The 12-unit course numbers (08-734 and 5-836) are for PhD students and masters students. Students enrolled in these course numbers will be expected to play a leadership role in a group project that produces a paper suitable for publication. The 9-unit 500-level course numbers (08-534 and 05-436) are for juniors, seniors, and masters students. Students enrolled in these course numbers will have less demanding project and presentation requirements.

17-335 Software Architectures: Spring: 6 units
Successful design of complex software systems requires the ability to describe, evaluate, and create systems at an architectural level of abstraction. This course introduces architectural design of complex software systems. The course considers commonly-used software system structures, techniques for designing and implementing these structures, models and formal notations for characterizing and reasoning about architectures, tools for generating specific instances of an architecture, and case studies of actual system architectures. It teaches the skills and background students need to evaluate the architectures of existing systems and to design new systems in principled ways using well-founded architectural paradigms. After completing this course, students will be able to: 1. describe an architecture accurately 2. recognize major architectural styles in existing software systems 3. generate architectural alternatives for a problem and choose among them 4. construct a medium-sized software system that satisfies an architectural specification 5. use existing definitions and development tools to expedite such tasks 6. understand the formal definition of a number of architectures and be able to reason about the properties of those architectures 7. use domain knowledge to specialize an architecture for a particular family of applications.

17-336 Applied Distributed Systems: Spring: 6 units
Modern computing systems are frequently hosted on the cloud. That is, they are inherently distributed systems. To appropriately build and deploy these systems developers should know not only about development tools such as container management tools but also the structure of the cloud - in particular how it utilizes virtual machines, containers and networks. They should also understand security mechanisms both in the internet and how to authorize users and maintain credentials securely. Finally, to protect the system once it is placed into production, a developer needs to know how to enable the detection of problems during execution through collection and navigation of logs produced by the system. These are the topics covered by this course.

17-338 Network Analysis: The Hidden Structures behind the Webs We Weave: Fall: 12 units
**Previously Course number 17213** Have you wondered how Linux and the subsequent development of open-source software ecosystems could thrive despite weak economic incentives? Why do large-scale complex software systems sometimes fail despite well-developed guardrails and practices? What makes a recommendation system on social media so effective and so toxic at the same time? Why do YouTube mega-influencers with tens of millions of subscribers exist, yet each of us only recognize a handful of them at best? Why do echo chambers form and polarization deepen in social media platforms despite the utopian promise of frictionless connectivity that these platforms initially envisioned? How can you land your dream jobs? How does mass adoption of technological innovations happen (e.g., Python, Bitcoin)? Underlying these seemingly unrelated questions is the powerful influence of social networks, the collection of on- and offline social connections, communications, and collaborations that people form with one another. This course offers an introduction to the study of social networks as a powerful tool for formalizing these wide range of questions, for understanding social dynamics in various settings, and for solving real-world problems arising at the intersection of human social behavior and technological systems. The course first introduces network science concepts and their mathematical operationalization's that give rigorous definitions to fuzzy words we use to describe the social world, such as "status" and "social group". Students will subsequently learn how these network concepts were used to analyze and solve a wide range of puzzling online social phenomena. Finally, the course will introduce statistical models of networks that enable principled investigation of network formation mechanisms.

Course Website: https://bvasiles.github.io/networks/

17-340 Green Computing: Intermittent: 9 units
Note: Previously offered as 08-340. Energy is a key societal resource. However, our energy usage is rising at an alarming rate and therefore it has become critical to manage its consumption more efficiently for long term sustainability. This course introduces students to the exciting area of "Green Computing", and is organizationally divided into two tracks. The first track is "Energy-Efficient Computing", which considers the state of the art techniques for improving the energy efficiency of mobile devices, to laptop and desktop class computers and finally to data centers. We will cover energy efficiency across the hardware/software stack, starting from the individual components like processors and radio interfaces to system level architectures and optimizations. The second track is "Applying Computing towards Sustainability", covering topics that leverage computing to reduce the energy footprint of our society. In particular, we will focus on Smart Buildings and the Smart Grid, covering topics such as sensing, modeling and controlling the energy usage of buildings, new operating systems or software stacks for the smart infrastructure, as well as the privacy and security issues with the new "internet of things". The goal of this course is to help students acquire some of the knowledge and the skills needed to do research in this space of "Green Computing". Although the course is listed within SCS, it should be of interest to students in several departments, including ECE, MechE, CEE, EPP and Architecture.

17-346 DevOps and Continuous Integration: Spring: 6 units
DevOps: Engineering for Deployment and Operations": DevOps is the term given to a modern movement to establish practices that significantly reduce the time to production of committed code. This time involves deployment - the period between the completion of the code by the developers and the placing of the code into normal production and dealing with operations issues. Deployment time can be days, weeks, or even months when using normal development practices. Operational issues such as dealing with incidents and errors introduce other delays. Modern internet companies deploy a system multiple or even dozens of times every day. Achieving this velocity requires coordinated process and design activities together with supporting tooling. This course will cover the deployment process and the associated tooling, it will highlight reasons why release schedules can be slow, and it will introduce the practices that are used to enable high velocity deployments. It will also cover the kinds of problems that are created because of high velocity and how modern internet companies deal with these problems. Please note: This is a required course for MSE-SS students. Students outside of the software engineering department may take this course but students of the MSE programs will have first priority.
Prerequisite: 17-336 Min. grade B

17-350 Information Technology Policy: Evidence, Communication, & Advocacy: Spring: 9 units
In recent decades, developments in Information and Communication Technologies (ICTs) have rapidly moved from research environments to products and services used by billions of people. This rapid rate of change has often resulted in a public which does not understand the technologies shaping their lives and lawmakers who are poorly equipped to make sound policy. It is therefore incumbent upon specialists to communicate how ICTs work to the public and lawmakers so policy making is shaped by evidence and reflects public desires. This course will train students to be effective communicators and advocates in the ICT space. Students taking this course will learn about the broader scope of technology policymaking including formal lawmaking, agency rule-making, strategic litigation, and corporate social responsibility. Current ICT policy topics in privacy, free expression, net neutrality, and competition will be covered. Public communication strategies such as writing op-eds, interviewing with journalists, producing explanatory videos and interactive games will be explored. Finally, students will learn how to perform an expert role in areas such as writing policy briefs and providing testimony. The course is open to advanced undergraduate and graduate students. Graduate students whose research has public policy implications are encouraged to develop projects related to their research. There is no requirement for programming knowledge, but students with experience in developing interactive media and games will be encouraged to utilize such skills. The class will focus heavily on readings, critical evaluation of real ICT advocacy campaigns, and homework will provide hands-on experience with numerous strategies for public engagement. At the end of the semester students will have a portfolio of projects which they may release publicly.

17-355 Program Analysis: Fall and Spring: 12 units
This course covers both foundations and practical aspects of the automated analysis of programs, which is becoming increasingly critical to find software errors and assure program correctness. The theory of abstract interpretation captures the essence of a broad range of program analyses and supports reasoning about their correctness. Building on this foundation, the course will describe program representations, data flow analysis, alias analysis, interprocedural analysis, dynamic analysis, Hoare Logic and verification, program synthesis and repair, model checking, and symbolic execution. Through assignments and projects, students will design and implement practical analysis tools that find bugs and verify properties of software. This course satisfies the Logic and Languages constrained elective category of the Computer Science major, the Theoretical Foundations requirement of the Computer Science master's degree, and the Technical Software Engineering requirement for the Software Engineering minor.
Prerequisites: 15-251 Min. grade C and (17-214 or 15-150 Min. grade C)

Course Website: https://cmu-program-analysis.github.io/

17-356 Software Engineering for Startups: Spring: 12 units
Startup engineering is critical to innovation. The skills required to effectively prototype, launch, and scale products are vital to engineers everywhere, from fledgling companies founded in dorm rooms to local mid-size companies to internal startups from multi-national tech giants. However, developing software in a startup environment poses unique engineering challenges. These challenges include making and justifying foundational architectural and technical decisions despite extreme uncertainty; rapidly prototyping and evaluating new ideas and features, while building minimum viable products; prioritizing engineering effort in severely constrained environments; and communicating effectively both within a small engineering team and with internal and external non-technical stakeholders. This course teaches the skills necessary to engineer successfully in a startup environment, through lectures, group projects, case study discussions, and guest speakers drawn from experienced, practicing startup engineers. This is an engineering-focused course; no entrepreneurship background is required or expected. Students do not need to have a startup idea to participate fully.
Prerequisites: 15-213 or 17-514 or 17-214 or 15-214

17-363 Programming Language Pragmatics: Fall: 12 units
This course provides a broad and pragmatic foundation in the most basic tool of the programmer: programming languages. It starts with the fundamentals of syntax, parsing, and binding, the core structural concepts in programming languages. The course will then cover program semantics and type systems, and students will learn to relate them with a type soundness theorem. Finally, a coverage of intermediate optimization and code generation offers the opportunity to discuss both producing efficient code and reasoning about the correctness of program transformations. Assignments involve a combination of tool-assisted formal reasoning and proofs about programming languages, and implementing these language constructs in a compiler. This course fulfills the Logic and amp; Languages constrained elective of the B.S. in Computer Science. Students with substantial math and programming experience who have not satisfied the specific prerequisites can contact the instructor for permission to enroll.
Prerequisites: 15-150 Min. grade C and (21-228 Min. grade C or 15-251 Min. grade C)

Course Website: http://www.cs.cmu.edu/~aldrich/courses/17-363/

17-396 Language Design and Prototyping: Spring: 12 units
Many programmers think of programming languages as having a fixed, standard set of features and #8212;but in fact, languages are being extended all the time, and new languages are constantly being developed, providing great expressive power. In this course, students will learn about techniques for designing and prototyping programming languages. Design topics include language features, a practical approach to semantics, conceptual design techniques, and examples of both general purpose and domain-specific language designs. Prototyping topics include interpreters, source-to-source translators, languages as libraries, and paper prototyping techniques used for lightweight user evaluations. In course assignments, students will practice design and prototyping techniques, implementing prototype languages in several different styles. The course will end with a project in which students design, implement, and evaluate their own programming language.
Prerequisites: 17-214 or 17-514 or 15-213
Course Website: http://www.cs.cmu.edu/~aldrich/courses/17-396/

17-397 Intro to Qualitative Research: Social Media Apps and Video Content Creation: Spring: 12 units
Short-video apps, such as TikTok, have revealed themselves to be highly accessible and increasingly ubiquitous in regards to online social interaction and are currently the most popular social media among mostly young(er) users. This course focuses on how humans as users interact with and understand social technology and how the use of social media apps is connected to and integrated into our everyday life by asking questions like: What are users' motivations to participate in video creation and sharing on social media? What are their practices, strategies, and routines in creating short-form videos as part of digital online culture? What do they know about socio-technical aspects in using short-video apps and creating short-form video content? How does their understanding of socio-technological aspects influence their use of social media apps? This course is designed to enable students to develop and conduct their own individual research project. For this, students will learn how to design, conduct, and analyze qualitative interviews to research socio-technical, cultural, and political perspectives of usage of and engagement with short-form videos and short-video apps, such as TikTok. The course instructor will closely mentor and supervise students' research projects throughout the semester and will provide expertise and background in qualitative methods and social media research to guide students through the research process.

17-400 Machine Learning and Data Science at Scale: Fall and Spring: 12 units
Datasets are growing, new systems for managing, distributing, and streaming data are being developed, and new architectures for AI applications are emerging. This course will focus on techniques for managing and analyzing large datasets, and on new and emerging architectures for applications in machine learning and data science. Topics include machine learning algorithms and how they must be reformulated to run at scale on petabytes of data, as well as data management and cleaning techniques at scale. In addition to large-scale aspects of data science and machine learning, this course will also cover core concepts of parallel and distributed computing and cloud computing, including hands-on experience with frameworks like Spark, streaming architectures like Flink or Spark Streaming, MLlib, TensorFlow, and more. The course will include programming assignments and a substantial final project requiring students to get hands-on experience with large-scale machine learning pipelines or emerging computing architectures.
Prerequisites: 15-214 or 17-214 or 17-514 or 10-601 or 10-301 or 15-211 or 10-701
Course Website: http://euro.ecom.cmu.edu/program/courses/tcr17-803

17-401 Software Engineering for AI-Enabled Systems: Fall: 12 units
New Course Need Description

Course Website: https://ckaestne.github.io/seai/

17-402 AI and Emerging Economies: Intermittent: 3 units
The course will cover some of the unique aspects of emerging economies as it relates to AI consumption and responsible AI development. The importance of local data and domain knowledge will be illustrated. Germane to budding technologists, entrepreneurs and policy influencers. Multi-disciplinary.

17-405 Grand Challenges in AI: Past, Present and Future: Intermittent: 3 units
Innovative, bold initiatives that capture the imagination of researchers and system builders are often required to spur a field of science or technology forward. A vision for the future of artificial intelligence was laid out by Turing Award winner and Moza Bint Nasser University Professor at CMU, Raj Reddy in his 1988 Presidential address to the Association for the Advancement of Artificial Intelligence. It is time to provide an accounting of the progress that has been made in the field, over the last three decades, toward the challenge goals. While some tasks such as the world-champion chess machine were accomplished in short order, many others, such as self-replicating systems, require more focus and breakthroughs for completion. A new set of challenges for the current decade is also proposed, spanning the health, wealth, and wisdom spheres. The above - plus commentary from half a dozen AI thought leaders - forms the basis of an article in the 2021 Spring Issue of AI Magazine.

17-413 Software Engineering Practicum: Spring: 12 units
This course is a project-based course in which students conduct a semester-long project for a real client in small teams. This is not a lecture-based course; after the first few weeks the course consists primarily of weekly team meetings with the course instructors, with teams making regular presentations on their software development process. Students will leave the course with a firsthand understanding of the software engineering realities that drive SE practices, will have concrete experience with these practices, and will have engaged in active reflection on this experience. After the course, students will have the teamwork, process, and product skills to be immediately competent in a software engineering organization, and will be able to evaluate the new processes and techniques they will encounter in the workplace.
Prerequisite: 17-313

17-415 Software Engineering Reflection: Fall: 6 units
This course is an opportunity to reflect on a software engineering experience you have had in industry. It is structured as a writers workshop, in which you will work with the instructor and other students to identify and flesh out a software engineering theme that is illustrated by your industry experience. You will prepare a 10-page report on this theme, comparable to a practitioner's report at a conference like ICSE or OOPSLA, and a 30-minute presentation to match. This course fulfills a requirement of the Software Engineering Minor program, but students in other programs may take the course if they meet the prerequisite industry experience and if space is available.

17-416 AI Governance: Identifying & Mitigating Risks in Design & Dev of AI Solutions: Fall and Spring: 6 units
With AI and ML finding their way into an increasingly broad range of products and services, it is important to identify and mitigate the risks associated with the adoption of these technologies. This course reviews the different types of risks associated with AI and discusses methodologies and techniques available to identify and mitigate these risks. The course introduces students to ethical frameworks available to identify and analyze risks. It also examines best practices emerging from both government and industry efforts in this area. This includes looking at new regulations such as the EU AI Act as well as emerging frameworks such as the one developed by NIST. The course also examines frameworks developed by leading companies and how these frameworks combine both technical and non-technical approaches. It further discusses changes that need to be enacted by organizations to adopt more systematic approaches to AI governance. This course combines a mix of technical, policy, and management discussions.

17-422 Building User-Focused Sensing Systems: Fall and Spring: 12 units
These days we are surrounded by sensing and computation. Smart devices, such as smartphones, smartwatches, are packed with sensors. While they are already very useful devices, we have only started to scratch the surface here. The aim of this class will be to introduce the students to building and understanding smart sensing devices. The course will include discussion into contribution of various fields, including human-computer interaction, embedded computing, computer vision, distributed systems, machine learning, signal processing, security, and privacy. We will discuss how these various disciplines are coming together to form an end-to-end system that generates useful and user-actionable data. We will take a hands-on approach towards building and evaluating these systems. The students will gain practical experience in developing sensing systems in different application domains, such as activity recognition, health sensing, gestural interaction, etc. You will learn about embedded systems and understand the advantages and limitations of different platforms. You will learn about sensors and how to interface them with the real world to be able to get useful and actionable data. You will learn how to build a network of sensors that can communicate with each other. You will also learn about storing the sensor data for visualization, analysis and presentation both locally and to the cloud. The course will be a combination of lectures, tutorials, class discussions, and demonstrations. Students will be evaluated based on 5 mini-projects/assignments, class participation, weekly reading summaries, and a final project. All hardware resources will be provided to the students and they will be given an option to take their final prototypes with them for the cost of the hardware components. Students should have reasonable programming experience and an interest in tinkering.

Course Website: https://synergylabs.org/courses/17-722/

17-423 Designing Large-scale Software Systems: Spring: 12 units
Design plays a crucial role in the success of a software product, as decisions made during the design stage have a long-lasting impact on qualities such as reliability, robustness, maintainability, scalability, and security. With the increasing use of AI-based programming tools (such as ChatGPT and Copilot), being able to effectively design large, complex software and reason about systems at scale will become highly sought-out skills in the software industry. This course teaches students how to design complex, large-scale software systems that are reliable, robust, and built to last. It introduces fundamental concepts and techniques for designing software to achieve qualities of a successful product (such as maintainability, scalability, and robustness) and to avoid catastrophic failures. After taking this course, students will be able to (1) systematically generate and explore design alternatives, (2) specify and evaluate design options using appropriate abstractions, and (3) communicate and critique design decisions with other members of large, multi-team organizations. The discussions of these concepts will be driven by case studies of past failures and successes in real-world software systems. The course will be hands-on and involve a semester-long project where the students will work in teams and collaborate with other teams to design, test, and deploy a complex software system. This course is aimed at both undergraduate and graduate students who are interested in the role of a software architect or designer in an organization.

Course Website: https://cmu-swdesign.github.io/

17-428 Machine Learning and Sensing: Fall: 12 units
Machine learning and sensors are at the core of most modern computing devices and technology. From Amazon Echo to Apple Watch to Google Photos to self-driving cars, making sense of the data coming from powerful but noisy sensors is the key challenge. The aim of the course will be to explore this intersection of sensors and machine learning, understand the inner workings on modern computing technologies, and design the future ones. We will cover data collection, signal processing, data processing, data visualization, feature engineering, machine learning tools, and some prototyping technologies. The course will focus on class discussions, hands-on demonstrations, and tutorials. Students will be evaluated on their class participation, multiple mini projects, and a final team project.

17-437 Web Application Development: Fall and Spring: 12 units
This course will introduce concepts in programming web application servers. We will study the fundamental architectural elements of programming web sites that produce content dynamically. The primary technology introduced will be the Django framework for Python, but we will cover related topics as necessary so that students can build significant applications. Such topics include: HTTP, HTML, CSS, Javascript, JSON, Design Patterns, Relational and Non-relational Databases, Object-Relation Mapping tools, Security, Web Services, Cloud Deployment, Internationalization, and Scalability and Performance Issues. Students must be comfortable programming in Python to register for this course. Students must provide their own computer hardware for this course. Please visit the Course URL for more information about the course.
Prerequisites: 18-613 or 15-213 or 18-213 or 14-513 or 17-214 or 15-214 or 17-514 or 15-513

Course Website: https://www.cmu-webapps.org/static/index/syllabus.pdf

17-442 Software Management Theory: Spring: 6 units
This course will look at software development from an organizational perspective and its designed for students who want to understand the relationship between business context, software development processes, knowledge creation, culture and organizational structure with the purpose of becoming change agents or manage the software development function at the department, business unit level or above. The course will also highlight the need to follow good work principles in order to avoid ethical failures as evidenced by recent affairs

17-443 Quality Management: Spring: 6 units
Managing software quality is a critical part of all software projects. Software engineers must consider quality during every phase of a project from inception to delivery and beyond. This class will introduce students to the managerial challenges of developing high quality software systems. The key learning objectives of this course include: 1. Define a quality management process in the context of a software project. 2. Understand the costs associated with achieving quality goals and not achieving them 3. Understand the tradeoffs required to implement quality assurance techniques. 4. Gain experience using collected quality metrics to inform project-level decisions.
Prerequisite: 17-323 Min. grade B

17-445 Machine Learning in Production: Fall and Spring: 12 units
The course takes a software engineering perspective on building software systems with a significant machine learning or AI component. It discusses how to take an idea and a model developed by a data scientist (e.g., scripts and Jupyter notebook) and deploy it as part of scalable and maintainable system (e.g., mobile apps, web applications, IoT devices). Rather than focusing on modeling and learning itself, this course assumes a working relationship with a data scientist and focuses on issues of design, implementation, operation, and assurance and how those interact with the data scientist's modeling. This course is aimed at software engineers who want to understand the specific challenges of working with AI components and at data scientists who want to understand the challenges of getting a prototype model into production; it facilitates communication and collaboration between both roles.

Course Website: https://ckaestne.github.io/seai/

17-446 DevOps and Continuous Integration: Spring: 6 units
TBD
Prerequisite: 17-336 Min. grade B

17-450 Crafting Software: Fall and Spring: 12 units
Do you use programming to solve problems in your field of study? Do you know enough to be dangerous, but wish you could be proud of your code? This course aims to provide students with sufficient knowledge and skills to use programming as part of their work. In this class, you will learn how to identify and find problems in your code. You will learn to read, parse, organize, and transform data. We will teach you to write code collaboratively and refine your programs so others can use them.The course will be a mixture of lecture and guided exercise with a recitation focused on hands on instruction. In this course, students are expected to have been exposed to some basic programming concepts, such as variables, if-statements, loops, and arrays. However, students are not expected to have extensive programming experience. This course is not appropriate for students that have completed more than two courses involving programming. We expect students in this class to have diverse backgrounds and experience. Some students will be self-taught, while others will have taken a programming course such as 02-201, 15-110, 95-898, or the library's Software Carpentry workshop. If you have questions about your background and the fit for this class, please don't hesitate to reach out to the instructors.

17-470 Virtual Machines and Managed Runtimes: Fall: 12 units
Traditional compiler and programming language courses focus on language implementations that generate code statically (offline) for a target machine. Yet in today's landscape, many programming languages run on virtual machines where either a virtual instruction set architecture (bytecode) or the source code of the program is translated (and optimized) dynamically for an underlying machine. Such languages come with additional challenges beyond traditional compilation as taught in courses, including efficient representation of high-level language constructs and automatic memory management in the form of garbage collection. Together, the components of the virtual machine and services form what is known as a managed runtime system. This course focuses on implementation techniques for managed runtime systems. Students will learn the basics of virtual machine implementation and build working prototypes to run actual programs. Prior knowledge of compilers and some familiarity with programming language implementation is required.
Prerequisites: 15-611 or 15-411

17-480 API Design and Implementation: Fall and Spring: 12 units
This class focuses on the design of programming interfaces, the APIs, within larger real-world software and ecosystems. We discuss the history and importance of APIs, and the principles behind designing good APIs. This includes study of specific examples of APIs, both good and bad, for inspiration and precaution. Students gain experience with the major steps of API design: gathering requirements, documenting, testing, implementing, refining, evolving, and reimplementing APIs. The principles taught are largely language-independent, though most examples are in Java or C. Students may be able to do assignments in other languages, within reason.
Prerequisites: 17-214 or 15-214 or 15-213

17-514 Principles of Software Construction: Objects, Design, and Concurrency: Fall and Spring: 12 units
Software engineers today are less likely to design data structures and algorithms from scratch and more likely to build systems from library and framework components. In this course, students engage with concepts related to the construction of software systems at scale, building on their understanding of the basic building blocks of data structures, algorithms, and program and computer structures. The course covers technical topics in four areas: (1) concepts of design for complex systems, (2) object-oriented programming, (3) static and dynamic analysis for programs, and (4) concurrency. At the conclusion of this course, students will have substantial experience building medium-sized software systems in Java or JavaScript.
Prerequisites: (15-122 Min. grade C or 15-121 Min. grade C) and (21-128 Min. grade C or 21-127 Min. grade C or 15-151 Min. grade C)

Course Website: https://www.cs.cmu.edu/~ckaestne/17214/f2021/

17-536 Pervasive and Ubiquitous Computing: Intermittent: 12 units
Note: Previously offered as 08530. The aim of the class will be to explore the area of Ubiquitous Computing (ubicomp) and allow students to work on a variety of small technology projects. Students will be exposed to the basics of building ubicomp systems, emerging new research topics, and advanced prototyping techniques. This course will focus more on class discussions and hands on demonstrations, while formal lectures will be conducted only as needed. Students will be evaluated on their class participation, reading summaries, and mini projects.

17-537 Artificial Intelligence Methods for Social Good: Spring: 9 units
Optimization: mathematical programming, robust optimization, influence maximization Game Theory and Mechanism Design: security games, human behavior modeling, auction and market equilibrium, citizen science Machine Learning: classification, clustering, probabilistic graphical models, deep learning Sequential Decision Making: Markov Decision Processes (MDPs), partially observable MDPs, online planning, reinforcement learning In addition to providing a deep understanding of these methods, the course will introduce which societal challenges they can tackle and how, in the areas of (i) healthcare, (ii) social welfare, (iii) security and privacy, (iv) environmental sustainability. The course will also cover special topics such as AI and Ethics and AI and Humans. The course content is designed to not have too much overlap with other AI courses offered at CMU. Although the course is listed within SCS, it should be of interest to students in several other departments, including ECE, EPP and SDS. The students in this 9-unit course are expected to have taken at least three mathematics courses covering linear algebra, calculus, and probability. The students will work in groups on a systematic literature review or a project exploring the possibility of applying existing AI tools to a societal problem, with a survey paper or technical report and presentation delivered at the end of the semester.

17-562 Law of Computer Technology: Fall: 9 units
A survey of how legislatures and courts cope with rapidly advancing computer technologies and how scientific information is presented to, and evaluated by, civil authorities. The course is also an introduction to the legal process generally and the interaction between the legal system and technology organizations. Topics include: patents, copyrights in a networked world, law of the Internet, free speech, data security, technology regulation, international law, and trans-border crime. Open to juniors, seniors and graduate students in any school. Open to sophomores by permission of the instructor. Prerequisites: none.

17-599 Advanced Topics in Machine Learning and Game Theory: Fall: 12 units
This course is designed to be a graduate-level course covering the topics at the intersection of machine learning and game theory. Recent years have witnessed significant advances in machine learning and their successes in detection, prediction, and decision-making problems. However, in many application domains, ranging from auction and ads bidding, to entertainment games such as Go and Poker, to autonomous driving and traffic routing, to the intelligent warehouse, to home assistants and the Internet of Things, there is more than one agent interacting with each other. Game theory provides a framework for analyzing the strategic interaction between multiple agents and can complement machine learning when dealing with challenges in these domains. Therefore, in the course, we will introduce how to integrate machine learning and game theory to tackle challenges in multi-agent systems. The course will multiple topics as listed below

Course Website: https://feifang.info/advanced-topics-in-machine-learning-and-game-theory-fall-2021/

17-612 Business and Marketing Strategy: Fall and Spring: 6 units
This course prepares technically minded students to understand and use essential business concepts in their careers. With this competency, students will be able to make use of, contribute to, and influence the business, product and marketing decisions that affect engineering and technology decisions, quality, and performance. Students will be better equipped to make business arguments for supporting their product, technology and engineering ideas in their future, too. This 6-unit course emphasizes learning-by-doing to achieve the learning objectives. The teaching and learning approach uses a situation that many students will encounter in their early careers: to conceive, plan and propose a new product idea. Each student works on a course-long project to add a new technology product idea for an existing company's product line. They'll make product, technology, pricing, marketing, and sales decisions to achieve success and support of the company's strategy and business decisions. Their work will culminate in building a compelling business case, with financial projections, to persuade the company executives to invest in the product idea.

Course Website: https://mse.s3d.cmu.edu/

17-619 Introduction to Real-Time Software and Systems: Intermittent: 12 units
Introduction to Real-Time Software and Systems presents an overview of time as it relates engineering complex systems. Any system that responds at the pace of relevant events has real-time constraints whether the timescale is short, like the flight controls for an aircraft, or longer, like the flight reservation system for an airline. Fundamental concepts, terminology, and issues of real-time systems are introduced in this course. The focus is on software solutions to real-time problems-solutions that must be both correct and timely. Software development is examined with emphasis on real-time issues during each phase of the software lifecycle. Real-time requirements analysis, architecting real-time systems, designing and modeling system timing, and implementation and testing strategies are studied. Modeling techniques using UML 2.0 are applied. Particular emphasis is placed on real-time scheduling to achieve desired timing, reliability, and robustness. Languages and operating systems for real-time computing, and real-time problems in concurrent and distributed systems are explored. This course provides a comprehensive view of real-time systems with theory, techniques and methods for the practitioner. After successfully completing this course, the student will be able to identify constraints and understand real-time issues in system development, and propose approaches to typical real-time problems. The aim of this course is to motivate and prepare students to pursue more in-depth study of specific problems in real-time computing and systems development. REQUIREMENT: Proficiency with a high-level programming language such as C or Ada and basic concepts of computing systems. Familiarity with software engineering concepts and system development lifecycle.

17-621 Computer Simulation of Complex Socio-Technical Systems: Intermittent: 12 units
How likely is an intervention like social distancing to save lives? Will a law legislating sanctions against social media platforms that spread disinformation stop the spread? We live and work in complex adaptive and evolving socio-technical systems where questions such as these arise constantly. Questions such as these are often only addressable through computational modeling, i.e., through simulation. Simulation models are a critical method for understanding how to adaptation and learning will change the status-quo. Computational modeling can be used to help analyze, reason about, predict the behavior of, and possibly control complex human systems of "networked" agents. Using simulation it is possible to advance theory, test policies before enacting them, and think through non-linear social effects.

Course Website: http://www.casos.cs.cmu.edu/courses/

17-624 Advanced Formal Methods: Fall: 6 units
This course builds on the introductory Models class to cover more advanced techniques for modeling and reasoning about complex software systems. Concepts introduced in this course include abstraction and refinement, declarative specifications, advanced temporal logics, and probabilistic modeling. The course will also explore applications of modeling and automated reasoning techniques in various domains, such as security, distributed computing, and cyber-physical systems. After completing this course, students will: 1. Understand how to specify and reason about operations over complex system structures, 2. Understand relationships between software artifacts at different levels of abstraction; 3. Be able to model and reason about systems with uncertainty and stochastic behaviors; and 4. Understand potential applications of modeling techniques to practical software engineering problems. Prerequisites: Completion of Mini 1: Models of Software Systems. Sections D, PP and G are NOT available for on-campus students. Admission to the class is by approval from the instructor: If you are not a software engineering master's student, send email to garlan@cs.cmu.edu for permission to enroll. The email should briefly describe your background, whether you have taken a course with similar materials as in Mini 1, and why you would like to take the course. The course must be taken for a letter grade (not pass/fail). This is a graduate level course.
Prerequisite: 17-614 Min. grade B

17-626 Requirements for Information Systems: Fall: 6 units
Software engineering requires understanding the problem, before identifying solutions. In this course, students study ways to elicit and analyze problem statements using scenarios, use cases and mockups.

17-627 Requirements for Embedded Systems: Fall: 6 units
Software engineering requires understanding the problem, before identifying solutions. In this course, students study ways to elicit and analyze problem statements for real-time systems along multiple dimensions, including concurrency, dependability and safety.
Prerequisite: 17-614 Min. grade B

17-634 Applied Machine Learning: Spring: 6 units
Autonomous and intelligent systems increasingly rely on automated decision making based on statistical models used for classification or prediction. The practical application of machine learning requires understanding the underlying theoretical assumptions behind a wide variety of statistical models, how to analyze the performance of such models, and how to integrate models into data processing pipelines. This course introduces students to supervised and unsupervised machine learning in the context of software engineering, including the analysis of natural language in bug reports and mobile app reviews. Techniques covered include latent Dirichlet allocation, TF/IDF, naive Bayes, linear regression, decision trees, and random forests.

17-640 IoT, Big Data, and ML: A Hands-on Approach: Intermittent: 12 units
This course is designed to teach IoT concepts, big data, and machine learning techniques using a hands-on approach. An IoT system simulating an order fulfillment process is central to the hands-on learning of the concepts and techniques. Students will work in 4-5 person teams to enable the system and implement the requirements. In doing so, they will incorporate sound design principles of software engineering acquired in lectures. Students will capture the data generated during the execution of the system as it fulfills orders that are received from a front-end system developed by the students. Students will be expected to prepare, process, and model the data for statistical analysis applying techniques taught in class. They will then visualize, analyze and interpret the results, and implement improvements to obtain a 360-degree experience of a business application using the automated system. This course will provide insight into the ways in which business enterprises think about leveraging technology and software in the management of their production operations. The course prepares students for professional opportunities requiring such skills allowing them to identify use cases that facilitate innovation and promote competitiveness.

17-644 Applied Deep Learning: Spring: 6 units
Deep neural networks have made in-roads in virtually every industry, propelled by exponential increases in compute power and fundamental progress in modeling. Knowledge of these models is fast becoming a key asset for software engineers, as current systems are quickly starting to include many neural components, and the practice of software engineering itself is starting to benefit from neural program assistance (incl. automated bug finding, translation between programming languages). This course equips the next generation of software engineers with knowledge of neural models, the software engineering challenges involved in using these, and hands-on experience with their applications. It teaches both a rich vocabulary of general, essential concepts (including architectures), and recent work on applications of these models, aimed primarily at applications for and in software engineering itself. The course includes a group project aimed at constructing a neural solution for an existing application that will be used to teach the various stages (and their pitfalls) of building and deploying deep learners.

17-651 Models of Software Systems: Fall: 12 units
Scientific foundations for software engineering depend on the use of precise, abstract models for describing and reasoning about properties of software systems. This course considers a variety of standard models for representing sequential and concurrent systems, such as state machines, algebras, and traces. It shows how different logics can be used to specify properties of systems, such as functional correctness, deadlock freedom, and internal consistency. Concepts such as compositionality, abstraction, invariants, non-determinism, and inductive definitions are recurrent themes throughout the course. After completing this course, students will: 1. Understand the strengths and weaknesses of certain models and logics including state machines, algebraic and process models, and temporal logic; 2. Be able to select and describe appropriate abstract formal models for certain classes of systems, describe abstraction relations between different levels of description, and reason about the correctness of refinements; 3. Be able to prove elementary properties about systems described by the models introduced in the course; and 4. Understand some of the strengths and weakness of formal automated reasoning tools. Prerequisites: Undergraduate discrete math including first-order logic, sets, functions, relations, and simple proof techniques such as induction. Sections D, PP and G are NOT available for on-campus students. Admission to the class is by approval from the instructor: If you are not MSE/MSIT-SE/MITS, send email to garlan@cs.cmu.edu for permission to enroll. The email should briefly describe your background, whether you have taken an undergraduate discrete math course, and why you would like to take the course. The course must be taken for a letter grade (not pass/fail). This is a graduate level course.

17-654 Analysis of Software Artifacts: Spring: 12 units
Analysis is the systematic examination of an artifact to determine its properties. This course will focus on analysis of software artifacts and #8212;primarily code, but also including analysis of designs, architectures, and test suites. We will focus on functional properties, but also cover non-functional properties like performance and security. In order to illustrate core analysis concepts in some depth, the course will center on static program analysis; however, the course will also include a breadth of techniques such as testing, model checking, theorem proving, dynamic analysis, and type systems. The course will balance theoretical discussions with lab exercises in which students will apply the ideas they are learning to real artifacts. After completing this course, students will: * know what kinds of analyses are available and how to use them * understand their scope and power,when they can be applied and what conclusions can be drawn from their results * have a grasp of fundamental notions sufficient to evaluate new kinds of analysis when they are developed * have some experience selecting and writing analyses for a real piece of software, applying them and interpreting the results Ph.D. students taking the 17-754 version of the course will gain a broad overview of the analysis research literature and in-depth knowledge of a particular sub-area through a course project. Requirement: A recent discrete math course and programming experience. Strongly Recommended: Models of SW Development course (17-651) before taking this course. This course is for letter grade only (no pass/fail grades). This is a graduate course. Only undergrad SE minors may take this course with the instructor's permission. Please note: Students outside of the software engineering department may take this course but students of the MSE programs will have first priority.

17-663 Programming Language Pragmatics: Fall: 12 units
This course provides a broad and pragmatic foundation in the most basic tool of the programmer: programming languages. It starts with the fundamentals of syntax, parsing, and binding, the core structural concepts in programming languages. The course will then cover program semantics and type systems, and students will learn to relate them with a type soundness theorem. Finally, a coverage of intermediate optimization and code generation offers the opportunity to discuss both producing efficient code and reasoning about the correctness of program transformations. Assignments involve a combination of tool-assisted formal reasoning and proofs about programming languages, and implementing these language constructs in a compiler. This course fulfills the Logic and amp; Languages constrained elective of the B.S. in Computer Science. Students with substantial math and programming experience who have not satisfied the specific prerequisites can contact the instructor for permission to enroll.
Prerequisites: 15-251 Min. grade C and (21-228 Min. grade C or 15-150 Min. grade C)

Course Website: http://www.cs.cmu.edu/~aldrich/courses/17-363/

17-670 Virtual Machines and Managed Runtimes: Fall: 12 units
Traditional compiler and programming language courses focus on language implementations that generate code statically (offline) for a target machine. Yet in today's landscape, many programming languages run on virtual machines where either a virtual instruction set architecture (bytecode) or the source code of the program is translated (and optimized) dynamically for an underlying machine. Such languages come with additional challenges beyond traditional compilation as taught in courses, including efficient representation of high-level language constructs and automatic memory management in the form of garbage collection. Together, the components of the virtual machine and services form what is known as a managed runtime system. This course focuses on implementation techniques for managed runtime systems. Students will learn the basics of virtual machine implementation and build working prototypes to run actual programs. Prior knowledge of compilers and some familiarity with programming language implementation is required.
Prerequisites: 15-411 or 15-611

17-685 Dynamic Network Analysis: Spring: 12 units
Who knows who? Who knows what? Who is influential? What is the social network, the knowledge network, the activity network? How do ideas, products and amp; diseases propagate through groups and impact these networks? Does social media change the way these networks operate? Questions such as these and amp; millions of others require a network perspective and an understanding of how ties among people, ideas, things, and amp; locations connect, constrain and amp; enable activity. In the past decade there has been an explosion of interest in network science moving from the work on social networks and graph theory to statistical and computer simulation models. Network analysis, like statistics, now plays an role in most empirical fields. Network science is a broad and multi-disciplinary field. In this class, students will gain an appreciation of the history of the field, the difference between social networks and social media, the difference graph-based metrics for network analysis and graphical models, the use of traditional and high dimensional network models, and the advances in this field. Applications and issues discussed will include: social media analytics, semantic networks, task networks, organizational design and teams, machine learning and network analysis, generative models, terrorism and crime, health, and fake news. Methods for network data collection, analysis, visualization, and interpretation are covered. Students produce original research in which network data is analyzed using the methods covered in the class

Course Website: http://www.casos.cs.cmu.edu/courses/

17-691 Machine Learning in Practice: Spring: 6 units
As Machine Learning and Artificial Intelligence methods have become common place in both academic and industry environments the majority of resources have focused on methods and techniques for applications. However, there are many considerations that must be addressed when deploying such techniques into practice (or production). The purpose of this course is to cover topics relevant to building a machine learning systems deployed into operations. Such systems have technical requirements including data management, model development, and deployment. However, business/organizational impacts must also be considered. Machine learning systems can be expensive to produce and operate. Students will learn about trade-offs in design, implementation, and expected value. After completing this course, students will: 1. Have the ability to deploy produces with machine learning and AI components; 2. Understand how to implement data pipelines and data engineering systems; 3. Calculate the approximate value provided by a machine learning system to an organization; 4. Understand how to continually assess the value and quality of a deployed machine learning system. Prerequisites: understanding of basic machine learning concepts (i.e. supervised/unsupervised learning). This is a graduate level course.
Prerequisite: 17-634 Min. grade B

17-692 Product Management Essentials I: Fall and Spring: 6 units
This course prepares students to understand and use the essential concepts and practices of product management and innovation. These concepts are used in the critical, early stages of every new product or service idea. Students will acquire the customer-centric knowledge and skills to describe a well-defined, worthwhile customer problem solve; a focused target market of potential customers; specify an innovative and differentiated product solution concept; and design, price and quantify a value proposition that is compelling to customers to buy and use the product. This 6-unit course emphasizes learning-by-doing to achieve the learning objectives. Students work on a hands-on, course-long project focused on a problem space selected by the student and approved by the instructor for course fit.

Course Website: https://mse.s3d.cmu.edu/applicants/course-offerings.html

17-702 Current Topics in Privacy Seminar: Fall and Spring: 3 units
In this seminar course students will discuss recent papers and current public policy issues related to privacy. Privacy professionals from industry, government, and non-profits will deliver several guest lectures each semester.

17-712 Fantastic Bugs and How to Find Them: Fall: 12 units
This advanced course studies the nature of software bugs and security vulnerabilities arising in complex application domains and surveys specialized program analysis + automated testing techniques for identifying such issues proactively. The course will take a tour of various domains such as mobile systems, databases, web browsers, distributed and networked systems, autonomous vehicles, and smart contracts. For each domain, the class will review case studies of high-impact software bugs that have manifested in production and will then discuss state-of-the-art research techniques that aim to uncover such bugs automatically. Apart from the literature review, students will engage significantly with software system design and engineering via hands-on assignments and a semester-long project involving real-world applications and analysis tools for one or more domains. Students completing this course will be able to (a) identify practical challenges of applying well-known program analysis and testing techniques to complex application domains, (b) formulate and leverage domain-specific assumptions for making analysis techniques tractable in a specialized setting, and (c) build practical tools for improving software quality in large-scale systems. The course assumes that students have some background in reasoning about software quality, system security, and/or working with program representations. The course builds upon mathematical principles introduced in foundational classes on program analysis, verification, or compiler design, as well as system design principles encountered in introductory security or software engineering courses. Please check the course website for classes that qualify as sufficient pre-requisites, or contact the instructor to discuss your background.

Course Website: https://cmu-fantastic-bugs.github.io/

17-731 Foundations of Privacy: Fall: 12 units
Privacy is a significant concern in modern society. Individuals share personal information with many different organizations - healthcare, financial and educational institutions, the census bureau, Web services providers and online social networks - often in electronic form. Privacy violations occur when such personal information is inappropriately collected, shared or used. We will study privacy in a few settings where rigorous definitions and enforcement mechanisms are being developed - statistical disclosure limitation (as may be used by the census bureau in releasing statistics), semantics and logical specification of privacy policies that constrain information flow and use (e.g., by privacy regulations such as the HIPAA Privacy Rule and the Gramm-Leach-Bliley Act), principled audit and accountability mechanisms for enforcing privacy policies, anonymous communication protocols - and other settings in which privacy concerns have prompted much research, such as in social networks, location privacy and Web privacy (in particular, online tracking and amp; targeted advertising).

17-733 Privacy Policy, Law, and Technology: Fall: 12 units
NOTE: Previously offered as 08-733. This course focuses on policy issues related to privacy from the perspectives of governments, organizations, and individuals. We will begin with a historical and philosophical study of privacy and then explore recent public policy issues. We will examine the privacy protections provided by laws and regulations, as well as the way technology can be used to protect privacy. We will emphasize technology-related privacy concerns and mitigation, for example: social networks, smartphones, behavioral advertising (and tools to prevent targeted advertising and tracking), anonymous communication systems, big data, and drones. This is part of a series of courses offered as part of the MSIT-Privacy Engineering masters program. These courses may be taken in any order or simultaneously. Foundations of Privacy (Fall semester) offers more in-depth coverage of technologies and algorithms used to reason about and protect privacy. Engineering Privacy in Software (Spring semester) focuses on the methods and tools needed to design systems for privacy. This course is intended primarily for graduate students and advanced undergraduate students with some technical background. Programming skills are not required. 8-733, 19-608, and 95-818 are 12-unit courses for PhD students. Students enrolled under these course numbers will have extra assignments and will be expected to do a project suitable for publication. 8-533 is a 9-unit course for undergraduate students. Masters students may register for any of the course numbers permitted by their program. This course will include a lot of reading, writing, and class discussion. Students will be able to tailor their assignments to their skills and interests. However, all students will be expected to do some writing and some technical work.

17-735 Engineering Privacy in Software: Spring: 12 units
Privacy harms that involve personal data can often be traced back to software design failures, which can be prevented through sound engineering practices. In this course, students will learn how to identify privacy threats due to surveillance activities that enhance modern information systems, including location tracking, behavioral profiling, recommender systems, and social networking. Students will learn to analyze systems to identify the core operating principles and technical means that introduce privacy threats, and they will learn to evaluate and mitigate privacy risks to individuals by investigating system design alternatives. Strategies to mitigating privacy risk will be based on emerging standards and reliable privacy preference data. Students will have the opportunity to study web-, mobile- and cyber-physical systems across a range of domains, including advertising, healthcare, law enforcement and social networking. In addition, students will know how, and when, to interface with relevant stakeholders, including legal, marketing and other developers in order to align software design with privacy policy and law.

17-756 Computational Social Science Research Design and Data Analytics: Spring: 12 units
This course surveys how digital trace data of human activity online, combined with careful research design and data analytics, have led to surprising discoveries and development of novel theoretical explanations in the field of computational social science (CSS). The course has three aims. (a) It is intended to stimulate new ways of formulating research questions on pressing/emerging societal issues of interest (e.g., political polarization, gender representation in open-source software development, decentralized governance based on blockchain technology) given the possibilities afforded by a wide array of digital trace data (e.g., social media, open-source software collaboration, cryptocurrency transactions, satellite imagery). This course will (b) discuss exemplary works in CSS that made novel discoveries or made theoretical and/or methodological breakthroughs and (c) cover practical considerations that commonly arise in a CSS research project cycle. These issues may include, but are not limited to, data collection (sampling methods and bias), repurposing existing datasets that were collected in a different research context, constructing metrics based on theoretical insights, analytic approaches adequate for a given research question (statistical modeling, network analysis, online experiments, simulation-based theory development), big data processing and analytic tools (distributed data processing frameworks, visualization), ethical considerations, and data sharing. In the end, this course will help participants develop "good taste" for theoretically insightful, methodologically creative, and well thought out research, while learning to identify potential pitfalls that could arise in their own research.

17-801 Dynamic Network Analysis: Spring: 12 units
Who knows who? Who knows what? Who is influential? What is the social network, the knowledge network, the activity network? How do ideas, products and amp; diseases propagate through groups and impact these networks? Does social media change the way these networks operate? Questions such as these and amp; millions of others require a network perspective and an understanding of how ties among people, ideas, things, and amp; locations connect, constrain and amp; enable activity. In the past decade there has been an explosion of interest in network science moving from the work on social networks and graph theory to statistical and computer simulation models. Network analysis, like statistics, now plays an role in most empirical fields. Network science is a broad and multi-disciplinary field. In this class, students will gain an appreciation of the history of the field, the difference between social networks and social media, the difference graph-based metrics for network analysis and graphical models, the use of traditional and high dimensional network models, and the advances in this field. Applications and issues discussed will include: social media analytics, semantic networks, task networks, organizational design and teams, machine learning and network analysis, generative models, terrorism and crime, health, and fake news. Methods for network data collection, analysis, visualization, and interpretation are covered. Students produce original research in which network data is analyzed using the methods covered in the class.

Course Website: http://www.casos.cs.cmu.edu/courses/

17-821 Computer Simulation of Complex Socio-Technical Systems: Spring: 12 units
How likely is an intervention like social distancing to save lives? Will a law legislating sanctions against social media platforms that spread disinformation stop the spread? We live and work in complex adaptive and evolving socio-technical systems where questions such as these arise constantly. Questions such as these are often only addressable through computational modeling, i.e., through simulation. Simulation models are a critical method for understanding how to adaptation and learning will change the status-quo. Computational modeling can be used to help analyze, reason about, predict the behavior of, and possibly control complex human systems of "networked" agents. Using simulation it is possible to advance theory, test policies before enacting them, and think through non-linear social effects.

Course Website: http://www.casos.cs.cmu.edu/courses/

17-880 Algorithms for Private Data Analysis: Spring: 12 units
We study the following question in this course: How do we perform useful analysis on a data set that contains sensitive information about individuals without compromising the privacy of those individuals? To study this question, we will introduce differential privacy, a framework of designing data analysis algorithms with strong, meaningful, and mathematically provable privacy guarantees. We will survey a set of algorithmic tools that allow us to privately perform a wide range of statistical analyses. Of course, privacy does not come for free, and we will also study some of the fundamental limitations imposed by the requirement of differential privacy. Through the discussion of these results, we will also demonstrate some of the most novel and surprising connections between differential privacy and other areas of theoretical computer science, including machine learning theory, cryptography, convex geometry, and game theory.

Faculty

UMUT ACAR, Associate Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2012–

ANIL ADA, Associate Teaching Professor, Carnegie Mellon University – Ph.D., McGill University; Carnegie Mellon, 2014–

HENNY ADMONI, Associate Professor, Robotics Institute – Ph.D., Yale University; Carnegie Mellon, 2017–

YUVRAJ AGARWAL, Associate Professor, Institute for Software Research – Ph.D., University of California, San Diego; Carnegie Mellon, 2013–

HAMMAD AHMAD, Assistant Teaching Professor, Software and Societal Systems Department – Ph.D., University of Michigan; Carnegie Mellon, 2024–

JONATHAN ALDRICH, Professor, Institute for Software Research – Ph.D., University Of Washington; Carnegie Mellon, 2003–

VINCENT ALEVEN, Professor, Human-Computer Interaction Institute – Ph.D., University Of Pittsburgh; Carnegie Mellon, 2000–

DANIEL ANDERSON, Assistant Teaching Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2023–

DAVID ANDERSEN, Professor, Computer Science Department – Ph.D., Massachusetts Institute Of Technology; Carnegie Mellon, 2005–

JOHN ANDERSON, R.K. Mellon University Professor – Ph.D., Stanford University; Carnegie Mellon, 1978–

DIMITRIOS APOSTOLOPOULOS, Principal Systems Scientist, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1989–

SWARNALATHA ASHOK, Associate Teaching Professor, Institute for Software Research – MSc(Tech), Birla Institute of Technology and Science; Carnegie Mellon, 2022–

CHRISTOPHER ATKESON, Professor, Robotics Institute – Ph.D., Massachusetts Institute Of Technology; Carnegie Mellon, 2000–

JAMES BAGNELL, Associate Professor, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2004–

ANDREA BAJCSY, Assistant Professor, Robotics Institute – Ph.D., University of California, Berkeley; Carnegie Mellon, 2023–

MARIA FLORINA BALCAN, Professor, Machine Learning Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2014–

STEPHANIE BALZER, Assistant Professor, Computer Science Department – Ph.D., ETH Zurich; Carnegie Mellon, 2016–

ZIV BAR-JOSEPH, Professor, Computational Biology Department – Ph.D., Massachusetts Institute Of Technology; Carnegie Mellon, 2003–

LUJO BAUER, Professor, Institute for Software Research – Ph.D., Princeton University; Carnegie Mellon, 2015–

NATHAN BECKMANN, Associate Professor, Computer Science Department – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 2017–

TAYLOR BERG-KIRKPATRICK, Assistant Professor, Language Technologies Institute – Ph.D., University of California at Berkeley; Carnegie Mellon, 2016–

JEFFREY BIGHAM, Associate Professor, Human-Computer Interaction Institute – Ph.D., University of Washington; Carnegie Mellon, 2013–

YONATAN BISK, Assistant Professor, Language Technologies Institute – Ph.D, University of Illinois, Urbana- Champaign; Carnegie Mellon, 2020–

GUY BLELLOCH, Professor, Computer Science Department – Ph.D., Massachusetts Institute Of Technology; Carnegie Mellon, 1988–

MANUEL BLUM, University Professor Emeritus, Computer Science Department – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 2001–

CHRISTOPHER BOGART, Systems Scientist, Institute for Sofrware research – Ph.D., Oregon State University; Carnegie Mellon, 2017–

RICHARD BORDER, Assistant Professor, Computational Biology Department – Ph.D., University of California, Los Angeles; Carnegie Mellon, 2025–

DAVID BOURNE, Principal Systems Scientist, Robotics Institute – M.S., University Of Pennsylvania; Carnegie Mellon, 1980–

DANIEL BOYARSKI, Professor – M.F.A., Indiana University; Carnegie Mellon, 1982–

TRAVIS BREAUX, Associate Professor, Institute for Software Research – Ph.D., North Carolina State University; Carnegie Mellon, 2010–

STEPHEN BROOKES, Professor Emeritus, Computer Science Department – Ph.D., Oxford University; Carnegie Mellon, 1981–

RALF BROWN, Principal Systems Scientist, Language Technologies Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1993–

FRASER BROWN, Assistant Professor, Institute for Software Research – Ph.D., Stanford University; Carnegie Mellon, 2022–

RANDAL BRYANT, University Professor Emeritus, Computer Science Department – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 1984–

CARLOS BUSSO, Professor, Language Technologies Institute – Ph.D., University of Southern California; Carnegie Mellon, 2025–

JAMES CALLAN, Professor and Director, Language Technologies Institute – Ph.D., University Of Massachusetts; Carnegie Mellon, 1999–

JAVIER CAMARA-MORENO, Systems Scientist, Institute for Software Research – Ph.D., University of Malaga; Carnegie Mellon, 2015–

OANA CARJA, Assistant Professor, Computational Biology – Ph.D., Stanford University; Carnegie Mellon, 2019–

KATHLEEN CARLEY, Professor, Institute for Software Research – Ph.D., Harvard University; Carnegie Mellon, 1984–

JACOBO CARRASQUEL, Associate Teaching Professor Emeritus, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1983–

PATRICK CARRINGTON, Assistant Professor, Human Computer Interaction Institute – Ph.D., University of Maryland; Carnegie Mellon, 2019–

PAOLO CARVALHO, Assisant Professor, Human-Computer Interaction Institute – Ph.D., Indiana University; Carnegie Mellon, 2024–

JUSTINE CASSELL, Professor, Language Technologies Institute – Ph.D., University of Chicago; Carnegie Mellon, 2010–

ILIANO CERVESATO, Teaching Professor, Computer Science Department – Ph.D., University of Torino; Carnegie Mellon, 2016–

HENRY CHAI, Assistant Teaching Professor, Machine Learning Department – Ph.D., Washington University, Saint Louis; Carnegie Mellon, 2022–

JUSTIN CHAN, Assistant Professor, Software and Societal Systems Department – Ph.D., University of Washington; Carnegie Mellon, 2024–

TIANQI CHEN, Assistant Professor, Machine Learning Department / Computer Science Department – Ph.D, University of Washington; Carnegie Mellon, 2020–

HOWARD CHOSET, Professor, Robotics Institute – Ph.D., California Institute Of Technology; Carnegie Mellon, 1996–

NICOLAS CHRISTIN, Professor, Institute for Software Research – Ph.D., University of Virginia; Carnegie Mellon, 2017–

WILLIAM COHEN, Professor, Machine Learning Department – Ph.D., Rutgers University; Carnegie Mellon, 2003–

PHILLIP COMPEAU, Associate Teaching Professor, Computational Biology Department – Ph.D., University of California, San Diego; Carnegie Mellon, 2015–

VINCENT CONITZER, Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2022–

ALBERT CORBETT, Associate Research Professor Emeritus, Human-Computer Interaction Institute – Ph.D., University Of Oregon; Carnegie Mellon, 1983–

THOMAS CORTINA, Associate Dean for Undergraduate Programs and Teaching Professor, Computer Science Department – Ph.D., Polytechnic University (Brooklyn); Carnegie Mellon, 2004–

KEENAN CRANE, Associate Professor, Robotics Institute – Ph.D., California Institute of Technology; Carnegie Mellon, 2015–

LORRIE CRANOR, Professor, Institute for Software Research – Ph.D., Washington University; Carnegie Mellon, 2003–

KARL CRARY, Associate Professor, Computer Science Department – Ph.D., Cornell University; Carnegie Mellon, 1998–

CHRISTIAN CUBA-SANAMIEGO, Assistant Professor, Computational Biology Department – Ph.D., University of California, Riverside; Carnegie Mellon, 2024–

LAURA DABBISH, Professor, Human Computer Interaction Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2007–

ROGER DANNENBERG, Professor Emeritus, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1982–

SAUVIK DAS, Assistant Professor, Human Computer Interaction Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2022–

PATHAK DEEPAK, Assistant Professor, Robotics Institute – Ph.D., University of California, Berkeley; Carnegie Mellon, 2020–

FERNANDO DE LA TORRE FRADE, Associate Research Professor, Robotics Institute – Ph.D., La Salle School of Engineering; Carnegie Mellon, 2002–

DAN DEBLASIO, Assistant Teaching Professor, Computational Biology Department – Ph.D., University of Arizona; Carnegie Mellon, 2023–

MONA DIAB, Professor, Language Technologies Institute – Ph.D., George Washington University; Carnegie Mellon, 2023–

FERNANDO DIAZ, Associate Professor, Language Technologies Institute – Ph.D., University of Massachusetts Amherst; Carnegie Mellon, 2023–

JOHN DOLAN, Principal Systems Scientist, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1991–

CHRIS DONAHUE, Assistant Professor, Language Technologies Institute – Ph.D., University of California San Diego; Carnegie Mellon, 2023–

ARTUR DUBRAWSKI, Research Professor, Robotics Institute – Ph.D., Institute of Fundamental Technological Research; Carnegie Mellon, 2003–

DAVID ECKHARDT, Teaching Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2003–

WILLIAM EDDY, Professor – Ph.D., Yale University; Carnegie Mellon, 1976–

JEFFREY EPPINGER, Professor Of The Practice, Institute for Software Research – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2001–

MICHAEL ERDMANN, Professor, Robotics Institute – Ph.D., Massachusetts Institute Of Technology; Carnegie Mellon, 1989–

ZACKORY ERICKSON, Assistant Professor, Robotics Institute – Ph.D, Georgia Institute of Technology; Carnegie Mellon, 2021–

MOTAHHARE ESLAMI, Assistant Professor, Human Computer Interaction Institute – Ph.D, University of Illinois, Urbana- Champaign; Carnegie Mellon, 2020–

SCOTT FAHLMAN, Professor Emeritus, Language Technologies Institute – Ph.D., Massachusetts Institute Of Technology; Carnegie Mellon, 1978–

CHRISTOS FALOUTSOS, Professor, Computer Science Department – Ph.D., University Of Toronto; Carnegie Mellon, 1997–

FEI FANG, Associate Professor, Institute for Software Research – Ph.D., University of Southern California; Carnegie Mellon, 2017–

JODI FORLIZZI, Professor, Director; Human-Computer Interaction Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2000–

SARAH FOX, Assistant Professor, Human Computer Interaction Institute – Ph.D, University of Washington; Carnegie Mellon, 2020–

KATE FRAGKIADAKI, Associate Professor, Machine Learning Department – Ph.D., University of Pennsylvania ; Carnegie Mellon, 2016–

MATTHEW FREDRIKSON, Associate Professor, Computer Science Department – Ph.D., University of Wisconsin; Carnegie Mellon, 2015–

DANIEL FRIED, Assistant Professor, Language Technologies Institute – Ph.D., University of California at Berkeley; Carnegie Mellon, 2022–

JOHN GALEOTTI, Senior Systems Scientist, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2014–

DAVID GARLAN, Professor, Institute for Software Research – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1990–

CHARLES GARROD, Associate Teaching Professor, Institute for Software Research – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2012–

HARTMUT GEYER, Professor, Robotics Institute – Ph.D., Friedrich-Schiller University; Carnegie Mellon, 2010–

PHIL GIBBONS, Professor, Computer Science Department – Ph.D., University of California at Berkeley; Carnegie Mellon, 2015–

IOANNIS GKIOULEKAS, Associate Professor, Robotics Institute – Ph.D., Harvard; Carnegie Mellon, 2017–

CLARK GLYMOUR, University Professor – Ph.D., Indiana University; Carnegie Mellon, 1985–

MAYANK GOEL, Associate Professor, Institute for Software Research – Ph.D., University of Washington; Carnegie Mellon, 2016–

SETH GOLDSTEIN, Associate Professor, Computer Science Department – Ph.D., University Of California; Carnegie Mellon, 1997–

GEOFFREY GORDON, Professor, Machine Learning Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2001–

MATTHEW GORMLEY, Associate Teaching Professor, Machine Learning Department – Ph.D., John Hopkins University; Carnegie Mellon, 2015–

ALBERT GU, Assistant Professor, Machine Learning Department – Ph.D., Stanford University; Carnegie Mellon, 2023–

MARCAIS GUILLAUME, Senior Systems Scientist, Computational Biology Department – Ph.D., University of Maryland; Carnegie Mellon, 2020–

ABHINAV GUPTA, Professor, Robotics Institute – Ph.D., University of Maryland; Carnegie Mellon, 2011–

ANUPAM GUPTA, Professor, Computer Science Department – Ph.D., University Of California at Berkeley; Carnegie Mellon, 2003–

HANA HABIB, Assistant Teaching Professor, Software and Societal Systems Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2024–

ZAKIA HAMMAL, Systems Scientist, Robotics Institute – Ph.D, University of Grenoble, France; Carnegie Mellon, 2021–

JESSICA HAMMER, Associate Professor, Human-Computer Interaction Institute – Ph.D., Columbia University; Carnegie Mellon, 2014–

MOR HARCHOL-BALTER, Professor, Computer Science Department – Ph.D., University Of California at Berkeley; Carnegie Mellon, 1999–

ROBERT HARPER, Professor, Computer Science Department – Ph.D., Cornell University; Carnegie Mellon, 1988–

ERIK HARPSTEAD, Senior Systems Scientist, Human-Computer Interaction Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2017–

CHRISTINA HARRINGTON, Assistant Professor, Human Computer Interaction Institute – Ph.D, Georgia Institute of Technology; Carnegie Mellon, 2021–

CHRISTOPHER HARRISON, Associate Professor, Human-Computer Interaction Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2014–

ALEXANDER HAUPTMANN, Research Professor, Language Technologies Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1994–

MARTIAL HEBERT, Dean of the School of Computer Science and Professor, Robotics Institute – Ph.D., Paris-Xl; Carnegie Mellon, 1984–

HODA HEIDARI, Assistant Professor, Machine Learning Department – Ph.D., University of Pittsburgh; Carnegie Mellon, 2020–

DAVID HELD, Associate Professor, Robotics Institute – Ph.D., Stanford University; Carnegie Mellon, 2017–

VINCENT HELLENDOORN, Assistant Professor, Software and Societal Systems Department – Ph.D., University of California Davis; Carnegie Mellon, 2020–

AUSTIN HENLEY, Associate Teaching Professor, Software and Societal Systems Department – Ph.D., The University of Memphis; Carnegie Mellon, 2024–

JAMES HERBSLEB, Director, Professor, Institute for Software Research – Ph.D., University Of Nebraska; Carnegie Mellon, 2002–

MARIJN HEULE, Associate Professor, Computer Science Department – Ph.D., Delft University of Technology (Netherlands); Carnegie Mellon, 2019–

LEE HILLMAN, Executive Director of MHCI, Human-Computer Interaction Institute – M.S., Carnegie Mellon University; Carnegie Mellon, 2017–

MICHAEL HILTON, Associate Teaching Professor, Institute for Software Research – Ph.D., Oregon State University; Carnegie Mellon, 2017–

JESSICA HODGINS, Professor, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2001–

JAN HOFFMANN, Associate Professor, Computer Science Department – Ph.D., Ludwig-Maximilians-Universität and TU Munich; Carnegie Mellon, 2015–

RALPH HOLLIS, Research Professor Emeritus, Robotics Institute – Ph.D, University of Colorado; Carnegie Mellon, 1993–

JASON HONG, Associate Professor, Human-Computer Interaction Institute – Ph.D., University Of California at Berkeley; Carnegie Mellon, 2004–

DANIEL HUBER, Senior Systems Scientist, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2002–

SCOTT HUDSON, Professor, Human-Computer Interaction Institute – Ph.D., University Of Colorado; Carnegie Mellon, 1997–

JEFF ICHNOWSKI, Assistant Professor, Robotics Institute – Ph.D., University of North Carolina at Chapel Hill; Carnegie Mellon, 2023–

DAPHNE IPPOLITO, Assistant Professor, Language Technologies Institute – Ph.D., University of Pennsylvania; Carnegie Mellon, 2023–

FARNAM JAHANIAN, President, Carnegie Mellon University, and Professor, Computer Science Department – Ph.D., University of Texas at Austin; Carnegie Mellon, 2014–

AAYUSH JAIN, Assistant Professor, Computer Science Department – Ph.D, University of California, Los Angeles; Carnegie Mellon, 2021–

LASZLO JENI, Assistant Research Professor, Robotics Institute – Ph.D., University of Tokyo; Carnegie Mellon, 2018–

MATTHEW JOHNSON-ROBERSON, Professor, Director, Robotics Institute – Ph.D., University of Sydney; Carnegie Mellon, 2022–

MICHAEL KAESS, Associate Professor – Ph.D., Georgia Institute of Technology; Carnegie Mellon, 2013–

TAKEO KANADE, University Professor, Robotics Institute – Ph.D., Kyoto University; Carnegie Mellon, 1980–

EUNSUK KANG, Assistant Professor, Institute for Software Research – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 2017–

JOSHUA KANGAS, Assistant Teaching Professor, Computational Biology Department – PhD, Carnegie Mellon University; Carnegie Mellon, 2018–

GEORGE KANTOR, Research Professor, Robotics Institute – Ph.D., University of Maryland; Carnegie Mellon, 2002–

IRENE KAPLOW, Assistant Professor, Computational Biology Department – Ph.D., Stanford University; Carnegie Mellon, 2024–

CHRISTIAN KASTNER, Associate Professor, Institute for Software Research – Ph.D., University of Magdeburg; Carnegie Mellon, 2012–

GEOFF KAUFMAN, Associate Professor, Human Computer Interaction Institute – Ph.D., Ohio State University; Carnegie Mellon, 2015–

DILSUN KAYNUR, Associate Teaching Professor, Computer Science Department – Ph.D., University of Edinburgh; Carnegie Mellon, 2012–

ALONZO KELLY, Professor Emeritus, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1998–

SEUNGJUN KIM, Systems Scientist, Human-Computer Interaction Institute – Ph.D., Gwangju Institute of Science and Technology; Carnegie Mellon, 2011–

CARL KINGSFORD, Professor, Computational Biology Department – Ph.D., Princeton University; Carnegie Mellon, 2012–

KRIS KITANI, Associate Research Professor, Robotics Institute – Ph.D., University of Tokyo; Carnegie Mellon, 2016–

ANIKET KITTUR, Professor, Human-Computer Interaction Institute – Ph.D., University of California At Los Angeles; Carnegie Mellon, 2009–

DANIEL KLUG, Systems Scientist, Institute for Software Research – Ph.D., University of Basel; Carnegie Mellon, 2021–

KENNETH KOEDINGER, Professor, Human-Computer Interaction Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1991–

ANNE KOHLBRENNER, Assistant Teaching Professor, Computer Science Department – Ph.D., Princeton University; Carnegie Mellon, 2023–

J. ZICO KOLTER, Professor, Computer Science Department – Ph.D., Stanford University; Carnegie Mellon, 2012–

DAVID KOSBIE, Teaching Professor, Computer Science Department – M.S., Carnegie Mellon University; Carnegie Mellon, 2009–

PRAVESH KOTHARI, Assistant Professor, Computer Science Department – Ph.D., University of Texas at Austin; Carnegie Mellon, 2018–

IOANNIS KOUTIS, Adjunct Assistant Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2008–

ROBERT KRAUT, Herbert A. Simon Professor Emeritus, Human-Computer Interaction Institute – Ph.D., Yale University; Carnegie Mellon, 1993–

OLIVER KROEMER, Associate Professor, Robotics Institute – Ph.D., Technische Universität Darmstadt; Carnegie Mellon, 2017–

CLAIRE LE GOUES, Professor, Institute for Software Research – Ph.D., University of Virginia; Carnegie Mellon, 2013–

AVIRAL KUMAR, Assistant Professor, Computer Science Department – Ph.D., University of California, Berkeley; Carnegie Mellon, 2024–

WILLIAM KUSZMAUL, Assistant Professor, Computer Science Department – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 2024–

CHRISTIAN LEBIERE, Research Psychologist, Psychology – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1999–

EUN SUN LEE, Associate Teaching Professor, Institute for Software Research – M.S., Carnegie Mellon University; Carnegie Mellon, 2014–

TAI-SING LEE, Professor, Computer Science Department – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 1996–

TERRY E LEE, Associate Teaching Professor, Software and Societal Systems Department – M.Sc., Carnegie Mellon University; Carnegie Mellon, 2020–

LORRAINE LEVIN, Research Professor, Language Technologies Institute – Ph.D., Massachusetts Institute Of Technology; Carnegie Mellon, 1989–

JAIOYANG LI, Assistant professor, Robotics Institute – Ph.D., University of Southern California; Carnegie Mellon, 2022–

LEI LI, Assistant Professor, Language Technologies Institute – Ph.D., University of California Santa Barbara; Carnegie Mellon, 2023–

MINCHEN LI, Assistant Professor, Computer Science Department – Ph.D., University of Pennsylvania; Carnegie Mellon, 2023–

MAXIM LIKACHEV, Professor, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2010–

ZACHARY LIPTON, Associate Professor, Machine Learning Department – Ph.D., University of California San Diego; Carnegie Mellon, 2024–

CHANGLIU LIU, Assistant Professor, Robotics Institute – Ph.D., University of California, Berkeley; Carnegie Mellon, 2019–

YANG LIU, Assistant Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2025–

JOSE LUGO-MARTINEZ, Assistant Professor, Computational Biology Department – Ph.D., Indiana University; Carnegie Mellon, 2022–

JIAN MA, Professor, Computational Biology Department – Ph.D., Pennsylvania State University ; Carnegie Mellon, 2016–

JOHN MACKEY, Teaching Professor, Computer Science Department and Mathematics Department – Ph.D., University of Hawaii; Carnegie Mellon, 2003–

ZACHARY MANCHESTER, Assistant Professor, Robotics Institute – Ph.D., Cornell University; Carnegie Mellon, 2020–

MELISA ORTA MARTINEZ, Assistant Professor, Robotics Institute – PH.D., Stanford University; Carnegie Mellon, 2020–

RUBEN MARTINS, Assistant Research Professor, Institute for Software Research – Ph.D, Technical university of Lisbon; Carnegie Mellon, 2018–

NIKOLAS MARTELARO, Assistant Professor, Human Computer Interaction Institute – Ph.D, Stanford University; Carnegie Mellon, 2020–

MATTHEW MASON, Professor Emeritus, Robotics Institute – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 1982–

AULDYN MATTHEWS-MCGEE, Assistant Teaching Professor, Human Computer Interaction Institute – MHCI, Carnegie Mellon University; Carnegie Mellon, 2023–

JAMES MCCANN, Associate Professor, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2017–

BRUCE MCLAREN, Professor, Human-Computer Interaction Institute – Ph.D., University Of Pittsburgh; Carnegie Mellon, 2003–

HEATHER MILLER, Assistant Professor, Institute for Software Research – Ph.D., École Polytechnique Fédérale de Lausanne; Carnegie Mellon, 2018–

EDUARDO MIRANDA, Teaching Professor, Institute for Software Research – M.S./M.Eng., University of Linköping/University of Ottawa; Carnegie Mellon, 2008–

TERUKO MITAMURA, Research Professor, Language Technologies Institute – Ph.D., University Of Pittsburgh; Carnegie Mellon, 1990–

TOM MITCHELL, University Professor, Machine Learning Department – Ph.D., Stanford University; Carnegie Mellon, 1986–

HOSEIN MOHIMANI, Associate Professor, Computational Biology Department – Ph.D., University of California, San Diego; Carnegie Mellon, 2017–

ALAN MONTGOMERY, Associate Professor of Marketing – Ph.D., University Of Chicago; Carnegie Mellon, 1999–

IGOR MORDATCH, Assistant Professor, Robotics Institute – Ph.D., University of Washington; Carnegie Mellon, 2017–

LOUIS-PHILIPPE MORENCY, Associate Professor, Language Technologies Institute – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 2015–

DOMINIK MORITZ, Assistant Professor, Robotics Institute – Ph.D, University of Washington; Carnegie Mellon, 2020–

JAMES MORRIS, Professor, Emeritus, Human-Computer Interaction Institute – Ph.D., Massachusetts Institute Of Technology; Carnegie Mellon, 1982–

DAVID MORTENSEN, Assistant Research Professor, Language Technologies Institute – Ph.D, University of California, Berkeley; Carnegie Mellon, 2015–

JACK MOSTOW, Research Professor Emeritus, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1992–

TODD MOWRY, Professor, Computer Science Department – Ph.D., Stanford University; Carnegie Mellon, 1997–

KATHARINA MUELLING, Systems Scientist, Robotics Institute – Ph.D., Max Planck Institute for Intelligent Systems; Carnegie Mellon, 2013–

ROBERT MURPHY, Ray and Stephanie Lane Professor of Computational Biology Emeritus – Ph.D., California Institute of Technology; Carnegie Mellon, 1983–

BRAD MYERS, Professor, Human-Computer Interaction Institute – Ph.D., University Of Toronto; Carnegie Mellon, 1987–

PRIYA NARASIMHAN, Professor – Ph.D., University Of California; Carnegie Mellon, 2001–

SRINIVASA NARASIMHAN, Professor, Interim Director, Robotics Institute – Ph.D., Columbia University; Carnegie Mellon, 2004–

ARAN NAYEBI, Assistant Professor, Machine Learning Department – Ph.D., Stanford University; Carnegie Mellon, 2024–

GRAHAM NEUBIG, Associate Professor, Language Technologies Institute – Ph.D., Kyoto University; Carnegie Mellon, 2016–

CHRISTINE NEUWIRTH, Professor – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2004–

ILLAH NOURBAKHSH, Professor, Robotics Institute – Ph.D., Stanford University; Carnegie Mellon, 1997–

ERIC NYBERG, Professor, Language Technologies Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1989–

RYAN O'DONNELL, Professor, Computer Science Department – Ph.D., Massachusetts Institute Of Technology; Carnegie Mellon, 2006–

KEMAL OFLAZER, Associate Dean of Research, Language Technologies Institute – Ph.D, Carnegie Mellon University; Carnegie Mellon, 2008–

AMY OGAN, Associate Professor, Human-Computer Interaction Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2014–

DAVID O'HALLARON, Professor Emeritus, Computer Science Department – Ph.D., University of Virginia; Carnegie Mellon, 1989–

JEAN OH, Associate Research Professor, Robotics Institute – Ph.D, Carnegie Mellon University; Carnegie Mellon, 2019–

IRVING OPPENHEIM, Professor – Ph.D., University of Cambridge; Carnegie Mellon, 1973–

MATTHEW O'TOOLE, Associate Professor, Robotics Institute and Computer Science Department – Ph.D., University of Toronto; Carnegie Mellon, 2018–

RICCARDO PACCAGNELLA, Assistant Professor, Software and Societal Systems Department – Ph.D., University of Illinois Urbana-Champaign; Carnegie Mellon, 2023–

ROHAN PADHYE, Assistant Professor, Software and Societal Systems Department – Ph.D., University of California, Berkeley; Carnegie Mellon, 2020–

PATRICK PARK, Assistant Professor, Institute for Software Research – Ph.D, Cornell University; Carnegie Mellon, 2021–

BRYAN PARNO, Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2017–

JIGNESH PATEL, Professor, Computer Science Department – Ph.D., University of Wisconsin Madison; Carnegie Mellon, 2023–

DEEPAK PATHAK, Assistant Professor, Robotics Institute – Ph.D, University of California, Berkeley; Carnegie Mellon, 2020–

SCOTT PAVETTI, Assistant Teaching Professor, Software and Societal Systems Department – MSE, Carnegie Mellon University; Carnegie Mellon, 2020–

ANDREW PAVLO, Associate Professor, Computer Science Department – Ph.D., Brown University; Carnegie Mellon, 2013–

RICHARD PENG, Associate Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2023–

ADAM PERER, Assistant Professor, Human Computer Interaction Institute – Ph.D., University of Maryland; Carnegie Mellon, 2018–

JUERGEN PFEFFER, Assistant Research Professor, Institute for Software Research – Ph.D., Vienna University of Technology; Carnegie Mellon, 2012–

ANDREAS PFENNING, Associate Professor, Computational Biology Department – Ph.D., Duke University; Carnegie Mellon, 2015–

FRANK PFENNING, Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1986–

BARNABAS POCZOS, Associate Professor, Machine Learning Department – Ph.D., Eötvös Loránd University; Carnegie Mellon, 2012–

NANCY POLLARD, Professor, Robotics Institute – Ph.D., Massachusetts Institute Of Technology; Carnegie Mellon, 2002–

ADITI RAGHUNATHAN, Assistant Professor, Computer Science Department – Ph.D., Stanford University; Carnegie Mellon, 2022–

BRIAN RAILING, Associate Teaching Professor, Computer Science Department – Ph.D., Georgia Institute of Technology; Carnegie Mellon, 2016–

BHIKSHA RAJ RAMAKRISHNAN, Professor, Language Technologies Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2008–

DEVA RAMANAN, Professor, Robotics Institute – Ph.D., University of California at Berkeley; Carnegie Mellon, 2015–

PRADEEP RAVIKUMAR, Professor, Machine Learning Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2016–

RAJ REDDY, University Professor, Institute for Software Research – Ph.D., Stanford University; Carnegie Mellon, 1969–

ANDREJ RISTESKI, Assistant Professor, Machine Learning Department – Ph.D., Princeton University; Carnegie Mellon, 2019–

KELLY RIVERS, Associate Teaching Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2017–

CAMERON RIVIERE, Research Professor, Robotics Institute – Ph.D., Johns Hopkins University; Carnegie Mellon, 1995–

DAVID ROOT, Associate Teaching Professor, Institute for Software Research – M.P.M., Carnegie Mellon University; Carnegie Mellon, 2002–

CAROLYN ROSE, Professor, Language Technologies Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2003–

RONALD ROSENFELD, Professor and Department Head, Machine Learning Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1995–

STEPHANIE ROSENTHAL, Associate Teaching Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2019–

STEVEN RUDICH, Professor, Computer Science Department – Ph.D., University of California; Carnegie Mellon, 1989–

ALEXANDER RUDNICKY, Professor Emeritus, Language Technologies Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1980–

MATTHEW RUFFALO, Systems Scientist, Computational Biology Department – Ph.D., Case Western Reserve University; Carnegie Mellon, 2016–

FERAS SAAD, Assistant Professor, Computer Science Department – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 2023–

NORMAN SADEH-KONIECPOL, Professor, Institute for Software Research – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1991–

MAJD SAKR, Teaching Professor, Computer Science Department – Ph.D., University of Pittsburgh; Carnegie Mellon, 2006–

RUSLAN SALAKHUTDINOV, Professor, Machine Learning Department – Ph.D., University of Toronto; Carnegie Mellon, 2016–

TUOMAS SANDHOLM, Professor, Computer Science Department – Ph.D., University of Massachusetts; Carnegie Mellon, 2001–

MAARTEN SAP, Assistant Professor, Language Technologies Institute – Ph.D., University of Washington; Carnegie Mellon, 2022–

MAHADEV SATYANARAYANAN, Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1983–

SARAH SCHEFFLER, Assistant Professor, Software and Societal Systems Department – Ph.D., Boston University; Carnegie Mellon, 2024–

RICHARD SCHEINES, Dean, Dietrich College and Professor, Philosophy – Ph.D., University of Pittsburgh; Carnegie Mellon, 1988–

SEBASTIAN SCHERER, Associate Research Professor, Robotics Institute – Ph.D, Carnegie Mellon University; Carnegie Mellon, 2010–

BRADLEY SCHMERL, Principal Systems Scientist, Computer Science Department – Ph.D., Flinders University of South Australia; Carnegie Mellon, 2000–

JEFF SCHNEIDER, Research Professor, Robotics Institute – Ph.D., University of Rochester; Carnegie Mellon, 1995–

RUSSELL SCHWARTZ, Professor of Biological Sciences and Department Head, Computational Biology Department – Ph.D, Massachusetts Institute of Technology; Carnegie Mellon, 2002–

DANA SCOTT, Professor Emeritus, Computer Science Department – Ph.D., Princeton University; Carnegie Mellon, 1981–

TEDDY SEIDENFELD, Herbert A. Simon Professor – Ph.D., Columbia University; Carnegie Mellon, 1985–

SRINIVASAN SESHAN, Professor and Department Head, Computer Science Department – Ph.D., University of California; Carnegie Mellon, 2000–

NIHAR SHAH, Associate Professor, Machine Learning Department – Ph.D., University of California at Berkeley; Carnegie Mellon, 2017–

MICHAEL SHAMOS, Teaching Professor, Language Technologies Institute and Institute for Software Research – Ph.D., Yale University; Carnegie Mellon, 1975–

MARY SHAW, University Professor, Institute for Software Research – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1965–

SKIP SHELLY, Associate Teaching Professor, Human Computer Interaction Institute – B.F.A., Carnegie Mellon University; Carnegie Mellon, 2017–

HONG SHEN, Assistant Research Professor, Human Computer Interaction Institute – Ph.D., University of Illinois, Urbana-Champaign; Carnegie Mellon, 2018–

JUSTINE SHERRY, Associate Professor, Computer Science Department – Ph.D., University of California at Berkeley; Carnegie Mellon, 2017–

GUANYA SHI, Assistant Professor, Robotics Institute – Ph.D., California Institute of Technology; Carnegie Mellon, 2023–

ELAINE SHI, Associate Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2020–

HIROKAZU SHIRADO, Assistant Professor, Human Computer Interaction Institute – Ph.D., Yale University; Carnegie Mellon, 2019–

DOUGLAS SICKER, Professor, Institute for Software Research – Ph.D., University of Pittsburgh; Carnegie Mellon, 2014–

MEL SIEGEL, Associate Research Professor Emeritus, Robotics Institute – Ph.D., University of Colorado; Carnegie Mellon, 1982–

DANIEL SIEWIOREK, Buhl University Professor Emeritus, Computer Science Department – Ph.D., Stanford University; Carnegie Mellon, 1972–

MAX SIMCHOWITZ, Assistant Professor, Machine Learning Department – Ph.D., University of California, Berkeley; Carnegie Mellon, 2025–

REID SIMMONS, Research Professor, Robotics Institute – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 1988–

AARTI SINGH, Professor, Machine Learning Department – Ph.D., University of Wisconsin At Madison; Carnegie Mellon, 2009–

RITA SINGH, Research Professor, Language Technologies Institute – Ph.D., National Geophysical Research Institute; Carnegie Mellon, 2010–

MICHAEL SKIRPAN, Assistant Teaching Professor, Software and Societal Systems Department – Ph.D., University of Colorado Boulder; Carnegie Mellon, 2023–

DANIEL SLEATOR, Professor, Computer Science Department – Ph.D., Stanford University; Carnegie Mellon, 1985–

STEPHEN SMITH, Research Professor, Robotics Institute – Ph.D., University of Pittsburgh; Carnegie Mellon, 1982–

VIRGINIA SMITH, Associate Professor, Machine Learning Department – Ph.D., University of California at Berkeley; Carnegie Mellon, 2018–

PETER SPIRTES, Professor, Philosophy – Ph.D., University of Pittsburgh; Carnegie Mellon, 1983–

JOHN STAMPER, Associate Professor, Human-Computer Interaction Institute – Ph.D., University of North Carolina At Charlotte; Carnegie Mellon, 2009–

PETER STEENKISTE, Professor, Computer Science Department – Ph.D., Stanford University; Carnegie Mellon, 1987–

MARK STEHLIK, Teaching Professor, Computer Science Department – B.S., Pace University; Carnegie Mellon, 1981–

AARON STEINFELD, Research Professor, Robotics Institute – Ph.D., University of Michigan; Carnegie Mellon, 2001–

GEORGE STETTEN, Adjunct Research Professor, Robotics Institute – Ph.D., University of North Carolina; Carnegie Mellon, 1999–

EMMA STRUBELL, Assistant Professor, Language Technologies Institute – Ph.D, University of Massachusetts, Amherst; Carnegie Mellon, 2020–

JOSHUA SUNSHINE, Systems Scientist, Institute for Software Research – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2014–

KLAUS SUTNER, Teaching Professor, Computer Science – Ph.D., University of Munich; Carnegie Mellon, 1995–

KATIA SYCARA, Research Professor, Robotics Institute – Ph.D., Georgia Institute of Technology; Carnegie Mellon, 1987–

WENNIE TABIB, Systems Scientist, Robotics Institute – Ph.D, Carnegie Mellon University; Carnegie Mellon, 2021–

AMEET TALWALKAR, Associate Professor, Machine Learning Department – Ph.D., New York University, Courant Institute; Carnegie Mellon, 2017–

MICHAEL TAYLOR, Assistant Teaching Professor, Computer Science Department – MSR, Carnegie Mellon University; Carnegie Mellon, 2020–

ZEYNEP TEMEL, Assistant Professor, Robotics Institute – Ph.D., Sabanci University (Istanbul, Turkey); Carnegie Mellon, 2019–

CHRIS TIMPERLEY, Senior Systems Scientist, Software and Societal Systems – Ph.D., University of York, UK; Carnegie Mellon, 2018–

DAVID TOURETZKY, Research Professor, Computer Science Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1984–

MATTHEW TRAVERS, Senior Systems Scientist, Robotics Institute – Ph.D., Northwestern University; Carnegie Mellon, 2013–

BOGDAN VASILESCU, Associate Professor, Institute for Software Research – Ph.D., Eindhoven University of Technology; Carnegie Mellon, 2016–

MARIA MANUELA VELOSO, Professor Emeritus, Machine Learning Department – Ph.D, Carnegie Mellon University; Carnegie Mellon, 1992–

RASHMI VINAYAK, Associate Professor, Computer Science Department – Ph.D., University of California at Berkeley; Carnegie Mellon, 2017–

LAURA VINCHESI, Assistant Teaching Professor, Human Computer Interaction Institute – MFA, Cranbrook Art Academy; Carnegie Mellon, 2023–

PAT VIRTUE, Assistant Teaching Professor, Computer Science Department and Machine Learning Department – Ph.D., University of California at Berkeley; Carnegie Mellon, 2018–

ALEXANDER WAIBEL, Professor, Language Technologies Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 1988–

WEINA WANG, Associate Professor, Computer Science Department – Ph.D., Arizona State University; Carnegie Mellon, 2018–

WENSHEN WANG, Systems Scientist, Robotics Institute – Ph.D., Shanghai Jiao Tong University; Carnegie Mellon, 2023–

LEILA WEHBE, Assistant Professor, Machine Learning Department – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2018–

DAVID WETTERGREEN, Research Professor, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2000–

BRYAN WILDER, Assistant Professor, Machine Learning Department – Ph.D., Harvard University; Carnegie Mellon, 2022–

DAVID WOODRUFF, Professor, Computer Science Department – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 2017–

WEI WU, Senior Systems Scientist, Computational Biology Department – Ph.D., Rutgers University; Carnegie Mellon, 2011–

SHERRY TONGSHUAN WU, Assistant Professor, Human Computer Interaction Institute – Ph.D., Washington University, Saint Louis; Carnegie Mellon, 2022–

STEVEN WU, Assistant Professor, Software and Societal Systems Department – Ph.D., University of Pennsylvania; Carnegie Mellon, 2020–

FRANCESKA XHAKAJ, Assistant Teaching Professor, Computer Science Department/ Human Computer Interaction Institute – Ph.D, Carnegie Mellon University; Carnegie Mellon, 2021–

POE ERIC XING, Professor, Machine Learning Department – Ph.D., University Of California At Berkeley; Carnegie Mellon, 2004–

CHENYAN XIONG, Associate Professor, Language Technologies Interaction Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2023–

MIN XU, Associate Professor, Computational Biology Department – Ph.D., University of Southern California; Carnegie Mellon, 2016–

YIMING YANG, Professor, Language Technologies Institute – Ph.D., Kyoto University; Carnegie Mellon, 1996–

NESRA YANNIER, Senior Systems Scientist, Human Computer Interaction Institute – Ph.D., Carnegie Melllon University; Carnegie Mellon, 2019–

LINING YAO, Associate Professor, Human Computer Interaction Institute – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 2017–

YUN WILLIAM YU, Assistant Professor, Computational Biology Department – Ph.D., Massachusetts Institute of Technology; Carnegie Mellon, 2023–

MARTIN ZHANG, Assistant Professor, Computational Biology Department – Ph.D., Stanford University; Carnegie Mellon, 2023–

JI ZHANG, System Scientist, Robotics Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2019–

HAIYI ZHU, Associate Professor, Human Computer Interaction Institute – Ph.D., Carnegie Mellon University; Carnegie Mellon, 2019–

JUN-YAN ZHU, Assistant Professor, Robotics Institute – Ph.D, University of California, Berkeley; Carnegie Mellon, 2020–

JOHN ZIMMERMAN, Professor, Human-Computer Interaction Institute – M.Des., Carnegie Mellon University; Carnegie Mellon, 2002–

Undergraduate Catalog