Searching for math : 987 results found | RSS Feed for this search

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39

Description

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic. This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.Subjects

discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing | discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing | discrete math | discrete math | discrete mathematics | discrete mathematics | discrete | discrete | math | math | mathematics | mathematics | seminar | seminar | presentations | presentations | student presentations | student presentations | oral | oral | communication | communication | stable marriage | stable marriage | dych | dych | emergency | emergency | response vehicles | response vehicles | ambulance | ambulance | game theory | game theory | congruences | congruences | color theorem | color theorem | four color | four color | cake cutting | cake cutting | algorithm | algorithm | RSA | RSA | encryption | encryption | numberical integration | numberical integration | sorting | sorting | post correspondence problem | post correspondence problem | PCP | PCP | ramsey | ramsey | van der waals | van der waals | fibonacci | fibonacci | recursion | recursion | domino | domino | tiling | tiling | towers | towers | hanoi | hanoi | pigeonhole | pigeonhole | principle | principle | matrix | matrix | hamming | hamming | code | code | hat game | hat game | juggling | juggling | zero-knowledge | zero-knowledge | proof | proof | repeated games | repeated games | lewis carroll | lewis carroll | determinants | determinants | infinitude of primes | infinitude of primes | bridges | bridges | konigsberg | konigsberg | koenigsberg | koenigsberg | time series analysis | time series analysis | GARCH | GARCH | rational | rational | recurrence | recurrence | relations | relations | digital | digital | image | image | compression | compression | quantum computing | quantum computingLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic. This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.Subjects

discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing | discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing | discrete math | discrete math | discrete mathematics | discrete mathematics | discrete | discrete | math | math | mathematics | mathematics | seminar | seminar | presentations | presentations | student presentations | student presentations | oral | oral | communication | communication | stable marriage | stable marriage | dych | dych | emergency | emergency | response vehicles | response vehicles | ambulance | ambulance | game theory | game theory | congruences | congruences | color theorem | color theorem | four color | four color | cake cutting | cake cutting | algorithm | algorithm | RSA | RSA | encryption | encryption | numberical integration | numberical integration | sorting | sorting | post correspondence problem | post correspondence problem | PCP | PCP | ramsey | ramsey | van der waals | van der waals | fibonacci | fibonacci | recursion | recursion | domino | domino | tiling | tiling | towers | towers | hanoi | hanoi | pigeonhole | pigeonhole | principle | principle | matrix | matrix | hamming | hamming | code | code | hat game | hat game | juggling | juggling | zero-knowledge | zero-knowledge | proof | proof | repeated games | repeated games | lewis carroll | lewis carroll | determinants | determinants | infinitude of primes | infinitude of primes | bridges | bridges | konigsberg | konigsberg | koenigsberg | koenigsberg | time series analysis | time series analysis | GARCH | GARCH | rational | rational | recurrence | recurrence | relations | relations | digital | digital | image | image | compression | compression | quantum computing | quantum computingLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.304 Undergraduate Seminar in Discrete Mathematics (MIT)

Description

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.Subjects

discrete math; discrete mathematics; discrete; math; mathematics; seminar; presentations; student presentations; oral; communication; stable marriage; dych; emergency; response vehicles; ambulance; game theory; congruences; color theorem; four color; cake cutting; algorithm; RSA; encryption; numberical integration; sorting; post correspondence problem; PCP; ramsey; van der waals; fibonacci; recursion; domino; tiling; towers; hanoi; pigeonhole; principle; matrix; hamming; code; hat game; juggling; zero-knowledge; proof; repeated games; lewis carroll; determinants; infinitude of primes; bridges; konigsberg; koenigsberg; time series analysis; GARCH; rational; recurrence; relations; digital; image; compression; quantum computing | discrete math | discrete mathematics | discrete | math | mathematics | seminar | presentations | student presentations | oral | communication | stable marriage | dych | emergency | response vehicles | ambulance | game theory | congruences | color theorem | four color | cake cutting | algorithm | RSA | encryption | numberical integration | sorting | post correspondence problem | PCP | ramsey | van der waals | fibonacci | recursion | domino | tiling | towers | hanoi | pigeonhole | principle | matrix | hamming | code | hat game | juggling | zero-knowledge | proof | repeated games | lewis carroll | determinants | infinitude of primes | bridges | konigsberg | koenigsberg | time series analysis | GARCH | rational | recurrence | relations | digital | image | compression | quantum computingLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see https://ocw.mit.edu/terms/index.htmSite sourced from

