﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>博客园-Adrian's Tech Blog-随笔分类-Algorithm</title><link>http://www.cnblogs.com/Dah/category/75101.html</link><description /><language>zh-cn</language><lastBuildDate>Sun, 18 May 2008 07:36:56 GMT</lastBuildDate><pubDate>Sun, 18 May 2008 07:36:56 GMT</pubDate><ttl>60</ttl><item><title>Fast Fourier Transform in C# (Cooky-Turkey)</title><link>http://www.cnblogs.com/Dah/archive/2007/08/10/850904.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Fri, 10 Aug 2007 07:30:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2007/08/10/850904.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/850904.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2007/08/10/850904.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/850904.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/850904.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: C# code snippet below is an illustration of the Cooky-Turkey algorithm, the performance may suck when processing huge datasets, but you can use arrays of double instead of arrays of complex number structure to reduce the performance impact by object initializations and method invocations(overloaded operators).&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2007/08/10/850904.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/850904.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2007-08-10 15:30 <a href="http://www.cnblogs.com/Dah/archive/2007/08/10/850904.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>LZW and Huffman Compression Algorithms Implemented in C#</title><link>http://www.cnblogs.com/Dah/archive/2007/06/27/798210.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Wed, 27 Jun 2007 14:00:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2007/06/27/798210.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/798210.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2007/06/27/798210.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/798210.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/798210.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2007/06/27/798210.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/798210.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2007-06-27 22:00 <a href="http://www.cnblogs.com/Dah/archive/2007/06/27/798210.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Just By Hand: 得到Assembly的Public Key Token</title><link>http://www.cnblogs.com/Dah/archive/2007/06/21/792302.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Thu, 21 Jun 2007 13:19:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2007/06/21/792302.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/792302.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2007/06/21/792302.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/792302.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/792302.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2007/06/21/792302.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/792302.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2007-06-21 21:19 <a href="http://www.cnblogs.com/Dah/archive/2007/06/21/792302.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>GLEE: Graph Layout Execution Engine from Microsoft Research</title><link>http://www.cnblogs.com/Dah/archive/2007/06/12/780965.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Tue, 12 Jun 2007 11:50:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2007/06/12/780965.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/780965.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2007/06/12/780965.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/780965.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/780965.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: GLEE 是 Microsoft Research 的 Lev Nachmanson  开发的一个.NET 图形布局和查看的工具, 遵循了 Sugiyama 方案, 可以生成有层次的的布局, 自然地使用图形表示流程的信息, 如程序流程, 状态机, 类图等等..&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2007/06/12/780965.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/780965.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2007-06-12 19:50 <a href="http://www.cnblogs.com/Dah/archive/2007/06/12/780965.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>LL(1) 文法推导</title><link>http://www.cnblogs.com/Dah/archive/2007/06/01/768231.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Fri, 01 Jun 2007 14:19:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2007/06/01/768231.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/768231.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2007/06/01/768231.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/768231.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/768231.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一个LL(1)文法推导的课程设计&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2007/06/01/768231.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/768231.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2007-06-01 22:19 <a href="http://www.cnblogs.com/Dah/archive/2007/06/01/768231.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Philosopher Dinner Problem Simulation in C#</title><link>http://www.cnblogs.com/Dah/archive/2007/04/01/696137.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Sun, 01 Apr 2007 11:04:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2007/04/01/696137.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/696137.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2007/04/01/696137.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/696137.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/696137.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 操作系统概念中"哲学家就餐问题"的C#模拟&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2007/04/01/696137.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/696137.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2007-04-01 19:04 <a href="http://www.cnblogs.com/Dah/archive/2007/04/01/696137.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Fast Gaussian Blur Algorithm in C#</title><link>http://www.cnblogs.com/Dah/archive/2007/03/30/694527.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Fri, 30 Mar 2007 14:17:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2007/03/30/694527.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/694527.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2007/03/30/694527.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/694527.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/694527.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Inspired by http://incubator.quasimondo.com/processing/fastblur.pde  , I wrote a piece of CSharp code to implement this efficient "gaussian blur" alogorithm for one of my .Net project.<br>The concept of the "fast" is avoiding floating point calculation and pre-calculating some multiplication operation, storing the results into a large two-dimension array for later blurring operations, so it saves lots of time.&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2007/03/30/694527.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/694527.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2007-03-30 22:17 <a href="http://www.cnblogs.com/Dah/archive/2007/03/30/694527.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>数独游戏局的建立算法 (Sudoku Generating Algorithm Using Backtracking)</title><link>http://www.cnblogs.com/Dah/archive/2007/03/08/668653.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Thu, 08 Mar 2007 14:14:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2007/03/08/668653.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/668653.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2007/03/08/668653.html#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/668653.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/668653.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2007/03/08/668653.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/668653.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2007-03-08 22:14 <a href="http://www.cnblogs.com/Dah/archive/2007/03/08/668653.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>欧几里德算法(辗转相除法) 求最大公约数</title><link>http://www.cnblogs.com/Dah/archive/2007/03/06/666114.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Tue, 06 Mar 2007 14:42:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2007/03/06/666114.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/666114.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2007/03/06/666114.html#Feedback</comments><slash:comments>8</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/666114.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/666114.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: ..........&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2007/03/06/666114.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/666114.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2007-03-06 22:42 <a href="http://www.cnblogs.com/Dah/archive/2007/03/06/666114.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>A Generic Genetic Algorithm Implemented with C#</title><link>http://www.cnblogs.com/Dah/archive/2007/02/11/647543.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Sun, 11 Feb 2007 08:24:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2007/02/11/647543.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/647543.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2007/02/11/647543.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/647543.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/647543.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: C#实现的泛型遗传算法&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2007/02/11/647543.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/647543.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2007-02-11 16:24 <a href="http://www.cnblogs.com/Dah/archive/2007/02/11/647543.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>把12341234转换成"一千两百三十四万一千两百三十四"的算法...</title><link>http://www.cnblogs.com/Dah/archive/2007/01/07/614148.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Sun, 07 Jan 2007 09:52:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2007/01/07/614148.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/614148.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2007/01/07/614148.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/614148.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/614148.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 在CSDN上看到这个问题,觉得有点意思就用C#写了这么个算法...其实不是很复杂,主要是要处理多种输入的情况.输出的例子:12341234一千二百三十四万一千二百三十四10001024一千万一千零...&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2007/01/07/614148.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/614148.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2007-01-07 17:52 <a href="http://www.cnblogs.com/Dah/archive/2007/01/07/614148.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>C#实现的排列与组合(Permutation &amp; Combination)算法</title><link>http://www.cnblogs.com/Dah/archive/2006/11/25/572183.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Sat, 25 Nov 2006 08:21:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2006/11/25/572183.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/572183.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2006/11/25/572183.html#Feedback</comments><slash:comments>7</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/572183.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/572183.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Iwrotetwogenericclasstoimplementthesetwoalgorithms,soyoucanusetheseclassestogenerat...&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2006/11/25/572183.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/572183.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2006-11-25 16:21 <a href="http://www.cnblogs.com/Dah/archive/2006/11/25/572183.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>面试题:蚂蚁爬杆</title><link>http://www.cnblogs.com/Dah/archive/2006/11/20/566140.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Mon, 20 Nov 2006 07:18:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2006/11/20/566140.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/566140.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2006/11/20/566140.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/566140.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/566140.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Question有一根27厘米的细木杆，在第3厘米、7厘米、11厘米、17厘米、23厘米这五个位置上各有一只蚂蚁。木杆很细，不能同时通过一只蚂蚁。开始时，蚂蚁的头朝左还是朝右是任意的，它们只会朝前走或...&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2006/11/20/566140.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/566140.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2006-11-20 15:18 <a href="http://www.cnblogs.com/Dah/archive/2006/11/20/566140.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>About the Implementation of .Net Framework's HashTable</title><link>http://www.cnblogs.com/Dah/archive/2006/11/12/558430.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Sun, 12 Nov 2006 09:25:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2006/11/12/558430.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/558430.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2006/11/12/558430.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/558430.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/558430.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: FromRotor(SharedSourceCLI):/*77:&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;Implementation...&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2006/11/12/558430.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/558430.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2006-11-12 17:25 <a href="http://www.cnblogs.com/Dah/archive/2006/11/12/558430.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Selection in expected linear time</title><link>http://www.cnblogs.com/Dah/archive/2006/11/06/552185.html</link><dc:creator>Adrian H.</dc:creator><author>Adrian H.</author><pubDate>Mon, 06 Nov 2006 11:29:00 GMT</pubDate><guid>http://www.cnblogs.com/Dah/archive/2006/11/06/552185.html</guid><wfw:comment>http://www.cnblogs.com/Dah/comments/552185.html</wfw:comment><comments>http://www.cnblogs.com/Dah/archive/2006/11/06/552185.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/Dah/comments/commentRss/552185.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/Dah/services/trackbacks/552185.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 下面的是我用C#写的一个算法,功能是从一个数组中选择第i小的一个数,平均时间复杂度是&#920;(n).usingSystem;usingSystem.Collections....&nbsp;&nbsp;<a href='http://www.cnblogs.com/Dah/archive/2006/11/06/552185.html'>阅读全文</a><img src ="http://www.cnblogs.com/Dah/aggbug/552185.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://Dah.cnblogs.com/" target="_blank">Adrian H.</a> 2006-11-06 19:29 <a href="http://www.cnblogs.com/Dah/archive/2006/11/06/552185.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>