<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="https://www.nitrc.org/themes/nitrc3.0/css/rss.xsl.php?feed=https://www.nitrc.org/export/rss20_forum.php?forum_id=2830" ?>
<?xml-stylesheet type="text/css" href="https://www.nitrc.org/themes/nitrc3.0/css/rss.css" ?>
<rss version="2.0"> <channel>
  <title>NITRC News Group Forum: the-connection-set-algebra---a-novel-formalism-for-the-representation-of-connectivity-structure-in-neuronal-network-models</title>
  <link>http://www.nitrc.org/forum/forum.php?forum_id=2830</link>
  <description>&lt;p class=&quot;abstract&quot;&gt;&lt;div class=&quot;Abstract&quot; lang=&quot;en&quot;&gt;&lt;a name=&quot;Abs1&quot;&gt;&lt;/a&gt;&lt;span class=&quot;AbstractHeading&quot;&gt;Abstract&amp;nbsp;&amp;nbsp;&lt;/span&gt;&lt;div class=&quot;normal&quot;&gt;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, &lt;cite&gt;2008b&lt;/cite&gt;) and an implementation in Python has been publicly released.
 &lt;/div&gt;
 &lt;/div&gt;&lt;/p&gt;&lt;ul&gt;
	&lt;li&gt;&lt;span class=&quot;labelName&quot;&gt;Content Type &lt;/span&gt;&lt;span class=&quot;labelValue&quot;&gt;Journal Article&lt;/span&gt;&lt;/li&gt;&lt;li&gt;Category Original Article&lt;/li&gt;&lt;li&gt;Pages 1-18&lt;/li&gt;&lt;li&gt;DOI 10.1007/s12021-012-9146-1&lt;/li&gt;&lt;li&gt;&lt;span class=&quot;labelName&quot;&gt;Authors&lt;/span&gt;&lt;ul&gt;
		&lt;li&gt;Mikael Djurfeldt, School of Computer Science and Communication, KTH, 10044 Stockholm, Sweden&lt;/li&gt;
	&lt;/ul&gt;&lt;/li&gt;
&lt;/ul&gt;&lt;ul class=&quot;parents&quot;&gt;
	&lt;ul class=&quot;details&quot;&gt;
		&lt;li&gt;&lt;span class=&quot;header labelName&quot;&gt;Journal &lt;/span&gt;&lt;span class=&quot;labelValue&quot;&gt;&lt;a href=&quot;http://www.springerlink.com/content/120559/&quot;&gt;Neuroinformatics&lt;/a&gt;&lt;/span&gt;&lt;/li&gt;&lt;li&gt;&lt;span class=&quot;labelName&quot;&gt;Online ISSN &lt;/span&gt;&lt;span class=&quot;labelValue&quot;&gt;1559-0089&lt;/span&gt;&lt;/li&gt;&lt;li&gt;&lt;span class=&quot;labelName&quot;&gt;Print ISSN &lt;/span&gt;&lt;span class=&quot;labelValue&quot;&gt;1539-2791&lt;/span&gt;&lt;/li&gt;
	&lt;/ul&gt;
&lt;/ul&gt;</description>
  <language>en-us</language>
  <copyright>Copyright 2000-2026 NITRC OSI</copyright>
  <webMaster></webMaster>
  <lastBuildDate>Sun, 19 Apr 2026 19:07:32 GMT</lastBuildDate>
  <docs>http://blogs.law.harvard.edu/tech/rss</docs>
  <generator>NITRC RSS generator</generator>
 </channel>
</rss>
