11 research outputs found

    Theorizing Institutional Scandal and the Regulatory State

    Get PDF
    One by one, UK public institutions are being scandalised for corruption, immorality or incompetence and subjected to trial by media and criminal prosecution. The state?s historic response to public sector scandal ? denial and neutralisation ? has been replaced with acknowledgement and regulation in the form of the re-vamped public inquiry. Public institutions are being cut adrift and left to account in isolation for their scandalous failures. Yet the state?s attempts to distance itself from its scandalised institutions, while extending its regulatory control over them, are risky. Both the regulatory state and its public inquiries risk being consumed by the scandal they are trying to manage

    Analyzing the robustness of redundant population codes in sensory and feature extraction systems

    No full text
    Conference paperSensorineural systems often use groups of redundant neurons to represent stimulus information both during transduction and population coding of features. This redundancy makes the system more robust to corruption in the representation. We approximate neural coding as a projection of the stimulus onto a set of vectors, with the result encoded by spike trains. We use the formalism of frame theory to quantify the inherent noise reduction properties of such population codes. Additionally, computing features from the stimulus signal can also be thought of as projecting the coefficients of a sensory representation onto another set of vectors specific to the feature of interest. The conditions under which a combination of different features form a complete representation for the stimulus signal can be found through a recent extension to frame theory called "frames of subspaces". We extend the frame of subspaces theory to quantify the noise reduction properties of a collection of redundant feature spaces

    A Markov Chain Analysis of Blackjack Strategy

    No full text
    ReportBlackjack receives considerable attention from mathematicians and entrepreneurs alike, due to its simple rules, its inherent random nature, and the abundance of "prior" information available to an observant player. Many attempts have been made to propose card-counting systems that exploit such information to the player's advantage. Because blackjack is a complicated game, attempts to actually calculate the expected gain from a particular system often rely on simulation techniques. While such techniques may yield correct results, they may also fail to explore the interesting mathematical properties of the game. Despite the apparent complexity, there is a great deal of structure inherent in both the blackjack rules and the card-counting systems. Exploiting this structure and elementary results from the theory of Markov chains, we present a novel framework for analyzing the expected advantage of a card-counting system entirely without simulation. The method presented here requires only a few, mild simplifying assumptions, can account for many rule variations, and is applicable to a large class of counting systems. As a specific example, we verify the reported advantage provided by one of the earliest systems, the Complete Point-Count System, discussed in Edward Thorp's famous book, <i>Beat the Dealer</i>. While verifying this analysis is satisfying, in our opinion the primary value of this work lies in the exposition of an interesting mathematical framework for analyzing a complicated "real-world" problem

    Analysis of noise reduction in redundant expansions under distributed processing requirements

    No full text
    Conference paperWe considered signal reconstruction with redundant expansions under distributed processing in noisy environments. Redundant expansions have the ability to reduce noise corrupting the coefficients, but distributed processing schemes will not be able to take full advantage of the redundancy present. We apply frame theory and a generalization called â frames of subspacesâ to find conditions when distributed reconstruction suffers no loss in noise reduction ability, and we bound performance loss in more general cases.Texas InstrumentsNational Science Foundatio

    Modeling wireless sensor and actuator networks using frame theory

    No full text
    Conference PaperWireless sensor networks are often studied with the goal of removing information from the network as efficiently as possible. However, when the application also includes an actuator network, it is advantageous to determine actions in-network. In such settings, optimizing the sensor node behavior with respect to sensor information fidelity will not necessarily translate into optimum behavior in terms of action fidelity. Inspired by neural systems, we present a model of a sensor and actuator network based on the vector space tools of frame theory that applies to applications analogous to reflex behaviors in biological systems. Our analysis yields bounds on both absolute and average actuation error that point directly to strategies for limiting sensor communication based not only on local measurements but also on a measure of how important each sensor-actuator link is to the fidelity of the total actuation output

    To cooperate or not to cooperate: detection strategies in sensor networks

    No full text
    This paper is an initial investigation into the following question: Can cooperation among sensors in a sensor network improve detection performance in a simple hypothesis test? We analyze a simple cooperative system using the Kullback-Leibler (KL) discrimination distance and a quantity known as the information transfer ratio which is a ratio of KL distances. We discover that, asymptotically, gain over a non-cooperative system depends on the conditional KL distance. We conclude with an illustrative example which demonstrates that cooperation not only significantly improves performance but can also degrade it. 1

    Analyzing Dynamics and Stimulus Feature Dependence in the Information Processing of Crayfish Sustaining Fibers

    No full text
    Masters ThesisThe sustaining fiber (SF) stage of the crayfish visual system converts analog stimulus representations to spike train signals. A recent theory quantifies a system's information processing capabilities and relates to statistical signal processing. To analyze SF responses to light stimuli, we extend a wavelet-based algorithm for separating analog input signals and spike output waveforms in composite intracellular recordings. We also present a time-varying RC circuit model to capture nonstationary membrane noise spectral characteristics. In our SF anlysis, information transfer ratios are generally on the order of (10<sup>-4</sup>). The SF information processing dynamics show transient peaks followed by decay to steady-state values. A simple theoretical spike generator is analyzed analytically and shows general dynamic and steady-state properties similar to SFs. The information transfer ratios increase with spike rate and dynamic properties are due to direct spike generator dependence on input changes.Texas InstrumentsNational Science FoundationNational Institute of Mental Healt

    A Partial Revolution: The Diplomatic Ethos and Transparency in Intergovernmental Organizations

    No full text
    corecore