<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>CDA</title>
	<atom:link href="http://cda.ularity.com/?feed=rss2" rel="self" type="application/rss+xml" />
	<link>http://cda.ularity.com</link>
	<description>Computational Design and Adaptation</description>
	<lastBuildDate>Tue, 25 May 2010 02:35:41 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.3</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Paper summary: Interconnected musical networks: Toward a theoretical framework</title>
		<link>http://cda.ularity.com/?p=483</link>
		<comments>http://cda.ularity.com/?p=483#comments</comments>
		<pubDate>Tue, 25 May 2010 02:34:12 +0000</pubDate>
		<dc:creator>Peter Raffensperger</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://cda.ularity.com/?p=483</guid>
		<description><![CDATA[Weinberg, G. (2005). Interconnected musical networks: Toward a theoretical framework. Computer Music Journal, 29(2):23–39
Weinberg (2005) discusses musical networks, the concept of performance as an interdependent art form. Electronics expands the range of possible interdependencies in musical performance: ‘Although acoustic-interdependent models provide an infrastructure for a variety of approaches for interconnections and interdependencies among players, they [...]]]></description>
			<content:encoded><![CDATA[<p>Weinberg, G. (2005). Interconnected musical networks: Toward a theoretical framework. Computer Music Journal, 29(2):23–39</p>
<p>Weinberg (2005) discusses musical networks, the concept of performance as an interdependent art form. Electronics expands the range of possible interdependencies in musical performance: ‘Although acoustic-interdependent models provide an infrastructure for a variety of approaches for interconnections and interdependencies among players, they do not allow for actual manipulation and control of each other’s explicit musical voices. Only by constructing electronic (or mechanical) communication channels among players can participants take an active role in determining and influencing not only their own musical output but also that of their peers’ (Weinberg, 2005, p. 23).<br />
<span id="more-483"></span><br />
Viewing musical networks with an ecological metaphor, Weinberg says that ’the network serves as a habitat that supports its inhabitants (players) through a topology of interconnections and mutual responses that can, when successful, lead to new breeds of musical life forms’ (Weinberg, 2005, p. 23). Weinberg gives historical examples of musical networks: Cage’s 1951 piece Imaginary Landscape No. 4 for twelve radios (Cage, 1951), Bischoff et al. (1978)’s ‘Network Computer Music,’ a variety of internet-based musical networks (including Whalley (2004)), and local, real-time interactive musical projects that include novel player interfaces, such as the reacTable (Jorda, 2003).</p>
<p>Weinberg also classifies interactive musical networks by the nature of their interconnectedness, the centrality of their control and the placement of the participants actions in time (sequential or synchronous). ‘Process centered musical networks’ can be based on social experience, creative experience or learning experience; they can also be exploratory in their interaction or goal oriented, with either collaborative or competitive goals. ‘In sequential systems ... the interdependent interactions occur in an ordered manner by turn-taking procedures. This approach is more tolerant to latency, can be easily supported by remote online networks, and is usually simpler to follow for the individual player’ (Weinberg, 2005, p. 35, emphasis mine).</p>
<p>I am interested in musical networks made partially or entirely of machine controlled participants. If the network participants can control how they interact, or in Weinberg’s terms, they can control the weight of their connections, they may be able to dynamically change their network between synchronous and sequential. Naturally, many sets of connection weights will result in ‘anarchy,’ while only a few will result in ordered behaviour. How can the agents learn the necessary turn-taking behaviours for ordered interaction in a sequential system? How can centralised control emerge? Weinberg’s classification of ‘process centered musical networks’ is useful in considering different situations which may or may not have the possibility of having emergent turn-taking.</p>
<p>Peter</p>
<p>References:<br />
Bischoff, J., Gold, R., and Horton, J. (1978). Microcomputer network music. Computer Music Journal, 2(3):24–29.<br />
Cage, J. (1951). Imaginary landscape no. 4 (March no. 2). Musical composition for twelve radios, 24 performers and conductor.<br />
Jorda, S. (2003). Sonigraphical instruments: from FMOL to the reacTable. In Proceedings of the 2003 conference on New interfaces for musical expression, page 76.<br />
Weinberg, G. (2005). Interconnected musical networks: Toward a theoretical framework. Computer Music Journal, 29(2):23–39.<br />
Whalley, I. (2004). Adding machine cognition to Web-Based interactive composition. In Proceedings of the 2004 International Computer Music Conference, pages 196–200.</p>
]]></content:encoded>
			<wfw:commentRss>http://cda.ularity.com/?feed=rss2&amp;p=483</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Book Summary: &#8220;Musicophilia&#8221; by Oliver Sacks</title>
		<link>http://cda.ularity.com/?p=476</link>
		<comments>http://cda.ularity.com/?p=476#comments</comments>
		<pubDate>Tue, 18 May 2010 00:46:32 +0000</pubDate>
		<dc:creator>Peter Raffensperger</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[Music]]></category>
		<category><![CDATA[neurology]]></category>
		<category><![CDATA[psychology]]></category>

		<guid isPermaLink="false">http://cda.ularity.com/?p=476</guid>
		<description><![CDATA[Sacks, O. (2007). Musicophilia: Tales of Music and the Brain. Knopf.
Sacks explores the neurology of music and gives examples of patients who have various unusual responses to music. Told in a wonderful, person-focused, story-telling manner, Musicophilia expounds on music as the wonderful back door to our minds.  One man gained a sudden appreciation of [...]]]></description>
			<content:encoded><![CDATA[<p>Sacks, O. (2007). Musicophilia: Tales of Music and the Brain. Knopf.</p>
<p>Sacks explores the neurology of music and gives examples of patients who have various unusual responses to music. Told in a wonderful, person-focused, story-telling manner, Musicophilia expounds on music as the wonderful back door to our minds.  One man gained a sudden appreciation of piano music after being struck by lightning. Some people get seizures from music or hear music in their seizures. Most people experience getting music stuck in their head, but some have more intense musical hallucinations.<br />
<span id="more-476"></span><br />
Sacks considers musicality and how musicality is actually a number of related skills. Sacks describes various cases of amusia. Interestingly, he points out that ‘forms of rhythm deafness are rarely total, because rhythm is represented widely in the brain’ (p. 99). Sacks describes neurological aspects of absolute pitch, its prevalence and origins. The effect of losing hearing in one ear is considered for two patents’ cases. Sacks relates music to vision, describing the effect that blindness can have on people’s musical abilities and also several cases of music → vision synesthesia.</p>
<p>Sacks tells the story of Clive Wearing, a man with severe amnesia and complete loss of all but the most transient memory. Clive experiences every moment as if he just woke up, except that he still remembers his wife and he can still play music! Music must be remembered differently to other experiences. Sacks describes the interactions between speech and music and how some people can lose the ability to understand or produce speech, but still be able to sing songs with words. Some aphasic people can be taught to speak again with the help of singing. It seems to me that the brain has two complicated systems, one for language and thought, one for music and feeling.</p>
<p>Some people with Tourette syndrome can channel the explosive energy of their ticcing into rhythm. Sacks describes a drum circle of people with Tourette syndrome who tic out of time naturally, but come together in controlled musical expression when they play. Sacks talks about how music therapy can help people regain motion of their limbs. Sacks speculates about the biological importance of music:</p>
<blockquote><p>The embedding of words, skills or sequences in melody and meter is uniquely human. The usefulness of such ability to recall large amounts of information, especially in a preliterate culture, is surely one reason why musical abilities have flourished in our species. (p. 239)</p></blockquote>
<p>Speaking of the importance of rhythm particularly, Sacks says:</p>
<blockquote><p>What enables us, for example, to bind together the sight, sound, smell and emotions aroused by the sight of a jaguar? Such binding in the nervous system is accomplished by rapid, synchronized firing of nerve cells in different parts of the brain. Just as rapid neuronal oscillations bind together different functional parts within the brain and nervous system, so rhythm binds together the individual nervous systems of a human community. (p. 247)
</p></blockquote>
<p>People with parkinsonism struggle to initiate motion and to move in natural time and rhythm, but music and music therapy can sometimes help them to move more naturally. ‘It is music that the parkinsonian needs, for only music, which is rigorous yet spacious, sinuous and alive, can evoke responses that are equally so.’ (p. 258)</p>
<p>Music appears to some people in dreams, frequently in more detail than their waking musical imaginations can afford. On a personal note, I have had dreams with detailed music similar to what Sacks describes. Some people can understand musical structure but do not emotionally appreciate music, while others connect with music emotionally while having amusia otherwise. With regard to the power of music to connect in moments of grief, Sacks says:</p>
<blockquote><p>Music, uniquely among the arts, is both completely abstract and profoundly emotional. It has no power to represent anything particular or external, but it has as unique power to express inner states or feelings. Music can pierce the heart directly; it needs no mediation. (p. 300)</p></blockquote>
<p>Sacks describes a man who lost all ability to feel emotion in an accident who can sing with apparent emotion, and another man with autism who wrote ‘AUTISM DISAPPEARS’ in Sacks’ notebook while he was singing. Some people with frontotemporal dementia display increased musical or other artistic behaviours. People with Williams syndrome are frequently moved strongly by music and can be articulate and musically talented while being disabled in other ways. Music can cheer up people with dementia, affecting patients’ moods even after the music has stopped.</p>
<p>Peter</p>
]]></content:encoded>
			<wfw:commentRss>http://cda.ularity.com/?feed=rss2&amp;p=476</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>ChucK: mind-bending programming language of the day</title>
		<link>http://cda.ularity.com/?p=473</link>
		<comments>http://cda.ularity.com/?p=473#comments</comments>
		<pubDate>Fri, 09 Apr 2010 04:51:08 +0000</pubDate>
		<dc:creator>Peter Raffensperger</dc:creator>
				<category><![CDATA[Concurrency]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cda.ularity.com/?p=473</guid>
		<description><![CDATA[I've recently started teaching myself a new programming language: ChucK. You can read a paper by the authors that gives a quick outline of some of the salient features of the language:
Wang, G., Cook, P. R. (2003). ChucK: a concurrent, on-the-fly audio programming language. In Proceedings of International Computer Music Conference, pages 219–226

I'm a bit [...]]]></description>
			<content:encoded><![CDATA[<p>I've recently started teaching myself a new programming language: <a href="http://chuck.cs.princeton.edu/">ChucK</a>. You can read a paper by the authors that gives a quick outline of some of the salient features of the language:<br />
Wang, G., Cook, P. R. (2003). ChucK: a concurrent, on-the-fly audio programming language. In Proceedings of International Computer Music Conference, pages 219–226<br />
<span id="more-473"></span><br />
I'm a bit of a stranger to concurrent programming, I'm just starting to get my feet wet really. The interesting thing about ChucK is that it is strongly <em>timed</em>. You can control time directly by manipulating a global now variable:<br />
1::second =&gt; now; //Advances time by 1 second.</p>
<p>You can connect up audio signals using the ChucK operator, =&gt;, then when time advances, you get sound. For example, this program will play a sine wave for 10 seconds:<br />
SinOsc =&gt; dac;<br />
10::second =&gt; now;</p>
<p>So in some ways, ChucK resembles VHDL you are building up a set of connections and rules for those connections. Also similar to VHDL, you can adjust time.</p>
<p>The really mind-bending part comes with the concurrency though. You can run multiple 'shreds' at once, where time is independently controlled in each shred. ChucK schedules all the times right down to the sample so that they all happen at the times you specify.</p>
<p>I'm a bit disappointed to see some of the bread-and-butter programming language features are still in development: there are no asserts, you have to use a command line option to import/#include a file.</p>
<p>But it's fun!</p>
<p>Peter</p>
]]></content:encoded>
			<wfw:commentRss>http://cda.ularity.com/?feed=rss2&amp;p=473</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Robotic drumming with machine learning back end</title>
		<link>http://cda.ularity.com/?p=471</link>
		<comments>http://cda.ularity.com/?p=471#comments</comments>
		<pubDate>Wed, 10 Mar 2010 00:39:32 +0000</pubDate>
		<dc:creator>Peter Raffensperger</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://cda.ularity.com/?p=471</guid>
		<description><![CDATA[This video is what I'd like to build: Jazari drumming robots controlled by Wiimotes and machine learning.
Of course, I'm in the business of building better and more algorithms for music and other purposes, but this is the kind of hardware platform that I'd be keen to demo algorithms on.
You can read more on the artist's [...]]]></description>
			<content:encoded><![CDATA[<p>This video is what I'd like to build: <a href='http://www.youtube.com/watch?v=0b-tWK6AeLY&amp;feature=player_embedded'>Jazari drumming robots controlled by Wiimotes and machine learning.</a></p>
<p>Of course, I'm in the business of building better and more algorithms for music and other purposes, but this is the kind of hardware platform that I'd be keen to demo algorithms on.</p>
<p>You can read more on the <a href="http://jazarimusic.com/">artist's website.</a></p>
<p>Peter</p>
]]></content:encoded>
			<wfw:commentRss>http://cda.ularity.com/?feed=rss2&amp;p=471</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>TED talk on evolving robots</title>
		<link>http://cda.ularity.com/?p=468</link>
		<comments>http://cda.ularity.com/?p=468#comments</comments>
		<pubDate>Fri, 29 Jan 2010 04:45:36 +0000</pubDate>
		<dc:creator>Peter Raffensperger</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://cda.ularity.com/?p=468</guid>
		<description><![CDATA[Today I found this TED talk on evolving robots by Hod Lipson at Cornell.
Towards the end of the talk he makes the interesting point that in absence of a particular reward, a heterogeneous population of simulated robots ends up favouring those kinds of robots that can self-replicate.
Peter
]]></description>
			<content:encoded><![CDATA[<p>Today I found this <a href="http://www.ted.com/talks/hod_lipson_builds_self_aware_robots.html">TED talk on evolving robots</a> by <a href="http://www.mae.cornell.edu/Lipson/">Hod Lipson at Cornell</a>.</p>
<p>Towards the end of the talk he makes the interesting point that in absence of a particular reward, a heterogeneous population of simulated robots ends up favouring those kinds of robots that can self-replicate.</p>
<p>Peter</p>
]]></content:encoded>
			<wfw:commentRss>http://cda.ularity.com/?feed=rss2&amp;p=468</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The Unreasonable Effectiveness of Mathematics</title>
		<link>http://cda.ularity.com/?p=464</link>
		<comments>http://cda.ularity.com/?p=464#comments</comments>
		<pubDate>Mon, 11 Jan 2010 22:46:50 +0000</pubDate>
		<dc:creator>Peter Raffensperger</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://cda.ularity.com/?p=464</guid>
		<description><![CDATA[Today I came across and insightful discussion on a dark-ish corner of the philosophy of science: why does math describe the universe so well?
The Unreasonable Effectiveness of Mathematics by Richard. W. Hamming (of Hamming distance and Hamming window fame). Originally this article appeared in The American Mathematical Monthly Volume 87 Number 2 February 1980.
It's a [...]]]></description>
			<content:encoded><![CDATA[<p>Today I came across and insightful discussion on a dark-ish corner of the philosophy of science: why does math describe the universe so well?</p>
<p><a href="http://www.dartmouth.edu/~matc/MathDrama/reading/Hamming.html">The Unreasonable Effectiveness of Mathematics</a> by Richard. W. Hamming (of Hamming distance and Hamming window fame). Originally this article appeared in The American Mathematical Monthly Volume 87 Number 2 February 1980.</p>
<p>It's a bit of a long read, but here are some highlights:<br />
<span id="more-464"></span></p>
<blockquote><p>Just as there are odors that dogs can smell and we cannot, as well as<br />
sounds that dogs can hear and we cannot, so too there are wavelengths<br />
of light we cannot see and flavors we cannot taste. Why then, given<br />
our brains wired the way they are, does the remark "Perhaps there are<br />
thoughts we cannot think," surprise you? Evolution, so far, may<br />
possibly have blocked us from being able to think in some directions;<br />
there could be unthinkable thoughts.</p></blockquote>
<blockquote><p>Having given four widely different examples of nontrivial situations<br />
where it turns out that the original phenomenon arises from the<br />
mathematical tools we use and not from the real world, I am ready to<br />
strongly suggest that a lot of what we see comes from the glasses we<br />
put on.</p></blockquote>
<blockquote><p>Mathematics has been made by man and therefore is apt to be altered<br />
rather continuously by him. Perhaps the original sources of<br />
mathematics were forced on us, but as in the example I have used we<br />
see that in the development of so simple a concept as number we have<br />
made choices for the extensions that were only partly controlled by<br />
necessity and often, it seems to me, more by aesthetics. We have tried<br />
to make mathematics a consistent, beautiful thing, and by so doing we<br />
have had an amazing number of successful applications to the real<br />
world.
</p></blockquote>
<blockquote><p>Science in fact answers comparatively few problems. We have the<br />
illusion that science has answers to most of our questions, but this<br />
is not so. From the earliest of times man must have pondered over what<br />
Truth, Beauty, and Justice are. But so far as I can see science has<br />
contributed nothing to the answers, nor does it seem to me that<br />
science will do much in the near future. So long as we use a<br />
mathematics in which the whole is the sum of the parts we are not<br />
likely to have mathematics as a major tool in examining these famous<br />
three questions. </p></blockquote>
<p>It makes me feel slightly less of a complete nutcase for holding some less-than-conventional ideas on the philosophy of science and mathematics. On the other hand, maybe Richard Hamming was a nutcase too.</p>
<p>Peter</p>
]]></content:encoded>
			<wfw:commentRss>http://cda.ularity.com/?feed=rss2&amp;p=464</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Can I Get Rid of This Parameter? (Statistical tests)</title>
		<link>http://cda.ularity.com/?p=458</link>
		<comments>http://cda.ularity.com/?p=458#comments</comments>
		<pubDate>Fri, 08 Jan 2010 04:43:00 +0000</pubDate>
		<dc:creator>Peter Raffensperger</dc:creator>
				<category><![CDATA[Machine Learning]]></category>
		<category><![CDATA[Programming]]></category>

		<guid isPermaLink="false">http://cda.ularity.com/?p=458</guid>
		<description><![CDATA[I'm working on a simulation that has a bunch of parameters. It's getting a bit complicated, so I'm on a witch-hunt for unimportant parameters. The suspect in question is 'channel length.' The channel length can take any non-negative integer value. The ultimate output of the simulation is a random variable, called the 'turn taking.' (More [...]]]></description>
			<content:encoded><![CDATA[<p>I'm working on a simulation that has a bunch of parameters. It's getting a bit complicated, so I'm on a witch-hunt for unimportant parameters. The suspect in question is 'channel length.' The channel length can take any non-negative integer value. The ultimate output of the simulation is a random variable, called the 'turn taking.' (More on the details of turn taking coming soon to a journal near you.)</p>
<p>So the question is: does the channel length affect the turn taking?<span id="more-458"></span></p>
<p>If you're totally up to scratch on statistical tests, then you probably won't learn much from this post. It's actually mostly a reminder to my future self for when I need to remember how to do this same thing agin.</p>
<p>The first statistical test that I employed was drawing a graph:<br />
<a href="http://cda.ularity.com/wp-content/uploads/2010/01/turntaking_vs_channellength.png"><img src="http://cda.ularity.com/wp-content/uploads/2010/01/turntaking_vs_channellength-300x176.png" alt="Channel Length vs Turn Taking " width="300" height="176" class="alignnone size-medium wp-image-459" /></a></p>
<p>For that it looks kinda like maybe turn taking is not related to the channel length. But even averaging 30 independent runs for each channel length has left me with means that are still slightly different. How worried about those small differences should I be?</p>
<p>There are two different analytical statistical tests that I could use: the <a href="http://en.wikipedia.org/wiki/Mann–Whitney_U">Mann-Whitney U test</a>, or <a href="http://en.wikipedia.org/wiki/Student's_t-test">Student's t-test</a>. Student's t-test assumes the data are normally distributed, which is usually not exactly the case. But for large sample sizes, a t-test is robust to small-ish deviations from a normal distribution.</p>
<p>The Mann-Whitney U test has the advantage of not assuming a normal distribution, but it the downside that it assumes the variances in the two groups are approximately equal. For some varieties of the t-test, the same assumption is made. The Mann-Whitney U test also has the significant pragmatic downside in that it's less common, and so it's less likely that people will be able to follow your paper if you use it. </p>
<p>With a t-test, you start with the null hypothesis that two distributions are the same. Then you calculate a t statistic value and a number of degrees of freedom using the <a href="http://en.wikipedia.org/wiki/Student%27s_t-test#Equal_sample_sizes.2C_equal_variance">equations from Wikipedia</a>. I fooled around with the different possible assumption sets, but I settled on assuming that my equally sized samples had equal variance, mostly because Python's scipy.stats.ttest_ind() function made those assumptions. </p>
<p>Once you have a t value and n degrees of freedom, you calculate a one-sided p-value. A one-sided p-value is taken by integrating the t distribution probability density (with n degrees of freedom) from the t value you calculated until infinity. You can do this in Python with scipy.stats.t.sf(t, degrees_of_freedom). If you want a two-sided p-value, multiply the one-sided p-value by two. You'd use a one-sided p-value if you wanted to know if one of the distributions had a greater mean than the other, but use a two-sided p-value if you just want to know if they're different. scipy.stats.ttest_ind() will actually calculate a two-sided p-value for your along with a t-value.</p>
<p>I computed the t-test two-sided p-values comparing the sample with a channel length of 1 to the other 7 channel lengths in the graph:<br />
1 vs 2: 0.07<br />
1 vs 3: 0.11<br />
1 vs 4: 0.15<br />
1 vs 5: 0.13<br />
1 vs 6: 0.17<br />
1 vs 7: 0.18<br />
1 vs 8: 0.01</p>
<p>The <a href="http://en.wikipedia.org/wiki/P-value">p-values</a> are the chance that you would get values at least as different as you did <em>if you assume the null hypothesis is true</em>. So it's reasonably likely that the data for a channel length of 1 come from a different distribution than the data for a channel length of 8. But there is a 1% chance that they do both have the same mean.</p>
<p>In this case, even if the channel length makes a little difference, I'm going to get rid of it. But maybe not in another case.</p>
<p>Peter</p>
]]></content:encoded>
			<wfw:commentRss>http://cda.ularity.com/?feed=rss2&amp;p=458</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Liquid State Machine Papers</title>
		<link>http://cda.ularity.com/?p=452</link>
		<comments>http://cda.ularity.com/?p=452#comments</comments>
		<pubDate>Wed, 23 Dec 2009 02:43:35 +0000</pubDate>
		<dc:creator>rwebb</dc:creator>
				<category><![CDATA[Machine Learning]]></category>

		<guid isPermaLink="false">http://cda.ularity.com/?p=452</guid>
		<description><![CDATA[I've done a bit with echo state networks (ESNs) and mostly neglected the more neuroscience motivated liquid state machine (LSM) research.  However, there is some great work going on led by W. Maass.  Here are two stand-out publications:
Distributed Fading Memory for Stimulus Properties in the Primary Visual Cortex - actual data from cat [...]]]></description>
			<content:encoded><![CDATA[<p>I've done a bit with echo state networks (ESNs) and mostly neglected the more neuroscience motivated liquid state machine (LSM) research.  However, there is some great work going on led by W. Maass.  Here are two stand-out publications:</p>
<p><a href="http://www.igi.tugraz.at/maass/psfiles/200.pdf">Distributed Fading Memory for Stimulus Properties in the Primary Visual Cortex</a> - actual data from cat neocortex showing reservoir computing sort of responses.</p>
<p><a href="http://www.igi.tugraz.at/maass/psfiles/186.pdf">State-dependent computations: spatiotemporal processing in cortical networks</a> - fascinating review of a large body of research including nice discussions of high-dimensional trajectories.</p>
]]></content:encoded>
			<wfw:commentRss>http://cda.ularity.com/?feed=rss2&amp;p=452</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Focused Papers</title>
		<link>http://cda.ularity.com/?p=450</link>
		<comments>http://cda.ularity.com/?p=450#comments</comments>
		<pubDate>Wed, 23 Dec 2009 02:38:07 +0000</pubDate>
		<dc:creator>rwebb</dc:creator>
				<category><![CDATA[Academic]]></category>
		<category><![CDATA[Machine Learning]]></category>

		<guid isPermaLink="false">http://cda.ularity.com/?p=450</guid>
		<description><![CDATA[The goal of most research papers is to focus on a particular objective or hypothesis (survey papers being the major, valid exception), but most papers have lots of extraneous details coming from the exact system and configuration under study.  
After discussing the goal of boiling down a problem to its minimal required complexity with [...]]]></description>
			<content:encoded><![CDATA[<p>The goal of most research papers is to focus on a particular objective or hypothesis (survey papers being the major, valid exception), but most papers have lots of extraneous details coming from the exact system and configuration under study.  </p>
<p>After discussing the goal of boiling down a problem to its minimal required complexity with Phil Bones and Allan McInnes, I was reminded of the following paper comparing selection mechanism in GA.  The point of the paper contains some survey-like discussion, but I admire the simplicity of the system they study.  The system choice makes the selection behavior easy to illustrate without extra complexity.</p>
<p><a href="http://eprints.kfupm.edu.sa/18115/1/18115.pdf">A Game-Theoretic Investigation of Selection Methods Used in Evolutionary Algorithms</a> -- Ficici, Melnik, and Pollack</p>
]]></content:encoded>
			<wfw:commentRss>http://cda.ularity.com/?feed=rss2&amp;p=450</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Robotic Kite Flying</title>
		<link>http://cda.ularity.com/?p=446</link>
		<comments>http://cda.ularity.com/?p=446#comments</comments>
		<pubDate>Sun, 13 Dec 2009 23:18:13 +0000</pubDate>
		<dc:creator>Peter Raffensperger</dc:creator>
				<category><![CDATA[Hardware]]></category>
		<category><![CDATA[Project Ideas]]></category>

		<guid isPermaLink="false">http://cda.ularity.com/?p=446</guid>
		<description><![CDATA[I saw this post in the IEEE Spectrum blog about a robotic kite flying. The group that did it, Festo, has done some other cool project like flying robot penguins.
I guess it's always more impressive to demonstrate learning algorithms on big expensive hardware. But having big hardware is not essential for having great algorithms. I'm [...]]]></description>
			<content:encoded><![CDATA[<p>I saw this <a href="http://spectrum.ieee.org/blog/robotics/robotics-software/automaton/festos-cyberkite">post in the IEEE Spectrum blog about a robotic kite flying</a>. The group that did it, <a href="http://www.festo.com/cms/en-us_us/4981.htm">Festo</a>, has done some other cool project like flying robot penguins.</p>
<p>I guess it's always more impressive to demonstrate learning algorithms on big expensive hardware. But having big hardware is not essential for having great algorithms. I'm sure there are ways to demonstrate great algorithms using relatively primitive hardware.</p>
<p>Peter</p>
]]></content:encoded>
			<wfw:commentRss>http://cda.ularity.com/?feed=rss2&amp;p=446</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
