Searching for induction : 148 results found | RSS Feed for this search

Readme file for Computer Science Concepts

Description

This readme file contains details of links to all the Computer Science Concepts module's material held on Jorum and information about the module as well.Subjects

ukoer | strings lecture | induction and recursion lecture | induction lecture | recursion lecture | complexity lecture | languages lecture | computer sciences concepts test | computer science concepts test | computer science concepts assignment | computer science concepts practical | introduction | computer science concepts | computer science concept | computer science | strings and languages | strings and language | string and languages | string and language | string | language | languages | finite automata | automata | finite | push down automata | push down | prolog | data structures and algorithms | data structure and algorithms | data structures and algorithm | data structure and algorithm | data structures | data structure | algorithms | algorithm | revision exercises | revision | induction and recursion | induction | recursion | turing machines | turing machine | turing | machine | machines | complexity | grammar | grammar and languages | grammar and language | introduction lecture | computer science concepts lecture | computer science concept lecture | computer science lecture | strings and languages lecture | strings and language lecture | string and languages lecture | string and language lecture | string lecture | language lecture | finite automata lecture | automata lecture | finite lecture | push down automata lecture | push down lecture | prolog lecture | data structures and algorithms lecture | data structure and algorithms lecture | data structures and algorithm lecture | data structure and algorithm lecture | data structures lecture | data structure lecture | algorithms lecture | algorithm lecture | revision exercises lecture | revision lecture | turing machines lecture | turing machine lecture | turing lecture | machine lecture | machines lecture | computer science class test | computer science concept class test | computer science concepts class test | strings and languages class test | strings and language class test | string and languages class test | string and language class test | string class test | language class test | languages class test | introduction class test | grammar lecture | grammar and languages lecture | grammar and language lecture | computer science assignment | computer science concept assignment | strings and languages assignment | strings and language assignment | string and languages assignment | string and language assignment | string assignment | language assignment | languages assignment | finite automata class test | automata class test | finite class test | finite automata assignment | automata assignment | finite assignment | push down automata class test | push down class test | push down automata assignment | push down assignment | prolog class test | data structures and algorithms class test | data structure and algorithms class test | data structures and algorithm class test | data structure and algorithm class test | data structures class test | data structure class test | algorithms class test | algorithm class test | computer science practical | computer science concept practical | data structures and algorithms practical | data structure and algorithms practical | data structures and algorithm practical | data structure and algorithm practical | data structures practical | data structure practical | algorithms practical | algorithm practical | revision exercises class test | revision class test | induction and recursion class test | induction class test | recursion class test | induction and recursion assignment | induction assignment | recursion assignment | turing machines class test | turing machine class test | turing class test | machine class test | machines class test | turing machines assignment | turing machine assignment | turing assignment | machine assignment | machines assignment | complexity class test | grammar class test | grammar and languages class test | grammar and language class test | Computer science | I100License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dcAttribution

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

See all metadataComputer Science Concepts - Induction and recursion

Description

This lecture forms part of the "Induction and Recursion" topic of the Computer Science Concepts module.Subjects

ukoer | induction and recursion lecture | induction lecture | recursion lecture | induction and recursion | induction | computer science | computer science concept | computer science concepts | computer science lecture | computer science concept lecture | computer science concepts lecture | Computer science | I100License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dcAttribution

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

See all metadataComputer Science Concepts - Induction and recursion

Description

This class test forms part of the "Induction and Recursion" topic of the Computer Science Concepts module.Subjects

ukoer | computer science concepts test | induction and recursion | induction | recursion | computer science | computer science concept | computer science concepts | induction and recursion class test | induction class test | recursion class test | computer science class test | computer science concept class test | computer science concepts class test | Computer science | I100License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dcAttribution

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

See all metadataComputer Science Concepts - Induction and recursion

Description

This class test forms part of the "Induction and Recursion" topic of the Computer Science Concepts module.Subjects

ukoer | computer science concepts test | induction and recursion | induction | recursion | computer science | computer science concept | computer science concepts | induction and recursion class test | induction class test | recursion class test | computer science class test | computer science concept class test | computer science concepts class test | Computer science | I100License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dcAttribution

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