https://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.310 Principles of Applied Mathematics (MIT) 18.310 Principles of Applied Mathematics (MIT)

Description

Principles of Applied Mathematics is a study of illustrative topics in discrete applied mathematics including sorting algorithms, information theory, coding theory, secret codes, generating functions, linear programming, game theory. There is an emphasis on topics that have direct application in the real world. Principles of Applied Mathematics is a study of illustrative topics in discrete applied mathematics including sorting algorithms, information theory, coding theory, secret codes, generating functions, linear programming, game theory. There is an emphasis on topics that have direct application in the real world.Subjects

sorting algorithms | sorting algorithms | information theory | information theory | coding theory | coding theory | secret codes | secret codes | generating functions | generating functions | linear programming | linear programming | game theory | game theory | discrete applied mathematics | discrete applied mathematics | mathematical analysis | mathematical analysis | sorting data | sorting data | efficient data storage | efficient data storage | efficient data transmission | efficient data transmission | error correction | error correction | secrecy | secrecy | Fast Fourier Transform | Fast Fourier Transform | network-flow problems | network-flow problems | mathematical economics | mathematical economics | statistics | statistics | probability theory | probability theory | combinatorics | combinatorics | linear algebra | linear algebraLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

The class will cover mathematical techniques necessary for understanding of materials science and engineering topics such as energetics, materials structure and symmetry, materials response to applied fields, mechanics and physics of solids and soft materials. The class uses examples from 3.012 to introduce mathematical concepts and materials-related problem solving skills. Topics include linear algebra and orthonormal basis, eigenvalues and eigenvectors, quadratic forms, tensor operations, symmetry operations, calculus of several variables, introduction to complex analysis, ordinary and partial differential equations, theory of distributions, fourier analysis and random walks.Technical RequirementsMathematica® software is required to run the .nb files found on this course site. The class will cover mathematical techniques necessary for understanding of materials science and engineering topics such as energetics, materials structure and symmetry, materials response to applied fields, mechanics and physics of solids and soft materials. The class uses examples from 3.012 to introduce mathematical concepts and materials-related problem solving skills. Topics include linear algebra and orthonormal basis, eigenvalues and eigenvectors, quadratic forms, tensor operations, symmetry operations, calculus of several variables, introduction to complex analysis, ordinary and partial differential equations, theory of distributions, fourier analysis and random walks.Technical RequirementsMathematica® software is required to run the .nb files found on this course site.Subjects

energetics | energetics | materials structure and symmetry: applied fields | materials structure and symmetry: applied fields | mechanics and physics of solids and soft materials | mechanics and physics of solids and soft materials | linear algebra | linear algebra | orthonormal basis | orthonormal basis | eigenvalues | eigenvalues | eigenvectors | eigenvectors | quadratic forms | quadratic forms | tensor operations | tensor operations | symmetry operations | symmetry operations | calculus | calculus | complex analysis | complex analysis | differential equations | differential equations | theory of distributions | theory of distributions | fourier analysis | fourier analysis | random walks | random walks | mathematical technicques | mathematical technicques | materials science | materials science | materials engineering | materials engineering | materials structure | materials structure | symmetry | symmetry | applied fields | applied fields | materials response | materials response | solids mechanics | solids mechanics | solids physics | solids physics | soft materials | soft materials | multi-variable calculus | multi-variable calculus | ordinary differential equations | ordinary differential equations | partial differential equations | partial differential equations | applied mathematics | applied mathematics | mathematical techniques | mathematical techniquesLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic. This course is a student-presented seminar in combinatorics, graph theory, and discrete mathematics in general. Instruction and practice in written and oral communication is emphasized, with participants reading and presenting papers from recent mathematics literature and writing a final paper in a related topic.Subjects

discrete math | discrete math | discrete mathematics | discrete mathematics | presentations | presentations | student presentations | student presentations | oral communication | oral communication | combinatorics | combinatorics | graph theory | graph theory | Proofs from the Book | Proofs from the Book | mathematics communication | mathematics communicationLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata11.131 Educational Theory and Practice III (MIT) 11.131 Educational Theory and Practice III (MIT)

Description

