<?xml version="1.0" encoding="utf-8"?><?xml-stylesheet href='http://feeds.feedsky.com/styles/temp01.xsl' type='text/xsl' ?><!--这是一个由Feedsy提供技术支持的Feed，为了提高读者阅读的体验，以及满足用户美化自己Feed的需要，我们设计了多种精美的Feed模板，提供给大家选择，所有最终呈现出来的样式，皆由用户自愿选择使用，未经许可，任何团体和个人，请不要擅自修改样式或者盗用，这是对于用户选择权的尊重。--><rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:fs="http://www.feedsky.com/namespace/feed" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0"><channel><atom:link href="http://feeds.feedsky.com/csdn.net/Kvci" type="application/rss+xml" rel="self"></atom:link><fs:self_link href="http://feeds.feedsky.com/csdn.net/Kvci" type="application/rss+xml"></fs:self_link><lastBuildDate>Thu, 02 Nov 2006 16:31:00 GMT</lastBuildDate><title>努力</title><description>变牛逼</description><link>http://blog.csdn.net/kvci/</link><item><title>WinPcap tutorial: a step by step guide to using WinPcap</title><link>http://blog.csdn.net/Kvci/archive/2006/11/02/1363034.aspx</link><wfw:comment>http://blog.csdn.net/kvci/comments/1363034.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/kvci/comments/commentRss/1363034.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1363034</trackback:ping><description>无聊 翻译 WinPcap 手册&lt;img src =&quot;http://blog.csdn.net/kvci/aggbug/1363034.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Fri, 03 Nov 2006 00:31:00 +0800</pubDate><author>Kvci</author><comments>http://blog.csdn.net/Kvci/archive/2006/11/02/1363034.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/Kvci/archive/2006/11/02/1363034.aspx</guid><dc:creator>Kvci</dc:creator></item><item><title>TESTGO ！VERY GOOD！</title><link>http://blog.csdn.net/Kvci/archive/2006/07/27/988651.aspx</link><wfw:comment>http://blog.csdn.net/kvci/comments/988651.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/kvci/comments/commentRss/988651.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=988651</trackback:ping><description>网页围棋？&lt;img src =&quot;http://blog.csdn.net/kvci/aggbug/988651.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Fri, 28 Jul 2006 06:26:00 +0800</pubDate><author>Kvci</author><comments>http://blog.csdn.net/Kvci/archive/2006/07/27/988651.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/Kvci/archive/2006/07/27/988651.aspx</guid><dc:creator>Kvci</dc:creator></item><item><title>基于贝塞尔平滑法的改进</title><link>http://blog.csdn.net/Kvci/archive/2006/07/27/984523.aspx</link><wfw:comment>http://blog.csdn.net/kvci/comments/984523.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/kvci/comments/commentRss/984523.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=984523</trackback:ping><description>一种基于贝塞尔平滑法的改进&lt;img src =&quot;http://blog.csdn.net/kvci/aggbug/984523.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Thu, 27 Jul 2006 18:15:00 +0800</pubDate><author>Kvci</author><comments>http://blog.csdn.net/Kvci/archive/2006/07/27/984523.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/Kvci/archive/2006/07/27/984523.aspx</guid><dc:creator>Kvci</dc:creator></item><item><title>取Run下所有值</title><link>http://blog.csdn.net/Kvci/archive/2006/02/04/591659.aspx</link><wfw:comment>http://blog.csdn.net/kvci/comments/591659.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/kvci/comments/commentRss/591659.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=591659</trackback:ping><description>来源：http://blog.csdn.net/lanyus/　&lt;img src =&quot;http://blog.csdn.net/kvci/aggbug/591659.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Sat, 04 Feb 2006 22:04:00 +0800</pubDate><author>Kvci</author><comments>http://blog.csdn.net/Kvci/archive/2006/02/04/591659.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/Kvci/archive/2006/02/04/591659.aspx</guid><dc:creator>Kvci</dc:creator></item><item><title>Joel Spolsky给计算机系学生的建议</title><link>http://blog.csdn.net/Kvci/archive/2005/12/12/550267.aspx</link><wfw:comment>http://blog.csdn.net/kvci/comments/550267.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/kvci/comments/commentRss/550267.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=550267</trackback:ping><description>下面就是Joel给计算机系学生们七条免费的建议:

