<?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>Jeff Cameron&#039;s Blog</title>
	<atom:link href="http://jpcameron.com/blog/?feed=rss2" rel="self" type="application/rss+xml" />
	<link>http://jpcameron.com/blog</link>
	<description>Where I post my thoughts</description>
	<lastBuildDate>Sun, 05 Sep 2010 23:48:54 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>The Most Popular Programming Languages</title>
		<link>http://jpcameron.com/blog/?p=128</link>
		<comments>http://jpcameron.com/blog/?p=128#comments</comments>
		<pubDate>Sun, 05 Sep 2010 23:48:54 +0000</pubDate>
		<dc:creator>jeff</dc:creator>
				<category><![CDATA[Google AI Challenge]]></category>
		<category><![CDATA[ai challenge]]></category>
		<category><![CDATA[galcon]]></category>
		<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://jpcameron.com/blog/?p=128</guid>
		<description><![CDATA[The most recent Google AI Challenge had the contestants writing a bot that could play the game of Tron. Participants could periodically submit their latest code to watch it play against bots created by other people from around the world. After all was said and done, we received almost 20,000 submissions from over 1000 people, [...]]]></description>
			<content:encoded><![CDATA[<p>The most recent <a href="http://ai-contest.com">Google AI Challenge</a> had the contestants writing a bot that could play the game of Tron. Participants could periodically submit their latest code to watch it play against bots created by other people from around the world. After all was said and done, we received almost 20,000 submissions from over 1000 people, written in 14 different programming languages.</p>
<p>Lately, a few people have asked me which programming languages ended up being the most popular. Here is the breakdown.</p>
<p style="text-align: center;"><img title="Submissions by Programming Language" src="https://spreadsheets.google.com/oimg?key=0ApZJtw-P0P2pdE5TM1YzMzNPU3A0Qm8taWVtc2VzbWc&amp;oid=1&amp;zx=r3mp8e-txertv" alt="A pie chart of the most popular programming languages" width="450" height="320" /></p>
<p style="text-align: left;">These statistics have been really helpful in planning the upcoming Google AI Challenge, which is based on the game of <a href="www.galcon.com">Galcon</a>. As of right now, we have support for the four most popular programming languages: C++, Java, Python, and C#. We are working on adding support for the next four most popular languages: Haskell, Ruby, Common Lisp, and Perl.</p>
<div>If you would like to help out by translating one of the starter packages into your favorite language, then shoot me an email or post on the <a href="http://ai-contest.com/forums">contest forums</a>. You will be a hero to many.</div>
]]></content:encoded>
			<wfw:commentRss>http://jpcameron.com/blog/?feed=rss2&amp;p=128</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Emacs or vi?</title>
		<link>http://jpcameron.com/blog/?p=123</link>
		<comments>http://jpcameron.com/blog/?p=123#comments</comments>
		<pubDate>Fri, 07 May 2010 02:26:01 +0000</pubDate>
		<dc:creator>jeff</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[editor]]></category>
		<category><![CDATA[emacs]]></category>
		<category><![CDATA[poll]]></category>
		<category><![CDATA[vi]]></category>

		<guid isPermaLink="false">http://jpcameron.com/blog/?p=123</guid>
		<description><![CDATA[Text editors are a topic of much contention amonst programmers. Sometimes it can get pretty emotional. I&#8217;ve heard that debates over the merits of competing text editors have at times come to blows.
Today I decided to resolve this age-old question once and for all. Which is better: emacs or vi? I sent a simple poll [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://en.wikipedia.org/wiki/Text_editor">Text editors</a> are a topic of much contention amonst programmers. Sometimes it can get pretty emotional. I&#8217;ve heard that debates over the merits of competing text editors have at times come to blows.</p>
<p>Today I decided to resolve this age-old question once and for all. Which is better: emacs or vi? I sent <a href="https://spreadsheets.google.com/viewform?formkey=dGVFTDEtMFJrQU8zNHJzanV0Ml9QUnc6MQ">a simple poll</a> out on Reddit, and received 279 responses. Below I have summarized the results in chart form.</p>
<p><a href="http://jpcameron.com/blog/wp-content/uploads/2010/05/text_editor_preference.png"><img class="aligncenter size-full wp-image-124" title="text_editor_preference" src="http://jpcameron.com/blog/wp-content/uploads/2010/05/text_editor_preference.png" alt="" width="450" height="320" /></a>Vi users outvoted emacs users two-to-one. Sorry emacs, but charts don&#8217;t lie. Looks like vi is the superior text editor. <img src='http://jpcameron.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
			<wfw:commentRss>http://jpcameron.com/blog/?feed=rss2&amp;p=123</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The Next AI Challenge</title>
		<link>http://jpcameron.com/blog/?p=120</link>
		<comments>http://jpcameron.com/blog/?p=120#comments</comments>
		<pubDate>Thu, 29 Apr 2010 05:08:20 +0000</pubDate>
		<dc:creator>jeff</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[artificial intelligence]]></category>
		<category><![CDATA[contest]]></category>
		<category><![CDATA[poll]]></category>

		<guid isPermaLink="false">http://jpcameron.com/blog/?p=120</guid>
		<description><![CDATA[In the last day or so, I have started seriously working on the next AI Challenge, which I hope to launch in early May. The first step is to choose a game to use for the contest. This morning I came up with a short list of decent two-player strategy games, and created a Google [...]]]></description>
			<content:encoded><![CDATA[<p>In the last day or so, I have started seriously working on the next AI Challenge, which I hope to launch in early May. The first step is to choose a game to use for the contest. This morning I came up with a short list of decent two-player strategy games, and created a Google Form to allow people to vote for their favorites. After posting the form on Reddit, I managed to get almost 600 votes in a fairly short period of time. Here are the results.</p>
<p><a href="http://jpcameron.com/blog/wp-content/uploads/2010/04/game_poll_results.png"><img class="aligncenter size-full wp-image-121" title="game_poll_results" src="http://jpcameron.com/blog/wp-content/uploads/2010/04/game_poll_results.png" alt="" width="450" height="320" /></a></p>
<p><a href="http://jpcameron.com/blog/wp-content/uploads/2010/04/game_poll_results.png"></a>Clearly, Chess is a terrible idea. Aside from that, all the other games are completely tied. Go seems to be slightly ahead, but that could just be a fluke. Overall, these results don&#8217;t seem to be very helpful. How should I decide which game to pick?</p>
]]></content:encoded>
			<wfw:commentRss>http://jpcameron.com/blog/?feed=rss2&amp;p=120</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The Statistics of Sex Tapes</title>
		<link>http://jpcameron.com/blog/?p=110</link>
		<comments>http://jpcameron.com/blog/?p=110#comments</comments>
		<pubDate>Tue, 27 Apr 2010 03:46:18 +0000</pubDate>
		<dc:creator>jeff</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[porn]]></category>
		<category><![CDATA[sex tape]]></category>
		<category><![CDATA[statistics]]></category>

		<guid isPermaLink="false">http://jpcameron.com/blog/?p=110</guid>
		<description><![CDATA[How long would it take to watch all the porn in the world? Is it even possible? This is what my friends and I were wondering the other day at the pub. Being a bunch of math students, we whipped out a pocket calculator to find out. Here&#8217;s what we came up with.
To produce a [...]]]></description>
			<content:encoded><![CDATA[<p>How long would it take to watch all the porn in the world? Is it even possible? This is what my friends and I were wondering the other day at the pub. Being a bunch of math students, we whipped out a pocket calculator to find out. Here&#8217;s what we came up with.</p>
<p>To produce a really conservative estimate, let&#8217;s restrict ourselves only to amateur sex tapes produced by couples in the United States. How many are there? How long would it take to watch them all if it was your full-time job? There are currently 307 million people in the United States. Suppose that two-thirds of people will at some point be part of a couple. That&#8217;s 102 million couples. Suppose that only 5% of these couples will ever produce a sex tape. That&#8217;s 5 million sex tapes produced by people who are currently living in the US. Given that the average life expectancy is 78 years, we can err on the safe side by assuming that about 1.3% of those sex tapes will be made this year. Add that all up, and we can safely assume that 65,598 sex tapes will be made in the US this year.</p>
<p>By taking a straw poll, we guessed that the average sex tape would be 10 minutes long after editing, but let&#8217;s call it 5 just to be sure. Therefore 327,991 minutes of sex tape will be produced this year. If you unrolled that much VHS tape, it would stretch between Toronto and Montreal. If you put all that porn onto DVDs, it would make a stack 13 stories high. So, is it feasible to watch that much porn?</p>
<p style="text-align: center;"><a href="http://jpcameron.com/blog/wp-content/uploads/2010/04/vhs.jpg"><img class="size-medium wp-image-115 aligncenter" title="vhs" src="http://jpcameron.com/blog/wp-content/uploads/2010/04/vhs-191x300.jpg" alt="" width="191" height="300" /></a></p>
<p>If watching porn was your full-time job (40 hours per week, all year round, no holidays), you would only be able to watch 38% of the amateur sex tapes made this year in the United States alone. The more you watch, the further behind you fall. I conclude based on this analysis that it is absolutely impossible to watch all the porn in the world.</p>
]]></content:encoded>
			<wfw:commentRss>http://jpcameron.com/blog/?feed=rss2&amp;p=110</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>A Very Special Prime Number</title>
		<link>http://jpcameron.com/blog/?p=106</link>
		<comments>http://jpcameron.com/blog/?p=106#comments</comments>
		<pubDate>Sat, 10 Apr 2010 01:42:26 +0000</pubDate>
		<dc:creator>jeff</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[math]]></category>
		<category><![CDATA[miller-rabin]]></category>
		<category><![CDATA[prime]]></category>
		<category><![CDATA[suffix]]></category>

		<guid isPermaLink="false">http://jpcameron.com/blog/?p=106</guid>
		<description><![CDATA[357686312646216567629137 is a very special prime number. Why is it so special, you ask? Because all of its suffixes are also prime numbers.
Isn&#8217;t that cool? 7, 37, 137, 9137, and so on are all prime numbers!
I call these sorts of prime numbers suffix primes. Their existence was pointed out to me by a friend in [...]]]></description>
			<content:encoded><![CDATA[<p>357686312646216567629137 is a very special prime number. Why is it so special, you ask? Because all of its suffixes are also prime numbers.</p>
<p>Isn&#8217;t that cool? 7, 37, 137, 9137, and so on are all prime numbers!</p>
<p>I call these sorts of prime numbers <em>suffix primes</em>. Their existence was pointed out to me by a friend in a Facebook comment. There are exactly 4260 suffix primes that do not contain zeros, and the above number is the largest. But what if we count the suffix primes that do contain zeros? How many are there? Are there perhaps infinitely many? What about prefix primes?</p>
]]></content:encoded>
			<wfw:commentRss>http://jpcameron.com/blog/?feed=rss2&amp;p=106</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Tron Games</title>
		<link>http://jpcameron.com/blog/?p=96</link>
		<comments>http://jpcameron.com/blog/?p=96#comments</comments>
		<pubDate>Mon, 01 Mar 2010 20:48:07 +0000</pubDate>
		<dc:creator>jeff</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[ai challenge]]></category>
		<category><![CDATA[games]]></category>
		<category><![CDATA[rankings]]></category>
		<category><![CDATA[tron]]></category>

		<guid isPermaLink="false">http://jpcameron.com/blog/?p=96</guid>
		<description><![CDATA[I just finished running a large programming contest called the Google AI Challenge. By popular request, I am posting a complete log of all the games that were played in order to determine the final rankings.
The complete record can be found here: www.jpcameron.com/tron/tron-games.zip.
]]></description>
			<content:encoded><![CDATA[<p>I just finished running a large programming contest called the Google AI Challenge. By popular request, I am posting a complete log of all the games that were played in order to determine the final rankings.</p>
<p>The complete record can be found here: <a href="http://www.jpcameron.com/tron/tron-games.zip">www.jpcameron.com/tron/tron-games.zip</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://jpcameron.com/blog/?feed=rss2&amp;p=96</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>More Addictive than Nicotine</title>
		<link>http://jpcameron.com/blog/?p=83</link>
		<comments>http://jpcameron.com/blog/?p=83#comments</comments>
		<pubDate>Sat, 27 Feb 2010 22:39:53 +0000</pubDate>
		<dc:creator>jeff</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[addictive]]></category>
		<category><![CDATA[ai challenge]]></category>
		<category><![CDATA[contest]]></category>

		<guid isPermaLink="false">http://jpcameron.com/blog/?p=83</guid>
		<description><![CDATA[When I set out to design this year&#8217;s Google AI Challenge, one of my priorities was the make the contest as addictive as possible. I didn&#8217;t have to look far for inspiration. All I had to do was borrow a few tricks from the Big Tobacco marketing playbook.

Get them hooked early. In order to deliver [...]]]></description>
			<content:encoded><![CDATA[<p>When I set out to design this year&#8217;s Google AI Challenge, one of my priorities was the make the contest as addictive as possible. I didn&#8217;t have to look far for inspiration. All I had to do was borrow a few tricks from the Big Tobacco marketing playbook.</p>
<ol>
<li><strong>Get them hooked early. </strong>In order to deliver the first fix as quickly as possible, I posted a <a href="http://csclub.uwaterloo.ca/contest/quickstart.php">five-minute quickstart</a> guide with instructions on how to get your name onto the global leaderboard in less than five minutes. I posted some <a href="http://csclub.uwaterloo.ca/contest/starter_packages.php">simple working entries</a> on the website which could be directly re-submitted without any modifications. Cigarette companies use <a href="http://en.wikipedia.org/wiki/Joe_Camel">Joe Camel</a> to advertise to children, drug dealers offer free doses to lure first-time users, and the contest has <a href="http://csclub.uwaterloo.ca/contest/starter_packages.php">Starter Packages</a>.</li>
<li><strong>Instant gratification. </strong>In last year&#8217;s Google AI Challenge, people would have to wait between one and two hours to see their latest submission&#8217;s ranking. This means that if it&#8217;s 3:00 AM and you just submitted your code, there is a fairly large incentive to go to bed. This is clearly unacceptable. This year, participants were able to see their new ranking within at most five minutes. By shortening the feedback loop to almost nothing, we set up a situation that is very similar to a gambling addict at a blackjack table. Just one more hand&#8230;</li>
<li><strong>Lace it with addictive chemicals. </strong>Despite much effort, I was not able to figure out how to lace the contest with addictive chemicals. That being said, I am fairly sure that time spent working on the contest is highly correlated with intake of caffeine and MSG.</li>
</ol>
<div id="attachment_86" class="wp-caption aligncenter" style="width: 409px"><a href="http://jpcameron.com/blog/wp-content/uploads/2010/02/joe-camel.png"><img class="size-full wp-image-86" title="joe-camel" src="http://jpcameron.com/blog/wp-content/uploads/2010/02/joe-camel.png" alt="" width="399" height="231" /></a><p class="wp-caption-text">Cigarette companies use Joe Camel to advertise to children, drug dealers offer free doses to lure first-time users, and the contest has Starter Packages.</p></div>
<p>After all was said and done, I believe that my efforts paid off. Here are a few quotes from contestants, taken the day after the submission deadline:</p>
<blockquote><p>&#8220;I&#8217;m glad the deadline wasn&#8217;t extended, i was sleeping better last night than the previous dozens of night. i was constantly working on it, that is finally over <img src='http://jpcameron.com/blog/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> &#8221;</p></blockquote>
<blockquote><p>&#8220;actually I dreaded the deadline getting extended. I am really happy it&#8217;s over. my obsessive-compulsive behaviour would have continued for some time&#8221;</p></blockquote>
<blockquote><p>&#8220;I am glad that this is finally finished too, or wife is going to get grumpy. (unrecognizable yelling at the background)&#8221;</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://jpcameron.com/blog/?feed=rss2&amp;p=83</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>So&#8230; Close&#8230;</title>
		<link>http://jpcameron.com/blog/?p=76</link>
		<comments>http://jpcameron.com/blog/?p=76#comments</comments>
		<pubDate>Thu, 25 Feb 2010 17:10:10 +0000</pubDate>
		<dc:creator>jeff</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[ai challenge]]></category>
		<category><![CDATA[million]]></category>
		<category><![CDATA[odometer]]></category>

		<guid isPermaLink="false">http://jpcameron.com/blog/?p=76</guid>
		<description><![CDATA[Most people can imagine the joy that comes from watching the odometer of an old truck roll over.
In the last couple days, I&#8217;ve been approaching a milestone of my own. The traffic for the Google AI Challenge website has been approaching our initial dream goal of 1,000,000 pageviews. This morning I got out of bed [...]]]></description>
			<content:encoded><![CDATA[<p>Most people can imagine the joy that comes from watching the odometer of an old truck roll over.</p>
<div id="attachment_77" class="wp-caption aligncenter" style="width: 353px"><a href="http://jpcameron.com/blog/wp-content/uploads/2010/02/odometer.png"><img class="size-full wp-image-77" title="odometer" src="http://jpcameron.com/blog/wp-content/uploads/2010/02/odometer.png" alt="" width="343" height="173" /></a><p class="wp-caption-text">It&#39;s like your 50th wedding anniversary, except better.</p></div>
<p style="text-align: left;">In the last couple days, I&#8217;ve been approaching a milestone of my own. The traffic for the <a href="http://www.ai-contest.com">Google AI Challenge website</a> has been approaching our initial dream goal of 1,000,000 pageviews. This morning I got out of bed and immediately checked it, what with my being a Google Analytics addict. Here is how I found it:</p>
<div id="attachment_78" class="wp-caption aligncenter" style="width: 310px"><a href="http://jpcameron.com/blog/wp-content/uploads/2010/02/pageviews.png"><img class="size-full wp-image-78 " style="border: 1px solid black;" title="pageviews" src="http://jpcameron.com/blog/wp-content/uploads/2010/02/pageviews.png" alt="" width="300" height="150" /></a><p class="wp-caption-text">So... close...</p></div>
<p>Couldn&#8217;t have cut it any closer than that. Looks like today is going to be the big day.</p>
]]></content:encoded>
			<wfw:commentRss>http://jpcameron.com/blog/?feed=rss2&amp;p=76</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Genetic Algorithm Art Fail</title>
		<link>http://jpcameron.com/blog/?p=72</link>
		<comments>http://jpcameron.com/blog/?p=72#comments</comments>
		<pubDate>Thu, 25 Feb 2010 02:15:41 +0000</pubDate>
		<dc:creator>jeff</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[art]]></category>
		<category><![CDATA[CImg]]></category>
		<category><![CDATA[galib]]></category>
		<category><![CDATA[genetic algorithm]]></category>
		<category><![CDATA[mona lisa]]></category>

		<guid isPermaLink="false">http://jpcameron.com/blog/?p=72</guid>
		<description><![CDATA[Today I have started an experiment to use a Genetic Algorithm to create artistic drawings. I hope to achieve results similar to Bergen and Ross from Brock University. As a test, I tried approximating the Mona Lisa in grayscale using only circles. Here is the result.
While this is an interesting image, it doesn&#8217;t look a [...]]]></description>
			<content:encoded><![CDATA[<p>Today I have started an experiment to use a <a href="http://en.wikipedia.org/wiki/Genetic_algorithm">Genetic Algorithm</a> to create artistic drawings. I hope to achieve results similar to <a href="http://www.cosc.brocku.ca/~bross/JNetic/paper_images/">Bergen and Ross</a> from Brock University. As a test, I tried approximating <a href="http://en.wikipedia.org/wiki/Mona_Lisa">the Mona Lisa</a> in grayscale using only circles. Here is the result.</p>
<div id="attachment_73" class="wp-caption aligncenter" style="width: 410px"><a href="http://jpcameron.com/blog/wp-content/uploads/2010/02/attempt1.png"><img class="size-full wp-image-73" title="attempt1" src="http://jpcameron.com/blog/wp-content/uploads/2010/02/attempt1.png" alt="" width="400" height="300" /></a><p class="wp-caption-text">Fail.</p></div>
<p>While this is an interesting image, it doesn&#8217;t look a lot like the Mona Lisa. Some of the largest features of the Mona Lisa are present to a degree, such as a light region in the center, dark bottom corners, and a light top-right corner. However, I wouldn&#8217;t call this a success.</p>
<p>What went wrong? I believe that the set of genetic operators I chose (the Galib defaults) are not appropriate, especially the mutation operator. I will implement some new ones that make more sense and try again. Hopefully the results improve.</p>
<p>For the Genetic Algorithms, I am using <a href="http://lancet.mit.edu/ga/">Galib</a>. For the image manipulation code, I am using <a href="http://cimg.sourceforge.net/">CImg</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://jpcameron.com/blog/?feed=rss2&amp;p=72</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>CImg Image Library for C++</title>
		<link>http://jpcameron.com/blog/?p=67</link>
		<comments>http://jpcameron.com/blog/?p=67#comments</comments>
		<pubDate>Wed, 24 Feb 2010 07:18:59 +0000</pubDate>
		<dc:creator>jeff</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[art]]></category>
		<category><![CDATA[C++]]></category>
		<category><![CDATA[CImg]]></category>
		<category><![CDATA[golden ratio]]></category>
		<category><![CDATA[image]]></category>

		<guid isPermaLink="false">http://jpcameron.com/blog/?p=67</guid>
		<description><![CDATA[Today I started playing around with the CImg library. It&#8217;s a library for C++ which can read and write image files in many common formats, and also manipulate images in memory. I want to use it for some specific computer art projects that I have had in mind for a little while.
As a test to [...]]]></description>
			<content:encoded><![CDATA[<p>Today I started playing around with the <a href="http://cimg.sourceforge.net/">CImg library</a>. It&#8217;s a library for C++ which can read and write image files in many common formats, and also manipulate images in memory. I want to use it for some specific computer art projects that I have had in mind for a little while.</p>
<p>As a test to familiarize myself with <a href="http://cimg.sourceforge.net/reference/structcimg__library_1_1CImg.html">the CImg API</a>, I constructed the following image. It&#8217;s a bunch of multicolored semi-transparent circles placed in a golden ratio spiral pattern. Click the image for a bigger version.</p>
<div id="attachment_68" class="wp-caption aligncenter" style="width: 410px"><a href="http://jpcameron.com/blog/wp-content/uploads/2010/02/test.png"><img class="size-full wp-image-68   " style="border: 0px initial initial;" title="test" src="http://jpcameron.com/blog/wp-content/uploads/2010/02/test.png" alt="" width="400" height="247" /></a><p class="wp-caption-text">A golden ratio spiral pattern, using multicolored semi-transparent circles</p></div>
<p style="text-align: center;">
]]></content:encoded>
			<wfw:commentRss>http://jpcameron.com/blog/?feed=rss2&amp;p=67</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
