2,231 research outputs found

    A Multi-Scale Network Model of Brightness Perception

    Full text link
    A neural network model of brightness perception is developed to account for a wide variety of difficult data, including the classical phenomenon of Mach bands and nonlinear contrast effects associated with sinusoidal luminance waves. The model builds upon previous work by Grossberg and colleagues on filling-in models that predict brightness perception through the interaction of boundary and feature signals. Model equations are presented and computer simulations illustrate the model's potential.Air Force Office of Scientific Research (F49620-92-J-0334); Northeast Consortium for Engineering Education (NCEE-A303-21-93); Office of Naval Research (N00014-91-J-4100); German BMFT grant (413-5839-01 IN 101 C/1); CNPq and NUTES/UFRJ, Brazi

    Swinging and tumbling of elastic capsules in shear flow

    Get PDF
    The deformation of an elastic micro-capsule in an infinite shear flow is studied numerically using a spectral method. The shape of the capsule and the hydrodynamic flow field are expanded into smooth basis functions. Analytic expressions for the derivative of the basis functions permit the evaluation of elastic and hydrodynamic stresses and bending forces at specified grid points in the membrane. Compared to methods employing a triangulation scheme, this method has the advantage that the resulting capsule shapes are automatically smooth, and few modes are needed to describe the deformation accurately. Computations are performed for capsules both with spherical and ellipsoidal unstressed reference shape. Results for small deformations of initially spherical capsules coincide with analytic predictions. For initially ellipsoidal capsules, recent approximative theories predict stable oscillations of the tank-treading inclination angle, and a transition to tumbling at low shear rate. Both phenomena have also been observed experimentally. Using our numerical approach we could reproduce both the oscillations and the transition to tumbling. The full phase diagram for varying shear rate and viscosity ratio is explored. While the numerically obtained phase diagram qualitatively agrees with the theory, intermittent behaviour could not be observed within our simulation time. Our results suggest that initial tumbling motion is only transient in this region of the phase diagram.Comment: 20 pages, 7 figure

    Swinging and tumbling of elastic capsules in shear flow

    Full text link
    The deformation of an elastic micro-capsule in an infinite shear flow is studied numerically using a spectral method. The shape of the capsule and the hydrodynamic flow field are expanded into smooth basis functions. Analytic expressions for the derivative of the basis functions permit the evaluation of elastic and hydrodynamic stresses and bending forces at specified grid points in the membrane. Compared to methods employing a triangulation scheme, this method has the advantage that the resulting capsule shapes are automatically smooth, and few modes are needed to describe the deformation accurately. Computations are performed for capsules both with spherical and ellipsoidal unstressed reference shape. Results for small deformations of initially spherical capsules coincide with analytic predictions. For initially ellipsoidal capsules, recent approximative theories predict stable oscillations of the tank-treading inclination angle, and a transition to tumbling at low shear rate. Both phenomena have also been observed experimentally. Using our numerical approach we could reproduce both the oscillations and the transition to tumbling. The full phase diagram for varying shear rate and viscosity ratio is explored. While the numerically obtained phase diagram qualitatively agrees with the theory, intermittent behaviour could not be observed within our simulation time. Our results suggest that initial tumbling motion is only transient in this region of the phase diagram.Comment: 20 pages, 7 figure

    Comparative Transition System Semantics for Cause-Respecting Reversible Prime Event Structures

    Full text link
    Reversible computing is a new paradigm that has emerged recently and extends the traditional forwards-only computing mode with the ability to execute in backwards, so that computation can run in reverse as easily as in forward. Two approaches to developing transition system (automaton-like) semantics for event structure models are distinguished in the literature. In the first case, states are considered as configurations (sets of already executed events), and transitions between states are built by starting from the initial configuration and repeatedly adding executable events. In the second approach, states are understood as residuals (model fragments that have not yet been executed), and transitions are constructed by starting from the given event structure as the initial state and deleting already executed (and conflicting) parts thereof during execution. The present paper focuses on an investigation of how the two approaches are interrelated for the model of prime event structures extended with cause-respecting reversibility. The bisimilarity of the resulting transition systems is proved, taking into account step semantics of the model under consideration.Comment: In Proceedings AFL 2023, arXiv:2309.0112

    Polynomial-Time Amoeba Neighborhood Membership and Faster Localized Solving

    Full text link
    We derive efficient algorithms for coarse approximation of algebraic hypersurfaces, useful for estimating the distance between an input polynomial zero set and a given query point. Our methods work best on sparse polynomials of high degree (in any number of variables) but are nevertheless completely general. The underlying ideas, which we take the time to describe in an elementary way, come from tropical geometry. We thus reduce a hard algebraic problem to high-precision linear optimization, proving new upper and lower complexity estimates along the way.Comment: 15 pages, 9 figures. Submitted to a conference proceeding

    Reversible Computation: Extending Horizons of Computing

    Get PDF
    This open access State-of-the-Art Survey presents the main recent scientific outcomes in the area of reversible computation, focusing on those that have emerged during COST Action IC1405 "Reversible Computation - Extending Horizons of Computing", a European research network that operated from May 2015 to April 2019. Reversible computation is a new paradigm that extends the traditional forwards-only mode of computation with the ability to execute in reverse, so that computation can run backwards as easily and naturally as forwards. It aims to deliver novel computing devices and software, and to enhance existing systems by equipping them with reversibility. There are many potential applications of reversible computation, including languages and software tools for reliable and recovery-oriented distributed systems and revolutionary reversible logic gates and circuits, but they can only be realized and have lasting effect if conceptual and firm theoretical foundations are established first

    Neuroinspired unsupervised learning and pruning with subquantum CBRAM arrays.

    Get PDF
    Resistive RAM crossbar arrays offer an attractive solution to minimize off-chip data transfer and parallelize on-chip computations for neural networks. Here, we report a hardware/software co-design approach based on low energy subquantum conductive bridging RAM (CBRAM®) devices and a network pruning technique to reduce network level energy consumption. First, we demonstrate low energy subquantum CBRAM devices exhibiting gradual switching characteristics important for implementing weight updates in hardware during unsupervised learning. Then we develop a network pruning algorithm that can be employed during training, different from previous network pruning approaches applied for inference only. Using a 512 kbit subquantum CBRAM array, we experimentally demonstrate high recognition accuracy on the MNIST dataset for digital implementation of unsupervised learning. Our hardware/software co-design approach can pave the way towards resistive memory based neuro-inspired systems that can autonomously learn and process information in power-limited settings

    Reversible Computation: Extending Horizons of Computing

    Get PDF
    This open access State-of-the-Art Survey presents the main recent scientific outcomes in the area of reversible computation, focusing on those that have emerged during COST Action IC1405 "Reversible Computation - Extending Horizons of Computing", a European research network that operated from May 2015 to April 2019. Reversible computation is a new paradigm that extends the traditional forwards-only mode of computation with the ability to execute in reverse, so that computation can run backwards as easily and naturally as forwards. It aims to deliver novel computing devices and software, and to enhance existing systems by equipping them with reversibility. There are many potential applications of reversible computation, including languages and software tools for reliable and recovery-oriented distributed systems and revolutionary reversible logic gates and circuits, but they can only be realized and have lasting effect if conceptual and firm theoretical foundations are established first

    Exact goodness-of-fit testing for the Ising model

    Full text link
    The Ising model is one of the simplest and most famous models of interacting systems. It was originally proposed to model ferromagnetic interactions in statistical physics and is now widely used to model spatial processes in many areas such as ecology, sociology, and genetics, usually without testing its goodness of fit. Here, we propose various test statistics and an exact goodness-of-fit test for the finite-lattice Ising model. The theory of Markov bases has been developed in algebraic statistics for exact goodness-of-fit testing using a Monte Carlo approach. However, finding a Markov basis is often computationally intractable. Thus, we develop a Monte Carlo method for exact goodness-of-fit testing for the Ising model which avoids computing a Markov basis and also leads to a better connectivity of the Markov chain and hence to a faster convergence. We show how this method can be applied to analyze the spatial organization of receptors on the cell membrane.Comment: 20 page
    • …
    corecore