Searching for combination : 65 results found | RSS Feed for this search

6.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 metadataDescription

Directed evolution has been used to produce enzymes with many unique properties. The technique of directed evolution comprises two essential steps: mutagenesis of the gene encoding the enzyme to produce a library of variants, and selection of a particular variant based on its desirable catalytic properties. In this course we will examine what kinds of enzymes are worth evolving and the strategies used for library generation and enzyme selection. We will focus on those enzymes that are used in the synthesis of drugs and in biotechnological applications. This course is one of many Advanced Undergraduate Seminars offered by the Biology Department at MIT. These seminars are tailored for students with an interest in using primary research literature to discuss and learn about current Directed evolution has been used to produce enzymes with many unique properties. The technique of directed evolution comprises two essential steps: mutagenesis of the gene encoding the enzyme to produce a library of variants, and selection of a particular variant based on its desirable catalytic properties. In this course we will examine what kinds of enzymes are worth evolving and the strategies used for library generation and enzyme selection. We will focus on those enzymes that are used in the synthesis of drugs and in biotechnological applications. This course is one of many Advanced Undergraduate Seminars offered by the Biology Department at MIT. These seminars are tailored for students with an interest in using primary research literature to discuss and learn about currentSubjects

evolution | evolution | biocatalyst | biocatalyst | mutation | mutation | library | library | recombination | recombination | directed evolution | directed evolution | enzyme | enzyme | point mutation | point mutation | mutagenesis | mutagenesis | DNA | DNA | gene | gene | complementation | complementation | affinity | affinity | phage | phage | ribosome display | ribosome display | yeast surface display | yeast surface display | bacterial cell surface display | bacterial cell surface display | IVC | IVC | FACS | FACS | active site | active siteLicense

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-7.xmlAttribution

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

See all metadata6.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).Subjects

mathematical definitions | proofs and applicable methods | formal logic notation | proof methods | induction | well-ordering | sets | relations | elementary graph theory | integer congruences | asymptotic notation and growth of functions | permutations and combinations | counting principles | discrete probability | recursive definition | structural induction | state machines and invariants | recurrences | generating functions | permutations and combinations | counting principles | discrete mathematics | 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 https://ocw.mit.edu/terms/index.htmSite sourced from

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

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

See all metadata7.28 Molecular Biology (MIT) 7.28 Molecular Biology (MIT)

Description

This course covers a detailed analysis of the biochemical mechanisms that control the maintenance, expression, and evolution of prokaryotic and eukaryotic genomes. The topics covered in lectures and readings of relevant literature include gene regulation, DNA replication, genetic recombination, and mRNA translation. In particular, the logic of experimental design and data analysis is emphasized. This course covers a detailed analysis of the biochemical mechanisms that control the maintenance, expression, and evolution of prokaryotic and eukaryotic genomes. The topics covered in lectures and readings of relevant literature include gene regulation, DNA replication, genetic recombination, and mRNA translation. In particular, the logic of experimental design and data analysis is emphasized.Subjects

molecular biology | molecular biology | biochemical mechanisms | biochemical mechanisms | gene expression | gene expression | evolution | evolution | prokaryotic genome | prokaryotic genome | eukaryotic genomes | eukaryotic genomes | gene regulation | gene regulation | DNA replication | DNA replication | genetic recombination | genetic recombination | RNA processing | RNA processing | translation | translation | genome | genomeLicense

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

Includes audio/video content: AV lectures. This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. The subject coverage divides roughly into thirds: Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations. Discrete structures: graphs, state machines, modular arithmetic, counting. Discrete probability theory. On completion of 6.042J, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.Interactive site components can be found on the Unit pages in the Includes audio/video content: AV lectures. This subject offers an interactive introduction to discrete mathematics oriented toward computer science and engineering. The subject coverage divides roughly into thirds: Fundamental concepts of mathematics: Definitions, proofs, sets, functions, relations. Discrete structures: graphs, state machines, modular arithmetic, counting. Discrete probability theory. On completion of 6.042J, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in computer science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.Interactive site components can be found on the Unit pages in theSubjects