See all metadataComputer Science Concepts - Induction and recursion

Description

This assignment forms part of the "Induction and Recursion" topic of the Computer Science Concepts module.Subjects

ukoer | computer science concepts assignment | induction and recursion | induction | recursion | computer science | computer science concept | computer science concepts | induction and recursion assignment | induction assignment | recursion assignment | computer science assignment | computer science concept assignment | Computer science | I100License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dcAttribution

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

This course is offered both to undergraduates (6.061) and graduates (6.979), where the graduate version has different problem sets and an additional term project. 6.061 / 6.979 is an introductory course in the field of electric power systems and electrical to mechanical energy conversion. Material encountered in the subject includes: Fundamentals of energy-handling electric circuits and electromechanical apparatus. Modeling of magnetic field devices and description of their behavior using appropriate models. Simplification of problems using transformation techniques. Power electric circuits, magnetic circuits, lumped parameter electromechanics, elements of linear and rotating electric machinery. Modeling of synchronous, induction and dc machinery. The course uses examples from current rese This course is offered both to undergraduates (6.061) and graduates (6.979), where the graduate version has different problem sets and an additional term project. 6.061 / 6.979 is an introductory course in the field of electric power systems and electrical to mechanical energy conversion. Material encountered in the subject includes: Fundamentals of energy-handling electric circuits and electromechanical apparatus. Modeling of magnetic field devices and description of their behavior using appropriate models. Simplification of problems using transformation techniques. Power electric circuits, magnetic circuits, lumped parameter electromechanics, elements of linear and rotating electric machinery. Modeling of synchronous, induction and dc machinery. The course uses examples from current reseSubjects

electric power | electric power | electric power system | electric power system | electric circuits | electric circuits | electromechanical apparatus | electromechanical apparatus | magnetic field devices | magnetic field devices | transformation techniques | transformation techniques | magnetic circuits | magnetic circuits | lumped parameter electromechanics | lumped parameter electromechanics | linear electric machinery | linear electric machinery | rotating electric machinery | rotating electric machinery | synchronous machinery | synchronous machinery | induction machinery | induction machinery | dc machinery. | dc machinery. | mechanical energy conversion | mechanical energy conversion | energy | energy | new applications | new applications | dc machinery | dc machineryLicense

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

Includes audio/video content: AV faculty introductions. This course examines electric and magnetic quasistatic forms of Maxwell's equations applied to dielectric, conduction, and magnetization boundary value problems. Topics covered include: electromagnetic forces, force densities, and stress tensors, including magnetization and polarization; thermodynamics of electromagnetic fields, equations of motion, and energy conservation; applications to synchronous, induction, and commutator machines; sensors and transducers; microelectromechanical systems; propagation and stability of electromechanical waves; and charge transport phenomena. Acknowledgments The instructor would like to thank Thomas Larsen and Matthew Pegler for transcribing into LaTeX the homework problems, homework solutions, and Includes audio/video content: AV faculty introductions. This course examines electric and magnetic quasistatic forms of Maxwell's equations applied to dielectric, conduction, and magnetization boundary value problems. Topics covered include: electromagnetic forces, force densities, and stress tensors, including magnetization and polarization; thermodynamics of electromagnetic fields, equations of motion, and energy conservation; applications to synchronous, induction, and commutator machines; sensors and transducers; microelectromechanical systems; propagation and stability of electromechanical waves; and charge transport phenomena. Acknowledgments The instructor would like to thank Thomas Larsen and Matthew Pegler for transcribing into LaTeX the homework problems, homework solutions, andSubjects

electromagnetic | electromagnetic | electromagnetic field | electromagnetic field | forces | forces | motion | motion | electric | electric | magnetic | magnetic | quasistatic | quasistatic | Maxwell's equations | Maxwell's equations | dielectric | dielectric | conduction | conduction | magnetization | magnetization | boundary value problems | boundary value problems | force densities | force densities | stress tensors | stress tensors | polarization | polarization | thermodynamics | thermodynamics | equations of motion | equations of motion | energy conservation | energy conservation | synchronous | synchronous | induction | induction | commutator machines | commutator machines | sensors | sensors | transducers | transducers | microelectromechanical systems | microelectromechanical systems | electromechanical waves | electromechanical waves | charge transport phenomena | charge transport phenomenaLicense

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 metadata24.118 Paradox and Infinity (MIT) 24.118 Paradox and Infinity (MIT)

