Courses tagged with "Nutrition" (421)

6.336J is an introduction to computational techniques for the simulation of a large variety of engineering and physical systems. Applications are drawn from aerospace, mechanical, electrical, chemical and biological engineering, and materials science. Topics include: mathematical formulations; network problems; sparse direct and iterative matrix solution techniques; Newton methods for nonlinear problems; discretization methods for ordinary, time-periodic and partial differential equations, fast methods for partial differential and integral equations, techniques for dynamical system model reduction and approaches for molecular dynamics.

This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5211 (Introduction to Numerical Simulation).

The topics covered in this course include:

• Languages and compilers to exploit multithreaded parallelism
• Implicit parallel programming using functional languages and their extensions
• Higher-order functions, non-strictness, and polymorphism
• Explicit parallel programming and nondeterminism
• The lambda calculus and its variants
• Term rewriting and operational semantics
• Compiling multithreaded code for symmetric multiprocessors and clusters
• Static analysis and compiler optimizations

This course is worth 4 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 comprises of a seminar on planning and operation of modern electric power systems. Content varies with current interests of instructor and class; emphasis on engineering aspects, but economic issues may be examined too. Core topics include: overview of power system structure and operation; representation of components, including transmission lines, transformers, generating plants, loads; power flow analysis, dynamics and control of multimachine systems, steady-state and transient stability, system protection; economic dispatch; mobile and isolated power systems; computation and simulation.

In this introductory course, you'll learn and practice essential computer science concepts using the Java programming language. You'll learn about Object Oriented Programming, a technique that allows you to use code written by other programmers in your own programs. You'll put your new Java programming skills to the test by solving real-world problems faced by software engineers.

This subject describes and illustrates computational approaches to solving problems in systems biology. A series of case-studies will be explored that demonstrate how an effective match between the statement of a biological problem and the selection of an appropriate algorithm or computational technique can lead to fundamental advances. The subject will cover several discrete and numerical algorithms used in simulation, feature extraction, and optimization for molecular, network, and systems models in biology.

This course features a rigorous introduction to modern cryptography, with an emphasis on the fundamental cryptographic primitives of public-key encryption, digital signatures, pseudo-random number generation, and basic protocols and their computational complexity requirements.

This course is offered to graduates and focuses on understanding the fundamental principles of the "front-end" processes used in the fabrication of devices for silicon integrated circuits. This includes advanced physical models and practical aspects of major processes, such as oxidation, diffusion, ion implantation, and epitaxy. Other topics covered include: high performance MOS and bipolar devices including ultra-thin gate oxides, implant-damage enhanced diffusion, advanced metrology, and new materials such as Silicon Germanium (SiGe).

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.

This course provides an introduction to the theory and practice of quantum computation. Topics covered include: physics of information processing, quantum logic, quantum algorithms including Shor's factoring algorithm and Grover's search algorithm, quantum error correction, quantum communication, and cryptography.

This is a foundation subject in modern software development techniques for engineering and information technology. The design and development of component-based software (using C# and .NET) is covered; data structures and algorithms for modeling, analysis, and visualization; basic problem-solving techniques; web services; and the management and maintenance of software. Includes a treatment of topics such as sorting and searching algorithms; and numerical simulation techniques. Foundation for in-depth exploration of image processing, computational geometry, finite element methods, network methods and e-business applications. This course is a core requirement for the Information Technology M. Eng. program.

This class was also offered in Course 13 (Department of Ocean Engineering) as 13.470J. In 2005, ocean engineering subjects became part of Course 2 (Department of Mechanical Engineering), and the 13.470J designation was dropped in lieu of 2.159J.

This course introduces students to the fundamentals of nonlinear optimization theory and methods. Topics include unconstrained and constrained optimization, linear and quadratic programming, Lagrange and conic duality theory, interior-point algorithms and theory, Lagrangian relaxation, generalized programming, and semi-definite programming. Algorithmic methods used in the class include steepest descent, Newton's method, conditional gradient and subgradient optimization, interior-point methods and penalty and barrier methods.

The course serves as an introduction to the theory and practice behind many of today's communications systems. 6.450 forms the first of a two-course sequence on digital communication. The second class, 6.451 Principles of Digital Communication II, is offered in the spring.

Topics covered include: digital communications at the block diagram level, data compression, Lempel-Ziv algorithm, scalar and vector quantization, sampling and aliasing, the Nyquist criterion, PAM and QAM modulation, signal constellations, finite-energy waveform spaces, detection, and modeling and system design for wireless communication.

This course provides a phenomenological approach to superconductivity, with emphasis on superconducting electronics. Topics include: electrodynamics of superconductors, London's model, flux quantization, Josephson Junctions, superconducting quantum devices, equivalent circuits, high-speed superconducting electronics, and quantized circuits for quantum computing. The course also provides an overview of type II superconductors, critical magnetic fields, pinning, the critical state model, superconducting materials, and microscopic theory of superconductivity.

This is a laboratory experience course with a focus on photography, electronic imaging, and light measurement, much of it at short duration. In addition to teaching these techniques, the course provides students with experience working in a laboratory and teaches good work habits and techniques for approaching laboratory work. A major purpose of 6.163 is to provide students with many opportunities to sharpen their communication skills: oral, written, and visual.

In the first unit, we will learn the mechanics of editing and compiling a simple program written in C++.  We will begin with a discussion of the essential elements of C++ programming: variables, loops, expressions, functions, and string class.  Next, we will cover the basics of object-oriented programming: classes, inheritance, templates, exceptions, and file manipulation.  We will then review function and class templates and the classes that perform output and input of characters to/from files.  This course will also cover the topics of namespaces, exception handling, and preprocessor directives.  In the last part of the course, we will learn some slightly more sophisticated programming techniques that deal with data structures such as linked lists and binary trees. This course contains a number of sample programs and review exercises.  Through these exercises, students should better learn how to write functions, use the string class, and write elementary data structures such as linked lists and bina…

This research-oriented course will focus on algebraic and computational techniques for optimization problems involving polynomial equations and inequalities with particular emphasis on the connections with semidefinite optimization. The course will develop in a parallel fashion several algebraic and numerical approaches to polynomial systems, with a view towards methods that simultaneously incorporate both elements. We will study both the complex and real cases, developing techniques of general applicability, and stressing convexity-based ideas, complexity results, and efficient implementations. Although we will use examples from several engineering areas, particular emphasis will be given to those arising from systems and control applications.