<?xml version="1.0" encoding="UTF-8"?><!-- generator="wordpress/2.2.1" -->
<rss version="2.0" 
	xmlns:content="http://purl.org/rss/1.0/modules/content/">
<channel>
	<title>Comments for Kiv's Weblog</title>
	<link>http://k-i-v.com</link>
	<description>The grand stuff holder place of Josef Nankivell</description>
	<pubDate>Thu, 20 Nov 2008 22:44:43 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.2.1</generator>

	<item>
		<title>Comment on Breadth and depth first search by Josef Nankivell</title>
		<link>http://k-i-v.com/2008/03/18/breadth-and-depth-first-search/#comment-594</link>
		<author>Josef Nankivell</author>
		<pubDate>Sat, 12 Apr 2008 17:19:08 +0000</pubDate>
		<guid>http://k-i-v.com/2008/03/18/breadth-and-depth-first-search/#comment-594</guid>
		<description>&lt;p&gt;Hi Diptesh,&lt;/p&gt;
&lt;p&gt;You will need to use Dijkstra's Algorithm to find the shortest path/value when transversing nodes.&lt;/p&gt;
&lt;p&gt;Steps to consider before coding:&lt;/p&gt;
&lt;p&gt;0. create: distance/cost list, previous node list, visited nodes list, current node&lt;br /&gt;
1. start node = 0.&lt;br /&gt;
2. distance list values = infinity.&lt;br /&gt;
3. values in visited nodes list = false.&lt;br /&gt;
4. current node = start node.&lt;br /&gt;
5. current node = visited.&lt;br /&gt;
6. update cost &#38; previous list based on next reachable node.&lt;br /&gt;
7. update current node to the unvisited node that can be reached with lowest cost from start node.&lt;br /&gt;
8. loop from step 5 until all nodes are visited.&lt;/p&gt;

Hope this helps, I will email you a coded example.

