Not enough data to create a plot.
Try a different view from the menu above.
Analog VLSI Model of Intersegmental Coordination with Nearest-Neighbor Coupling
Patel, Girish N., Holleman, Jeremy H., DeWeerth, Stephen P.
We have a developed an analog VLSI system that models the coordination ofneurobiological segmental oscillators. We have implemented and tested a system that consists of a chain of eleven pattern generating circuits thatare synaptically coupled to their nearest neighbors. Each pattern generating circuit is implemented with two silicon Morris-Lecar neurons that are connected in a reciprocally inhibitory network. We discuss themechanisms of oscillations in the two-cell network and explore system behavior based on isotropic and anisotropic coupling, and frequency gradientsalong the chain of oscillators.
A Revolution: Belief Propagation in Graphs with Cycles
Frey, Brendan J., MacKay, David J. C.
Department of Physics, Cavendish Laboratory Cambridge University Abstract Until recently, artificial intelligence researchers have frowned upon the application of probability propagation in Bayesian belief networks thathave cycles. The probability propagation algorithm is only exact in networks that are cycle-free. Examples of real-world channels include twisted-pair telephone wires, shielded cable-TV wire, fiberoptic cable, deep-space radio, terrestrial radio, and indoor radio. Engineers attempt to correct the errors introduced by the noise in these channels through the use of channel coding which adds protection to the information source, so that some channel errors can be corrected. A popular model of a physical channel is shown in Figure 1.
Hierarchical Non-linear Factor Analysis and Topographic Maps
Ghahramani, Zoubin, Hinton, Geoffrey E.
We first describe a hierarchical, generative model that can be viewed as a nonlinear generalisation of factor analysis and can be implemented in a neural network. The model performs perceptual inferencein a probabilistically consistent manner by using top-down, bottom-up and lateral connections. These connections can be learned using simple rules that require only locally available information.We then show how to incorporate lateral connections intothe generative model. The model extracts a sparse, distributed, hierarchical representation of depth from simplified random-dot stereograms and the localised disparity detectors in the first hidden layer form a topographic map. When presented with image patches from natural scenes, the model develops topographically organisedlocal feature detectors.
Effects of Spike Timing Underlying Binocular Integration and Rivalry in a Neural Model of Early Visual Cortex
In normal vision, the inputs from the two eyes are integrated intoa single percept. When dissimilar images are presented to the two eyes, however, perceptual integration givesway to alternation between monocular inputs, a phenomenon called binocular rivalry. Although recent evidence indicates that binocular rivalry involves a modulation ofneuronal responses in extrastriate cortex, the basic mechanisms responsible for differential processing of con:6.icting
Mapping a Manifold of Perceptual Observations
Nonlinear dimensionality reduction is formulated here as the problem of trying to find a Euclidean feature-space embedding of a set of observations that preserves as closely as possible their intrinsic metric structure - the distances between points on the observation manifold as measured along geodesic paths.
A 1, 000-Neuron System with One Million 7-bit Physical Interconnections
An asynchronous PDM (Pulse-Density-Modulating) digital neural network system has been developed in our laboratory. It consists of one thousand neurons that are physically interconnected via one million 7-bit synapses. It can solve one thousand simultaneous nonlinear first-order differential equations in a fully parallel and continuous fashion. The performance of this system was measured by a winner-take-all network with one thousand neurons. Although the magnitude of the input and network parameters were identical foreach competing neuron, one of them won in 6 milliseconds.
Blind Separation of Radio Signals in Fading Channels
We apply information maximization / maximum likelihood blind source separation [2, 6) to complex valued signals mixed with complex valuednonstationary matrices. This case arises in radio communications withbaseband signals. We incorporate known source signal distributions in the adaptation, thus making the algorithms less "blind". This results in drastic reduction of the amount of data needed for successful convergence. Adaptation to rapidly changing signal mixing conditions, such as to fading in mobile communications, becomesnow feasible as demonstrated by simulations. 1 Introduction In SDMA (spatial division multiple access) the purpose is to separate radio signals of interfering users (either intentional or accidental) from each others on the basis of the spatial characteristics of the signals using smart antennas, array processing, and beamforming [5, 8).
On-line Learning from Finite Training Sets in Nonlinear Networks
Online learning is one of the most common forms of neural network training.We present an analysis of online learning from finite training sets for nonlinear networks (namely, soft-committee machines), advancingthe theory to more realistic learning scenarios. Dynamical equations are derived for an appropriate set of order parameters; these are exact in the limiting case of either linear networks or infinite training sets. Preliminary comparisons with simulations suggest that the theory captures some effects of finite training sets, but may not yet account correctly for the presence of local minima.