Introduction to Convex Optimization

keywords:
Engineering
Mathematics
Systems Engineering
Electrical Engineering
Applied Mathematics
Systems Optimization

uk: Математика, природничі науки

description:
This course aims to give students the tools and training to recognize convex optimization problems that arise in scientific and engineering applications, presenting the basic theory, and concentrating on modeling aspects and results that are useful in applications. Topics include convex sets, convex functions, optimization problems, least-squares, linear and quadratic programs, semidefinite programming, optimality conditions, and duality theory. Applications to signal processing, control, machine learning, finance, digital and analog circuit design, computational geometry, statistics, and mechanical engineering are presented. Students complete hands-on exercises using high-level numerical software.

Acknowledgements
----------------

The course materials were developed jointly by [Prof. Stephen Boyd](http://www.stanford.edu/~boyd/) (Stanford), who was a visiting professor at MIT when this course was taught, and [Prof. Lieven Vanderberghe](http://www.ee.ucla.edu/~vandenbe/) (UCLA).

uk: вхід без авторизації


blkdiag.m

Massachusetts Institute of Technology

addressCountry: US

addressLocality: Cambridge

addressRegion: Massachusetts

type: Organization

Stephen Boyd

honorificPrefix: Prof.

type: Person

cs: Technické vědy

de: Ingenieurwissenschaften

fi: tekniikka

uk: Інженерія

en: Engineering Sciences

fr: Ingénierie

da: Ingeniørvidenskab

es: Ingeniería

nl: Engineering

de: Elektrotechnik und Informationstechnik

uk: Електротехніка та інформаційні технології

en: Electrical Engineering and Information Engineering

cs: Matematika

de: Mathematik

fi: matematiikka

uk: Математика

en: Mathematics

fr: Mathématiques

da: Matematik

es: Matemáticas

nl: Wiskunde

de: Mathematik, Naturwissenschaften

uk: Математика, природничі науки

en: Mathematics, Natural Sciences

description: This resource is a supporting file helpful for exams.

MIT OpenCourseWare

type: Service

type: WebContent

@language: en

cs: přihlášení není vyžadováno

de: keine Anmeldung erforderlich

uk: вхід без авторизації

en: no login required

nl: geen login vereist

cs: Cvičení

de: Übung

fi: Harjoitus

uk: Практика

en: Drill and Practice

fr: Apprentissage par Répétition

da: Øvelse

nl: Oefenen

es: Práctica


uk: Математика, природничі науки

description: This resource contains problem statements related to optimal generator dispatch and price decomposition.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains problem statements related to 2D filter design and gini coefficient of inequality.

uk: вхід без авторизації


keywords:
Engineering
Computer Science
Mathematics
Applied Mathematics
Computation
Theory of Computation

cs: Informatika

de: Informatik

fi: tietojenkäsittelytiede

uk: Комп'ютерні науки

en: Computer Science

fr: Informatique

da: Datalogi

es: Ciencias de la Computación

nl: Informatica

uk: Математика, природничі науки

description: This course provides a challenging introduction to some of the central ideas of theoretical computer science. It attempts to present a vision of "computer science beyond computers": that is, CS as a set of mathematical tools for understanding complex systems such as universes and minds. Beginning in antiquity—with Euclid's algorithm and other ancient examples of computational thinking—the course will progress rapidly through propositional logic, Turing machines and computability, finite automata, Gödel's theorems, efficient algorithms and reducibility, NP-completeness, the P versus NP problem, decision trees and other concrete computational models, the power of randomness, cryptography and one-way functions, computational theories of learning, interactive proofs, and quantum computing and the physical limits of computation. Class participation is essential, as the class will include discussion and debate about the implications of many of these ideas.

uk: вхід без авторизації

name: Great Ideas in Theoretical Computer Science

cs: Kurz

de: Kurs

fi: Kurssi

uk: Курс

en: Course

fr: Cours

da: Kursus

nl: Cursus

es: Curso


Practical Programming in C

keywords:
Engineering
Computer Science
Software Design and Engineering
Programming Languages

uk: Комп'ютерні науки

description: This course provides a thorough introduction to the C programming language, the workhorse of the UNIX operating system and lingua franca of embedded processors and micro-controllers. The first two weeks will cover basic syntax and grammar, and expose students to practical programming techniques. The remaining lectures will focus on more advanced concepts, such as dynamic memory allocation, concurrency and synchronization, UNIX signals and process control, library development and usage. Daily programming assignments and weekly laboratory exercises are required. Knowledge of C is highly marketable for summer internships, UROPs, and full-time positions in software and embedded systems development.

uk: вхід без авторизації


uk: Комп'ютерні науки

description:
Ever hang your head in shame after your Python program wasn't as fast as your friend's C program? Ever wish you could use objects without having to use Java? Join us for this fun introduction to C and C++! We will take you through a tour that will start with writing simple C programs, go deep into the caves of C memory manipulation, resurface with an introduction to using C++ classes, dive deeper into advanced C++ class use and the C++ Standard Template Libraries. We'll wrap up by teaching you some tricks of the trade that you may need for tech interviews.

We see this as a "C/C++ empowerment" course: we want you to come away understanding

1.  why you would want to use C over another language (control over memory, probably for performance reasons),
2.  why you would want to use C++ rather than C (objects), and
3.  how to be useful in C and C++.

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.

uk: вхід без авторизації

name: Introduction to C Memory Management and C++ Object-Oriented Programming


uk: Комп'ютерні науки

description: This course will serve as a two-week aggressively gentle introduction to programming for those students who lack background in the field. Specifically targeted at students with little or no programming experience, the course seeks to reach students who intend to take [6.001](/courses/6-001-structure-and-interpretation-of-computer-programs-spring-2005) and feel they would struggle because they lack the necessary background. The main focus of the subject will be acquiring programming experience: instruction in programming fundamentals coupled with lots of practice problems. Lots of programming required, but lots of support provided.

uk: вхід без авторизації

name: Building Programming Experience: A Lead-In to 6.001


quiz.tex

uk: Комп'ютерні науки

uk: вхід без авторизації


quiz.pdf

uk: Комп'ютерні науки

description:
This file includes problems for the following topics:
Box and pointer, insert, and iteration and recursion.

uk: вхід без авторизації


quizanssheet.pdf

uk: Комп'ютерні науки

description: This file includes answersheet to be used for quiz 1.

uk: вхід без авторизації


quizanssheet.tex

uk: Комп'ютерні науки

uk: вхід без авторизації


quizpractice.txt

uk: Комп'ютерні науки

description:
This file includes practice problems for the following topics:
Evaluation, recursive procedures, and box and pointer.

uk: вхід без авторизації


quizpracticeans.txt

uk: Комп'ютерні науки

description: This file contains answers to the problems in the practice quiz.

uk: вхід без авторизації


quizpracticeanswers.txt

uk: Комп'ютерні науки

uk: вхід без авторизації


quizsolns.txt

uk: Комп'ютерні науки

description: This file includes the answers for quiz 1.

uk: вхід без авторизації


keywords:
Engineering
Electrical Engineering

description:
This course introduces students to both passive and active electronic components (op-amps, 555 timers, TTL digital circuits). Basic analog and digital circuits and theory of operation are covered. The labs allow the students to master the use of electronic instruments and construct and/or solder several circuits. The labs also reinforce the concepts discussed in class with a hands-on approach and allow the students to gain significant experience with electrical instruments such as function generators, digital multimeters, oscilloscopes, logic analyzers and power supplies. In the last lab, the students build an electronic circuit that they can keep. The course is geared to freshmen and others who want an introduction to electronics circuits.

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.

uk: вхід без авторизації

name: Hands-On Introduction to Electrical Engineering Lab Skills


Bioinformatics and Proteomics

keywords:
Engineering
Science
Computer Science
Biological Engineering
Biology
Data Mining
Computational Biology
Proteomics

de: Biotechnologie

uk: Біотехнологія

en: Biotechnology

uk: Комп'ютерні науки

de: Biologie

uk: Біологія

en: Biology

uk: Математика, природничі науки

description: This interdisciplinary course provides a hands-on approach to students in the topics of bioinformatics and proteomics. Lectures and labs cover sequence analysis, microarray expression analysis, Bayesian methods, control theory, scale-free networks, and biotechnology applications. Designed for those with a computational and/or engineering background, it will include current real-world examples, actual implementations, and engineering design issues. Where applicable, engineering issues from signal processing, network theory, machine learning, robotics and other domains will be expounded upon.

uk: вхід без авторизації


Introduction to Programming in Java

uk: Комп'ютерні науки

description:
This course is an introduction to software engineering, using the Java™ programming language. It covers concepts useful to 6.005. Students will learn the fundamentals of Java. The focus is on developing high quality, working software that solves real problems.

The course is designed for students with some programming experience, but if you have none and are motivated you will do fine. Students who have taken 6.005 should not take this course. Each class is composed of one hour of lecture and one hour of assisted lab work.

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.

uk: вхід без авторизації


Java Preparation for 6.170

uk: Комп'ютерні науки

description: This course focuses on introducing the language, libraries, tools and concepts of Javaᵀᴹ. The course is specifically targeted at students who intend to take [6.170](/courses/6-170-laboratory-in-software-engineering-fall-2005) in the following term and feel they would struggle because they lack the necessary background. Topics include: Object-oriented programming, primitives, arrays, objects, inheritance, interfaces, polymorphism, hashing, data structures, collections, nested classes, floating point precision, defensive programming, and depth-first search algorithm.

uk: вхід без авторизації


Algorithms for Computational Biology

keywords:
Engineering
Computer Science
Biological Engineering
Algorithms and Data Structures
Computational Biology

uk: Біотехнологія

uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This course is offered to undergraduates and addresses several algorithmic challenges in computational biology. The principles of algorithmic design for biological datasets are studied and existing algorithms analyzed for application to real datasets. Topics covered include: biological sequence analysis, gene identification, regulatory motif discovery, genome assembly, genome duplication and rearrangements, evolutionary theory, clustering algorithms, and scale-free networks.

uk: вхід без авторизації


Introduction to C++

uk: Комп'ютерні науки

description:
This is a fast-paced introductory course to the C++ programming language. It is intended for those with little programming background, though prior programming experience will make it easier, and those with previous experience will still learn C++-specific constructs and concepts.

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.

uk: вхід без авторизації


Ana Bell

honorificPrefix: Dr.

keywords:
Engineering
Computer Science
Programming Languages

name: Lecture 1: Introduction to CS and Programming Using Python

name: Lecture 12: List Comprehension, Functions as Objects, Testing, and Debugging

name: Lecture 26: List Access, Hashing, Simulations, and Wrap-Up

name: Lecture 2: Strings, Input/Output, and Branching

name: Lecture 20: Fitness Tracker Object-Oriented Programming Example

name: Lecture 21: Timing Programs and Counting Operations

name: Lecture 4: Loops over Strings, Guess-and-Check, and Binary

name: Lecture 5: Floats and Approximation Methods

name: Lecture 7: Decomposition, Abstraction, and Functions

name: Lecture 9: Lambda Functions, Tuples, and Lists

uk: Комп'ютерні науки

description: This subject is aimed at students with little to no programming experience. It aims to provide students with an understanding of the role computation can play in solving problems. It also aims to help students, regardless of their major, feel justifiably confident in their ability to write simple programs that allow them to accomplish useful goals. The class will use the Python 3 programming language.

uk: вхід без авторизації

name: Introduction to CS and Programming using Python


uk: Комп'ютерні науки

uk: вхід без авторизації

cs: Video

de: Video

fi: Video

uk: Відео

en: Video

fr: Vidéo

da: Video

nl: Video

es: Video


Lecture 10: Lists and Mutability

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 11: Aliasing and Cloning

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 13: Exceptions and Assertions

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 14: Dictionaries

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 15: Recursion

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 16: Recursion on Non-numerics

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 17: Python Classes

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 18: More Python Class Methods

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 19: Inheritance

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 22: Big Oh and Theta

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 23: Complexity Classes Examples

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 24: Sorting Algorithms

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 25: Plotting

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 3: Iteration

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 6: Bisection Search

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 8: Functions as Objects

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


keywords:
Engineering
Electronics
Electrical Engineering

description: 6.101 is an introductory experimental laboratory that explores the design, construction, and debugging of analog electronic circuits. Lectures and six laboratory projects investigate the performance characteristics of diodes, transistors, JFETs, and op-amps, including the construction of a small audio amplifier and preamplifier. Seven weeks are devoted to the design and implementation, and written and oral presentation of a project in an environment similar to that of engineering design teams in industry. The course provides opportunity to simulate real-world problems and solutions that involve trade offs and the use of engineering judgment. Engineers from local analog engineering companies come to campus to help students with their design projects.

uk: вхід без авторизації

name: Introductory Analog Electronics Laboratory


description: The first of two quizzes for the course.

uk: вхід без авторизації


description: The second of two quizzes for the course.

uk: вхід без авторизації


description: Review material for the second quiz on on opamp operation, general relations, opamp configurations, benefits of feedback, and DB.

uk: вхід без авторизації


Introductory Digital Systems Laboratory

keywords:
Engineering
Computer Science
Electronics
Electrical Engineering
Computer Design and Engineering
Digital Systems

uk: Комп'ютерні науки

description: 6.111 consists of lectures and labs on digital logic, flipflops, PALs, counters, timing, synchronization, finite-state machines, and microprogrammed systems. Students are expected to design and implement a final project of their choice: games, music, digital filters, graphics, etc. The course requires extensive use of VHDL for describing and implementing digital logic designs. 6.111 is worth 12 Engineering Design Points.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Assignments: Quiz 1

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Assignments: Quiz 1 Solution

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Assignments: Quiz 2

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Assignments: Quiz 2 Solution

uk: вхід без авторизації


uk: Комп'ютерні науки

description: 6.111 is reputed to be one of the most demanding classes at MIT, exhausting many students' time and creativity. The course covers digital design topics such as digital logic, sequential building blocks, finite-state machines, FPGAs, timing and synchronization. The semester begins with lectures and problem sets, to introduce fundamental topics before students embark on lab assignments and ultimately, a digital design project. The students design and implement a final digital project of their choice, in areas such as games, music, digital filters, wireless communications, video, and graphics. The course relies on extensive use of Verilog® for describing and implementing digital logic designs on state-of-the-art FPGA.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Quiz on counters, VHDL of sequential circuits, and timing and memory.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Quiz on FPGA, Finite State Machine design for a successive approximation ADC, FSM/VHDL and arithmetic structures, and transformations.

uk: вхід без авторизації


quiz.pdf

uk: Комп'ютерні науки

description: Quiz on sequential building block characterization, clock gating circuit,  arithmetic, FPGA, and Verilog.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: Quiz on sequential building blocks and counters, carry skip adder, glitches in digital design, memory, and Verilog.

uk: вхід без авторизації


Micro/Nano Processing Technology

keywords:
Engineering
Mechanical Engineering
Electrical Engineering
Nanotechnology
Microtechnology

de: Maschinenbau/Verfahrenstechnik

uk: Машинобудування/Технологія

en: Mechanical Engineering / Process Engineering

description: This course introduces the theory and technology of micro/nano fabrication. Lectures and laboratory sessions focus on basic processing techniques such as diffusion, oxidation, photolithography, chemical vapor deposition, and more. Through team lab assignments, students are expected to gain an understanding of these processing techniques, and how they are applied in concert to device fabrication. Students enrolled in this course have a unique opportunity to fashion and test micro/nano-devices, using modern techniques and technology.

uk: вхід без авторизації


uk: Машинобудування/Технологія

description: Problems on sputtering and evaporation.

uk: вхід без авторизації


uk: Машинобудування/Технологія

description: Problems on oxidation, diffusion, ion implantation and chemical vapor deposition.

uk: вхід без авторизації


uk: Машинобудування/Технологія

description: Problems on ion implantation, chemical vapor deposition, oxidation, ion implantation, diffusion, sputter deposition, lithography and etching.

uk: вхід без авторизації


uk: Машинобудування/Технологія

description: Problems on equi-atomic SiGe film, thermal evaporation.

uk: вхід без авторизації


uk: Машинобудування/Технологія

description: It cover information on Constants, Ideal gas, Gas kinetics, Oxidation, CVD, Diffusion, Ion implantation and electricity.

uk: вхід без авторизації


takehome.pdf

uk: Машинобудування/Технологія

description: This is an open book, take-home quiz.

uk: вхід без авторизації


Modern Optics Project Laboratory

keywords:
Engineering
Science
Physics
Electrical Engineering
Atomic, Molecular, Optical Physics

de: Physik

uk: Фізика

en: Physics

uk: Математика, природничі науки

de: Physik, Astronomie

fi: fysiikka, tähtitiede

uk: Фізика, Астрономія

en: Physics, Astronomy

fr: Physique, Astronomie

da: Fysik, Astronomi

es: Física, Astronomía

nl: Natuurkunde, Astronomie

description: 6.161 offers an introduction to laboratory optics, optical principles, and optical devices and systems. This course covers a wide range of topics, including: polarization properties of light, reflection and refraction, coherence and interference, Fraunhofer and Fresnel diffraction, holography, imaging and transforming properties of lenses, spatial filtering, two-lens coherent optical processor, optical properties of materials, lasers, electro-optic, acousto-optic and liquid-crystal light modulators, optical detectors, optical waveguides and fiber-optic communication systems. Students engage in extensive oral and written communication exercises. There are 12 engineering design points associated with this subject.

uk: вхід без авторизації


Strobe Project Laboratory

keywords:
Engineering
Science
Physics
Electrical Engineering
Visual Arts
Fine Arts
Atomic, Molecular, Optical Physics
Photography

de: Bildende Kunst

uk: Образотворче мистецтво

en: Fine Arts

uk: Математика, природничі науки

uk: Фізика, Астрономія

de: Kunst, Kunstwissenschaft

uk: Мистецтво, мистецтвознавство

en: Art, Art Theory

description: 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.

uk: вхід без авторизації


uk: Образотворче мистецтво

uk: Математика, природничі науки

uk: Фізика, Астрономія

uk: Мистецтво, мистецтвознавство

description: Video of a pencil shot into a board.

uk: вхід без авторизації


uk: Образотворче мистецтво

uk: Математика, природничі науки

uk: Фізика, Астрономія

uk: Мистецтво, мистецтвознавство

description: Video of a bullet passing through a banana.

uk: вхід без авторизації


uk: Образотворче мистецтво

uk: Математика, природничі науки

uk: Фізика, Астрономія

uk: Мистецтво, мистецтвознавство

description: Video of a bullet passing through a cucumber.

uk: вхід без авторизації


uk: Образотворче мистецтво

uk: Математика, природничі науки

uk: Фізика, Астрономія

uk: Мистецтво, мистецтвознавство

description: This reosource contains problems on shutter speed set on camera, maximum permissible flash duration and the right focal length lens.

uk: вхід без авторизації


uk: Образотворче мистецтво

uk: Математика, природничі науки

uk: Фізика, Астрономія

uk: Мистецтво, мистецтвознавство

description: This resource contains solution on shutter speed set on camera, maximum permissible flash duration and the right focal length lens.

uk: вхід без авторизації


uk: Образотворче мистецтво

uk: Математика, природничі науки

uk: Фізика, Астрономія

uk: Мистецтво, мистецтвознавство

description: This resource contains problems on what BCPS flash is required and focal length optical system.

uk: вхід без авторизації


uk: Образотворче мистецтво

uk: Математика, природничі науки

uk: Фізика, Астрономія

uk: Мистецтво, мистецтвознавство

description: This resource contains solution on what BCPS flash is required and focal length optical system.

uk: вхід без авторизації


Laboratory in Software Engineering

keywords:
Engineering
Computer Science
Software Design and Engineering

uk: Комп'ютерні науки

description:
This course introduces concepts and techniques relevant to the production of large software systems. Students are taught a programming method based on the recognition and description of useful abstractions. Topics include modularity, specification, data abstraction, object modeling, design patterns, and testing. Students complete several programming projects of varying size, working individually and in groups.

Students are now introduced to software engineering in _6.005 Elements of Software Construction_, which is available on OCW in two versions, as taught in [Fall 2008](/courses/6-005-elements-of-software-construction-fall-2008/) and Fall 2011.

uk: вхід без авторизації


Software Studio

keywords:
Engineering
Computer Science
Software Design and Engineering
Programming Languages
Algorithms and Data Structures

uk: Комп'ютерні науки

description: This course on software engineering covers design and implementation of medium-scale software systems, using web applications as a platform. In the course, students learn the fundamentals of structuring a web application and writing modular code, with an emphasis on conceptual design to achieve clarity, simplicity, and modularity. Topics also include functional programming, relational databases, and security.

uk: вхід без авторизації


keywords:
Engineering
Computer Science
Electrical Engineering
Media Studies
Fine Arts
Software Design and Engineering
Digital Media
Telecommunications

uk: Комп'ютерні науки

uk: Образотворче мистецтво

de: Medienwissenschaft

uk: Медіазнавство

en: Media Science

uk: Медіазнавство

de: Geisteswissenschaften

uk: Гуманітарні науки

en: Humanities

uk: Мистецтво, мистецтвознавство

description:
6.171 is a course for students who already have some programming and software engineering experience. The goal is to give students some experience in dealing with those challenges that are unique to Internet applications, such as:

*   concurrency;
*   unpredictable load;
*   security risks;
*   opportunity for wide-area distributed computing;
*   creating a reliable and stateful user experience on top of unreliable connections and stateless protocols;
*   extreme requirements and absurd development schedules;
*   requirements that change mid-way through a project, sometimes because of experience gained from testing with users;
*   user demands for a multi-modal interface.

uk: вхід без авторизації

name: Software Engineering for Web Applications


keywords:
Engineering
Computer Science
Systems Engineering
Software Design and Engineering
Algorithms and Data Structures
Systems Optimization

name: Lecture 4: Assembly Language & Computer Architecture

name: Lecture 8: Analysis of Multithreaded Algorithms

name: Lecture 9: What Compilers Can and Cannot Do

name: Lecture 1: Introduction and Matrix Multiplication

name: Lecture 14: Caching and Cache-Efficient Algorithms

name: Lecture 16: Nondeterministic Parallel Programming

name: Lecture 17: Synchronization Without Locks

name: Lecture 18: Domain Specific Languages and Autotuning

name: Lecture 2: Bentley Rules for Optimizing Work

name: Lecture 20: Speculative Parallelism & Leiserchess

name: Lecture 23: High Performance in Dynamic Languages

name: 6.172 Performance Engineering of Software Systems, Practice Quiz 1 Solutions

name: 6.172 Performance Engineering of Software Systems, Practice Quiz 2 Solutions

name: 6.172 Performance Engineering of Software Systems, Practice Quiz 3

name: 6.172 Performance Engineering of Software Systems, Practice Quiz 4 Solutions

de: Ingenieurwissenschaften

en: Engineering Sciences

uk: Комп'ютерні науки

description: 6.172 is an 18-unit class that provides a hands-on, project-based introduction to building scalable and high-performance software systems. Topics include performance analysis, algorithmic techniques for high performance, instruction-level optimizations, caching optimizations, parallel programming, and building scalable systems. The course programming language is C.

uk: вхід без авторизації


uk: Комп'ютерні науки

name: Performance Engineering of Software Systems

uk: вхід без авторизації


Lecture 10: Measurement and Timing

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 11: Storage Allocation

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 12: Parallel Storage Allocation

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 13: The Cilk Runtime System

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 15: Cache-Oblivious Algorithms

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 19: Leiserchess Codewalk

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 21: Tuning a TSP Algorithm

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 22: Graph Optimization

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 3: Bit Hacks

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 5: C to Assembly

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 6: Multicore Programming

uk: Комп'ютерні науки

uk: вхід без авторизації


Lecture 7: Races and Parallelism

uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: 6.172 Performance Engineering of Software Systems, Practice Quiz 1


uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: 6.172 Performance Engineering of Software Systems, Practice Quiz 2


uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації

name: 6.172 Performance Engineering of Software Systems, Practice Quiz 4


uk: Комп'ютерні науки

uk: вхід без авторизації


Operating System Engineering

keywords:
Engineering
Computer Science
Operating Systems

uk: Комп'ютерні науки

description: This is a course on the design and implementation of operating systems and their use as a foundation for systems programming. Topics covered include virtual memory; file systems; threads; context switches; kernels; interrupts; system calls; and interprocess communication, coordination, and interaction between software and hardware. A multi-processor operating system for RISC-V, xv6, is used to illustrate these topics. Individual laboratory assignments involve extending the xv6 operating system, for example to support sophisticated virtual memory features and networking.

uk: вхід без авторизації


Mobile Autonomous Systems Laboratory

keywords:
Engineering
Computer Science
Artificial Intelligence
Mechanical Engineering
Electrical Engineering
Robotics and Control Systems

uk: Машинобудування/Технологія

uk: Комп'ютерні науки

de: Elektrotechnik und Informationstechnik

en: Electrical Engineering and Information Engineering

description:
MASLab (Mobile Autonomous System Laboratory), also known as 6.186, is a robotics contest. The contest takes place during MIT's Independent Activities Period and participants earn 6 units of P/F credit and 6 Engineering Design Points. Teams of three to four students have less than a month to build and program sophisticated robots which must explore an unknown playing field and perform a series of tasks.

MASLab provides a significantly more difficult robotics problem than many other university-level robotics contests. Although students know the general size, shape, and color of the floors and walls, the students do not know the exact layout of the playing field. In addition, MASLab robots are completely autonomous, or in other words, the robots operate, calculate, and plan without human intervention. Finally, MASLab is one of the few robotics contests in the country to use a vision based robotics problem.

uk: вхід без авторизації


uk: Комп'ютерні науки

description:
This course will provide a gentle introduction to programming using Python™ for highly motivated students with little or no prior experience in programming computers. The course will focus on planning and organizing programs, as well as the grammar of the Python programming language. Lectures will be interactive featuring in-class exercises with lots of support from the course staff.

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.

uk: вхід без авторизації

name: A Gentle Introduction to Programming Using Python


uk: Комп'ютерні науки

description:
This course will provide a gentle, yet intense, introduction to programming using Python for highly motivated students with little or no prior experience in programming. The course will focus on planning and organizing programs, as well as the grammar of the Python programming language.

The course is designed to help prepare students for [_6.01 Introduction to EECS I_](/courses/6-01sc-introduction-to-electrical-engineering-and-computer-science-i-spring-2011/). 6.01 assumes some knowledge of Python upon entering; the course material for 6.189 has been specially designed to make sure that concepts important to 6.01 are covered.

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.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: This resource is a supporting file for exam.

uk: вхід без авторизації


uk: Комп'ютерні науки

description: This resource contains information related to programming problems.

uk: вхід без авторизації


Multicore Programming Primer

keywords:
Engineering
Computer Science
Software Design and Engineering
Programming Languages
Theory of Computation

uk: Комп'ютерні науки

description:
The course serves as an introductory course in parallel programming. It offers a series of lectures on parallel programming concepts as well as a group project providing hands-on experience with parallel programming. The students will have the unique opportunity to use the cutting-edge PLAYSTATION 3 development platform as they learn how to design and implement exciting applications for multicore architectures. At the end of the course, students will have an understanding of:

- Fundamental design philosophies that multicore architectures address.
- Parallel programming philosophies and emerging best practices.

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. The course can be tailored to a normal semester time line.

Acknowledgements

The course instructors are extremely grateful to [Sony](https://www.sony.com/en/), [IBM](http://www.ibm.com/us/), and [Toshiba](http://www.toshiba.com/tai/) for their support.

uk: вхід без авторизації


Mini-Quiz #1

uk: Комп'ютерні науки

description: Quiz on multicore programming.

uk: вхід без авторизації


Mini-Quiz #1 Solutions

uk: Комп'ютерні науки

description: Solutions to a quiz on multicore programming.

uk: вхід без авторизації


Mini-Quiz #2

uk: Комп'ютерні науки

description: Quiz on multicore programming.

uk: вхід без авторизації


Mini-Quiz #2 Solutions

uk: Комп'ютерні науки

uk: вхід без авторизації


Mini-Quiz #3

uk: Комп'ютерні науки

description: Quiz on multicore programming.

uk: вхід без авторизації


Mini-Quiz #3 Solutions

uk: Комп'ютерні науки

uk: вхід без авторизації


Mini-Quiz #4

uk: Комп'ютерні науки

description: Quiz on multicore programming.

uk: вхід без авторизації


Mini-Quiz #4 Solutions

uk: Комп'ютерні науки

uk: вхід без авторизації


Mini-Quiz #5

uk: Комп'ютерні науки

description: Quiz on multicore programming.

uk: вхід без авторизації


Mini-Quiz #5 Solutions

uk: Комп'ютерні науки

uk: вхід без авторизації


Mini-Quiz #6

uk: Комп'ютерні науки

description: Quiz on multicore programming.

uk: вхід без авторизації


Mini-Quiz #6 Solutions

uk: Комп'ютерні науки

uk: вхід без авторизації


keywords:
Engineering
Computer Science
Mathematics
Systems Engineering
Probability and Statistics
Electrical Engineering
Theory of Computation
Robotics and Control Systems
Systems Optimization
Discrete Mathematics

name: 6.231 Dynamic Programming and Stochastic Control, Complete Supplemental Notes

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 4

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 5

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 6

name: Approximate Dynamic Programming, Lecture 3

name: Approximate Dynamic Programming, Lecture 1

name: Approximate Dynamic Programming, Lecture 2

name: Monte Carlo Linear Algebra:  A Review and Recent Results

name: Approximate Dynamic Programming, Lecture 4

name: Approximate Dynamic Programming, Lecture 5

name: Approximate Dynamic Programming, Lecture 6

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 1

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 2

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 3

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2008 Midterm and Solutions

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2009 Midterm

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2009 Solutions

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2011 Midterm and Solutions

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2015 Midterm

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2015 Solutions

name: Approximate Dynamic Programming, Lecture Notes

uk: Комп'ютерні науки

de: Mathematik

en: Mathematics

de: Mathematik, Naturwissenschaften

uk: Математика, природничі науки

en: Mathematics, Natural Sciences

description: The course covers the basic models and solution techniques for problems of sequential decision making under uncertainty (stochastic control). We will consider optimal control of a dynamical system over both a finite and an infinite number of stages. This includes systems with finite or infinite state spaces, as well as perfectly or imperfectly observed systems. We will also discuss approximation methods for problems involving large state spaces. Applications of dynamic programming in a variety of fields will be covered in recitations.

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: Математика, природничі науки

de: keine Anmeldung erforderlich

uk: вхід без авторизації

en: no login required

name: 6.231 Dynamic Programming and Stochastic Control, Complete Supplemental Notes


de: Informatik

uk: Комп'ютерні науки

en: Computer Science

uk: Математика, природничі науки

name: Dynamic Programming and Stochastic Control

uk: вхід без авторизації

name: Approximate Dynamic Programming, Lecture 1


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: Approximate Dynamic Programming, Lecture 2


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: Approximate Dynamic Programming, Lecture 3


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: Approximate Dynamic Programming, Lecture 4


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: Approximate Dynamic Programming, Lecture 5


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: Approximate Dynamic Programming, Lecture 6


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: Monte Carlo Linear Algebra:  A Review and Recent Results


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 1


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 2


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 3


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 4


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 5


uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Supplemental Lecture 6


uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains information regarding dynamic programming and stochastic control midterm 2008 solution.

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2008 Midterm and Solutions

de: Übung

en: Drill and Practice


uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains information regarding dynamic programming and stochastic control midterm 2009.

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2009 Midterm


uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains information regarding dynamic programming and stochastic control midterm 2009 solution.

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2009 Solutions


uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains information regarding dynamic programming and stochastic control midterm 2011 solution.

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2011 Midterm and Solutions


uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains information regarding dynamic programming and stochastic control midterm 2015.

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2015 Midterm


uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains information regarding dynamic programming and stochastic control midterm 2015 solution.

uk: вхід без авторизації

name: 6.231 Dynamic Programming and Stochastic Control, Fall 2015 Solutions


uk: Комп'ютерні науки

uk: Математика, природничі науки

name: Dynamic Programming and Stochastic Control

uk: вхід без авторизації

name: Approximate Dynamic Programming, Lecture Notes


Dynamic Systems and Control

uk: Комп'ютерні науки

uk: Математика, природничі науки

description:
The course addresses dynamic systems, i.e., systems that evolve with time. Typically these systems have inputs and outputs; it is of interest to understand how the input affects the output (or, vice-versa, what inputs should be given to generate a desired output). In particular, we will concentrate on systems that can be modeled by Ordinary Differential Equations (ODEs), and that satisfy certain linearity and time-invariance conditions.

We will analyze the response of these systems to inputs and initial conditions. It is of particular interest to analyze systems obtained as interconnections (e.g., feedback) of two or more other systems. We will learn how to design (control) systems that ensure desirable properties (e.g., stability, performance) of the interconnection with a given dynamic system.

uk: вхід без авторизації

de: Kurs

en: Course


uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains final exam.

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains midterm exam.

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains solutions to midterm exam.

uk: вхід без авторизації


Dynamics of Nonlinear Systems

keywords:
Engineering
Computer Science
Systems Engineering
Electrical Engineering
Theory of Computation
Robotics and Control Systems

uk: Комп'ютерні науки

description: This course provides an introduction to nonlinear deterministic dynamical systems. Topics covered include: nonlinear ordinary differential equations; planar autonomous systems; fundamental theory: Picard iteration, contraction mapping theorem, and Bellman-Gronwall lemma; stability of equilibria by Lyapunov's first and second methods; feedback linearization; and application to nonlinear circuits and control systems.

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: вхід без авторизації


Multivariable Control Systems

uk: Комп'ютерні науки

description: This course uses computer-aided design methodologies for synthesis of multivariable feedback control systems. Topics covered include: performance and robustness trade-offs; model-based compensators; Q-parameterization; ill-posed optimization problems; dynamic augmentation; linear-quadratic optimization of controllers; H-infinity controller design; Mu-synthesis; model and compensator simplification; and nonlinear effects. The assignments for the course comprise of computer-aided (MATLAB®) design problems.

uk: вхід без авторизації


keywords:
Engineering
Computer Science
Mathematics
Systems Engineering
Applied Mathematics
Software Design and Engineering
Algorithms and Data Structures
Discrete Mathematics

uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This course is an introduction to linear optimization and its extensions emphasizing the underlying mathematical structures, geometrical ideas, algorithms and solutions of practical problems. The topics covered include: formulations, the geometry of linear optimization, duality theory, the simplex method, sensitivity analysis, robust optimization, large scale optimization network flows, solving problems with an exponential number of constraints and the ellipsoid method, interior point methods, semidefinite optimization, solving real world problems problems with computer software, discrete optimization formulations and algorithms.

uk: вхід без авторизації

name: Introduction to Mathematical Programming


Nonlinear Programming

keywords:
Engineering
Computer Science
Systems Engineering
Theory of Computation
Systems Optimization

uk: Комп'ютерні науки

description: 6.252J is a course in the department's "Communication, Control, and Signal Processing" concentration. This course provides a unified analytical and computational approach to nonlinear optimization problems. The topics covered in this course include: unconstrained optimization methods, constrained optimization methods, convex analysis, Lagrangian relaxation, nondifferentiable optimization, and applications in integer programming. There is also a comprehensive treatment of optimality conditions, Lagrange multiplier theory, and duality theory. Throughout the course, applications are drawn from control, communications, power systems, and resource allocation problems.

uk: вхід без авторизації


Convex Analysis and Optimization

keywords:
Engineering
Computer Science
Mathematics
Algorithms and Data Structures
Mathematical Analysis

name: 6.253 Convex Analysis and Optimization, Spring 2010 Midterm Solutions

name: 6.253 Convex Analysis and Optimization, Spring 2012 Midterm Solutions

uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This course will focus on fundamental subjects in convexity, duality, and convex optimization algorithms. The aim is to develop the core analytical and algorithmic issues of continuous optimization, duality, and saddle point theory using a handful of unifying principles that can be easily visualized and readily understood.

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains information regarding 2010 midterm with solutions.

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains information regarding 2012 midterm with solutions.

uk: вхід без авторизації


keywords:
Engineering
Mechanical Engineering
Social Science
Game Theory

uk: Машинобудування/Технологія

de: Sozialwissenschaften/Soziologie

uk: Суспільні науки та соціологія

en: Social Sciences/Sociology

de: Rechts-, Wirtschafts- und Sozialwissenschaften

uk: Право, економіка та суспільні науки

en: Law, Economics and Social Sciences

description: This course is an introduction to the fundamentals of game theory and mechanism design. Motivations are drawn from engineered/networked systems (including distributed control of wireline and wireless communication networks, incentive-compatible/dynamic resource allocation, multi-agent systems, pricing and investment decisions in the Internet), and social models (including social and economic networks). The course emphasizes theoretical foundations, mathematical tools, modeling, and equilibrium notions in different environments.

uk: вхід без авторизації

name: Game Theory with Engineering Applications


de: Maschinenbau/Verfahrenstechnik

uk: Машинобудування/Технологія

en: Mechanical Engineering / Process Engineering

uk: Суспільні науки та соціологія

uk: Право, економіка та суспільні науки

description: This resource contains 3 problem about one symmetric Nash equilibrium, strategic form game and war of attrition.

uk: вхід без авторизації


uk: Машинобудування/Технологія

uk: Суспільні науки та соціологія

uk: Право, економіка та суспільні науки

description: This resource contains 3 problem about pure strategy Nash equilibria, the payoff function for firm i and Consider a two-player game with payoff structure.

uk: вхід без авторизації


uk: Машинобудування/Технологія

uk: Суспільні науки та соціологія

uk: Право, економіка та суспільні науки

description: This resource contains 3 problem about consider a game with two players, Consider the oligopoly competition model and consider a two-player game with payoff structure.

uk: вхід без авторизації


uk: Машинобудування/Технологія

uk: Суспільні науки та соціологія

uk: Право, економіка та суспільні науки

description: This resource contains 3 problem about the set of correlated equilibria is the same as the set of Nash equilibria, Patent Race for a New Market and parameterized prisoner’s dilemma.

uk: вхід без авторизації


Discrete Stochastic Processes

keywords:
Mathematics
Probability and Statistics
Discrete Mathematics

name: Lecture 4: Poisson (The Perfect Arrival Process)

name: Lecture 5: Poisson Combining and Splitting

name: Lecture 7: Finite-state Markov Chains; The Matrix Approach

name: Lecture 8: Markov Eigenvalues and Eigenvectors

name: Lecture 9: Markov Rewards and Dynamic Programming

name: Lecture 1: Introduction and Probability Review

name: Lecture 10: Renewals and the Strong Law of Large Numbers

name: Lecture 11: Renewals: Strong Law and Rewards

name: Lecture 12: Renewal Rewards, Stopping Trials, and Wald's Inequality

name: Lecture 13: Little, M/G/1, Ensemble Averages

name: Lecture 16: Renewals and Countable-state Markov

name: Lecture 17: Countable-state Markov Chains

name: Lecture 18: Countable-state Markov Chains and Processes

name: Lecture 19: Countable-state Markov Processes

name: Lecture 2: More Review; The Bernoulli Process

name: Lecture 20: Markov Processes and Random Walks

name: Lecture 21: Hypothesis Testing and Random Walks

name: Lecture 23: Martingales (Plain, Sub, and Super)

name: Lecture 24: Martingales: Stopping and Converging

name: Lecture 3: Law of Large Numbers, Convergence

uk: Математика, природничі науки

description: Discrete stochastic processes are essentially probabilistic systems that evolve in time via random changes occurring at discrete fixed or random intervals. This course aims to help students acquire both the mathematical principles and the intuition necessary to create, analyze, and understand insightful models for a broad range of these processes. The range of areas for which discrete stochastic-process models are useful is constantly expanding, and includes many applications in engineering, physics, biology, operations research and finance.

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації

de: Video

en: Video


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


Lecture 14: Review

uk: Математика, природничі науки

uk: вхід без авторизації


Lecture 15: The Last Renewal

uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


Lecture 22: Random Walks and Thresholds

uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


Lecture 25: Putting It All Together

uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації

name: Lecture 4: Poisson (The Perfect Arrival Process)


uk: Математика, природничі науки

uk: вхід без авторизації

name: Lecture 5: Poisson Combining and Splitting


Lecture 6: From Poisson to Markov

uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації

name: Lecture 7: Finite-state Markov Chains; The Matrix Approach


uk: Математика, природничі науки

uk: вхід без авторизації

name: Lecture 8: Markov Eigenvalues and Eigenvectors


uk: Математика, природничі науки

uk: вхід без авторизації

name: Lecture 9: Markov Rewards and Dynamic Programming


uk: Математика, природничі науки

description: This resource contains problems related to Markov process.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains solution to the problem Markov chain.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains problems related to countable state Markov process.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains solution to the problem Yule process.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains problems related to random vector.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains solution to the problem birth-death chain.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains problems related to finite state Markov chain.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains solution to the problem finite state Markov chain.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains problems related to queueing system.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains solution to the problem self-loop transition.

uk: вхід без авторизації


Data Communication Networks

keywords:
Engineering
Computer Science
Electrical Engineering
Telecommunications
Computer Networks

uk: Комп'ютерні науки

description: 6.263J / 16.37J focuses on the fundamentals of data communication networks. One goal is to give some insight into the rationale of why networks are structured the way they are today and to understand the issues facing the designers of next-generation data networks. Much of the course focuses on network algorithms and their performance. Students are expected to have a strong mathematical background and an understanding of probability theory. Topics discussed include: layered network architecture, Link Layer protocols, high-speed packet switching, queueing theory, Local Area Networks, and Wide Area Networking issues, including routing and flow control.

uk: вхід без авторизації


Autonomous Robot Design Competition

keywords:
Engineering
Computer Science
Artificial Intelligence
Electrical Engineering
Robotics and Control Systems
Computer Design and Engineering

uk: Комп'ютерні науки

description:
6.270 is a hands-on, learn-by-doing class, in which participants design and build a robot that will play in a competition at the end of January. The goal for the students is to design a machine that will be able to navigate its way around the playing surface, recognize other opponents, and manipulate game objects. Unlike the machines in Design and Manufacturing I ([2.007](/courses/2-007-design-and-manufacturing-i-spring-2009)), 6.270 robots are totally autonomous, so once a round begins, there is no human intervention.

The goal of 6.270 is to teach students about robotic design by giving them the hardware, software, and information they need to design, build, and debug their own robot. The subject includes concepts and applications that are related to various MIT classes (e.g. [6.001](/courses/6-001-structure-and-interpretation-of-computer-programs-spring-2005), [6.002](/courses/6-002-circuits-and-electronics-spring-2007), [6.004](/courses/6-004-computation-structures-spring-2009), and [2.007](/courses/2-007-design-and-manufacturing-i-spring-2009)), though there are no formal prerequisites for 6.270.

uk: вхід без авторизації


Solid-State Circuits

keywords:
Engineering
Electronics
Electrical Engineering

description: 6.301 is a course in analog circuit analysis and design. We cover the tools and methods necessary for the creative design of useful circuits using active devices. The class stresses insight and intuition, applied to the design of transistor circuits and the estimation of their performance. We concentrate on circuits using the bipolar junction transistor, but the techniques that we study can be equally applied to circuits using JFETs, MOSFETs, MESFETs, future exotic devices, or even vacuum tubes.

uk: вхід без авторизації


description: This resource contains information related to midband gain.

uk: вхід без авторизації


description: This resource contains information related to transfer functions.

uk: вхід без авторизації


description: This resource contains information related to incremental input current.

uk: вхід без авторизації


description: This resource contains information related to thevenin output resistance.

uk: вхід без авторизації


description: This resource contains information related to infinite power gain.

uk: вхід без авторизації


description: This resource contains information related to general equations.

uk: вхід без авторизації


Feedback Systems

keywords:
Engineering
Electronics
Electrical Engineering
Robotics and Control Systems

description: This course provides an introduction to the design of feedback systems. Topics covered include: properties and advantages of feedback systems, time-domain and frequency-domain performance measures, stability and degree of stability, root locus method, Nyquist criterion, frequency-domain design, compensation techniques, application to a wide variety of physical systems, internal and external compensation of operational amplifiers, modeling and compensation of power converter systems, and phase lock loops.

uk: вхід без авторизації


description: Final exam on Feedback Systems from Fall 2003.

uk: вхід без авторизації


description: Final exam on Feedback Systems from Fall 2004.

uk: вхід без авторизації


description: Final exam on Feedback Systems from Fall 2005.

uk: вхід без авторизації


description: Final exam on Feedback Systems from Fall 2007.

uk: вхід без авторизації


uk: вхід без авторизації


description: Quiz on Feedback Systems from Fall 2004.

uk: вхід без авторизації


Advanced Circuit Techniques

keywords:
Engineering
Electronics
Electrical Engineering
Electric Power

description: Following a brief classroom discussion of relevant principles, each student in this course completes the paper design of several advanced circuits such as multiplexers, sample-and-holds, gain-controlled amplifiers, analog multipliers, digital-to-analog or analog-to-digital converters, and power amplifiers. One of each student's designs is presented to the class, and one may be built and evaluated. Associated laboratory assignments emphasize the use of modern analog building blocks. This course is worth 12 Engineering Design Points.

uk: вхід без авторизації


Power Electronics

description: 6.334 examines the application of electronics to energy conversion and control. Topics covered include: modeling, analysis, and control techniques; design of power circuits including inverters, rectifiers, and DC-DC converters; analysis and design of magnetic components and filters; and characteristics of power semiconductor devices. Numerous application examples will be presented such as motion control systems, power supplies, and radio-frequency power amplifiers. The course is worth 6 engineering design points.

uk: вхід без авторизації


keywords:
Engineering
Systems Engineering
Numerical Simulation

description:
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](http://web.mit.edu/sma/) (SMA) programme as course number SMA 5211 (Introduction to Numerical Simulation).

uk: вхід без авторизації

name: Introduction to Numerical Simulation (SMA 5211)


Discrete-Time Signal Processing

keywords:
Engineering
Mathematics
Electrical Engineering
Signal Processing
Discrete Mathematics
Digital Systems

uk: Математика, природничі науки

description:
This class addresses the representation, analysis, and design of discrete time signals and systems. The major concepts covered include: Discrete-time processing of continuous-time signals; decimation, interpolation, and sampling rate conversion; flowgraph structures for DT systems; time-and frequency-domain design techniques for recursive (IIR) and non-recursive (FIR) filters; linear prediction; discrete Fourier transform, FFT algorithm; short-time Fourier analysis and filter banks; multirate techniques; Hilbert transforms; Cepstral analysis and various applications.

Acknowledgements
----------------

I would like to express my thanks to **Thomas Baran**, **Myung Jin Choi**, and **Xiaomeng Shi** for compiling the lecture notes on this site from my individual lectures and handouts and their class notes during the semesters that they were students in the course. These lecture notes, the text book and included problem sets and solutions will hopefully be helpful as you learn and explore the topic of Discrete-Time Signal Processing.

uk: вхід без авторизації


backexam.pdf

uk: Математика, природничі науки

description: This resource contains problems based on time-invariant, LTI system, continuous-time signal, transfer function, and normalized frequency.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains solutions for background exams file.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains problems based on discrete-time system, LTI system, and filters.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains solutions for backexam file.

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains problems based on discrete-time system, and LTI system.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains solutions for final exams file.

uk: вхід без авторизації


midexam.pdf

uk: Математика, природничі науки

description: This resource contains problems based on equivalent continuous-time frequency response, LTI system, and grading.

uk: вхід без авторизації


uk: Математика, природничі науки

description: This resource contains solutions for midtermexam file.

uk: вхід без авторизації


Automatic Speech Recognition

keywords:
Engineering
Humanities
Electrical Engineering
Linguistics
Signal Processing

uk: Гуманітарні науки

description: 6.345 introduces students to the rapidly developing field of automatic speech recognition. Its content is divided into three parts. Part I deals with background material in the acoustic theory of speech production, acoustic-phonetics, and signal representation. Part II describes algorithmic aspects of speech recognition systems including pattern classification, search algorithms, stochastic modelling, and language modelling techniques. Part III compares and contrasts the various approaches to speech recognition, and describes advanced techniques used for acoustic-phonetic modelling, robust speech recognition, speaker adaptation, processing paralinguistic information, speech understanding, and multimodal processing.

uk: вхід без авторизації


Robocraft Programming Competition

keywords:
Engineering
Computer Science
Artificial Intelligence
Electrical Engineering
Fine Arts
Software Design and Engineering
Robotics and Control Systems
Game Design

uk: Образотворче мистецтво

uk: Комп'ютерні науки

uk: Мистецтво, мистецтвознавство

description: The 6.370 Robocraft programming competition is a unique challenge that combines battle strategy and software engineering. In short, the objective is to write the best player program for the computer game Robocraft.

uk: вхід без авторизації


The Battlecode Programming Competition

keywords:
Engineering
Computer Science
Artificial Intelligence
Fine Arts
Programming Languages
Game Design

name: Lecture 8: Lessons from the Sprint Tournament

uk: Комп'ютерні науки

uk: Образотворче мистецтво

uk: Мистецтво, мистецтвознавство

description:
This course is conducted as an artificial intelligence programming contest in Java. Students work in teams to program virtual robots to play Battlecode, a real-time strategy game. Optional lectures are provided on topics and programming practices relevant to the game, and students learn and improve their programming skills experientially. The competition culminates in a live Battlecode tournament.

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.

uk: вхід без авторизації


Lecture 1: Introduction to Battlecode

uk: Комп'ютерні науки

uk: Образотворче мистецтво

uk: Мистецтво, мистецтвознавство

uk: вхід без авторизації


Lecture 2: Writing Your First Player

uk: Комп'ютерні науки

uk: Образотворче мистецтво

uk: Мистецтво, мистецтвознавство

uk: вхід без авторизації


Lecture 3: Navigation

uk: Комп'ютерні науки

uk: Образотворче мистецтво

uk: Мистецтво, мистецтвознавство

uk: вхід без авторизації


Lecture 4: Git Repository

uk: Комп'ютерні науки

uk: Образотворче мистецтво

uk: Мистецтво, мистецтвознавство

uk: вхід без авторизації


Lecture 5: Swarms, Artillery, and Mines

uk: Комп'ютерні науки

uk: Образотворче мистецтво

uk: Мистецтво, мистецтвознавство

uk: вхід без авторизації


Lecture 6: Numerical Strategy

uk: Комп'ютерні науки

uk: Образотворче мистецтво

uk: Мистецтво, мистецтвознавство

uk: вхід без авторизації


Lecture 7: The Lost Lecture

uk: Комп'ютерні науки

uk: Образотворче мистецтво

uk: Мистецтво, мистецтвознавство

uk: вхід без авторизації


uk: Комп'ютерні науки

uk: Образотворче мистецтво

uk: Мистецтво, мистецтвознавство

uk: вхід без авторизації


keywords:
Engineering
Computer Science
Electronics
Electrical Engineering
Computer Design and Engineering
Digital Systems

uk: Комп'ютерні науки

description: 6.374 examines the device and circuit level optimization of digital building blocks. Topics covered include: MOS device models including Deep Sub-Micron effects; circuit design styles for logic, arithmetic and sequential blocks; estimation and minimization of energy consumption; interconnect models and parasitics; device sizing and logical effort; timing issues (clock skew and jitter) and active clock distribution techniques; memory architectures, circuits (sense amplifiers) and devices; testing of integrated circuits. The course employs extensive use of circuit layout and SPICE in design projects and software labs.

uk: вхід без авторизації

name: Analysis and Design of Digital Integrated Circuits


uk: Комп'ютерні науки

uk: вхід без авторизації


Robotic Manipulation

keywords:
Engineering
Computer Science
Artificial Intelligence
Electrical Engineering
Robotics and Control Systems

uk: Комп'ютерні науки

description:
Introduces the fundamental algorithmic approaches for creating robot systems that can autonomously manipulate physical objects in unstructured environments such as homes and restaurants. Topics include perception (including approaches based on deep learning and approaches based on 3D geometry), planning (robot kinematics and trajectory generation, collision-free motion planning, task-and-motion planning, and planning under uncertainty), as well as dynamics and control (both model-based and learning-based).

Homework assignments will guide students through building a software stack that will enable a robotic arm to autonomously manipulation objects in cluttered scenes (like a kitchen). A final project will allow students to dig deeper into a specific aspect of their choosing. The class has hardware available for ambitious final projects, but will also make heavy use of simulation using cloud resources.

uk: вхід без авторизації


keywords:
Engineering
Mathematics
Probability and Statistics
Electrical Engineering
Applied Mathematics
Signal Processing

uk: Математика, природничі науки

description: This course examines the fundamentals of detection and estimation for signal processing, communications, and control. Topics covered include: vector spaces of random variables; Bayesian and Neyman-Pearson hypothesis testing; Bayesian and nonrandom parameter estimation; minimum-variance unbiased estimators and the Cramer-Rao bounds; representations for stochastic processes, shaping and whitening filters, and Karhunen-Loeve expansions; and detection and estimation from waveform observations. Advanced topics include: linear prediction and spectral estimation, and Wiener and Kalman filters.

uk: вхід без авторизації

name: Stochastic Processes, Detection, and Estimation


System Identification

keywords:
Engineering
Mathematics
Systems Engineering
Applied Mathematics
Computational Science and Engineering
Numerical Simulation

uk: Математика, природничі науки

description: This course is offered to graduates and includes topics such as mathematical models of systems from observations of their behavior; time series, state-space, and input-output models; model structures, parametrization, and identifiability; non-parametric methods; prediction error methods for parameter estimation, convergence, consistency, and asymptotic distribution; relations to maximum likelihood estimation; recursive estimation; relation to Kalman filters; structure determination; order estimation; Akaike criterion; bounded but unknown noise model; and robustness and practical issues.

uk: вхід без авторизації


Fundamentals of Probability

keywords:
Mathematics
Probability and Statistics

name: 6.436J / 15.085J Fundamentals of Probability, Midterm

name: 6.436J / 15.085J Fundamentals of Probability, Final Exam

uk: Математика, природничі науки

description: This is a course on the fundamentals of probability geared towards first or second-year graduate students who are interested in a rigorous development of the subject. The course covers sample space, random variables, expectations, transforms, Bernoulli and Poisson processes, finite Markov chains, and limit theorems. There is also a number of additional topics such as: language, terminology, and key results from measure theory; interchange of limits and expectations; multivariate Gaussian distributions; and deeper understanding of conditional distributions and expectations.

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


uk: Математика, природничі науки

uk: вхід без авторизації


Algorithms for Inference

keywords:
Engineering
Computer Science
Mathematics
Probability and Statistics
Algorithms and Data Structures
Graphics and Visualization

uk: Комп'ютерні науки

uk: Математика, природничі науки

description: 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.

uk: вхід без авторизації


Algorithms for Inference, Exam 1, 2011

uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This file contains information regarding quiz 1.

uk: вхід без авторизації


Algorithms for Inference, Exam 2, 2011

uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This file contains information regarding quiz 2.

uk: вхід без авторизації


Algorithms for Inference, Exam 2, 2013

uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації


Algorithms for Inference, Exam 1, 2014

uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації


Algorithms for Inference, Exam 2, 2014

uk: Комп'ютерні науки

uk: Математика, природничі науки

uk: вхід без авторизації


Information Theory

keywords:
Engineering
Computer Science
Electrical Engineering
Signal Processing
Theory of Computation
Telecommunications

uk: Комп'ютерні науки

description: 6.441 offers an introduction to the quantitative theory of information and its applications to reliable, efficient communication systems. Topics include mathematical definition and properties of information, source coding theorem, lossless compression of data, optimal lossless coding, noisy communication channels, channel coding theorem, the source channel separation theorem, multiple access channels, broadcast channels, Gaussian noise, and time-varying channels.

uk: вхід без авторизації


keywords:
Engineering
Computer Science
Mathematics
Probability and Statistics
Applied Mathematics
Computation
Theory of Computation

uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This is a graduate-level introduction to mathematics of information theory. We will cover both classical and modern topics, including information entropy, lossless data compression, binary hypothesis testing, channel coding, and lossy data compression.

uk: вхід без авторизації


6.441S16: Final

uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains the information regarding Final.

uk: вхід без авторизації


6.441S16: Midterm Exam

uk: Комп'ютерні науки

uk: Математика, природничі науки

description: This resource contains the information regarding Midterm Exam.

uk: вхід без авторизації


Principles of Digital Communication I

keywords:
Engineering
Electrical Engineering
Telecommunications
Digital Systems

description:
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.

uk: вхід без авторизації


Final Exam

description: Final exam on the principles of digital communication.

uk: вхід без авторизації


Quiz 1

description: Quiz on the principles of digital communication.

uk: вхід без авторизації


Principles of Digital Communications I

name: Lecture 14: Jointly Gaussian Random Vectors

name: Lecture 16: Review; Introduction to Detection

name: Lecture 17: Detection for Random Vectors and Processes

name: Lecture 20: Introduction of Wireless Communication

name: Lecture 22: Discrete-Time Baseband Models for Wireless Channels

name: Lecture 23: Detection for Flat Rayleigh Fading and Incoherent Channels

name: Lecture 24: Case Study on Code Division Multiple Access

name: Lecture 4: Entropy and Asymptotic Equipartition Property

name: Lecture 7: High Rate Quantizers and Waveform Encoding

name: Lecture 9: Discrete-Time Fourier Transforms

description:
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, 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.

uk: вхід без авторизації


Lecture 1: Introduction

uk: вхід без авторизації


Lecture 10: Degrees of Freedom

uk: вхід без авторизації


Lecture 11: Signal Space

uk: вхід без авторизації


Lecture 12: Nyquist Theory

uk: вхід без авторизації


Lecture 13: Random Processes

uk: вхід без авторизації


uk: вхід без авторизації


Lecture 15: Linear Functionals

uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


Lecture 18: Theory of Irrelevance

uk: вхід без авторизації


Lecture 19: Baseband Detection

uk: вхід без авторизації


Lecture 2: Discrete Source Encoding

uk: вхід без авторизації


uk: вхід без авторизації


Lecture 21: Doppler Spread

uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


Lecture 3: Memory-less Sources

uk: вхід без авторизації


uk: вхід без авторизації


Lecture 5: Markov Sources

uk: вхід без авторизації


Lecture 6: Quantization

uk: вхід без авторизації


uk: вхід без авторизації


Lecture 8: Measure

uk: вхід без авторизації


uk: вхід без авторизації


description: Practice Quiz 1 from Fall 2001.

uk: вхід без авторизації


description: Solutions to Quiz 1.

uk: вхід без авторизації


description: Practice Quiz 1 from Fall 2003.

uk: вхід без авторизації


description: Practice Quiz 1 from Fall 2004.

uk: вхід без авторизації


description: Quiz 1 from Fall 2006.

uk: вхід без авторизації


description: Quiz 2 from Fall 2006.

uk: вхід без авторизації


description: Solutions to Quiz 2.

uk: вхід без авторизації


Principles of Digital Communication II

name: Lecture 4: Hard-decision and Soft-decision Decoding

name: Lecture 5: Introduction to Binary Block Codes

name: Lecture 6: Introduction to Binary Block Codes

name: Lecture 7: Introduction to Finite Fields

name: Lecture 8: Introduction to Finite Fields

name: Lecture 9: Introduction to Finite Fields

name: Lecture 1: Introduction Sampling Theorem

name: Lecture 13: Introduction to Convolutional Codes

name: Lecture 14: Introduction to Convolutional Codes

name: Lecture 15: Trellis Representations of Binary Linear Block Codes

name: Lecture 16: Trellis Representations of Binary Linear Block Codes

name: Lecture 2: Performance of Small Signal Constellations

name: Lecture 3: Hard-decision and Soft-decision Decoding

description:
This course is the second of a two-term sequence with 6.450. The focus is on coding techniques for approaching the Shannon limit of additive white Gaussian noise (AWGN) channels, their performance analysis, and design principles. After a review of 6.450 and the Shannon limit for AWGN channels, the course begins by discussing small signal constellations, performance analysis and coding gain, and hard-decision and soft-decision decoding. It continues with binary linear block codes, Reed-Muller codes, finite fields, Reed-Solomon and BCH codes, binary linear convolutional codes, and the Viterbi algorithm.

More advanced topics include trellis representations of binary linear block codes and trellis-based decoding; codes on graphs; the sum-product and min-sum algorithms; the BCJR algorithm; turbo codes, LDPC codes and RA codes; and performance of LDPC codes with iterative decoding. Finally, the course addresses coding for the bandwidth-limited regime, including lattice codes, trellis-coded modulation, multilevel coding and shaping. If time permits, it covers equalization of linear Gaussian channels.

uk: вхід без авторизації


description: This resource provides definition of Trellis representations of binary linear block codes, notes on minimal trellises and the state space theorem, and permutation and sectionalization problems.

uk: вхід без авторизації


description: This resource contains notes on elementary realizations of linear block codes, general linear behavioral realizations, graph-theoretic properties of graphical realizations, and classes of graphical realizations.

uk: вхід без авторизації


description: This resource contains algorithm on cycle-free graphs, BCJR, min-sum algorithm and ML decoding, sum-product algorithm on graphs with cycles.

uk: вхід без авторизації


description: This resource provides notes on LDPC codes, turbo codes, Repeat-accumulate codes, analysis of LDPC codes on the binary erasure channel, and LDPC code analysis on symmetric binary-input channels.

uk: вхід без авторизації


description: This resource provides introduction to lattice and trellis codes. It talks about lattices, lattice constellations, shaping gain and shaping techniques, coding gains of dense lattices, trellis codes, sequential decoding in the high-SNR regime and multilevel codes and multistage decoding.

uk: вхід без авторизації


uk: вхід без авторизації


description: This resource contains notes on Discrete-time AWGN channel model, two normalized measures of SNR, power-limited and bandwidth-limited channels, and performance of M-PAM and (M ? M )-QAM.

uk: вхід без авторизації


description: This resource talks about binary signal constellations, binary linear block codes as binary vector spaces, Euclidean-space images of binary linear block codes, reed-Muller codes, and decoding of binary block codes.

uk: вхід без авторизації


description: This resource contains notes on integers, groups, fields, polynomials, a construction of a field with pm elements, the multiplicative group of Fq is cyclic, every finite field is isomorphic to a field Fg(x), and finite fields Fpm exist for all prime p and m = 1.

uk: вхід без авторизації


description: This resource contains linear codes over finite fields, singleton bount and MDS codes, Reed-Solomon codes , introduction to RS codes, applications of RS codes, and binary BCH codes.

uk: вхід без авторизації


description: This resource provides notes on linear time-invariant systems over finite fields, Rate-1/n binary linear convolutional codes, terminated convolutional codes, maximum likelihood sequence detection: The VA,and  performance analysis of convolutional codes.

uk: вхід без авторизації


description: This resource provides introduction to Shannon?s grand challenge and brief history of codes for deep-space missions and telephone-line modems. It also provides exercise and references for the above topics covered.

uk: вхід без авторизації


description: This resource provides notes on continuous-time AWGN channel model, signal spaces, sampling theorem, white Gaussian noise (WGN), continuous time to discrete time, and orthonormal PAM and QAM modulation.

uk: вхід без авторизації


description: This resource provides outline of proof of the capacity theorem, notes on laws of large numbers, and geometric interpretation and converse.

uk: вхід без авторизації


description: This resource contains notes on signal constellations for the AWGN channel, probability of decision error, performance analysis in the power-limited regime, orthogonal and related signal sets, performance in the bandwidth-limited regime, design of small signal constellations, and summary of performance analysis and coding gain.

uk: вхід без авторизації


description: This resource gives some tables containing useful data to solve the given problems and three problems on convolution code over the quaternary field, graphical representations and decoding of the (32; 16; 8) binary Reed-Muller code RM(2; 5) and various propositions. It also provides instructions for how to take the closed book exam.

uk: вхід без авторизації


description: This resource gives solutions for the three problems for the final exam 2002.

uk: вхід без авторизації


description: This resource gives the instructions on how to take the closed book exam, it also gives the breakup of marks for each problem and its parts. It cotains three problems on: coded modulation schemes based on a one-to-one mapping, the (16, 7, 6) binary linear block code C generated by the generator matrix and various propositions and proof for it.

uk: вхід без авторизації


description: This resource contains solutions for the three problems given for final exam 2003.

uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


Lecture 10: Reed-Solomon Codes

uk: вхід без авторизації


Lecture 11: Reed-Solomon Codes

uk: вхід без авторизації


Lecture 12: Reed-Solomon Codes

uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


Lecture 17: Codes on Graphs

uk: вхід без авторизації


Lecture 18: Codes on Graphs

uk: вхід без авторизації


Lecture 19: The Sum-Product Algorithm

uk: вхід без авторизації


uk: вхід без авторизації


Lecture 20: Turbo, LDPC, and RA Codes

uk: вхід без авторизації


Lecture 21: Turbo, LDPC, and RA Codes

uk: вхід без авторизації


Lecture 22: Lattice and Trellis Codes

uk: вхід без авторизації


Lecture 23: Lattice and Trellis Codes

uk: вхід без авторизації


Lecture 24: Linear Gaussian Channels

uk: вхід без авторизації


Lecture 25: Linear Gaussian Channels

uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


uk: вхід без авторизації


description: This resource gives the instructions on how to take the closed book exam, it also gives the breakup of marks for each problem and its parts. It cotains two problems on: study of a class of codes called product codes, and various propositions and state if they are true or false, with data tables useful to solve the problems.

uk: вхід без авторизації


description: This resource gives the instructions on how to take the closed book exam, it also gives the breakup of marks for each problem and its parts. It cotains two problems on: M -simplex signal set is a set of M signals and various propositions and statement for if they are true or false.

uk: вхід без авторизації


description: This resource gives the instructions on how to take the closed book exam, it also gives the breakup of marks for each problem and its parts. It cotains two problems on: feasibility study for a digital communication system and propositions with data tables useful to solve the problems.

uk: вхід без авторизації


description: This resource gives solutions for the two problems for the midterm exam 2003 and the scores for the problems.

uk: вхід без авторизації


description: This resource gives solutions for the two problems for the midterm exam 2005 and the scores for the problems.

uk: вхід без авторизації


description: This resource gives solutions for the two problems for the midterm exam 2002 and the scores for the problems.

uk: вхід без авторизації


Principles of Wireless Communications

description: This course is an introduction to the design, analysis, and fundamental limits of wireless transmission systems. Topics to be covered include: wireless channel and system models; fading and diversity; resource management and power control; multiple-antenna and MIMO systems; space-time codes and decoding algorithms; multiple-access techniques and multiuser detection; broadcast codes and precoding; cellular and ad-hoc network topologies; OFDM and ultrawideband systems; and architectural issues.

uk: вхід без авторизації


Quantum Optical Communication

keywords:
Engineering
Science
Physics
Electrical Engineering
Atomic, Molecular, Optical Physics
Quantum Mechanics
Telecommunications
Digital Systems

name: 6.453 Quantum Optical Communication: Midterm Exam

name: 6.453 Quantum Optical Communication: Solutions to Midterm Exam

de: Physik

en: Physics

uk: Математика, природничі науки

de: Physik, Astronomie

uk: Фізика, Астрономія

en: Physics, Astronomy

description: _6.453 Quantum Optical Communication_ is one of a collection of MIT classes that deals with aspects of an emerging field known as quantum information science. This course covers Quantum Optics, Single-Mode and Two-Mode Quantum Systems, Multi-Mode Quantum Systems, Nonlinear Optics, and Quantum System Theory.

uk: вхід без авторизації


uk: Математика, природничі науки

uk: Фізика, Астрономія

description: This file contains information regarding midterm exam.

uk: вхід без авторизації


uk: Математика, природничі науки

uk: Фізика, Астрономія

description: This file contains information regarding solutions to midterm exam.

uk: вхід без авторизації


Foundations of Information Policy

keywords:
Engineering
Computer Science
Social Science
Public Administration
Science and Technology Policy

uk: Суспільні науки та соціологія

uk: Комп'ютерні науки

de: Verwaltungswissenschaften

uk: Управління та адміністрування

en: Administrative Sciences

uk: Право, економіка та суспільні науки

description:
In this class, we will consider the interaction between law, policy, and technology as they relate to the evolving controversies over control of the internet. Our goal is for participants to develop the technical, legal, and rhetorical skills to analyze and participate in the evolution of the global public policy environments that govern human behavior on the internet.

Topics include history of internet policy, the relationship between technical architecture and law, privacy, cybersecurity, freedom of expression, intellectual property, electronic surveillance, trade policy, and international affairs.

uk: вхід без авторизації


Algorithm Engineering

keywords:
Engineering
Computer Science
Algorithms and Data Structures

uk: Комп'ютерні науки

description: This is a research-oriented course on algorithm engineering, which will cover both the theory and practice of algorithms and data structures. Students will learn about models of computation, algorithm design and analysis, and performance engineering of algorithm implementations. We will study the design and implementation of sequential, parallel, cache-efficient, external-memory, and write-efficient algorithms for fundamental problems in computing. Many of the principles of algorithm engineering will be illustrated in the context of parallel algorithms and graph problems.

uk: вхід без авторизації


Speech Communication

keywords:
Engineering
Humanities
Electrical Engineering
Health and Medicine
Linguistics
Speech Pathology
Signal Processing

de: Humanmedizin/Gesundheitswissenschaften

uk: Медицина / Науки про здоров'я

en: Human Medicine / Health Sciences

uk: Гуманітарні науки

description: 6.541J surveys the structural properties of natural languages, with special emphasis on the sound pattern. Topics covered include: representation of the lexicon; physiology of speech production; articulatory phonetics; acoustical theory of speech production; acoustical and articulatory descriptions of phonetic features and of prosodic aspects of speech; perception of speech; models of lexical access and of speech production and planning; and applications to recognition and generation of speech by machine, and to the study of speech disorders.

uk: вхід без авторизації


keywords:
Engineering
Humanities
Electrical Engineering
Health and Medicine
Linguistics
Speech Pathology
Anatomy and Physiology
Signal Processing

uk: Медицина / Науки про здоров'я

de: Geisteswissenschaften

uk: Гуманітарні науки

en: Humanities

description:
The course focuses on experimental investigations of speech processes. Topics include: measurement of articulatory movements, measurements of pressures and airflows in speech production, computer-aided waveform analysis and spectral analysis of speech, synthesis of speech, perception and discrimination of speechlike sounds, speech prosody, models for speech recognition, speech disorders, and other topics.

*   Two 1-hour lectures per week
*   Two labs per week
*   Brief lab reports
*   Term project, with short term paper
*   No exams

uk: вхід без авторизації

name: Laboratory on the Physiology, Acoustics, and Perception of Speech


Acoustics of Speech and Hearing

keywords:
Engineering
Science
Electrical Engineering
Health and Medicine
Anatomy and Physiology
Biology
Signal Processing
Biophysics

de: Ingenieurwissenschaften

en: Engineering Sciences

de: Biologie

en: Biology

uk: Медицина / Науки про здоров'я

uk: Математика, природничі науки

description:
The Acoustics of Speech and Hearing is an H-Level graduate course that reviews the physical processes involved in the production, propagation and reception of human speech. Particular attention is paid to how the acoustics and mechanics of the speech and auditory system define what sounds we are capable of producing and what sounds we can sense. Areas of discussion include:

1.  the acoustic cues used in determining the direction of a sound source,
2.  the acoustic and mechanical mechanisms involved in speech production and

3.  the acoustic and mechanical mechanism used to transduce and analyze sounds in the ear.

uk: вхід без авторизації


uk: Медицина / Науки про здоров'я

de: Elektrotechnik und Informationstechnik

en: Electrical Engineering and Information Engineering

uk: Математика, природничі науки

description: The resource includes a quiz on Acoustics of Speech and Hearing.

uk: вхід без авторизації


uk: Медицина / Науки про здоров'я

de: Mathematik, Naturwissenschaften

uk: Математика, природничі науки

en: Mathematics, Natural Sciences

description: This resource is a quiz on Acoustics of Speech and Hearing.

uk: вхід без авторизації


Advanced Topics in Cryptography

keywords:
Engineering
Computer Science
Cryptography

name: Lecture 1: Interactive Proofs and the Sum-Check Protocol, Part 1

name: Lecture 1: Interactive Proofs and the Sum-Check Protocol, Part 2

name: Lecture 2: Doubly Efficient Interactive Proofs, Part 1

name: Lecture 2: Doubly Efficient Interactive Proofs, Part 2

name: Lecture 3: Continuation of the GKR Protocol and Corollaries

name: Lecture 4: PCP via GKR and Interactive Arguments, Part 1

name: Lecture 4: PCP via GKR and Interactive Arguments, Part 2

name: Lecture 5: The Kilian-Micali Protocol, Part 1

name: Lecture 5: The Kilian-Micali Protocol, Part 2

name: Lecture 6: Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 1

name: Lecture 6: Fiat-Shamir Paradigm and Zero-Knowledge Proofs, Part 2

name: Lecture 7: Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 1

name: Lecture 7: Soundness of the Fiat-Shamir Paradigm in the Standard Model, Part 2

name: Lecture 8: Succinct Non-Interactive Arguments for Batch NP (BARGs) from LWE, Part 1

name: Lecture 8: Succinct Non-Interactive Arguments for Batch NP (BARGs) from LWE, Part 2

name: Lecture 9: BARGs Implies SNARGs and Connection to Non-Signaling PCPs, Part 1

name: Lecture 9: BARGs Implies SNARGs and Connection to Non-Signaling PCPs, Part 2

uk: Комп'ютерні науки

description: This course is about the evolution of proofs in computer science. We will learn about the power of interactive proofs, multi-prover interactive proofs, and probabilistically checkable proofs.  We will then show how to use cryptography to convert these powerful proof systems into computationally sound non-interactive arguments (SNARGs).

de: keine Anmeldung erforderlich

uk: вхід без авторизації

en: no login required


de: Informatik

uk: Комп'ютерні науки

en: Computer Science

uk: вхід без авторизації

name: Lecture 1: Interactive Proofs and the Sum-Check Protocol, Part 1


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Lecture 1: Interactive Proofs and the Sum-Check Protocol, Part 2


uk: Комп'ютерні науки

uk: вхід без авторизації

name: Lecture 2: Doubly Efficient Interactive Proofs, Part 1