Regards,
Josef Nankivell.</description>
		<content:encoded><![CDATA[<p>Hi Diptesh,</p>
<p>You will need to use Dijkstra&#8217;s Algorithm to find the shortest path/value when transversing nodes.</p>
<p>Steps to consider before coding:</p>
<p>0. create: distance/cost list, previous node list, visited nodes list, current node<br />
1. start node = 0.<br />
2. distance list values = infinity.<br />
3. values in visited nodes list = false.<br />
4. current node = start node.<br />
5. current node = visited.<br />
6. update cost &amp; previous list based on next reachable node.<br />
7. update current node to the unvisited node that can be reached with lowest cost from start node.<br />
8. loop from step 5 until all nodes are visited.</p>
<p>Hope this helps, I will email you a coded example.</p>
<p>Regards,<br />
Josef Nankivell.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Breadth and depth first search by Diptesh</title>
		<link>http://k-i-v.com/2008/03/18/breadth-and-depth-first-search/#comment-562</link>
		<author>Diptesh</author>
		<pubDate>Mon, 07 Apr 2008 07:56:44 +0000</pubDate>
		<guid>http://k-i-v.com/2008/03/18/breadth-and-depth-first-search/#comment-562</guid>
		<description>The above code is good. But i'm tryin to find several alternative paths using stored procedure, with data from table. The Stored procedure returns alternative paths and their total distance. Then, i've planned to fetch it in asp page and display all the alternative paths with thier respective total distance and also display the one with smallest distance value, which is the shortest path, but i'm havin problem in doing this.
Can u help me in some way ?
Thanx in advance,
Diptesh.</description>
		<content:encoded><![CDATA[<p>The above code is good. But i&#8217;m tryin to find several alternative paths using stored procedure, with data from table. The Stored procedure returns alternative paths and their total distance. Then, i&#8217;ve planned to fetch it in asp page and display all the alternative paths with thier respective total distance and also display the one with smallest distance value, which is the shortest path, but i&#8217;m havin problem in doing this.<br />
Can u help me in some way ?<br />
Thanx in advance,<br />
Diptesh.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Cold Boot Attacks on Encryption Keys by kiv</title>
		<link>http://k-i-v.com/2008/02/25/cold-boot-attacks-on-encryption-keys/#comment-243</link>
		<author>kiv</author>
		<pubDate>Tue, 04 Mar 2008 13:48:38 +0000</pubDate>
		<guid>http://k-i-v.com/2008/02/25/cold-boot-attacks-on-encryption-keys/#comment-243</guid>
		<description>Hi ac adapter! 

Sounds like a good idea initially, I will look in to this further.

Thanks for your comment!</description>
		<content:encoded><![CDATA[<p>Hi ac adapter! </p>
<p>Sounds like a good idea initially, I will look in to this further.</p>
<p>Thanks for your comment!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on LG Viewty Review by kiv</title>
		<link>http://k-i-v.com/2008/01/02/lg-viewty-review/#comment-242</link>
		<author>kiv</author>
		<pubDate>Tue, 04 Mar 2008 13:17:11 +0000</pubDate>
		<guid>http://k-i-v.com/2008/01/02/lg-viewty-review/#comment-242</guid>
		<description>&lt;p&gt;Hi osman,&lt;/p&gt;
&lt;p&gt;The methods of scrolling on the Viewty change depending one what you are doing.&lt;/p&gt;
&lt;p&gt;&#62; In the main menus, simply click the icons on the right and drag the menus with your finger to access functions off of the screen.&lt;/p&gt;
&lt;p&gt;&#62; When viewing files, such as mp3s, you will need to click the sidebar on the right with your thumb/finger.&lt;/p&gt;
&lt;p&gt;I hope this helps.&lt;/p&gt;
&lt;p&gt;Come back soon!&lt;/p&gt;
</description>
		<content:encoded><![CDATA[<p>Hi osman,</p>
<p>The methods of scrolling on the Viewty change depending one what you are doing.</p>
<p>&gt; In the main menus, simply click the icons on the right and drag the menus with your finger to access functions off of the screen.</p>
<p>&gt; When viewing files, such as mp3s, you will need to click the sidebar on the right with your thumb/finger.</p>
<p>I hope this helps.</p>
<p>Come back soon!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Cold Boot Attacks on Encryption Keys by ac adapter</title>
		<link>http://k-i-v.com/2008/02/25/cold-boot-attacks-on-encryption-keys/#comment-240</link>
		<author>ac adapter</author>
		<pubDate>Tue, 04 Mar 2008 12:20:51 +0000</pubDate>
		<guid>http://k-i-v.com/2008/02/25/cold-boot-attacks-on-encryption-keys/#comment-240</guid>
		<description>What about simply wiping the key (i.e., unmounting the encrypted volume) when the machine is about to get screen-locked/put to sleep/hibernate? The user will have to re-enter the passphrase, to be sure.</description>
		<content:encoded><![CDATA[<p>What about simply wiping the key (i.e., unmounting the encrypted volume) when the machine is about to get screen-locked/put to sleep/hibernate? The user will have to re-enter the passphrase, to be sure.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on LG Viewty Review by osman</title>
		<link>http://k-i-v.com/2008/01/02/lg-viewty-review/#comment-239</link>
		<author>osman</author>
		<pubDate>Tue, 04 Mar 2008 12:15:02 +0000</pubDate>
		<guid>http://k-i-v.com/2008/01/02/lg-viewty-review/#comment-239</guid>
		<description>how do you use the scroller as i cant look all the available functions because i cant scroll down.</description>
		<content:encoded><![CDATA[<p>how do you use the scroller as i cant look all the available functions because i cant scroll down.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on I have no change jar! by Dan Williams</title>
		<link>http://k-i-v.com/2008/02/26/i-have-no-change-jar/#comment-188</link>
		<author>Dan Williams</author>
		<pubDate>Wed, 27 Feb 2008 11:24:02 +0000</pubDate>
		<guid>http://k-i-v.com/2008/02/26/i-have-no-change-jar/#comment-188</guid>
		<description>I personally feel the guy being rich makes it worse! Anyway great article made me chuckle.</description>
		<content:encoded><![CDATA[<p>I personally feel the guy being rich makes it worse! Anyway great article made me chuckle.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Dexter - Season 1 Review by Karen Halls</title>
		<link>http://k-i-v.com/2008/02/21/dexter-season-1-review/#comment-182</link>
		<author>Karen Halls</author>
		<pubDate>Thu, 21 Feb 2008 21:51:41 +0000</pubDate>
		<guid>http://k-i-v.com/2008/02/21/dexter-season-1-review/#comment-182</guid>
		<description>I found your site on google blog search and read a few of your other posts.  Keep up the good work.  Just added your RSS feed to my feed reader.  Look forward to reading more from you.

Karen Halls</description>
		<content:encoded><![CDATA[<p>I found your site on google blog search and read a few of your other posts.  Keep up the good work.  Just added your RSS feed to my feed reader.  Look forward to reading more from you.</p>
<p>Karen Halls</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on How to Ubuntu&#8230; by BridgetAnjellla</title>
		<link>http://k-i-v.com/2007/08/23/how-to-ubuntu/#comment-70</link>
		<author>BridgetAnjellla</author>
		<pubDate>Sat, 12 Jan 2008 13:21:30 +0000</pubDate>
		<guid>http://k-i-v.com/2007/08/23/how-to-ubuntu/#comment-70</guid>
		<description>Gutes Neues Jahr  2008.!</description>
		<content:encoded><![CDATA[<p>Gutes Neues Jahr  2008.!</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on 100 hundred things we didn&#8217;t know last year. by 100 hundred things we didnâ€™t know last year.</title>
		<link>http://k-i-v.com/2008/01/01/100-hundred-things-we-didnt-know-last-year/#comment-69</link>
		<author>100 hundred things we didnâ€™t know last year.</author>
		<pubDate>Mon, 07 Jan 2008 15:36:26 +0000</pubDate>
		<guid>http://k-i-v.com/2008/01/01/100-hundred-things-we-didnt-know-last-year/#comment-69</guid>
		<description>[...] 100 hundred things we didnâ€™t know last year. 2. Saddam Husseinâ€™s codename while in US &#8230; by a year in prison or an unlimited fine, under &#8230; card, so gets a friend to download songs from [...]</description>
		<content:encoded><![CDATA[<p>[&#8230;] 100 hundred things we didnâ€™t know last year. 2. Saddam Husseinâ€™s codename while in US &#8230; by a year in prison or an unlimited fine, under &#8230; card, so gets a friend to download songs from [&#8230;]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
