Search

In sensory neural system, external asynchronous stimuli play an important role in perceptual learning, associative memory and map development. However, the organization of structure and dynamics of neural networks induced by external asynchronous stimuli are not well understood. Spike-timing-dependent plasticity (STDP) is a typical synaptic plasticity that has been extensively found in the sensory systems and that has received much theoretical attention. This synaptic plasticity is highly sensitive to correlations between pre- and postsynaptic firings. Thus, STDP is expected to play an important role in response to external asynchronous stimuli, which can induce segregative pre- and postsynaptic firings. In this paper, we study the impact of external asynchronous stimuli on the organization of structure and dynamics of neural networks through STDP. We construct a two-dimensional spatial neural network model with local connectivity and sparseness, and use external currents to stimulate alternately on different spatial layers. The adopted external currents imposed alternately on spatial layers can be here regarded as external asynchronous stimuli. Through extensive numerical simulations, we focus on the effects of stimulus number and inter-stimulus timing on synaptic connecting weights and the property of propagation dynamics in the resulting network structure. Interestingly, the resulting feedforward structure induced by stimulus-dependent asynchronous firings and its propagation dynamics reflect both the underlying property of STDP. The results imply a possible important role of STDP in generating feedforward structure and collective propagation activity required for experience-dependent map plasticity in developing in vivo sensory pathways and cortices. The relevance of the results to cue-triggered recall of learned temporal sequences, an important cognitive function, is briefly discussed as well. Furthermore, this finding suggests a potential application for examining STDP by measuring neural population activity in a cultured neural network. [ABSTRACT FROM AUTHOR]

Quality assessment (QA) for predicted protein structural models is an important and challenging research problem in protein structure prediction. Consensus Global Distance Test (CGDT) methods assess each decoy (predicted structural model) based on its structural similarity to all others in a decoy set and has been proved to work well when good decoys are in a majority cluster. Scoring functions evaluate each single decoy based on its structural properties. Both methods have their merits and limitations. In this paper, we present a novel method called PWCom, which consists of two neural networks sequentially to combine CGDT and single model scoring methods such as RW, DDFire and OPUS-Ca. Specifically, for every pair of decoys, the difference of the corresponding feature vectors is input to the first neural network which enables one to predict whether the decoy-pair are significantly different in terms of their GDT scores to the native. If yes, the second neural network is used to decide which one of the two is closer to the native structure. The quality score for each decoy in the pool is based on the number of winning times during the pairwise comparisons. Test results on three benchmark datasets from different model generation methods showed that PWCom significantly improves over consensus GDT and single scoring methods. The QA server (MUFOLD-Server) applying this method in CASP 10 QA category was ranked the second place in terms of Pearson and Spearman correlation performance. [ABSTRACT FROM AUTHOR]

Relating structure and function of neuronal circuits is a challenging problem. It requires demonstrating how dynamical patterns of spiking activity lead to functions like cognitive behaviour and identifying the neurons and connections that lead to appropriate activity of a circuit. We apply a “developmental approach” to define the connectome of a simple nervous system, where connections between neurons are not prescribed but appear as a result of neuron growth. A gradient based mathematical model of two-dimensional axon growth from rows of undifferentiated neurons is derived for the different types of neurons in the brainstem and spinal cord of young tadpoles of the frog Xenopus. Model parameters define a two-dimensional CNS growth environment with three gradient cues and the specific responsiveness of the axons of each neuron type to these cues. The model is described by a nonlinear system of three difference equations; it includes a random variable, and takes specific neuron characteristics into account. Anatomical measurements are first used to position cell bodies in rows and define axon origins. Then a generalization procedure allows information on the axons of individual neurons from small anatomical datasets to be used to generate larger artificial datasets. To specify parameters in the axon growth model we use a stochastic optimization procedure, derive a cost function and find the optimal parameters for each type of neuron. Our biologically realistic model of axon growth starts from axon outgrowth from the cell body and generates multiple axons for each different neuron type with statistical properties matching those of real axons. We illustrate how the axon growth model works for neurons with axons which grow to the same and the opposite side of the CNS. We then show how, by adding a simple specification for dendrite morphology, our model “developmental approach” allows us to generate biologically-realistic connectomes. [ABSTRACT FROM AUTHOR]

An advanced graph theoretical approach is introduced that enables a higher level of functional interpretation of samples of directed networks with identical fixed pairwise different vertex labels that are drawn from a particular population. Compared to the analysis of single networks, their investigation promises to yield more detailed information about the represented system. Often patterns of directed edges in sample element networks are too intractable for a direct evaluation and interpretation. The new approach addresses the problem of simplifying topological information and characterizes such a sample of networks by finding its locatable characteristic topological patterns. These patterns, essentially sample-specific network motifs with vertex labeling, might represent the essence of the intricate topological information contained in all sample element networks and provides as well a means of differentiating network samples. Central to the accurateness of this approach is the null model and its properties, which is needed to assign significance to topological patterns. As a proof of principle the proposed approach has been applied to the analysis of networks that represent brain connectivity before and during painful stimulation in patients with major depression and in healthy subjects. The accomplished reduction of topological information enables a cautious functional interpretation of the altered neuronal processing of pain in both groups. [ABSTRACT FROM AUTHOR]