6.042 | 6.042 | 18.062 | 18.062 | formal logic notation | formal logic notation | proof methods | proof methods | induction | induction | sets | sets | relations | relations | graph theory | graph theory | integer congruences | integer congruences | asymptotic notation | asymptotic notation | growth of functions | growth of functions | permutations | permutations | combinations | combinations | counting | counting | discrete probability | discrete probabilityLicense

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-allavcourses.xmlAttribution

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

See all metadataDescription

The course is an introduction to the approach of Reflective Practice developed by Donald Schön. It is an approach that enables professionals to understand how they use their knowledge in practical situations and how they can combine practice and learning in a more effective way. Through greater awareness of how they deploy their knowledge in practical situations, professionals can increase their capacities of learning in a more timely way. Understanding how they frame situations and ideas helps professionals to achieve greater flexibility and increase their capacity of conceptual innovation. The objective of the course is to introduce students to the approach and methods of reflective practice by raising their awareness about their own cognitive resources and how they use them in thei The course is an introduction to the approach of Reflective Practice developed by Donald Schön. It is an approach that enables professionals to understand how they use their knowledge in practical situations and how they can combine practice and learning in a more effective way. Through greater awareness of how they deploy their knowledge in practical situations, professionals can increase their capacities of learning in a more timely way. Understanding how they frame situations and ideas helps professionals to achieve greater flexibility and increase their capacity of conceptual innovation. The objective of the course is to introduce students to the approach and methods of reflective practice by raising their awareness about their own cognitive resources and how they use them in theiSubjects

reflective practice | Donald Schon | Chris Argyris | conceptual innovation | knowledge generation | espoused theory | theory in use | reflection | tacit knowledge | explicit knowledge | learning cycles | reframing | conceptual frameworks | critical moments | experimentation | speculation | modeling | dialogue | theories | action | thinking | virtual worlds | mental model | framing | justice | equality | power | assumptions | intractable controversies | reflective practice | Donald Schon | Chris Argyris | conceptual innovation | knowledge generation | espoused theory | theory in use | reflection | tacit knowledge | explicit knowledge | learning cycles | reframing | conceptual frameworks | critical moments | experimentation | speculation | modeling | dialogue | theories | action | thinking | virtual worlds | mental model | framing | justice | equality | power | assumptions | intractable controversies | diagrams | diagrams | reflective practice | reflective practice | Donald Schon | Donald Schon | practice | practice | learning | learning | conceptual innovation | conceptual innovation | cognitive resources | cognitive resources | socialization | socialization | externalization | externalization | combination | combination | internalization | internalization | SECI Cycle of Knowledge | SECI Cycle of KnowledgeLicense

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 metadata6.004 Computation Structures (MIT) 6.004 Computation Structures (MIT)

Description

6.004 offers an introduction to the engineering of digital systems. Starting with MOS transistors, the course develops a series of building blocks - logic gates, combinational and sequential circuits, finite-state machines, computers and finally complete systems. Both hardware and software mechanisms are explored through a series of design examples.6.004 is required material for any EECS undergraduate who wants to understand (and ultimately design) digital systems. A good grasp of the material is essential for later courses in digital design, computer architecture and systems. Before taking 6.004, students should feel comfortable using computers; a rudimentary knowledge of programming language concepts (6.001) and electrical fundamentals (6.002) is assumed. 6.004 offers an introduction to the engineering of digital systems. Starting with MOS transistors, the course develops a series of building blocks - logic gates, combinational and sequential circuits, finite-state machines, computers and finally complete systems. Both hardware and software mechanisms are explored through a series of design examples.6.004 is required material for any EECS undergraduate who wants to understand (and ultimately design) digital systems. A good grasp of the material is essential for later courses in digital design, computer architecture and systems. Before taking 6.004, students should feel comfortable using computers; a rudimentary knowledge of programming language concepts (6.001) and electrical fundamentals (6.002) is assumed.Subjects

