LEADER 02186nam 2200589 a 450 001 9910461604203321 005 20200520144314.0 010 $a1-283-12228-6 010 $a9786613122285 010 $a0-8264-4106-8 035 $a(CKB)2670000000092777 035 $a(EBL)711099 035 $a(OCoLC)727649601 035 $a(SSID)ssj0000521782 035 $a(PQKBManifestationID)11320602 035 $a(PQKBTitleCode)TC0000521782 035 $a(PQKBWorkID)10524354 035 $a(PQKB)11304656 035 $a(MiAaPQ)EBC711099 035 $a(Au-PeEL)EBL711099 035 $a(CaPaEBR)ebr10472156 035 $a(CaONFJC)MIL312228 035 $a(EXLCZ)992670000000092777 100 $a20070425d2006 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aCreative teaching$b[electronic resource] $egetting it right /$fDavid Starbuck 210 $aLondon ;$aNew York $cContinuum$dc2006 215 $a1 online resource (151 p.) 225 1 $aPractical Teaching Guides 300 $aIncludes index. 311 $a0-8264-9158-8 327 $aCover; Half-title; Title; Copyright; Contents; 1 Being creative; 2 The creative classroom; 3 The creative school 330 $aMost teachers accept that learning is most effective when it is enjoyable, but they are given little direct advice about how to achieve the creative and motivating classrooms that educationalists appeal for. This fascinating book creates a coherent picture of how teachers can make learning easier and more enjoyable for their pupils, including activity ideas, self-evaluation exercises and adaptable action plans for improving both classroom and whole-school ethos. 410 0$aPractical Teaching Guides 606 $aEffective teaching 606 $aCreative teaching 608 $aElectronic books. 615 0$aEffective teaching. 615 0$aCreative teaching. 676 $a371.102 700 $aStarbuck$b David$0918665 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910461604203321 996 $aCreative teaching$92060238 997 $aUNINA LEADER 05392nam 2200661 a 450 001 9910831074003321 005 20170809160936.0 010 $a1-283-22799-1 010 $a9786613227997 010 $a1-118-16439-3 010 $a1-118-16440-7 035 $a(CKB)2550000000043362 035 $a(EBL)818908 035 $a(OCoLC)757394280 035 $a(SSID)ssj0000544874 035 $a(PQKBManifestationID)11327816 035 $a(PQKBTitleCode)TC0000544874 035 $a(PQKBWorkID)10553718 035 $a(PQKB)11325313 035 $a(MiAaPQ)EBC818908 035 $a(PPN)250199033 035 $a(EXLCZ)992550000000043362 100 $a19941006d1996 uy 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aSequential stochastic optimization$b[electronic resource] /$fR. Cairoli, Robert C. Dalang 210 $aNew York $cJ. Wiley & Sons$dc1996 215 $a1 online resource (348 p.) 225 1 $aWiley series in probability and mathematical statistics 300 $a"A Wiley-Interscience publication." 311 $a0-471-57754-5 320 $aIncludes bibliographical references and indexes. 327 $aSequential Stochastic Optimization; Contents; Preface; Notation and Conventions; 1. Preliminaries; 1.1 Filtered Probability Spaces; 1.2 Random Variables; 1.3 Stopping Points; 1.4 Increasing Paths and Accessible Stopping Points; 1.5 Some Operations on Accessible Stopping Points; 1.6 Stochastic Processes and Martingales; Exercises; Historical Notes; 2. Sums of Independent Random Variables; 2.1 Maximal Inequalities; 2.2 Integrability Criteria for the Supremum; 2.3 The Strong Law of Large Numbers; 2.4 Case Where the Random Variables Are Identically Distributed; Exercises; Historical Notes 327 $a3. Optimal Stopping3.1 Stating the Problem; 3.2 Snell's Envelope; 3.3 Solving the Problem; 3.4 A Related Problem; 3.5 Maximal Accessible Stopping Points; 3.6 Case Where the Index Set is Finite; 3.7 An Application to Normalized Partial Sums; 3.8 Complements; Exercises; Historical Notes; 4. Reduction to a Single Dimension; 4.1 Linear Representation of Accessible Stopping Points; 4.2 Applications; 4.3 Linear Representation in the Setting of Inaccessible Stopping Points; Exercises; Historical Notes; 5. Accessibility and Filtration Structure; 5.1 Conditions for Accessibility 327 $a5.2 Consequences for the Structure of the Filtration5.3 The Bidimensional Case; 5.4 Predictability of Optional Increasing Paths; 5.5 The Combinatorial Structure of a Filtration; 5.6 The Combinatorial Structure of a Filtration Satisfying COl; 5.7 Optimal Stopping and Linear Optimization; Exercises; Historical Notes; 6. Sequential Sampling; 6.1 Stating the Problem; 6.2 Constructing the Model; 6.3 The Reward Process and Snell's Envelope; 6.4 Describing the Optimal Strategy; 6.5 The Likelihood-Ratio Test; 6.6 Applications; 6.7 Complement; Exercises; Historical Notes; 7. Optimal Sequential Control 327 $a7.1 An Example7.2 Preliminaries; 7.3 Controls; 7.4 Optimization; 7.5 Optimization Over Finite Controls; 7.6 Case Where the Index Set Is Finite; 7.7 Extension to General Index Sets; Exercises; Historical Notes; 8. Multiarmed Bandits; 8.1 Formulating the Problem; 8.2 Index Controls; 8.3 Gittins Indices; 8.4 Characterizing Optimal Controls; 8.5 Examples; Exercises; Historical Notes; 9. The Markovian Case; 9.1 Markov Chains and Superharmonic Functions; 9.2 Optimal Control of a Markov Chain; 9.3 The Special Case of a Random Walk 327 $a9.4 Control and Stopping at the Time of First Visit to a Set of States9.5 Markov Structures; Exercises; Historical Notes; 10. Optimal Switching Between Two Random Walks; 10.1 Formulating and Solving the Problem; 10.2 Some Properties of the Solution; 10.3 The Structure of the Solution; 10.4 Constructing the Switching Curves; 10.5 Characterizing the Type of the Solution; 10.6 Determining the Type of the Solution; Exercises; Historical Notes; Bibliography; Index of Notation; Index of Terms 330 $aSequential Stochastic Optimization provides mathematicians and applied researchers with a well-developed framework in which stochastic optimization problems can be formulated and solved. Offering much material that is either new or has never before appeared in book form, it lucidly presents a unified theory of optimal stopping and optimal sequential control of stochastic processes. This book has been carefully organized so that little prior knowledge of the subject is assumed; its only prerequisites are a standard graduate course in probability theory and some familiarity with discrete-paramet 410 0$aWiley series in probability and mathematical statistics.$pApplied probability and statistics. 606 $aOptimal stopping (Mathematical statistics) 606 $aDynamic programming 606 $aStochastic control theory 615 0$aOptimal stopping (Mathematical statistics) 615 0$aDynamic programming. 615 0$aStochastic control theory. 676 $a519.7 700 $aCairoli$b R$g(Renzo),$f1931-1994.$01605701 701 $aDalang$b Robert C.$f1961-$0602758 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910831074003321 996 $aSequential stochastic optimization$93931100 997 $aUNINA