This is the final course in the three course sequence (11.129, 11.130 and 11.131) that deals with the practicalities of teaching students. Our areas of study will include: educational psychology, identification of useful resources that support instruction, learning to use technology in meaningful ways in the classroom, finding more methods of motivating students, implementing differentiated instruction and obtaining a teaching job. This is the final course in the three course sequence (11.129, 11.130 and 11.131) that deals with the practicalities of teaching students. Our areas of study will include: educational psychology, identification of useful resources that support instruction, learning to use technology in meaningful ways in the classroom, finding more methods of motivating students, implementing differentiated instruction and obtaining a teaching job.Subjects

classroom experiences | classroom experiences | student-centered classroom activities | student-centered classroom activities | student-led classes | student-led classes | issues in schools and education | issues in schools and education | observing | observing | pre-college math and science classes | pre-college math and science classes | design and implementation of curriculum | design and implementation of curriculum | diversity | diversity | standards in math and science | standards in math and science | student misconceptions | student misconceptions | methods of instruction | methods of instruction | the digital divide | the digital divide | teaching through different media | teaching through different media | student assessment | student assessmentLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata11.129 Educational Theory and Practice I (MIT) 11.129 Educational Theory and Practice I (MIT)

Description

This course concentrates on a core set of skills and knowledge necessary for teaching in secondary schools. Topics covered in the class include educational reform, student behavior and motivation, curriculum design, and the teaching profession. Classroom observation is a key component of the class. Assignments include readings from the educational literature, written reflections on classroom observations, and practice teaching and constructing curriculum. This is the first of a three course sequence necessary to complete the Teacher Education Program. This course concentrates on a core set of skills and knowledge necessary for teaching in secondary schools. Topics covered in the class include educational reform, student behavior and motivation, curriculum design, and the teaching profession. Classroom observation is a key component of the class. Assignments include readings from the educational literature, written reflections on classroom observations, and practice teaching and constructing curriculum. This is the first of a three course sequence necessary to complete the Teacher Education Program.Subjects

classroom experiences | classroom experiences | student-centered classroom activities | student-centered classroom activities | student-led classes | student-led classes | issues in schools and education | issues in schools and education | observing | observing | pre-college math and science classes | pre-college math and science classes | design and implementation of curriculum | design and implementation of curriculum | diversity | diversity | standards in math and science | standards in math and science | student misconceptions | student misconceptions | methods of instruction | methods of instruction | the digital divide | the digital divide | teaching through different media | teaching through different media | student assessment | student assessmentLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This course offers an introduction to optimization problems, algorithms, and their complexity, emphasizing basic methodologies and the underlying mathematical structures. The main topics covered include: Theory and algorithms for linear programming Network flow problems and algorithms Introduction to integer programming and combinatorial problems This course offers an introduction to optimization problems, algorithms, and their complexity, emphasizing basic methodologies and the underlying mathematical structures. The main topics covered include: Theory and algorithms for linear programming Network flow problems and algorithms Introduction to integer programming and combinatorial problemsSubjects

optimization | optimization | algorithms | algorithms | linear programming | linear programming | network flow problems | network flow problems | integer programming | integer programming | combinatorial problems | combinatorial problems | mathematics | mathematics | mathematical programming | mathematical programming | 6.251 | 6.251 | 15.081 | 15.081License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata11.125 Exploring K-12 Classroom Teaching (MIT) 11.125 Exploring K-12 Classroom Teaching (MIT)

Description

This subject uses K-12 classroom experiences, along with student-centered classroom activities and student-led classes, to explore issues in schools and education. Students in this course spend time each week observing pre-college math and science classes. Topics of study include design and implementation of curriculum, addressing the needs of a diversity of students, standards in math and science, student misconceptions, methods of instruction, the digital divide, teaching through different media, and student assessment. This subject uses K-12 classroom experiences, along with student-centered classroom activities and student-led classes, to explore issues in schools and education. Students in this course spend time each week observing pre-college math and science classes. Topics of study include design and implementation of curriculum, addressing the needs of a diversity of students, standards in math and science, student misconceptions, methods of instruction, the digital divide, teaching through different media, and student assessment.Subjects

