760 research outputs found

    Influence of external magnetic fields on growth of alloy nanoclusters

    Full text link
    Kinetic Monte Carlo simulations are performed to study the influence of external magnetic fields on the growth of magnetic fcc binary alloy nanoclusters with perpendicular magnetic anisotropy. The underlying kinetic model is designed to describe essential structural and magnetic properties of CoPt_3-type clusters grown on a weakly interacting substrate through molecular beam epitaxy. The results suggest that perpendicular magnetic anisotropy can be enhanced when the field is applied during growth. For equilibrium bulk systems a significant shift of the onset temperature for L1_2 ordering is found, in agreement with predictions from Landau theory. Stronger field induced effects can be expected for magnetic fcc-alloys undergoing L1_0 ordering.Comment: 10 pages, 3 figure

    Supervised Learning in Multilayer Spiking Neural Networks

    Get PDF
    The current article introduces a supervised learning algorithm for multilayer spiking neural networks. The algorithm presented here overcomes some limitations of existing learning algorithms as it can be applied to neurons firing multiple spikes and it can in principle be applied to any linearisable neuron model. The algorithm is applied successfully to various benchmarks, such as the XOR problem and the Iris data set, as well as complex classifications problems. The simulations also show the flexibility of this supervised learning algorithm which permits different encodings of the spike timing patterns, including precise spike trains encoding.Comment: 38 pages, 4 figure

    A Survey on Continuous Time Computations

    Full text link
    We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models. We survey the existing models, summarizing results, and point to relevant references in the literature

    Large Diffeomorphisms in (2+1)-Quantum Gravity on the Torus

    Full text link
    The issue of how to deal with the modular transformations -- large diffeomorphisms -- in (2+1)-quantum gravity on the torus is discussed. I study the Chern-Simons/connection representation and show that the behavior of the modular transformations on the reduced configuration space is so bad that it is possible to rule out all finite dimensional unitary representations of the modular group on the Hilbert space of L2L^2-functions on the reduced configuration space. Furthermore, by assuming piecewise continuity for a dense subset of the vectors in any Hilbert space based on the space of complex valued functions on the reduced configuration space, it is shown that finite dimensional representations are excluded no matter what inner-product we define in this vector space. A brief discussion of the loop- and ADM-representations is also included.Comment: The proof for the nonexistence of the one- and two-dimensional representations of PSL(2,Z) in the relevant Hilbert space, has been extended to cover all finite dimensional unitary representations. The notation is slightly improved and a few references are added

    Information processing using a single dynamical node as complex system

    Get PDF
    Novel methods for information processing are highly desired in our information-driven society. Inspired by the brain's ability to process information, the recently introduced paradigm known as 'reservoir computing' shows that complex networks can efficiently perform computation. Here we introduce a novel architecture that reduces the usually required large number of elements to a single nonlinear node with delayed feedback. Through an electronic implementation, we experimentally and numerically demonstrate excellent performance in a speech recognition benchmark. Complementary numerical studies also show excellent performance for a time series prediction benchmark. These results prove that delay-dynamical systems, even in their simplest manifestation, can perform efficient information processing. This finding paves the way to feasible and resource-efficient technological implementations of reservoir computing

    Bio-Inspired Multi-Layer Spiking Neural Network Extracts Discriminative Features from Speech Signals

    Full text link
    Spiking neural networks (SNNs) enable power-efficient implementations due to their sparse, spike-based coding scheme. This paper develops a bio-inspired SNN that uses unsupervised learning to extract discriminative features from speech signals, which can subsequently be used in a classifier. The architecture consists of a spiking convolutional/pooling layer followed by a fully connected spiking layer for feature discovery. The convolutional layer of leaky, integrate-and-fire (LIF) neurons represents primary acoustic features. The fully connected layer is equipped with a probabilistic spike-timing-dependent plasticity learning rule. This layer represents the discriminative features through probabilistic, LIF neurons. To assess the discriminative power of the learned features, they are used in a hidden Markov model (HMM) for spoken digit recognition. The experimental results show performance above 96% that compares favorably with popular statistical feature extraction methods. Our results provide a novel demonstration of unsupervised feature acquisition in an SNN

    Reservoir Computing Approach to Robust Computation using Unreliable Nanoscale Networks

    Full text link
    As we approach the physical limits of CMOS technology, advances in materials science and nanotechnology are making available a variety of unconventional computing substrates that can potentially replace top-down-designed silicon-based computing devices. Inherent stochasticity in the fabrication process and nanometer scale of these substrates inevitably lead to design variations, defects, faults, and noise in the resulting devices. A key challenge is how to harness such devices to perform robust computation. We propose reservoir computing as a solution. In reservoir computing, computation takes place by translating the dynamics of an excited medium, called a reservoir, into a desired output. This approach eliminates the need for external control and redundancy, and the programming is done using a closed-form regression problem on the output, which also allows concurrent programming using a single device. Using a theoretical model, we show that both regular and irregular reservoirs are intrinsically robust to structural noise as they perform computation

    Morphological communication: exploiting coupled dynamics in a complex mechanical structure to achieve locomotion

    Get PDF
    Traditional engineering approaches strive to avoid, or actively suppress, nonlinear dynamic coupling among components. Biological systems, in contrast, are often rife with these dynamics. Could there be, in some cases, a benefit to high degrees of dynamical coupling? Here we present a distributed robotic control scheme inspired by the biological phenomenon of tensegrity-based mechanotransduction. This emergence of morphology-as-information-conduit or ‘morphological communication’, enabled by time-sensitive spiking neural networks, presents a new paradigm for the decentralized control of large, coupled, modular systems. These results significantly bolster, both in magnitude and in form, the idea of morphological computation in robotic control. Furthermore, they lend further credence to ideas of embodied anatomical computation in biological systems, on scales ranging from cellular structures up to the tendinous networks of the human hand

    Reconstruction from Radon projections and orthogonal expansion on a ball

    Full text link
    The relation between Radon transform and orthogonal expansions of a function on the unit ball in \RR^d is exploited. A compact formula for the partial sums of the expansion is given in terms of the Radon transform, which leads to algorithms for image reconstruction from Radon data. The relation between orthogonal expansion and the singular value decomposition of the Radon transform is also exploited.Comment: 15 page

    Comparative Quantizations of (2+1)-Dimensional Gravity

    Full text link
    We compare three approaches to the quantization of (2+1)-dimensional gravity with a negative cosmological constant: reduced phase space quantization with the York time slicing, quantization of the algebra of holonomies, and quantization of the space of classical solutions. The relationships among these quantum theories allow us to define and interpret time-dependent operators in the ``frozen time'' holonomy formulation.Comment: 24 pages, LaTeX, no figure
    corecore