Searching for mp : 14119 results found | RSS Feed for this search

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565

Readme file for Structured Systems Analysis

Description

This readme file contains details of links to all the Readme file for Structured Systems Analysis module's material held on Jorum and information about the module as well.Subjects

ukoer | current logical data flow diagram example | current logical data flow diagram exercise | current logical data flow diagram teaching guide | current logical data flow diagram video lecture | current logical data flow diagram | current logical data flow diagrams example | current logical data flow diagrams exercise | current logical data flow diagrams teaching guide | current logical data flow diagrams video lecture | current logical data flow diagrams | current logical dfd example | current logical dfd exercise | current logical dfd teaching guide | current logical dfd video lecture | current logical dfd | current logical dfds example | current logical dfds exercise | current logical dfds lecture | current logical dfds teaching guide | data dictionary example | data dictionary exercise | data dictionary lecture | data dictionary reading material | data dictionary teaching guide | data dictionary video lecture | data dictionary | data example | data exercise | data flow diagram example | data flow diagram exercise | data flow diagram reading material | data flow diagram teaching guide | data flow diagram video lecture | data flow diagram | data flow diagrams example | data flow diagrams exercise | data flow diagrams reading material | data flow diagrams teaching guide | data flow diagrams video lecture | data flow diagrams | data reading material | data teaching guide | data video lecture | data | decision table and tree example | decision table and tree exercise | decision table and tree reading material | decision table and tree teaching guide | decision table and tree video lecture | decision table and tree | decision table example | decision table exercise | decision table reading material | decision table teaching guide | decision table video lecture | decision table | decision tables and trees example | decision tables and trees lecture | decision tables and trees reading material | decision tables example | decision tables exercise | decision tables reading material | decision tables teaching guide | decision tables video lecture | decision tables | decision tree example | decision tree exercise | decision tree reading material | decision tree teaching guide | decision tree video lecture | decision tree | decision trees and decision tables exercise | decision trees and decision tables teaching guide | decision trees and decision tables video lecture | decision trees and decision tables | decision trees example | decision trees exercise | decision trees reading material | decision trees teaching guide | decision trees video lecture | decision trees | dfd example | dfd exercise | dfd reading material | dfd teaching guide | dfd video lecture | dfd | dfds example | dfds exercise | dfds reading material | dfds teaching guide | dfds video lecture | dfds | exploding data flow diagrams example | exploding data flow diagrams exercise | exploding data flow diagrams reading material | exploding data flow diagrams teaching guide | exploding data flow diagrams | exploding dfd example | exploding dfd exercise | exploding dfd reading material | exploding dfd teaching guide | exploding dfd | logical data flow diagram example | logical data flow diagram exercise | logical data flow diagram reading material | logical data flow diagram teaching guide | logical data flow diagram video lecture | logical data flow diagram | logical data flow diagrams example | logical data flow diagrams exercise | logical data flow diagrams teaching guide | logical data flow diagrams video lecture | logical data flow diagrams | logical dfd example | logical dfd exercise | logical dfd reading material | logical dfd teaching guide | logical dfd video lecture | logical dfd | logical dfds example | logical dfds exercise | logical dfds reading material | logical dfds teaching guide | logical dfds video lecture | logical dfds | project management practical | project management reading material | project management task guide | project management teaching guide | project management | quality management | quality managment reading material | quality managment task guide | required logical data flow diagram example | required logical data flow diagram exercise | required logical data flow diagram reading material | required logical data flow diagram teaching guide | required logical data flow diagram video lecture | required logical data flow diagram | required logical data flow diagrams example | required logical data flow diagrams exercise | required logical data flow diagrams reading material | required logical data flow diagrams teaching guide | required logical data flow diagrams video lecture | required logical data flow diagrams | required logical dfd example | required logical dfd exercise | required logical dfd reading material | required logical dfd teaching guide | required logical dfd video lecture | required logical dfd | required logical dfds example | required logical dfds exercise | required logical dfds lecture | required logical dfds reading material | required logical dfds teaching guide | structured chart example | structured chart exercise | structured chart reading material | structured chart teaching guide | structured chart video lecture | structured chart | structured charts example | structured charts exercise | structured charts lecture | structured charts reading material | structured charts teaching guide | structured charts video lecture | structured charts | structured english example | structured english exercise | structured english lecture | structured english teaching guide | structured english video lecture | structured english | structured system analysis example | structured system analysis exercise | structured system analysis lecture | structured system analysis practical | structured system analysis reading material | structured system analysis task guide | structured system analysis teaching guide | structured system analysis video lecture | structured system analysis | structured systems analysis example | structured systems analysis exercise | structured systems analysis lecture | structured systems analysis practical | structured systems analysis reading material | structured systems analysis task guide | structured systems analysis teaching guide | structured systems analysis video lecture | structured systems analysis | structured walkthroughs reading material | system analysis example | system analysis exercise | system analysis lecture | system analysis practical | system analysis reading material | system analysis task guide | system analysis teaching guide | system analysis video lecture | system analysis | systems analysis example | systems analysis exercise | systems analysis lecture | systems analysis practical | systems analysis reading material | systems analysis task guide | systems analysis teaching guide | systems analysis video lecture | systems analysis | techniques in methods lecture | techniques in methods teaching guide | techniques in methods | uml | univeral modelling language lecture | univeral modelling language | universal modeling language lecture | universal modeling language | current logical dfds video lecture | current logical dfds | exploding dfds example | exploding dfds exercise | exploding dfds reading material | exploding dfds teaching guide | exploding dfds | levelling dfds example | levelling dfds exercise | levelling dfds reading material | levelling dfds teaching guide | levelling dfds | required logical dfds video lecture | required logical dfds | uml 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 metadataDescription

The basic objective of Unified Engineering is to give a solid understanding of the fundamental disciplines of aerospace engineering, as well as their interrelationships and applications. These disciplines are Materials and Structures (M); Computers and Programming (C); Fluid Mechanics (F); Thermodynamics (T); Propulsion (P); and Signals and Systems (S). In choosing to teach these subjects in a unified manner, the instructors seek to explain the common intellectual threads in these disciplines, as well as their combined application to solve engineering Systems Problems (SP). Throughout the year, the instructors emphasize the connections among the disciplines.Technical RequirementsMicrosoft® Excel software is recommended for viewing the .xls files The basic objective of Unified Engineering is to give a solid understanding of the fundamental disciplines of aerospace engineering, as well as their interrelationships and applications. These disciplines are Materials and Structures (M); Computers and Programming (C); Fluid Mechanics (F); Thermodynamics (T); Propulsion (P); and Signals and Systems (S). In choosing to teach these subjects in a unified manner, the instructors seek to explain the common intellectual threads in these disciplines, as well as their combined application to solve engineering Systems Problems (SP). Throughout the year, the instructors emphasize the connections among the disciplines.Technical RequirementsMicrosoft® Excel software is recommended for viewing the .xls filesSubjects

