Email updates

Keep up to date with the latest news and content from BMC Neuroscience and BioMed Central.

This article is part of the supplement: Eighteenth Annual Computational Neuroscience Meeting: CNS*2009

Open Access Poster presentation

The MIIND framework: combining population density methods, neural simulations and Wilson-Cowan dynamics into large-scale heterogeneous neural models of cognition

Marc de Kamps1* and Frank van der Velde2

Author Affiliations

1 School of Computing, University of Leeds, Leeds, LS2 9JT, UK

2 Cognitive Psychology, Leiden University, Leiden, 2333AK, the Netherlands

For all author emails, please log on.

BMC Neuroscience 2009, 10(Suppl 1):P276  doi:10.1186/1471-2202-10-S1-P276


The electronic version of this article is the complete one and can be found online at: http://www.biomedcentral.com/1471-2202/10/S1/P276


Published:13 July 2009

© 2009 de Kamps and Velde; licensee BioMed Central Ltd.

Introduction

Considerable effort is spent on large-scale neural models of brain behavior. These models are often very different and may simulate phenomena as varied as vision attention, working memory, etc. From a mathematical point of view they are usually very similar: mostly they are systems of coupled Wilson-Cowan equations, or Fokker-Planck-like equations when population density techniques (PDTs) are considered. The MIIND framework [1] allows the simulation of network processes in terms of Algorithms. The task of setting up the simulation of a large-scale network becomes trivial: one only has to specify the nodes in the network and their connections and to endow the nodes with the appropriate Algorithm. Since Wilson-Cowan algorithms and PDTs are provided with MIIND, a large number of models described in the literature can be easily replicated. Novel simulations can be configured very quickly because of MIIND's Python interface. A novel simulation of neural dynamics (e.g. a new simulator) only needs to be defined at the node level: as soon as it is provided with an Algorithm interface, large networks can be created on the fly.

Background

MIIND provides algorithms to simulate Wilson-Cowan dynamics, PDTs as described by Knight [2] and coworkers and by many others. In particular the algorithms provided for leaky-integrate-and-fire (LIF) neurons (which are closely related to Fokker-Planck equations describing the Ornstein-Uhlenbeck process) are probably the most efficient that are currently around [3,4] and one of the few which are available as Open Source code. Also some neuronal gain functions are available, which together with Wilson-Cowan dynamics can replicate neural population behaviour in considerable detail [5]. MIIND is implemented as a C++ framework with a SWIG-generated Python interface, which keeps the computationally most demanding algorithms efficient. It relies on the ROOT [6] for data storage and visualization.

Discussion

We will present several examples of novel cognitive models [7] and replications of published models (e.g. [8]). Most important issues in the current development of MIIND are the parallelization of the central simulation loop and the further development and implementation PDTs that go beyond LIF neurons and are able to deal with synaptic kinetics and spike-rate adaptation. MIIND now provides an interface to NEST [9], so that large-scale network models can be created which include Monte Carlo simulations. Algorithms can be exchanged in run time so that different simulations of neuronal dynamics can be directly compared within the same network model. It is also possible to create heterogeneous networks having different parts of the network are simulated by different simulators.

References

  1. de Kamps M, Baier V, Drever J, Dietz M, Mösenlechner L, Velde F: The state of MIIND.

    Neur Netw 2008, 21:1164-1181. Publisher Full Text OpenURL

  2. Omurtag A, Knight BW, Sirovich L: On the simulation of large populations of neurons.

    Jour Comp Neurosc 2001, 8:51-63. Publisher Full Text OpenURL

  3. de Kamps M: An analytic solution of the reentrant Poisson master equation and its application in the simulation of large groups of spiking neurons.

    Proc IJCNN 2006, 102-109. OpenURL

  4. de Kamps M: A simple and stable solution for the population density equation.

    Neur Comp 2003, 15:2129-2146. Publisher Full Text OpenURL

  5. La Camera G, Rauch A, Lüscher H-R, Senn W, Fusi S: Minimal models of adapted neuronal response to in vivo-like input currents.

    Neur Comput 2004, 16:2101-2124. Publisher Full Text OpenURL

  6. ROOT, An object-oriented data analysis framework [http://root.cern.ch] webcite

  7. de Kamps M, Velde F, Harrison D: A neuro-dynamical model for global saliency. In preparation

  8. Brunel N: Persistent activity and the single-cell frequency-current curve in a cortical network model.

    Network 2000, 11:261-280. PubMed Abstract OpenURL

  9. Gewaltig M-O, Diesmann M: NEST (Neural Simulation Tool).

    Scholarpedia 2007, 2:1430-1434. OpenURL