classroom experiences | classroom experiences | student-centered classroom activities | student-centered classroom activities | student-led classes | student-led classes | issues in schools and education | issues in schools and education | observing | observing | pre-college math and science classes | pre-college math and science classes | design and implementation of curriculum | design and implementation of curriculum | diversity | diversity | standards in math and science | standards in math and science | student misconceptions | student misconceptions | methods of instruction | methods of instruction | the digital divide | the digital divide | teaching through different media | teaching through different media | student assessment | student assessmentLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This course surveys the basic concepts of computer modeling in science and engineering using discrete particle systems and continuum fields. It covers techniques and software for statistical sampling, simulation, data analysis and visualization, and uses statistical, quantum chemical, molecular dynamics, Monte Carlo, mesoscale and continuum methods to study fundamental physical phenomena encountered in the fields of computational physics, chemistry, mechanics, materials science, biology, and applied mathematics. Applications are drawn from a range of disciplines to build a broad-based understanding of complex structures and interactions in problems where simulation is on equal footing with theory and experiment. A term project allows development of individual interests. Students are mentor This course surveys the basic concepts of computer modeling in science and engineering using discrete particle systems and continuum fields. It covers techniques and software for statistical sampling, simulation, data analysis and visualization, and uses statistical, quantum chemical, molecular dynamics, Monte Carlo, mesoscale and continuum methods to study fundamental physical phenomena encountered in the fields of computational physics, chemistry, mechanics, materials science, biology, and applied mathematics. Applications are drawn from a range of disciplines to build a broad-based understanding of complex structures and interactions in problems where simulation is on equal footing with theory and experiment. A term project allows development of individual interests. Students are mentorSubjects

computer modeling | computer modeling | discrete particle system | discrete particle system | continuum | continuum | continuum field | continuum field | statistical sampling | statistical sampling | data analysis | data analysis | visualization | visualization | quantum | quantum | quantum method | quantum method | chemical | chemical | molecular dynamics | molecular dynamics | Monte Carlo | Monte Carlo | mesoscale | mesoscale | continuum method | continuum method | computational physics | computational physics | chemistry | chemistry | mechanics | mechanics | materials science | materials science | biology; applied mathematics | biology; applied mathematics | fluid dynamics | fluid dynamics | heat | heat | fractal | fractal | evolution | evolution | melting | melting | gas | gas | structural mechanics | structural mechanics | FEM | FEM | finite element | finite element | biology | biology | applied mathematics | applied mathematics | 1.021 | 1.021 | 2.030 | 2.030 | 3.021 | 3.021 | 10.333 | 10.333 | 18.361 | 18.361 | HST.588 | HST.588 | 22.00 | 22.00License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This course covers the basic models and solution techniques for problems of sequential decision making under uncertainty (stochastic control). Approximation methods for problems involving large state spaces are also presented and discussed. This course covers the basic models and solution techniques for problems of sequential decision making under uncertainty (stochastic control). Approximation methods for problems involving large state spaces are also presented and discussed.Subjects

dynamic programming | dynamic programming | | stochastic control | | stochastic control | | mathematics | optimization | | | mathematics | optimization | | algorithms | | algorithms | | probability | | probability | | Markov chains | | Markov chains | | optimal control | optimal control | stochastic control | stochastic control | mathematics | mathematics | optimization | optimization | algorithms | algorithms | probability | probability | Markov chains | Markov chainsLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata12.215 Modern Navigation (MIT) 12.215 Modern Navigation (MIT)

Description

The development of the Global Positioning System (GPS) started in the 1960s, and the system became operational in 1992. The system has seen many diverse applications develop in the last few years with the accuracy of positioning ranging from 100 meters (the civilian restricted accuracy requirement) to 1 millimeter (without the need for a security clearance!) In this course we will apply many of basic principles of science and mathematics learnt at MIT to explore the applications and principles of GPS. We also use GPS and other equipment in the class (and outside on Campus) to demonstrate the uses of this system.Technical RequirementsAny number of development tools can be used to compile and run the .f files found on this course site. Please refer to the The development of the Global Positioning System (GPS) started in the 1960s, and the system became operational in 1992. The system has seen many diverse applications develop in the last few years with the accuracy of positioning ranging from 100 meters (the civilian restricted accuracy requirement) to 1 millimeter (without the need for a security clearance!) In this course we will apply many of basic principles of science and mathematics learnt at MIT to explore the applications and principles of GPS. We also use GPS and other equipment in the class (and outside on Campus) to demonstrate the uses of this system.Technical RequirementsAny number of development tools can be used to compile and run the .f files found on this course site. Please refer to theSubjects