Unified | Unified | Unified Engineering | Unified Engineering | aerospace | aerospace | CDIO | CDIO | C-D-I-O | C-D-I-O | conceive | conceive | design | design | implement | implement | operate | operate | team | team | team-based | team-based | discipline | discipline | materials | materials | structures | structures | materials and structures | materials and structures | computers | computers | programming | programming | computers and programming | computers and programming | fluids | fluids | fluid mechanics | fluid mechanics | thermodynamics | thermodynamics | propulsion | propulsion | signals | signals | systems | systems | signals and systems | signals and systems | systems problems | systems problems | fundamentals | fundamentals | technical communication | technical communication | graphical communication | graphical communication | communication | communication | reading | reading | research | research | experimentation | experimentation | personal response system | personal response system | prs | prs | active learning | active learning | First law | First law | first law of thermodynamics | first law of thermodynamics | thermo-mechanical | thermo-mechanical | energy | energy | energy conversion | energy conversion | aerospace power systems | aerospace power systems | propulsion systems | propulsion systems | aerospace propulsion systems | aerospace propulsion systems | heat | heat | work | work | thermal efficiency | thermal efficiency | forms of energy | forms of energy | energy exchange | energy exchange | processes | processes | heat engines | heat engines | engines | engines | steady-flow energy equation | steady-flow energy equation | energy flow | energy flow | flows | flows | path-dependence | path-dependence | path-independence | path-independence | reversibility | reversibility | irreversibility | irreversibility | state | state | thermodynamic state | thermodynamic state | performance | performance | ideal cycle | ideal cycle | simple heat engine | simple heat engine | cycles | cycles | thermal pressures | thermal pressures | temperatures | temperatures | linear static networks | linear static networks | loop method | loop method | node method | node method | linear dynamic networks | linear dynamic networks | classical methods | classical methods | state methods | state methods | state concepts | state concepts | dynamic systems | dynamic systems | resistive circuits | resistive circuits | sources | sources | voltages | voltages | currents | currents | Thevinin | Thevinin | Norton | Norton | initial value problems | initial value problems | RLC networks | RLC networks | characteristic values | characteristic values | characteristic vectors | characteristic vectors | transfer function | transfer function | ada | ada | ada programming | ada programming | programming language | programming language | software systems | software systems | programming style | programming style | computer architecture | computer architecture | program language evolution | program language evolution | classification | classification | numerical computation | numerical computation | number representation systems | number representation systems | assembly | assembly | SimpleSIM | SimpleSIM | RISC | RISC | CISC | CISC | operating systems | operating systems | single user | single user | multitasking | multitasking | multiprocessing | multiprocessing | domain-specific classification | domain-specific classification | recursive | recursive | execution time | execution time | fluid dynamics | fluid dynamics | physical properties of a fluid | physical properties of a fluid | fluid flow | fluid flow | mach | mach | reynolds | reynolds | conservation | conservation | conservation principles | conservation principles | conservation of mass | conservation of mass | conservation of momentum | conservation of momentum | conservation of energy | conservation of energy | continuity | continuity | inviscid | inviscid | steady flow | steady flow | simple bodies | simple bodies | airfoils | airfoils | wings | wings | channels | channels | aerodynamics | aerodynamics | forces | forces | moments | moments | equilibrium | equilibrium | freebody diagram | freebody diagram | free-body | free-body | free body | free body | planar force systems | planar force systems | equipollent systems | equipollent systems | equipollence | equipollence | support reactions | support reactions | reactions | reactions | static determinance | static determinance | determinate systems | determinate systems | truss analysis | truss analysis | trusses | trusses | method of joints | method of joints | method of sections | method of sections | statically indeterminate | statically indeterminate | three great principles | three great principles | 3 great principles | 3 great principles | indicial notation | indicial notation | rotation of coordinates | rotation of coordinates | coordinate rotation | coordinate rotation | stress | stress | extensional stress | extensional stress | shear stress | shear stress | notation | notation | plane stress | plane stress | stress equilbrium | stress equilbrium | stress transformation | stress transformation | mohr | mohr | mohr's circle | mohr's circle | principal stress | principal stress | principal stresses | principal stresses | extreme shear stress | extreme shear stress | strain | strain | extensional strain | extensional strain | shear strain | shear strain | strain-displacement | strain-displacement | compatibility | compatibility | strain transformation | strain transformation | transformation of strain | transformation of strain | mohr's circle for strain | mohr's circle for strain | principal strain | principal strain | extreme shear strain | extreme shear strain | uniaxial stress-strain | uniaxial stress-strain | material properties | material properties | classes of materials | classes of materials | bulk material properties | bulk material properties | origin of elastic properties | origin of elastic properties | structures of materials | structures of materials | atomic bonding | atomic bonding | packing of atoms | packing of atoms | atomic packing | atomic packing | crystals | crystals | crystal structures | crystal structures | polymers | polymers | estimate of moduli | estimate of moduli | moduli | moduli | composites | composites | composite materials | composite materials | modulus limited design | modulus limited design | material selection | material selection | materials selection | materials selection | measurement of elastic properties | measurement of elastic properties | stress-strain | stress-strain | stress-strain relations | stress-strain relations | anisotropy | anisotropy | orthotropy | orthotropy | measurements | measurements | engineering notation | engineering notation | Hooke | Hooke | Hooke's law | Hooke's law | general hooke's law | general hooke's law | equations of elasticity | equations of elasticity | boundary conditions | boundary conditions | multi-disciplinary | multi-disciplinary | models | models | engineering systems | engineering systems | experiments | experiments | investigations | investigations | experimental error | experimental error | design evaluation | design evaluation | evaluation | evaluation | trade studies | trade studies | effects of engineering | effects of engineering | social context | social context | engineering drawings | engineering drawings | 16.01 | 16.01 | 16.02 | 16.02 | 16.03 | 16.03 | 16.04 | 16.04License

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 selected lectures, AV faculty introductions, AV special element video. The basic objective of Unified Engineering is to give a solid understanding of the fundamental disciplines of aerospace engineering, as well as their interrelationships and applications. These disciplines are Materials and Structures (M); Computers and Programming (C); Fluid Mechanics (F); Thermodynamics (T); Propulsion (P); and Signals and Systems (S). In choosing to teach these subjects in a unified manner, the instructors seek to explain the common intellectual threads in these disciplines, as well as their combined application to solve engineering Systems Problems (SP). Throughout the year, the instructors emphasize the connections among the disciplines. Includes audio/video content: AV selected lectures, AV faculty introductions, AV special element video. The basic objective of Unified Engineering is to give a solid understanding of the fundamental disciplines of aerospace engineering, as well as their interrelationships and applications. These disciplines are Materials and Structures (M); Computers and Programming (C); Fluid Mechanics (F); Thermodynamics (T); Propulsion (P); and Signals and Systems (S). In choosing to teach these subjects in a unified manner, the instructors seek to explain the common intellectual threads in these disciplines, as well as their combined application to solve engineering Systems Problems (SP). Throughout the year, the instructors emphasize the connections among the disciplines.Subjects

