Diss.--University of Wuppertal, 2000. / Bibliogr. p. 287-299.

Thesis (Ph.D.)--University of Tulsa, 1985. / Bibliography: leaves 171-172.

Thesis (Ph. D.)--University of Wisconsin, 1965. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliography.

No description available.

Thesis (MA)--University of Montana, 2009. / Title from author supplied metadata. Contents viewed on December 21, 2009. Includes bibliographical references.

This thesis discusses the women in the life of Edwin Arlington Robinson and the happiness and unhappiness in love in his poems.

Thesis advisor: Dominic Doyle / Thesis advisor: Matthew Potts / It will be argued that the Word became incarnate in the world to lead us back to God the Creator, and this exitus and reditus is given and received in human language. In like manner, the words of great literature can direct our attention and reinvigorate the modern cosmic imaginary with a Christian imagination, instructing the reader to engage in a dive into the particulars of his or her concrete life. In mining those details, s/he can attain insights. We will call this trek of inquiry a via litteraria — connecting our lives with the life of God, by way of literature. To that end we will focus on the work of the American Christian writer of fiction and essays, Marilynne Robinson, who is a prime example of this via litteraria. / Thesis (STL) — Boston College, 2017. / Submitted to: Boston College. School of Theology and Ministry. / Discipline: Sacred Theology.

Given n arbitrary objects x1, x2, . . . , xn and a similarity matrix P = (pi,j ) 1≤i,j≤n , where pi,j measures the similarity between xi and xj . If the objects can be ordered along a linear chain so that the similarity decreases as the distance increase within this chain, then the goal of the seriation problem is to recover this ordering π given only the similarity matrix. When the data matrix P is completely accurate, the true relative order can be recovered from the spectral seriation algorithm [1]. In most applications, the matrix P is noisy, but the basic spectral seriation algorithm is still very popular. In this thesis, we study the consistency of this algorithm for a wide variety of statistical models, showing both consistency and bounds on the convergence rates. More specifically, we consider a model matrix P satisfying certain assumptions, and construct a noisy matrix Pb where the input (i, j) is a coin flip with probability pi,j . We show that the output πˆ of the spectral seriation algorithm for the random matrix is very close to the true ordering π.

<p>This essay investigates the phenomenon of <em>seamlessness</em> in Marilynne Robinson’s novel <em>Housekeeping </em>and seeks to show that seamlessness is decisive for shaping the prevailing atmosphere in the text and contributes to the sense of the power of the invisible that is central to the work.</p><p>[1] Marilynne Robinson, <em>Housekeeping</em> (London: Faber & Faber, 2005; first published by Farrar, Straus & Giroux, 1980). In parenthetical documentation, hereafter abbreviated H.</p>

This essay investigates the phenomenon of seamlessness in Marilynne Robinson’s novel Housekeeping and seeks to show that seamlessness is decisive for shaping the prevailing atmosphere in the text and contributes to the sense of the power of the invisible that is central to the work. [1] Marilynne Robinson, Housekeeping (London: Faber &amp; Faber, 2005; first published by Farrar, Straus &amp; Giroux, 1980). In parenthetical documentation, hereafter abbreviated H.