computation | computation | computation structure | computation structure | primitives | primitives | gates | gates | nstructions | nstructions | procedures | procedures | processes | processes | concurrency | concurrency | instruction set design | instruction set design | software structure | software structure | digital system | digital system | MOS transistor | MOS transistor | logic gate | logic gate | combinational circuit | combinational circuit | sequential circuit | | sequential circuit | | finite-state machines | finite-state machines | sequential circuit | sequential circuit | computer architecture | computer architecture | programming | programming | RISC processor | RISC processor | instructions | instructionsLicense

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 metadata8.902 Astrophysics II (MIT) 8.902 Astrophysics II (MIT)

Description

This is the second course in a two-semester sequence on astrophysics. Topics include galactic dynamics, groups and clusters on galaxies, phenomenological cosmology, Newtonian cosmology, Roberston-Walker models, and galaxy formation. This is the second course in a two-semester sequence on astrophysics. Topics include galactic dynamics, groups and clusters on galaxies, phenomenological cosmology, Newtonian cosmology, Roberston-Walker models, and galaxy formation.Subjects

Galactic dynamics | Galactic dynamics | potential theory | potential theory | orbits | orbits | collisionless Boltzmann equations | collisionless Boltzmann equations | Galaxy interactions | Galaxy interactions | Groups and clusters | Groups and clusters | dark matter | dark matter | Intergalactic medium | Intergalactic medium | x-ray clusters | x-ray clusters | Active galactic nuclei | Active galactic nuclei | unified models | unified models | black hole accretion | black hole accretion | radio and optical jets | radio and optical jets | Homogeneity and isotropy | Homogeneity and isotropy | redshift | redshift | galaxy distance ladder | galaxy distance ladder | Newtonian cosmology | Newtonian cosmology | Roberston-Walker models and cosmography | Roberston-Walker models and cosmography | Early universe | Early universe | primordial nucleosynthesis | primordial nucleosynthesis | recombination | recombination | Cosmic microwave background radiation | Cosmic microwave background radiation | Large-scale structure | Large-scale structure | galaxy formation | galaxy formationLicense

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)

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).Subjects

mathematical definitions | proofs and applicable methods | formal logic notation | proof methods | induction | well-ordering | sets | relations | elementary graph theory | integer congruences | asymptotic notation and growth of functions | permutations and combinations | counting principles | discrete probability | recursive definition | structural induction | state machines and invariants | recurrences | generating functions | permutations and combinations | counting principles | discrete mathematics | 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 https://ocw.mit.edu/terms/index.htmSite sourced from

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

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

See all metadata6.004 Computation Structures (MIT) 6.004 Computation Structures (MIT)

Description

6.004 offers an introduction to the engineering of digital systems. Starting with MOS transistors, the course develops a series of building blocks — logic gates, combinational and sequential circuits, finite-state machines, computers and finally complete systems. Both hardware and software mechanisms are explored through a series of design examples. 6.004 is required material for any EECS undergraduate who wants to understand (and ultimately design) digital systems. A good grasp of the material is essential for later courses in digital design, computer architecture and systems. The problem sets and lab exercises are intended to give students "hands-on" experience in designing digital systems; each student completes a gate-level design for a reduced instruction set computer 6.004 offers an introduction to the engineering of digital systems. Starting with MOS transistors, the course develops a series of building blocks — logic gates, combinational and sequential circuits, finite-state machines, computers and finally complete systems. Both hardware and software mechanisms are explored through a series of design examples. 6.004 is required material for any EECS undergraduate who wants to understand (and ultimately design) digital systems. A good grasp of the material is essential for later courses in digital design, computer architecture and systems. The problem sets and lab exercises are intended to give students "hands-on" experience in designing digital systems; each student completes a gate-level design for a reduced instruction set computerSubjects