Unified | Unified | Unified Engineering | Unified Engineering | aerospace | aerospace | CDIO | CDIO | C-D-I-O | C-D-I-O | conceive | conceive | design | design | implement | implement | operate | operate | team | team | team-based | team-based | discipline | discipline | materials | materials | structures | structures | materials and structures | materials and structures | computers | computers | programming | programming | computers and programming | computers and programming | fluids | fluids | fluid mechanics | fluid mechanics | thermodynamics | thermodynamics | propulsion | propulsion | signals | signals | systems | systems | signals and systems | signals and systems | systems problems | systems problems | fundamentals | fundamentals | technical communication | technical communication | graphical communication | graphical communication | communication | communication | reading | reading | research | research | experimentation | experimentation | personal response system | personal response system | prs | prs | active learning | active learning | First law | First law | first law of thermodynamics | first law of thermodynamics | thermo-mechanical | thermo-mechanical | energy | energy | energy conversion | energy conversion | aerospace power systems | aerospace power systems | propulsion systems | propulsion systems | aerospace propulsion systems | aerospace propulsion systems | heat | heat | work | work | thermal efficiency | thermal efficiency | forms of energy | forms of energy | energy exchange | energy exchange | processes | processes | heat engines | heat engines | engines | engines | steady-flow energy equation | steady-flow energy equation | energy flow | energy flow | flows | flows | path-dependence | path-dependence | path-independence | path-independence | reversibility | reversibility | irreversibility | irreversibility | state | state | thermodynamic state | thermodynamic state | performance | performance | ideal cycle | ideal cycle | simple heat engine | simple heat engine | cycles | cycles | thermal pressures | thermal pressures | temperatures | temperatures | linear static networks | linear static networks | loop method | loop method | node method | node method | linear dynamic networks | linear dynamic networks | classical methods | classical methods | state methods | state methods | state concepts | state concepts | dynamic systems | dynamic systems | resistive circuits | resistive circuits | sources | sources | voltages | voltages | currents | currents | Thevinin | Thevinin | Norton | Norton | initial value problems | initial value problems | RLC networks | RLC networks | characteristic values | characteristic values | characteristic vectors | characteristic vectors | transfer function | transfer function | ada | ada | ada programming | ada programming | programming language | programming language | software systems | software systems | programming style | programming style | computer architecture | computer architecture | program language evolution | program language evolution | classification | classification | numerical computation | numerical computation | number representation systems | number representation systems | assembly | assembly | SimpleSIM | SimpleSIM | RISC | RISC | CISC | CISC | operating systems | operating systems | single user | single user | multitasking | multitasking | multiprocessing | multiprocessing | domain-specific classification | domain-specific classification | recursive | recursive | execution time | execution time | fluid dynamics | fluid dynamics | physical properties of a fluid | physical properties of a fluid | fluid flow | fluid flow | mach | mach | reynolds | reynolds | conservation | conservation | conservation principles | conservation principles | conservation of mass | conservation of mass | conservation of momentum | conservation of momentum | conservation of energy | conservation of energy | continuity | continuity | inviscid | inviscid | steady flow | steady flow | simple bodies | simple bodies | airfoils | airfoils | wings | wings | channels | channels | aerodynamics | aerodynamics | forces | forces | moments | moments | equilibrium | equilibrium | freebody diagram | freebody diagram | free-body | free-body | free body | free body | planar force systems | planar force systems | equipollent systems | equipollent systems | equipollence | equipollence | support reactions | support reactions | reactions | reactions | static determinance | static determinance | determinate systems | determinate systems | truss analysis | truss analysis | trusses | trusses | method of joints | method of joints | method of sections | method of sections | statically indeterminate | statically indeterminate | three great principles | three great principles | 3 great principles | 3 great principles | indicial notation | indicial notation | rotation of coordinates | rotation of coordinates | coordinate rotation | coordinate rotation | stress | stress | extensional stress | extensional stress | shear stress | shear stress | notation | notation | plane stress | plane stress | stress equilbrium | stress equilbrium | stress transformation | stress transformation | mohr | mohr | mohr's circle | mohr's circle | principal stress | principal stress | principal stresses | principal stresses | extreme shear stress | extreme shear stress | strain | strain | extensional strain | extensional strain | shear strain | shear strain | strain-displacement | strain-displacement | compatibility | compatibility | strain transformation | strain transformation | transformation of strain | transformation of strain | mohr's circle for strain | mohr's circle for strain | principal strain | principal strain | extreme shear strain | extreme shear strain | uniaxial stress-strain | uniaxial stress-strain | material properties | material properties | classes of materials | classes of materials | bulk material properties | bulk material properties | origin of elastic properties | origin of elastic properties | structures of materials | structures of materials | atomic bonding | atomic bonding | packing of atoms | packing of atoms | atomic packing | atomic packing | crystals | crystals | crystal structures | crystal structures | polymers | polymers | estimate of moduli | estimate of moduli | moduli | moduli | composites | composites | composite materials | composite materials | modulus limited design | modulus limited design | material selection | material selection | materials selection | materials selection | measurement of elastic properties | measurement of elastic properties | stress-strain | stress-strain | stress-strain relations | stress-strain relations | anisotropy | anisotropy | orthotropy | orthotropy | measurements | measurements | engineering notation | engineering notation | Hooke | Hooke | Hooke's law | Hooke's law | general hooke's law | general hooke's law | equations of elasticity | equations of elasticity | boundary conditions | boundary conditions | multi-disciplinary | multi-disciplinary | models | models | engineering systems | engineering systems | experiments | experiments | investigations | investigations | experimental error | experimental error | design evaluation | design evaluation | evaluation | evaluation | trade studies | trade studies | effects of engineering | effects of engineering | social context | social context | engineering drawings | engineering drawingsLicense

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 metadata15.564 Information Technology I (MIT) 15.564 Information Technology I (MIT)

Description

Information Technology I helps students understand technical concepts underlying current and future developments in information technology. There will be a special emphasis on networks and distributed computing. Students will also gain some hands-on exposure to powerful, high-level tools for making computers do amazing things, without the need for conventional programming languages. Since 15.564 is an introductory course, no knowledge of how computers work or are programmed is assumed. Information Technology I helps students understand technical concepts underlying current and future developments in information technology. There will be a special emphasis on networks and distributed computing. Students will also gain some hands-on exposure to powerful, high-level tools for making computers do amazing things, without the need for conventional programming languages. Since 15.564 is an introductory course, no knowledge of how computers work or are programmed is assumed.Subjects

developing-country governments; international | developing-country governments; international | computers; future developments; networks;distributed computing; programming languages;firewall;e-business;computerarchitecture;operating systems;software development;database;user interface;telecommunication;data transmission;localarea network;wireless network;internet;world wide web;digital security | computers; future developments; networks;distributed computing; programming languages;firewall;e-business;computerarchitecture;operating systems;software development;database;user interface;telecommunication;data transmission;localarea network;wireless network;internet;world wide web;digital security | computers;future developments;networks;distributed computing;programming languages;firewall;e-business;computerarchitecture;operating systems;software development;database;user interface;telecommunication;data transmission;localarea network;wireless network;internet;world wide web;digital security | computers;future developments;networks;distributed computing;programming languages;firewall;e-business;computerarchitecture;operating systems;software development;database;user interface;telecommunication;data transmission;localarea network;wireless network;internet;world wide web;digital security | computers | computers | future developments | future developments | networks | networks | distributed computing | distributed computing | programming languages | programming languages | firewall | firewall | e-business | e-business | computer architecture | computer architecture | operating | operating | software development | software development | database | database | user interface | user interface | telecommunication | telecommunication | data transmission | data transmission | local area network | local area network | wireless network | wireless network | internet | internet | world wide web | world wide web | digital security | digital security | architecture | architecture | data | data | transmission | transmission | wireless | wireless | interface | interface | user | user | software | software | development | development | programming | programming | languages | languages | distributed | distributed | computing | computing | LAN | LAN | local | local | area | area | future | future | digital | digital | security | security | technology | technology | information | information | management | management | systems | systems | relational | relational | graphical | graphical | interfaces | interfaces | client/server | client/server | enterprise | enterprise | applications | applications | cryptography | cryptography | services | services | Microsoft | Microsoft | Access | Access | Lotus Notes | Lotus Notes | processing | processing | memory | memory | I/O | I/O | CPU | CPU | OS | OS | hardware | hardware | compression | compression | SQL | SQL | queries | queries | design | design | WAN | WAN | wide | wide | Ethernet | Ethernet | packet-switched | packet-switched | peer-to-peer | peer-to-peer | WWW | WWW | public | public | key | key | mining | mining | warehousing | warehousing | concepts | concepts | conceptual | conceptual | modern computing | modern computing | information management | information management | operating systems | operating systems | relational database systems | relational database systems | graphical user interfaces | graphical user interfaces | client/server systems | client/server systems | enterprise applications | enterprise applications | web.internet services | web.internet services | Microsoft Access | Microsoft Access | database management systems | database management systems | information technology | information technology | telecommunications | telecommunications | eBusiness applications | eBusiness applications | client | client | servers | servers | wireless area network | wireless area networkLicense

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

Wavelets are localized basis functions, good for representing short-time events. The coefficients at each scale are filtered and subsampled to give coefficients at the next scale. This is Mallat's pyramid algorithm for multiresolution, connecting wavelets to filter banks. Wavelets and multiscale algorithms for compression and signal/image processing are developed. Subject is project-based for engineering and scientific applications. Wavelets are localized basis functions, good for representing short-time events. The coefficients at each scale are filtered and subsampled to give coefficients at the next scale. This is Mallat's pyramid algorithm for multiresolution, connecting wavelets to filter banks. Wavelets and multiscale algorithms for compression and signal/image processing are developed. Subject is project-based for engineering and scientific applications.Subjects

