DOCSLIB.ORG

Mathematics Menu of Best Practices and Strategies

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Mathematics Menu of Best Practices and Strategies STRENGTHENING STUDENT EDUCATIONAL OUTCOMES Mathematics Menu of 2019 Best Practices and Strategies Mathematics: Menu of Best Practices and Strategies 2019 Authorizing legislation: RCW 28A.165.035 Gayle Pauley, Assistant Superintendent, Special Programs and Federal Accountability Prepared by: Kristi Coe, Program Supervisor, LAP Mathematics and Research [email protected], 360-725-6100 Table of Contents Welcome ....................................................................................................... 1 Background and Philosophy ....................................................................... 3 Strengthening Student Educational Outcomes ...................................................................... 3 Learning Assistance Program ................................................................................................... 4 LAP K–4 Focus on Literacy ................................................................................................................................. 4 LAP Eligibility........................................................................................................................................................... 4 Behavior Services ................................................................................................................................................... 4 LAP-Allowable Activities ..................................................................................................................................... 5 Readiness to Learn (RTL) — Up to Five Percent ........................................................................................ 5 Academic Readiness............................................................................................................................................. 5 Washington State Institute for Public Policy ......................................................................... 7 Integrated Student Supports ** ............................................................................................... 8 Integrated Student Supports in Washington State .................................................................................. 8 Core Components of the WISSP...................................................................................................................... 8 References ................................................................................................................................................................ 9 Multi-Tiered System of Supports** ....................................................................................... 10 Multi-Tiered System of Supports ................................................................................................................. 10 Core Instruction .................................................................................................................................................. 11 Tiered Supports ................................................................................................................................................... 12 System of Assessment ...................................................................................................................................... 13 Data-Based Decision-Making Teams .......................................................................................................... 17 References ............................................................................................................................................................. 18 Content Philosophy (WA State Mathematics)** .................................................................. 19 Vision of Mathematics Education ................................................................................................................ 19 Focus, Coherence, and Rigor ......................................................................................................................... 20 Mathematics Teaching Practices .................................................................................................................. 21 High Leverage Teaching Practices ............................................................................................................... 22 Early Numeracy ................................................................................................................................................... 22 K–2 Readiness ...................................................................................................................................................... 23 References ............................................................................................................................................................. 25 Instruction and Interventions......................................................................................................................... 26 i Depth of Knowledge ......................................................................................................................................... 26 Curriculum of Supplemental Services ......................................................................................................... 27 Intervention Materials ...................................................................................................................................... 27 Resources .............................................................................................................................................................. 28 References ............................................................................................................................................................. 28 Classroom Centered Practices in Mathematics** ................................................................. 31 Culturally Responsive Teaching .................................................................................................................... 31 Teacher and Student Relationships ............................................................................................................. 32 Developing a Growth Mindset ...................................................................................................................... 32 Academic Language .......................................................................................................................................... 33 Cross-Curricular Teaching Practices ............................................................................................................ 37 Mathematical Representations and Manipulatives ............................................................................... 37 Mathematically Productive Instructional Routines** ............................................................................ 38 Games ..................................................................................................................................................................... 41 Technology ........................................................................................................................................................... 42 MATH SMARTER BALANCED ASSESSMENT, LAP ELIGIBILITY, AND LAP STUDENT DATA REPORTING** ........................................................................................................................... 43 Smarter Balanced Assessment System ....................................................................................................... 44 Multiple Measures of Assessment for LAP ............................................................................................... 45 Smarter Balanced Assessments: LAP Student Eligibility and LAP Student Data Reporting ... 46 Mathematics Menu .................................................................................... 48 Overview .................................................................................................................................. 48 Mathematics Menu at a Glance ............................................................................................. 50 Student-Centered Practices and Strategies .......................................................................... 51 Double Dosing (Middle and high school students only)**................................................................. 52 Summer School/Programs .............................................................................................................................. 56 Tutoring by an Adult ......................................................................................................................................... 60 Tutoring by a Peer ............................................................................................................................................. 64 Educator-Focused Practices and Strategies .......................................................................... 68 Consultant Teachers/Instructional Coaches ............................................................................................. 69 Professional Learning Communities............................................................................................................ 75 Targeted Professional Learning .................................................................................................................... 81 Transition and Readiness Practices and Strategies .............................................................
Load more