computation | computation | computation structure | computation structure | primitives | primitives | gates | gates | instructions | instructions | procedures | procedures | processes | processes | concurrency | concurrency | instruction set design | instruction set design | software structure | software structure | digital system | digital system | MOS transistor | MOS transistor | logic gate | logic gate | combinational circuit | combinational circuit | sequential circuit | sequential circuit | finite-state machines | finite-state machines | computer architecture | computer architecture | programming | programming | RISC processor | RISC processorLicense

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 metadata7.03 Genetics (MIT) 7.03 Genetics (MIT)

Description

The principles of genetics with application to the study of biological function at the level of molecules, cells, and multicellular organisms, including humans. Structure and function of genes, chromosomes and genomes. Biological variation resulting from recombination, mutation, and selection. Population genetics. Use of genetic methods to analyze protein function, gene regulation and inherited disease. The principles of genetics with application to the study of biological function at the level of molecules, cells, and multicellular organisms, including humans. Structure and function of genes, chromosomes and genomes. Biological variation resulting from recombination, mutation, and selection. Population genetics. Use of genetic methods to analyze protein function, gene regulation and inherited disease.Subjects

Population genetics | Population genetics | selection | selection | mutation | mutation | recombination | recombination | genomes | genomes | chromosomes | chromosomes | genes | genesLicense

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 metadata7.28 Molecular Biology (MIT) 7.28 Molecular Biology (MIT)

Description

Molecular Biology - Detailed analysis of the biochemical mechanisms that control the maintenance, expression and evolution of prokaryotic and eukaryotic genomes.Topics covered in 7.28 lectures and readings of primary literature include:DNA replication,DNA repair,genetic recombination,gene expression,RNA processing, andtranslation.The logic of experimental design and data analysis is emphasized. Presentations include lectures, reading assignments and group discussions. Writing assignments, Problem Sets (ungraded) and review sessions also contribute to the course content. Molecular Biology - Detailed analysis of the biochemical mechanisms that control the maintenance, expression and evolution of prokaryotic and eukaryotic genomes.Topics covered in 7.28 lectures and readings of primary literature include:DNA replication,DNA repair,genetic recombination,gene expression,RNA processing, andtranslation.The logic of experimental design and data analysis is emphasized. Presentations include lectures, reading assignments and group discussions. Writing assignments, Problem Sets (ungraded) and review sessions also contribute to the course content.Subjects

genetic recombination | genetic recombination | DNA replication | DNA replication | gene regulation | gene regulation | molecules | moleculesLicense

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 main objective of this course is to give broad insight into the different facets of transportation systems, while providing a solid introduction to transportation demand and cost analyses. As part of the core in the Master of Science in Transportation program, the course will not focus on a specific transportation mode but will use the various modes to apply the theoretical and analytical concepts presented in the lectures and readings. Introduces transportation systems analysis, stressing demand and economic aspects. Covers the key principles governing transportation planning, investment, operations and maintenance. Introduces the microeconomic concepts central to transportation systems. Topics covered include economic theories of the firm, the consumer, and the market, demand models, The main objective of this course is to give broad insight into the different facets of transportation systems, while providing a solid introduction to transportation demand and cost analyses. As part of the core in the Master of Science in Transportation program, the course will not focus on a specific transportation mode but will use the various modes to apply the theoretical and analytical concepts presented in the lectures and readings. Introduces transportation systems analysis, stressing demand and economic aspects. Covers the key principles governing transportation planning, investment, operations and maintenance. Introduces the microeconomic concepts central to transportation systems. Topics covered include economic theories of the firm, the consumer, and the market, demand models,Subjects