Discrete-time filters | Discrete-time filters | convolution | convolution | Fourier transform | Fourier transform | owpass and highpass filters | owpass and highpass filters | Sampling rate change operations | Sampling rate change operations | upsampling and downsampling | upsampling and downsampling | ractional sampling | ractional sampling | interpolation | interpolation | Filter Banks | Filter Banks | time domain (Haar example) and frequency domain | time domain (Haar example) and frequency domain | conditions for alias cancellation and no distortion | conditions for alias cancellation and no distortion | perfect reconstruction | perfect reconstruction | halfband filters and possible factorizations | halfband filters and possible factorizations | Modulation and polyphase representations | Modulation and polyphase representations | Noble identities | Noble identities | block Toeplitz matrices and block z-transforms | block Toeplitz matrices and block z-transforms | polyphase examples | polyphase examples | Matlab wavelet toolbox | Matlab wavelet toolbox | Orthogonal filter banks | Orthogonal filter banks | paraunitary matrices | paraunitary matrices | orthogonality condition (Condition O) in the time domain | orthogonality condition (Condition O) in the time domain | modulation domain and polyphase domain | modulation domain and polyphase domain | Maxflat filters | Maxflat filters | Daubechies and Meyer formulas | Daubechies and Meyer formulas | Spectral factorization | Spectral factorization | Multiresolution Analysis (MRA) | Multiresolution Analysis (MRA) | requirements for MRA | requirements for MRA | nested spaces and complementary spaces; scaling functions and wavelets | nested spaces and complementary spaces; scaling functions and wavelets | Refinement equation | Refinement equation | iterative and recursive solution techniques | iterative and recursive solution techniques | infinite product formula | infinite product formula | filter bank approach for computing scaling functions and wavelets | filter bank approach for computing scaling functions and wavelets | Orthogonal wavelet bases | Orthogonal wavelet bases | connection to orthogonal filters | connection to orthogonal filters | orthogonality in the frequency domain | orthogonality in the frequency domain | Biorthogonal wavelet bases | Biorthogonal wavelet bases | Mallat pyramid algorithm | Mallat pyramid algorithm | Accuracy of wavelet approximations (Condition A) | Accuracy of wavelet approximations (Condition A) | vanishing moments | vanishing moments | polynomial cancellation in filter banks | polynomial cancellation in filter banks | Smoothness of wavelet bases | Smoothness of wavelet bases | convergence of the cascade algorithm (Condition E) | convergence of the cascade algorithm (Condition E) | splines | splines | Bases vs. frames | Bases vs. frames | Signal and image processing | Signal and image processing | finite length signals | finite length signals | boundary filters and boundary wavelets | boundary filters and boundary wavelets | wavelet compression algorithms | wavelet compression algorithms | Lifting | Lifting | ladder structure for filter banks | ladder structure for filter banks | factorization of polyphase matrix into lifting steps | factorization of polyphase matrix into lifting steps | lifting form of refinement equationSec | lifting form of refinement equationSec | Wavelets and subdivision | Wavelets and subdivision | nonuniform grids | nonuniform grids | multiresolution for triangular meshes | multiresolution for triangular meshes | representation and compression of surfaces | representation and compression of surfaces | Numerical solution of PDEs | Numerical solution of PDEs | Galerkin approximation | Galerkin approximation | wavelet integrals (projection coefficients | moments and connection coefficients) | wavelet integrals (projection coefficients | moments and connection coefficients) | convergence | convergence | Subdivision wavelets for integral equations | Subdivision wavelets for integral equations | Compression and convergence estimates | Compression and convergence estimates | M-band wavelets | M-band wavelets | DFT filter banks and cosine modulated filter banks | DFT filter banks and cosine modulated filter banks | Multiwavelets | MultiwaveletsLicense

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 metadataReadme file for Introduction to Artificial Intelligence

Description

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

ukoer | evolutionary algorithm lecture | algorithm tutorial | genetic algorithm lecture | genetic algorithm example | evolutionary computation tutorial | artificial intelligence lecture | artificial intelligence tutorial | random processes reading material | semantic web reading material | neural networks video | evolutionary computation test | artificial intelligence test | knowledge representation test | neural networks test | evolutionary algorithm | genetic computation | genetic programming | evolutionary computation | artificial intelligence | introduction to artificial intelligence | search | problem solving | revision | knowledge representation | semantic web | neural network | neural networks | artificial neural networks | swarm intelligence | collective intelligence | robot societies | genetic computation lecture | genetic programming lecture | evolutionary computation lecture | introduction to artificial intelligence lecture | evolutionary algorithm tutorial | genetic computation tutorial | genetic programming tutorial | introduction to artificial intelligence tutorial | evolutionary algorithm example | genetic computation example | genetic programming example | evolutionary computation example | artificial intelligence example | introduction to artificial intelligence example | search lecture | problem solving lecture | search tutorial | problem solving tutorial | search example | problem solving example | revision reading material | search reading material | artificial intelligence reading material | introduction to artificial intelligence reading material | revision lecture | knowledge representation lecture | semantic web lecture | knowledge representation practical | semantic web practical | artificial intelligence practical | introduction to artificial intelligence practical | knowledge representation reading material | knowledge representation notes | semantic web notes | artificial intelligence notes | introduction to artificial intelligence notes | neural network lecture | neural networks lecture | artificial neural networks lecture | neural network reading material | neural networks reading material | artificial neural networks reading material | neural network practical | neural networks practical | artificial neural networks practical | neural network viewing material | neural networks viewing material | artificial neural networks viewing material | artificial intelligence viewing material | introduction to artificial intelligence viewing material | swarm intelligence lecture | collective intelligence lecture | robot societies lecture | swarm intelligence tutorial | collective intelligence tutorial | robot societies tutorial | evolutionary algorithm test | genetic computation test | genetic programming test | introduction to artificial intelligence test | search test | problem solving test | semantic web test | neural network test | artificial neural networks test | g700 | ai | g700 lecture | ai lecture | g700 tutorial | ai tutorial | g700 example | ai example | g700 reading material | ai reading material | g700 practical | ai practical | g700 notes | ai notes | g700 viewing material | ai viewing material | g700 test | ai 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 metadataReadme 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 metadataStructured Systems Analysis - Current Logical DFDs

Description

This example forms part of the "Current Logical DFDs" topic in the Structured Systems Analysis module.Subjects

ukoer | current logical dfds example | systems analysis | structured systems analysis | current logical dfd | current logical data flow diagrams | current logical data flow diagram | data flow diagram | data flow diagrams | logical data flow diagrams | logical data flow diagram | logical dfd | logical dfds | dfd | dfds | systems analysis example | structured systems analysis example | system analysis example | structured system analysis example | current logical dfd example | current logical data flow diagrams example | current logical data flow diagram example | data flow diagram example | data flow diagrams example | logical data flow diagrams example | logical data flow diagram example | logical dfd example | logical dfds example | dfd example | dfds example | current logical dfds | 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 metadataStructured Systems Analysis - Current Logical DFDs

Description

This example forms part of the "Current Logical DFDs" topic in the Structured Systems Analysis module.Subjects

ukoer | current logical dfds example | systems analysis | structured systems analysis | system analysis | structured system analysis | current logical dfd | current logical data flow diagrams | current logical data flow diagram | data flow diagram | data flow diagrams | logical data flow diagrams | logical data flow diagram | logical dfd | logical dfds | dfd | dfds | systems analysis example | structured systems analysis example | system analysis example | structured system analysis example | current logical dfd example | current logical data flow diagrams example | current logical data flow diagram example | data flow diagram example | data flow diagrams example | logical data flow diagrams example | logical data flow diagram example | logical dfd example | logical dfds example | dfd example | dfds example | current logical dfds | 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 metadataStructured Systems Analysis - Current Logical DFDs