毕业前学会写作 
毕业前学会C语言 
毕业前学习微观经济学（microeconomics） 
不要因为某些非计算机课程枯燥无趣就敬而远之 
学习有大量编程实践的课程 
不要担心工作都跑到印度去了 
好好做夏季毕业实习
&lt;img src =&quot;http://blog.csdn.net/kvci/aggbug/550267.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Mon, 12 Dec 2005 22:53:00 +0800</pubDate><author>Kvci</author><comments>http://blog.csdn.net/Kvci/archive/2005/12/12/550267.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/Kvci/archive/2005/12/12/550267.aspx</guid><dc:creator>Kvci</dc:creator></item><item><title>0/1背包问题(回朔法)</title><link>http://blog.csdn.net/Kvci/archive/2005/03/21/325331.aspx</link><wfw:comment>http://blog.csdn.net/kvci/comments/325331.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/kvci/comments/commentRss/325331.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=325331</trackback:ping><description>0/1背包问题(回朔法)&lt;img src =&quot;http://blog.csdn.net/kvci/aggbug/325331.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Mon, 21 Mar 2005 18:55:00 +0800</pubDate><author>Kvci</author><comments>http://blog.csdn.net/Kvci/archive/2005/03/21/325331.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/Kvci/archive/2005/03/21/325331.aspx</guid><dc:creator>Kvci</dc:creator></item><item><title>旅行商问题(分枝定界)</title><link>http://blog.csdn.net/Kvci/archive/2005/03/21/325330.aspx</link><wfw:comment>http://blog.csdn.net/kvci/comments/325330.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/kvci/comments/commentRss/325330.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=325330</trackback:ping><description>旅行商问题(分枝定界)&lt;img src =&quot;http://blog.csdn.net/kvci/aggbug/325330.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Mon, 21 Mar 2005 18:54:00 +0800</pubDate><author>Kvci</author><comments>http://blog.csdn.net/Kvci/archive/2005/03/21/325330.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/Kvci/archive/2005/03/21/325330.aspx</guid><dc:creator>Kvci</dc:creator></item><item><title>最短路径算法</title><link>http://blog.csdn.net/Kvci/archive/2005/03/21/325328.aspx</link><wfw:comment>http://blog.csdn.net/kvci/comments/325328.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/kvci/comments/commentRss/325328.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=325328</trackback:ping><description>最短路径算法&lt;img src =&quot;http://blog.csdn.net/kvci/aggbug/325328.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Mon, 21 Mar 2005 18:52:00 +0800</pubDate><author>Kvci</author><comments>http://blog.csdn.net/Kvci/archive/2005/03/21/325328.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/Kvci/archive/2005/03/21/325328.aspx</guid><dc:creator>Kvci</dc:creator></item><item><title>dos之syn flood攻击</title><link>http://blog.csdn.net/Kvci/archive/2005/03/21/325315.aspx</link><wfw:comment>http://blog.csdn.net/kvci/comments/325315.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/kvci/comments/commentRss/325315.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=325315</trackback:ping><description>dos之syn flood攻击&lt;img src =&quot;http://blog.csdn.net/kvci/aggbug/325315.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Mon, 21 Mar 2005 18:40:00 +0800</pubDate><author>Kvci</author><comments>http://blog.csdn.net/Kvci/archive/2005/03/21/325315.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/Kvci/archive/2005/03/21/325315.aspx</guid><dc:creator>Kvci</dc:creator></item><item><title>ACM竞赛介绍与策略</title><link>http://blog.csdn.net/Kvci/archive/2005/03/21/325305.aspx</link><wfw:comment>http://blog.csdn.net/kvci/comments/325305.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/kvci/comments/commentRss/325305.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=325305</trackback:ping><description>ACM竞赛介绍与策略 &lt;img src =&quot;http://blog.csdn.net/kvci/aggbug/325305.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Mon, 21 Mar 2005 18:35:00 +0800</pubDate><author>Kvci</author><comments>http://blog.csdn.net/Kvci/archive/2005/03/21/325305.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/Kvci/archive/2005/03/21/325305.aspx</guid><dc:creator>Kvci</dc:creator></item></channel></rss>