<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="wordpress/2.1.3" -->
<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/"
	>

<channel>
	<title>Euri.ca Blog</title>
	<link>http://euri.ca/blog</link>
	<description>it's a blog</description>
	<pubDate>Mon, 12 Apr 2010 05:37:50 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.1.3</generator>
	<language>en</language>
			<item>
		<title>New code: Super Simple Life Tracker</title>
		<link>http://euri.ca/blog/2010/04/12/new-code-super-simple-life-tracker/</link>
		<comments>http://euri.ca/blog/2010/04/12/new-code-super-simple-life-tracker/#comments</comments>
		<pubDate>Mon, 12 Apr 2010 05:37:50 +0000</pubDate>
		<dc:creator>Dave</dc:creator>
		
		<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://euri.ca/blog/2010/04/12/new-code-super-simple-life-tracker/</guid>
		<description><![CDATA[Super Simple Life Tracker is a bit of code that merges together RSS feeds into a nice little sidebar.
]]></description>
			<content:encoded><![CDATA[<p><a href="http://euri.ca/code/SuperSimpleLifeTracker/">Super Simple Life Tracker</a> is a bit of code that merges together RSS feeds into a nice little sidebar.</p>
]]></content:encoded>
			<wfw:commentRss>http://euri.ca/blog/2010/04/12/new-code-super-simple-life-tracker/feed/</wfw:commentRss>
		</item>
		<item>
		<title>NeverBored&#8217;s ThreadBound</title>
		<link>http://euri.ca/blog/2009/06/17/neverboreds-threadbound/</link>
		<comments>http://euri.ca/blog/2009/06/17/neverboreds-threadbound/#comments</comments>
		<pubDate>Wed, 17 Jun 2009 05:40:13 +0000</pubDate>
		<dc:creator>Dave</dc:creator>
		
		<category><![CDATA[links]]></category>

		<guid isPermaLink="false">http://euri.ca/blog/2009/06/17/neverboreds-threadbound/</guid>
		<description><![CDATA[Congrats NeverBored Studio on releasing ThreadBound.
]]></description>
			<content:encoded><![CDATA[<p>Congrats NeverBored Studio on <a href="http://www.neverboredstudios.com/?p=57">releasing ThreadBound</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://euri.ca/blog/2009/06/17/neverboreds-threadbound/feed/</wfw:commentRss>
		</item>
		<item>
		<title>nsfw tag considered harmful</title>
		<link>http://euri.ca/blog/2009/06/14/nsfw-tag-considered-harmful/</link>
		<comments>http://euri.ca/blog/2009/06/14/nsfw-tag-considered-harmful/#comments</comments>
		<pubDate>Sun, 14 Jun 2009 22:11:36 +0000</pubDate>
		<dc:creator>Dave</dc:creator>
		
		<category><![CDATA[misc]]></category>

		<category><![CDATA[long rambling stories]]></category>

		<guid isPermaLink="false">http://euri.ca/blog/2009/06/14/nsfw-tag-considered-harmful/</guid>
		<description><![CDATA[Recently I read a proposal for a NSFW (not safe for work) tag, and I liked the idea for a few minutes but I&#8217;ve disliked it ever since.  The most-discussed problem with a &#60;nsfw&#62; tag is the cultural specificity of what&#8217;s safe and unsafe for your work environment, for example could you watch South [...]]]></description>
			<content:encoded><![CDATA[<p>Recently I read a <a href="http://www.w3.org/Bugs/Public/show_bug.cgi?id=6999">proposal</a> for a NSFW (not safe for work) tag, and I liked the idea for a few minutes but I&#8217;ve disliked it ever since.  The <a href="http://www.zeldman.com/2009/06/08/not-safe-for-work-tag-in-html-5/?dzref=192802">most-discussed</a> problem with a &lt;nsfw&gt; tag is the cultural specificity of what&#8217;s safe and unsafe for your work environment, for example could you watch South Park.</p>
<p>I really see the biggest problem as where the NSFW bit should live, in the link or in the content. Probably everything on www.dirtynastypicturesofhorriblethings.com is unsafe for work, so it&#8217;d be easiest to send a X-NSFW header to every http request, and the browser could display an &#8220;Are you sure you want to see nsfw content?&#8221; prompt before showing the page.  However the cultural question is much easier, if you consider it to mean &#8220;This link is considerably less work safe than the content around it.&#8221;  In that a link to fark.com might be nsfw if it&#8217;s coming from the Wall Street Journal, and then a link from fark.com could itself be nsfw if it linked to nudity.  </p>
<p>Generally though, I think it&#8217;s the wrong solution.  I really want an attribute on links to say &#8220;this link opens a PDF,&#8221; because in so many environments, starting Adobe Reader is tantamount to crashing the machine, but the correct solution is for the browser to warn me and handle it correctly (which is what my machines do).  And that is even easier in that compliance wouldn&#8217;t be voluntary, a nsfw tag would still leave you victim to pranksters and lazy posters (which judging by the sheer number of lolcats is just about all of us).  Worst of all, the scenario this proposal is trying to solve is &#8220;I want to browse the web at work and not get in trouble,&#8221; so I don&#8217;t really see any buy-in from corporations since it&#8217;s a pretty tough sell as a new &#8220;feature&#8221;.</p>
<p>There is a lot of opportunity to <a href="http://betterdot.wordpress.com/2009/05/15/the-road-to-the-semantic-web-is-paved-with-microformats/">enrich the machine understanding</a> of web communications,  but I really think this problem is probably best addressed with some kind of clever browser plugin &#8212; most search engines sensor their results, a starting point might be to show a warning if your link wouldn&#8217;t show up in censored results.</p>
<p>Edit: An obvious (but the kind of clever obvious that you miss) pair of points from <a href="http://www.reddit.com/r/programming/comments/8sfb6/nsfw_tag_in_html_5/">reddit</a>:</p>
<ul>
<li>From jamt9000, this can already be done on a website level, by just using a class=&#8221;nsfw&#8221;, if it catches on, browsers will support it without any new standards.</li>
<li>And naner points out that much of the actual nsfw images are advertisements (probably since they need to attract attention) which would break any voluntary proposal</li>
</ul>
]]></content:encoded>
			<wfw:commentRss>http://euri.ca/blog/2009/06/14/nsfw-tag-considered-harmful/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Trying to Game Swoopo, dagnabit</title>
		<link>http://euri.ca/blog/2009/05/27/trying-to-game-swoopo-dagnabit/</link>
		<comments>http://euri.ca/blog/2009/05/27/trying-to-game-swoopo-dagnabit/#comments</comments>
		<pubDate>Wed, 27 May 2009 07:14:23 +0000</pubDate>
		<dc:creator>Dave</dc:creator>
		
		<category><![CDATA[data]]></category>

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

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

		<category><![CDATA[kinda maybe funny]]></category>

		<guid isPermaLink="false">http://euri.ca/blog/2009/05/27/trying-to-game-swoopo-dagnabit/</guid>
		<description><![CDATA[Casinos love guys with systems.
Jeff Atwood and Ted Dzubia both hate Swoopo, so it&#8217;s roughly as bad as PHP.  A quick overview: &#8220;auctions&#8221; start at $0.00 and each bid raises the price by pennies, the time remaining in the auction by 10 seconds and costs the bidder 75 cents to place.
If you can get [...]]]></description>
			<content:encoded><![CDATA[<blockquote><p>Casinos love guys with systems.</p></blockquote>
<p><a href="http://www.codinghorror.com/blog/archives/001261.html">Jeff Atwood</a> and <a href="http://www.theregister.co.uk/2009/01/02/swoopo_startrup/">Ted Dzubia</a> both hate Swoopo, so it&#8217;s roughly as bad as PHP.  A quick overview: &#8220;auctions&#8221; start at $0.00 and each bid raises the price by pennies, the time remaining in the auction by 10 seconds and <b>costs the bidder 75 cents</b> to place.</p>
<p>If you can get the last bid in (and you only place a few), you can pick up a $1000 laptop for $30.  I mostly ignored Swoopo until Joshua Stein <a href="http://jcs.org/notaweblog/2009/03/06/trying_to_game_swoopo_com/">tried to game it</a>.  He was thwarted by HTTP requests not being accurate to the sub-second (since Swoopo gives ties to the users who waste money on automatic bidding), and determined that bidding was indistinguishable from gambling.</p>
<p>But I&#8217;m not convinced it can&#8217;t be gamed, the key being that you want to game it with high probability rather than win any one auction.</p>
<p>Just as a first pass, I think you want to find auctions where:</p>
<ul>
<li>Several are closing at the same time - so there&#8217;s less competition
<li>At a particular time of the day - same reason
<li>Only auctions for $500+ items selling for more than 90% off, so any accidental purchases can be safely sold at a profit (I don&#8217;t want to bother reselling DVDs)
</ul>
<p>So I used a greasemonkey script to download the last 10 000 winners into a spreadsheet.</p>
<p>Quick facts:</p>
<ul>
<li>9904 auctions were won by 4217 distinct users (7 by phone)
<li>The average savings (vs the suggested price) was %65,  although in 35 users paid more than the suggested price
<li>2853 auctions were open only to manual bidders, rather than the automatic bidbutler (the difference in savings %66 vs %66 isn&#8217;t significant).
<li>Wins are spaced fairly evenly throughout the 24 hour clock
<li>The average winner placed ~95 bids, thousands are not uncommon, one &#8220;winner&#8221; placed <a href="http://www.swoopo.com/auction/apple-imac-mb419ll-a-24-inch-desktop/173450.html">2623 bids</a>
<li>Roughly one in ten auction winners placed only 1 or 2 bids.
</ul>
<p>Clearly the last point hints that it&#8217;s possible to win by sniping at the last minute.</p>
<p>Roughly 1 in 8 auctions was for items valued at more than $500, and won for less than 20% of the suggested price.  &#8220;Winners&#8221; used an average of 311 bids &#8212; that doesn&#8217;t look good.</p>
<p>Next step, crack out the R.</p>
<p>Source: <a href='http://euri.ca/wordpress/wp-content/uploads/2009/05/swoopo3.zip' title='Swoopo dataset 3'>Swoopo dataset 3</a></p>
]]></content:encoded>
			<wfw:commentRss>http://euri.ca/blog/2009/05/27/trying-to-game-swoopo-dagnabit/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Fun facts</title>
		<link>http://euri.ca/blog/2009/03/25/fun-facts/</link>
		<comments>http://euri.ca/blog/2009/03/25/fun-facts/#comments</comments>
		<pubDate>Thu, 26 Mar 2009 05:29:52 +0000</pubDate>
		<dc:creator>Dave</dc:creator>
		
		<category><![CDATA[misc]]></category>

		<guid isPermaLink="false">http://euri.ca/blog/2009/03/25/fun-facts/</guid>
		<description><![CDATA[While comments were on, this blog received 43000 spam comments, and 2 real ones.
Now that Ultrasaur is part of the BizSpark program, I have a fully legal copy of Quickbasic 4.5 realizing the dreams of my 10 year old self.
]]></description>
			<content:encoded><![CDATA[<p>While comments were on, this blog received 43000 spam comments, and 2 real ones.</p>
<p>Now that <a href="http://ultrasaur.us">Ultrasaur</a> is part of the BizSpark program, I have a fully legal copy of <a href="http://en.wikipedia.org/wiki/QuickBASIC">Quickbasic 4.5</a> realizing the dreams of my 10 year old self.</p>
]]></content:encoded>
			<wfw:commentRss>http://euri.ca/blog/2009/03/25/fun-facts/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Working on Ultrasaur.</title>
		<link>http://euri.ca/blog/2009/02/10/working-on-ultrasaur/</link>
		<comments>http://euri.ca/blog/2009/02/10/working-on-ultrasaur/#comments</comments>
		<pubDate>Tue, 10 Feb 2009 15:56:11 +0000</pubDate>
		<dc:creator>Dave</dc:creator>
		
		<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://euri.ca/blog/2009/02/10/working-on-ultrasaur/</guid>
		<description><![CDATA[Both my readers are probably aware, all my mental energies are going into Ultrasaur Records Management.
]]></description>
			<content:encoded><![CDATA[<p>Both my readers are probably aware, all my mental energies are going into <a href="http://ultrasaur.us">Ultrasaur Records Management</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://euri.ca/blog/2009/02/10/working-on-ultrasaur/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Bush: Too cerebral for his own good.</title>
		<link>http://euri.ca/blog/2008/12/27/bush-too-cerebral-for-his-own-good/</link>
		<comments>http://euri.ca/blog/2008/12/27/bush-too-cerebral-for-his-own-good/#comments</comments>
		<pubDate>Sat, 27 Dec 2008 11:41:29 +0000</pubDate>
		<dc:creator>Dave</dc:creator>
		
		<category><![CDATA[misc]]></category>

		<guid isPermaLink="false">http://euri.ca/blog/2008/12/27/bush-too-cerebral-for-his-own-good/</guid>
		<description><![CDATA[History (and Karl Rove) have judged him, and it seems George Bush&#8217;s legacy will be one of too little action and too much reading.  According to an article in yesterday&#8217;s Wall Street Journal, the 43rd president reads an average of over 500 hours every year (that&#8217;s 12-13 weeks of 9-5 full time reading, more [...]]]></description>
			<content:encoded><![CDATA[<p>History (and Karl Rove) have judged him, and it seems George Bush&#8217;s legacy will be one of too little action and too much reading.  According to <a href="http://online.wsj.com/article/SB123025595706634689.html">an article in yesterday&#8217;s Wall Street Journal</a>, the 43rd president reads an average of over 500 hours every year (that&#8217;s 12-13 weeks of 9-5 full time reading, more if you have a paid lunch).</p>
<p>Apart from reading &#8220;Team of Rivals&#8221; back in 2005 (before it was cool), in 2006 he breezed through the two-and-a-half pound &#8220;A History of the English Speaking Peoples Since 1900&#8243; before some light Camus in the bathtub.  Assuming that Karl Rove and the Wall Street Journal are to be trusted and that 2006 through 2008 weren&#8217;t wildly atypical years, over his presidency, Bush read approximately:</p>
<ul>
<li><strong>496 books</strong> (62 a year, 99.8% of which were not written by family members)
<li><strong>246,000 pages</strong> (roughly 31,000 a year)
<li>over <strong>4,100 hours</strong> (assuming that a Yalie reads at about 1 page a minute)
<li>over <strong>100 work weeks</strong>
</ul>
<p>So next time you&#8217;re upset that Bush is only <a href="http://www.foxnews.com/story/0,2933,98006,00.html">&#8220;glanc[ing] at the headlines just to kind of a flavor for what&#8217;s moving&#8221;</a>, cut the man some slack. Who else is going to read eleven-hundred page definitive histories of the Spanish Civil War? John Bolton?  Sarah Palin?</p>
<p>Note: All numbers are available in this <a href='http://euri.ca/wordpress/wp-content/uploads/2008/12/bush-reading.xls' title='raw numbers'>spreadsheet</a>, please point out any errors.  All page counts are from Amazon.com.  Note that I haven&#8217;t included any numbers for &#8220;each year, the president also read the Bible from cover to cover&#8221; which could add as much as 16,000 pages to the total.</p>
]]></content:encoded>
			<wfw:commentRss>http://euri.ca/blog/2008/12/27/bush-too-cerebral-for-his-own-good/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Wow, Google Chart API</title>
		<link>http://euri.ca/blog/2008/11/08/wow-google-chart-api/</link>
		<comments>http://euri.ca/blog/2008/11/08/wow-google-chart-api/#comments</comments>
		<pubDate>Sat, 08 Nov 2008 23:11:36 +0000</pubDate>
		<dc:creator>Dave</dc:creator>
		
		<category><![CDATA[misc]]></category>

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

		<category><![CDATA[thought of the day]]></category>

		<guid isPermaLink="false">http://euri.ca/blog/2008/11/08/wow-google-chart-api/</guid>
		<description><![CDATA[Note to self, Google Chart API is awesome.
]]></description>
			<content:encoded><![CDATA[<p>Note to self, <a href="http://code.google.com/apis/chart/types.html">Google Chart API</a> is awesome.</p>
]]></content:encoded>
			<wfw:commentRss>http://euri.ca/blog/2008/11/08/wow-google-chart-api/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Understanding Traffic on the 401, pt 1.</title>
		<link>http://euri.ca/blog/2008/10/31/understanding-traffic-on-the-401-pt-1/</link>
		<comments>http://euri.ca/blog/2008/10/31/understanding-traffic-on-the-401-pt-1/#comments</comments>
		<pubDate>Fri, 31 Oct 2008 15:45:36 +0000</pubDate>
		<dc:creator>Dave</dc:creator>
		
		<category><![CDATA[misc]]></category>

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

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

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

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

		<category><![CDATA[long rambling stories]]></category>

		<guid isPermaLink="false">http://euri.ca/blog/2008/10/31/understanding-traffic-on-the-401-pt-1/</guid>
		<description><![CDATA[The Government of Ontario runs a fantastic service to monitor the state of traffic jams on the 401: COMPASS Freeway Traffic Management System.  So the obvious question becomes, when should I drive home?
Step 1: Get some data
First I ran a cronjob on the server hosting ultrasaur.us, that basically recorded the state of the various [...]]]></description>
			<content:encoded><![CDATA[<p>The Government of Ontario runs a fantastic service to monitor the state of traffic jams on the 401: <a href="http://www.mto.gov.on.ca/english/traveller/compass/camera/pictures/trafficmaps/trafficmap.htm">COMPASS Freeway Traffic Management System</a>.  So the obvious question becomes, when should I drive home?</p>
<p>Step 1: Get some data</p>
<p>First I ran a cronjob on the server hosting <a href="http://ultrasaur.us">ultrasaur.us</a>, that basically recorded the state of the various stretches of road.  It&#8217;s been running a few days now, and after 14000 readings, there seem to be the following states for a stretch of road (with counts):</p>
<ul>
<li>Express and collector moving slowly	(423)
<li>Express and Collector moving well	(7055)
<li>Express and collector very slow	(85)
<li>Express moving slowly. Collector moving well	(205)
<li>Express moving slowly. Collector N/A	(49)
<li>Express moving slowly. Collector very slow	(138)
<li>Express moving well.&nbsp;&nbsp;Collector N/A	(1236)
<li>Express moving well. Collector moving slowly	(435)
<li>Express moving well. Collector N/A	(271)
<li>Express moving well. Collector very slow	(48)
<li>Express N/A.&nbsp;&nbsp;Collector moving well.	(1241)
<li>Express N/A. Collector moving slowly	(129)
<li>Express N/A. Collector moving well	(421)
<li>Express N/A. Collector very slow	(43)
<li>Express very slow. Collector moving slowly	(45)
<li>Express very slow. Collector moving well	(14)
<li>Express very slow. Collector N/A	(75)
<li>Moving slowly	(122)
<li>Moving well	(795)
<li>N/A	(1198)
</ul>
<p>Notice that there are some near duplicates with double spaces after a period &#8212; I&#8217;ll convert multiple spaces into singles.</p>
<p>Next I needed to give all of these a value, based on my back of the envelop calculations well means 80+, slowly means 50-80 and very slow means 0 to 50.  </p>
<p>Caveats and thoughts:</p>
<ul>
<li>the values can&#8217;t be exactly calculated, so I&#8217;m not going to try,
<li>one important thing that I want to do is map each status to a unique value so that I don&#8217;t lose any data.  The key is that the values be in order
<li>you can see that I&#8217;m biased towards the expressway
</ul>
<p>So values represent the proportional time it takes to travel over a stretch of road (ie higher is worse):</p>
<ul>
<li><b>100</b>: Moving well
<li><b>101</b>: Express and Collector moving well
<li><b>130</b>: Express N/A. Collector moving well
<li><b>150</b>: Express moving well. Collector moving slowly
<li><b>160</b>: Express moving well. Collector N/A
<li><b>170</b>: Express moving slowly. Collector moving well
<li><b>180</b>: Express moving well. Collector very slow
<li><b>200</b>: Moving slowly
<li><b>201</b>: Express and collector moving slowly
<li><b>210</b>: Express N/A. Collector moving slowly
<li><b>250</b>: Express moving slowly. Collector N/A
<li><b>380</b>: Express moving slowly. Collector very slow
<li><b>410</b>: Express very slow. Collector moving well
<li><b>460</b>: Express very slow. Collector moving slowly
<li><b>501</b>: Express very slow. Collector N/A
<li><b>500</b>: Express and collector very slow
<li><b>510</b>: Express N/A. Collector very slow
<li><b>null</b>: N/A (I&#8217;m willing to extrapolate a guess at the other N/A&#8217;s, but not here)
</ul>
<p>So this gives me the first chance to make a graph, just over my first 14000 points, here&#8217;s the average state of the 401 Westbound over the 24 hours in a day (over a Monday-Wednesday):</p>
<p><img src='http://euri.ca/wordpress/wp-content/uploads/2008/10/wb401.png' alt='Westboud 401 travel times (higher is worse)' width="100%"/></p>
<p>The worst time to drive is 4-5pm, but the three hours from 3pm to 6pm seem to be the worst.  That&#8217;s not much of a surprise (although it&#8217;s an hour or so sooner than I expected rush hour to start), but that evening rush hour is so much worse than morning rush hour is a bit of a shock.  That 1pm is such a slow time is curious too, I wonder if that bump will go away with more data.</p>
<p>(Data is available to anyone who <a href="mailto:dave@euri.ca">contacts me</a>, it&#8217;ll eventually be available for download)</p>
]]></content:encoded>
			<wfw:commentRss>http://euri.ca/blog/2008/10/31/understanding-traffic-on-the-401-pt-1/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Why computer security scares me</title>
		<link>http://euri.ca/blog/2008/10/26/why-computer-security-scares-me/</link>
		<comments>http://euri.ca/blog/2008/10/26/why-computer-security-scares-me/#comments</comments>
		<pubDate>Mon, 27 Oct 2008 01:39:25 +0000</pubDate>
		<dc:creator>Dave</dc:creator>
		
		<category><![CDATA[misc]]></category>

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

		<guid isPermaLink="false">http://euri.ca/blog/2008/10/26/why-computer-security-scares-me/</guid>
		<description><![CDATA[Disclaimer: Any of the security articles on this site, no matter how juicy the titles, are about white-hat work.  If anyone learns anything useful for attacking servers from me, it&#8217;s because they are really, really bad at googling.
I&#8217;m not a paranoid person, I rarely lock my doors.  Even with computers, many of my [...]]]></description>
			<content:encoded><![CDATA[<p><i>Disclaimer: Any of the security articles on this site, no matter how juicy the titles, are about white-hat work.  If anyone learns anything useful for attacking servers from me, it&#8217;s because they are really, really bad at googling.</i></p>
<p>I&#8217;m not a paranoid person, I rarely lock my doors.  Even with computers, many of my passwords are &#8220;password&#8221; and I believe in backups not preventative security for 90% of my personal files.  Still, I&#8217;m passionate about *being able* to secure systems.</p>
<p><b>Computer security is hard.</b>  It&#8217;s hard enough to write software that works 100% of the time for users who desperately want it to work, malicious users are another kettle of fish.  It&#8217;s far too easy to just claim to be &#8220;concerned&#8221; about security, and then do nothing but hope for the best.</p>
<p><b>The attackers are machines.</b>  Back in college I had a machine exposed to the internet for a few days and it was turned into an FTP server for pirated movies in under a week.  There was nothing special about my machine, the pirates were likely just constantly cycling through IP addresses looking for an unprotected machine.  The idea that there are evil machines on the internet who spend 24 hours a day trying exploits against every server they can find is 2 parts scary and 3 parts science-fiction-style-creepy.</p>
<p><b>Long odds aren&#8217;t a defense</b>  Every so often, I&#8217;ll figure out an attack that&#8217;ll require an annoyingly specific set of circumstances.  It really takes the thunder out of it to explain that <b>if</b> you were running IE6 on Windows 98 on Tuesday in the rain, I could totally sniff your passwords.  It&#8217;s tempting to think that if only one in a thousand machines is vulnerable to an attack, no-one will bother.  Just like how the low response rate to spam emails means that no-one bothers sending them.</p>
]]></content:encoded>
			<wfw:commentRss>http://euri.ca/blog/2008/10/26/why-computer-security-scares-me/feed/</wfw:commentRss>
		</item>
	</channel>
</rss>