Description

This example forms part of the "Current Logical DFDs" topic in the Structured Systems Analysis module.Subjects

ukoer | current logical dfds example | systems analysis | structured systems analysis | system analysis | structured system analysis | current logical dfd | current logical data flow diagrams | current logical data flow diagram | data flow diagram | data flow diagrams | logical data flow diagrams | logical data flow diagram | logical dfd | logical dfds | dfd | dfds | systems analysis example | structured systems analysis example | system analysis example | structured system analysis example | current logical dfd example | current logical data flow diagrams example | current logical data flow diagram example | data flow diagram example | data flow diagrams example | logical data flow diagrams example | logical data flow diagram example | logical dfd example | logical dfds example | dfd example | dfds example | current logical dfds | 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 metadata4.206 Introduction to Design Computing (MIT) 4.206 Introduction to Design Computing (MIT)

Description

This course will introduce students to architectural design and computation through the use of computer modeling, rendering and digital fabrication. The course focuses on teaching architectural design with CAD drawing, modeling, rendering and rapid prototyping. Students will be required to build computer models that will lead to a full package of architectural explorations within a computational environment. Each semester will explore a particular historical period in architecture and the work of a selected architect. This course will introduce students to architectural design and computation through the use of computer modeling, rendering and digital fabrication. The course focuses on teaching architectural design with CAD drawing, modeling, rendering and rapid prototyping. Students will be required to build computer models that will lead to a full package of architectural explorations within a computational environment. Each semester will explore a particular historical period in architecture and the work of a selected architect.Subjects

architectural design and computation | architectural design and computation | computer modeling | computer modeling | rendering | rendering | digital fabrication | digital fabrication | exploration of space | exploration of space | place making | place making | computer rendering | computer rendering | design construction | design construction | CAD CAM fabrication | CAD CAM fabrication | computer models | computer models | computer aided drawings | computer aided drawings | rapid prototyped models | rapid prototyped models | architecture | architecture | design | design | computation | computation | representational mediums | representational mediums | architectural design | architectural design | complex phenomena | complex phenomena | constructs | constructs | information visualization | information visualization | programming | programming | computer graphics | computer graphics | data respresentation | data respresentationLicense

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.856J Randomized Algorithms (MIT) 6.856J Randomized Algorithms (MIT)

Description

This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimum cuts); geometric algorithms (convex hulls, linear programming in fixed or arbitrary dimension); approximate counting; parallel algorithms; online algorithms; derandomization techniques; and tools for probabilistic analysis of algorithms. This course examines how randomization can be used to make algorithms simpler and more efficient via random sampling, random selection of witnesses, symmetry breaking, and Markov chains. Topics covered include: randomized computation; data structures (hash tables, skip lists); graph algorithms (minimum spanning trees, shortest paths, minimum cuts); geometric algorithms (convex hulls, linear programming in fixed or arbitrary dimension); approximate counting; parallel algorithms; online algorithms; derandomization techniques; and tools for probabilistic analysis of algorithms.Subjects

Randomized Algorithms | Randomized Algorithms | algorithms | algorithms | efficient in time and space | efficient in time and space | randomization | randomization | computational problems | computational problems | data structures | data structures | graph algorithms | graph algorithms | optimization | optimization | geometry | geometry | Markov chains | Markov chains | sampling | sampling | estimation | estimation | geometric algorithms | geometric algorithms | parallel and distributed algorithms | parallel and distributed algorithms | parallel and ditributed algorithm | parallel and ditributed algorithm | parallel and distributed algorithm | parallel and distributed algorithm | random sampling | random sampling | random selection of witnesses | random selection of witnesses | symmetry breaking | symmetry breaking | randomized computational models | randomized computational models | hash tables | hash tables | skip lists | skip lists | minimum spanning trees | minimum spanning trees | shortest paths | shortest paths | minimum cuts | minimum cuts | convex hulls | convex hulls | linear programming | linear programming | fixed dimension | fixed dimension | arbitrary dimension | arbitrary dimension | approximate counting | approximate counting | parallel algorithms | parallel algorithms | online algorithms | online algorithms | derandomization techniques | derandomization techniques | probabilistic analysis | probabilistic analysis | computational number theory | computational number theory | simplicity | simplicity | speed | speed | design | design | basic probability theory | basic probability theory | application | application | randomized complexity classes | randomized complexity classes | game-theoretic techniques | game-theoretic techniques | Chebyshev | Chebyshev | moment inequalities | moment inequalities | limited independence | limited independence | coupon collection | coupon collection | occupancy problems | occupancy problems | tail inequalities | tail inequalities | Chernoff bound | Chernoff bound | conditional expectation | conditional expectation | probabilistic method | probabilistic method | random walks | random walks | algebraic techniques | algebraic techniques | probability amplification | probability amplification | sorting | sorting | searching | searching | combinatorial optimization | combinatorial optimization | approximation | approximation | counting problems | counting problems | distributed algorithms | distributed algorithms | 6.856 | 6.856 | 18.416 | 18.416License

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 metadata14.121 Microeconomic Theory I (MIT) 14.121 Microeconomic Theory I (MIT)

Description

This half-semester course provides an introduction to microeconomic theory designed to meet the needs of students in the economics Ph.D. program. Some parts of the course are designed to teach material that all graduate students should know. Others are used to introduce methodologies. Topics include consumer and producer theory, markets and competition, general equilibrium, and tools of comparative statics and their application to price theory. Some topics of recent interest may also be covered. This half-semester course provides an introduction to microeconomic theory designed to meet the needs of students in the economics Ph.D. program. Some parts of the course are designed to teach material that all graduate students should know. Others are used to introduce methodologies. Topics include consumer and producer theory, markets and competition, general equilibrium, and tools of comparative statics and their application to price theory. Some topics of recent interest may also be covered.Subjects

microeconomic theory | microeconomic theory | demand theory | demand theory | producer theory; partial equilibrium | producer theory; partial equilibrium | competitive markets | competitive markets | general equilibrium | general equilibrium | externalities | externalities | Afriat's theorem | Afriat's theorem | pricing | pricing | robust comparative statics | robust comparative statics | utility theory | utility theory | properties of preferences | properties of preferences | choice as primitive | choice as primitive | revealed preference | revealed preference | classical demand theory | classical demand theory | Kuhn-Tucker necessary conditions | Kuhn-Tucker necessary conditions | implications of Walras?s law | implications of Walras?s law | indirect utility functions | indirect utility functions | theorem of the maximum (Berge?s theorem) | theorem of the maximum (Berge?s theorem) | expenditure minimization problem | expenditure minimization problem | Hicksian demands | Hicksian demands | compensated law of demand | compensated law of demand | Slutsky substitution | Slutsky substitution | price changes and welfare | price changes and welfare | compensating variation | compensating variation | and welfare from new goods | and welfare from new goods | price indexes | price indexes | bias in the U.S. consumer price index | bias in the U.S. consumer price index | integrability | integrability | demand aggregation | demand aggregation | aggregate demand and welfare | aggregate demand and welfare | Frisch demands | Frisch demands | and demand estimation | and demand estimation | increasing differences | increasing differences | producer theory applications | producer theory applications | the LeCh?telier principle | the LeCh?telier principle | Topkis? theorem | Topkis? theorem | Milgrom-Shannon monotonicity theorem | Milgrom-Shannon monotonicity theorem | monopoly pricing | monopoly pricing | monopoly and product quality | monopoly and product quality | nonlinear pricing | nonlinear pricing | and price discrimination | and price discrimination | simple models of externalities | simple models of externalities | government intervention | government intervention | Coase theorem | Coase theorem | Myerson-Sattherthwaite proposition | Myerson-Sattherthwaite proposition | missing markets | missing markets | price vs. quantity regulations | price vs. quantity regulations | Weitzman?s analysis | Weitzman?s analysis | uncertainty | uncertainty | common property externalities | common property externalities | optimization | optimization | equilibrium number of boats | equilibrium number of boats | welfare theorems | welfare theorems | uniqueness and determinacy | uniqueness and determinacy | price-taking assumption | price-taking assumption | Edgeworth box | Edgeworth box | welfare properties | welfare properties | Pareto efficiency | Pareto efficiency | Walrasian equilibrium with transfers | Walrasian equilibrium with transfers | Arrow-Debreu economy | Arrow-Debreu economy | separating hyperplanes | separating hyperplanes | Minkowski?s theorem | Minkowski?s theorem | Existence of Walrasian equilibrium | Existence of Walrasian equilibrium | Kakutani?s fixed point theorem | Kakutani?s fixed point theorem | Debreu-Gale-Kuhn-Nikaido lemma | Debreu-Gale-Kuhn-Nikaido lemma | additional properties of general equilibrium | additional properties of general equilibrium | Microfoundations | Microfoundations | core | core | core convergence | core convergence | general equilibrium with time and uncertainty | general equilibrium with time and uncertainty | Jensen?s inequality | Jensen?s inequality | and security market economy | and security market economy | arbitrage pricing theory | arbitrage pricing theory | and risk-neutral probabilities | and risk-neutral probabilities | Housing markets | Housing markets | competitive equilibrium | competitive equilibrium | one-sided matching house allocation problem | one-sided matching house allocation problem | serial dictatorship | serial dictatorship | two-sided matching | two-sided matching | marriage markets | marriage markets | existence of stable matchings | existence of stable matchings | incentives | incentives | housing markets core mechanism | housing markets core mechanismLicense

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 metadata14.462 Advanced Macroeconomics II (MIT) 14.462 Advanced Macroeconomics II (MIT)

