Searching for scr : 13843 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

Description

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

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

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

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

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

See all metadataDescription

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

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

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

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

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

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

Description

This subject offers an introduction to Discrete Mathematics oriented toward Computer Science and Engineering. The subject coverage divides roughly into thirds: Fundamental concepts of mathematics: definitions, proofs, sets, functions, relations. Discrete structures: graphs, state machines, modular arithmetic, counting. Discrete probability theory. On completion of 6.042, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in Computer Science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems. This subject offers an introduction to Discrete Mathematics oriented toward Computer Science and Engineering. The subject coverage divides roughly into thirds: Fundamental concepts of mathematics: definitions, proofs, sets, functions, relations. Discrete structures: graphs, state machines, modular arithmetic, counting. Discrete probability theory. On completion of 6.042, students will be able to explain and apply the basic methods of discrete (noncontinuous) mathematics in Computer Science. They will be able to use these methods in subsequent courses in the design and analysis of algorithms, computability theory, software engineering, and computer systems.Subjects

discrete mathematics | discrete mathematics | definitions | definitions | proofs | proofs | sets | sets | functions | functions | relations | relations | discrete structures | discrete structures | graphs | graphs | state machines | state machines | modular arithmetic | modular arithmetic | counting | counting | discrete probability theory | discrete probability theoryLicense

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

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

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

See all metadata6.341 Discrete-Time Signal Processing (MIT) 6.341 Discrete-Time Signal Processing (MIT)

Description

This class addresses the representation, analysis, and design of discrete time signals and systems. The major concepts covered include: Discrete-time processing of continuous-time signals; decimation, interpolation, and sampling rate conversion; flowgraph structures for DT systems; time-and frequency-domain design techniques for recursive (IIR) and non-recursive (FIR) filters; linear prediction; discrete Fourier transform, FFT algorithm; short-time Fourier analysis and filter banks; multirate techniques; Hilbert transforms; Cepstral analysis and various applications. Acknowledgements I would like to express my thanks to Thomas Baran, Myung Jin Choi, and Xiaomeng Shi for compiling the lecture notes on this site from my individual lectures and handouts and their class notes during the semest This class addresses the representation, analysis, and design of discrete time signals and systems. The major concepts covered include: Discrete-time processing of continuous-time signals; decimation, interpolation, and sampling rate conversion; flowgraph structures for DT systems; time-and frequency-domain design techniques for recursive (IIR) and non-recursive (FIR) filters; linear prediction; discrete Fourier transform, FFT algorithm; short-time Fourier analysis and filter banks; multirate techniques; Hilbert transforms; Cepstral analysis and various applications. Acknowledgements I would like to express my thanks to Thomas Baran, Myung Jin Choi, and Xiaomeng Shi for compiling the lecture notes on this site from my individual lectures and handouts and their class notes during the semestSubjects

discrete time signals and systems | discrete time signals and systems | discrete-time processing of continuous-time signals | discrete-time processing of continuous-time signals | decimation | decimation | interpolation | interpolation | sampling rate conversion | sampling rate conversion | Flowgraph structures | Flowgraph structures | time- and frequency-domain design techniques for recursive (IIR) and non-recursive (FIR) filters | time- and frequency-domain design techniques for recursive (IIR) and non-recursive (FIR) filters | linear prediction | linear prediction | Discrete Fourier transform | Discrete Fourier transform | FFT algorithm | FFT algorithm | Short-time Fourier analysis and filter banks | Short-time Fourier analysis and filter banks | Multirate techniques | Multirate techniques | Hilbert transforms | Hilbert transforms | Cepstral analysis | Cepstral analysisLicense

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 metadataLooking at, describing and identifying objects Looking at, describing and identifying objects

Description