Recommended publications
  • Distributions:The Evolutionof a Mathematicaltheory
    Historia Mathematics 10 (1983) 149-183 DISTRIBUTIONS:THE EVOLUTIONOF A MATHEMATICALTHEORY BY JOHN SYNOWIEC INDIANA UNIVERSITY NORTHWEST, GARY, INDIANA 46408 SUMMARIES The theory of distributions, or generalized func- tions, evolved from various concepts of generalized solutions of partial differential equations and gener- alized differentiation. Some of the principal steps in this evolution are described in this paper. La thgorie des distributions, ou des fonctions g&&alis~es, s'est d&eloppeg 2 partir de divers con- cepts de solutions g&&alis6es d'gquations aux d&i- &es partielles et de diffgrentiation g&&alis6e. Quelques-unes des principales &apes de cette &olution sont d&rites dans cet article. Die Theorie der Distributionen oder verallgemein- erten Funktionen entwickelte sich aus verschiedenen Begriffen von verallgemeinerten Lasungen der partiellen Differentialgleichungen und der verallgemeinerten Ableitungen. In diesem Artikel werden einige der wesentlichen Schritte dieser Entwicklung beschrieben. 1. INTRODUCTION The founder of the theory of distributions is rightly con- sidered to be Laurent Schwartz. Not only did he write the first systematic paper on the subject [Schwartz 19451, which, along with another paper [1947-19481, already contained most of the basic ideas, but he also wrote expository papers on distributions for electrical engineers [19481. Furthermore, he lectured effec- tively on his work, for example, at the Canadian Mathematical Congress [1949]. He showed how to apply distributions to partial differential equations [19SObl and wrote the first general trea- tise on the subject [19SOa, 19511. Recognition of his contri- butions came in 1950 when he was awarded the Fields' Medal at the International Congress of Mathematicians, and in his accep- tance address to the congress Schwartz took the opportunity to announce his celebrated "kernel theorem" [195Oc].
    [Show full text]
  • Arxiv:1404.7630V2 [Math.AT] 5 Nov 2014 Asoffsae,Se[S4 P8,Vr6.Isedof Instead Ver66]
    PROPER BASE CHANGE FOR SEPARATED LOCALLY PROPER MAPS OLAF M. SCHNÜRER AND WOLFGANG SOERGEL Abstract. We introduce and study the notion of a locally proper map between topological spaces. We show that fundamental con- structions of sheaf theory, more precisely proper base change, pro- jection formula, and Verdier duality, can be extended from contin- uous maps between locally compact Hausdorff spaces to separated locally proper maps between arbitrary topological spaces. Contents 1. Introduction 1 2. Locally proper maps 3 3. Proper direct image 5 4. Proper base change 7 5. Derived proper direct image 9 6. Projection formula 11 7. Verdier duality 12 8. The case of unbounded derived categories 15 9. Remindersfromtopology 17 10. Reminders from sheaf theory 19 11. Representability and adjoints 21 12. Remarks on derived functors 22 References 23 arXiv:1404.7630v2 [math.AT] 5 Nov 2014 1. Introduction The proper direct image functor f! and its right derived functor Rf! are defined for any continuous map f : Y → X of locally compact Hausdorff spaces, see [KS94, Spa88, Ver66]. Instead of f! and Rf! we will use the notation f(!) and f! for these functors. They are embedded into a whole collection of formulas known as the six-functor-formalism of Grothendieck. Under the assumption that the proper direct image functor f(!) has finite cohomological dimension, Verdier proved that its ! derived functor f! admits a right adjoint f . Olaf Schnürer was supported by the SPP 1388 and the SFB/TR 45 of the DFG. Wolfgang Soergel was supported by the SPP 1388 of the DFG. 1 2 OLAFM.SCHNÜRERANDWOLFGANGSOERGEL In this article we introduce in 2.3 the notion of a locally proper map between topological spaces and show that the above results even hold for arbitrary topological spaces if all maps whose proper direct image functors are involved are locally proper and separated.
    [Show full text]
  • MATH 418 Assignment #7 1. Let R, S, T Be Positive Real Numbers Such That R
    MATH 418 Assignment #7 1. Let r, s, t be positive real numbers such that r + s + t = 1. Suppose that f, g, h are nonnegative measurable functions on a measure space (X, S, µ). Prove that Z r s t r s t f g h dµ ≤ kfk1kgk1khk1. X s t Proof . Let u := g s+t h s+t . Then f rgsht = f rus+t. By H¨older’s inequality we have Z Z rZ s+t r s+t r 1/r s+t 1/(s+t) r s+t f u dµ ≤ (f ) dµ (u ) dµ = kfk1kuk1 . X X X For the same reason, we have Z Z s t s t s+t s+t s+t s+t kuk1 = u dµ = g h dµ ≤ kgk1 khk1 . X X Consequently, Z r s t r s+t r s t f g h dµ ≤ kfk1kuk1 ≤ kfk1kgk1khk1. X 2. Let Cc(IR) be the linear space of all continuous functions on IR with compact support. (a) For 1 ≤ p < ∞, prove that Cc(IR) is dense in Lp(IR). Proof . Let X be the closure of Cc(IR) in Lp(IR). Then X is a linear space. We wish to show X = Lp(IR). First, if I = (a, b) with −∞ < a < b < ∞, then χI ∈ X. Indeed, for n ∈ IN, let gn the function on IR given by gn(x) := 1 for x ∈ [a + 1/n, b − 1/n], gn(x) := 0 for x ∈ IR \ (a, b), gn(x) := n(x − a) for a ≤ x ≤ a + 1/n and gn(x) := n(b − x) for b − 1/n ≤ x ≤ b.
    [Show full text]
  • 2 Hilbert Spaces You Should Have Seen Some Examples Last Semester
    2 Hilbert spaces You should have seen some examples last semester. The simplest (finite-dimensional) ex- C • A complex Hilbert space H is a complete normed space over whose norm is derived from an ample is Cn with its standard inner product. It’s worth recalling from linear algebra that if V is inner product. That is, we assume that there is a sesquilinear form ( , ): H H C, linear in · · × → an n-dimensional (complex) vector space, then from any set of n linearly independent vectors we the first variable and conjugate linear in the second, such that can manufacture an orthonormal basis e1, e2,..., en using the Gram-Schmidt process. In terms of this basis we can write any v V in the form (f ,д) = (д, f ), ∈ v = a e , a = (v, e ) (f , f ) 0 f H, and (f , f ) = 0 = f = 0. i i i i ≥ ∀ ∈ ⇒ ∑ The norm and inner product are related by which can be derived by taking the inner product of the equation v = aiei with ei. We also have n ∑ (f , f ) = f 2. ∥ ∥ v 2 = a 2. ∥ ∥ | i | i=1 We will always assume that H is separable (has a countable dense subset). ∑ Standard infinite-dimensional examples are l2(N) or l2(Z), the space of square-summable As usual for a normed space, the distance on H is given byd(f ,д) = f д = (f д, f д). • • ∥ − ∥ − − sequences, and L2(Ω) where Ω is a measurable subset of Rn. The Cauchy-Schwarz and triangle inequalities, • √ (f ,д) f д , f + д f + д , | | ≤ ∥ ∥∥ ∥ ∥ ∥ ≤ ∥ ∥ ∥ ∥ 2.1 Orthogonality can be derived fairly easily from the inner product.
    [Show full text]
  • Extremal Dependence Concepts
    Extremal dependence concepts Giovanni Puccetti1 and Ruodu Wang2 1Department of Economics, Management and Quantitative Methods, University of Milano, 20122 Milano, Italy 2Department of Statistics and Actuarial Science, University of Waterloo, Waterloo, ON N2L3G1, Canada Journal version published in Statistical Science, 2015, Vol. 30, No. 4, 485{517 Minor corrections made in May and June 2020 Abstract The probabilistic characterization of the relationship between two or more random variables calls for a notion of dependence. Dependence modeling leads to mathematical and statistical challenges and recent developments in extremal dependence concepts have drawn a lot of attention to probability and its applications in several disciplines. The aim of this paper is to review various concepts of extremal positive and negative dependence, including several recently established results, reconstruct their history, link them to probabilistic optimization problems, and provide a list of open questions in this area. While the concept of extremal positive dependence is agreed upon for random vectors of arbitrary dimensions, various notions of extremal negative dependence arise when more than two random variables are involved. We review existing popular concepts of extremal negative dependence given in literature and introduce a novel notion, which in a general sense includes the existing ones as particular cases. Even if much of the literature on dependence is focused on positive dependence, we show that negative dependence plays an equally important role in the solution of many optimization problems. While the most popular tool used nowadays to model dependence is that of a copula function, in this paper we use the equivalent concept of a set of rearrangements.
    [Show full text]
  • Chapter 13 National Science Foundation Systemic Initiatives
    Chapter 13 National Science Foundation Systemic Initiatives: How a small amount of federal money promotes ill-designed mathematics and science programs in K-12 and undermines local control of education Michael McKeown Mathematically Correct David Klein California State University, Los Angeles Chris Patterson Education Connection of Texas Since its inception in 1950, the National Science Foundation (NSF) has played a strong, positive role in making American scientific research and technological application the best in the world. Through its funding of peer-reviewed, investigator-initiated research proposals, it has supported basic research in a wide variety of scientific disciplines, such as mathematics, biology, physics, chemistry, geology, astronomy, and psychology. American science owes much to the support it has received, and continues to receive, from NSF. This chapter deals with a program in the Education and Human Resources Division called the NSF Systemic Initiatives Program, not with NSF programs related directly to the support of basic research. We are highly critical of this particular NSF program. Not only do the Systemic Initiatives undermine local control of education, but, as our analysis in this chapter suggests, they also seem to lower academic standards for mathematics education and weaken the educational base for American science. This chapter is composed of three sections. The first section, an overview of NSF Systemic Initiatives, was written by Michael McKeown. The second section, an analysis of the development and 288 Standards Wars features of the Los Angeles Systemic Initiative, was written by David Klein. The third section, an analysis of the development and features of the Texas Statewide Systemic Initiative, was written by Chris Patterson.
    [Show full text]
  • Mathematics in African History and Cultures
    Paulus Gerdes & Ahmed Djebbar MATHEMATICS IN AFRICAN HISTORY AND CULTURES: AN ANNOTATED BIBLIOGRAPHY African Mathematical Union Commission on the History of Mathematics in Africa (AMUCHMA) Mathematics in African History and Cultures Second edition, 2007 First edition: African Mathematical Union, Cape Town, South Africa, 2004 ISBN: 978-1-4303-1537-7 Published by Lulu. Copyright © 2007 by Paulus Gerdes & Ahmed Djebbar Authors Paulus Gerdes Research Centre for Mathematics, Culture and Education, C.P. 915, Maputo, Mozambique E-mail: [email protected] Ahmed Djebbar Département de mathématiques, Bt. M 2, Université de Lille 1, 59655 Villeneuve D’Asq Cedex, France E-mail: [email protected], [email protected] Cover design inspired by a pattern on a mat woven in the 19th century by a Yombe woman from the Lower Congo area (Cf. GER-04b, p. 96). 2 Table of contents page Preface by the President of the African 7 Mathematical Union (Prof. Jan Persens) Introduction 9 Introduction to the new edition 14 Bibliography A 15 B 43 C 65 D 77 E 105 F 115 G 121 H 162 I 173 J 179 K 182 L 194 M 207 N 223 O 228 P 234 R 241 S 252 T 274 U 281 V 283 3 Mathematics in African History and Cultures page W 290 Y 296 Z 298 Appendices 1 On mathematicians of African descent / 307 Diaspora 2 Publications by Africans on the History of 313 Mathematics outside Africa (including reviews of these publications) 3 On Time-reckoning and Astronomy in 317 African History and Cultures 4 String figures in Africa 338 5 Examples of other Mathematical Books and 343
    [Show full text]
  • Five Lectures on Optimal Transportation: Geometry, Regularity and Applications
    FIVE LECTURES ON OPTIMAL TRANSPORTATION: GEOMETRY, REGULARITY AND APPLICATIONS ROBERT J. MCCANN∗ AND NESTOR GUILLEN Abstract. In this series of lectures we introduce the Monge-Kantorovich problem of optimally transporting one distribution of mass onto another, where optimality is measured against a cost function c(x, y). Connections to geometry, inequalities, and partial differential equations will be discussed, focusing in particular on recent developments in the regularity theory for Monge-Amp`ere type equations. An ap- plication to microeconomics will also be described, which amounts to finding the equilibrium price distribution for a monopolist marketing a multidimensional line of products to a population of anonymous agents whose preferences are known only statistically. c 2010 by Robert J. McCann. All rights reserved. Contents Preamble 2 1. An introduction to optimal transportation 2 1.1. Monge-Kantorovich problem: transporting ore from mines to factories 2 1.2. Wasserstein distance and geometric applications 3 1.3. Brenier’s theorem and convex gradients 4 1.4. Fully-nonlinear degenerate-elliptic Monge-Amp`eretype PDE 4 1.5. Applications 5 1.6. Euclidean isoperimetric inequality 5 1.7. Kantorovich’s reformulation of Monge’s problem 6 2. Existence, uniqueness, and characterization of optimal maps 6 2.1. Linear programming duality 8 2.2. Game theory 8 2.3. Relevance to optimal transport: Kantorovich-Koopmans duality 9 2.4. Characterizing optimality by duality 9 2.5. Existence of optimal maps and uniqueness of optimal measures 10 3. Methods for obtaining regularity of optimal mappings 11 3.1. Rectifiability: differentiability almost everywhere 12 3.2. From regularity a.e.
    [Show full text]
  • The Geometry of Optimal Transportation
    THE GEOMETRY OF OPTIMAL TRANSPORTATION Wilfrid Gangbo∗ School of Mathematics, Georgia Institute of Technology Atlanta, GA 30332, USA [email protected] Robert J. McCann∗ Department of Mathematics, Brown University Providence, RI 02912, USA and Institut des Hautes Etudes Scientifiques 91440 Bures-sur-Yvette, France [email protected] July 28, 1996 Abstract A classical problem of transporting mass due to Monge and Kantorovich is solved. Given measures µ and ν on Rd, we find the measure-preserving map y(x) between them with minimal cost | where cost is measured against h(x − y)withhstrictly convex, or a strictly concave function of |x − y|.This map is unique: it is characterized by the formula y(x)=x−(∇h)−1(∇ (x)) and geometrical restrictions on . Connections with mathematical economics, numerical computations, and the Monge-Amp`ere equation are sketched. ∗Both authors gratefully acknowledge the support provided by postdoctoral fellowships: WG at the Mathematical Sciences Research Institute, Berkeley, CA 94720, and RJM from the Natural Sciences and Engineering Research Council of Canada. c 1995 by the authors. To appear in Acta Mathematica 1997. 1 2 Key words and phrases: Monge-Kantorovich mass transport, optimal coupling, optimal map, volume-preserving maps with convex potentials, correlated random variables, rearrangement of vector fields, multivariate distributions, marginals, Lp Wasserstein, c-convex, semi-convex, infinite dimensional linear program, concave cost, resource allocation, degenerate elliptic Monge-Amp`ere 1991 Mathematics
    [Show full text]
  • An Alternative Route to Teaching Fraction Division: Abstraction of Common Denominator Algorithm
    International Electronic Journal of Elementary Education, 2015, 7(3), 399-422. An Alternative Route to Teaching Fraction Division: Abstraction of Common Denominator Algorithm İsmail Özgür ZEMBAT Mevlana (Rumi) University, Turkey Received: February 2015 / Revised: May 2015 / Accepted: May 2015 Abstract From a curricular stand point, the traditional invert and multiply algorithm for division of fractions provides few affordances for linking to a rich understanding of fractions. On the other hand, an alternative algorithm, called common denominator algorithm, has many such affordances. The current study serves as an argument for shifting curriculum for fraction division from use of invert and multiply algorithm as a basis to the use of common denominator algorithm as a basis. This was accomplished with the analysis of learning of two prospective elementary teachers being an illustration of how to realize those conceptual affordances. In doing so, the article proposes an instructional sequence and details it by referring to both the (mathematical and pedagogical) advantages and the disadvantages. As a result, this algorithm has a conceptual basis depending on basic operations of partitioning, unitizing, and counting, which make it accessible to learners. Also, when participants are encouraged to construct this algorithm based on their work with diagrams, common denominator algorithm formalizes the work that they do with diagrams. Keywords: Teaching fraction division, abstracting common denominator algorithm, curriculum development Introduction Arithmetic operations, and teaching and learning of them have always been an interest for mathematics education community. In his historical analysis, Usiskin (2007) pointed out that operations (especially on fractions) still preserve its importance in school mathematics and they should be given enough emphasis.
    [Show full text]
  • AVAILABLE from ABSTRACT DOCUMENT RESUME Exemplary
    DOCUMENT RESUME ED 434 033 SE 062 877 TITLE Exemplary and Promising Mathematics Programs. INSTITUTION Department of Education, Washington, DC. PUB DATE 1999-00-00 NOTE 71p.; Prepared by the "Math and Science Education Expert Panel." AVAILABLE FROM ED Pubs, P.O. Box 1389, Jessup, MD. Tel: 877-433-7827 (Toll Free); Web site: <http://www.enc.org>. PUB TYPE Reports Descriptive (141) EDRS PRICE MF01/PC03 Plus Postage. DESCRIPTORS *Academic Standards; Demonstration Programs; Elementary Secondary Education; Mathematics Curriculum; *Mathematics Education; *Program Descriptions; *Program Evaluation ABSTRACT Selecting programs, textbooks, and curriculum materials is one of the most important decisions educators make. An Expert Panel on Mathematics and Science was established by the U.S. Department of Education to develop a high-quality, research-based process for selecting programs and to use that selecting process to identify exemplary and promising programs. This booklet describes eight mathematics programs designated as exemplary or promising. A detailed explanation of the submission and selection process and an explanation of how the programs were separated into exemplary and promising categories is included. The four characteristics used for the selection criteria include quality of program, usefulness to others, educational significance, and evidence of effectiveness and success. Each characteristic has multiple criteria with specific indicators of achievement. Each program is described in terms of the four selection characteristics and professional
    [Show full text]
  • Maxwell's Equations in Differential Form
    M03_RAO3333_1_SE_CHO3.QXD 4/9/08 1:17 PM Page 71 CHAPTER Maxwell’s Equations in Differential Form 3 In Chapter 2 we introduced Maxwell’s equations in integral form. We learned that the quantities involved in the formulation of these equations are the scalar quantities, elec- tromotive force, magnetomotive force, magnetic flux, displacement flux, charge, and current, which are related to the field vectors and source densities through line, surface, and volume integrals. Thus, the integral forms of Maxwell’s equations,while containing all the information pertinent to the interdependence of the field and source quantities over a given region in space, do not permit us to study directly the interaction between the field vectors and their relationships with the source densities at individual points. It is our goal in this chapter to derive the differential forms of Maxwell’s equations that apply directly to the field vectors and source densities at a given point. We shall derive Maxwell’s equations in differential form by applying Maxwell’s equations in integral form to infinitesimal closed paths, surfaces, and volumes, in the limit that they shrink to points. We will find that the differential equations relate the spatial variations of the field vectors at a given point to their temporal variations and to the charge and current densities at that point. In this process we shall also learn two important operations in vector calculus, known as curl and divergence, and two related theorems, known as Stokes’ and divergence theorems. 3.1 FARADAY’S LAW We recall from the previous chapter that Faraday’s law is given in integral form by d E # dl =- B # dS (3.1) CC dt LS where S is any surface bounded by the closed path C.In the most general case,the elec- tric and magnetic fields have all three components (x, y,and z) and are dependent on all three coordinates (x, y,and z) in addition to time (t).
    [Show full text]