Skip Nav Destination
Close Modal
Update search
NARROW
Format
Journal
TocHeadingTitle
Date
Availability
1-2 of 2
Pablo Varona
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Journal Articles
Publisher: Journals Gateway
Neural Computation (2009) 21 (4): 973–990.
Published: 01 April 2009
FIGURES
| View All (6)
Abstract
View articletitled, Determining Burst Firing Time Distributions from Multiple Spike Trains
View
PDF
for article titled, Determining Burst Firing Time Distributions from Multiple Spike Trains
Recent experimental findings have shown the presence of robust and cell-type-specific intraburst firing patterns in bursting neurons. We address the problem of characterizing these patterns under the assumption that the bursts exhibit well-defined firing time distributions. We propose a method for estimating these distributions based on a burst alignment algorithm that minimizes the overlap among the firing time distributions of the different spikes within the burst. This method provides a good approximation to the burst's intrinsic temporal structure as a set of firing time distributions. In addition, the method allows labeling the spikes in any particular burst, establishing a correspondence between each spike and the distribution that best explains it, and identifying missing spikes. Our results on both simulated and experimental data from the lobster stomatogastric ganglion show that the proposed method provides a reliable characterization of the intraburst firing patterns and avoids the errors derived from missing spikes. This method can also be applied to nonbursting neurons as a general tool for the study and the interpretation of firing time distributions as part of a temporal neural code.
Journal Articles
Connection Topology Selection in Central Pattern Generators by Maximizing the Gain of Information
UnavailablePublisher: Journals Gateway
Neural Computation (2007) 19 (4): 974–993.
Published: 01 April 2007
Abstract
View articletitled, Connection Topology Selection in Central Pattern Generators by Maximizing the Gain of Information
View
PDF
for article titled, Connection Topology Selection in Central Pattern Generators by Maximizing the Gain of Information
A study of a general central pattern generator (CPG) is carried out by means of a measure of the gain of information between the number of available topology configurations and the output rhythmic activity. The neurons of the CPG are chaotic Hindmarsh-Rose models that cooperate dynamically to generate either chaotic or regular spatiotemporal patterns. These model neurons are implemented by computer simulations and electronic circuits. Out of a random pool of input configurations, a small subset of them maximizes the gain of information. Two important characteristics of this subset are emphasized: (1) the most regular output activities are chosen, and (2) none of the selected input configurations are networks with open topology. These two principles are observed in living CPGs as well as in model CPGs that are the most efficient in controlling mechanical tasks, and they are evidence that the information-theoretical analysis can be an invaluable tool in searching for general properties of CPGs.