This free course, Looking at, describing and identifying objects, will enable you to practise and develop your skills of observation and description of objects. It will also enable you to interpret objects and work towards writing your own object life cycle. You will also work with, and understand artefact databases. First published on Thu, 10 Dec 2015 as Looking at, describing and identifying objects. To find out more visit The Open University's Openlearn website. Creative-Commons 2015 This free course, Looking at, describing and identifying objects, will enable you to practise and develop your skills of observation and description of objects. It will also enable you to interpret objects and work towards writing your own object life cycle. You will also work with, and understand artefact databases. First published on Thu, 10 Dec 2015 as Looking at, describing and identifying objects. To find out more visit The Open University's Openlearn website. Creative-Commons 2015Subjects

History & The Arts | History & The Arts | History | History | A105_1 | A105_1 | describing | describing | identifying | identifying | artefacts | artefacts | objects | objects | description | description | interpretation | interpretation | observation | observationLicense

Except for third party materials and otherwise stated (see http://www.open.ac.uk/conditions terms and conditions), this content is made available under a http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ Creative Commons Attribution-NonCommercial-ShareAlike 2.0 Licence Licensed under a Creative Commons Attribution - NonCommercial-ShareAlike 2.0 Licence - see http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ - Original copyright The Open UniversitySite sourced from

http://www.open.edu/openlearn/rss/try-contentAttribution

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

See all metadataDescription

This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds: Fundamental concepts of Mathematics: definitions, proofs, sets, functions, relations. Discrete structures: modular arithmetic, graphs, state machines, counting. Discrete probability theory. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5512 (Mathematics for Computer Science). Contributors Srinivas Devadas Lars Engebretsen David Karger Eric Lehman Thomson Leighton Charles Leiserson Nancy Lynch Santosh Vempala This is an introductory course in Discrete Mathematics oriented toward Computer Science and Engineering. The course divides roughly into thirds: Fundamental concepts of Mathematics: definitions, proofs, sets, functions, relations. Discrete structures: modular arithmetic, graphs, state machines, counting. Discrete probability theory. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5512 (Mathematics for Computer Science). Contributors Srinivas Devadas Lars Engebretsen David Karger Eric Lehman Thomson Leighton Charles Leiserson Nancy Lynch Santosh VempalaSubjects

discrete mathematics | discrete mathematics | computer science | computer science | definitions | definitions | proofs | proofs | sets | sets | functions | functions | relations | relations | discrete structures | discrete structures | modular arithmetic | modular arithmetic | graphs | graphs | state machines | state machines | counting | counting | discrete probability theory | discrete probability theory | probability | probability | 6.042 | 6.042 | 18.062 | 18.062License

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

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

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

See all metadataDescription

In this course, we will address how transcriptional regulators both prohibit and drive differentiation during the course of development. How does a stem cell know when to remain a stem cell and when to become a specific cell type? Are there global differences in the way the genome is read in multipotent and terminally differentiated cells? We will explore how stem cell pluripotency is preserved, how master regulators of cell-fate decisions execute developmental programs, and how chromatin regulators control undifferentiated versus differentiated states. Additionally, we will discuss how aberrant regulation of transcriptional regulators produces disorders such as developmental defects and cancer.This course is one of many Advanced Undergraduate Seminars offered by the Biology Department at In this course, we will address how transcriptional regulators both prohibit and drive differentiation during the course of development. How does a stem cell know when to remain a stem cell and when to become a specific cell type? Are there global differences in the way the genome is read in multipotent and terminally differentiated cells? We will explore how stem cell pluripotency is preserved, how master regulators of cell-fate decisions execute developmental programs, and how chromatin regulators control undifferentiated versus differentiated states. Additionally, we will discuss how aberrant regulation of transcriptional regulators produces disorders such as developmental defects and cancer.This course is one of many Advanced Undergraduate Seminars offered by the Biology Department atSubjects

blueprint of life | blueprint of life | transcription | transcription | stem cells | stem cells | differentiation | differentiation | human tissues | human tissues | tissue regeneration | tissue regeneration | human disease | human disease | RNA and protein expression patterns | RNA and protein expression patterns | transcriptional regulation | transcriptional regulation | specialized gene expression programs | specialized gene expression programs | genome | genome | multipotent | multipotent | terminally differentiated | terminally differentiated | pluripotency | pluripotency | master regulators | master regulators | chromatin regulators | chromatin regulators | developmental defects | developmental defects | cancer | cancerLicense

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

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

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

See all metadataDescription

Discrimination in the labour market exists in many forms: the 'glass ceiling', ageism, racism, and so on. This free course, Economics explains discrimination in the labour market, will help you look at this problem from a new perspective: through economics. You will learn how economists have tried to understand what drives this distortion of the labour market and why women and those from minority ethnic groups seem to suffer the most. First published on Thu, 14 Jul 2011 as Economics explains discrimination in the labour market. To find out more visit The Open University's Openlearn website. Creative-Commons 2011 Discrimination in the labour market exists in many forms: the 'glass ceiling', ageism, racism, and so on. This free course, Economics explains discrimination in the labour market, will help you look at this problem from a new perspective: through economics. You will learn how economists have tried to understand what drives this distortion of the labour market and why women and those from minority ethnic groups seem to suffer the most. First published on Thu, 14 Jul 2011 as Economics explains discrimination in the labour market. To find out more visit The Open University's Openlearn website. Creative-Commons 2011License

Except for third party materials and otherwise stated (see http://www.open.ac.uk/conditions terms and conditions), this content is made available under a http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ Creative Commons Attribution-NonCommercial-ShareAlike 2.0 Licence Licensed under a Creative Commons Attribution - NonCommercial-ShareAlike 2.0 Licence - see http://creativecommons.org/licenses/by-nc-sa/2.0/uk/ - Original copyright The Open UniversitySite sourced from

http://www.open.edu/openlearn/rss/try-contentAttribution

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

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

Description

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

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

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

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

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

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

Description

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

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

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

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

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

See all metadataRES.6-008 Digital Signal Processing (MIT) RES.6-008 Digital Signal Processing (MIT)

Description

Includes audio/video content: AV lectures. This course was developed in 1987 by the MIT Center for Advanced Engineering Studies. It was designed as a distance-education course for engineers and scientists in the workplace. Advances in integrated circuit technology have had a major impact on the technical areas to which digital signal processing techniques and hardware are being applied. A thorough understanding of digital signal processing fundamentals and techniques is essential for anyone whose work is concerned with signal processing applications. Digital Signal Processing begins with a discussion of the analysis and representation of discrete-time signal systems, including discrete-time convolution, difference equations, the z-transform, and the discrete-time Fourier transform. Emphasi Includes audio/video content: AV lectures. This course was developed in 1987 by the MIT Center for Advanced Engineering Studies. It was designed as a distance-education course for engineers and scientists in the workplace. Advances in integrated circuit technology have had a major impact on the technical areas to which digital signal processing techniques and hardware are being applied. A thorough understanding of digital signal processing fundamentals and techniques is essential for anyone whose work is concerned with signal processing applications. Digital Signal Processing begins with a discussion of the analysis and representation of discrete-time signal systems, including discrete-time convolution, difference equations, the z-transform, and the discrete-time Fourier transform. EmphasiSubjects

discrete-time signals and systems | discrete-time signals and systems | convolution difference equations | convolution difference equations | z-transform | z-transform | digital network structure | digital network structure | recursive infinite impulse response | recursive infinite impulse response | nonrecursive finite impulse response | nonrecursive finite impulse response | digital filter design | digital filter design | fast Fourier transform algorithm | fast Fourier transform algorithm | discrete Fourier transform | discrete Fourier transformLicense

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 metadataUser-produced Hebrew Prayer Books and Shared Iconography

Description

Some Hebrew manuscripts were produced in Christian workshops, others were made by Jewish artists themselves for their own use. Piet looks at examples of these and explores the shared iconography between Christian and Jewish faiths, such as the unicorn. Some Hebrew manuscripts were produced in Christian workshops, while others were made by Jewish artists themselves for their own use. An Ashkenazic siddur stands out as an example of a Jewish scribe-artist, influenced by the visual culture of his time, who drew on models, motifs and specialized techniques current in fifteenth-century Germany to illustrate his prayer book. Hebrew manuscripts shared iconography with other manuscripts from the same geo-cultural area. Italian Hebrew manuscripts thus recall the scenery of central Italy and depict Wales; http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Subjects

written word | christian | jews | manuscript | bible | muslim | torah | library | religion | bodleian | muslims | books | exhibition | hebrew | oxford | an | manuscripts | book | christians | Jew | an | manuscripts | book | christians | Jew | 2010-02-18License

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

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

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

See all metadataUser-produced Hebrew Prayer Books and Shared Iconography

Description

Some Hebrew manuscripts were produced in Christian workshops, others were made by Jewish artists themselves for their own use. Piet looks at examples of these and explores the shared iconography between Christian and Jewish faiths, such as the unicorn. Some Hebrew manuscripts were produced in Christian workshops, while others were made by Jewish artists themselves for their own use. An Ashkenazic siddur stands out as an example of a Jewish scribe-artist, influenced by the visual culture of his time, who drew on models, motifs and specialized techniques current in fifteenth-century Germany to illustrate his prayer book. Hebrew manuscripts shared iconography with other manuscripts from the same geo-cultural area. Italian Hebrew manuscripts thus recall the scenery of central Italy and depict Wales; http://creativecommons.org/licenses/by-nc-sa/2.0/uk/Subjects

written word | christian | jews | manuscript | bible | muslim | torah | library | religion | bodleian | muslims | books | exhibition | hebrew | oxford | an | manuscripts | book | christians | Jew | an | manuscripts | book | christians | Jew | 2010-02-18License

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

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

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

See all metadataAll About Prescriptions Workshop

Description

This workshop will facilitate interprofessional groups to review a number of completed 'mock' prescriptions to identify what is wrong with them. Additionally the groups will discuss the issues that each mock prescription raises. The groups will also identify issues that this raises for interprofessional working.Subjects

independant-supplementary-prescribing | prescribing | prescription writing | prescription errors | prescription fraud | prescription legal requirements | interprofessional | ukoer | tigeroer | Subjects allied to medicine | B000License

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 workshop aims to appraise the use of the prescribing pyrmaid in relation to non medical prescribing decisions.Subjects

independant-supplementary-prescribing | prescribing | prescribing pyramid | non medical prescribing | supplementary prescribing | independent prescribing | interprofessional collaboration | interprofessional | ukoer | tigeroer | Subjects allied to medicine | B000License

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 metadataJoseph Tombling, arrested for obtaining money by false pretences

Description

Name: Joseph Tombling Arrested for: Larceny Arrested at: North Shields Police Station Arrested on: 4 February 1905 Tyne and Wear Archives ref: DX1388-1-63-Joseph Tombling The Shields Daily News for 10 February 1905 reports: ?SERIOUS CHARGES AGAINST A NORTH SHIELDS YOUTH. COLLECTING FOR A BOGUS CRICKET CLUB. THREE MONTHS? IMPRISONMENT. At North Shields Police Court today Joseph Tomblin (17) was charged with having obtained by means of false pretences 2s 6d from Henry Dillon Irvin on the 1st inst. with intent to cheat and defraud. Prosecutor who resides at 9 Prudhoe Terrace, Tynemouth, said that on the 1st inst. the prisoner came to his house and at his request was turned away. Subsequently the accused met him in the street and asked him for a subscription towards the Tynemouth Boys Cricket Club. He asked him to accompany him to his rooms. Accused did so and there he put certain questions to him. Prisoner produced a subscription list and said the club had made arrangements with the North Shields Athletic Association Football Club for the rental of their field. On this representation he gave him 2s 6d and finding afterwards from inquiries that his statements were incorrect he applied for a warrant for his arrest. He produced the list, which bore his and several other names. Septimus Crowell, 39 Jackson Street, who is secretary of the North Shields Athletic Club said he had never heard of such as club as the Tynemouth Boys Cricket Club. Detective Sergt. Scougal said he arrested the accused in Front Street, Tynemouth, on the night of the 3rd inst. and charged him. He made no reply. He took him to the Tynemouth Divisional Police Station and upon searching him he found in his possession several lists (produced). In conversation the accused said he had collected the money shewn on the lists upon his own account. There was no such club as the Tynemouth Boys Cricket Club. An organization bearing this name did exist about five years ago but he was not a member of it. On one of the lists appeared the name of A.B. Brown, who was supposed to be the captain of the club. Witness asked him who this person was and he replied that he did not know. Some of the lists were dated three or four years back. During that period the accused had been collecting money for a football club at one part of the year and for a cricket club at another. Accused was formally charged. He pleaded guilty and had nothing to say. Prisoner was then charged with having obtained by means of false pretences 9d from Henry Jarvis Ward in the latter part of January. Prosecutor who lives at No. Albury Park Road said the accused came to his house in the latter part of January and told him that arrangements had been made for the renting of a field for the club and that all the money had been subscribed with the exception of 2s 6d. Accused had been coming to him twice a year for at least for years collecting subscriptions for a football and a cricket club. Detective Sergt. Scougal proved the arrest and prisoner pleaded guilty. A third charge was preferred against the accused of having obtained by similar means 5s from Coun. Geo. Stephenson, steam trawler owner, No. 1 Park Crescent. Accused said he only got 2s 6d. The father of the accused was asked by the magistrates if he could account for his son?s misconduct. He blamed a certain religious body in Tynemouth, the officials of which sent boys to collect subscriptions. They did not give them officially signed papers or collecting books and this created a great temptation. The Chairman (Capt J. Bolt) said it was a very bad case. The Bench, however, had decided to deal leniently with the accused. He would have to go to prison in the second division for one month on each charge ? three months in all?. The Shields Daily News for 1 September 1905 reports: ?ASSAULTS AT NORTH SHIELDS. YOUNG MAN FINED. At the North Shields Police Court today, Joseph Tombling, a young man residing at 25 Edith Street, Spital Dene, was summoned for having assaulted Mrs Jane Mitchell, who resides in the same thoroughfare, and her daughter, Jane Mitchell, on the 25th ult. Mr A. Whitehorn, who appeared on behalf of the complainants, said they were mother and daughter. They resided at 47 Edith Street, Spital Dene, whilst the defendant lived at No. 25 in the same street. On Thursday afternoon last Mrs Mitchell was wheeling a pram past the defendant?s mother?s door when a brother of the defendant jeered at her. She took no notice of him but next day seeing him in the back lane she remonstrated with him about jeering at her. At this time the defendant came upon the scene and rolling up his sleeves offered to fight anyone in Mitchell?s house. Mrs Mitchell advised him to go away and to frighten him said she would throw some water over him. She put the pail underneath the tap and let the water run but before it was half full the defendant ran into the yard, took hold of her by the throat and knocked her head against the wall. Mr Whitehorn described the attack as a most outrageous one and asked the Bench to deal severely with the defendant. The daughter of Mrs Mitchell called the defendant a coward for striking a woman, whereupon the defendant struck her a violent blow on the side of the face. Complainants bore out this testimony. Defendant alleged that Mrs and Miss Mitchell made a practice of reminding him of the time he was in gaol and telling him he would be there again. He denied assaulting either of the complainants and called his brother who gave evidence on his behalf. A fine of 5s and costs was imposed in each case, with the alternative of 14 days imprisonment?. These images are a selection from an album of photographs of prisoners brought before the North Shields Police Court between 1902 and 1916 in the collection of Tyne & Wear Archives (TWA ref DX1388/1). This set contains mugshots of boys and girls under the age of 21. This reflects the fact that until 1970 that was the legal age of majority in the UK. (Copyright) We're happy for you to share this digital image within the spirit of The Commons. Please cite 'Tyne & Wear Archives & Museums' when reusing. Certain restrictions on high quality reproductions and commercial use of the original physical version apply though; if you're unsure please email archives@twmuseums.org.uk.Subjects

prisoner | crime | criminal | northshields | policestation | mugshot | imprisoned | arrested | cap | child | larceny | imprisonment | deception | defrauding | fraud | violence | assault | falsepretences | socialhistory | blackandwhitephotograph | neutralbackground | mark | scratch | blur | grain | digitalimage | fascinating | unusual | criminalrecord | publicrecords | portrait | criminalfacesofnorthshieldsthechildren | josephtombling | northshieldspolicestation | northshieldspolicecourt | 4february1905 | theshieldsdailynews | 10february1905 | youth | seriouscharges | insincere | bogus | cricketclub | collection | threemonthsimprisonment | cheat | defraud | tynemouth | 9prudhoeterrace | subscription | tynemouthboys | northshieldsathleticassociationfootballclub | warrant | arrest | detectivesergtscougal | tynemouthdivisionalpolicestation | possession | money | payments | guilty | jacket | tie | shirt | hat | boar | board | metalplate | screw | chalk | tyneandweararchivesrefdx1388163josephtombling | temptation | seated | edwardian | youngLicense

No known copyright restrictionsSite sourced from

Tyne & Wear Archives & Museums | FlickRAttribution

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

See all metadata15.093 Optimization Methods (SMA 5213) (MIT) 15.093 Optimization Methods (SMA 5213) (MIT)

Description

This course introduces the principal algorithms for linear, network, discrete, nonlinear, dynamic optimization and optimal control. Emphasis is on methodology and the underlying mathematical structures. Topics include the simplex method, network flow methods, branch and bound and cutting plane methods for discrete optimization, optimality conditions for nonlinear optimization, interior point methods for convex optimization, Newton's method, heuristic methods, and dynamic programming and optimal control methods. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5213 (Optimisation Methods). This course introduces the principal algorithms for linear, network, discrete, nonlinear, dynamic optimization and optimal control. Emphasis is on methodology and the underlying mathematical structures. Topics include the simplex method, network flow methods, branch and bound and cutting plane methods for discrete optimization, optimality conditions for nonlinear optimization, interior point methods for convex optimization, Newton's method, heuristic methods, and dynamic programming and optimal control methods. This course was also taught as part of the Singapore-MIT Alliance (SMA) programme as course number SMA 5213 (Optimisation Methods).Subjects

principal algorithms | principal algorithms | linear | linear | network | network | discrete | discrete | nonlinear | nonlinear | dynamic optimization | dynamic optimization | optimal control | optimal control | methodology and the underlying mathematical structures | methodology and the underlying mathematical structures | simplex method | simplex method | network flow methods | network flow methods | branch and bound and cutting plane methods for discrete optimization | branch and bound and cutting plane methods for discrete optimization | optimality conditions for nonlinear optimization | optimality conditions for nonlinear optimization | interior point methods for convex optimization | interior point methods for convex optimization | Newton's method | Newton's method | heuristic methods | heuristic methods | dynamic programming | dynamic programming | optimal control methods | optimal control methods | SMA 5213 | SMA 5213License

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

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

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

See all metadata12.950 Atmospheric and Oceanic Modeling (MIT) 12.950 Atmospheric and Oceanic Modeling (MIT)

Description

The numerical methods, formulation and parameterizations used in models of the circulation of the atmosphere and ocean will be described in detail. Widely used numerical methods will be the focus but we will also review emerging concepts and new methods. The numerics underlying a hierarchy of models will be discussed, ranging from simple GFD models to the high-end GCMs. In the context of ocean GCMs, we will describe parameterization of geostrophic eddies, mixing and the surface and bottom boundary layers. In the atmosphere, we will review parameterizations of convection and large scale condensation, the planetary boundary layer and radiative transfer. The numerical methods, formulation and parameterizations used in models of the circulation of the atmosphere and ocean will be described in detail. Widely used numerical methods will be the focus but we will also review emerging concepts and new methods. The numerics underlying a hierarchy of models will be discussed, ranging from simple GFD models to the high-end GCMs. In the context of ocean GCMs, we will describe parameterization of geostrophic eddies, mixing and the surface and bottom boundary layers. In the atmosphere, we will review parameterizations of convection and large scale condensation, the planetary boundary layer and radiative transfer.Subjects

numerical methods | numerical methods | formulation | formulation | parameterizations | parameterizations | models of the circulation of the atmosphere and ocean | models of the circulation of the atmosphere and ocean | numerics underlying a hierarchy of models | numerics underlying a hierarchy of models | simple GFD models | simple GFD models | high-end GCMs | high-end GCMs | ocean GCMs | ocean GCMs | parameterization of geostrophic eddies | parameterization of geostrophic eddies | mixing | mixing | surface and bottom boundary layers | surface and bottom boundary layers | atmosphere | atmosphere | parameterizations of convection | parameterizations of convection | large scale condensation | large scale condensation | planetary boundary layer | planetary boundary layer | radiative transfer | radiative transfer | finite difference method | finite difference method | Spatial discretization | Spatial discretization | numerical dispersion | numerical dispersion | Series expansion | Series expansion | Time-stepping | Time-stepping | Space-time discretization | Space-time discretization | Shallow water dynamics | Shallow water dynamics | Barotropic models | Barotropic models | Quasi-geostrophic equations | Quasi-geostrophic equations | Quasi-geostrophic models | Quasi-geostrophic models | Eddy parameterization | Eddy parameterization | Vertical coordinates | Vertical coordinates | primitive equations | primitive equations | Boundary layer parameterizations | Boundary layer parameterizationsLicense

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

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

See all metadataDescription

ebook version of An account of the state of learning in the empire of Lilliput: Together with the history and character of Bullum the Emperor's Library-Keeper. Faithfully transcribed out of Captain Lemuel Gulliver's General description of the empire of Lilliput, ... ebook version of An account of the state of learning in the empire of Lilliput: Together with the history and character of Bullum the Emperor's Library-Keeper. Faithfully transcribed out of Captain Lemuel Gulliver's General description of the empire of Lilliput, ...License

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

http://www.ota.ox.ac.uk/catalogue/epubfeed.rssAttribution

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

See all metadataDescription

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

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

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

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

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

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

Description

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

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

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

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

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

See all metadata15.053 Introduction to Optimization (MIT) 15.053 Introduction to Optimization (MIT)

Description

15.053 is an undergraduate subject in the theory and practice of optimization. We will consider optimization models with applications to transportation, logistics, manufacturing, computer science, E-business, project management, finance as well as several other domains. This subject will survey some of the applications of optimization as well as heuristics, and we will present algorithms and theory for linear programming, dynamic programming, integer programming, and non-linear programming.One way of summarizing a subject is a lecture by lecture description of the subject, or a description of the methodologies presented in the subject. We do list a lecture by lecture description, but first we describe several cross cutting themes. 15.053 is an undergraduate subject in the theory and practice of optimization. We will consider optimization models with applications to transportation, logistics, manufacturing, computer science, E-business, project management, finance as well as several other domains. This subject will survey some of the applications of optimization as well as heuristics, and we will present algorithms and theory for linear programming, dynamic programming, integer programming, and non-linear programming.One way of summarizing a subject is a lecture by lecture description of the subject, or a description of the methodologies presented in the subject. We do list a lecture by lecture description, but first we describe several cross cutting themes.Subjects

finance | finance | project management | project management | E-commerce | E-commerce | heuristics | heuristics | non-linear programming | non-linear programming | integer programming | integer programming | dynamic programming | dynamic programming | network optimization | network optimization | linear programming | linear programmingLicense

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

ebook version of Hymns founded on various texts in the holy scriptures: By the late Reverend Philip Doddridge, D.D. Published from the author's manuscript by Job Orton. ebook version of Hymns founded on various texts in the holy scriptures: By the late Reverend Philip Doddridge, D.D. Published from the author's manuscript by Job Orton.License

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

http://www.ota.ox.ac.uk/catalogue/epubfeed.rssAttribution

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

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

Description

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

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

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

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

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

See all metadataDescription

ebook version of A description of the city, college, and cathedral of Winchester: ... The whole illustrated with several curious ... particulars, collected from a manuscript of Anthony Wood, ... ebook version of A description of the city, college, and cathedral of Winchester: ... The whole illustrated with several curious ... particulars, collected from a manuscript of Anthony Wood, ...License

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

http://www.ota.ox.ac.uk/catalogue/epubfeed.rssAttribution

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

See all metadata