Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"pure math"”.

  1. How Textbooks Influence Students’ Algebra Learning: A Comparative Study on the initial treatment of the concept of function

    … a US standards-based text--<em>Connected Mathematic 2: Variables and Patterns</em>, a US conventional text--<em>Glencoe: Mathematics Applications and Concepts: Course 2</em>, and a Chinese reform text--<em>Shu Xue: Grade 8, first volume</em>. <strong></strong></p> <p>This study examined …

    ut-knoxville Repository record for How Textbooks Influence Students’ Algebra Learning: A Comparative Study on the initial treatment of the concept of function (opens in a new tab)

  2. LEARNING KERNELS WITH NONLOCAL DEPENDENCE IN MEAN FIELD EQUATIONS AND THE EXTENSION PROBLEM ON DIRICHLET SPACE

    … during the author’s Ph.D. in both applied and pure math topics. The first part of the thesis introduces a nonparametric algorithm to learn interaction kernels of mean-field equations for 1st-order systems of interacting particles. The algorithm employs a probabilistic error functional derived …

    jhu Repository record for LEARNING KERNELS WITH NONLOCAL DEPENDENCE IN MEAN FIELD EQUATIONS AND THE EXTENSION PROBLEM ON DIRICHLET SPACE (opens in a new tab)

  3. Subdividing the cd-index

    This thesis aims to give the reader an introduction and overview of the cd-index of a poset, as well as establish some new results. We give a combinatorial proof of Ehrenborg and Karu's cd-index subdivision decomposition for Gorenstein* complexes and extend it to a wider class of subdivisions. In …

    waterloo Repository record for Subdividing the cd-index (opens in a new tab)

  4. On Sharpest Tail Bounds for Functions of Tail Bounded Random Variables

    Consider n real/complex, independent/dependent random variables with respective tail bounds and g a measurable function of the r.v.’s. Consider f the “sharpest” tail bound of g (sharpest in the sense, if f were any less, then for some X1, ..., Xn satisfying the conditions, g(X1, ..., Xn) would not …

    unm Repository record for On Sharpest Tail Bounds for Functions of Tail Bounded Random Variables (opens in a new tab)