Online courses directory (19947)

This course covers abstractions and implementation techniques for the design of distributed systems. Topics include: server design, network programming, naming, storage systems, security, and fault tolerance. The assigned readings for the course are from current literature. This course is worth 6 Engineering Design Points.

6.825 is a graduate-level introduction to artificial intelligence. Topics covered include: representation and inference in first-order logic, modern deterministic and decision-theoretic planning techniques, basic supervised learning methods, and Bayesian network inference and learning.

This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5504 (Techniques in Artificial Intelligence).

This course studies fundamental design and implementation ideas in the engineering of operating systems. Lectures are based on a study of UNIX and research papers. Topics include virtual memory, threads, context switches, kernels, interrupts, system calls, interprocess communication, coordination, and the interaction between software and hardware. Individual laboratory assignments involve implementation of a small operating system in C, with some x86 assembly.

Build your earth science vocabulary and learn about cycles of matter and types of sedimentary rocks through the Education Portal course Earth Science 101: Earth Science. Our series of video lessons and accompanying self-assessment quizzes can help you boost your scientific knowledge ahead of the Excelsior Earth Science exam . This course was designed by experienced educators and examines both science basics, like experimental design and systems of measurement, and more advanced topics, such as analysis of rock deformation and theories of continental drift.

Build your earth science vocabulary and learn about cycles of matter and types of sedimentary rocks through the Education Portal course Earth Science 101: Earth Science. Our series of video lessons and accompanying self-assessment quizzes can help you boost your scientific knowledge ahead of the Excelsior Earth Science exam . This course was designed by experienced educators and examines both science basics, like experimental design and systems of measurement, and more advanced topics, such as analysis of rock deformation and theories of continental drift.

Electrical circuits are everywhere, tiny ones in integrated circuits in mobile phones and music players, to giant ones that carry power to our homes. This course deals with basic elements of electrical circuits (R, L, C, M, ideal opamp) and analysis of circuits containing these elements. Systematic methods for analyzing large circuits, and tools for analyzing circuits with memory elements and time varying inputs will be discussed.

The course introduces you to digital circuits and their merits and demerits over analog circuits. Basic building blocks of both combinational and sequential circuits or introduces and many examples of circuit design using these building blocks are presented. You will also be introduced to the design of digital systems such as traffic light controller.

This course focuses on the algorithms for analyzing and designing geometric foldings. Topics include reconfiguration of foldable structures, linkages made from one-dimensional rods connected by hinges, folding two-dimensional paper (origami), and unfolding and folding three-dimensional polyhedra. Applications to architecture, robotics, manufacturing, and biology are also covered in this course.

Acknowledgments

Thanks to videographers Martin Demaine and Jayson Lynch.

How does the global network infrastructure work and what are the design principles on which it is based? In what ways are these design principles compromised in practice? How do we make it work better in today's world? How do we ensure that it will work well in the future in the face of rapidly growing scale and heterogeneity? And how should Internet applications be written, so they can obtain the best possible performance both for themselves and for others using the infrastructure? These are some issues that are grappled with in this course. The course will focus on the design, implementation, analysis, and evaluation of large-scale networked systems.

Topics include internetworking philosophies, unicast and multicast routing, congestion control, network quality of service, mobile networking, router architectures, network-aware applications, content dissemination systems, network security, and performance issues. Material for the course will be drawn from research papers, industry white papers, and Internet RFCs.

Robots today move far too conservatively, using control systems that attempt to maintain full control authority at all times. Humans and animals move much more aggressively by routinely executing motions which involve a loss of instantaneous control authority. Controlling nonlinear systems without complete control authority requires methods that can reason about and exploit the natural dynamics of our machines.

This course discusses nonlinear dynamics and control of underactuated mechanical systems, with an emphasis on machine learning methods. Topics include nonlinear dynamics of passive robots (walkers, swimmers, flyers), motion planning, partial feedback linearization, energy-shaping control, analytical optimal control, reinforcement learning/approximate optimal control, and the influence of mechanical design on control. Discussions include examples from biology and applications to legged locomotion, compliant manipulation, underwater robots, and flying machines.

Acknowledgements

Professor Tedrake would like to thank John Roberts for his help with the course and videotaping the lectures.

Animation is a compelling and effective form of expression; it engages viewers and makes difficult concepts easier to grasp. Today's animation industry creates films, special effects, and games with stunning visual detail and quality. This graduate class will investigate the algorithms that make these animations possible: keyframing, inverse kinematics, physical simulation, optimization, optimal control, motion capture, and data-driven methods. Our study will also reveal the shortcomings of these sophisticated tools. The students will propose improvements and explore new methods for computer animation in semester-long research projects. The course should appeal to both students with general interest in computer graphics and students interested in new applications of machine learning, robotics, biomechanics, physics, applied mathematics and scientific computing.

Personality psychology is the study of the development of personality, the effects of personality on important outcomes, and attempts to make beneficial changes to maladaptive personality characteristics.

This course provides students with a comprehensive introduction to computers. Students will explore a variety of topics in computing, such as the following: the components of a computer, common computer terminology, an introduction to the Internet, computer security and privacy, computer troubleshooting techniques, and steps to maintain the life of your computer. Through readings and videos, students will learn how to fully understand the basics of computer technology.

PURPOSE OF COURSE…

Please note: Our faculty members have indicated that several important changes need to be made in order to improve the course and your experience as a student. In 2013, we will be re-releasing this course under the simplified title: ARTH101: Art Appreciation and Techniques. Until then, you are welcome to work through this course at your own leisure; there

6.844 is a graduate introduction to programming theory, logic of programming, and computability, with the programming language Scheme used to crystallize computability constructions and as an object of study itself. Topics covered include: programming and computability theory based on a term-rewriting, "substitution" model of computation by Scheme programs with side-effects; computation as algebraic manipulation: Scheme evaluation as algebraic manipulation and term rewriting theory; paradoxes from self-application and introduction to formal programming semantics; undecidability of the Halting Problem for Scheme; properties of recursively enumerable sets, leading to Incompleteness Theorems for Scheme equivalences; logic for program specification and verification; and Hilbert's Tenth Problem.

Data structures play a central role in modern computer science. You interact with data structures even more often than with algorithms (think Google, your mail server, and even your network routers). In addition, data structures are essential building blocks in obtaining efficient algorithms. This course covers major results and current directions of research in data structure.

Acknowledgments

Thanks to videographers Martin Demaine and Justin Zhang.

This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimum cuts); geometric algorithms (convex hulls, linear programming in fixed or arbitrary dimension); approximate counting; parallel algorithms; online algorithms; derandomization techniques; and tools for probabilistic analysis of algorithms.

This participatory seminar focuses on the knowledge and skills necessary for teaching science and engineering in higher education. This course is designed for graduate students interested in an academic career, and anyone else interested in teaching. Topics include theories of adult learning; course development; promoting active learning, problem-solving, and critical thinking in students; communicating with a diverse student body; using educational technology to further learning; lecturing; creating effective tests and assignments; and assessment and evaluation. Students research and present a relevant topic of particular interest. The subject is appropriate for both novices and those with teaching experience.

This course is an introduction to the theory that tries to explain how minds are made from collections of simpler processes. It treats such aspects of thinking as vision, language, learning, reasoning, memory, consciousness, ideals, emotions, and personality. It incorporates ideas from psychology, artificial intelligence, and computer science to resolve theoretical issues such as wholes vs. parts, structural vs. functional descriptions, declarative vs. procedural representations, symbolic vs. connectionist models, and logical vs. common-sense theories of learning.