1.201 | 1.201 | 11.545 | 11.545 | ESD.210 | ESD.210 | transportation | transportation | travel demand | travel demand | organizational models | organizational models | consumer theory | consumer theory | project finance | project finance | intelligent transportation systems | intelligent transportation systems | project evaluation | project evaluation | demand modelling | demand modelling | technology | technology | environmental | environmental | energy | energy | economic development | economic development | sustainability | sustainability | urban structure | urban structure | land use | land use | equity | equity | transportation components | transportation components | intermodal combinations | intermodal combinations | quantitative modeling | quantitative modeling | strategic regional planning | strategic regional planning | institutional change analysis | institutional change analysis | large-scale systems | large-scale systemsLicense

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-transportation.xmlAttribution

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

See all metadataDescription

Professor Peter Donnelly tells us how genetics helps us to understand common diseases and develop new drugs. Understanding which variations in our DNA affect susceptibility to diseases can provide new insights into the disease process and lead to new treatments. Professor Peter Donnelly leads large collaborative human genetic studies, and his group develops and applies statistical methods to extract maximal information from the large datasets generated by genomic studies. Wales; http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Subjects

recombination | genome-wide association study (GWAS) | Statistical Genetics | population genetics | recombination | genome-wide association study (GWAS) | Statistical Genetics | population geneticsLicense

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

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

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

See all metadataDescription

1.201J/11.545J/ESD.210J is required for all first-year Master of Science in Transportation students. It would be of interest to, as well as accessible to, students in Urban Studies and Planning, Political Science, Technology and Policy, Management, and various engineering departments. It is a good subject for those who plan to take only one subject in transportation and serves as an entry point to other transportation subjects as well. The subject focuses on fundamental principles of transportation systems, introduces transportation systems components and networks, and addresses how one invests in and operates them effectively. The tie between transportation and related systems is emphasized. 1.201J/11.545J/ESD.210J is required for all first-year Master of Science in Transportation students. It would be of interest to, as well as accessible to, students in Urban Studies and Planning, Political Science, Technology and Policy, Management, and various engineering departments. It is a good subject for those who plan to take only one subject in transportation and serves as an entry point to other transportation subjects as well. The subject focuses on fundamental principles of transportation systems, introduces transportation systems components and networks, and addresses how one invests in and operates them effectively. The tie between transportation and related systems is emphasized.Subjects

1.201 | 1.201 | 11.545 | 11.545 | ESD.210 | ESD.210 | transportation | technology | environmental | energy | economic development | sustainability | urban structure | land use | equity | transportation components | modes | intermodal combinations | quantitative modeling | strategic regional planning | institutional change analysis | CLIOS | large-scale systems | transportation | technology | environmental | energy | economic development | sustainability | urban structure | land use | equity | transportation components | modes | intermodal combinations | quantitative modeling | strategic regional planning | institutional change analysis | CLIOS | large-scale systemsLicense

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-transportation.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

6.111 covers digital design topics such as digital logic, flipflops, PALs, CPLDs, FPGAs, counters, timing, synchronization, and finite-state machines. 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, and graphics. The course relies on extensive use of Verilog® for describing and implementing digital logic designs. 6.111 covers digital design topics such as digital logic, flipflops, PALs, CPLDs, FPGAs, counters, timing, synchronization, and finite-state machines. 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, and graphics. The course relies on extensive use of Verilog® for describing and implementing digital logic designs.Subjects

digital systems laboratory | digital systems laboratory | laboratory | laboratory | digital logic | digital logic | Boolean algebra | Boolean algebra | flip-flops | flip-flops | finite-state machines | finite-state machines | FSM | FSM | microprogrammed systems | microprogrammed systems | digital abstractions | digital abstractions | digital paradigm | digital paradigm | digital oscilloscopes | digital oscilloscopes | PAL | PAL | PROM | PROM | VHDL | VHDL | digital circuit design | digital circuit design | FPGA | FPGA | counters | counters | timing | timing | synchronization | synchronization | digital filters | digital filters | wireless communications | wireless communications | verilog | verilog | combinational logic | combinational logic | simple sequential circuits | simple sequential circuits | memories | memories | configurable logic | configurable logicLicense

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.864 Inference from Data and Models (MIT) 12.864 Inference from Data and Models (MIT)