Description

14.462 is the second semester of the second-year Ph.D. macroeconomics sequence. The course is intended to introduce the students, not only to particular areas of current research, but also to some very useful analytical tools. It covers a selection of topics that varies from year to year. Recent topics include: Growth and Fluctuations Heterogeneity and Incomplete Markets Optimal Fiscal Policy Time Inconsistency Reputation Coordination Games and Macroeconomic Complementarities Information 14.462 is the second semester of the second-year Ph.D. macroeconomics sequence. The course is intended to introduce the students, not only to particular areas of current research, but also to some very useful analytical tools. It covers a selection of topics that varies from year to year. Recent topics include: Growth and Fluctuations Heterogeneity and Incomplete Markets Optimal Fiscal Policy Time Inconsistency Reputation Coordination Games and Macroeconomic Complementarities InformationSubjects

macroeconomics research; analytical tools; analysis; endogenous growth; coordintation; incomplete markets; technolgy; distribution; employment; intellectual property rights; bounded rationality; demographics; complementarities; amplification; recursive equilibria; uncertainty; morris; shin; global games; policy; price; aggregation; social learning; dynamic adjustment; business cycle; heterogeneous agents; savings; utility; aiyagari; steady state; krusell; smith; idiosyncratic investment risk | macroeconomics research; analytical tools; analysis; endogenous growth; coordintation; incomplete markets; technolgy; distribution; employment; intellectual property rights; bounded rationality; demographics; complementarities; amplification; recursive equilibria; uncertainty; morris; shin; global games; policy; price; aggregation; social learning; dynamic adjustment; business cycle; heterogeneous agents; savings; utility; aiyagari; steady state; krusell; smith; idiosyncratic investment risk | macroeconomics research | macroeconomics research | analytical tools | analytical tools | analysis | analysis | endogenous growth | endogenous growth | coordintation | coordintation | incomplete markets | incomplete markets | technolgy | technolgy | distribution | distribution | employment | employment | intellectual property rights | intellectual property rights | bounded rationality | bounded rationality | demographics | demographics | complementarities | complementarities | amplification | amplification | recursive equilibria | recursive equilibria | uncertainty | uncertainty | morris | morris | shin | shin | global games | global games | policy | policy | price | price | aggregation | aggregation | social learning | social learning | dynamic adjustment | dynamic adjustment | business cycle | business cycle | heterogeneous agents | heterogeneous agents | savings | savings | utility | utility | aiyagari | aiyagari | steady state | steady state | krusell | krusell | smith | smith | idiosyncratic investment risk | idiosyncratic investment risk | growth | growth | fluctuations | fluctuations | heterogeneity | heterogeneity | optimal fiscal policy | optimal fiscal policy | time inconsistency | time inconsistency | reputation | reputation | information | information | coordination games | coordination 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 metadata16.13 Aerodynamics of Viscous Fluids (MIT) 16.13 Aerodynamics of Viscous Fluids (MIT)

Description

The major focus of 16.13 is on boundary layers, and boundary layer theory subject to various flow assumptions, such as compressibility, turbulence, dimensionality, and heat transfer. Parameters influencing aerodynamic flows and transition and influence of boundary layers on outer potential flow are presented, along with associated stall and drag mechanisms. Numerical solution techniques and exercises are included. The major focus of 16.13 is on boundary layers, and boundary layer theory subject to various flow assumptions, such as compressibility, turbulence, dimensionality, and heat transfer. Parameters influencing aerodynamic flows and transition and influence of boundary layers on outer potential flow are presented, along with associated stall and drag mechanisms. Numerical solution techniques and exercises are included.Subjects

aerodynamics | aerodynamics | viscous fluids | viscous fluids | viscosity | viscosity | fundamental theorem of kinematics | fundamental theorem of kinematics | convection | convection | vorticity | vorticity | strain | strain | Eulerian description | Eulerian description | Lagrangian description | Lagrangian description | conservation of mass | conservation of mass | continuity | continuity | conservation of momentum | conservation of momentum | stress tensor | stress tensor | newtonian fluid | newtonian fluid | circulation | circulation | Navier-Stokes | Navier-Stokes | similarity | similarity | dimensional analysis | dimensional analysis | thin shear later approximation | thin shear later approximation | TSL coordinates | TSL coordinates | boundary conditions | boundary conditions | shear later categories | shear later categories | local scaling | local scaling | Falkner-Skan flows | Falkner-Skan flows | solution techniques | solution techniques | finite difference methods | finite difference methods | Newton-Raphson | Newton-Raphson | integral momentum equation | integral momentum equation | Thwaites method | Thwaites method | integral kinetic energy equation | integral kinetic energy equation | dissipation | dissipation | asymptotic perturbation | asymptotic perturbation | displacement body | displacement body | transpiration | transpiration | form drag | form drag | stall | stall | interacting boundary layer theory | interacting boundary layer theory | stability | stability | transition | transition | small-perturbation | small-perturbation | Orr-Somemerfeld | Orr-Somemerfeld | temporal amplification | temporal amplification | spatial amplification | spatial amplification | Reynolds | Reynolds | Prandtl | Prandtl | turbulent boundary layer | turbulent boundary layer | wake | wake | wall layers | wall layers | inner variables | inner variables | outer variables | outer variables | roughness | roughness | Clauser | Clauser | Dissipation formula | Dissipation formula | integral closer | integral closer | turbulence modeling | turbulence modeling | transport models | transport models | turbulent shear layers | turbulent shear layers | compressible then shear layers | compressible then shear layers | compressibility | compressibility | temperature profile | temperature profile | heat flux | heat flux | 3D boundary layers | 3D boundary layers | crossflow | crossflow | lateral dilation | lateral dilation | 3D separation | 3D separation | constant-crossflow | constant-crossflow | 3D transition | 3D transition | compressible thin shear layers | compressible thin shear layersLicense

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 metadataStructured Systems Analysis - Required Logical DFDs

Description

This example forms part of the "Required Logical DFDs" topic in the Structured Systems Analysis module.Subjects

