This is a graduate-level introduction to the principles of statistical inference with probabilistic models defined using graphical representations. The material in this course constitutes a common foundation for work in machine learning, signal processing, artificial intelligence, computer vision, control, and communication. Ultimately, the subject is about teaching you contemporary approaches to, and perspectives on, problems of statistical inference.

Students today develop proficiency with many different algorithms for multiplication. This approach insures that each student will find a method that works effectively for him/her. Teachers model the different algorithms and encourage students to use and practice each method before selecting a favorite.

This course is a comprehensive introduction to control system synthesis in which the digital computer plays a major role, reinforced with hands-on laboratory experience. The course covers elements of real-time computer architecture; input-output interfaces and data converters; analysis and synthesis of sampled-data control systems using classical and modern (state-space) methods; analysis of trade-offs in control algorithms for computation speed and quantization effects. Laboratory projects emphasize practical digital servo interfacing and implementation problems with timing, noise, and nonlinear devices.

This course is an introduction to the theory and application of large-scale dynamic programming. Topics include Markov decision processes, dynamic programming algorithms, simulation-based algorithms, theory and algorithms for value function approximation, and policy search methods. The course examines games and applications in areas such as dynamic resource allocation, finance and queueing networks.

This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.

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.

Kevin Slavin argues that we're living in a world designed for -- and increasingly controlled by -- algorithms. In this riveting talk from TEDGlobal, he shows how these complex computer programs determine: espionage tactics, stock prices, movie scripts, and architecture. And he warns that we are writing code we can't understand, with implications we can't control. A quiz, thought provoking question, and links for further study are provided to create a lesson around the 15-minute video. Educators may use the platform to easily "Flip" or create their own lesson for use with their students of any age or level.

This course begins with an introduction to the theory of computability, then proceeds to a detailed study of its most illustrious result: Kurt Gödel’s theorem that, for any system of true arithmetical statements we might propose as an axiomatic basis for proving truths of arithmetic, there will be some arithmetical statements that we can recognize as true even though they don’t follow from the system of axioms. In my opinion, which is widely shared, this is the most important single result in the entire history of logic, important not only on its own right but for the many applications of the technique by which it’s proved. We’ll discuss some of these applications, among them: Church’s theorem that there is no algorithm for deciding when a formula is valid in the predicate calculus; Tarski’s theorem that the set of true sentence of a language isn’t definable within that language; and Gödel’s second incompleteness theorem, which says that no consistent system of axioms can prove its own consistency.

By the end of this section, you will be able to:Describe problem solving strategiesDefine algorithm and heuristicExplain some common roadblocks to effective problem solving

Psychology is designed to meet scope and sequence requirements for the single-semester introduction to psychology course. The book offers a comprehensive treatment of core concepts, grounded in both classic studies and current and emerging research. The text also includes coverage of the DSM-5 in examinations of psychological disorders. Psychology incorporates discussions that reflect the diversity within the discipline, as well as the diversity of cultures and communities across the globe.Senior Contributing AuthorsRose M. Spielman, Formerly of Quinnipiac UniversityContributing AuthorsKathryn Dumper, Bainbridge State CollegeWilliam Jenkins, Mercer UniversityArlene Lacombe, Saint Joseph's UniversityMarilyn Lovett, Livingstone CollegeMarion Perlmutter, University of Michigan

By the end of this section, you will be able to:Describe problem solving strategiesDefine algorithm and heuristicExplain some common roadblocks to effective problem solving

A java code for computing modular exponents using the algorithm of repeated squares.