Description

In this class we will study a cluster of puzzles, paradoxes and intellectual wonders - from Zeno's Paradox to Godel's Theorem - and discuss their philosophical implications. In this class we will study a cluster of puzzles, paradoxes and intellectual wonders - from Zeno's Paradox to Godel's Theorem - and discuss their philosophical implications.Subjects

paradox | paradox | infinity | infinity | zeno | zeno | higher infinite | higher infinite | set theory | set theory | vagueness | vagueness | newcomb's puzzle | newcomb's puzzle | liar paradox | liar paradox | computability | computability | backward induction | backward induction | common knowledge | common knowledge | Godel's theorem | Godel's theorem | puzzle | puzzleLicense

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

Elementary discrete mathematics for computer science and engineering | 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 | 6.042 | 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 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 metadata14.12 Economic Applications of Game Theory (MIT) 14.12 Economic Applications of Game Theory (MIT)

Description

Game Theory, also known as Multiperson Decision Theory, is the analysis of situations in which the payoff of a decision maker depends not only on his own actions but also on those of others. Game Theory has applications in several fi elds, such as economics, politics, law, biology, and computer science. In this course, I will introduce the basic tools of game theoretic analysis. In the process, I will outline some of the many applications of Game Theory, primarily in economics. Game Theory, also known as Multiperson Decision Theory, is the analysis of situations in which the payoff of a decision maker depends not only on his own actions but also on those of others. Game Theory has applications in several fi elds, such as economics, politics, law, biology, and computer science. In this course, I will introduce the basic tools of game theoretic analysis. In the process, I will outline some of the many applications of Game Theory, primarily in economics.Subjects

game theory | game theory | economics | economics | multiperson decision theory | multiperson decision theory | payoff | payoff | games | games | backward induction | backward induction | subgame perfection | subgame perfection | implicit cartels | implicit cartels | dynamic games | dynamic gamesLicense

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 metadatas Argument Concerning Induction

Description

Part 3.1. Briefly introduces the problem of induction: that is, the problem that it is difficult to justify claims to knowledge of the world through pure reason, i.e. without experience. Wales; http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Subjects

knowledge | philosophy | experience | truth | induction | hume | knowledge | philosophy | experience | truth | induction | humeLicense

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

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

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

See all metadataDescription

Part 3.2. Responses to and justifications of Hume's argument concerning the problem of induction. Wales; http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Subjects

knowledge | philosophy | reichenbach | experience | reason | truth | mellor | strawson | induction | hume | knowledge | philosophy | reichenbach | experience | reason | truth | mellor | strawson | induction | humeLicense

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

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

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

See all metadataDescription

This course is an introductory subject in the field of electric power systems and electrical to mechanical energy conversion. Electric power has become increasingly important as a way of transmitting and transforming energy in industrial, military and transportation uses. Examples of new uses for electric power include all manners of electric transportation systems (electric trains that run under catenary, diesel-electric railroad locomotion, 'maglev' medium and high speed tracked vehicles, electric transmission systems for ships, replacement of hydraulics in high performance actuators, aircraft launch and recovery systems, battery powered factory material transport systems, electric and hybrid electric cars and buses, even the 'more electric' airplane). The material in this subject w This course is an introductory subject in the field of electric power systems and electrical to mechanical energy conversion. Electric power has become increasingly important as a way of transmitting and transforming energy in industrial, military and transportation uses. Examples of new uses for electric power include all manners of electric transportation systems (electric trains that run under catenary, diesel-electric railroad locomotion, 'maglev' medium and high speed tracked vehicles, electric transmission systems for ships, replacement of hydraulics in high performance actuators, aircraft launch and recovery systems, battery powered factory material transport systems, electric and hybrid electric cars and buses, even the 'more electric' airplane). The material in this subject wSubjects