ukoer | required logical dfds example | systems analysis | structured systems analysis | system analysis | structured system analysis | required logical dfd | required logical data flow diagrams | required logical data flow diagram | dfd | dfds | data flow diagram | data flow diagrams | logical dfd | logical dfds | logical data flow diagram | systems analysis example | structured systems analysis example | system analysis example | structured system analysis example | required logical dfd example | required logical data flow diagrams example | required logical data flow diagram example | dfd example | dfds example | data flow diagram example | data flow diagrams example | logical dfd example | logical dfds example | logical data flow diagram example | required logical dfds | 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 metadataStructured Systems Analysis - Required Logical DFDs

Description

This example forms part of the "Required Logical DFDs" topic in the Structured Systems Analysis module.Subjects

ukoer | required logical dfds example | systems analysis | structured systems analysis | system analysis | structured system analysis | required logical dfd | required logical data flow diagrams | required logical data flow diagram | dfd | dfds | data flow diagram | data flow diagrams | logical dfd | logical dfds | logical data flow diagram | systems analysis example | structured systems analysis example | system analysis example | structured system analysis example | required logical dfd example | required logical data flow diagrams example | required logical data flow diagram example | dfd example | dfds example | data flow diagram example | data flow diagrams example | logical dfd example | logical dfds example | logical data flow diagram example | required logical dfds | 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 metadataStructured Systems Analysis - Required Logical DFDs

Description

This example forms part of the "Required Logical DFDs" topic in the Structured Systems Analysis module.Subjects

ukoer | required logical dfds example | systems analysis | structured systems analysis | system analysis | structured system analysis | required logical dfd | required logical data flow diagrams | required logical data flow diagram | dfd | dfds | data flow diagram | data flow diagrams | logical dfd | logical dfds | logical data flow diagram | systems analysis example | structured systems analysis example | system analysis example | structured system analysis example | required logical dfd example | required logical data flow diagrams example | required logical data flow diagram example | dfd example | dfds example | data flow diagram example | data flow diagrams example | logical dfd example | logical dfds example | logical data flow diagram example | required logical dfds | 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 metadataDescription

This course is offered to undergraduates and introduces basic mathematical models of computation and the finite representation of infinite objects. The course is slower paced than 6.840J/18.404J. Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems. This course is offered to undergraduates and introduces basic mathematical models of computation and the finite representation of infinite objects. The course is slower paced than 6.840J/18.404J. Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems.Subjects

automata | automata | computability | computability | complexity | complexity | mathematical models | mathematical models | computation | computation | finite representation | finite representation | infinite objects | infinite objects | finite automata | finite automata | regular languages | regular languages | context-free languages | context-free languages | Turing machines | Turing machines | partial recursive functions | partial recursive functions | Church's Thesis | Church's Thesis | undecidability | undecidability | reducibility | reducibility | completeness | completeness | time complexity | time complexity | NP-completeness | NP-completeness | probabilistic computation | probabilistic computation | interactive proof systems | interactive proof systems | 6.045 | 6.045 | 18.400 | 18.400License

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 metadata17.869 Political Science Scope and Methods (MIT) 17.869 Political Science Scope and Methods (MIT)

Description

This course is designed to provide an introduction to a variety of empirical research methods used by political scientists. The primary aims of the course are to make you a more sophisticated consumer of diverse empirical research and to allow you to conduct sophisticated independent work in your junior and senior years. This is not a course in data analysis. Rather, it is a course on how to approach political science research. This course is designed to provide an introduction to a variety of empirical research methods used by political scientists. The primary aims of the course are to make you a more sophisticated consumer of diverse empirical research and to allow you to conduct sophisticated independent work in your junior and senior years. This is not a course in data analysis. Rather, it is a course on how to approach political science research.Subjects

political science | political science | empirical research | empirical research | scientific method | scientific method | research design | research design | models | models | samping | samping | statistical analysis | statistical analysis | measurement | measurement | ethics | ethics | empirical | empirical | research | research | scientific | scientific | methods | methods | statistics | statistics | statistical | statistical | analysis | analysis | political | political | politics | politics | science | science | design | design | sampling | sampling | theoretical | theoretical | observation | observation | data | data | case studies | case studies | cases | cases | empirical research methods | empirical research methods | political scientists | political scientists | empirical analysis | empirical analysis | theoretical analysis | theoretical analysis | research projects | research projects | department faculty | department faculty | inference | inference | writing | writing | revision | revision | oral presentations | oral presentations | experimental method | experimental method | theories | theories | political implications | political implicationsLicense

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

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

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

See all metadata18.404J Theory of Computation (MIT) 18.404J Theory of Computation (MIT)

Description

A more extensive and theoretical treatment of the material in 18.400J, Automata, Computability, and Complexity, emphasizing computability and computational complexity theory. Regular and context-free languages. Decidable and undecidable problems, reducibility, recursive function theory. Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems. A more extensive and theoretical treatment of the material in 18.400J, Automata, Computability, and Complexity, emphasizing computability and computational complexity theory. Regular and context-free languages. Decidable and undecidable problems, reducibility, recursive function theory. Time and space measures on computation, completeness, hierarchy theorems, inherently complex problems, oracles, probabilistic computation, and interactive proof systems.Subjects

computability | computability | computational complexity theory | computational complexity theory | Regular and context-free languages | Regular and context-free languages | Decidable and undecidable problems | Decidable and undecidable problems | reducibility | reducibility | recursive function theory | recursive function theory | Time and space measures on computation | Time and space measures on computation | completeness | completeness | hierarchy theorems | hierarchy theorems | inherently complex problems | inherently complex problems | oracles | oracles | probabilistic computation | probabilistic computation | interactive proof systems | interactive proof systems | 18.404 | 18.404 | 6.840 | 6.840License

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

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

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

See all metadataDescription

This course introduces basic mathematical models of computation and the finite representation of infinite objects. Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems. This course introduces basic mathematical models of computation and the finite representation of infinite objects. Topics covered include: finite automata and regular languages, context-free languages, Turing machines, partial recursive functions, Church's Thesis, undecidability, reducibility and completeness, time complexity and NP-completeness, probabilistic computation, and interactive proof systems.Subjects

automata | automata | computability | computability | complexity | complexity | mathematical models | mathematical models | computation | computation | finite representation | finite representation | infinite objects | infinite objects | finite automata | finite automata | regular languages | regular languages | context-free languages | context-free languages | Turing machines | Turing machines | partial recursive functions | partial recursive functions | Church's Thesis | Church's Thesis | undecidability | undecidability | reducibility | reducibility | completeness | completeness | time complexity | time complexity | NP-completeness | NP-completeness | probabilistic computation | probabilistic computation | interactive proof systems | interactive proof systems | 6.045 | 6.045 | 18.400 | 18.400License

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.823 Computer System Architecture (MIT) 6.823 Computer System Architecture (MIT)

Description

6.823 is a study of the evolution of computer architecture and the factors influencing the design of hardware and software elements of computer systems. Topics may include: instruction set design; processor micro-architecture and pipelining; cache and virtual memory organizations; protection and sharing; I/O and interrupts; in-order and out-of-order superscalar architectures; VLIW machines; vector supercomputers; multithreaded architectures; symmetric multiprocessors; and parallel computers. 6.823 is a study of the evolution of computer architecture and the factors influencing the design of hardware and software elements of computer systems. Topics may include: instruction set design; processor micro-architecture and pipelining; cache and virtual memory organizations; protection and sharing; I/O and interrupts; in-order and out-of-order superscalar architectures; VLIW machines; vector supercomputers; multithreaded architectures; symmetric multiprocessors; and parallel computers.Subjects

