<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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/"
		>
<channel>
	<title>Comments for CodeWord: Apokalyptik</title>
	<atom:link href="http://blog.apokalyptik.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://blog.apokalyptik.com</link>
	<description>The random things that spew forth from my brain...</description>
	<lastBuildDate>Mon, 01 Feb 2010 14:01:48 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=3.0-alpha</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Using wait, $!, and () for threading in bash by Thorsten</title>
		<link>http://blog.apokalyptik.com/2008/12/11/using-wait-and-for-threading-in-bash/comment-page-1/#comment-8767</link>
		<dc:creator>Thorsten</dc:creator>
		<pubDate>Mon, 01 Feb 2010 14:01:48 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/?p=348#comment-8767</guid>
		<description>Thanks for bringing &quot;wait&quot; to my attention. I needed something to run a couple of processes at once, making sure that as soon as on process ends a new one is filling up its spot in the queue. The result using wait and jobs is here http://sourcebench.com/languages/bash/simple-parallel-processing-with-bash-using-wait-and-jobs/</description>
		<content:encoded><![CDATA[<p>Thanks for bringing &#8220;wait&#8221; to my attention. I needed something to run a couple of processes at once, making sure that as soon as on process ends a new one is filling up its spot in the queue. The result using wait and jobs is here <a href="http://sourcebench.com/languages/bash/simple-parallel-processing-with-bash-using-wait-and-jobs/" rel="nofollow">http://sourcebench.com/languages/bash/simple-parallel-processing-with-bash-using-wait-and-jobs/</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Debian Lenny, Avahi, AFP&#8230; Linux Fileserver for OSX Clients by Tweets that mention Debian Lenny, Avahi, AFP… Linux Fileserver for OSX Clients « CodeWord: Apokalyptik -- Topsy.com</title>
		<link>http://blog.apokalyptik.com/2009/02/12/debian-lenny-avahi-afp-linux-fileserver-for-osx-clients/comment-page-1/#comment-8766</link>
		<dc:creator>Tweets that mention Debian Lenny, Avahi, AFP… Linux Fileserver for OSX Clients « CodeWord: Apokalyptik -- Topsy.com</dc:creator>
		<pubDate>Wed, 27 Jan 2010 03:20:03 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/?p=391#comment-8766</guid>
		<description>[...] This post was mentioned on Twitter by Bernhard Ertler, Tux von Bux. Tux von Bux said: RT @BernhardErtler: bonjour installation für Debian hat super geklappt mit dieser Anleitung: http://bit.ly/5Lx2qM [...]</description>
		<content:encoded><![CDATA[<p>[...] This post was mentioned on Twitter by Bernhard Ertler, Tux von Bux. Tux von Bux said: RT @BernhardErtler: bonjour installation für Debian hat super geklappt mit dieser Anleitung: <a href="http://bit.ly/5Lx2qM" rel="nofollow">http://bit.ly/5Lx2qM</a> [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on This is actually pretty cool by apokalyptik</title>
		<link>http://blog.apokalyptik.com/2010/01/14/this-is-actually-pretty-cool/comment-page-1/#comment-8761</link>
		<dc:creator>apokalyptik</dc:creator>
		<pubDate>Sun, 17 Jan 2010 00:46:16 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/2010/01/14/this-is-actually-pretty-cool/#comment-8761</guid>
		<description>umm, a couple? ;) :P</description>
		<content:encoded><![CDATA[<p>umm, a couple? <img src='http://blog.apokalyptik.com/wp-includes/images/smilies/icon_wink.gif' alt=';)' class='wp-smiley' />  <img src='http://blog.apokalyptik.com/wp-includes/images/smilies/icon_razz.gif' alt=':P' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on This is actually pretty cool by Lloyd Budd</title>
		<link>http://blog.apokalyptik.com/2010/01/14/this-is-actually-pretty-cool/comment-page-1/#comment-8760</link>
		<dc:creator>Lloyd Budd</dc:creator>
		<pubDate>Sat, 16 Jan 2010 22:40:09 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/2010/01/14/this-is-actually-pretty-cool/#comment-8760</guid>
		<description>Wow, it surprised me! How many levels did you test ;-) play?</description>
		<content:encoded><![CDATA[<p>Wow, it surprised me! How many levels did you test <img src='http://blog.apokalyptik.com/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' />  play?</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on This is actually pretty cool by Stephane Daury</title>
		<link>http://blog.apokalyptik.com/2010/01/14/this-is-actually-pretty-cool/comment-page-1/#comment-8759</link>
		<dc:creator>Stephane Daury</dc:creator>
		<pubDate>Sat, 16 Jan 2010 14:32:26 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/2010/01/14/this-is-actually-pretty-cool/#comment-8759</guid>
		<description>Sweet, but kinda made me dizzy. :p</description>
		<content:encoded><![CDATA[<p>Sweet, but kinda made me dizzy. :p</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Time based bloom filters by apokalyptik</title>
		<link>http://blog.apokalyptik.com/2010/01/06/time-based-bloom-filters/comment-page-1/#comment-8750</link>
		<dc:creator>apokalyptik</dc:creator>
		<pubDate>Thu, 07 Jan 2010 17:58:32 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/?p=498#comment-8750</guid>
		<description>Interesting. It could be said that the entire vector, assuming a hit, could be no newer than the oldest of its points. Also if you used some sort of decaying model you could make a guess at how false a positive might be based on a sort of communal agreement -- how many share the same age</description>
		<content:encoded><![CDATA[<p>Interesting. It could be said that the entire vector, assuming a hit, could be no newer than the oldest of its points. Also if you used some sort of decaying model you could make a guess at how false a positive might be based on a sort of communal agreement &#8212; how many share the same age</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Time based bloom filters by Andy</title>
		<link>http://blog.apokalyptik.com/2010/01/06/time-based-bloom-filters/comment-page-1/#comment-8749</link>
		<dc:creator>Andy</dc:creator>
		<pubDate>Thu, 07 Jan 2010 17:06:54 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/?p=498#comment-8749</guid>
		<description>Each counting &quot;bit&quot; gets a TTL. Curious. I&#039;d think decay would be more appropriate---closer to a model of perceptual impact---than complete expiration. How would we do that? Each bit a process. You know where this is going... :-)</description>
		<content:encoded><![CDATA[<p>Each counting &#8220;bit&#8221; gets a TTL. Curious. I&#8217;d think decay would be more appropriate&#8212;closer to a model of perceptual impact&#8212;than complete expiration. How would we do that? Each bit a process. You know where this is going&#8230; <img src='http://blog.apokalyptik.com/wp-includes/images/smilies/icon_smile.gif' alt=':-)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Quality Time With Your JPEGs by skal</title>
		<link>http://blog.apokalyptik.com/2009/09/16/quality-time-with-your-jpegs/comment-page-1/#comment-8702</link>
		<dc:creator>skal</dc:creator>
		<pubDate>Sun, 20 Dec 2009 21:59:57 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/?p=456#comment-8702</guid>
		<description>in JPEG_Segment_Names: there&#039;s no SOF4. 0xc3 is for SOF3.</description>
		<content:encoded><![CDATA[<p>in JPEG_Segment_Names: there&#8217;s no SOF4. 0xc3 is for SOF3.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on lockd, a memcached like locking daemon in php by lockd, a memcached like locking daemon in php « CodeWord: Apokalyptik &#124; Coder Online</title>
		<link>http://blog.apokalyptik.com/2009/12/10/lockd-a-memcached-like-locking-daemon-in-php/comment-page-1/#comment-8655</link>
		<dc:creator>lockd, a memcached like locking daemon in php « CodeWord: Apokalyptik &#124; Coder Online</dc:creator>
		<pubDate>Fri, 11 Dec 2009 04:55:01 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/?p=489#comment-8655</guid>
		<description>[...] Visit link: lockd, a memcached like locking daemon in php « CodeWord: Apokalyptik [...]</description>
		<content:encoded><![CDATA[<p>[...] Visit link: lockd, a memcached like locking daemon in php « CodeWord: Apokalyptik [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on php open locking daemon by lockd, a memcached like locking daemon in php &#171; CodeWord: Apokalyptik</title>
		<link>http://blog.apokalyptik.com/2009/09/14/php-open-locking-daemon/comment-page-1/#comment-8653</link>
		<dc:creator>lockd, a memcached like locking daemon in php &#171; CodeWord: Apokalyptik</dc:creator>
		<pubDate>Thu, 10 Dec 2009 22:07:16 +0000</pubDate>
		<guid isPermaLink="false">http://blog.apokalyptik.com/?p=447#comment-8653</guid>
		<description>[...] might have seen my last post about this code (here) if you are one of my 2.3 loyal readers  . It wasnt nearly so complete or robust then (segfaulting? [...]</description>
		<content:encoded><![CDATA[<p>[...] might have seen my last post about this code (here) if you are one of my 2.3 loyal readers  . It wasnt nearly so complete or robust then (segfaulting? [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>