Global Positioning | Global Positioning | Global Positioning System | Global Positioning System | GPScivilian restricted accuracy requirment | GPScivilian restricted accuracy requirment | basic principles | basic principles | science | science | mathematics | mathematics | GPS | GPS | navigation | navigation | accuracy | accuracy | civilian | civilian | application | application | coordinate systems | coordinate systems | lattitude | lattitude | longitude | longitude | deformable | deformable | Earth | Earth | estimation | estimation | aircraft | aircraft | stochastic | stochastic | mathematical | mathematical | models | models | statistics | statistics | dynamic systems | dynamic systems | pseudorange | pseudorange | phase measurements | phase measurements | celestial | celestial | sattelite | sattelite | astronomical observations | astronomical observations | radio | radio | ship | ship | automobile | automobileLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata11.125 Exploring K-12 Clasroom Teaching (MIT) 11.125 Exploring K-12 Clasroom Teaching (MIT)

Description

Subject uses K-12 classroom experiences, along with student-centered classroom activities and student-led classes, to explore issues in schools and education. Students in this course spend time each week observing pre-college math and science classes. Topics of study include design and implementation of curriculum, addressing the needs of a diversity of students, standards in math and science, student misconceptions, methods of instruction, the digital divide, teaching through different media, and student assessment. Subject uses K-12 classroom experiences, along with student-centered classroom activities and student-led classes, to explore issues in schools and education. Students in this course spend time each week observing pre-college math and science classes. Topics of study include design and implementation of curriculum, addressing the needs of a diversity of students, standards in math and science, student misconceptions, methods of instruction, the digital divide, teaching through different media, and student assessment.Subjects

classroom experiences | classroom experiences | student-centered classroom activities | student-centered classroom activities | student-led classes | student-led classes | issues in schools and education | issues in schools and education | observing | observing | pre-college math and science classes | pre-college math and science classes | design and implementation of curriculum | design and implementation of curriculum | diversity | diversity | standards in math and science | standards in math and science | student misconceptions | student misconceptions | methods of instruction | methods of instruction | the digital divide | the digital divide | teaching through different media | teaching through different media | student assessment | student assessmentLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allarchivedcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

An intriguing biographical exploration of Lewis Carroll, focusing on the author's mathematical career and influences. Wales; http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Subjects

alice in wonderland | looking glass | alice | maths | Lewis Carroll | wonderland | mathematics | numberland | alice in wonderland | looking glass | alice | maths | Lewis Carroll | wonderland | mathematics | numberland | 2009-09-26License

http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Site sourced from

http://mediapub.it.ox.ac.uk/feeds/129169/audio.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

An intriguing biographical exploration of Lewis Carroll, focusing on the author's mathematical career and influences. Wales; http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Subjects

alice in wonderland | looking glass | alice | maths | Lewis Carroll | wonderland | mathematics | numberland | alice in wonderland | looking glass | alice | maths | Lewis Carroll | wonderland | mathematics | numberland | 2009-09-26License

http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Site sourced from

http://mediapub.it.ox.ac.uk/feeds/129169/video.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.042J Mathematics for Computer Science (MIT) 6.042J Mathematics for Computer Science (MIT)

Description

This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds: Fundamental Concepts of Mathematics: Definitions, Proofs, Sets, Functions, Relations Discrete Structures: Modular Arithmetic, Graphs, State Machines, Counting Discrete Probability Theory A version of this course from a previous term was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5512 (Mathematics for Computer Science). This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds: Fundamental Concepts of Mathematics: Definitions, Proofs, Sets, Functions, Relations Discrete Structures: Modular Arithmetic, Graphs, State Machines, Counting Discrete Probability Theory A version of this course from a previous term was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5512 (Mathematics for Computer Science).Subjects

mathematical definitions | mathematical definitions | proofs and applicable methods | proofs and applicable methods | formal logic notation | formal logic notation | proof methods | proof methods | induction | induction | well-ordering | well-ordering | sets | sets | relations | relations | elementary graph theory | elementary graph theory | integer congruences | integer congruences | asymptotic notation and growth of functions | asymptotic notation and growth of functions | permutations and combinations | counting principles | permutations and combinations | counting principles | discrete probability | discrete probability | recursive definition | recursive definition | structural induction | structural induction | state machines and invariants | state machines and invariants | recurrences | recurrences | generating functions | generating functions | permutations and combinations | permutations and combinations | counting principles | counting principles | discrete mathematics | discrete mathematics | computer science | computer scienceLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.042J Mathematics for Computer Science (MIT) 6.042J Mathematics for Computer Science (MIT)

