12,050 research outputs found

    Stories of Debt and Service: On the Brink of Employment

    Get PDF

    Holographic Reduced Representations for Oscillator Recall: A Model of Phonological Production

    Get PDF
    This paper describes a new computational model of phonological production, Holographic Reduced Representations for Oscillator Recall, or HORROR. HORROR's architecture accounts for phonological speech error patterns by combining the hierarchical oscillating context signal of the OSCAR serial-order model~\cite{VousdenEtAl:2000,BrownEtAl:2000} with a holographic associative memory~\cite{Plate:1995}. The resulting model is novel in a number of ways. Most importantly, all of the noise needed to generate errors is intrinsic to the system, instead of being generated by an external process. The model features fully-distributed hierarchical phoneme representations and a single distributed associative memory. Using fewer parameters and a more parsimonious design than OSCAR, HORROR accounts for error type proportions, the syllable-position constraint, and other constraints seen in the human speech error data

    Polynomial Bounds for Invariant Functions Separating Orbits

    Full text link
    Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow rapidly with the size of the representation. We instead study "constructible" functions defined by straight line programs in the polynomial ring, with a new "quasi-inverse" that computes the inverse of a function where defined. We write straight line programs defining constructible functions that separate the orbits of G. The number of these programs and their length have polynomial bounds in the parameters of the representation.Comment: Clarified proofs, algorithms, and notation. Corrected typo

    Challenging Girlhood

    Get PDF
    corecore