<?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>zab lab</title>
	<atom:link href="http://www.zablab.net/?feed=rss2" rel="self" type="application/rss+xml" />
	<link>http://www.zablab.net</link>
	<description>music, technology and the power of mathematics</description>
	<lastBuildDate>Thu, 04 Feb 2010 06:09:31 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.6</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Sampling Rate and Interval Partitions</title>
		<link>http://www.zablab.net/?p=149</link>
		<comments>http://www.zablab.net/?p=149#comments</comments>
		<pubDate>Thu, 04 Feb 2010 05:13:08 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Analysis]]></category>
		<category><![CDATA[Maths]]></category>
		<category><![CDATA[Music]]></category>
		<category><![CDATA[Technology]]></category>

		<guid isPermaLink="false">http://www.zablab.net/?p=149</guid>
		<description><![CDATA[<p>In music, the sampling rate, sample rate, or sampling frequency defines the number of samples per second (or per other unit) taken from a continuous signal to make a discrete signal. For time-domain signals, the unit for sampling rate is 1/s. The inverse of the sampling frequency is the sampling period or sampling interval, which [...]]]></description>
			<content:encoded><![CDATA[<p>In music, the <strong>sampling rate</strong>, <strong>sample rate</strong>, or <strong>sampling frequency</strong> defines the number of samples per second (or per other unit) taken from a continuous signal to make a discrete signal. For time-domain signals, the unit for sampling rate is 1/s. The inverse of the sampling frequency is the <em>sampling period</em> or <em>sampling interval</em>, which is the time between samples.</p>
<div class="wp-caption alignleft" style="width: 190px"><img title="Analog Signal" src="http://upload.wikimedia.org/wikipedia/commons/thumb/c/ca/Analog_signal.png/180px-Analog_signal.png" alt="" width="180" height="93" /><p class="wp-caption-text">Analog Signal</p></div>
<div class="wp-caption alignright" style="width: 190px"><img title="Sampled Signal" src="http://upload.wikimedia.org/wikipedia/commons/thumb/6/6e/Sampled_signal.png/180px-Sampled_signal.png" alt="Sampled Signal" width="180" height="95" /><p class="wp-caption-text">Sampled Signal</p></div>
<p style="text-align: justify;">
<p style="text-align: justify;">
<p style="text-align: justify;">
<p style="text-align: justify;">
<p style="text-align: justify;">
<p style="text-align: justify;">
<p style="text-align: justify;">
<p style="text-align: left;">In mathematics, a partition of an interval <span>[<em>a</em>,<em>b</em>]</span> is a finite sequence</p>
<p style="text-align: center;"><img class="aligncenter" src="http://upload.wikimedia.org/math/6/7/7/6770cfb4ff99112d3a757e410b700bd7.png" alt="a = x_0 &lt; x_1 &lt; x_2 &lt; \cdots &lt; x_n = b" width="278" height="18" /></p>
<p>Each <span>[<em>x</em><sub><em>i</em></sub>,<em>x</em><sub><em>i</em> + 1</sub>]</span> is called a <em>subinterval</em> of the partition. The <em>mesh</em> of a partition is defined to be the length of the longest subinterval <span>[<em>x</em><sub><em>i</em></sub>,<em>x</em><sub><em>i</em> + 1</sub>]</span>, that is, it is <span>max(<em>x</em><sub><em>i</em> + 1</sub> − <em>x</em><sub><em>i</em></sub>)</span> where <img src="http://upload.wikimedia.org/math/b/9/c/b9c2e906c034aac5ee566167b365ae7e.png" alt="0 \le i \le n - 1" />. It is also called the <em>norm</em> of the partition.</p>
<p>A <em>tagged partition of an interval</em> is a partition of an interval together with a finite sequence of numbers <img src="http://upload.wikimedia.org/math/4/6/c/46ce1561759675e92312b4ffe3aa534e.png" alt="t_0, \ldots, t_{n-1}" /> subject to the conditions that for each <span><em>i</em></span>, <img src="http://upload.wikimedia.org/math/b/5/b/b5bdd4498300db5d5a89937426defaba.png" alt="x_i \le t_i \le x_{i+1}" />. In other words, it is a partition together with a distinguished point of every subinterval. The mesh of a tagged partition is the same as that of an ordinary partition.</p>
<p>Suppose that <img src="http://upload.wikimedia.org/math/6/e/7/6e7368cb9fdf72f4673e67aa54804a38.png" alt="x_0,\ldots,x_n" /> together with <img src="http://upload.wikimedia.org/math/4/6/c/46ce1561759675e92312b4ffe3aa534e.png" alt="t_0,\ldots,t_{n-1}" /> are a tagged partition of <span>[<em>a</em>,<em>b</em>]</span>, and that <img src="http://upload.wikimedia.org/math/b/8/b/b8bcdde8ab99cca6936ac5843a89546d.png" alt="y_0,\ldots,y_m" /> together with <img src="http://upload.wikimedia.org/math/5/8/2/582a86a6f691afe45d694e2392cc5e9c.png" alt="s_0,\ldots,s_{m-1}" /> are another tagged partition of <span>[<em>a</em>,<em>b</em>]</span>. We say that <img src="http://upload.wikimedia.org/math/b/8/b/b8bcdde8ab99cca6936ac5843a89546d.png" alt="y_0,\ldots,y_m" /> and <img src="http://upload.wikimedia.org/math/5/8/2/582a86a6f691afe45d694e2392cc5e9c.png" alt="s_0,\ldots,s_{m-1}" /> together are a <em>refinement</em> of <img src="http://upload.wikimedia.org/math/6/e/7/6e7368cb9fdf72f4673e67aa54804a38.png" alt="x_0,\ldots,x_n" /> together with <img src="http://upload.wikimedia.org/math/4/6/c/46ce1561759675e92312b4ffe3aa534e.png" alt="t_0,\ldots,t_{n-1}" /> if for each integer <span><em>i</em></span> with <img src="http://upload.wikimedia.org/math/0/5/b/05bdb30cea2ff2f555ea8236e1845287.png" alt="0 \le i \le n" />, there is an integer <span><em>r</em>(<em>i</em>)</span> such that <span><em>x</em><sub><em>i</em></sub> = <em>y</em><sub><em>r</em>(<em>i</em>)</sub></span> and such that <span><em>t</em><sub><em>i</em></sub> = <em>s</em><sub><em>j</em></sub></span> for some <span><em>j</em></span> with <img src="http://upload.wikimedia.org/math/e/a/7/ea776a34ebe22b10f346d07f9fa7ce8b.png" alt="r(i) \le j \le r(i+1) - 1" />. (It is not correct to allow <span><em>j</em></span> to equal <span><em>r</em>(<em>i</em> + 1)</span> because <span><em>s</em><sub><em>r</em>(<em>i</em> + 1)</sub></span> is greater than or equal to <span><em>x</em><sub><em>i</em> + 1</sub></span>.) Said more simply, a refinement of a tagged partition takes the starting partition and adds more tags, but does not take any away.</p>
<p>We can define a partial order on the set of all tagged partitions by saying that one tagged partition is bigger than another if the bigger one is a refinement of the smaller one.</p>
<p style="text-align: center;"><img class="aligncenter" title="Interval Partitions" src="http://upload.wikimedia.org/wikipedia/commons/e/ee/Riemann.gif" alt="" width="683" height="366" /></p>
<p>There is a pretty obvious similarity between those two notions : the refinement of a tagged partition represents an increase of the sampling rate.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.zablab.net/?feed=rss2&amp;p=149</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
		<item>
		<title>dj moss &#8212; artifakts</title>
		<link>http://www.zablab.net/?p=144</link>
		<comments>http://www.zablab.net/?p=144#comments</comments>
		<pubDate>Sat, 19 Dec 2009 13:03:26 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Music]]></category>

		<guid isPermaLink="false">http://www.zablab.net/?p=144</guid>
		<description><![CDATA[<p></p>
]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.zablab.net/files/sets/01-dj_moss--artifakts.mp3"><img class="alignleft size-medium wp-image-145" title="mc_final" src="http://www.zablab.net/wp-content/uploads/2009/12/mc_final-300x300.jpg" alt="mc_final" width="300" height="300" /></a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.zablab.net/?feed=rss2&amp;p=144</wfw:commentRss>
		<slash:comments>2</slash:comments>
<enclosure url="http://www.zablab.net/files/sets/01-dj_moss--artifakts.mp3" length="82954112" type="audio/mpeg" />
		</item>
		<item>
		<title>Hard Drive partitioning strategies</title>
		<link>http://www.zablab.net/?p=138</link>
		<comments>http://www.zablab.net/?p=138#comments</comments>
		<pubDate>Sat, 24 Oct 2009 12:19:21 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Technology]]></category>
		<category><![CDATA[hard drive]]></category>
		<category><![CDATA[partition]]></category>
		<category><![CDATA[strategy]]></category>

		<guid isPermaLink="false">http://www.zablab.net/?p=138</guid>
		<description><![CDATA[<p>It’s generally a good idea to create at least 3 partitions per hard disk.</p>
<p>Exceptions : HDD dedicated for video capture or digital media are best partitioned as a single, large partition.</p>
<p> </p>
<p>Multiple Operating Systems : Create a separate partition for each O/S</p>
<p> </p>
<p>Advantages of multi-partition drives :</p>
<p>_Efficiency in file/folder organization</p>
<p>_Improved back-up safety</p>
<p>_Better and quicker defrag</p>
<p>_Speed [...]]]></description>
			<content:encoded><![CDATA[<p>It’s generally a good idea to create at least 3 partitions per hard disk.</p>
<p><strong><span style="text-decoration: underline;">Exceptions : </span></strong>HDD dedicated for video capture or digital media are best partitioned as a single, large partition.</p>
<p><strong><span style="text-decoration: underline;"> </span></strong></p>
<p><strong><span style="text-decoration: underline;">Multiple Operating Systems :</span></strong> Create a separate partition for each O/S</p>
<p><strong><span style="text-decoration: underline;"> </span></strong></p>
<p><strong><span style="text-decoration: underline;">Advantages of multi-partition drives :</span></strong></p>
<p>_Efficiency in file/folder organization</p>
<p>_Improved back-up safety</p>
<p>_Better and quicker defrag</p>
<p>_Speed improvement</p>
<p>_Longer hardware lifetime</p>
<p><strong><span style="text-decoration: underline;"> </span></strong></p>
<p><strong><span style="text-decoration: underline;">Tips :</span></strong></p>
<p>_Create a partition at the outer/leading edge of the drive and install operating system and applications there.</p>
<p>_Use the inner/slower parts of the disk for storing files that don’t require access during normal system operation (i.e. downloads, drivers, back-ups, Ghost images etc)</p>
<p><strong><span style="text-decoration: underline;">Recommended Software :</span></strong></p>
<p><a href="http://www.partition-manager.com/">http://www.partition-manager.com/</a></p>
<p><a href="http://www.symantec.com/norton/partitionmagic">http://www.symantec.com/norton/partitionmagic</a></p>
<p><a href="http://www.acronis.com/homecomputing/products/diskdirector/">http://www.acronis.com/homecomputing/products/diskdirector/</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.zablab.net/?feed=rss2&amp;p=138</wfw:commentRss>
		<slash:comments>4</slash:comments>
		</item>
		<item>
		<title>Windows 7: First Impressions (part 1)</title>
		<link>http://www.zablab.net/?p=120</link>
		<comments>http://www.zablab.net/?p=120#comments</comments>
		<pubDate>Sat, 10 Oct 2009 21:54:16 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Reviews]]></category>
		<category><![CDATA[Software]]></category>
		<category><![CDATA[impressions]]></category>
		<category><![CDATA[microsoft]]></category>
		<category><![CDATA[windows 7]]></category>

		<guid isPermaLink="false">http://www.zablab.net/?p=120</guid>
		<description><![CDATA[<p>A new version of the Windows operating system always makes users, and especially musicians, a bit skeptical about the upgrade. There have been several bad experiences in the past, and in some cases most users would even postpone the upgrade to a new version, i.e. Windows Vista, until an improved one would show up. The [...]]]></description>
			<content:encoded><![CDATA[<p>A new version of the Windows operating system always makes users, and especially musicians, a bit skeptical about the upgrade. There have been several bad experiences in the past, and in some cases most users would even postpone the upgrade to a new version, i.e. Windows Vista, until an improved one would show up. The 7<sup>th</sup> version is here and the rumors about it, make the upgrade look tempting. Let’s see if the rumors can turn out to be true!</p>
<p><strong>Step 1: Installation</strong></p>
<p>It seems like Microsoft has made a huge progress in making the installation procedure as compact and rapid as possible. All a user has to declare is the language and the regional settings and, after just a few restarts, the operating system is set up within 20 minutes! Nevertheless, the advanced users will feel very unhappy with the lack of option to select parts of the software to be installed. Perhaps an ‘advanced setup’ feature would be more convenient.</p>
<p><strong>Step 2: Booting up for the first time</strong></p>
<p>For those who upgrade from Windows Vista, the new interface experience will not be as dramatic as for those who replace Windows XP. ‘Aero Peek’ will surely get most of the users excited, while the new taskbar will provide an aroma of different platforms – Mac OS X and KDE. The notification system and the user account control (UAC) seem to be a lot more quiet than the ones of Windows Vista. The brand new &#8216;action centre&#8217;, which replaces the &#8217;security centre&#8217; of Windows XP, will be in charge for announcing critical news about the operating system.</p>
<p><strong>Step 3: Setting up the hardware</strong></p>
<p>In most cases, Windows itself will recognize and install the appropriate drivers for each part of the hardware &#8211; no need for frustrating searches over the Internet or for CDs that came with your hardware. Most motherboard parts are properly installed with the included drivers database. For anything else, the &#8216;windows update&#8217; will get the job done for you.  You only have to separately install drivers for devices like external audio interfaces. In the case of Firewire audio interfaces, be extra cautious with the driver installed for the IEEE 1394 chipset. In my case, it had to be replaced with the generic ‘1394 OHCI Compliant Host Controller (Legacy)&#8217; driver to get my TC Konnekt 8 up and running, smoothly. A blue screen might appear when changing the driver – nothing to worry about. Everything will be normal, afterwards. Needless to say, the <a href="http://www.asio4all.com" target="_blank">ASIO4ALL</a> driver is, still, a neat solution for seamless workflow on audio and MIDI operations.</p>
<p><strong>Step 4: Recommended Software</strong></p>
<p>It would be useful to add some utilities to your software arsenal:</p>
<ul>
<li>CCleaner (<a href="http://www.ccleaner.com/" target="_blank">http://www.ccleaner.com</a>), to clean the cache memory appropriately.</li>
<li>Defraggler (<a href="http://www.defraggler.com/" target="_blank">http://www.defraggler.com</a>), to defrag your hard disk drives efficiently.</li>
<li>RevoUninstaller (<a href="http://www.revouninstaller.com/" target="_blank">http://www.revouninstaller.com</a>), to uninstall applications radically.</li>
</ul>
<p>If you run Defraggler, you ‘ll be happy to see that just after the installation there’s no urge for a defrag, as in previous versions of Windows.</p>
]]></content:encoded>
			<wfw:commentRss>http://www.zablab.net/?feed=rss2&amp;p=120</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Essential reading for mathematicians</title>
		<link>http://www.zablab.net/?p=106</link>
		<comments>http://www.zablab.net/?p=106#comments</comments>
		<pubDate>Thu, 01 Oct 2009 01:33:00 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Maths]]></category>
		<category><![CDATA[Teaching]]></category>

		<guid isPermaLink="false">http://www.zablab.net/?p=106</guid>
		<description><![CDATA[<p>George Pólya &#8211; How to Solve It (A New Aspect of Mathematical Method)</p>
<p>Terence Tao &#8211; Solving Mathematical Problems : A Personal Perspective</p>
<p>Donald M. Davis &#8211; The Nature and Power of Mathematics</p>
<p>Rudy Rucker &#8211; Infinity and the Mind : The Science and Philosophy of the Infinite</p>
]]></description>
			<content:encoded><![CDATA[<p><a href="http://www.amazon.com/How-Solve-Mathematical-Princeton-Science/dp/069111966X/ref=sr_1_1?ie=UTF8&amp;s=books&amp;qid=1254360176&amp;sr=1-1" target="_blank">George Pólya &#8211; How to Solve It (A New Aspect of Mathematical Method)</a></p>
<p><a href="http://www.amazon.com/Solving-Mathematical-Problems-Personal-Perspective/dp/0199205604/ref=sr_1_1?ie=UTF8&amp;s=books&amp;qid=1254360087&amp;sr=8-1" target="_blank">Terence Tao &#8211; Solving Mathematical Problems : A Personal Perspective</a></p>
<p><a href="http://www.amazon.com/Nature-Power-Mathematics-Dover-Books/dp/0486438961/ref=sr_1_1?ie=UTF8&amp;s=books&amp;qid=1254360280&amp;sr=1-1" target="_blank">Donald M. Davis &#8211; The Nature and Power of Mathematics</a></p>
<p><a href="http://www.amazon.com/Infinity-Mind-Philosophy-Infinite-Princeton/dp/0691121273/ref=sr_1_1?ie=UTF8&amp;s=books&amp;qid=1254360349&amp;sr=1-1" target="_blank">Rudy Rucker &#8211; Infinity and the Mind : The Science and Philosophy of the Infinite</a></p>
]]></content:encoded>
			<wfw:commentRss>http://www.zablab.net/?feed=rss2&amp;p=106</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