electric power | electric power | electric power system | electric power system | electric circuits | electric circuits | electromechanical apparatus | electromechanical apparatus | magnetic field devices | magnetic field devices | transformation techniques | transformation techniques | magnetic circuits | magnetic circuits | lumped parameter electromechanics | lumped parameter electromechanics | linear electric machinery | linear electric machinery | rotating electric machinery | rotating electric machinery | synchronous machinery | synchronous machinery | induction machinery | induction machinery | dc machinery. | dc machinery. | mechanical energy conversion | mechanical energy conversion | energy | energy | new applications | new applicationsLicense

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 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 metadata8.02 Physics II: Electricity and Magnetism (MIT) 8.02 Physics II: Electricity and Magnetism (MIT)

Description

This freshman-level course is the second semester of introductory physics. The focus is on electricity and magnetism. The subject is taught using the TEAL (Technology Enabled Active Learning) format which utilizes small group interaction and current technology. The TEAL/Studio Project at MIT is a new approach to physics education designed to help students develop much better intuition about, and conceptual models of, physical phenomena. Staff List Visualizations: Prof. John Belcher Instructors: Dr. Peter Dourmashkin Prof. Bruce Knuteson Prof. Gunther Roland Prof. Bolek Wyslouch Dr. Brian Wecht Prof. Eric Katsavounidis Prof. Robert Simcoe Prof. Joseph Formaggio Course Co-Administrators: Dr. Peter Dourmashkin Prof. Robert Redwine Technical Instructors: Andy Neely Matthew Strafuss Course This freshman-level course is the second semester of introductory physics. The focus is on electricity and magnetism. The subject is taught using the TEAL (Technology Enabled Active Learning) format which utilizes small group interaction and current technology. The TEAL/Studio Project at MIT is a new approach to physics education designed to help students develop much better intuition about, and conceptual models of, physical phenomena. Staff List Visualizations: Prof. John Belcher Instructors: Dr. Peter Dourmashkin Prof. Bruce Knuteson Prof. Gunther Roland Prof. Bolek Wyslouch Dr. Brian Wecht Prof. Eric Katsavounidis Prof. Robert Simcoe Prof. Joseph Formaggio Course Co-Administrators: Dr. Peter Dourmashkin Prof. Robert Redwine Technical Instructors: Andy Neely Matthew Strafuss CourseSubjects

electromagnetism | electromagnetism | electrostatics | electrostatics | electric charge | electric charge | Coulomb's law | Coulomb's law | electric structure of matter | electric structure of matter | conductors | conductors | dielectrics | dielectrics | electrostatic field | electrostatic field | potential | potential | electrostatic energy | electrostatic energy | Electric currents | Electric currents | magnetic fields | magnetic fields | Ampere's law | Ampere's law | Magnetic materials | Magnetic materials | Time-varying fields | Time-varying fields | Faraday's law of induction | Faraday's law of induction | electric circuits | electric circuits | Electromagnetic waves | Electromagnetic waves | Maxwell's equations | Maxwell's equationsLicense

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

A bottle of Vetofol, Active ingredient PropofolSubjects

svmsvet | drug | injectable | anaesthesiainduction | propofol | anaesthesia | induction | vetofol | norbrookLicense

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

Nottingham Vet School | FlickRAttribution

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

See all metadataMagnetism with an Experimental Focus (MIT) Magnetism with an Experimental Focus (MIT)

Description

This course is an introduction to electromagnetism and electrostatics. Topics include: electric charge, Coulomb's law, electric structure of matter, conductors and dielectrics, concepts of electrostatic field and potential, electrostatic energy, electric currents, magnetic fields, Ampere's law, magnetic materials, time-varying fields, Faraday's law of induction, basic electric circuits, electromagnetic waves, and Maxwell's equations. The course has an experimental focus, and includes several experiments that are intended to illustrate the concepts being studied. Acknowledgements Prof. Roland wishes to acknowledge that the structure and content of this course owe much to the contributions of Prof. Ambrogio Fasoli. This course is an introduction to electromagnetism and electrostatics. Topics include: electric charge, Coulomb's law, electric structure of matter, conductors and dielectrics, concepts of electrostatic field and potential, electrostatic energy, electric currents, magnetic fields, Ampere's law, magnetic materials, time-varying fields, Faraday's law of induction, basic electric circuits, electromagnetic waves, and Maxwell's equations. The course has an experimental focus, and includes several experiments that are intended to illustrate the concepts being studied. Acknowledgements Prof. Roland wishes to acknowledge that the structure and content of this course owe much to the contributions of Prof. Ambrogio Fasoli.Subjects

