<?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>Sid Roberts</title>
	<atom:link href="http://www.sidroberts.co.uk/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.sidroberts.co.uk</link>
	<description>Well, hello there! This is the site of Sid Roberts - a web developer in Leeds, England. I'm a 16-year old high school student studying Computing, Mathematics (Mechanics), Further Maths and Economics.</description>
	<lastBuildDate>Sat, 30 Jan 2010 15:49:22 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
		<item>
		<title>How To Memorize A Card In A Deck</title>
		<link>http://www.sidroberts.co.uk/2009/10/09/how-to-memorize-a-card-in-a-deck/</link>
		<comments>http://www.sidroberts.co.uk/2009/10/09/how-to-memorize-a-card-in-a-deck/#comments</comments>
		<pubDate>Fri, 09 Oct 2009 20:04:39 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Card Counting]]></category>
		<category><![CDATA[memory]]></category>
		<category><![CDATA[playing cards]]></category>
		<category><![CDATA[rain man]]></category>
		<category><![CDATA[trick]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=243</guid>
		<description><![CDATA[Despite the lack of sleep (I’ve been up for almost 24 hours), I’ve devised a fairly simple way to memorize a single card within a deck. It comes in the form a little trick you can play on friends into fooling them that you can count cards like Rain Man. It actually works with simple [...]]]></description>
			<content:encoded><![CDATA[<p>Despite the lack of sleep (I’ve been up for almost 24 hours), I’ve devised a fairly simple way to memorize a single card within a deck. It comes in the form a little trick you can play on friends into fooling them that you can count cards like Rain Man. It actually works with simple addition so most people should be able to do it with a little practise.</p>
<p>By applying a unique value to each rank (Ace, 2, 3, 4, 5, and so on), you can determine the total value of the entire deck:</p>
<table>
<tr>
<th>Card</th>
<th>Value</th>
</tr>
<tr>
<td>Ace</td>
<td>1</td>
</tr>
<tr>
<td>2</td>
<td>2</td>
</tr>
<tr>
<td>3</td>
<td>3</td>
</tr>
<tr>
<td>4</td>
<td>4</td>
</tr>
<tr>
<td>5</td>
<td>5</td>
</tr>
<tr>
<td>6</td>
<td>6</td>
</tr>
<tr>
<td>7</td>
<td>7</td>
</tr>
<tr>
<td>8</td>
<td>8</td>
</tr>
<tr>
<td>9</td>
<td>9</td>
</tr>
<tr>
<td>10</td>
<td>10</td>
</tr>
<tr>
<td>Jack</td>
<td>11</td>
</tr>
<tr>
<td>Queen</td>
<td>12</td>
</tr>
<tr>
<td>King</td>
<td>13</td>
</tr>
</table>
<p><img class="fullSize wp-image-245" title="Total Value Of A Deck Of Cards" src="http://www.sidroberts.co.uk/wp-content/uploads/2009/10/deck-of-cards-total.png" alt="Using the sum of 1 through to 13, the value of each suit is 91, and therefore the entire deck's value is 364." width="731" height="78" /></p>
<p>Knowing that the entire deck equates to 364, by removing any one card, the deck’s value will lower by the value of that card. For example, if an Ace (1) is removed, the deck’s value will fall to 363.</p>
<p>So by getting a friend to remove a card, you can determine their card by simply adding the remaining cards. It takes a few minutes and will only tell you the rank of the card, not the suit, so it’s probably best to run through the deck again and take out the remaining three cards of that rank to “prove” you know what card they had. This trick works a treat but you can very easily mess up your count, so be sure to take your time otherwise you may end up with the wrong card.</p>
<p>If that’s too easy, you can always make things a little more difficult by applying a unique value based on the bumps/points its suit has:</p>
<table>
<tr>
<th>Suit</th>
<th>Points/Bumps</th>
</tr>
<tr>
<td>Spades</td>
<td>1</td>
</tr>
<tr>
<td>Hearts</td>
<td>2</td>
</tr>
<tr>
<td>Clubs</td>
<td>3</td>
</tr>
<tr>
<td>Diamonds</td>
<td>4</td>
</tr>
</table>
<p>In practise:</p>
<table>
<tr>
<th>Card</th>
<th>Value</th>
</tr>
<tr>
<td>Ace of Spades</td>
<td>1</td>
</tr>
<tr>
<td>Ace of Hearts</td>
<td>2</td>
</tr>
<tr>
<td>Ace of Clubs</td>
<td>3</td>
</tr>
<tr>
<td>Ace of Diamonds</td>
<td>4</td>
</tr>
<tr>
<td>2 of Spades</td>
<td>5</td>
</tr>
<tr>
<td>2 of Hearts</td>
<td>6</td>
</tr>
<tr>
<td>2 of Clubs</td>
<td>7</td>
</tr>
<tr>
<td>2 of Diamonds</td>
<td>8</td>
</tr>
</table>
<p>Note that with this system, the deck’s value will be 1378, as proven below:<br />
<img class="fullSize wp-image-246" title="Total Value Of A Deck Of Cards Where Each Card Is Unique" src="http://www.sidroberts.co.uk/wp-content/uploads/2009/10/deck-of-cards-total-unique.png" alt="Using the sum of 1 through to 52, the value is 1378." width="611" height="79" /></p>
<p>A simple method to memorize each card might be to minus 1 from the rank, multiply by 4, then add the bumps/points (for example: 4 of Diamonds is 3 multiplied by 4, add 4; this equals 16).</p>
<p>With both systems, it might be wise that whilst counting, to reset every time you hit 100 (for example: with a count of 96, a 6 would cause the running count to fall to 2 instead of 102). This way, keeping count should be a lot easier. Good luck.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2009/10/09/how-to-memorize-a-card-in-a-deck/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Notes From A Selector Engine</title>
		<link>http://www.sidroberts.co.uk/2009/09/05/notes-from-a-selector-engine/</link>
		<comments>http://www.sidroberts.co.uk/2009/09/05/notes-from-a-selector-engine/#comments</comments>
		<pubDate>Sat, 05 Sep 2009 20:55:45 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[querySelectorAll]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=239</guid>
		<description><![CDATA[As previously stated, I’ve recently been working on a selector engine. Unfortunately, as every browser behaves slightly differently, I’ve had to resort to constructing compatibility tables. Seeing as they can be useful in other applications, I thought I’d post it here: Element.querySelectorAll A browser-native selector engine that allows you to select element nodes based on [...]]]></description>
			<content:encoded><![CDATA[<p>As previously stated, I’ve recently been working on a selector engine. Unfortunately, as every browser behaves slightly differently, I’ve had to resort to constructing compatibility tables. Seeing as they can be useful in other applications, I thought I’d post it here:</p>
<h3><code><a href="https://developer.mozilla.org/En/DOM/Element.querySelectorAll" title="Element.querySelectorAll on Mozilla Developer Center">Element.querySelectorAll</a></code></h3>
<p>A browser-native selector engine that allows you to select element nodes based on a <acronym title="Cascading Style Sheet">CSS</acronym> selector (for example: <code>div p a</code>).</p>
<pre><code>var a = document.getElementById('a');

a.querySelectorAll('div.post > p a[class]');</code></pre>
<table>
<tr>
<th>IE6</th>
<th>IE7</th>
<th>IE8</th>
<th>Firefox 3</th>
<th>Firefox 3.5</th>
<th>Opera 9</th>
<th>Opera 10</th>
<th>Safari 3</th>
<th>Safari 4</th>
<th>Chrome 1</th>
<th>Chrome 2</th>
</tr>
<tr>
<td>no</td>
<td>no</td>
<td>no</td>
<td>no</td>
<td>yes</td>
<td>no</td>
<td>yes</td>
<td>no</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
</tr>
</table>
<h3><code><a href="https://developer.mozilla.org/En/DOM/Element.firstElementChild" title="Element.firstElementChild on Mozilla Developer Center">Element.firstElementChild</a></code> / <code><a href="https://developer.mozilla.org/En/DOM/Element.lastElementChild" title="Element.lastElementChild on Mozilla Developer Center">Element.lastElementChild</a></code> / <code><a href="https://developer.mozilla.org/En/DOM/Element.previousElementSibling" title="Element.previousElementSibling on Mozilla Developer Center">Element.previousElementSibling</a></code> / <code><a href="https://developer.mozilla.org/En/DOM/Element.nextElementSibling" title="Element.nextElementSibling on Mozilla Developer Center">Element.nextElementSibling</a></code></h3>
<p>Selects the first/last element child or the previous/next element sibling. Saves on extrenuous code like:</p>
<pre><code>var previous = document.getElementById('example');
while((previous = previous.previousSibling) !== null &#038;& previous.nodeType !== 1) { }</code></pre>
<pre><code>var a = document.getElementById('a');

a.firstElementChild;
a.lastElementChild;
a.previousElementSibling;
a.nextElementSibling;</code></pre>
<table>
<tr>
<th>IE6</th>
<th>IE7</th>
<th>IE8</th>
<th>Firefox 3</th>
<th>Firefox 3.5</th>
<th>Opera 9</th>
<th>Opera 10</th>
<th>Safari 3</th>
<th>Safari 4</th>
<th>Chrome 1</th>
<th>Chrome 2</th>
</tr>
<tr>
<td>no</td>
<td>no</td>
<td>no</td>
<td>no</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
</tr>
</table>
<h3><code><a href="https://developer.mozilla.org/En/DOM/Element.children" title="Element.children on Mozilla Developer Center">Element.children</a></code></h3>
<p>Similar to the <code>childNodes</code> method, but without text nodes and comments.</p>
<pre><code>var a = document.getElementById('a');

a.children;</code></pre>
<table>
<tr>
<th>IE6</th>
<th>IE7</th>
<th>IE8</th>
<th>Firefox 3</th>
<th>Firefox 3.5</th>
<th>Opera 9</th>
<th>Opera 10</th>
<th>Safari 3</th>
<th>Safari 4</th>
<th>Chrome 1</th>
<th>Chrome 2</th>
</tr>
<tr>
<td>almost (includes comments)</td>
<td>almost (includes comments)</td>
<td>almost (includes comments)</td>
<td>no</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
</tr>
</table>
<h3><code><a href="http://ejohn.org/blog/comparing-document-position/" title="Comparing Document Position by John Resig">Element.compareDocumentPosition</a></code></h3>
<p>Allows you to compare one node’s position to another. Returns a <a href="http://en.wikipedia.org/wiki/Mask_%28computing%29">bitmask</a>.</p>
<pre><code>var a = document.getElementById('a');
var b = document.getElementById('b');

a.compareDocumentPosition(b);</code></pre>
<table>
<tr>
<th>IE6</th>
<th>IE7</th>
<th>IE8</th>
<th>Firefox 3</th>
<th>Firefox 3.5</th>
<th>Opera 9</th>
<th>Opera 10</th>
<th>Safari 3</th>
<th>Safari 4</th>
<th>Chrome 1</th>
<th>Chrome 2</th>
</tr>
<tr>
<td>no</td>
<td>no</td>
<td>no</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>no</td>
<td>yes</td>
</tr>
</table>
<h3><code><a href="http://ejohn.org/blog/comparing-document-position/" title="Comparing Document Position by John Resig">Element.contains</a></code></h3>
<p>Returns a boolean whether or not an element is contained within another.</p>
<pre><code>var a = document.getElementById('a');
var b = document.getElementById('b');

a.contains(b);</code></pre>
<table>
<tr>
<th>IE6</th>
<th>IE7</th>
<th>IE8</th>
<th>Firefox 3</th>
<th>Firefox 3.5</th>
<th>Opera 9</th>
<th>Opera 10</th>
<th>Safari 3</th>
<th>Safari 4</th>
<th>Chrome 1</th>
<th>Chrome 2</th>
</tr>
<tr>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>no</td>
<td>no</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
<td>yes</td>
</tr>
</table>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2009/09/05/notes-from-a-selector-engine/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Array Tidy</title>
		<link>http://www.sidroberts.co.uk/2009/07/09/array-tidy/</link>
		<comments>http://www.sidroberts.co.uk/2009/07/09/array-tidy/#comments</comments>
		<pubDate>Thu, 09 Jul 2009 14:34:55 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[array]]></category>
		<category><![CDATA[prototype]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=219</guid>
		<description><![CDATA[I’ve been working on a selector engine recently, and given the complexity of it, it’s easier to return a multi-dimensional array than a flat one (for example: [['this'], 'is', ['an', 'example']] instead of ['this', 'is', 'an', 'example']). Of course, returning such an array to another function is a bit pointless because it requires that function [...]]]></description>
			<content:encoded><![CDATA[<p>I’ve been working on a <a href="http://www.google.co.uk/search?q=css+selector+engine" title="CSS Selector Engine in JavaScript">selector engine</a> recently, and given the complexity of it, it’s easier to return a multi-dimensional array than a flat one (for example: <code>[['this'], 'is', ['an', 'example']]</code> instead of <code>['this', 'is', 'an', 'example']</code>). Of course, returning such an array to another function is a bit pointless because it requires that function to traverse through the array in order to flatten it so it can be used efficiently. Another problem with the selector engine is that sometimes, an element can be returned twice (for example: <code>$('div, #content')</code>, where <code>#content</code> is a <code>div</code>). Because of this, I wrote a <code>tidy</code> function that flattens the array and removes duplicate indexes.</p>
<p>Unfortunately, it requires some additional code:</p>
<h3><code>indexOf</code></h3>
<p>Returns the first index where a value (<code>searchStr</code>) appears. <code>startIndex</code> allows you to begin the search at a predefined index.</p>
<pre><code>Array.prototype.indexOf = Array.prototype.indexOf || function(searchStr, startIndex) {
	for(var i = startIndex || 0, thisLength = this.length; i &lt; thisLength; i++) {
		if(searchStr === this[i]) {
			return i;
		}
	}

	return -1;
};</code></pre>
<h3><code>inArray</code></h3>
<p>Returns either <code>true</code> or <code>false</code> if a value (<code>searchStr</code>) is in an array. <code>startIndex</code> allows you to begin the search at a predefined index.</p>
<pre><code>Array.prototype.inArray = function(searchStr, startIndex) {
	return this.indexOf(searchStr, startIndex) &gt; -1;
};</code></pre>
<h3><code>flatten</code></h3>
<p>Flattens a multi-dimensional array to a one-dimensional array.</p>
<pre><code>Array.prototype.flatten = function() {
	for(var i = 0, thisLength = this.length, b = []; i &lt; thisLength; i++) {
		if(this[i].constructor === Array) {
			this[i] = this[i].flatten();

			for(var j = 0, thisILength = this[i].length; j &lt; thisILength; j++) {
				b.push(this[i][j].constructor === Array ? this[i][j].flatten() : this[i][j]);
			}
		}
		else {
			b.push(this[i]);
		}
	}

	return b;
};</code></pre>
<h3><code>tidy</code></h3>
<p>Tidies up an array by removing dupe values and flattening it to a one dimensional array.</p>
<pre><code>Array.prototype.tidy = function() {
	var a = this.flatten();
	var b = [];

	for(var i = 0, aLength = a.length; i &lt; aLength; i++) {
		if(!b.inArray(a[i])) {
			b.push(a[i]);
		}
	}

	return b;
};</code></pre>
<p>All this code has been tested on the following browsers and works perfectly:</p>
<ul>
<li>Firefox 1.5, 2, 3, 3.5</li>
<li>Chrome 1, 2, 3</li>
<li>Opera 7, 8, 9.5, 9.64, 10</li>
<li>Safari 3, 4</li>
<li>Internet Explorer 6, 7, 8</li>
</ul>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2009/07/09/array-tidy/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>JavaScript Benchmarking</title>
		<link>http://www.sidroberts.co.uk/2009/07/03/javascript-benchmarking/</link>
		<comments>http://www.sidroberts.co.uk/2009/07/03/javascript-benchmarking/#comments</comments>
		<pubDate>Fri, 03 Jul 2009 21:31:21 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[benchmark]]></category>
		<category><![CDATA[optimise]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=209</guid>
		<description><![CDATA[I’ve been coding a few functions and methods for an upcoming project and needed to benchmark them. Firebug’s profile tool is pretty good, but it only takes into account one execution of the code — but what if that one instance was particularly slow or particularly fast? For better results, you’d have to repeat the [...]]]></description>
			<content:encoded><![CDATA[<p>I’ve been coding a few functions and methods for an upcoming project and needed to benchmark them. <a href="http://getfirebug.com/js.html">Firebug’s profile tool</a> is pretty good, but it only takes into account one execution of the code — but what if that one instance was particularly slow or particularly fast? For better results, you’d have to repeat the function multiple times to get a better idea of how quick (or slow) it is. So in order to do this, I’ve built a benchmarking tool that bolts onto the <code>Function</code> Prototype:</p>
<pre><code>Function.prototype.benchmark = function(iterations) {
	if(iterations === null || isNaN(iterations) || iterations &lt; 1) { throw new TypeError(); }

	var begin = (new Date()).getTime();

	for(var i = 0; i &lt; iterations; i++) {
		this();
	}

	var end = (new Date()).getTime();

	return (end - begin) / iterations; // in milliseconds
};</code></pre>
<p>Use it like this:</p>
<pre><code>var example = function() {
	// run some code
};

var benchmark = example.benchmark(100); // run example 100 times</code></pre>
<p>In a nutshell, <code>example</code> is executed 100 times and <code>benchmark</code> contains the average time it took in milliseconds to execute it. Obviously more iterations gives a better average but could potentially crash if the number is too high. For big functions and libraries, I’d recommend starting off low (maybe 100) and then ramping it up but for small functions, you could easily start at up to 10,000 or maybe even 100,000. Make sure there isn’t any code in there that could potentially ruin the benchmarking — particularly <code>alert</code>s.</p>
<p>Remember to take into account slow machines and portable devices, as not every browser and computer will do it at the same speed.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2009/07/03/javascript-benchmarking/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Panoramas From Tenerife</title>
		<link>http://www.sidroberts.co.uk/2009/05/12/panoramas-from-tenerife/</link>
		<comments>http://www.sidroberts.co.uk/2009/05/12/panoramas-from-tenerife/#comments</comments>
		<pubDate>Tue, 12 May 2009 18:53:33 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Photos]]></category>
		<category><![CDATA[landscape]]></category>
		<category><![CDATA[panorama]]></category>
		<category><![CDATA[photo]]></category>
		<category><![CDATA[picasa]]></category>
		<category><![CDATA[tenerife]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=178</guid>
		<description><![CDATA[I was in Tenerife at Easter and made a few panoramas with multiple shots from a Canon IXUS i5 and the Photomerge tool in Photoshop. I’m by no means a photographer so I’d be interested to see what people think. Unfortunately, these images are only 870 pixels wide (the originals range from 5,500 to 8,500 [...]]]></description>
			<content:encoded><![CDATA[<p>I was in Tenerife at Easter and made a few panoramas with multiple shots from a <a href="http://www.canon.co.uk/For_Home/Product_Finder/Cameras/Digital_Camera/IXUS/Digital_IXUS_I5/index.asp">Canon IXUS i5</a> and the Photomerge tool in Photoshop. I’m by no means a photographer so I’d be interested to see what people think.</p>
<p>Unfortunately, these images are only 870 pixels wide (the originals range from 5,500 to 8,500 pixels wide).</p>
<p><img class="fullSize" src="http://www.sidroberts.co.uk/wp-content/uploads/2009/07/Playa-de-las-Americas-Bay.jpg" alt="" /></p>
<p><img class="fullSize" src="http://www.sidroberts.co.uk/wp-content/uploads/2009/07/Rosies-Cantina-Facing-The-Land.jpg" alt="" /></p>
<p><img class="fullSize" src="http://www.sidroberts.co.uk/wp-content/uploads/2009/07/Rosies-Cantina-Facing-The-Sea.jpg" alt="" /></p>
<p><img class="fullSize" src="http://www.sidroberts.co.uk/wp-content/uploads/2009/07/Untitled-Panorama.jpg" alt="" /></p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2009/05/12/panoramas-from-tenerife/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Asus Eee PC 1000</title>
		<link>http://www.sidroberts.co.uk/2009/03/26/asus-eee-pc-1000/</link>
		<comments>http://www.sidroberts.co.uk/2009/03/26/asus-eee-pc-1000/#comments</comments>
		<pubDate>Thu, 26 Mar 2009 18:15:34 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Windows]]></category>
		<category><![CDATA[asus]]></category>
		<category><![CDATA[eee]]></category>
		<category><![CDATA[eeepc]]></category>
		<category><![CDATA[netbook]]></category>
		<category><![CDATA[windows 7]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=173</guid>
		<description><![CDATA[After several months of contemplating on the idea of a school laptop, I finally caved in and made the purchase of an Asus Eee PC 1000. I’ve thrown the Windows 7 beta on there and it is absolutely fabulous to use. The thing that I like most about the Windows 7 beta is that it [...]]]></description>
			<content:encoded><![CDATA[<p>After several months of contemplating on the idea of a school laptop, I finally caved in and made the purchase of an <a href="http://eeepc.asus.com/global/product1000.html">Asus Eee PC 1000</a>. <a title="Install Windows 7 on Asus Eee PC" href="http://www.multimolti.de/blog/2008/12/14/install-windows-7-on-asus-eee-pc-900/">I’ve thrown the Windows 7 beta on there</a> and it is absolutely fabulous to use.</p>
<p>The thing that I like most about the Windows 7 beta is that it actually works. You can use it as an everyday operating system almost flawlessly. All the hardware worked from out of the box, with the exception of the Ethernet port and the webcam. Just download the XP Ethernet driver from the <a href="http://support.asus.com/download/download.aspx">Asus support website</a> (the webcam is still something I’m figuring out). Perhaps I should note that installing Windows 7 on the 8<abbr title="Gigabyte">GB</abbr> <acronym title="Solid State Drive">SSD</acronym> is not a good idea — stick just a few applications on there and you’ll find you’ve got no space left.</p>
<p>Battery life is about 5 hours from a full charge.</p>
<p>Considering the size of this netbook, it is remarkably easy to type on — even easier than most full-size laptops I’ve used. If you read the articles on the internet, though, there are complaints about the right shift key position. Now considering that I didn’t think I even used the right shift key, let me tell it really is atrocious as I keep hitting the up key instead — almost every time. Most of the other keys are well placed (although the Function keys are a little to the left). The trackpad is also good.</p>
<p>The microphone is OK. Considering that I’ll rarely be using it, it doesn’t really matter. And because the microphone is below the screen, typing is very loud.</p>
<p>Unfortunately, most other netbooks are smaller and although they are significantly cheaper, I wouldn’t recommend getting one with a screen of less than 10 inches. You might think £280 is a lot for such a small machine but it’s the portability, the battery and the quality you get — this thing looks absolutely stunning, the white version looks like a little Macbook. When I’ve got the funds, I’ll be modding it with a touch screen and a <acronym title="Global Positioning System">GPS</acronym> dongle.</p>
<p>I should stress the importance of a <a title="Boost your Wifi with a parabolic Wind Surfer" href="http://www.freeantennas.com/projects/template2/index.html">Wind Surfer to help boost your Wifi signal</a>. Mine went from 2 bars to 4 bars and all it took was a few minutes of printing, cutting and sticking.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2009/03/26/asus-eee-pc-1000/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Car Insurance</title>
		<link>http://www.sidroberts.co.uk/2009/03/08/car-insurance/</link>
		<comments>http://www.sidroberts.co.uk/2009/03/08/car-insurance/#comments</comments>
		<pubDate>Sun, 08 Mar 2009 21:36:24 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Ramblings]]></category>
		<category><![CDATA[car]]></category>
		<category><![CDATA[golf]]></category>
		<category><![CDATA[insurance]]></category>
		<category><![CDATA[vw]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=165</guid>
		<description><![CDATA[As a 17-year-old male with just (well, soon to be) a newly acquired driver’s license under my belt, I have the privilege of ridiculous car insurance quotes. For a little Volkswagen Golf (1.4 litre), my cheapest quote lies in at £5,000 a year with a slew of more expensive quotes following it (the most expensive [...]]]></description>
			<content:encoded><![CDATA[<p>As a 17-year-old male with just (well, soon to be) a newly acquired driver’s license under my belt, I have the privilege of ridiculous car insurance quotes. For a little Volkswagen Golf (1.4 litre), my cheapest quote lies in at £5,000 a year with a slew of more expensive quotes following it (the most expensive being £15,000) — despite the car only being worth £3,000.</p>
<p>If I was to own the car for 4 years, say, it would cost me somewhere in the region of £23,000 excluding tax and petrol. I could either buy the insurance or drive around uninsured in a fleet of 7 <abbr title="Volkswagen">VW</abbr> Golfs — one for every day of the week. Which one would you choose?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2009/03/08/car-insurance/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>A Day Of Video</title>
		<link>http://www.sidroberts.co.uk/2008/12/21/a-day-of-video/</link>
		<comments>http://www.sidroberts.co.uk/2008/12/21/a-day-of-video/#comments</comments>
		<pubDate>Sun, 21 Dec 2008 21:47:52 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Ramblings]]></category>
		<category><![CDATA[convert]]></category>
		<category><![CDATA[mux]]></category>
		<category><![CDATA[video]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=139</guid>
		<description><![CDATA[Having spent the day muxing video, converting it from one format to another and compressing it, I don’t intend to do it again any time soon. There’s just so much you have to take into consideration and even a simple task can become extremely difficult. Because some of the common tasks I had to do [...]]]></description>
			<content:encoded><![CDATA[<p>Having spent the day <a href="http://en.wikipedia.org/wiki/Multiplexing#Video_processing">muxing video</a>, converting it from one format to another and compressing it, I don’t intend to do it again any time soon. There’s just so much you have to take into consideration and even a simple task can become extremely difficult. Because some of the common tasks I had to do were so difficult, I’ll be writing several tutorials to aid anyone else who finds them coerced into the world of video.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/12/21/a-day-of-video/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Microsoft Math</title>
		<link>http://www.sidroberts.co.uk/2008/12/07/microsoft-math/</link>
		<comments>http://www.sidroberts.co.uk/2008/12/07/microsoft-math/#comments</comments>
		<pubDate>Sun, 07 Dec 2008 15:36:01 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Reviews]]></category>
		<category><![CDATA[homework]]></category>
		<category><![CDATA[math]]></category>
		<category><![CDATA[maths]]></category>
		<category><![CDATA[microsoft]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=127</guid>
		<description><![CDATA[After a seemingly never-ending torrent of (GCE level) maths homework, I’ve had to turn to Microsoft Math for help. I can’t recommend it enough as it does everything I need it to do. And for $20 (about £10), it’s hardly going to break the bank. Unfortunately, it’s not received an update for about 18 months [...]]]></description>
			<content:encoded><![CDATA[<p>After a seemingly never-ending torrent of (GCE level) maths homework, I’ve had to turn to <a href="http://www.microsoft.com/learningspace/Products.aspx?prod=math">Microsoft Math</a> for help. I can’t recommend it enough as it does everything I need it to do. And for $20 (about £10), it’s hardly going to break the bank. Unfortunately, it’s not received an update for about 18 months and it doesn’t appear to be updated any time soon but it’s still a solid piece of software and definitely worth the price. You could even argue that it doesn’t need updating.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/12/07/microsoft-math/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Tux?</title>
		<link>http://www.sidroberts.co.uk/2008/11/27/tux/</link>
		<comments>http://www.sidroberts.co.uk/2008/11/27/tux/#comments</comments>
		<pubDate>Thu, 27 Nov 2008 10:18:10 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Ramblings]]></category>
		<category><![CDATA[linux]]></category>
		<category><![CDATA[penguin]]></category>
		<category><![CDATA[tux]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=124</guid>
		<description><![CDATA[]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.sidroberts.co.uk/wp-content/uploads/2008/11/img_2819.jpg"><img class="wp-image-125 fullSize" alt="" src="http://www.sidroberts.co.uk/wp-content/uploads/2008/11/img_2819.jpg" width="500" height="742" /></a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/11/27/tux/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Want To Cancel An Account With 1&amp;1?</title>
		<link>http://www.sidroberts.co.uk/2008/11/22/want-to-cancel-an-account-with-11/</link>
		<comments>http://www.sidroberts.co.uk/2008/11/22/want-to-cancel-an-account-with-11/#comments</comments>
		<pubDate>Sat, 22 Nov 2008 14:53:04 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[1&1]]></category>
		<category><![CDATA[cancel]]></category>
		<category><![CDATA[host]]></category>
		<category><![CDATA[hosting]]></category>
		<category><![CDATA[internet]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=117</guid>
		<description><![CDATA[Go to http://contract.1and1.co.uk/ and follow the on-screen instructions. Americans should use http://cancel.1and1.com/. Having just spent the morning in the depths of the 1&#38;1 FAQs, I’ve noticed a lot of tutorials and information that is no longer relevant or no longer works so I strongly advise ignoring it altogether and check other blogs to see how [...]]]></description>
			<content:encoded><![CDATA[<p>Go to <a href="http://contract.1and1.co.uk/">http://contract.1and1.co.uk/</a> and follow the on-screen instructions. Americans should use <a href="http://cancel.1and1.com/">http://cancel.1and1.com/</a>. Having just spent the morning in the depths of the 1&amp;1 <acronym title="Frequently Asked Questions">FAQs</acronym>, I’ve noticed a lot of tutorials and information that is no longer relevant or no longer works so I strongly advise ignoring it altogether and check other blogs to see how they did it. The differences between the American and British sites are very subtle and usually just boil down to .com and .co.uk. And as I’ve spent a good hour trying to login into the American cancellation site, I can assure you that the customer <abbr title="Identification">ID</abbr>s (more commonly known as Account IDs or a domain name registered with the account) do not work with the wrong site — which, in hindsight, should have been expected.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/11/22/want-to-cancel-an-account-with-11/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>WordPress 2.7</title>
		<link>http://www.sidroberts.co.uk/2008/11/18/wordpress-27/</link>
		<comments>http://www.sidroberts.co.uk/2008/11/18/wordpress-27/#comments</comments>
		<pubDate>Tue, 18 Nov 2008 20:22:24 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Reviews]]></category>
		<category><![CDATA[blog]]></category>
		<category><![CDATA[wordpress]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=108</guid>
		<description><![CDATA[With the impending release of WordPress 2.7, I thought I’d share some of the new features and styling from the betas. First thing’s first, the admin pages have seen a big redesign which nicely brings WordPress up to date with trendy drag-and-drop functionality. The new design has a very clean and simple look yet it [...]]]></description>
			<content:encoded><![CDATA[<p>With the impending release of <a href="http://wordpress.org/">WordPress</a> 2.7, I thought I’d share some of the new features and styling from the betas.</p>
<p>First thing’s first, the admin pages have seen a big redesign which nicely brings WordPress up to date with trendy drag-and-drop functionality. The new design has a very clean and simple look yet it packs in lots of information, stylishly. It’s not as colourful as 2.6 which worries me in a way as the colours they have used look garish and out of place.</p>
<p><img src="http://www.sidroberts.co.uk/wp-content/uploads/2008/11/wp27.png" alt="" width="500" height="760" class="wp-image-110 fullSize" /></p>
<p>What strikes me most is how integrated WordPress now feels. Once you’ve installed it, you may never need to use <acronym title="File Transfer Protocol">FTP</acronym> again. Plug-in installs and updates can be done within the admin interface — very easily.</p>
<p>Of course, as with many big version overhauls, most plug-ins don’t work and there are quite a few things that I don’t think have been wisely placed. For example, whilst the new navigation strip is a welcome change to the old navigation bar, it is too long and there are quite a few things that I’ll never use. Of course, you can “minimise” it if you wish.</p>
<p>There’s been a big push towards making the interface more customisable and so you are able to remove panes that you don’t like and you can even transform it into a single column display just by dragging the panes into one single column. So in a sense, it feels a lot more like a desktop application.</p>
<p>QuickPress allows you to quickly bash out a post — <a href="http://twitter.com/">Twitter</a>–style — and whilst I probably won’t be using it, I can see many who will. Although, with the lack of category selection, its potential is seriously limited.</p>
<p>Added to all these new features, 2.7 also sees a huge number of security fixes and general bug fixes — essentially making this a must-upgrade situation.</p>
<p>Among all the seemingly Web 2.0 traits, 2.7 transforms WordPress into more than just a simple blogging platform. And I dare say that this new version will be one of the major evolutions of WordPress so far.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/11/18/wordpress-27/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Windows 7</title>
		<link>http://www.sidroberts.co.uk/2008/11/10/windows-7/</link>
		<comments>http://www.sidroberts.co.uk/2008/11/10/windows-7/#comments</comments>
		<pubDate>Mon, 10 Nov 2008 20:55:25 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Windows]]></category>
		<category><![CDATA[microsoft]]></category>
		<category><![CDATA[operating system]]></category>
		<category><![CDATA[os]]></category>
		<category><![CDATA[vista]]></category>
		<category><![CDATA[windows]]></category>
		<category><![CDATA[windows 7]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=96</guid>
		<description><![CDATA[I’ve recently found myself enticed with all the Windows 7 articles demonstrating things to come from the operating system that’s now being dubbed “what Vista could have been”. And already it certainly looks like Microsoft’s attempt at rectifying all the things that Vista fell down on. All the legacy programs like WordPad and Paint have [...]]]></description>
			<content:encoded><![CDATA[<p>I’ve recently found myself enticed with all the Windows 7 articles demonstrating things to come from the operating system that’s now being dubbed “what Vista could have been”. And already it certainly looks like Microsoft’s attempt at rectifying all the things that Vista fell down on.</p>
<p>All the legacy programs like WordPad and Paint have been updated and are now in fitting with the new look of Windows. Notably, <a title="Window 7's calculator bundles real-life uses" href="http://lifehacker.com/5078756/windows-7s-calculator-bundles-real+life-uses">the calculator has received a large upgrade and it boasts features like conversions, a mortgage calculator and a gas mileage calculator</a>. What previously took a few Google searches and a long-winded Excel spreadsheet can now be done with a few clicks.</p>
<p>Everything just seems to integrate better with Windows 7 as well: changing wireless networks just takes two clicks, the sidebar is no more but the gadgets can roam the desktop and things like <a href="http://www.istartedsomething.com/20081103/shake-up-your-windows-7-with-aero-shake/">Aero Shake</a> suggest (nice but potentially annoying) <a href="http://www.compiz-fusion.org/">Compiz Fusion</a>–like effects.</p>
<p>Performance seems to be a lot better than Vista too: everything from <a title="Windows 7 preview boots 20% faster than Vista" href="http://lifehacker.com/5076370/windows-7-preview-boots-20-faster-than-vista">shorter boot times</a> to longer laptop battery life seems to be the way that Windows 7 is going. As Vista seemed sluggish compared to its predecessors, I’m excited that Microsoft have turned it back around. It can even run with a mere 1<abbr title="Gigabyte">GB</abbr> of <acronym title="Random Access Memory">RAM</acronym> although considering memory is dirt-cheap nowadays, there needn’t be a tiff if it were to require more.</p>
<p>The taskbar has also been hugely redesigned and while I’m not too hot on it at the moment, I’m sure it’ll all fall into place in time. Essentially, the new taskbar makes better use of the space and takes the preview window to the next level.</p>
<p>There’s also promise that Windows 7, from day one, will be more stable than Vista <acronym title="Service Pack">SP</acronym>1. Whilst I’m not so sure myself, as every new operating system faces numerous bugs, I’m fairly confident that Windows 7 will be a strong <acronym title="Operating System">OS</acronym> that should see us through for a good few years.</p>
<p>Oh! How could I forget that they’ve redesigned <acronym title="User Account Control">UAC</acronym> to be insanely less intrusive? You may be able keep it enabled without losing your insanity. Individual applications can be allowed forever and you can also change the ferocity of <acronym title="User Account Control">UAC</acronym>, presumably inside the depths of the Control Panel.</p>
<p>All in all, Windows 7 has shaped up to be what could be the best operating system the world has seen. I’m interested in what developments other operating systems will see as Windows 7 nears its launch in mid 2009.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/11/10/windows-7/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Virtualisation</title>
		<link>http://www.sidroberts.co.uk/2008/11/04/virtualisation/</link>
		<comments>http://www.sidroberts.co.uk/2008/11/04/virtualisation/#comments</comments>
		<pubDate>Tue, 04 Nov 2008 14:32:07 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[ubuntu]]></category>
		<category><![CDATA[virtual]]></category>
		<category><![CDATA[virtual box]]></category>
		<category><![CDATA[virtualisation]]></category>
		<category><![CDATA[vmware]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=85</guid>
		<description><![CDATA[I’ve been experimenting with virtualisation for the last few days. Being on Windows Vista 64-bit, I can’t use VMWare (because of driver signing) so I had to use to VirtualBox which, I’ve found, is actually better and lighter than VMWare. Despite a few (very minor) bugs, I love VirtualBox’s seamless mode — it essentially allows [...]]]></description>
			<content:encoded><![CDATA[<p>I’ve been experimenting with virtualisation for the last few days. Being on Windows Vista 64-bit, I can’t use <a href="http://www.vmware.com/">VMWare</a> (because of <a href="http://blogs.msdn.com/windowsvistasecurity/archive/2007/08/03/x64-driver-signing-update.aspx">driver signing</a>) so I had to use to <a href="http://www.virtualbox.org/">VirtualBox</a> which, I’ve found, is actually better and lighter than VMWare. Despite a few (very minor) bugs, I love VirtualBox’s seamless mode — it essentially allows you to work with two operating systems as if they were one.</p>
<p><a href="http://www.sidroberts.co.uk/wp-content/uploads/2008/11/seamless.jpg"><img class="wp-image-94 fullSize" title="VirtualBox's Seamless Mode With Windows Vista And Ubuntu 8.10" src="http://www.sidroberts.co.uk/wp-content/uploads/2008/11/seamless.jpg" alt="" width="500" height="312" /></a></p>
<p>It’s also given me a chance to play about with Ubuntu 8.10. Since the release of <a title="Ubuntu 8.04 Review" href="http://www.sidroberts.co.uk/2008/04/30/ubuntu-804-a-full-review/">Ubuntu 8.04</a>, I’ve been set on 8.10 being the definitive version and whilst it does feel a bit stronger and more capable than 8.04, I’m not so sure that it is what I had hoped. The <acronym title="User Interface">UI</acronym> is still ugly and <a href="http://www.openoffice.org/">OpenOffice</a> is still lacklustre compared to the likes of Microsoft Office. In a nutshell, it needs to take a big step towards Windows in order for it to be a viable option for regular consumers. It is, however, definitively ready as a home server and I’ll definitively be incorporating it into a project. Details to follow…</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/11/04/virtualisation/feed/</wfw:commentRss>
		<slash:comments>5</slash:comments>
		</item>
		<item>
		<title>My Dell, A New Heatsink And Lots Of Problems</title>
		<link>http://www.sidroberts.co.uk/2008/10/17/my-dell-a-new-heatsink-and-lots-of-problems/</link>
		<comments>http://www.sidroberts.co.uk/2008/10/17/my-dell-a-new-heatsink-and-lots-of-problems/#comments</comments>
		<pubDate>Fri, 17 Oct 2008 15:47:58 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Ramblings]]></category>
		<category><![CDATA[akasa]]></category>
		<category><![CDATA[computer]]></category>
		<category><![CDATA[dell]]></category>
		<category><![CDATA[heatsink]]></category>
		<category><![CDATA[pc]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=81</guid>
		<description><![CDATA[My Dell Dimension 9200, I felt, was getting a little too warm. It wasn’t anything particularly dangerous, it’s just I felt it could do with a little more cooling. I occasionally clean it out every few months but the heatsink and its fan are hidden away under heavily screwed down plastic so I can’t get [...]]]></description>
			<content:encoded><![CDATA[<p>My Dell Dimension 9200, I felt, was getting a little too warm. It wasn’t anything particularly dangerous, it’s just I felt it could do with a little more cooling. I occasionally clean it out every few months but the heatsink and its fan are hidden away under heavily screwed down plastic so I can’t get to them and dust was clogging them up. Until a few hours ago, I had never even seen them.</p>
<p>I ordered a new heatsink (<a href="http://www.akasa.com.tw/akasa_english/spec_page/coolers/spec_ak_965.htm">Akasa AK-965</a>) and today I attempted to install it. Of course, uninstalling the old one was difficult and there’s always that little niggle that makes you think you’re doing it wrong. I continued, though, and managed to vacuum the incredible amount of dust that had amounted over the 2 years.</p>
<p>I was in the final throes of completion, I only had to place the new heatsink into its place, pop the screws and plug the fan in. Of course, in the final stages, something has to go wrong and for this little endeavour, everything did. First, I found that the heatsink didn’t line up the motherboard’s holes. Secondly, I found that the motherboard didn’t have a connection for the heatsink’s fan (rather, a different connection to what the new heatsink needed). Thirdly, I’d already taken all the old thermal paste off the processor at this point and it looked like I’d need to buy some more. And finally, no matter how hard I tried to be careful, I managed to get thermal paste all over my fingers. Sending back the heatsink will cost £5 — for a £10 product. To finish off, as I’ve had to dismantle half my computer, I’ve now got two screws and I don’t know where they went.</p>
<p>It’s not all bad though: I’ve managed to scrape some of the new thermal paste onto the old heatsink (and temperatures have fallen dramatically), I’ve been able to clean the fan and heatsink and I have a spare heatsink for a computer I hope to be building this autumn.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/10/17/my-dell-a-new-heatsink-and-lots-of-problems/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Caught By The Google Street View Camera</title>
		<link>http://www.sidroberts.co.uk/2008/08/28/caught-by-the-google-street-view-camera/</link>
		<comments>http://www.sidroberts.co.uk/2008/08/28/caught-by-the-google-street-view-camera/#comments</comments>
		<pubDate>Thu, 28 Aug 2008 09:12:21 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Ramblings]]></category>
		<category><![CDATA[google]]></category>
		<category><![CDATA[google maps]]></category>
		<category><![CDATA[google street view]]></category>
		<category><![CDATA[leeds]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=75</guid>
		<description><![CDATA[I’ve always wanted to see the Google Street View car ever since it was spotted first in England but thought it would be a while before it photographed Leeds. Having just got out the shower and drying my hair, the black Vauxhall Astra with it’s cameras cruised passed the house. And because my hair was [...]]]></description>
			<content:encoded><![CDATA[<p>I’ve always wanted to see the <a href="http://maps.google.com/help/maps/streetview/">Google Street View</a> car ever since it was spotted first in England but thought it would be a while before it photographed Leeds. Having just got out the shower and drying my hair, the <a href="http://uk.techcrunch.com/2008/07/05/google-starts-street-view-mapping-in-uk-and-heres-the-evidence/">black Vauxhall Astra with it’s cameras</a> cruised passed the house. And because my hair was wet, I didn’t have a shirt on — from the car’s point of view, I look naked. Nice.</p>
<p>At least the <a href="http://www.jaguar.com/uk/en/x-type/highlights/highlights/introduction.htm"><abbr title="Jaguar">Jag</abbr></a> was in the drive, though.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/08/28/caught-by-the-google-street-view-camera/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>AAC Versus MP3</title>
		<link>http://www.sidroberts.co.uk/2008/08/21/aac-versus-mp3/</link>
		<comments>http://www.sidroberts.co.uk/2008/08/21/aac-versus-mp3/#comments</comments>
		<pubDate>Thu, 21 Aug 2008 11:25:12 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Tip]]></category>
		<category><![CDATA[aac]]></category>
		<category><![CDATA[audio]]></category>
		<category><![CDATA[comparison]]></category>
		<category><![CDATA[ipod]]></category>
		<category><![CDATA[itunes]]></category>
		<category><![CDATA[mp3]]></category>
		<category><![CDATA[music]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=67</guid>
		<description><![CDATA[I was a huge fan of MP3 until I properly discovered AAC a few months ago. Essentially, AAC provides better quality at lower bitrates — allowing you to save loads of hard drive space. The only problem is that there aren’t that many devices and players out there that support AAC whereas virtually everything supports [...]]]></description>
			<content:encoded><![CDATA[<p>I was a huge fan of <acronym title="MPEG-1 Audio Layer 3">MP3</acronym> until I properly discovered <acronym title="Advanced Audio Coding">AAC</acronym> a few months ago. Essentially, <acronym title="Advanced Audio Coding">AAC</acronym> provides better quality at lower bitrates — allowing you to save loads of hard drive space. The only problem is that there aren’t that many devices and players out there that support <acronym title="Advanced Audio Coding">AAC</acronym> whereas virtually everything supports <acronym title="MPEG-1 Audio Layer 3">MP3</acronym>. As it happens, though, I only use iTunes and my trusty iPod to play my music — both of which support <acronym title="Advanced Audio Coding">AAC</acronym>.</p>
<p>I’ve now had a few months to adjust to AAC and I’ve had no hiccups at all. I’ve compressed my entire collection to 96<acronym title="kilobits per second">kbps</acronym> (variable) <acronym title="Advanced Audio Coding">AAC</acronym> and can’t distinguish it between <acronym title="Compact Disc&lt;br /&gt;">CD</acronym> quality. Of course, you may not have the same experience as me and I heavily recommend that you do a bit of <a href="http://en.wikipedia.org/wiki/ABX_test">ABX testing</a> before you commit to any compression.</p>
<p>I recommend anyone who listens to their music collection on <a href="http://en.wikipedia.org/wiki/Advanced_Audio_Coding#Products_that_support_AAC">devices that do support <acronym title="Advanced Audio Coding">AAC</acronym></a>, to convert their collection to <acronym title="Advanced Audio Coding">AAC</acronym>.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/08/21/aac-versus-mp3/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Nissan Cube</title>
		<link>http://www.sidroberts.co.uk/2008/08/07/nissan-cube/</link>
		<comments>http://www.sidroberts.co.uk/2008/08/07/nissan-cube/#comments</comments>
		<pubDate>Thu, 07 Aug 2008 18:53:16 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Ramblings]]></category>
		<category><![CDATA[car]]></category>
		<category><![CDATA[cube]]></category>
		<category><![CDATA[nissan]]></category>
		<category><![CDATA[nissancube]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=60</guid>
		<description><![CDATA[Despite being only officially available to the Japanese market, I’ve seen several of these in England. It’s about as aerodynamic as a small village and is just devastatingly ugly. You can use choose between a 1.4 litre or a 1.5 litre I4 engine — the 1.4 litre has a huge 84 horsepower. The most positive [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.sidroberts.co.uk/wp-content/uploads/2008/08/nissan-cube-1.jpg"><img class="left size-full wp-image-29" title="Nissan Cube" src="http://www.sidroberts.co.uk/wp-content/uploads/2008/08/nissan-cube-1.jpg" alt="Nissan Cube" width="300" height="220" /></a></p>
<p>Despite being only officially available to the Japanese market, I’ve seen several of these in England. It’s about as aerodynamic as a small village and is just devastatingly ugly.</p>
<p>You can use choose between a 1.4 litre or a 1.5 litre <a href="http://en.wikipedia.org/wiki/Straight-4"><acronym title="Inline-4">I4</acronym> engine</a> — the 1.4 litre has a <em>huge</em> 84 horsepower.</p>
<p>The most positive thing that struck me about this car was what the size of the boot would be. Sadly, looking at it more closely, all that space is taken up by a second row of chairs.</p>
<p>To sum up: it has a poor engine, a tiny boot, ugly exterior, ugly interior and an import tax. Really?</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/08/07/nissan-cube/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Image Preloader</title>
		<link>http://www.sidroberts.co.uk/2008/07/15/image-preloader/</link>
		<comments>http://www.sidroberts.co.uk/2008/07/15/image-preloader/#comments</comments>
		<pubDate>Tue, 15 Jul 2008 17:48:48 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[ajax]]></category>
		<category><![CDATA[image]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=47</guid>
		<description><![CDATA[With Ajax being all the rage, preloading images has become somewhat important. The problem is, loading them with all the other page components adds to the load time and it may not even be used. Enter preloadImage — a function set to stop all that. It’s very simple but can be used to powerful means: [...]]]></description>
			<content:encoded><![CDATA[<p>With Ajax being all the rage, preloading images has become somewhat important. The problem is, loading them with all the other page components adds to the load time and it may not even be used. Enter <code>preloadImage</code> — a function set to stop all that. It’s very simple but can be used to powerful means:</p>
<pre><code>var preloadImage = function(url, callback) {
	var image = new Image();
	image.src = url;
	image.onload = image.onabort = image.onerror = callback;
	return image;
};</code></pre>
<p>Just specify the <acronym title="Uniform Resource Locator">URL</acronym> (<code>url</code>) and the callback function (<code>callback</code>) as so:</p>
<pre><code>var callback = function(e) {
	alert(e.type);
};

var image = preloadImage('http://www.sidroberts.co.uk/image.gif', callback);</code></pre>
<p>On the load event, the abort event or the error event, the callback function will be executed. You can distinguish these with the <code>type</code> property which is <code>"load"</code>, <code>"abort"</code> and <code>"error"</code> respectively.</p>
<p>Now any image that points to that <acronym title="Uniform Resource Locator">URL</acronym> will load almost instantly.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/07/15/image-preloader/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Import Multiple Images Into Powerpoint 2007</title>
		<link>http://www.sidroberts.co.uk/2008/07/14/import-multiple-images-into-powerpoint-2007/</link>
		<comments>http://www.sidroberts.co.uk/2008/07/14/import-multiple-images-into-powerpoint-2007/#comments</comments>
		<pubDate>Mon, 14 Jul 2008 19:43:33 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Tip]]></category>
		<category><![CDATA[fast]]></category>
		<category><![CDATA[image]]></category>
		<category><![CDATA[microsoft]]></category>
		<category><![CDATA[microsoftoffice]]></category>
		<category><![CDATA[office]]></category>
		<category><![CDATA[powerpoint]]></category>
		<category><![CDATA[presentation]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=46</guid>
		<description><![CDATA[Having spent the last three days sorting and importing some 300–400 images into Powerpoint, there’s a very useful tip that I learnt. And it meant that a job that could have taken a good week took just a few hours. Instead of dragging every single image into each slide, go to Insert in the ribbon [...]]]></description>
			<content:encoded><![CDATA[<p><img class="right size-full wp-image-25" title="Import Multiple Images Into PowerPoint 2007" src="http://www.sidroberts.co.uk/wp-content/uploads/2008/07/import-multiple-images-into-powerpoint-2007.gif" alt="Import Multiple Images Into PowerPoint 2007" width="348" height="218" />Having spent the last three days sorting and importing some 300–400 images into Powerpoint, there’s a very useful tip that I learnt. And it meant that a job that could have taken a good week took just a few hours.</p>
<p>Instead of dragging every single image into each slide, go to <strong>Insert</strong> in the ribbon and click the <strong>Photo Album</strong> icon. There you can select the images you want, order them and decide how many you want on each slide. It will make a new presentation with all these new slides so you will have to copy the slides back into the original presentation if you want them there.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/07/14/import-multiple-images-into-powerpoint-2007/feed/</wfw:commentRss>
		<slash:comments>7</slash:comments>
		</item>
		<item>
		<title>Digg’s Recommended Feature</title>
		<link>http://www.sidroberts.co.uk/2008/07/13/diggs-recommended-feature/</link>
		<comments>http://www.sidroberts.co.uk/2008/07/13/diggs-recommended-feature/#comments</comments>
		<pubDate>Sun, 13 Jul 2008 14:04:09 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Reviews]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[digg]]></category>
		<category><![CDATA[engine]]></category>
		<category><![CDATA[kevinrose]]></category>
		<category><![CDATA[recommend]]></category>
		<category><![CDATA[recommendation]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=44</guid>
		<description><![CDATA[The Digg Recommendation Engine recommends new stories that may be of interest to you, compared with what you have already Dugg. It finds Diggers like you and uses what they have Dugg and recommends them to you. When I saw the video, I didn’t think I’d be part of the selection that would get the [...]]]></description>
			<content:encoded><![CDATA[<p>The <a href="http://www.digg.com/">Digg</a> Recommendation Engine recommends new stories that may be of interest to you, compared with what you have already Dugg. It finds Diggers like you and uses what they have Dugg and recommends them to you. When I saw <a href="http://blog.digg.com/?p=127" title="Digg Recommendation Engine announcement">the video</a>, I didn’t think I’d be part of the selection that would get the feature first. </p>
<p>First thoughts are very promising. You need to be a fairly active member of Digg to keep the recommendations relevant, I should add — it grows in strength with stories you Digg. If the compatibility between you and other users is low, then chances are you’ll get poor results. For me, though, most recommendations were fairly accurate. My compatibility percentages were between 7 % and 13%.</p>
<p>For somebody who rarely uses the <a href="http://www.digg.com/all/technology/upcoming/">Upcoming feature</a>, this brings a welcome change and I’ve already Dugg many stories that I probably wouldn’t have seen otherwise. When the feature hits mainstream, I dare say it’ll be used heavily and the recommendations will be very accurate.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/07/13/diggs-recommended-feature/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Extending Regular Expressions</title>
		<link>http://www.sidroberts.co.uk/2008/06/28/extending-regular-expressions/</link>
		<comments>http://www.sidroberts.co.uk/2008/06/28/extending-regular-expressions/#comments</comments>
		<pubDate>Sat, 28 Jun 2008 20:47:09 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[JavaScript]]></category>
		<category><![CDATA[regular expressions]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=41</guid>
		<description><![CDATA[You know the problem with regular expressions in JavaScript?: There’s not enough to do. Sure, you can use its methods against strings but there’s nothing that allows you to manipulate the actual expressions. Where is the property for all the modifiers? How can you add or remove a modifier? The simple answer is that it [...]]]></description>
			<content:encoded><![CDATA[<p>You know the problem with regular expressions in JavaScript?: There’s not enough to do. Sure, you can use its methods against strings but there’s nothing that allows you to manipulate the actual expressions. Where is the property for all the modifiers? How can you add or remove a modifier? The simple answer is that it isn’t possible. The long and complicated way says that it is. The only problem is that the code is a little bit ugly:</p>
<pre><code>RegExp.prototype.modifiers = function() {
	return /^\/(.+)\/([gim]+?)$/i.exec(this.toString())[2].split('');
};</code></pre>
<p>Don’t say I didn’t warn you.</p>
<p>In short, that method converts the expression to a string and then executes another regular expression with it. This new regular expression takes away the main pattern and leaves the modifiers in a string. That string is then split into individual characters so you have an array of them (for example: <code>['g', 'i']</code>).</p>
<p>This magic regular expression can also be used for extracting a pattern, which, in turn, allows you to rebuild it with the <code>RegExp</code> constructor — modifiers included. This is the method for extracting the pattern:</p>
<pre><code>RegExp.prototype.pattern = function() {
	return /^\/(.+)\/([gim]+?)$/i.exec(this.toString())[1];
};</code></pre>
<p>Rebuilding it is as simple as this:</p>
<pre><code>var original = /\s+/g;

var pattern = original.pattern();
var modifiers = original.modifiers().join('');

var better = new RegExp(pattern, modifiers);</code></pre>
<p>So, putting two and two together, if we can extract the pattern and the modifiers, and rebuild it, what’s stopping us from changing it along the way? Enter <code>addModifiers</code> and <code>removeModifiers</code>:</p>
<pre><code>RegExp.prototype.addModifiers = function(modifiers) {
	return new RegExp(this.pattern(), this.modifiers().join('') + modifiers.join(''));
};

RegExp.prototype.removeModifiers = function(modifiers) {
	return new RegExp(this.pattern(), this.modifiers().join('').replace(new RegExp(modifiers.join('|'), 'i'), ''));
};</code></pre>
<p>With the <code>addModifiers</code> method, you may have noticed that I haven’t bothered to check for the existing modifiers. This is because you can duplicate a modifier on a regular expression and it won’t matter as it’ll only be counted once. Both of these methods allow multiple modifiers and require them to be an array (<code>['g', 'i']</code>):</p>
<pre><code>var original = /\s+/g;

original = original.addModifiers(['i']); // /\s+/gi
original = original.removeModifiers(['g']); // /\s+/i

pattern = original.pattern(); // '\s+'
modifiers = original.modifiers(); ['i']</code></pre>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/06/28/extending-regular-expressions/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Scaling Images</title>
		<link>http://www.sidroberts.co.uk/2008/06/24/scaling-images/</link>
		<comments>http://www.sidroberts.co.uk/2008/06/24/scaling-images/#comments</comments>
		<pubDate>Tue, 24 Jun 2008 17:07:42 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[CSS]]></category>
		<category><![CDATA[elastic]]></category>
		<category><![CDATA[image]]></category>
		<category><![CDATA[img]]></category>
		<category><![CDATA[layout]]></category>
		<category><![CDATA[scalable]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=40</guid>
		<description><![CDATA[The power with scaling images is immense but very few people use it on a website. Scalable images are set in either ems or percentages. For images that you know the width and height of, you can set the dimensions so that the image is not distorted: img.widescreen { width: 16em; height: 9em; } For [...]]]></description>
			<content:encoded><![CDATA[<p>The power with scaling images is immense but very few people use it on a website. Scalable images are set in either <acronym title="elastic measurement">em</acronym>s or percentages.</p>
<p>For images that you know the width and height of, you can set the dimensions so that the image is not distorted:</p>
<pre><code>img.widescreen {
	width: 16em;
	height: 9em;
}</code></pre>
<p>For unknown image sizes, one side must be set to <code>auto</code> — this will force the correct aspect ratio upon the image, avoiding any skewness:</p>
<pre><code>img.scale {
	height: auto;
	width: 75%;
}</code></pre>
<p>Scaling images are great because you can prevent them from ruining your layout by going over an edge. If they are set in percentages and have limitations, it also means that they won’t go larger than the boundaries of the page and still remain undistorted, even when the browser is resized:</p>
<pre><code>img.scale {
	height: auto;
	max-width: 100%;
	width: 30em;
}</code></pre>
<p>Using the <code>max-width</code>/<code>max-height</code> property, you can also prevent everyday images from ruining your layout as well.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/06/24/scaling-images/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Real Hard Drive Capacities</title>
		<link>http://www.sidroberts.co.uk/2008/06/21/real-hard-drive-capacities/</link>
		<comments>http://www.sidroberts.co.uk/2008/06/21/real-hard-drive-capacities/#comments</comments>
		<pubDate>Sat, 21 Jun 2008 19:25:29 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Ramblings]]></category>
		<category><![CDATA[capacity]]></category>
		<category><![CDATA[gigabyte]]></category>
		<category><![CDATA[hard drive]]></category>
		<category><![CDATA[terabyte]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=39</guid>
		<description><![CDATA[Ever bought a hard drive only to find you’ve got a smaller disk space than stated on the box? That’s not because your operating system is taking up that space, it’s because you’re not counting it as the hard drive manufacturers did. Computers count in base two – that is, binary. In binary, a kilobyte [...]]]></description>
			<content:encoded><![CDATA[<p>Ever bought a hard drive only to find you’ve got a smaller disk space than stated on the box? That’s not because your operating system is taking up that space, it’s because you’re not counting it as the hard drive manufacturers did.</p>
<p>Computers count in base two – that is, binary. In binary, a kilobyte is 1024 bytes (2 to the power of 10). Normal people considered a “kilo” to mean a thousand so a kilobyte, to them, was 1000 bytes. If you sell hard drives, the obvious choice is to use the measurement that sounds like more value – the non-geek 1000 was therefore used (1<abbr title="Megabytes">MB</abbr> = 1,048,576 bytes in binary or 1,000,000 bytes in metric – less is cheaper to make although less in usable capacity). In 1998, the <acronym title="International Electrotechnical Commission">IEC</acronym> defined 1<abbr title="Gigabytes">GB</abbr> as 1,000,000,000 bytes – using the non-geek/manufacturer method. To avoid confusion, they also decided to rename measurements of binary by replacing the last two letters with “<abbr title="binary">bi</abbr>” to represent “binary” (kibibytes, mebibytes, gibibytes, tebibytes). The thing is, though, these new names sound terrible and they will never be picked up. In reality, everyone uses the original names and ignores the stated capacities on hard drives.</p>
<table>
<tr>
<th>Stated Capacity</th>
<th>Usable Binary Capacity</th>
</tr>
<tr>
<td>1<abbr title="Gigabyte">GB</abbr></td>
<td>952.32<abbr title="Megabytes">MB</abbr></td>
</tr>
<tr>
<td>2<abbr title="Gigabytes">GB</abbr></td>
<td>1.86<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>4<abbr title="Gigabytes">GB</abbr></td>
<td>3.72<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>8<abbr title="Gigabytes">GB</abbr></td>
<td>7.44<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>20<abbr title="Gigabytes">GB</abbr></td>
<td>18.6<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>30<abbr title="Gigabytes">GB</abbr></td>
<td>27.9<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>60<abbr title="Gigabytes">GB</abbr></td>
<td>55.8<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>80<abbr title="Gigabytes">GB</abbr></td>
<td>74.4<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>120<abbr title="Gigabytes">GB</abbr></td>
<td>111.6<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>160<abbr title="Gigabytes">GB</abbr></td>
<td>148.8<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>250<abbr title="Gigabytes">GB</abbr></td>
<td>232.5<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>320<abbr title="Gigabytes">GB</abbr></td>
<td>297.6<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>500<abbr title="Gigabytes">GB</abbr></td>
<td>465<abbr title="Gigabytes">GB</abbr></td>
</tr>
<tr>
<td>1<abbr title="Terabyte">TB</abbr></td>
<td>952.32<abbr title="Gigabytes">GB</abbr></td>
</tr>
</table>
<p>If you’re mathematically inclined, you’ll notice that the difference is 7%; to find out the real capacity of any hard drive, just take off 7%.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/06/21/real-hard-drive-capacities/feed/</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>Griffin iTrip SE</title>
		<link>http://www.sidroberts.co.uk/2008/06/21/griffin-itrip-se/</link>
		<comments>http://www.sidroberts.co.uk/2008/06/21/griffin-itrip-se/#comments</comments>
		<pubDate>Sat, 21 Jun 2008 12:57:30 +0000</pubDate>
		<dc:creator>Sid Roberts</dc:creator>
				<category><![CDATA[Reviews]]></category>
		<category><![CDATA[fm]]></category>
		<category><![CDATA[ipod]]></category>
		<category><![CDATA[radio]]></category>
		<category><![CDATA[transmitter]]></category>

		<guid isPermaLink="false">http://www.sidroberts.co.uk/?p=38</guid>
		<description><![CDATA[The Griffin iTrip SE was pretty much unusable. The transmission is incredibly quiet — so quiet, that even at high volumes, you still struggle to hear it. To add to insult, it turns itself off every so often due to “power saving functionality”. If it’s a European model, things are made difficult still with a [...]]]></description>
			<content:encoded><![CDATA[<p>The <a href="http://www.amazon.co.uk/exec/obidos/ASIN/B0010X5I4Y">Griffin iTrip <acronym title="Second Edition">SE</acronym></a> was pretty much unusable. The transmission is incredibly quiet — so quiet, that even at high volumes, you still struggle to hear it. To add to insult, it turns itself off every so often due to “power saving functionality”. If it’s a European model, things are made difficult still with a feature to deter pirate radio stations by selecting a random frequency every time the device is turned on. Sadly, it makes life worse for the majority that use it for good and I’d hardly say it deters pirate radio stations (although why use it if it only has a weak signal anyway?).</p>
<p>There can be good things said about the wide compatibility of iPods that it can connect to and the ability to still use the headphone jack whilst transmitting is an added bonus. However, if you appreciate music (and by that, I mean listen), you should avoid it completely.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.sidroberts.co.uk/2008/06/21/griffin-itrip-se/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>

<!-- Dynamic page generated in 4.875 seconds. -->
<!-- Cached page generated by WP-Super-Cache on 2010-07-30 01:11:33 -->
<!-- Compression = gzip -->