Description

The course is directed at making scientifically sensible deductions from the combination of observations with dynamics and kinematics represented, generically, as "models". There are two overlapping central themesLinear "inverse" methods and data "assimilation" including regression, singular value decomposition, objective mapping, non-stationary models and data, Kalman filters, adjoint methods ("assimilation") etc.Standard time series analysis, including basic statistics, Fourier methods, spectra, coherence, filtering, etc. The course is directed at making scientifically sensible deductions from the combination of observations with dynamics and kinematics represented, generically, as "models". There are two overlapping central themesLinear "inverse" methods and data "assimilation" including regression, singular value decomposition, objective mapping, non-stationary models and data, Kalman filters, adjoint methods ("assimilation") etc.Standard time series analysis, including basic statistics, Fourier methods, spectra, coherence, filtering, etc.Subjects

kinematical and dynamical models | kinematical and dynamical models | Basic statistics | Basic statistics | linear algebra | linear algebra | inverse methods | inverse methods | singular value decompositions | singular value decompositions | control theory | control theory | sequential estimation | sequential estimation | Kalman filters | Kalman filters | smoothing algorithms | smoothing algorithms | adjoint/Pontryagin principle methods | adjoint/Pontryagin principle methods | model testing | model testing | stationary processes | stationary processes | Fourier methods | Fourier methods | z-transforms | z-transforms | sampling theorems | sampling theorems | spectra | spectra | multi-taper methods | multi-taper methods | coherences | coherences | filtering | filtering | quantitative combinations of models | quantitative combinations of modelsLicense

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 metadata7.345 The Science of Sperm (MIT) 7.345 The Science of Sperm (MIT)

Description

Sperm are tiny, haploid cells with a supremely important job: They deliver the paternal genome to the egg, helping create a zygote that develops into a new individual. For a human male, however, only a small fraction of the sperm produced will ever fertilize an egg. Sperm thus experience intense selective pressure: They must compete against each other, navigate a foreign environment in the female reproductive tract, and interact specifically and appropriately with the surface of the egg. These selective pressures can drive extreme changes in morphology and gene function over short evolutionary time scales, resulting in amazing diversity among species. In this course, we will explore the ways in which these unique evolutionary forces contribute to incredible specializations of sperm form an Sperm are tiny, haploid cells with a supremely important job: They deliver the paternal genome to the egg, helping create a zygote that develops into a new individual. For a human male, however, only a small fraction of the sperm produced will ever fertilize an egg. Sperm thus experience intense selective pressure: They must compete against each other, navigate a foreign environment in the female reproductive tract, and interact specifically and appropriately with the surface of the egg. These selective pressures can drive extreme changes in morphology and gene function over short evolutionary time scales, resulting in amazing diversity among species. In this course, we will explore the ways in which these unique evolutionary forces contribute to incredible specializations of sperm form anSubjects

sperm | sperm | sperm biology | sperm biology | haploid cells | haploid cells | sperm development | sperm development | selective forces | selective forces | meiotic cell division | meiotic cell division | protamines | protamines | fertilization | fertilization | evolutionary analysis | evolutionary analysis | reproductive biology | reproductive biology | spermatogenesis | spermatogenesis | spermatogenic cycle | spermatogenic cycle | germline mutations | germline mutations | FGFR2 gene | FGFR2 gene | germ line selection | germ line selection | Fragile X syndrome | Fragile X syndrome | Meiotic recombination | Meiotic recombination | sperm bundling | sperm bundling | Sperm Cooperation | Sperm Cooperation | sperm competition | sperm competitionLicense

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-7.xmlAttribution

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

See all metadataDescription

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. 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.Subjects

