<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Pattern recognition with Spiking Neural Networks: a simple training method</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Francois Christophe</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tommi Mikkonen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Vafa Andalibi</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Kai Koskimies</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Teemu Laukkarinen</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Tampere University of Technology Korkeakoulunkatu 1</institution>
          ,
          <addr-line>FI-33720 Tampere</addr-line>
          ,
          <country country="FI">Finland</country>
        </aff>
      </contrib-group>
      <fpage>296</fpage>
      <lpage>308</lpage>
      <abstract>
        <p>As computers are getting more pervasive, software becomes transferable to di erent types of hardware and, at the extreme, being bio-compatible. Recent e orts in Arti cial Intelligence propose that software can be trained and taught instead of \hard-coded" sequences. This paper addresses the learnability of software in the context of platforms integrating biological components. A method for training Spiking Neural Networks (SNNs) for pattern recognition is proposed, based on spike timing dependent plasticity (STDP) of connections. STDP corresponds to the way connections between neurons change according to the spiking activity in the network, and we use STDP to stimulate outputs of the network shortly after feeding it with a pattern as input, thus creating speci c pathways in the network. The computational model used to test this method through simulations is developed to t the behaviour of biological neural networks, showing the potential for training neural cells into biological processors.</p>
      </abstract>
      <kwd-group>
        <kwd>Pattern recognition</kwd>
        <kwd>Arti cial Neural Networks</kwd>
        <kwd>Spiking Neural Networks</kwd>
        <kwd>Computational models</kwd>
        <kwd>Computational Biology</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Software is everywhere: the human environment is populated by more and more
software-driven intelligent devices, connected by Internet and other networks.
With the apparition of wearables and implantables, computers are getting more
and more pervasive and close to the biological world. In such systems, software
is expected to expand on various types of platforms.</p>
      <p>
        In the current information technology, the interplay between biology and
software has been indirect. Humans use software through various user interfaces,
rather than with direct communication links. Concepts from biological systems
have inspired various heuristic algorithms to solve computer science problems
(typically optimization and search), or inspired software for communication
systems to mimic the adaptive behavior of biological systems [
        <xref ref-type="bibr" rid="ref12 ref15">15, 12</xref>
        ]. Novel ways
