<?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>keeping simple</title>
	<atom:link href="http://www.yodaiken.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.yodaiken.com</link>
	<description>Systems software technology and business</description>
	<lastBuildDate>Thu, 19 Apr 2012 17:27:43 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1</generator>
		<item>
		<title>Timestamp based reconciliation</title>
		<link>http://www.yodaiken.com/2012/04/timestamp-based-reconciliation/</link>
		<comments>http://www.yodaiken.com/2012/04/timestamp-based-reconciliation/#comments</comments>
		<pubDate>Thu, 19 Apr 2012 17:27:43 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[data center]]></category>
		<category><![CDATA[software engineering]]></category>
		<category><![CDATA[database]]></category>

		<guid isPermaLink="false">http://www.yodaiken.com/?p=1259</guid>
		<description><![CDATA[Timestamp based reconciliation: This case differs from the previous one only in the reconciliation mechanism. In case of divergent versions, Dynamo  performs simple timestamp based reconciliation logic of “last write wins”; i.e., the object with the largest physical timestamp value is chosen as the correct &#8230; <a href="http://www.yodaiken.com/2012/04/timestamp-based-reconciliation/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<blockquote><p>Timestamp based reconciliation: This case differs from the previous one only in the reconciliation mechanism. In case of divergent versions, Dynamo  performs simple timestamp based reconciliation logic of “last write wins”; i.e., the object with the largest physical timestamp value is chosen as the correct version. The service that maintains customer’s session information is a good example of a service that uses this mode.</p>
<p><a href="http://www.allthingsdistributed.com/files/amazon-dynamo-sosp2007.pdf" onclick="pageTracker._trackPageview('/outgoing/www.allthingsdistributed.com/files/amazon-dynamo-sosp2007.pdf?referer=');">http://www.allthingsdistributed.com/files/amazon-dynamo-sosp2007.pdf</a></p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://www.yodaiken.com/2012/04/timestamp-based-reconciliation/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Murdoch strikes against copyrights</title>
		<link>http://www.yodaiken.com/2012/03/murdoch-strikes-against-copyrights/</link>
		<comments>http://www.yodaiken.com/2012/03/murdoch-strikes-against-copyrights/#comments</comments>
		<pubDate>Mon, 26 Mar 2012 19:18:24 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[intellectual property]]></category>

		<guid isPermaLink="false">http://www.yodaiken.com/?p=1254</guid>
		<description><![CDATA[The witnesses allege a software company NDS, owned by News Corp, cracked the smart card codes of rival company ONdigital. ONdigital, owned by the ITV companies Granada and Carlton, eventually went under amid a welter of counterfeiting by pirates, leaving &#8230; <a href="http://www.yodaiken.com/2012/03/murdoch-strikes-against-copyrights/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<blockquote><p>The witnesses allege a software company NDS, owned by News Corp, cracked the smart card codes of rival company ONdigital. ONdigital, owned by the ITV companies Granada and Carlton, eventually went under amid a welter of counterfeiting by pirates, leaving the immensely lucrative pay-TV field clear for Sky.<br />
The allegations, if proved, cast further doubt on whether News Corp meets the &#8220;fit and proper&#8221; test required to run a broadcaster in Britain. It emerged earlier this month that broadcasting regulator Ofcom has set up a unit called Project Apple to establish whether BSkyB, 39.1% owned by News Corp, meets the test.<br />
Panorama&#8217;s emails appear to state that ONdigital&#8217;s secret codes were first cracked by NDS, and then subsequently publicised by the pirate website, called The House of Ill Compute – THOIC for short. According to the programme, the codes were passed to NDS&#8217;s head of UK security, Ray Adams, a former police officer. NDS made smart cards for Sky. NDS was jointly funded by Sky, which says it never ran NDS.<br />
Lee Gibling, operator of THOIC, says that behind the scenes, he was being paid up to £60,000 a year by Adams, and NDS handed over thousands more to supply him with computer equipment.<br />
He says Adams sent him the ONdigital codes so that other pirates could use them to manufacture thousands of counterfeit smart cards, giving viewers illicit free access to ONdigital, then Sky&#8217;s chief business rival. <a href="http://www.guardian.co.uk/media/2012/mar/26/news-corp-ondigital-paytv-panorama" onclick="pageTracker._trackPageview('/outgoing/www.guardian.co.uk/media/2012/mar/26/news-corp-ondigital-paytv-panorama?referer=');">From the Guardian. </a></p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://www.yodaiken.com/2012/03/murdoch-strikes-against-copyrights/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Loose cables at CERN and Time synchronization is hard</title>
		<link>http://www.yodaiken.com/2012/02/loose-cables-at-cern-and-time-synchronization-is-hard/</link>
		<comments>http://www.yodaiken.com/2012/02/loose-cables-at-cern-and-time-synchronization-is-hard/#comments</comments>
		<pubDate>Sat, 25 Feb 2012 14:20:51 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[software engineering]]></category>

		<guid isPermaLink="false">http://www.yodaiken.com/?p=1251</guid>
		<description><![CDATA[According to sources familiar with the experiment, the 60 nanoseconds discrepancy appears to come from a bad connection between a fiber optic cable that connects to the GPS receiver used to correct the timing of the neutrinos&#8217; flight and an &#8230; <a href="http://www.yodaiken.com/2012/02/loose-cables-at-cern-and-time-synchronization-is-hard/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<blockquote><p>According to sources familiar with the experiment, the 60 nanoseconds discrepancy appears to come from a bad connection between a fiber optic cable that connects to the GPS receiver used to correct the timing of the neutrinos&#8217; flight and an electronic card in a computer. After tightening the connection and then measuring the time it takes data to travel the length of the fiber, researchers found that the data arrive 60 nanoseconds earlier than assumed. Since this time is subtracted from the overall time of flight, it appears to explain the early arrival of the neutrinos. New data, however, will be needed to confirm this hypothesis [ <a href="http://news.sciencemag.org/scienceinsider/2012/02/breaking-news-error-undoes-faster.html" target="_blank" onclick="pageTracker._trackPageview('/outgoing/news.sciencemag.org/scienceinsider/2012/02/breaking-news-error-undoes-faster.html?referer=');">Science Insider</a>]</p></blockquote>
<p>Time synchronization is a real-time problem, meaning that every link is a single point of failure unless you engineer a lot of cross checking.  In our FSMLabs TimeKeeper software, we work in an environment that is a lot more complex and heterogeneous  than the CERN environment &#8211; fortunately we don&#8217;t need to get to those levels of precision. But we are operating at the under 1 microsecond level in many systems and it is enormously difficult to keep a running system balanced as network links misbehave, fans turn on and off,  and processor load changes. One thing we are increasingly doing is to monitor multiple time sources and track their relationships &#8211; to improve system resilience.</p>
<p>&nbsp;</p>
]]></content:encoded>
			<wfw:commentRss>http://www.yodaiken.com/2012/02/loose-cables-at-cern-and-time-synchronization-is-hard/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Manufacturing and devices</title>
		<link>http://www.yodaiken.com/2012/02/manufacturing-and-devices/</link>
		<comments>http://www.yodaiken.com/2012/02/manufacturing-and-devices/#comments</comments>
		<pubDate>Tue, 21 Feb 2012 20:41:18 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[software business]]></category>
		<category><![CDATA[apple]]></category>
		<category><![CDATA[manufacturing]]></category>

		<guid isPermaLink="false">http://www.yodaiken.com/?p=1246</guid>
		<description><![CDATA[The answer is obvious but few people stop for a second to wonder about this. After all, it is not like Apple has control over all aluminum in the world. Apple were just the first to see the potential of &#8230; <a href="http://www.yodaiken.com/2012/02/manufacturing-and-devices/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<blockquote><p>The answer is obvious but few people stop for a second to wonder about this. After all, it is not like Apple has control over all aluminum in the world. Apple were just the first to see the potential of such bodies and began to increase their orders. In just a few years Apple became the main partner of Catcher Technology, a company that possess the necessary expertise to manufacture such bodies. Apple&#8217;s production orders amount to 60% of the company&#8217;s production capacity. It takes three hours to create just a single body of this quality and, naturally, it is more expensive than a plastic body.[..]Thanks to the production scale these aluminum chassis cost Apple just as much as carbon fiber chassis cost to Sony and just a bit more expensive than plastic chassis for laptops of that price range.[...]</p>
<p>By now you must be wondering: why are they taking it? And if there is a short supply of aluminum bodies all they have to do is buy more CNC machinery and make all the chassis they need. But it&#8217;s not as simple as that: it takes up to a year to purchase, install and launch CNC equipment. The management also needs time and courage to allocate large funds to such a project. That is why it was so long before Apple got real competition in terms of laptop chassis. Asus purchased the necessary equipment some time ago but it began to work at full capacity just now and Asus UX21 is one of the first representatives of this work. And due to lower production volumes the production costs of these chassis are higher for Asus that for Apple. Besides, Apple is not paying for the equipment thanks to big binding contracts with their partners. [ <a href="http://mobile-review.com/articles/2012/birulki-158-en.shtml" target="_blank" onclick="pageTracker._trackPageview('/outgoing/mobile-review.com/articles/2012/birulki-158-en.shtml?referer=');">Mobile-Review</a>]</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://www.yodaiken.com/2012/02/manufacturing-and-devices/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Julia programming language and hadoop</title>
		<link>http://www.yodaiken.com/2012/02/julia-programming-language-and-hadoop/</link>
		<comments>http://www.yodaiken.com/2012/02/julia-programming-language-and-hadoop/#comments</comments>
		<pubDate>Tue, 21 Feb 2012 01:34:19 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[data center]]></category>
		<category><![CDATA[software engineering]]></category>
		<category><![CDATA[. julia programming language]]></category>
		<category><![CDATA[hadoop]]></category>

		<guid isPermaLink="false">http://www.yodaiken.com/?p=1241</guid>
		<description><![CDATA[While we’re being demanding, we want something that provides the distributed power of Hadoop — without the kilobytes of boilerplate Java and XML; without being forced to sift through gigabytes of log files on hundreds of machines to find our &#8230; <a href="http://www.yodaiken.com/2012/02/julia-programming-language-and-hadoop/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<blockquote><p>While we’re being demanding, we want something that provides the distributed power of Hadoop — without the kilobytes of boilerplate Java and XML; without being forced to sift through gigabytes of log files on hundreds of machines to find our bugs. We want the power without the layers of impenetrable complexity. We want to write simple scalar loops that compile down to tight machine code using just the registers on a single CPU. We want to write <code>A*B</code> and launch a thousand computations on a thousand machines, calculating a vast matrix product together. <a href="http://julialang.org/blog/2012/02/why-we-created-julia/" target="_blank" onclick="pageTracker._trackPageview('/outgoing/julialang.org/blog/2012/02/why-we-created-julia/?referer=');">Juli</a>a</p></blockquote>
<p>Aside from whatever merit the language has, the note about &#8220;kilobytes of boilerplate Java and XML&#8221; seems both wildly optimistic and on point.</p>
<p>&nbsp;</p>
]]></content:encoded>
			<wfw:commentRss>http://www.yodaiken.com/2012/02/julia-programming-language-and-hadoop/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>The UNIX file system as a recursive function</title>
		<link>http://www.yodaiken.com/2012/01/the-unix-file-system-as-a-recursive-function/</link>
		<comments>http://www.yodaiken.com/2012/01/the-unix-file-system-as-a-recursive-function/#comments</comments>
		<pubDate>Sun, 01 Jan 2012 18:30:48 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[software engineering]]></category>

		<guid isPermaLink="false">http://www.yodaiken.com/?p=1219</guid>
		<description><![CDATA[Ignoring &#8220;write&#8221; operations, for the moment, a file system is just an implementation, a concrete manifestation, of a map from file names to file contents. A UNIX style file system complicates the story because file names are &#8220;paths&#8221; through a &#8230; <a href="http://www.yodaiken.com/2012/01/the-unix-file-system-as-a-recursive-function/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>Ignoring &#8220;write&#8221; operations, for the moment, a file system is just an implementation, a concrete manifestation, of a map from file names to file contents. A UNIX style file system complicates the story because file names are &#8220;paths&#8221; through a somewhat compromised tree structure.  You could try to express the relationships between nodes in this tree and paths by brute force axioms. For example: if the path &#8220;p&#8221; can be resolved to a file, then every proper prefix of &#8220;p&#8221; resolves to a file that is a directory. But, at least to me, it&#8217;s more intuitively compelling to describe the map as a recursive function &#8211; capturing the structure algorithmically. In fact, the axiom approach gets pretty damn ugly when we add things like &#8220;mounted file systems&#8221;.</p>
<p>Begin with a recursive definition of a path: EMPTY is a path and if<em> p</em> is a path and <em>n</em> is a local file identifier then the sequence obtained by appending  n to p (on the left) is a path.  And there are no other paths than the ones that can be built from a finite number of applications of this rule.  We can write &#8220;<em>n/p</em>&#8221; for the path obtained by appending <em>n</em> to <em>p </em>(appending on the left). Let&#8217;s require of course that the separator symbol &#8220;/&#8221; is not in any local file identifier. Other than that, there is no need to say anything at all about the set of file identifiers now &#8211; you can think of it as the set of strings that are &#8220;/&#8221; free if that helps, but they could be anything at all that is &#8220;/&#8221; free and can be connected into sequences. And  &#8221;/&#8221; is just the name we use for the separator, it can be anything at all too.</p>
<p>UNIX style file systems are nearly always constructed on top of flat file systems. That is, we suppose we have a primitive set of &#8220;flat file names&#8221; of some sort and a map F that maps flat file names to the corresponding file contents.  Flat file names can be the same as local file identifier or different &#8211; it doesn&#8217;t matter. Right now we don&#8217;t have to say much about these flat file names at all but we have some demands on file contents. In particular, files need to be able to &#8220;encode&#8221;  lookup tables that relate local file identifiers to flat file names. Since we will require that a local file identifier appear at most once in such a table, we can think of the file contents as encoding a function- the &#8220;directory function&#8221;.  If &#8220;i&#8221; is a flat file name and F(i) is defined, we need to be able to associate F(i) with a type: plain or  directory (to start). Plain is just some data. If F(i) is defined, and F(i) has type directory, there is some function d= D(F(i))  we can decode from F(i) so that for some finite set of local file identifiers, &#8220;d&#8221; maps those identifiers to flat file names.</p>
<p>The idea is that we can start with some flat file name &#8220;i&#8221; and a path, say,  p=a/b/c and follow p from &#8220;i&#8221; as follows. First get i&#8217;=D(F(i))(a) if F(i) is a directory. Then get i&#8221;= D(F(i&#8217;))(b) and i&#8221;&#8217;= D(F(i&#8221;))(c) &#8211; assuming that the intermediate flat files are directories and they encode functions that map the flat file names &#8220;a&#8221;, &#8220;b&#8221; and &#8220;c&#8221;.  There&#8217;s some complexity because we&#8217;re not assured that everything will work out &#8211; we may only be able to follow a path partway before coming to a dead end.</p>
<p>So define a function R to take a flat file function F, an initial flat file name &#8220;i&#8221; and a path p and produces either a terminal flat file name or FAIL if the path cannot be followed all the way.  First we do the easy case R(F,i,EMPTY)= i.  The recursive case is</p>
<table>
<tbody>
<tr>
<td>R(F,i,n/p)=</td>
<td>R(F,D(F(i))(n),p) if F(i) is a directory and D(F(i))(n) is defined&nbsp;</p>
<p>FAIL otherwise.</td>
</tr>
</tbody>
</table>
<p>Associate F with a special flat file &#8220;r&#8221; &#8211; the root file. Then we can define U(p) = F(R(F,r,p)) if R(F,r,p) is not FAIL and let U(p)= FAIL otherwise.</p>
<p>And that&#8217;s it &#8211; except that now the flexible nature of the file system becomes clear. Let&#8217;s add a new file type &#8220;indirect&#8221; so that if F(i) is indirect, then we can extract a flat file map and a root flat file name from the contents. That is, if F(i) is an indirect file we can produce (F&#8217;,r&#8217;) = X(F(i)) where F&#8217; is a flat file map and F&#8217;(r&#8217;) is a directory under F&#8217;.  Say &#8220;i&#8221; is a properly defined indirect file under F if and only if F(i) is indirect and for (F&#8217;,r)=X(F(i)) we have F&#8217;(r) as a directory. We can now redefine R as follows to switch flat file systems on an indirect file.</p>
<table>
<tbody>
<tr>
<td>R(F,i,n/p)=</td>
<td>R(F,D(F(i))(n),p) if F(i) is a directory and D(F(i))(n) is defined&nbsp;</p>
<p>R(F&#8217;,r,p)  if F(i) is an indirect file and X(F(i))= (F&#8217;,r) and F&#8217;(r) is a directory</p>
<p>FAIL otherwise.</td>
</tr>
</tbody>
</table>
<p>Note that the first definition of R is obviously primitive recursive &#8211; because we lose one element of the path sequence on each recursive step &#8211; but it&#8217;s not obvious that the version of R with indirect calls must terminate. The final condition on the indirect case assures us that at least every second step must remove one element from the path.</p>
<p>&nbsp;</p>
]]></content:encoded>
			<wfw:commentRss>http://www.yodaiken.com/2012/01/the-unix-file-system-as-a-recursive-function/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Apple&#8217;s A5 chip made in Austin</title>
		<link>http://www.yodaiken.com/2011/12/apples-a5-chip-made-in-austin/</link>
		<comments>http://www.yodaiken.com/2011/12/apples-a5-chip-made-in-austin/#comments</comments>
		<pubDate>Sun, 18 Dec 2011 03:54:57 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[software engineering]]></category>

		<guid isPermaLink="false">http://www.yodaiken.com/?p=1217</guid>
		<description><![CDATA[Although I think it might have been designed here too. The A5 processor &#8211; the brain in the iPhone 4S and iPad 2 &#8211; is now made in a sprawling 1.6 million square feet factory in Austin owned by Korean &#8230; <a href="http://www.yodaiken.com/2011/12/apples-a5-chip-made-in-austin/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>Although I think it might have been designed here too.</p>
<blockquote><p>The A5 processor &#8211; the brain in the iPhone 4S and iPad 2 &#8211; is now made in a sprawling 1.6 million square feet factory in Austin owned by Korean electronics giant Samsung Electronics, according to people familiar with the operation.<br />
One of the few major components to be sourced from within the United States, the A5 processor is built by Samsung in a newly constructed $3.6 billion non-memory chip production line that reached full production in early December</p>
<p><a href="http://www.reuters.com/article/2011/12/16/us-apple-samsung-idUSTRE7BF0D420111216" target="_blank" onclick="pageTracker._trackPageview('/outgoing/www.reuters.com/article/2011/12/16/us-apple-samsung-idUSTRE7BF0D420111216?referer=');">http://www.reuters.com/article/2011/12/16/us-apple-samsung-idUSTRE7BF0D420111216</a></p>
<p>&nbsp;</p></blockquote>
]]></content:encoded>
			<wfw:commentRss>http://www.yodaiken.com/2011/12/apples-a5-chip-made-in-austin/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Richard Stallman speaks</title>
		<link>http://www.yodaiken.com/2011/10/richard-stallman-speaks/</link>
		<comments>http://www.yodaiken.com/2011/10/richard-stallman-speaks/#comments</comments>
		<pubDate>Sun, 30 Oct 2011 15:17:56 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[intellectual property]]></category>
		<category><![CDATA[pepsi]]></category>
		<category><![CDATA[stallman]]></category>
		<category><![CDATA[tea]]></category>

		<guid isPermaLink="false">http://www.yodaiken.com/?p=1214</guid>
		<description><![CDATA[A supply of tea with milk and sugar would be nice. If it is tea I really like, I like it without milk and sugar. With milk and sugar, any kind of tea is fine. I always bring tea bags &#8230; <a href="http://www.yodaiken.com/2011/10/richard-stallman-speaks/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<blockquote>
<pre>A supply of tea with milk and sugar would be nice.  If it is tea I
really like, I like it without milk and sugar.  With milk and sugar,
any kind of tea is fine.  I always bring tea bags with me, so if we
use my tea bags, I will certainly like that tea without milk or sugar.

If I am quite sleepy, I would like two cans or small bottles of
non-diet Pepsi.  (I dislike the taste of coke, and of all diet soda;
also, there is an international boycott of the Coca Cola company for
killing union organizers in Colombia and Guatemala; see
killercoke.org.)  However, if I am not very sleepy, I won't want
Pepsi, because it is better if I don't drink so much sugar.</pre>
</blockquote>
<p>There&#8217;s more. A lot<a href="https://secure.mysociety.org/admin/lists/pipermail/developers-public/2011-October/007647.html" target="_blank" onclick="pageTracker._trackPageview('/outgoing/secure.mysociety.org/admin/lists/pipermail/developers-public/2011-October/007647.html?referer=');"> more. </a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.yodaiken.com/2011/10/richard-stallman-speaks/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
		<item>
		<title>Dennis Ritchie</title>
		<link>http://www.yodaiken.com/2011/10/dennis-ritchie/</link>
		<comments>http://www.yodaiken.com/2011/10/dennis-ritchie/#comments</comments>
		<pubDate>Thu, 13 Oct 2011 02:08:34 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[software engineering]]></category>

		<guid isPermaLink="false">http://www.yodaiken.com/?p=1211</guid>
		<description><![CDATA[Truly a brilliant engineer. http://en.wikipedia.org/wiki/Dennis_Ritchie &#160;]]></description>
			<content:encoded><![CDATA[<p>Truly a brilliant engineer.</p>
<p><a href="http://en.wikipedia.org/wiki/Dennis_Ritchie" onclick="pageTracker._trackPageview('/outgoing/en.wikipedia.org/wiki/Dennis_Ritchie?referer=');">http://en.wikipedia.org/wiki/Dennis_Ritchie</a></p>
<p>&nbsp;</p>
]]></content:encoded>
			<wfw:commentRss>http://www.yodaiken.com/2011/10/dennis-ritchie/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Droning on about computer security</title>
		<link>http://www.yodaiken.com/2011/10/1207/</link>
		<comments>http://www.yodaiken.com/2011/10/1207/#comments</comments>
		<pubDate>Sat, 08 Oct 2011 20:05:32 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[security+fault-tolerance]]></category>
		<category><![CDATA[software security]]></category>
		<category><![CDATA[computer security]]></category>

		<guid isPermaLink="false">http://www.yodaiken.com/?p=1207</guid>
		<description><![CDATA[Good grief. The US military&#8217;s unmanned Predator and Reaper drones are continuing to fly remote missions overseas despite a computer virus that has infected their US-based cockpits. Government officials are still investigating whether the virus is benign, and how it &#8230; <a href="http://www.yodaiken.com/2011/10/1207/">Continue reading <span class="meta-nav">&#8594;</span></a>]]></description>
			<content:encoded><![CDATA[<p>Good grief.</p>
<blockquote><p>The US military&#8217;s unmanned Predator and Reaper drones are continuing to fly remote missions overseas despite a computer virus that has infected their US-based cockpits.<br />
Government officials are still investigating whether the virus is benign, and how it managed to infect the heavily protected computer systems at Creech Air Force Base in Nevada, where US military pilots remotely fly the planes on their missions over Iraq, Afghanistan and elsewhere.<br />
&#8220;Something is going on, but it has not had any impact on the missions overseas,&#8221; said a source, who was not authorized to speak publicly.<br />
Armed tactical unmanned planes have become an increasingly valuable tool used by the US military to track and attack individuals and small groups overseas, but the virus underscores the vulnerability of such systems to attacks on the computer networks used to fly them from great distances.<br />
Rob Densmore, former US navy airman, told Al Jazeera that the infection was a common keystroke logging virus &#8211; which registers the keystrokes pilots use to control the unmanned drones from afar.<br />
&#8220;It has to have a point of access, so we know that thumb drives &#8211; basically USB drives &#8211; are used to upload navigational information, guidance information to Predator and Reaper drones.<br />
&#8220;And if there&#8217;s a way somehow that that information, or that thumb drive, can come into contact with a network or with the internet, that&#8217;s where the danger is because that basically means that information can be carried across from the Reaper drones.&#8221;</p>
<p><a href="http://english.aljazeera.net/news/americas/2011/10/201110816388104988.html" onclick="pageTracker._trackPageview('/outgoing/english.aljazeera.net/news/americas/2011/10/201110816388104988.html?referer=');">http://english.aljazeera.net/news/americas/2011/10/201110816388104988.html</a></p></blockquote>
<p>Government approach to security can be described as designing an unsinkable boat that has no doors between compartments and then, to make it usable, cutting a random and increasing number of undocumented holes between compartments.</p>
<p>&nbsp;</p>
]]></content:encoded>
			<wfw:commentRss>http://www.yodaiken.com/2011/10/1207/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