digital integrated circuit | device | circuit | digital | MOS | digital integrated circuit | device | circuit | digital | MOS | digital integrated circuit | digital integrated circuit | device | device | circuit | circuit | digital | digital | MOS | MOS | Deep Sub-Micron effects | Deep Sub-Micron effects | circuit design | circuit design | logic | logic | interconnect models; parasitics | interconnect models; parasitics | device sizing | device sizing | timing | timing | clock skew | clock skew | jitter; clock distribution techniques | jitter; clock distribution techniques | memory architectures | memory architectures | circuits | circuits | sense amplifiers | sense amplifiers | SPICE | SPICE | HSPICE | HSPICE | Magic | Magic | Nanosim | Nanosim | Avanwaves | Avanwaves | device level optimization | device level optimization | interconnect models | interconnect models | parasitics | parasitics | jitter | jitter | clock distribution techniques | clock distribution techniques | CMOS inverter | CMOS inverter | combinational logic | combinational logic | sequential circuits | sequential circuitsLicense

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

Professor Peter Donnelly tells us how genetics helps us to understand common diseases and develop new drugs. Understanding which variations in our DNA affect susceptibility to diseases can provide new insights into the disease process and lead to new treatments. Professor Peter Donnelly leads large collaborative human genetic studies, and his group develops and applies statistical methods to extract maximal information from the large datasets generated by genomic studies. Wales; http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Subjects

recombination | genome-wide association study (GWAS) | Statistical Genetics | population genetics | recombination | genome-wide association study (GWAS) | Statistical Genetics | population geneticsLicense

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

http://mediapub.it.ox.ac.uk/feeds/129165/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

Includes audio/video content: AV lectures. This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions. Includes audio/video content: AV lectures. This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.Subjects

formal logic notation | formal logic notation | proof methods | proof methods | induction | induction | sets | sets | relations | relations | graph theory | graph theory | integer congruences | integer congruences | asymptotic notation | asymptotic notation | growth of functions | growth of functions | permutations | permutations | combinations | combinations | counting | counting | discrete probability | discrete probabilityLicense

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-allavcourses.xmlAttribution

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

See all metadata12.864 Inference from Data and Models (MIT) 12.864 Inference from Data and Models (MIT)

Description

The course is directed at making scientifically sensible deductions from the combination of observations with dynamics and kinematics represented, generically, as "models". There are two overlapping central themeslinear "inverse" methods and data "assimilation" including regression, singular value decomposition, objective mapping, non-stationary models and data, Kalman filters, adjoint methods ("assimilation") etc.standard time series analysis, including basic statistics, Fourier methods, spectra, coherence, filtering, etc. The course is directed at making scientifically sensible deductions from the combination of observations with dynamics and kinematics represented, generically, as "models". There are two overlapping central themeslinear "inverse" methods and data "assimilation" including regression, singular value decomposition, objective mapping, non-stationary models and data, Kalman filters, adjoint methods ("assimilation") etc.standard time series analysis, including basic statistics, Fourier methods, spectra, coherence, filtering, etc.Subjects

observation | observation | kinematical models | kinematical models | dynamical models | dynamical models | basic statistics | basic statistics | linear algebra | linear algebra | inverse methods | inverse methods | singular value decompositions | singular value decompositions | control theory | control theory | sequential estimation | sequential estimation | Kalman filters | Kalman filters | smoothing algorithms | smoothing algorithms | adjoint/Pontryagin principle methods | adjoint/Pontryagin principle methods | model testing | model testing | stationary processes | stationary processes | Fourier methods | Fourier methods | z-transforms | z-transforms | sampling theorems | sampling theorems | spectra | spectra | multi-taper methods | multi-taper methods | coherences | coherences | filtering | filtering | quantitative combinations | quantitative combinations | realistic observations | realistic observations | data assimilations | data assimilations | deduction | deduction | regression | regression | objective mapping | objective mapping | time series analysis | time series analysis | inference | inferenceLicense

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 metadataIntegrated Circuits and Microelectronics Integrated Circuits and Microelectronics

