| 1. |
- Djurfeldt, Mikael, 1967-, et al.
(författare)
-
See-A framework for simulation of biologically detailed and artificial neural networks and systems
- 1999
-
Ingår i: Neurocomputing. - 0925-2312 .- 1872-8286. ; 26-27, s. 997-1003
-
Tidskriftsartikel (refereegranskat)abstract
- See is a software framework for simulation of biologically detailed and artficial neural networks and systems. It includes a general purpose scripting language, based on Scheme,which also can be used interactively, while the basic framework is written in C++. Models can be built on the Scheme level from `simulation objectsa, each representing a population ofneurons, a projection, etc. The simulator provides a flexible and efficient protocol for data transfer between such objects. See contains a user interface to the parallelized, platformindependent, library SPLIT intended for biologically detailed modeling of large-scale networks and is easy to extend with new user code, both on the C++ and Scheme levels.
|
|
| 2. |
|
|
| 3. |
- Lansner, Anders, et al.
(författare)
-
Cell assembly dynamics in detailed and abstract attractor models of cortical associative memory
- 2003
-
Ingår i: Theory in biosciences. - : Springer Science and Business Media LLC. - 1431-7613 .- 1611-7530. ; 122:1, s. 19-36
-
Tidskriftsartikel (refereegranskat)abstract
- During the last few decades we have seen a convergence among ideas and hypotheses regarding functional principles underlying human memory. Hebb's now more than fifty years old conjecture concerning synaptic plasticity and cell assemblies, formalized mathematically as attractor neural networks, has remained among the most viable and productive theoretical frameworks. It suggests plausible explanations for Gestalt aspects of active memory like perceptual completion, reconstruction and rivalry. We review the biological plausibility of these theories and discuss some critical issues concerning their associative memory functionality in the light of simulation studies of models with palimpsest memory properties. The focus is on memory properties and dynamics of networks modularized in terms of cortical minicolumns and hypercolumns. Biophysical compartmental models demonstrate attractor dynamics that support cell assembly operations with fast convergence and low firing rates. Using a scaling model we obtain reasonable relative connection densities and amplitudes. An abstract attractor network model reproduces systems level psychological phenomena seen in human memory experiments as the Sternberg and von Restorff effects. We conclude that there is today considerable substance in Hebb's theory of cell assemblies and its attractor network formulations, and that they have contributed to increasing our understanding of cortical associative memory function. The criticism raised with regard to biological and psychological plausibility as well as low storage capacity, slow retrieval etc has largely been disproved. Rather, this paradigm has gained further support from new experimental data as well as computational modeling.
|
|
| 4. |
|
|
| 5. |
- Sandberg, Anders, et al.
(författare)
-
A Bayesian attractor network with incremental learning
- 2002
-
Ingår i: Network. - 0954-898X .- 1361-6536. ; 13:2, s. 179-194
-
Tidskriftsartikel (refereegranskat)abstract
- A realtime online learning system with capacity limits needs to gradually forget old information in order to avoid catastrophic forgetting. This can be achieved by allowing new information to overwrite old, as in a so-called palimpsest memory. This paper describes an incremental learning rule based on the Bayesian confidence propagation neural network that has palimpsest properties when employed in an attractor neural network. The network does not suffer from catastrophic forgetting, has a capacity dependent on the learning time constant and exhibits faster convergence for newer patterns.
|
|
| 6. |
- Sandberg, Anders, et al.
(författare)
-
A palimpsest memory based on an incremental Bayesian learning rule
- 2000
-
Ingår i: Neurocomputing. - 0925-2312 .- 1872-8286. ; 32, s. 987-994
-
Tidskriftsartikel (refereegranskat)abstract
- Capacity limited memory systems need to gradually forget old information in order to avoid catastrophic forgetting where all stored information is lost. This can be achieved by allowing new information to overwrite old, as in the so-called palimpsest memory. This paper describes a new such learning rule employed in an attractor neural network. The network does not exhibit catastrophic forgetting, has a capacity dependent on the learning time constant and exhibits recency effects in retrieval.
|
|
| 7. |
- Steinert, Rebecca
(författare)
-
Probabilistic Fault Management in Networked Systems
- 2014
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- Technical advances in network communication systems (e.g. radio access networks) combined with evolving concepts based on virtualization (e.g. clouds), require new management algorithms in order to handle the increasing complexity in the network behavior and variability in the network environment. Current network management operations are primarily centralized and deterministic, and are carried out via automated scripts and manual interventions, which work for mid-sized and fairly static networks. The next generation of communication networks and systems will be of significantly larger size and complexity, and will require scalable and autonomous management algorithms in order to meet operational requirements on reliability, failure resilience, and resource-efficiency.A promising approach to address these challenges includes the development of probabilistic management algorithms, following three main design goals. The first goal relates to all aspects of scalability, ranging from efficient usage of network resources to computational efficiency. The second goal relates to adaptability in maintaining the models up-to-date for the purpose of accurately reflecting the network state. The third goal relates to reliability in the algorithm performance in the sense of improved performance predictability and simplified algorithm control.This thesis is about probabilistic approaches to fault management that follow the concepts of probabilistic network management (PNM). An overview of existing network management algorithms and methods in relation to PNM is provided. The concepts of PNM and the implications of employing PNM-algorithms are presented and discussed. Moreover, some of the practical differences of using a probabilistic fault detection algorithm compared to a deterministic method are investigated. Further, six probabilistic fault management algorithms that implement different aspects of PNM are presented.The algorithms are highly decentralized, adaptive and autonomous, and cover several problem areas, such as probabilistic fault detection and controllable detection performance; distributed and decentralized change detection in modeled link metrics; root-cause analysis in virtual overlays; event-correlation and pattern mining in data logs; and, probabilistic failure diagnosis. The probabilistic models (for a large part based on Bayesian parameter estimation) are memory-efficient and can be used and re-used for multiple purposes, such as performance monitoring, detection, and self-adjustment of the algorithm behavior.
|
|
| 8. |
- Auffarth, Benjamin, 1979-
(författare)
-
Machine Learning Techniques with Specific Application to the Early Olfactory System
- 2012
-
Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
- This thesis deals with machine learning techniques for the extraction of structure and the analysis of the vertebrate olfactory pathway based on related methods. Some of its main contributions are summarized below.We have performed a systematic investigation for classification in biomedical images with the goal of recognizing a material in these images by its texture. This investigation included (i) different measures for evaluating the importance of image descriptors (features), (ii) methods to select a feature set based on these evaluations, and (iii) classification algorithms. Image features were evaluated according to their estimated relevance for the classification task and their redundancy with other features. For this purpose, we proposed a framework for relevance and redundancy measures and, within this framework, we proposed two new measures. These were the value difference metric and the fit criterion. Both measures performed well in comparison with other previously used ones for evaluating features. We also proposed a Hopfield network as a method for feature selection, which in experiments gave one of the best results relative to other previously used approaches.We proposed a genetic algorithm for clustering and tested it on several realworld datasets. This genetic algorithm was novel in several ways, including (i) the use of intra-cluster distance as additional optimization criterion, (ii) an annealing procedure, and (iii) adaptation of mutation rates. As opposed to many conventional clustering algorithms, our optimization framework allowed us to use different cluster validation measures including those which do not rely on cluster centroids. We demonstrated the use of the clustering algorithm experimentally with several cluster validity measures as optimization criteria. We compared the performance of our clustering algorithm to that of the often-used fuzzy c-means algorithm on several standard machine learning datasets from the University of California/Urvine (UCI) and obtained good results.The organization of representations in the brain has been observed at several stages of processing to spatially decompose input from the environment into features that are somehow relevant from a behavioral or perceptual standpoint. For the perception of smells, the analysis of such an organization, however, is not as straightforward because of the missing metric. Some studies report spatial clusters for several combinations of physico-chemical properties in the olfactory bulb at the level of the glomeruli. We performed a systematic study of representations based on a dataset of activity-related images comprising more than 350 odorants and covering the whole spatial array of the first synaptic level in the olfactory system. We found clustered representations for several physico-chemical properties. We compared the relevance of these properties to activations and estimated the size of the coding zones. The results confirmed and extended previous studies on olfactory coding for physico-chemical properties. Particularly of interest was the spatial progression by carbon chain that we found. We discussed our estimates of relevance and coding size in the context of processing strategies. We think that the results obtained in this study could guide the search into olfactory coding primitives and the understanding of the stimulus space.In a second study on representations in the olfactory bulb, we grouped odorants together by perceptual categories, such as floral and fruity. By the application of the same statistical methods as in the previous study, we found clustered zones for these categories. Furthermore, we found that distances between spatial representations were related to perceptual differences in humans as reported in the literature. This was possibly the first time that such an analysis had been done. Apart from pointing towards a spatial decomposition by perceptual dimensions, results indicate that distance relationships between representations could be perceptually meaningful.In a third study, we modeled axon convergence from olfactory receptor neurons to the olfactory bulb. Sensory neurons were stimulated by a set of biologically-relevant odors, which were described by a set of physico-chemical properties that covaried with the neural and glomerular population activity in the olfactory bulb. Convergence was mediated by the covariance between olfactory neurons. In our model, we could replicate the formation of glomeruli and concentration coding as reported in the literature, and further, we found that the spatial relationships between representational zones resulting from our model correlated with reported perceptual differences between odor categories. This shows that natural statistics, including similarity of physico-chemical structure of odorants, can give rise to an ordered arrangement of representations at the olfactory bulb level where the distances between representations are perceptually relevant.
|
|
| 9. |
- Auffarth, Benjamin, et al.
(författare)
-
Map formation in the olfactory bulb by axon guidance of olfactory neurons
- 2011
-
Ingår i: Frontiers in Systems Neuroscience. - Ch. de la Pécholettaz 6 CH – 1066 Epalinges Switzerland : Frontiers Media SA. - 1662-5137. ; 5:0
-
Tidskriftsartikel (refereegranskat)abstract
- The organization of representations in the brain has been observed to locally reflect subspaces of inputs that are relevant to behavioral or perceptual feature combinations, such as in areas receptive to lower and higher-order features in the visual system. The early olfactory system developed highly plastic mechanisms and convergent evidence indicates that projections from primary neurons converge onto the glomerular level of the olfactory bulb (OB) to form a code composed of continuous spatial zones that are differentially active for particular physico?-chemical feature combinations, some of which are known to trigger behavioral responses. In a model study of the early human olfactory system, we derive a glomerular organization based on a set of real-world,biologically-relevant stimuli, a distribution of receptors that respond each to a set of odorants of similar ranges of molecular properties, and a mechanism of axon guidance based on activity. Apart from demonstrating activity-dependent glomeruli formation and reproducing the relationship of glomerular recruitment with concentration, it is shown that glomerular responses reflect similarities of human odor category perceptions and that further, a spatial code provides a better correlation than a distributed population code. These results are consistent with evidence of functional compartmentalization in the OB and could suggest a function for the bulb in encoding of perceptual dimensions.
|
|
| 10. |
- Benjaminsson, Simon, 1982-, et al.
(författare)
-
A Novel Model-Free Data Analysis Technique Based on Clustering in a Mutual Information Space : Application to Resting-State fMRI
- 2010
-
Ingår i: Frontiers in Systems Neuroscience. - : Frontiers Media SA. - 1662-5137. ; 4, s. 34:1-34:8
-
Tidskriftsartikel (refereegranskat)abstract
- Non-parametric data-driven analysis techniques can be used to study datasets with few assumptions about the data and underlying experiment. Variations of independent component analysis (ICA) have been the methods mostly used on fMRI data, e.g., in finding resting-state networks thought to reflect the connectivity of the brain. Here we present a novel data analysis technique and demonstrate it on resting-state fMRI data. It is a generic method with few underlying assumptions about the data. The results are built from the statistical relations between all input voxels, resulting in a whole-brain analysis on a voxel level. It has good scalability properties and the parallel implementation is capable of handling large datasets and databases. From the mutual information between the activities of the voxels over time, a distance matrix is created for all voxels in the input space. Multidimensional scaling is used to put the voxels in a lower-dimensional space reflecting the dependency relations based on the distance matrix. By performing clustering in this space we can find the strong statistical regularities in the data, which for the resting-state data turns out to be the resting-state networks. The decomposition is performed in the last step of the algorithm and is computationally simple. This opens up for rapid analysis and visualization of the data on different spatial levels, as well as automatically finding a suitable number of decomposition components.
|
|
