Simulation of networks of spiking neurons: A review of tools and strategies

We review different aspects of the simulation of spiking neural networks. We start by reviewing the different types of simulation strategies and algorithms that are currently implemented. We next review the precision of those simulation strategies, in particular in cases where plasticity depends on the exact timing of the spikes. We overview different simulators and simulation environments presently available (restricted to those freely available, open source and documented). For each simulation tool, its advantages and pitfalls are reviewed, with an aim to allow the reader to identify which simulator is appropriate for a given task. Finally, we provide a series of benchmark simulations of different types of networks of spiking neurons, including Hodgkin-Huxley type, integrate-and-fire models, interacting with current-based or conductance-based synapses, using clock-driven or event-driven integration strategies. The same set of models are implemented on the different simulators, and the codes are made available. The ultimate goal of this review is to provide a resource to facilitate identifying the appropriate integration strategy and simulation tool to use for a given modeling problem related to spiking neural networks.Comment: 49 pages, 24 figures, 1 table; review article, Journal of Computational Neuroscience, in press (2007

Clustering Theory and Data Driven Health Care Strategies

DoD health care requires reform with growing costs causing concerns of decreased military capability. One proposed radical strategy to fix current health care delivery systems is to organize medical teams around patients with similar treatment requirements. This is a clustering problem; how do you partition the set of patients so that each group has similar treatment needs? We provide advances in clustering theory relevant to this new health care strategy. In particular, we create fast certifiably optimal k-means clustering using what is known as Probably Certifiably Correct (PCC) algorithms which achieves state-of-the-art performance under certain models. Inspired by the health care clustering problem, we pay particular attention to a Bipartite Stochastic Block Model and produce an alternative PCC algorithm specific to this model. We conclude by demonstrating the potential utility of applying these clustering methods in health care. Using conditional entropy as a metric, clusters obtained from our methods vastly outperform partitions prescribed by subject matter experts