<?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>Ron&#039;s ShoutBoot| Ron&#039;s ShoutBoot</title>
	<atom:link href="http://ron.shoutboot.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://ron.shoutboot.com</link>
	<description>Learning to code again</description>
	<lastBuildDate>Fri, 18 Jul 2014 17:15:20 +0000</lastBuildDate>
	<language>en-US</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.6</generator>
<xhtml:meta xmlns:xhtml="http://www.w3.org/1999/xhtml" name="robots" content="noindex" />
		<item>
		<title>Haskell Convert &#8211; For loops</title>
		<link>http://ron.shoutboot.com/2013/08/20/haskell-convert-for-loops/</link>
		<comments>http://ron.shoutboot.com/2013/08/20/haskell-convert-for-loops/#comments</comments>
		<pubDate>Tue, 20 Aug 2013 22:06:45 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[haskell]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=283</guid>
		<description><![CDATA[Loops that transform sequence of data Let&#8217;s start by a neat trick I observed in Fay: for :: [a] -&#62; (a -&#62; b) -&#62; [b] for = flip map or, for the curious: for :: Functor f =&#62; f a -&#62; (a -&#62; b) -&#62; f b for = flip fmap Now our good old [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2013/08/20/haskell-convert-for-loops/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Link Review &#8211; late March 2013</title>
		<link>http://ron.shoutboot.com/2013/03/24/link-review-march-2013/</link>
		<comments>http://ron.shoutboot.com/2013/03/24/link-review-march-2013/#comments</comments>
		<pubDate>Sun, 24 Mar 2013 14:51:57 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=269</guid>
		<description><![CDATA[Why this series? When I read something interesting, I mark it with a star, bookmark it, or occasionally retweet it. But then it fades into the void. This series will record my impressions. Life hacking Trello is a great free software for creating online task boards. Its applications range from simple TODO lists to complicated [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2013/03/24/link-review-march-2013/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Battle Game In Haskell #2 &#8211; Fighting using recursion and Either</title>
		<link>http://ron.shoutboot.com/2012/10/28/battle-game-in-haskell-2-fighting-using-recursion-and-either/</link>
		<comments>http://ron.shoutboot.com/2012/10/28/battle-game-in-haskell-2-fighting-using-recursion-and-either/#comments</comments>
		<pubDate>Sun, 28 Oct 2012 20:54:35 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[battle-game]]></category>
		<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[functional-programming]]></category>
		<category><![CDATA[game]]></category>
		<category><![CDATA[haskell]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=246</guid>
		<description><![CDATA[Welcome back! Last time we laid the basics of the battle game by applying damage to a unit. However, we had to specify the amount of damage, while it would be more realistic that the damage results from a hit of a hostile unit. Shooting a unit The following modifications include some refactors (record accessor [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2012/10/28/battle-game-in-haskell-2-fighting-using-recursion-and-either/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Battle Game In Haskell #1 &#8211; Intro and basics</title>
		<link>http://ron.shoutboot.com/2012/10/26/battle-game-in-haskell-1-intro-and-basics/</link>
		<comments>http://ron.shoutboot.com/2012/10/26/battle-game-in-haskell-1-intro-and-basics/#comments</comments>
		<pubDate>Fri, 26 Oct 2012 23:53:24 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[battle-game]]></category>
		<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[functional-programming]]></category>
		<category><![CDATA[game]]></category>
		<category><![CDATA[haskell]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=225</guid>
		<description><![CDATA[Hi! This is the first in a series of posts in which I gradually refine Haskell code to get a working game. The goal of the series is twofold: First, to motivate myself to put into practice the concepts I read about so far, and second, to serve as a practical example of Haskell. I [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2012/10/26/battle-game-in-haskell-1-intro-and-basics/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Composing functions &#8211; functional programming part 1</title>
		<link>http://ron.shoutboot.com/2012/08/03/composing-functions/</link>
		<comments>http://ron.shoutboot.com/2012/08/03/composing-functions/#comments</comments>
		<pubDate>Fri, 03 Aug 2012 22:37:36 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[composition]]></category>
		<category><![CDATA[fj]]></category>
		<category><![CDATA[functional-programming]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[scala]]></category>
		<category><![CDATA[scalaz]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=208</guid>
		<description><![CDATA[I try to address a relative lack of entry-level material on composing functions targeted for FP newcomers. While the usage and benefit of data types like Option or List are quickly grasped, there is less focus on how to create and compose functions operating in the context of these types. While the following are general [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2012/08/03/composing-functions/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Composing Strategies</title>
		<link>http://ron.shoutboot.com/2012/07/28/composing-strategies/</link>
		<comments>http://ron.shoutboot.com/2012/07/28/composing-strategies/#comments</comments>
		<pubDate>Sat, 28 Jul 2012 23:07:06 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[composition]]></category>
		<category><![CDATA[functional-programming]]></category>
		<category><![CDATA[functionaljava]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[strategy]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=191</guid>
		<description><![CDATA[Last time we successfully introduced two strategies, one for making a bread and an other for postprocessing the bread, such as slicing or boxing. Now we have to face the challange of composing postprocessing strategies as per the costumer&#8217;s request, and we also set out for a journey to the magic land of functional programming. [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2012/07/28/composing-strategies/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Why prefer composition over inheritance</title>
		<link>http://ron.shoutboot.com/2012/07/27/composition-over-inheritance/</link>
		<comments>http://ron.shoutboot.com/2012/07/27/composition-over-inheritance/#comments</comments>
		<pubDate>Fri, 27 Jul 2012 09:21:30 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[composition]]></category>
		<category><![CDATA[inheritance]]></category>
		<category><![CDATA[injection]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[strategy]]></category>
		<category><![CDATA[template-method]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=166</guid>
		<description><![CDATA[In the context is managing pluggable behavior, two possible alternatives are using an abstract class with an abstract method and plug the functionality by subclassing and implementing the method (in Java-land called a template-method), the other is defining an interface (usually a SAM, or Single Abstract Method interface) and passing it to the dependent class [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2012/07/27/composition-over-inheritance/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Immutable backtracking performance with Scala</title>
		<link>http://ron.shoutboot.com/2011/10/29/immutable-backtrack-performance-scal/</link>
		<comments>http://ron.shoutboot.com/2011/10/29/immutable-backtrack-performance-scal/#comments</comments>
		<pubDate>Sat, 29 Oct 2011 22:41:25 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[algorithm]]></category>
		<category><![CDATA[backtrack]]></category>
		<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[functional-programming]]></category>
		<category><![CDATA[scala]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=144</guid>
		<description><![CDATA[I needed to code a pretty standard backtracking algorithm for filling a 2D table, where constraints on a cell can be represented with a set of nodes of some precalculated trees. So I had two problems to solve, backtracking and constraint calculation using trees, which I first solved using mutable procedural techniques, than with a more immutable functional approach.]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2011/10/29/immutable-backtrack-performance-scal/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Mini benchmark for Java field access vs. argument passing</title>
		<link>http://ron.shoutboot.com/2011/10/28/java-benchmark-field-access-vs-argument-passing/</link>
		<comments>http://ron.shoutboot.com/2011/10/28/java-benchmark-field-access-vs-argument-passing/#comments</comments>
		<pubDate>Fri, 28 Oct 2011 11:56:38 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[benchmark]]></category>
		<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[performance]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=135</guid>
		<description><![CDATA[How to handle long call hierarchies passing down the same parameters? When inspecting a class which passes down a single parameter to a hierarchy of (possibly private) methods, and these methods are a subset of the class methods, then from the code-quality point of view it might naturally occur to refactor these methods into a [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2011/10/28/java-benchmark-field-access-vs-argument-passing/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Introduction to Scala training slides online</title>
		<link>http://ron.shoutboot.com/2011/10/04/introduction-to-scala-training-slides-online/</link>
		<comments>http://ron.shoutboot.com/2011/10/04/introduction-to-scala-training-slides-online/#comments</comments>
		<pubDate>Tue, 04 Oct 2011 13:34:45 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[scala]]></category>
		<category><![CDATA[slide]]></category>
		<category><![CDATA[training]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=132</guid>
		<description><![CDATA[I&#8217;m happy to have permission to publish the Introduction to Scala slides from the training I held at EPAM&#8217;s Budapest office. It is mainly aimed for developers with some programming experience, but does not require any Scala knowledge. The material was just fit for 2 hours. This short period was not enough to do interactive [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2011/10/04/introduction-to-scala-training-slides-online/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Is AMQP for you?</title>
		<link>http://ron.shoutboot.com/2010/09/25/is-ampq-for-you/</link>
		<comments>http://ron.shoutboot.com/2010/09/25/is-ampq-for-you/#comments</comments>
		<pubDate>Sat, 25 Sep 2010 19:46:06 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[AMQP]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[messaging]]></category>
		<category><![CDATA[python]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=125</guid>
		<description><![CDATA[I needed to evaluate cross-platform asynchronous messaging solutions, and now I would like to share my experience. Googling and stacking for message queue popped up names like RabbitMQ, ActiveMQ, ZeroMQ, MQ. After some reading I found that most of the mentioned (Rabbit, Active, etc.) are messaging brokers implementing the AMQP (Advanced Messaging Queue Protocol) protocol. Ok, maybe it should be called AMQ protocol but set that aside. AMQP seemed to bring the possibility of persistent and reliable messaging. On the contrary, ZeroMQ turned out to be an intelligent super-socket, but without built-in persistence. This article describes the directions I took towards AMQP and its implementations, and how I (at least partially) rejected using it in favor of ZeroMQ.]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2010/09/25/is-ampq-for-you/feed/</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
		<item>
		<title>stgit squash for debian lenny</title>
		<link>http://ron.shoutboot.com/2010/09/14/stgit-squash-for-debian-lenny/</link>
		<comments>http://ron.shoutboot.com/2010/09/14/stgit-squash-for-debian-lenny/#comments</comments>
		<pubDate>Tue, 14 Sep 2010 11:17:35 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[git debian]]></category>
		<category><![CDATA[Handy Hints]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=123</guid>
		<description><![CDATA[I was missing the convenient stg squash command from stgit 0.14 which comes in the currently stable debian lenny distibution. Fortunately the dependencies of stgit 0.15 from testing/squeeze are already met, so I just downloaded the deb package and dpkg&#8217;d it up. Yay!]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2010/09/14/stgit-squash-for-debian-lenny/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Alt-Tab out of VirtualBox</title>
		<link>http://ron.shoutboot.com/2010/09/11/alt-tab-out-of-virtualbox/</link>
		<comments>http://ron.shoutboot.com/2010/09/11/alt-tab-out-of-virtualbox/#comments</comments>
		<pubDate>Sat, 11 Sep 2010 10:59:30 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[Handy Hints]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=121</guid>
		<description><![CDATA[Handy hint: you can alt-tab out of VirtualBox if you hit the Host key once first (not hold it). Also, after hitting the Host key the next key-combo goes to the host os.]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2010/09/11/alt-tab-out-of-virtualbox/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>The ballad of JViewportLayout and DefaultCaret &#8211; a Java/Swing JScrollPane scrolling horror tale</title>
		<link>http://ron.shoutboot.com/2010/05/23/swing-jscrollpane-scrolls-to-bottom/</link>
		<comments>http://ron.shoutboot.com/2010/05/23/swing-jscrollpane-scrolls-to-bottom/#comments</comments>
		<pubDate>Sun, 23 May 2010 11:28:24 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[gui]]></category>
		<category><![CDATA[java]]></category>
		<category><![CDATA[scrolling]]></category>
		<category><![CDATA[swing]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=104</guid>
		<description><![CDATA[The problem Today I share a workaround for a pretty nasty Java/Swing problem took a day to hunt down. The platform is JDK6u17_b04 for reference, let&#8217;s hope that it won&#8217;t break. The situation is having a JScrollPane with a JPanel as its view, and various components which embed a JTextPane are incrementally added to the [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2010/05/23/swing-jscrollpane-scrolls-to-bottom/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Graph theoretic terms in Japanese</title>
		<link>http://ron.shoutboot.com/2010/03/30/graph-theoretic-terms-in-japanese/</link>
		<comments>http://ron.shoutboot.com/2010/03/30/graph-theoretic-terms-in-japanese/#comments</comments>
		<pubDate>Tue, 30 Mar 2010 19:47:31 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[graph]]></category>
		<category><![CDATA[japanese]]></category>
		<category><![CDATA[Research Run]]></category>
		<category><![CDATA[terminology]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=102</guid>
		<description><![CDATA[An interesting collection of graph theoretic terms in Japanese everyone should know Source: Wikipedia.jp graph &#8211; グラフ vertex / node / element &#8211; 頂点　（ちょうてん）、 ノード、節点　（せってん） edge / link &#8211; 辺　（へん）、エッジ、枝　（えだ） degree &#8211; 次数　（じすう） endpoint &#8211; 端点　（たんてん） neighbor &#8211; 隣接　（りんせつ） walk &#8211; 歩道　（ほどう） path &#8211; 道　（みち）、経路　（けいろ） closed path, circle, cycle &#8211; 閉路　（へいろ）、回路　（かいろ）、循環　（じゅんかん）、サーキット、サイクル trail &#8211; 路　（みち）、小径　（しょうけい）、トレイル loop  [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2010/03/30/graph-theoretic-terms-in-japanese/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Detect cluster function with Gene Ontology</title>
		<link>http://ron.shoutboot.com/2010/03/24/detect-cluster-function-with-gene-ontology/</link>
		<comments>http://ron.shoutboot.com/2010/03/24/detect-cluster-function-with-gene-ontology/#comments</comments>
		<pubDate>Wed, 24 Mar 2010 00:26:02 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[gene]]></category>
		<category><![CDATA[GO]]></category>
		<category><![CDATA[hypergeometric]]></category>
		<category><![CDATA[ontology]]></category>
		<category><![CDATA[protein]]></category>
		<category><![CDATA[python]]></category>
		<category><![CDATA[Research Run]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=99</guid>
		<description><![CDATA[Let&#8217;s assume that you have a set of genes (or proteins, the markup is a bit ambigous here unfortunately) and now you want to evaluate if those genes share anything remarkable in common (like common molecular function, common localisation inside the cell, etc). This is where Gene Ontology (GO) comes handy [1]. GO defines so-called [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2010/03/24/detect-cluster-function-with-gene-ontology/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Pipe network problem with Integer Linear Programming &#8211; Challenge24 warmup #2</title>
		<link>http://ron.shoutboot.com/2010/02/22/pipe-network-integer-linear-programming-challenge24/</link>
		<comments>http://ron.shoutboot.com/2010/02/22/pipe-network-integer-linear-programming-challenge24/#comments</comments>
		<pubDate>Mon, 22 Feb 2010 16:53:21 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[algorithm]]></category>
		<category><![CDATA[challenge24]]></category>
		<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[linear_programming]]></category>
		<category><![CDATA[python]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=78</guid>
		<description><![CDATA[Okay, some more algorithms practice, this time on EC2009 of the Challenge24 24-hour programming contest, problem H &#8220;Gas pipe&#8221;. The gas pipe problem In the problem, we have a gas pipe network as an undirected graph, nodes being cities which support (sources) or require (sinks) integer units of gas, edges being the possible places of [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2010/02/22/pipe-network-integer-linear-programming-challenge24/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Fun at the challenge24 pre-contest 2010</title>
		<link>http://ron.shoutboot.com/2010/02/20/fun-at-the-challenge24-pre-contest-2010/</link>
		<comments>http://ron.shoutboot.com/2010/02/20/fun-at-the-challenge24-pre-contest-2010/#comments</comments>
		<pubDate>Sat, 20 Feb 2010 19:55:14 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[challenge24]]></category>
		<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[irc]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=58</guid>
		<description><![CDATA[An electronic test content will start in fifteen minutes for the first time in Ch24&#8242;s life. Here is a semi-live feed about the events of the pre-ec: [7:57] Published the contest IRC help channel details. Installing mIRC (feels like if I were in high school again) [8:04] sharpobject was kicked by clrwdt (Banned: Please use [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2010/02/20/fun-at-the-challenge24-pre-contest-2010/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Greedy keyboard assignment &#8211; Challenge24 warmup #1</title>
		<link>http://ron.shoutboot.com/2010/02/17/greedy-keyboard-assignment-challenge24/</link>
		<comments>http://ron.shoutboot.com/2010/02/17/greedy-keyboard-assignment-challenge24/#comments</comments>
		<pubDate>Wed, 17 Feb 2010 21:53:34 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[algorithm]]></category>
		<category><![CDATA[challenge24]]></category>
		<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[python]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=51</guid>
		<description><![CDATA[The electronic filtering contest (EC) of the Challenge24 24-hour programming contest is to be held soon so I decided to do some warmup and solve some of the problems of the past. Here is the solution for problem A of EC 2006 (download the problem set from the &#8220;History&#8221; section of the Challenge24 web site), [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2010/02/17/greedy-keyboard-assignment-challenge24/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Web binding domains</title>
		<link>http://ron.shoutboot.com/2010/02/08/web-binding-domains/</link>
		<comments>http://ron.shoutboot.com/2010/02/08/web-binding-domains/#comments</comments>
		<pubDate>Mon, 08 Feb 2010 23:21:47 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[domain]]></category>
		<category><![CDATA[protein]]></category>
		<category><![CDATA[Tired Things]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/?p=34</guid>
		<description><![CDATA[Protein interest rates go up! Our knowledge about molecular biology seems to approach infinity nowadays. With such institutions as the Protein DataBank researchers have the nice oppurtunity to invest some of their preciously collected protein data and collect the growing interests. Here we depict a portion of the sequence of the protein &#8220;DNA Polymerase&#8221; which [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2010/02/08/web-binding-domains/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Kickstart an Office Add-in with Visual C# 2008 Express</title>
		<link>http://ron.shoutboot.com/2010/01/24/kickstart-office-addin-visual-csharp-2008-express/</link>
		<comments>http://ron.shoutboot.com/2010/01/24/kickstart-office-addin-visual-csharp-2008-express/#comments</comments>
		<pubDate>Sun, 24 Jan 2010 21:03:25 +0000</pubDate>
		<dc:creator>ron</dc:creator>
				<category><![CDATA[addin]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[Coding Corner]]></category>
		<category><![CDATA[office]]></category>

		<guid isPermaLink="false">http://ron.shoutboot.com/2010/01/24/hello-world/</guid>
		<description><![CDATA[The reason why this post is called to life is the relatively small amount of information found about writing an Ofiice Add-in without the Shared template found in the non-express version of Visual Studio. The content of this post is mostly duct-taped together from other articles on the net (see the references at the end [&#8230;]]]></description>
		<wfw:commentRss>http://ron.shoutboot.com/2010/01/24/kickstart-office-addin-visual-csharp-2008-express/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>
