Courses tagged with "Nutrition" (219)
This course is divided into two sections, Part I and Part II. Part I, found here, provides an introduction to statistical theory. A brief review of probability will be given mainly as background material, however, it is assumed to be known. Topics include normal distribution, limit theorems, Bayesian concepts, and testing, among others.
Part II prepares students for the remainder of the econometrics sequence and and can be found by visiting 14.381 Fall 2006.
Geometry and Quantum Field Theory, designed for mathematicians, is a rigorous introduction to perturbative quantum field theory, using the language of functional integrals. It covers the basics of classical field theory, free quantum theories and Feynman diagrams. The goal is to discuss, using mathematical language, a number of basic notions and results of QFT that are necessary to understand talks and papers in QFT and String Theory.
This course teaches the art of guessing results and solving problems without doing a proof or an exact calculation. Techniques include extreme-cases reasoning, dimensional analysis, successive approximation, discretization, generalization, and pictorial analysis. Applications include mental calculation, solid geometry, musical intervals, logarithms, integration, infinite series, solitaire, and differential equations. (No epsilons or deltas are harmed by taking this course.) This course is offered during the Independent Activities Period (IAP), which is a special 4-week term at MIT that runs from the first week of January until the end of the month.
This course covers differential, integral and vector calculus for functions of more than one variable. These mathematical tools and methods are used extensively in the physical sciences, engineering, economics and computer graphics.
Course Formats
The materials have been organized to support independent study. The website includes all of the materials you will need to understand the concepts covered in this subject. The materials in this course include:
- Lecture Videos recorded on the MIT campus
- Recitation Videos with problem-solving tips
- Examples of solutions to sample problems
- Problem for you to solve, with solutions
- Exams with solutions
- Interactive Java Applets ("Mathlets") to reinforce key concepts
Content Development
Denis Auroux
Arthur Mattuck
Jeremy Orloff
John Lewis
This is an undergraduate course on differential calculus in one and several dimensions. It is intended as a one and a half term course in calculus for students who have studied calculus in high school. The format allows it to be entirely self contained, so that it is possible to follow it without any background in calculus.
This course covers matrix theory and linear algebra, emphasizing topics useful in other disciplines such as physics, economics and social sciences, natural sciences, and engineering. It parallels the combination of theory and applications in Professor Strang’s textbook Introduction to Linear Algebra.
Course Format
This course has been designed for independent study. It provides everything you will need to understand the concepts covered in the course. The materials include:
- A complete set of Lecture Videos by Professor Gilbert Strang.
- Summary Notes for all videos along with suggested readings in Prof. Strang's textbook Linear Algebra.
- Problem Solving Videos on every topic taught by an experienced MIT Recitation Instructor.
- Problem Sets to do on your own with Solutions to check your answers against when you're done.
- A selection of Java® Demonstrations to illustrate key concepts.
- A full set of Exams with Solutions, including review material to help you prepare.
Other Versions
Other OCW Versions
OCW has published multiple versions of this subject.
Related Content
This course continues the content covered in 18.100 Analysis I. Roughly half of the subject is devoted to the theory of the Lebesgue integral with applications to probability, and the other half to Fourier series and Fourier integrals.
This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. The subject coverage divides roughly into thirds:
- Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations.
- Discrete structures: graphs, state machines, modular arithmetic, counting.
- Discrete probability theory.
On completion of 6.042J, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.
Interactive site components can be found on the Unit pages in the left-hand navigational bar, starting with Unit 1: Proofs.
This graduate level course is more extensive and theoretical treatment of the material in Computability, and Complexity (6.045J / 18.400J). Topics include Automata and Language Theory, Computability Theory, and Complexity Theory.
Game Theory, also known as Multiperson Decision Theory, is the analysis of situations in which the payoff of a decision maker depends not only on his own actions but also on those of others. Game Theory has applications in several fields, such as economics, politics, law, biology, and computer science. In this course, I will introduce the basic tools of game theoretic analysis. In the process, I will outline some of the many applications of Game Theory, primarily in economics.
In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with non-bipartite matchings and cover many results extending the fundamental results of matchings, flows and matroids. The emphasis is on the derivation of purely combinatorial results, including min-max relations, and not so much on the corresponding algorithmic questions of how to find such objects. The intended audience consists of Ph.D. students interested in optimization, combinatorics, or combinatorial algorithms.
The main goal of this course is to study the generalization ability of a number of popular machine learning algorithms such as boosting, support vector machines and neural networks. Topics include Vapnik-Chervonenkis theory, concentration inequalities in product spaces, and other elements of empirical process theory.
The course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.
This course provides an elementary introduction to probability and statistics with applications. Topics include: basic combinatorics, random variables, probability distributions, Bayesian inference, hypothesis testing, confidence intervals, and linear regression.
The Spring 2014 version of this subject employed the residential MITx system, which enables on-campus subjects to provide MIT students with learning and assessment tools such as online problem sets, lecture videos, reading questions, pre-lecture questions, problem set assistance, tutorial videos, exam review content, and even online exams.
Trusted paper writing service WriteMyPaper.Today will write the papers of any difficulty.