<?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"
	>

<channel>
	<title>The Research Kitchen Weblog</title>
	<atom:link href="http://www.theresearchkitchen.com/blog/feed" rel="self" type="application/rss+xml" />
	<link>http://www.theresearchkitchen.com/blog</link>
	<description>Rory Winston</description>
	<pubDate>Mon, 24 Nov 2008 22:47:04 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.3</generator>
	<language>en</language>
			<item>
		<title>Project Euler Problem #11</title>
		<link>http://www.theresearchkitchen.com/blog/archives/277</link>
		<comments>http://www.theresearchkitchen.com/blog/archives/277#comments</comments>
		<pubDate>Mon, 24 Nov 2008 22:40:23 +0000</pubDate>
		<dc:creator>Administrator</dc:creator>
		
		<category><![CDATA[Coding]]></category>

		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[R]]></category>

		<guid isPermaLink="false">http://www.theresearchkitchen.com/blog/?p=277</guid>
		<description><![CDATA[Problem 11 on Project Euler involves calculating the maximum product of adjacent numbers in any direction in a 20&#215;20 matrix. 
The solution below takes advantage of the symmetry of calculations to cut down on unnecessary loop operations:


problem11 &#60; - function() {
    numbers &#60;- scan(&#34;problem11.dat&#34;)
        m [...]]]></description>
		<wfw:commentRss>http://www.theresearchkitchen.com/blog/archives/277/feed</wfw:commentRss>
		</item>
		<item>
		<title>Analysing SVN Commits Across Committer Groups</title>
		<link>http://www.theresearchkitchen.com/blog/archives/246</link>
		<comments>http://www.theresearchkitchen.com/blog/archives/246#comments</comments>
		<pubDate>Fri, 03 Oct 2008 17:41:42 +0000</pubDate>
		<dc:creator>Administrator</dc:creator>
		
		<category><![CDATA[Coding]]></category>

		<guid isPermaLink="false">http://www.theresearchkitchen.com/blog/?p=246</guid>
		<description><![CDATA[Here is an example of using the SVNKit API to crawl a SVN repository and pick up the commit sizes. It uses a very simple (and incorrect) heuristic for estimating the number of lines changed per commit - it just gets the absolute value of the difference of the numer of lines added and subtracted [...]]]></description>
		<wfw:commentRss>http://www.theresearchkitchen.com/blog/archives/246/feed</wfw:commentRss>
		</item>
		<item>
		<title>The Gini Coefficient As A Measure of Software Project Risk</title>
		<link>http://www.theresearchkitchen.com/blog/archives/219</link>
		<comments>http://www.theresearchkitchen.com/blog/archives/219#comments</comments>
		<pubDate>Fri, 12 Sep 2008 13:27:53 +0000</pubDate>
		<dc:creator>Administrator</dc:creator>
		
		<category><![CDATA[Coding]]></category>

		<guid isPermaLink="false">http://www.theresearchkitchen.com/blog/?p=219</guid>
		<description><![CDATA[Introduction
In economics, the Gini Coefficient (http://www.statistics.gov.uk/about/methodology_by_theme/gini/default.asp) is a standard quantitative measure of the relative inequality in the distribution of wealth. The name &#8220;Gini Coefficient&#8221; is a moniker for a large family of variations on the basic inequality measure, but the standard interpretation is that of the ratio of the area under the Lorenz curve (a [...]]]></description>
		<wfw:commentRss>http://www.theresearchkitchen.com/blog/archives/219/feed</wfw:commentRss>
		</item>
		<item>
		<title>TimedMap Implementation</title>
		<link>http://www.theresearchkitchen.com/blog/archives/195</link>
		<comments>http://www.theresearchkitchen.com/blog/archives/195#comments</comments>
		<pubDate>Wed, 20 Aug 2008 17:30:21 +0000</pubDate>
		<dc:creator>Administrator</dc:creator>
		
		<category><![CDATA[Coding]]></category>

		<guid isPermaLink="false">http://www.theresearchkitchen.com/blog/?p=195</guid>
		<description><![CDATA[Here is the implementation for a timed concurrent map implementation that I wrote a while ago. It delegates to an underlying ConcurrentMap, and uses a single ReentrantLock to synchronize writers. It is designed to use in situations where objects eventually age themselves out of cache storage. 
package&#160;com.researchkitchen.map;
import&#160;java.util.Map;import&#160;java.util.Timer;import&#160;java.util.TimerTask;import&#160;java.util.concurrent.ConcurrentHashMap;import&#160;java.util.concurrent.ConcurrentMap;import&#160;java.util.concurrent.locks.Lock;import&#160;java.util.concurrent.locks.ReentrantLock;/**&#160;*&#160;A wrapper around a {@link ConcurrentMap}&#160;that expires entries from [...]]]></description>
		<wfw:commentRss>http://www.theresearchkitchen.com/blog/archives/195/feed</wfw:commentRss>
		</item>
		<item>
		<title>Presentation at UseR! 2008</title>
		<link>http://www.theresearchkitchen.com/blog/archives/189</link>
		<comments>http://www.theresearchkitchen.com/blog/archives/189#comments</comments>
		<pubDate>Tue, 12 Aug 2008 08:31:06 +0000</pubDate>
		<dc:creator>Administrator</dc:creator>
		
		<category><![CDATA[Finance]]></category>

		<category><![CDATA[R]]></category>

		<guid isPermaLink="false">http://www.theresearchkitchen.com/blog/?p=189</guid>
		<description><![CDATA[Today is the second day of UseR! 2008 in Germany, and I will be giving a short talk on a market data interface I developed for R a while back. The confererence is apparently the largest R user conference yet, with over 400 participants, from all areas of industry and academia. 
Here are the slides:
r_market_data
For [...]]]></description>
		<wfw:commentRss>http://www.theresearchkitchen.com/blog/archives/189/feed</wfw:commentRss>
		</item>
		<item>
		<title>The Problem With #defines</title>
		<link>http://www.theresearchkitchen.com/blog/archives/179</link>
		<comments>http://www.theresearchkitchen.com/blog/archives/179#comments</comments>
		<pubDate>Wed, 23 Jul 2008 10:12:42 +0000</pubDate>
		<dc:creator>Administrator</dc:creator>
		
		<category><![CDATA[Coding]]></category>

		<category><![CDATA[R]]></category>

		<guid isPermaLink="false">http://www.theresearchkitchen.com/blog/?p=179</guid>
		<description><![CDATA[The C/C++ #define mechanism is a very powerful, but very blunt templating approach. It&#8217;s a simple textual search-and-replace mechanism, which can be very useful, but not so subtle.
This was illustrated to me today when I ran into a problem with some code for an R extension that I am writing, that interfaces to Reuters market [...]]]></description>
		<wfw:commentRss>http://www.theresearchkitchen.com/blog/archives/179/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler Problem #10 (R)</title>
		<link>http://www.theresearchkitchen.com/blog/archives/175</link>
		<comments>http://www.theresearchkitchen.com/blog/archives/175#comments</comments>
		<pubDate>Fri, 18 Jul 2008 23:33:39 +0000</pubDate>
		<dc:creator>Administrator</dc:creator>
		
		<category><![CDATA[Coding]]></category>

		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[R]]></category>

		<guid isPermaLink="false">http://www.theresearchkitchen.com/blog/?p=175</guid>
		<description><![CDATA[Problem 10 asks us to find the sum of the prime numbers below 2*106. With the sieve() routine written for one of the earlier problems, this is easy: it becomes
> sum(sieve(2E6))
It is slow, however. It makes you appreciate how computationally intensive it is to search for larger primes.
]]></description>
		<wfw:commentRss>http://www.theresearchkitchen.com/blog/archives/175/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler Problem #9 (R)</title>
		<link>http://www.theresearchkitchen.com/blog/archives/169</link>
		<comments>http://www.theresearchkitchen.com/blog/archives/169#comments</comments>
		<pubDate>Fri, 18 Jul 2008 23:18:23 +0000</pubDate>
		<dc:creator>Administrator</dc:creator>
		
		<category><![CDATA[Coding]]></category>

		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[R]]></category>

		<guid isPermaLink="false">http://www.theresearchkitchen.com/blog/?p=169</guid>
		<description><![CDATA[Problem 9 involves finding the Pythagorean triple  where a+b+c=1000.
Pythagorean triples have lots of useful relationships that we can exploit. The ones we shall use to solve this problem are:



In this case, we take , and generate the triples as follows:


# Problem 9
# Pythagorean Triple
problem9 &#60;- function() {

        [...]]]></description>
		<wfw:commentRss>http://www.theresearchkitchen.com/blog/archives/169/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler Problem #8 (R)</title>
		<link>http://www.theresearchkitchen.com/blog/archives/162</link>
		<comments>http://www.theresearchkitchen.com/blog/archives/162#comments</comments>
		<pubDate>Fri, 18 Jul 2008 22:37:54 +0000</pubDate>
		<dc:creator>Administrator</dc:creator>
		
		<category><![CDATA[Coding]]></category>

		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[R]]></category>

		<guid isPermaLink="false">http://www.theresearchkitchen.com/blog/?p=162</guid>
		<description><![CDATA[Problem #8 on the Project Euler problem list requires finding the greatest product of five consecutive digits in a large string of integers.
For this problem, I copied and pasted the large number into a file, and read it in using scan(). As there were line breaks in the copied and pasted numbers, I used paste() [...]]]></description>
		<wfw:commentRss>http://www.theresearchkitchen.com/blog/archives/162/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler Problem #7 (R)</title>
		<link>http://www.theresearchkitchen.com/blog/archives/154</link>
		<comments>http://www.theresearchkitchen.com/blog/archives/154#comments</comments>
		<pubDate>Fri, 18 Jul 2008 21:55:11 +0000</pubDate>
		<dc:creator>Administrator</dc:creator>
		
		<category><![CDATA[Coding]]></category>

		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[R]]></category>

		<guid isPermaLink="false">http://www.theresearchkitchen.com/blog/?p=154</guid>
		<description><![CDATA[Problem 7 on the Project Euler site is the following challenge:
By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
What is the 10001st prime number?
The routine below returns  a list of primes, each successive prime being calculated by testing none of [...]]]></description>
		<wfw:commentRss>http://www.theresearchkitchen.com/blog/archives/154/feed</wfw:commentRss>
		</item>
	</channel>
</rss>