Description

This course is offered to undergraduates and is an elementary discrete mathematics course oriented towards applications in computer science and engineering. Topics covered include: formal logic notation, induction, sets and relations, permutations and combinations, counting principles, and discrete probability. This course is offered to undergraduates and is an elementary discrete mathematics course oriented towards applications in computer science and engineering. Topics covered include: formal logic notation, induction, sets and relations, permutations and combinations, counting principles, and discrete probability.Subjects

Elementary discrete mathematics for computer science and engineering | Elementary discrete mathematics for computer science and engineering | mathematical definitions | mathematical definitions | proofs and applicable methods | proofs and applicable methods | formal logic notation | formal logic notation | proof methods | proof methods | induction | induction | well-ordering | well-ordering | sets | sets | relations | relations | elementary graph theory | elementary graph theory | integer congruences | integer congruences | asymptotic notation and growth of functions | asymptotic notation and growth of functions | permutations and combinations | permutations and combinations | counting principles | counting principles | discrete probability | discrete probability | recursive definition | recursive definition | structural induction | structural induction | state machines and invariants | state machines and invariants | recurrences | recurrences | generating functions | generating functions | 6.042 | 6.042 | 18.062 | 18.062License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-6.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

This class uses K-12 classroom experiences, along with student-centered classroom activities and student-led classes, to explore issues in schools and education. Students in this course spend time each week observing pre-college math and science classes. Topics of study include design and implementation of curriculum, addressing the needs of a diversity of students, standards in math and science, student misconceptions, methods of instruction, the digital divide, teaching through different media, and student assessment. This class uses K-12 classroom experiences, along with student-centered classroom activities and student-led classes, to explore issues in schools and education. Students in this course spend time each week observing pre-college math and science classes. Topics of study include design and implementation of curriculum, addressing the needs of a diversity of students, standards in math and science, student misconceptions, methods of instruction, the digital divide, teaching through different media, and student assessment.Subjects

classroom experiences | classroom experiences | student-centered classroom activities | student-centered classroom activities | student-led classes | student-led classes | issues in schools and education | issues in schools and education | observing | observing | pre-college math and science classes | pre-college math and science classes | design and implementation of curriculum | design and implementation of curriculum | diversity | diversity | standards in math and science | standards in math and science | student misconceptions | student misconceptions | methods of instruction | methods of instruction | the digital divide | the digital divide | teaching through different media | teaching through different media | student assessment | student assessmentLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses-11.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadataDescription

A presentation of the fundamentals of modern numerical techniques for a wide range of linear and nonlinear elliptic, parabolic and hyperbolic partial differential equations and integral equations central to a wide variety of applications in science, engineering, and other fields. Topics include: Mathematical Formulations; Finite Difference and Finite Volume Discretizations; Finite Element Discretizations; Boundary Element Discretizations; Direct and Iterative Solution Methods.This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5212 (Numerical Methods for Partial Differential Equations). A presentation of the fundamentals of modern numerical techniques for a wide range of linear and nonlinear elliptic, parabolic and hyperbolic partial differential equations and integral equations central to a wide variety of applications in science, engineering, and other fields. Topics include: Mathematical Formulations; Finite Difference and Finite Volume Discretizations; Finite Element Discretizations; Boundary Element Discretizations; Direct and Iterative Solution Methods.This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5212 (Numerical Methods for Partial Differential Equations).Subjects

numerical methods | numerical methods | differential equations | differential equations | linear | linear | nonlinear | nonlinear | elliptic | elliptic | parabolic | parabolic | hyperbolic | hyperbolic | partial differential equations | partial differential equations | integral equations | integral equations | mathematical formulations | mathematical formulations | mathematics | mathematics | finite difference | finite difference | finite volume | finite volume | discretisation | discretisation | finite element | finite element | boundary element | boundary element | iteration | iteration | 16.920 | 16.920 | 2.097 | 2.097 | 6.339 | 6.339License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.100A Introduction to Analysis (MIT) 18.100A Introduction to Analysis (MIT)

Description

