This course examines American foreign policy concerning the promotion of democracy and human rights abroad. The course begins by examining how and why these policies are developed within the U.S. political, economic, institutional, and geostrategic context. Through the use of case studies, we will then evaluate how these policies have influenced events in Latin America, East Asia, Eastern Europe, and sub-Saharan and southern Africa.

A selection of projects with a goal of discovery of properties and patterns in mathematical structures. The choice of projects varies from year to year and is drawn from algebra, analysis, discrete mathematics, geometry, applied mathematics, and statistics.

This intermediate-level course presents a hands-on introduction to robotics. Each student will construct and modify a robot controlled by an Arduino-like microcontroller. Topics include kinematics, inverse kinematics, control-theory, sensors, mechatronics, and motion planning. Material will be delivered through one weekly lecture and one weekly guided laboratory. Assignments include a lab-preparatory homework, guided lab sessions, and out-of-class projects that build upon the in-class sessions.

Building large software systems introduces new challenges to software development. Appropriate design decisions and programming methodology can make a major difference in developing software that is correct and maintainable. In this course, students will learn techniques and tools that are used to build correct and maintainable software, improving their skills in designing, writing, debugging, and testing software. Topics include object-oriented design, testing, design patterns, and software architecture. This course is programming intensive.

Topics include the real number system, convergence of sequences and series, power series, uniform convergence, compactness and connectedness, continuity, abstract treatment of differential and integral calculus, metric spaces, and point-set topology.

Abstract algebra is the study of the common principles that govern computations with seemingly disparate objects. One way to begin is by studying groups, which are sets with a single operation under which each non-identity element is invertible. Examples include the integers with addition, invertible matrices of size n, permutations of a fixed set, and the symmetries of an object. Our goal is to study a definition of groups that unifies all of the important examples above and more.

This course will begin with an introduction to number theory, covering material on congruences, prime numbers, arithmetic functions, primitive roots, quadratic residues, and quadratic fields. We will then continue our study of number theory by picking special topics which might include some of the following: Finite Fields, Prime Factorization of Ideals, Fermat's Last Theorem, Elliptic curves, Dirichlet's Theorem on Arithmetic Progressions, the Prime Number Theorem, or the Riemann Zeta function.

Stochastic processes are mathematical models that evolve with time and include an element of randomness. They involve a collection of states-for example, the weather in a geographical location, the size of a population, or the length of a queue-and a description of how the system evolves from one state to the next. This course is devoted to the study of a class of stochastic processes called Markov chains, and we attempt to study their behavior using tools from probability theory and linear algebra in beautiful, interconnected ways.

This course provides an overview of statistical methods, their conceptual underpinnings, and their use in various settings taken from current news, as well as from the physical, biological, and social sciences. Topics will include exploring distributions and relationships, planning for data production, sampling distributions, basic ideas of inference (confidence intervals and hypothesis tests), inference for distributions, and inference for relationships, including chi-square methods for two-way tables and regression.