6,725 research outputs found

    Renderings of the Abyss: some changing nineteenth-century literary perceptions of the animal / human divide.

    Get PDF
    The aim of this thesis is to amalgamate philosophy and history of science with literature to achieve an overview of changing ideas of the animal/human divide during the nineteenth century. Drawing on the ideas of Jacques Derrida, Friedrich Nietzsche, Julia Kristeva and Giorgio Agamben. I consider this divide and its contents, often regarded as an abyss. The study is written like a time line, starting at the beginning of the nineteenth century and finishing at the end. I split the nineteenth century into four time periods centred around the emergence of Darwinian theory, considered by this study to be the single most prolific scientific event to have occurred during the nineteenth century. These time frames are the pre-Darwinian, the early Darwinian, the late Darwinian and the post-Darwinian. The study is split into four chapters which coincide with these time frames, covering four different novels which exemplify contextually relevant ideas of the abyss. These are Frankenstein by Mary Shelley, Moby-Dick by Herman Melville, Crime and Punishment by Fyodor Dostoevsky and The Island of Doctor Moreau by H.G. Wells. During the course of this study I consider various ideas applied by the authors about the abyssal limits and what they consist of. These include considerations on reason, society, morality and spirituality, all ideas used in various different manners to attempt to explain the abyss. From these various deliberations I formulate a conclusion which takes into account the various nuances which would have effected each of the writer’s formulations of the abyss

    Probabilistic analysis of algorithms for dual bin packing problems

    Get PDF
    In the dual bin packing problem, the objective is to assign items of given size to the largest possible number of bins, subject to the constraint that the total size of the items assigned to any bin is at least equal to 1. We carry out a probabilistic analysis of this problem under the assumption that the items are drawn independently from the uniform distribution on [0, 1] and reveal the connection between this problem and the classical bin packing problem as well as to renewal theory.

    Kondo Effect in Fermi Systems with a Gap: A Renormalization Group Study

    Full text link
    We present the results of a Wilson Renormalization Group study of the single-impurity Kondo and Anderson models in a system with a gap in the conduction electron spectrum. The behavior of the impurity susceptibility and the zero-frequency response function, T>T> are discussed in the cases with and without particle-hole symmetry. In addition, for the asymmetric Anderson model the correlation functions, <Sσ(0)><\vec S \cdot\vec \sigma (0)>,,and, and are computed.Comment: 10 pages, 10 figure

    LSEMINK: A Modified Newton-Krylov Method for Log-Sum-Exp Minimization

    Full text link
    This paper introduces LSEMINK, an effective modified Newton-Krylov algorithm geared toward minimizing the log-sum-exp function for a linear model. Problems of this kind arise commonly, for example, in geometric programming and multinomial logistic regression. Although the log-sum-exp function is smooth and convex, standard line search Newton-type methods can become inefficient because the quadratic approximation of the objective function can be unbounded from below. To circumvent this, LSEMINK modifies the Hessian by adding a shift in the row space of the linear model. We show that the shift renders the quadratic approximation to be bounded from below and that the overall scheme converges to a global minimizer under mild assumptions. Our convergence proof also shows that all iterates are in the row space of the linear model, which can be attractive when the model parameters do not have an intuitive meaning, as is common in machine learning. Since LSEMINK uses a Krylov subspace method to compute the search direction, it only requires matrix-vector products with the linear model, which is critical for large-scale problems. Our numerical experiments on image classification and geometric programming illustrate that LSEMINK considerably reduces the time-to-solution and increases the scalability compared to geometric programming and natural gradient descent approaches. It has significantly faster initial convergence than standard Newton-Krylov methods, which is particularly attractive in applications like machine learning. In addition, LSEMINK is more robust to ill-conditioning arising from the nonsmoothness of the problem. We share our MATLAB implementation at https://github.com/KelvinKan/LSEMINK

    Theories for multiple resonances

    Get PDF
    Two microscopic theories for multiple resonances in nuclei are compared, n-particle-hole RPA and quantized Time-Dependent Hartree-Fock (TDHF). The Lipkin-Meshkov-Glick model is used as test case. We find that quantized TDHF is superior in many respects, except for very small systems.Comment: 14 Pages, 3 figures available upon request
    corecore