Evidence map›Paper›PMID 22437992›Full record

ArticleNeuroinformatics2012

The connection-set algebra--a novel formalism for the representation of connectivity structure in neuronal network models.

Mikael Djurfeldt

Abstract read
PubMed Publisher
In one paragraph

Article in Neuroinformatics, 2012. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 15 papers.

0numbers the graph read from it
0cells of the map it votes in
15citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

15 citing papers in PubMed.

  1. Connectivity concepts in neuronal network modeling.PLoS computational biology · 2022
    Review
  2. Computational Concepts for Reconstructing and Simulating Brain Tissue.Advances in experimental medicine and biology · 2022
    Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Python in neuroscience.Frontiers in neuroinformatics · 2015
    Article
  10. Article
  11. Article
  12. Article
  13. Review
  14. Article
  15. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

1 author.

Mikael DjurfeldtSchool of Computer Science and Communication, KTH, 10044 Stockholm, Sweden. mikael@djurfeldt.com

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The connection-set algebra (CSA) is a novel and general formalism for the description of connectivity in neuronal network models, from small-scale to large-scale structure. The algebra provides operators to form more complex sets of connections from simpler ones and also provides parameterization of such sets. CSA is expressive enough to describe a wide range of connection patterns, including multiple types of random and/or geometrically dependent connectivity, and can serve as a concise notation for network structure in scientific writing. CSA implementations allow for scalable and efficient representation of connectivity in parallel neuronal network simulators and could even allow for avoiding explicit representation of connections in computer memory. The expressiveness of CSA makes prototyping of network structure easy. A C+ + version of the algebra has been implemented and used in a large-scale neuronal network simulation (Djurfeldt et al., IBM J Res Dev 52(1/2):31-42, 2008b) and an implementation in Python has been publicly released.

Indexed as

AlgorithmsModels, NeurologicalAnimalsComputer SimulationHumansNerve NetNeural Networks, ComputerNeural PathwaysNeuronsNonlinear DynamicsSynapses

Identifiers

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.