of programming by training, teaching, imitation and reward are already being
demonstrated in robotics with the help of in-silico chips behaving like neurons,
i.e. neuromorphic chips [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>The work reported in this paper is a rst step in a project aiming at
developing techniques to support the direct run-time interaction of biological entities
and software. Our vision is that eventually software interacts directly with the
biological world: software controls biological entities, and biological entities control
software systems. Thus, rather than using the biological world as a model of new
algorithms, we intend to let biological entities communicate directly with
software. In this way, software systems and biological entities form co-operational
organizations in which both parties solve problems suitable for them, contributing
to a common goal. Typically, biological entities are superior in e cient massive
parallel processing of fuzzy data and resilient to damage, while traditional
software systems are better suited for making discrete, well-de ned logical decisions.
Biological entities are also far more energy-e cient than traditional computing
devices.</p>
      <p>
        The project focuses on integrating real neural cultures with software systems.
A central problem then is the training of biological neural structures for a
particular task and the connection of the trained neural culture to the software system.
However, to experiment with di erent approaches to solve these problems,
available biological neural cultures impose many practical problems: their detailed
structure is di cult to study, their lifetime is limited, and they need constant
nutrition. Luckily, for the past decades, Arti cial Neural Networks (ANNs) have
evolved to the point of being currently very close in behaviour to biological neural
structures [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Thus, in the rst stage of the project, we use ANNs to simulate
biological neural networks. In a later stage we aim to transfer the techniques to
biological neural cultures currently available on Multi-Electrode Arrays (MEAs)
[
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
      <p>In this paper we study the basic training problem of biological neural
networks using a biologically realistic model of spiking neurons. A simple pattern
recognition problem is applied to this model. We demonstrate that a training
technique based on Spike-Timing-Dependent-Plasticity (STDP) appears to be
su cient for these kinds of tasks.</p>
      <p>The rest of this paper is structured as follows. In Section 2, we discuss related
work. In Section 3, we introduce the computational model used in this paper. In
Section 4, we evaluate the results we have obtained. In Section 5, we draw some
nal conclusions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related work</title>
      <p>
        In [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], Maass draws a retrospective of the techniques used for modeling neural
networks and presents the third generation of neural networks: SNNs. This study
classi es neural networks according to their computational units into three
generation: the rst generation being perceptrons based on McCulloch-Pitts neurons
[
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], the second generation being networks such as feedforward networks where
neurons apply an \activation function", and the third generation being networks
where neurons use spikes to encode information. From this retrospective, Maass
presents the computational advantages of SNNs according to the computation
of, rst, boolean functions, and secondly according to functions with analog
input and boolean output. For instance, Seung demonstrated in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] that SNNs
can be trained to behave as an XOR logical gate. The study of single neurons,
the population of networks and plasticity [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] provides guidelines on how single
computation units, i.e. neurons, function but more importantly on how to
structure a network (e.g. number of layers, number of units in a layer) and on the
models of evolution of connectivity between neurons, i.e. plasticity.
      </p>
      <p>
        In their chapter on computing with SNNs [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], Paugam and Bohte present
di erent methods applied for learning in SNNs. In this review chapter, they
distinguish the traditional learning methods issued from previous research with
ANNs, and learning methods that are emerging solely from computing with
SNNs. Among the traditional methods are temporal coding, unsupervised
learning such as Hebbien learning or Kohonen's self-organizing maps, and supervised
learning such as error-backpropagation rules. About the \unconventional"
learning methods, they are regrouped into so-called Reservoir Computing methods.
Reservoir Computing methods regroup Echo State Networks and Liquid State
Machines. The main characteristic of reservoir computing models relies in the
apparent disorganization of the network between input and output layers. This
network, the reservoir, is a recurrent network where neurons are interconnected
by a random sparse set of weighted links. More over, this network is usually left
untrained and only the output connections are trained and optimized according
to the desired answer based on what input is given.
      </p>
      <p>
        To a certain extent, the simple training method proposed in this paper follows
the idea of training only the output layer as STDP will act alone for reinforcing
the positive pathways of the network. However, the network studied in this paper
is simply a feed-forward network modeled with the BRIAN simulator [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Computational model</title>
      <p>
        The training method presented in this paper is studied with the computational
model presented in this section because it provides a rst test of feasibility before
testing this method on biological Neural Networks (bioNNs). The model used for
this research is composed of two basic elements: neurons and synapses. Neurons
are built based on the ring model of Izhikevich which is shown to be very
realistic in [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Synapses follow the Spike Timing Dependent Plasticity (STDP),
meaning that a connection between two neurons will grow if the post-synaptic
neuron res soon after the pre-synaptic neuron. On the opposite, a connection
will decrease if the post-synaptic neuron res before the pre-synaptic neuron.
This section presents these two basic models in more details and then gives a
view on the composition of the entire neural network.
3.1
      </p>
      <sec id="sec-3-1">
        <title>Model of spiking neuron</title>
        <p>
          The model of a spiking neuron used in this study is from Izhikevich [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. This
model reproduces the dynamic behavior of neurons while being computationally
simple as opposed to models accounting for the structural parameters of neurons
(for example, Hodgkin-Huxley model [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]). The Izhikevich model expresses the
variations of electric potential in the neuron's membrane according to the current
owing through the membranes ion channels. These electric potential variations
are expressed in the form of two di erential equations, as follows:
dv
dt
du
dt
= a(bv
        </p>
        <p>
          u)
C
= k(v
vr)(v
vt)
u + I
where v represents the membrane potential, u the recovery current of the
membrane, I the input current through the membrane, C the membrane capacitance,
vr the resting potential of the membrane, vt the threshold potential for the
membrane to re a spike, k, a and b parameters adjusted according to the ring
pattern required. The variables v and u of equation 1 are reset after v reaches a
peak value vpeak, as follows:
if v
vpeak, then
(v
u
c
u + d
STDP is a rule for neurons to strengthen or weaken their connections according
to their degree of synchronous ring [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. This rule mostly known in Neurobiology
and Neuroscience is similar to the Hebbian learning rule widely used in learning
Arti cial Neural Networks and Self-Optimizing Maps [
          <xref ref-type="bibr" rid="ref10 ref5">5, 10</xref>
          ]. Considering a
presynaptic neuron i and a post-synaptic neuron j, the STDP rule characterizes
the changes in synaptic strength as:
        </p>
        <p>N N
wj = X X W (tlj
with the function W (x) de ning the order of decrease or increase of strength
depending on the synchrony of spiking between pre- and post-synaptic neurons,
expressed as:</p>
        <p>W (x) =
(A+ exp(
x ) if x &gt; 0
+
A exp( x ) otherwise.
(4)</p>
        <p>In equations 3 and 4, tlj represents the lth spiking time of neuron j; similarly,
tik stands for the kth spike timing of neuron i; A+ and A are constants de ning
the amplitude of change in weight (at t = 0+ and t = 0 , respectively); and, +
and are time constants of the exponential decrease in weight change.
The network developed in this study as an example of pattern recognition is
presented in Fig. 3. This network is dedicated at recognizing patterns from a
5x5 pixels image. It is composed of:
{ 25 input neurons corresponding to each pixel of the image,
{ a hidden layer of 5 neurons, and
{ 2 output neurons (1 corresponding to the neuron reacting when a circle
appears in the image, the other one being a test neuron for comparison
between learning and no stimulation).
4</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Training method and Evaluation</title>
      <p>This section goes more into the details of the simple learning method using
STDP rule for training the network. A pattern recognition task is used as a case
study for testing the learning method proposed.
4.1</p>
      <sec id="sec-4-1">
        <title>Pattern recognition task</title>
        <p>The pattern recognition task evaluated during this simple case study consists in
making the di erence between a circle given as input stimuli and other inputs
(in that case an X-cross shape). These shapes are represented as coming from
a 25 pixels image (5x5 matrix), each pixel being binary: black or white. Figure
4 presents the input circle and X-cross patterns and their respective
representations as input stimuli to the network.</p>
        <p>(a) Circle pattern
(b) X-cross pattern
After initial tests on the learning ability of the network, the training period was
adjusted to be 15s during which the input layer is stimulated every 100ms with
a circle pattern. 10ms after stimulating the input layer, the output neuron is
given an external stimulation making it to spike. This spiking, in relation with
the preliminary spiking of neurons from the input layer, reinforces the paths
between activated neurons of the input layer and the trained neuron of the output
layer. This training can be seen in the rst phase of the time diagrams (top and
middle) of Figure 5 from t = 0 to 15s.
The testing phase is composed of 6 stimuli with circle pattern and 7 stimuli
with a di erent pattern (in that case representing an X-cross). These stimuli
of the input layer happen without any external stimulation of the output layer.
The neuron trained for recognizing a circle res on its own after the learning
phase. These test patterns are sent between t = 15; 5 to 25s with the following
sequence: fcircle, circle, cross, cross, circle, cross, cross, cross, cross, circle, circle,
cross, circleg at the respective times f15.5, 16, 16.5, 17, 17.5, 18, 18.5, 19, 20,
21, 23, 24, 24.5g seconds. The two upper time diagrams of Figure 5 show this
test phase.</p>
        <p>The third time diagram of Figure 5 (down) presents the evolution of strength
of synapses between neurons from the hidden layer and neurons from the output
layer. This evolution shows rst a stabilization period from the random strengths
given as initial condition to lower values. Secondly, learning can be seen as the
strengths of certain synapses increase to high levels of connectivity (i.e. to
levels higher than 0.8 times the maximum connectivity and often reaching this
maximum).
4.3</p>
      </sec>
      <sec id="sec-4-2">
        <title>Results</title>
        <p>The 1000 simulations of this experiment revealed a success rate of 80.3% in
recognizing a circle from a cross. This rate was computed after the execution
of a thousand experiments. From these experiments, ve di erent cases were
observed:
{ correct learning: output res only when a circle is given as input (80.3%)
{ some mistakes: output res sometimes when input is a cross (5.7%)
{ always ring: output always res whatever the input may be (12.8%)
{ no learning: output never res (1.1%)</p>
        <p>{ wrong learning: output res only when input is a cross (0.1%)
These di erent cases are represented in Figure 6.</p>
        <p>These results show a high learning rate, i.e. a high rate of correct experiments
(80.3%), meaning that such learning method has correct grounds. Indeed, there
is space for improving this rate and a lot to learn from the analysis of failed
experiments.</p>
        <p>First, we can notice that the network keeps on learning even after the
training phase has stopped. Each time a pattern is fed as input to the network, small
increase in synaptic weights take place.</p>
        <p>The second important thing noticed due to this continuous learning is that
the output neuron trained to recognize a circle also gets trained when receiving
another pattern as input. As the synaptic levels may already be high, it requires
only few X-cross stimulation signals for the output neuron to start spiking and
we notice that when it has learned to spike for a cross pattern, it will then re
each time a cross appears. This is what happens for the cases where some
mistakes are found (57 cases out of 1000 simulations).</p>
        <p>Third, for 128 simulations the synaptic levels are high from the beginning of
the training due to the initial random value of synaptic weights. This causes the
network to be \over-trained" and thus to re for every kind of patterns from the
beginning of the test phase. In the contrary, for 11 simulations the output neuron
does not re at all when given any input. These 11 tests show clearly low rates in
synaptic weights and low increase in synaptic weights during training expressing
the fact that the network does not have time to learn during this period of time.
The only simulation where the output neuron res only and always when given
the wrong input could not be explained.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Discussion and future work</title>
      <p>We have studied a central problem in using biological neural networks as
computing resources: how to train the neural culture for a particular task. The SNN
presented in this paper shows reasonable success rate in learning (80.3%) to
di erentiate between two patterns. As the behavior of the simulated network is
very close to that of real biological neural networks (bioNNs), this experiment
gives preliminary insight for using bioNNs to process complex tasks requiring
massive parallelism.</p>
      <p>However, there is still possibility for improvement in performing such
recognition tasks. In the case where pathways did not have time to form during initial
training, it is indeed possible to continue training the network until synaptic level
reaches the appropriate levels. On the opposite case, when the network res for
any type of input pattern, meaning that it is \over-trained", training the
network with negative output stimulation should help restoring the di erentiation</p>
      <p>(a) Correct learning (rate 80.3%)
(b) Some mistakes (rate 5.7%)
(c) Always ring (rate 12.8%)
(d) No learning (rate 1.1%) (e) Wrong learning (rate 0.1%)
Fig. 6. Example of the 5 di erent cases found in experiments
306
between input patterns. Such negative stimulation can be realized by
stimulating the output neuron just prior to the input pattern, when an input pattern
is to be discarded by the network. This way, the synaptic pathways related to
this input pattern would decrease due to the STDP rule, thus de-correlating the
output neuron with this input pattern.</p>
      <p>The proximity in behavior of SNNs from bioNNs should not require e orts
to transfer computations from silicon platforms into biological platforms. From
this point, transferring the various tasks developed for the past sixty years with
ANNs (e.g. classi ers, generators, etc.) to small bio-computers will be possible.
Research directions for such transfer lead to the following questions:
{ Can a taxonomy of the various tasks performed with ANNs and their
hierarchical relations be developed?
{ Can we classify tasks as unitary/atomic to some higher level? On the other
hand, can tasks be broken down into summation of unitary tasks?
{ Is it possible to automatically associate tasks to network structures (number
of nodes, number of layers etc.) ?
{ Can training also be automatically generated for these speci c tasks?</p>
      <p>These questions could lead to the construction of a compiler deriving the
number of biological neural networks used for an application, their structural
parameters and the training associated to each task required for the application.
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>In this paper, we presented a simple learning method using STDP for training
pathways of a SNN. This method was tested on a SNN model trained to di
erentiate between two patterns given as input to the network. The results of this
test (80.3% success rate) combined with the fact that the behaviour of the
simulated network is very close to the one of a real biological network gives promising
expectations for the future of this project. This rst test is still a preliminary
test towards applying bioNNs to the computation of more complex tasks such
as handwritten digit and character recognition 1. Expectations on the results to
such test should give similar success rate as to the test conducted in this paper.
Next experiments will be conducted on real biological cells in order to validate
the possibility of training bioNNs for pattern recognition tasks. In the nal stage
we intend to connect such trained bioNNs with software applications requiring
pattern recognition capability such as classi cation of moving objects.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgement</title>
      <p>This research is funded by the Academy of Finland under project named
\Biointegrated Software Development for Adaptive Sensor Networks", project
number 278882.
1 Such training is usually tested on the
http://yann.lecun.com/exdb/mnist/
MNIST</p>
      <p>dataset available from</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Bi</surname>
            ,
            <given-names>G.Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Poo</surname>
            ,
            <given-names>M.M.:</given-names>
          </string-name>
          <article-title>Synaptic modi cations in cultured hippocampal neurons: dependence on spike timing, synaptic strength, and postsynaptic cell type</article-title>
          .
          <source>The Journal of neuroscience : the o cial journal of the Society for Neuroscience</source>
          <volume>18</volume>
          ,
          <issue>10464</issue>
          {
          <fpage>10472</fpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Brette</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rudolph</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Carnevale</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hines</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Beeman</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bower</surname>
            ,
            <given-names>J.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Diesmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Morrison</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Goodman</surname>
            ,
            <given-names>P.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Harris</surname>
            ,
            <given-names>F.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zirpe</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , Natschlager, T.,
          <string-name>
            <surname>Pecevski</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ermentrout</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Djurfeldt</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lansner</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rochel</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vieville</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Muller</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Davison</surname>
            ,
            <given-names>A.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>El Boustani</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Destexhe</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Simulation of networks of spiking neurons: A review of tools and strategies (</article-title>
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Gerstner</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kistler</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Spiking neuron models: Single neurons, populations, plasticity</article-title>
          . Cambridge University Press (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Hayman</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>The mcculloch-pitts model</article-title>
          .
          <source>IJCNN'99. International Joint Conference on Neural Networks. Proceedings (Cat. No.99CH36339) 6</source>
          (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Hebb</surname>
            ,
            <given-names>D.O.</given-names>
          </string-name>
          :
          <article-title>The Organization of Behaviour: A neuropsychological theory</article-title>
          .
          <source>Wiley</source>
          (
          <year>1949</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Hodgkin</surname>
            ,
            <given-names>A.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huxley</surname>
            ,
            <given-names>A.F.</given-names>
          </string-name>
          :
          <article-title>A quantitative description of membrane current and its application to conduction and excitation in nerve</article-title>
          .
          <source>Journal of Physiology</source>
          pp.
          <volume>500</volume>
          {
          <issue>544</issue>
          (
          <year>1952</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Indiveri</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Linares-Barranco</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hamilton</surname>
          </string-name>
          , T.J., van
          <string-name>
            <surname>Schaik</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>EtienneCummings</given-names>
            , R.,
            <surname>Delbruck</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.C.</given-names>
            ,
            <surname>Dudek</surname>
          </string-name>
          ,
          <string-name>
            <surname>P.</surname>
          </string-name>
          , Ha iger,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Renaud</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Schemmel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Cauwenberghs</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            ,
            <surname>Arthur</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Hynna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Folowosele</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            ,
            <surname>Saighi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Serrano-Gotarredona</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            ,
            <surname>Wijekoon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            ,
            <surname>Boahen</surname>
          </string-name>
          ,
          <string-name>
            <surname>K.</surname>
          </string-name>
          :
          <article-title>Neuromorphic silicon neuron circuits</article-title>
          .
          <source>Frontiers in neuroscience 5(May)</source>
          ,
          <volume>73</volume>
          (1
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Izhikevich</surname>
            ,
            <given-names>E.M.</given-names>
          </string-name>
          :
          <article-title>Simple model of spiking neurons</article-title>
          .
          <source>IEEE transactions on neural networks / a publication of the IEEE Neural Networks Council</source>
          <volume>14</volume>
          (
          <issue>6</issue>
          ),
          <volume>1569</volume>
          {
          <issue>72</issue>
          (1
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Izhikevich</surname>
            ,
            <given-names>E.M.</given-names>
          </string-name>
          :
          <article-title>Dynamical Systems in Neuroscience : The Geometry of Excitability and Bursting, Chapter 8</article-title>
          . The MIT Press (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kohonen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>The self-organizing map 21(May</article-title>
          ),
          <volume>1</volume>
          {
          <issue>6</issue>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Maass</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Networks of spiking neurons: The third generation of neural network models</article-title>
          .
          <source>Neural Networks</source>
          <volume>10</volume>
          (
          <issue>9</issue>
          ),
          <volume>1659</volume>
          {
          <fpage>1671</fpage>
          (
          <year>1997</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Nakano</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suda</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Self-organizing network services 16(5</article-title>
          ),
          <volume>1269</volume>
          {
          <fpage>1278</fpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Paugam-Moisy</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bohte</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Computing with spiking neuron networks</article-title>
          .
          <source>In: Handbook of Natural Computing</source>
          , pp.
          <volume>335</volume>
          {
          <issue>376</issue>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Seung</surname>
            ,
            <given-names>H.S.:</given-names>
          </string-name>
          <article-title>Learning in spiking neural networks by reinforcement of stochastic synaptic transmission</article-title>
          .
          <source>Neuron</source>
          <volume>40</volume>
          (
          <issue>6</issue>
          ),
          <volume>1063</volume>
          {
          <fpage>1073</fpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Suzuki</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suda</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>A middleware platform for a biologically inspired network architecture supporting autonomous 23(2</article-title>
          ),
          <volume>249</volume>
          {
          <fpage>260</fpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Taketani</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baudry</surname>
          </string-name>
          , M. (eds.):
          <article-title>Advances in Network Electrophysiology: Using Multi-electrode Arrays</article-title>
          . Springer (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>