Electromagnetism | Electromagnetism | electrostatics | electrostatics | electric charge | electric charge | Coulomb's law | Coulomb's law | electric structure of matter | electric structure of matter | conductors | conductors | dielectrics | dielectrics | electrostatic field | electrostatic field | electrostatic potential | electrostatic potential | electrostatic energy | electrostatic energy | electric current | electric current | magnetic field | magnetic field | Ampere's law | Ampere's law | magnetic | magnetic | electric | electric | time-varying fields | time-varying fields | Faraday's law | Faraday's law | induction | induction | circuits | circuits | electromagnetic waves | electromagnetic waves | Maxwell's equations | Maxwell's equations | 8.02 | 8.02License

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 metadata24.241 Logic I (MIT) 24.241 Logic I (MIT)

Description

In this course we will cover central aspects of modern formal logic, beginning with an explanation of what constitutes good reasoning. Topics will include validity and soundness of arguments, formal derivations, truth-functions, translations to and from a formal language, and truth-tables. We will thoroughly cover sentential calculus and predicate logic, including soundness and completeness results. In this course we will cover central aspects of modern formal logic, beginning with an explanation of what constitutes good reasoning. Topics will include validity and soundness of arguments, formal derivations, truth-functions, translations to and from a formal language, and truth-tables. We will thoroughly cover sentential calculus and predicate logic, including soundness and completeness results.Subjects

sentential logic | sentential logic | predicate logic | predicate logic | mathematical induction | mathematical induction | meta-theory | meta-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-24.xmlAttribution

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

See all metadataIntroduction for Lecturers New to Teaching in Higher Education

Description

This OER is drawn from a two-day induction course given by the Staff Development Centre for new lecturers at the University of Leicester. It incorporates ten sessions covering such subjects as effective large-group teaching and the use of VLEs in Higher Education. There are nine tasks to be completed by the participants, two of which involve additional handouts.Subjects

ukoer induction course for new lecturers effective large-group teaching use of vles in higher education induction course new lecturers large-group teaching use of vles | Education | X000License

Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales Attribution-Noncommercial-Share Alike 2.0 UK: England & Wales http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Site sourced from

http://dspace.jorum.ac.uk/oai/request?verb=ListRecords&metadataPrefix=oai_dcAttribution

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

See all metadataDescription

A bottle of Vetofol, Active ingredient PropofolSubjects

svmsvet | drug | injectable | anaesthesiainduction | propofol | anaesthesia | induction | vetofol | norbrookLicense

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

Nottingham Vet School | FlickRAttribution

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

See all metadata9.18 Developmental Neurobiology (MIT) 9.18 Developmental Neurobiology (MIT)

Description

This course considers molecular control of neural specification, formation of neuronal connections, construction of neural systems, and the contributions of experience to shaping brain structure and function. Topics include: neural induction and pattern formation, cell lineage and fate determination, neuronal migration, axon guidance, synapse formation and stabilization, activity-dependent development and critical periods, development of behavior. This course considers molecular control of neural specification, formation of neuronal connections, construction of neural systems, and the contributions of experience to shaping brain structure and function. Topics include: neural induction and pattern formation, cell lineage and fate determination, neuronal migration, axon guidance, synapse formation and stabilization, activity-dependent development and critical periods, development of behavior.Subjects

molecular | molecular | neural specification | neural specification | ormation of neuronal connections | ormation of neuronal connections | construction of neural systems | construction of neural systems | experience | experience | formation of neuronal connections | formation of neuronal connections | neural induction | neural induction | pattern formation | pattern formation | cell lineage | cell lineage | fate determination | fate determination | neuronal migration | neuronal migration | axon guidance | axon guidance | synapse formation | synapse formation | stabilization | stabilization | activity-dependent development | activity-dependent development | critical periods | critical periods | development | developmentLicense

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 metadata