Large-scale models of neuronal structures are needed to explore emergent properties of mammalian brains. Because these models have trillions of synapses, a major problem in their creation is synapse placement. Here we present a novel method for exploiting consistent fiber orientation in a neural tissue to perform a highly efficient modified plane-sweep algorithm, which identifies all regions of 3D overlaps between dendritic and axonal projection fields. The first step in placing synapses in physiological models is neurite-overlap detection, at large scales a computationally intensive task. We have developed an efficient “Staggered Walk” algorithm that can find all 3D overlaps of neurites where trillions of synapses connect billions of neurons. 1. Introduction Simulating brain structures with large-scale neuronal models lets researchers precisely manipulate features of simulated neural tissues and observe both local and global properties of neural systems. During the last decade, large-scale brain modeling has risen in prominence, with a wide range of publications on brain-scale models[1–3]. Most large-scale modeling research groups focus either on networks that are highly realistic down to the individual axon collaterals and dendrite branches of each neuron [4] or on systems simplified enough to simulate in near real-time on massively parallel hardware [1, 2]. Rather than emphasizing details or simulation speed, our group is more interested in a balanced approach that capitalizes on general structural connectivity and data acquired through multiunit electrode experiments, diffusion tensor imaging, and connectomics studies with stacked slices of brain tissues stained for scanning [4–6]. To develop and test our model-creation code, we have derived parameters for cerebellar models from the detailed connection and density data for the cerebellar cortex in the compendium by Eccles et al. [7]. Large-scale neuronal models range in accuracy from simple, randomly probabilistic networks [8, 9] to realistic neuronal mappings [4]. The level of detail we need for our models is roughly at the tissue level [10], where probabilities of connectivity between distinct volumes of neural tissue and specified neuronal groups can be derived well enough to create alternative models for comparison. The resulting parameters allow for the generation of microcircuitry for particular areas of the brain. The microcircuits can be repeated, with small changes, up to millions of times in some brain regions [10, 11]. A critical and complex part of large-scale neuronal modeling is the
References
[1]
R. Ananthanarayanan, S. K. Esser, H. D. Simon, and D. S. Modha, “The cat is out of the bag: Cortical simulations with 109 neurons, 1013 synapses,” in Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis (SC '09), November 2009.
[2]
E. M. Izhikevich and G. M. Edelman, “Large-scale model of mammalian thalamocortical systems,” Proceedings of the National Academy of Sciences of the United States of America, vol. 105, no. 9, pp. 3593–3598, 2008.
[3]
J. Kozloski and J. Wagner, “An ultrascalable solution to large-scale neural tissue simulation,” Frontiers in Neuroinformatics, vol. 5, article 15, 2011.
[4]
H. Markram, “The blue brain project,” Nature Reviews Neuroscience, vol. 7, no. 2, pp. 153–160, 2006.
[5]
G. A. Ascoli, D. E. Donohue, and M. Halavi, “NeuroMorpho.Org: a central resource for neuronal morphologies,” Journal of Neuroscience, vol. 27, no. 35, pp. 9247–9251, 2007.
[6]
J. W. Lichtman, J. Livet, and J. R. Sanes, “A technicolour approach to the connectome,” Nature Reviews, vol. 9, no. 6, pp. 417–422, 2008.
[7]
J. C. Eccles, M. Ito, and J. Szentagothai, The Cerebellum as a Neuronal Machine, Springer, 1967.
[8]
R. Ananthanarayanan and D. S. Modha, “Anatomy of a cortical simulator,” in Proceedings of the ACM/IEEE Conference on Supercomputing (SC '07), November 2007.
[9]
J. Iglesias, J. Eriksson, F. Grize, M. Tomassini, and A. E. P. Villa, “Dynamics of pruning in simulated large-scale spiking neural networks,” BioSystems, vol. 79, no. 1–3, pp. 11–20, 2005.
[10]
J. Kozloski, “Automated reconstruction of neural tissue and the role of large-scale simulation,” Neuroinformatics, vol. 9, no. 2-3, pp. 133–142, 2011.
[11]
G. M. Shepherd, “Introduction to synaptic circuits,” in The Synaptic Organization of the Brain, chapter 1, pp. 1–38, 2004.
[12]
C. Peck, J. Kozloski, A. R. Rao, and G. A. Cecchi, “Simulation infrastructure for modeling large scale neural systems,” in Proceedings of the International Conference on Computational Science (ICCS '03), p. 713, 2003.
[13]
J. Kozloski, K. Sfyrakis, S. Hill, F. Schürmann, C. Peck, and H. Markram, “Identifying, tabulating, and analyzing contacts between branched neuron morphologies,” IBM Journal of Research and Development, vol. 52, no. 1-2, pp. 43–56, 2008.
[14]
B. Stroustrup, C++, John Wiley and Sons, 2003.
[15]
G. Marsaglia, “Random numbers fall mainly in the planes,” Proceedings of the National Academy of Sciences of the United States of America, vol. 61, no. 1, pp. 25–28, 1968.
[16]
D. Shreiner, OpenGL Programming Guide: The Official Guide to Learning OpenGL, Versions 3.0 and 3.1, Addison-Wesley, 2009.
[17]
P. Gleeson, S. Crook, R. C. Cannon et al., “NeuroML: a language for describing data driven models of neurons and networks with a high degree of biological detail,” PLoS Computational Biology, vol. 6, no. 6, Article ID e1000815, 2010.
[18]
B. B. Andersen, L. Korbo, and B. Pakkenberg, “A quantitative study of the human cerebellum with unbiased stereological techniques,” Journal of Comparative Neurology, vol. 326, no. 4, pp. 549–560, 1992.
[19]
R. J. Harvey and R. M. A. Napper, “Quantitative study of granule and Purkinje cells in the cerebellar cortex of the rat,” Journal of Comparative Neurology, vol. 274, no. 2, pp. 151–157, 1988.
[20]
M. I. Shamos and D. Hoey, “Closest-point problems,” in Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science, 1975.
[21]
J. L. Bentley and T. A. Ottmann, “Algorithms for reporting and counting geometric intersections,” IEEE Transactions on Computers, vol. 28, no. 9, pp. 643–647, 1979.
[22]
D. D. Sleator and R. E. Tarjan, “Self-adjusting binary search trees,” Journal of the ACM, vol. 32, no. 3, pp. 652–686, 1985.
[23]
W. Pugh, “Skip lists. A probabilistic alternative to balanced trees,” Communications of the ACM, vol. 33, no. 6, pp. 668–676, 1990.