computer architecture | | computer architecture | | computer system architecture | | computer system architecture | | hardware | | hardware | | hardware design | | hardware design | | software | | software | | software design | | software design | | instruction set design | | instruction set design | | processor micro-architecture | | processor micro-architecture | | pipelining | | pipelining | | cache memory | | cache memory | | irtual memory | | irtual memory | | I/O | | I/O | | input/output | | input/output | | interrupts | | interrupts | | superscalar architectures | | superscalar architectures | | VLIW machines | | VLIW machines | | vector supercomputers | | vector supercomputers | | multithreaded architectures | | multithreaded architectures | | symmetric multiprocessors | | symmetric multiprocessors | | parallel computers | parallel computers | computer architecture | computer architecture | computer system architecture | computer system architecture | hardware | hardware | hardware design | hardware design | software | software | software design | software design | instruction set design | instruction set design | processor micro-architecture | processor micro-architecture | pipelining | pipelining | cache memory | cache memory | virtual memory | virtual memory | I/O | I/O | input/output | input/output | interrupts | interrupts | superscalar architectures | superscalar architectures | VLIW machines | VLIW machines | vector supercomputers | vector supercomputers | multithreaded architectures | multithreaded architectures | symmetric multiprocessors | symmetric multiprocessorsLicense

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 metadata14.01SC Principles of Microeconomics (MIT) 14.01SC Principles of Microeconomics (MIT)

Description

Includes audio/video content: AV lectures. 14.01 Principles of Microeconomics is an introductory undergraduate course that teaches the fundamentals of microeconomics. This course introduces microeconomic concepts and analysis, supply and demand analysis, theories of the firm and individual behavior, competition and monopoly, and welfare economics. Students will also be introduced to the use of microeconomic applications to address problems in current economic policy throughout the semester. This course is a core subject in MIT's undergraduate Energy Studies Minor. This Institute-wide program complements the deep expertise obtained in any major with a broad understanding of the interlinked realms of science, technology, and social sciences as they relate to energy and associated environmen Includes audio/video content: AV lectures. 14.01 Principles of Microeconomics is an introductory undergraduate course that teaches the fundamentals of microeconomics. This course introduces microeconomic concepts and analysis, supply and demand analysis, theories of the firm and individual behavior, competition and monopoly, and welfare economics. Students will also be introduced to the use of microeconomic applications to address problems in current economic policy throughout the semester. This course is a core subject in MIT's undergraduate Energy Studies Minor. This Institute-wide program complements the deep expertise obtained in any major with a broad understanding of the interlinked realms of science, technology, and social sciences as they relate to energy and associated environmenSubjects

Microeconomics | Microeconomics | prices | prices | normative economics | normative economics | positive economics | positive economics | microeconomic applications | microeconomic applications | supply | supply | demand | demand | equilibrium | equilibrium | demand shift | demand shift | supply shift | supply shift | government interference | government interference | elasticity | elasticity | revenue | revenue | empirical economics | empirical economics | consumer theory | consumer theory | preference assumptions | preference assumptions | indifference curves | indifference curves | utility functions | utility functions | marginal utility | marginal utility | budget constraints | budget constraints | marginal rate of transformation | marginal rate of transformation | opportunity cost | opportunity cost | constrained utility maximization | constrained utility maximization | corner solutions | corner solutions | Engel curves | Engel curves | income effect | income effect | substitution effect | substitution effect | Giffin good | Giffin good | labor economics | labor economics | child labor | child labor | producer theory | producer theory | variable inputs | variable inputs | fixed inputs | fixed inputs | firm production functions | firm production functions | marginal rate of technical substitution | marginal rate of technical substitution | returns to scale | returns to scale | productivity | productivity | perfect competition | perfect competition | search theory | search theory | residual demand | residual demand | shutdown decisions | shutdown decisions | market equilibrium | market equilibrium | agency problem | agency problem | welfare economics | welfare economics | consumer surplus | consumer surplus | producer surplus | producer surplus | dead weight loss | dead weight loss | monopoly | monopoly | oligopoly | oligopoly | market power | market power | price discrimination | price discrimination | price regulation | price regulation | antitrust policy | antitrust policy | mergers | mergers | cartel | cartel | game theory | game theory | Nash equilibrium | Nash equilibrium | Cournot model | Cournot model | duopoly | duopoly | non-cooperative competition | non-cooperative competition | Bertrand competition | Bertrand competition | factor markets | factor markets | international trade | international trade | uncertainty | uncertainty | capital markets | capital markets | intertemporal choice | intertemporal choice | real interest rate | real interest rate | compounding | compounding | inflation | inflation | investment | investment | discount rate | discount rate | net present value | net present value | income distribution | income distribution | social welfare function | social welfare function | Utilitarianism | Utilitarianism | Raulsian criteria | Raulsian criteria | Nozickian | Nozickian | commodity egalitarianism | commodity egalitarianism | isowelfare curves | isowelfare curves | social insurance | social insurance | social security | social security | moral hazard | moral hazard | taxation | taxation | EITC | EITC | healthcare | healthcare | PPACA | PPACALicense

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 metadata16.225 Computational Mechanics of Materials (MIT) 16.225 Computational Mechanics of Materials (MIT)

Description

16.225 is a graduate level course on Computational Mechanics of Materials. The primary focus of this course is on the teaching of state-of-the-art numerical methods for the analysis of the nonlinear continuum response of materials. The range of material behavior considered in this course includes: linear and finite deformation elasticity, inelasticity and dynamics. Numerical formulation and algorithms include: variational formulation and variational constitutive updates, finite element discretization, error estimation, constrained problems, time integration algorithms and convergence analysis. There is a strong emphasis on the (parallel) computer implementation of algorithms in programming assignments. The application to real engineering applications and problems in engineering science is 16.225 is a graduate level course on Computational Mechanics of Materials. The primary focus of this course is on the teaching of state-of-the-art numerical methods for the analysis of the nonlinear continuum response of materials. The range of material behavior considered in this course includes: linear and finite deformation elasticity, inelasticity and dynamics. Numerical formulation and algorithms include: variational formulation and variational constitutive updates, finite element discretization, error estimation, constrained problems, time integration algorithms and convergence analysis. There is a strong emphasis on the (parallel) computer implementation of algorithms in programming assignments. The application to real engineering applications and problems in engineering science isSubjects

Computational Mechanics | Computational Mechanics | Computation | Computation | Mechanics | Mechanics | Materials | Materials | Numerical Methods | Numerical Methods | Numerical | Numerical | Nonlinear Continuum Response | Nonlinear Continuum Response | Continuum | Continuum | Deformation | Deformation | Elasticity | Elasticity | Inelasticity | Inelasticity | Dynamics | Dynamics | Variational Formulation | Variational Formulation | Variational Constitutive Updates | Variational Constitutive Updates | Finite Element | Finite Element | Discretization | Discretization | Error Estimation | Error Estimation | Constrained Problems | Constrained Problems | Time Integration | Time Integration | Convergence Analysis | Convergence Analysis | Programming | Programming | Continuum Response | Continuum Response | Computational | Computational | state-of-the-art | state-of-the-art | methods | methods | modeling | modeling | simulation | simulation | mechanical | mechanical | response | response | engineering | engineering | aerospace | aerospace | civil | civil | material | material | science | science | biomechanics | biomechanics | behavior | behavior | finite | finite | deformation | deformation | elasticity | elasticity | inelasticity | inelasticity | contact | contact | friction | friction | coupled | coupled | numerical | numerical | formulation | formulation | algorithms | algorithms | Variational | Variational | constitutive | constitutive | updates | updates | element | element | discretization | discretization | mesh | mesh | generation | generation | error | error | estimation | estimation | constrained | constrained | problems | problems | time | time | convergence | convergence | analysis | analysis | parallel | parallel | computer | computer | implementation | implementation | programming | programming | assembly | assembly | equation-solving | equation-solving | formulating | formulating | implementing | implementing | complex | complex | approximations | approximations | equations | equations | motion | motion | dynamic | dynamic | deformations | deformations | continua | continua | plasticity | plasticity | rate-dependency | rate-dependency | integration | integrationLicense

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

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

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

See all metadata