Analysis I (18.100) in its various versions covers fundamentals of mathematical analysis: continuity, differentiability, some form of the Riemann integral, sequences and series of numbers and functions, uniform convergence with applications to interchange of limit operations, some point-set topology, including some work in Euclidean n-space. MIT students may choose to take one of three versions of 18.100: Option A (18.100A) chooses less abstract definitions and proofs, and gives applications where possible. Option B (18.100B) is more demanding and for students with more mathematical maturity; it places more emphasis from the beginning on point-set topology and n-space, whereas Option A is concerned primarily with analysis on the real line, saving for the last weeks work in 2-space (the pla Analysis I (18.100) in its various versions covers fundamentals of mathematical analysis: continuity, differentiability, some form of the Riemann integral, sequences and series of numbers and functions, uniform convergence with applications to interchange of limit operations, some point-set topology, including some work in Euclidean n-space. MIT students may choose to take one of three versions of 18.100: Option A (18.100A) chooses less abstract definitions and proofs, and gives applications where possible. Option B (18.100B) is more demanding and for students with more mathematical maturity; it places more emphasis from the beginning on point-set topology and n-space, whereas Option A is concerned primarily with analysis on the real line, saving for the last weeks work in 2-space (the plaSubjects

mathematical analysis | mathematical analysis | estimations | estimations | limit of a sequence | limit of a sequence | limit theorems | limit theorems | subsequences | subsequences | cluster points | cluster points | infinite series | infinite series | power series | power series | local and global properties | local and global properties | continuity | continuity | intermediate-value theorem | intermediate-value theorem | convexity | convexity | integrability | integrability | Riemann integral | Riemann integral | calculus | calculus | convergence | convergence | Gamma function | Gamma function | Stirling | Stirling | quantifiers and negation | quantifiers and negation | Leibniz | Leibniz | Fubini | Fubini | improper integrals | improper integrals | Lebesgue integral | Lebesgue integral | mathematical proofs | mathematical proofs | differentiation | differentiation | integration | integrationLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.904 Seminar in Topology (MIT) 18.904 Seminar in Topology (MIT)

Description

This course is a seminar in topology. The main mathematical goal is to learn about the fundamental group, homology and cohomology. The main non-mathematical goal is to obtain experience giving math talks. This course is a seminar in topology. The main mathematical goal is to learn about the fundamental group, homology and cohomology. The main non-mathematical goal is to obtain experience giving math talks.Subjects

student lectures | student lectures | math writing | math writing | topology | topology | fundamental group | fundamental group | covering spaces | covering spaces | communication | communication | oral communication | oral communication | mathematical writing | mathematical writingLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.091 Mathematical Exposition (MIT) 18.091 Mathematical Exposition (MIT)

Description

This course provides techniques of effective presentation of mathematical material. Each section of this course is associated with a regular mathematics subject, and uses the material of that subject as a basis for written and oral presentations. The section presented here is on chaotic dynamical systems. This course provides techniques of effective presentation of mathematical material. Each section of this course is associated with a regular mathematics subject, and uses the material of that subject as a basis for written and oral presentations. The section presented here is on chaotic dynamical systems.Subjects

oral presentation | oral presentation | mathematics writing | mathematics writing | mathematics presentation | mathematics presentation | 17.881 | 17.881 | 17.882 | 17.882License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata18.238 Geometry and Quantum Field Theory (MIT) 18.238 Geometry and Quantum Field Theory (MIT)

Description

Geometry and Quantum Field Theory, designed for mathematicians, is a rigorous introduction to perturbative quantum field theory, using the language of functional integrals. It covers the basics of classical field theory, free quantum theories and Feynman diagrams. The goal is to discuss, using mathematical language, a number of basic notions and results of QFT that are necessary to understand talks and papers in QFT and String Theory. Geometry and Quantum Field Theory, designed for mathematicians, is a rigorous introduction to perturbative quantum field theory, using the language of functional integrals. It covers the basics of classical field theory, free quantum theories and Feynman diagrams. The goal is to discuss, using mathematical language, a number of basic notions and results of QFT that are necessary to understand talks and papers in QFT and String Theory.Subjects

perturbative quantum field theory | perturbative quantum field theory | classical field theory | classical field theory | free quantum theories | free quantum theories | Feynman diagrams | Feynman diagrams | Renormalization theory | Renormalization theory | Local operators | Local operators | Operator product expansion | Operator product expansion | Renormalization group equation | Renormalization group equation | classical | classical | field | field | theory | theory | Feynman | Feynman | diagrams | diagrams | free | free | quantum | quantum | theories | theories | local | local | operators | operators | product | product | expansion | expansion | perturbative | perturbative | renormalization | renormalization | group | group | equations | equations | functional | functional | function | function | intergrals | intergrals | operator | operator | QFT | QFT | string | string | physics | physics | mathematics | mathematics | geometry | geometry | geometric | geometric | algebraic | algebraic | topology | topology | number | number | 0-dimensional | 0-dimensional | 1-dimensional | 1-dimensional | d-dimensional | d-dimensional | supergeometry | supergeometry | supersymmetry | supersymmetry | conformal | conformal | stationary | stationary | phase | phase | formula | formula | calculus | calculus | combinatorics | combinatorics | matrix | matrix | mechanics | mechanics | lagrangians | lagrangians | hamiltons | hamiltons | least | least | action | action | principle | principle | limits | limits | formalism | formalism | Feynman-Kac | Feynman-Kac | current | current | charges | charges | Noether?s | Noether?s | theorem | theorem | path | path | integral | integral | approach | approach | divergences | divergences | functional integrals | functional integrals | fee quantum theories | fee quantum theories | renormalization theory | renormalization theory | local operators | local operators | operator product expansion | operator product expansion | renormalization group equation | renormalization group equation | mathematical language | mathematical language | string theory | string theory | 0-dimensional QFT | 0-dimensional QFT | Stationary Phase Formula | Stationary Phase Formula | Matrix Models | Matrix Models | Large N Limits | Large N Limits | 1-dimensional QFT | 1-dimensional QFT | Classical Mechanics | Classical Mechanics | Least Action Principle | Least Action Principle | Path Integral Approach | Path Integral Approach | Quantum Mechanics | Quantum Mechanics | Perturbative Expansion using Feynman Diagrams | Perturbative Expansion using Feynman Diagrams | Operator Formalism | Operator Formalism | Feynman-Kac Formula | Feynman-Kac Formula | d-dimensional QFT | d-dimensional QFT | Formalism of Classical Field Theory | Formalism of Classical Field Theory | Currents | Currents | Noether?s Theorem | Noether?s Theorem | Path Integral Approach to QFT | Path Integral Approach to QFT | Perturbative Expansion | Perturbative Expansion | Renormalization Theory | Renormalization Theory | Conformal Field Theory | Conformal Field Theory | algebraic topology | algebraic topology | algebraic geometry | algebraic geometry | number theory | number theoryLicense

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allcourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata6.042J Mathematics for Computer Science (MIT) 6.042J Mathematics for Computer Science (MIT)

Description

This course is offered to undergraduates and is an elementary discrete mathematics course oriented towards applications in computer science and engineering. Topics covered include: formal logic notation, induction, sets and relations, permutations and combinations, counting principles, and discrete probability. This course is offered to undergraduates and is an elementary discrete mathematics course oriented towards applications in computer science and engineering. Topics covered include: formal logic notation, induction, sets and relations, permutations and combinations, counting principles, and discrete probability.Subjects

Elementary discrete mathematics for computer science and engineering | Elementary discrete mathematics for computer science and engineering | mathematical definitions | mathematical definitions | proofs and applicable methods | proofs and applicable methods | formal logic notation | formal logic notation | proof methods | proof methods | induction | induction | well-ordering | well-ordering | sets | sets | relations | relations | elementary graph theory | elementary graph theory | integer congruences | integer congruences | asymptotic notation and growth of functions | asymptotic notation and growth of functions | permutations and combinations | permutations and combinations | counting principles | counting principles | discrete probability | discrete probability | recursive definition | recursive definition | structural induction | structural induction | state machines and invariants | state machines and invariants | recurrences | recurrences | generating functions | generating functions | 6.042 | 6.042 | 18.062 | 18.062License

Content within individual OCW courses is (c) by the individual authors unless otherwise noted. MIT OpenCourseWare materials are licensed by the Massachusetts Institute of Technology under a Creative Commons License (Attribution-NonCommercial-ShareAlike). For further information see http://ocw.mit.edu/terms/index.htmSite sourced from

http://ocw.mit.edu/rss/all/mit-allsimplifiedchinesecourses.xmlAttribution

Click to get HTML | Click to get attribution | Click to get URLAll metadata

See all metadata