Description

This course introduces to the students the current integrated circuits tecnologies, mainly for digital devices. During this course it will be studied in detail aspects related with manufacturing, packaging and modern solutions for performance and reliability improvements, as well as a design methodology with the necessary tools for obtaining competitive digital integrated circuits, such as hardware description languages, synthesis tools, design for testability, etc. This course introduces to the students the current integrated circuits tecnologies, mainly for digital devices. During this course it will be studied in detail aspects related with manufacturing, packaging and modern solutions for performance and reliability improvements, as well as a design methodology with the necessary tools for obtaining competitive digital integrated circuits, such as hardware description languages, synthesis tools, design for testability, etc.Subjects

Design of basic combinational circuits | Design of basic combinational circuits | Design simulation | Design simulation | ía Técnica Industrial: Electrónica Industrial | ía Técnica Industrial: Electrónica Industrial | VHDL language | VHDL language | Analysis and design | Analysis and design | Microelectronics | Microelectronics | Design of secuential circuits | Design of secuential circuits | Tecnologia Electronica | Tecnologia Electronica | Manufacturing and packaging | Manufacturing and packaging | Integrated circuits test | Integrated circuits test | 2011 | 2011 | Integrated Circuits | Integrated Circuits | Analog integrated circuits | Analog integrated circuitsLicense

Copyright 2015, UC3M http://creativecommons.org/licenses/by-nc-sa/4.0/Site sourced from

http://ocw.uc3m.es/ocwuniversia/rss_allAttribution

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

See all metadataDigital Electronics Digital Electronics

Description

The basic goal of this subject is to cover an introduction to digital electronics from an updated point of view. To this purpose, the course starts by the fundamentals, i.e., number systems, binary coding and Boolean Algebra. The study of digital circuits begins by logic gates, combinational circuits, including the simplest arithmetic circuits, and ends by sequential circuits, including latches and flip-flops, synchronous sequential circuits, registers and counters. There is one chapter devoted to memories and another one devoted to programmable logic devices. An introduction to digital systems and microprocessors is also included. The basic goal of this subject is to cover an introduction to digital electronics from an updated point of view. To this purpose, the course starts by the fundamentals, i.e., number systems, binary coding and Boolean Algebra. The study of digital circuits begins by logic gates, combinational circuits, including the simplest arithmetic circuits, and ends by sequential circuits, including latches and flip-flops, synchronous sequential circuits, registers and counters. There is one chapter devoted to memories and another one devoted to programmable logic devices. An introduction to digital systems and microprocessors is also included.Subjects

Boolean Algebra | Boolean Algebra | ía de Sistemas Audiovisuales | ía de Sistemas Audiovisuales | Memories | Memories | ática | ática | ía Eléctrica | ía Eléctrica | ía en Tecnologías Industriales | ía en Tecnologías Industriales | Combinational circuits | Combinational circuits | ía Telemática | ía Telemática | Registers and counters | Registers and counters | Digital systems and microprocessors | Digital systems and microprocessors | Synchronous sequential circuits | Synchronous sequential circuits | 2011 | 2011 | ía Electrónica Industrial y Automática | ía Electrónica Industrial y Automática | ía en Tecnologías de Telecomunicación | ía en Tecnologías de Telecomunicación | ía de Sistemas de Comunicaciones | ía de Sistemas de Comunicaciones | Information representation | Information representation | logic gates | logic gates | Arithmetic combinational circuits | Arithmetic combinational circuits | Latches and Flip-flops | Latches and Flip-flops | Tecnologia Electronica | Tecnologia Electronica | Programmable Logic Devices (PLD) | Programmable Logic Devices (PLD)License

Copyright 2015, UC3M http://creativecommons.org/licenses/by-nc-sa/4.0/Site sourced from

http://ocw.uc3m.es/ocwuniversia/rss_allAttribution

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

See all metadata