﻿<?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>博客园-jackyrong-随笔分类-算法等</title><link>http://jackyrong.cnblogs.com/category/35021.html</link><description /><language>zh-cn</language><lastBuildDate>Sat, 17 May 2008 15:11:54 GMT</lastBuildDate><pubDate>Sat, 17 May 2008 15:11:54 GMT</pubDate><ttl>60</ttl><item><title>装饰模式学习</title><link>http://www.cnblogs.com/jackyrong/archive/2008/01/05/1026648.html</link><dc:creator>jackyrong的世界</dc:creator><author>jackyrong的世界</author><pubDate>Fri, 04 Jan 2008 17:10:00 GMT</pubDate><guid>http://www.cnblogs.com/jackyrong/archive/2008/01/05/1026648.html</guid><wfw:comment>http://www.cnblogs.com/jackyrong/comments/1026648.html</wfw:comment><comments>http://www.cnblogs.com/jackyrong/archive/2008/01/05/1026648.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/jackyrong/comments/commentRss/1026648.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jackyrong/services/trackbacks/1026648.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: &nbsp;&nbsp;今天看大话设计模式一书，发现真的写的不错，之前一直有点疑惑的装饰模式，今晚看懂了，现笔记之。具体见该书相关部分，主要是解析下。&nbsp;usingSystem...&nbsp;&nbsp;<a href='http://www.cnblogs.com/jackyrong/archive/2008/01/05/1026648.html'>阅读全文</a><img src ="http://www.cnblogs.com/jackyrong/aggbug/1026648.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://jackyrong.cnblogs.com/" target="_blank">jackyrong的世界</a> 2008-01-05 01:10 <a href="http://www.cnblogs.com/jackyrong/archive/2008/01/05/1026648.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>设计模式之桥接模式</title><link>http://www.cnblogs.com/jackyrong/archive/2007/07/14/817990.html</link><dc:creator>jackyrong的世界</dc:creator><author>jackyrong的世界</author><pubDate>Sat, 14 Jul 2007 03:53:00 GMT</pubDate><guid>http://www.cnblogs.com/jackyrong/archive/2007/07/14/817990.html</guid><wfw:comment>http://www.cnblogs.com/jackyrong/comments/817990.html</wfw:comment><comments>http://www.cnblogs.com/jackyrong/archive/2007/07/14/817990.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/jackyrong/comments/commentRss/817990.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jackyrong/services/trackbacks/817990.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:    今天看了下设计模式中的桥接模式，发现还是很有趣味的，笔记之。举个例子，比如GG要约会MM，不同的MM喜欢喜欢不同的地点，<br>比如rose喜欢去电影院，KITTY喜欢去西餐厅，而TOM，peter 都是GG，他们要分别去约会这两位MM了，而约会的地点，全部由MM决定<br>&nbsp;&nbsp;<a href='http://www.cnblogs.com/jackyrong/archive/2007/07/14/817990.html'>阅读全文</a><img src ="http://www.cnblogs.com/jackyrong/aggbug/817990.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://jackyrong.cnblogs.com/" target="_blank">jackyrong的世界</a> 2007-07-14 11:53 <a href="http://www.cnblogs.com/jackyrong/archive/2007/07/14/817990.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>Lucene Inverted index(倒排索引)原来快速入门</title><link>http://www.cnblogs.com/jackyrong/archive/2007/01/11/618122.html</link><dc:creator>jackyrong的世界</dc:creator><author>jackyrong的世界</author><pubDate>Thu, 11 Jan 2007 13:23:00 GMT</pubDate><guid>http://www.cnblogs.com/jackyrong/archive/2007/01/11/618122.html</guid><wfw:comment>http://www.cnblogs.com/jackyrong/comments/618122.html</wfw:comment><comments>http://www.cnblogs.com/jackyrong/archive/2007/01/11/618122.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/jackyrong/comments/commentRss/618122.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jackyrong/services/trackbacks/618122.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: Lucene是一个高性能的JAVA全文检索工具包，它使用的是倒排文件索引结构。该结构及相应的生成算法如下：&nbsp;&nbsp;<a href='http://www.cnblogs.com/jackyrong/archive/2007/01/11/618122.html'>阅读全文</a><img src ="http://www.cnblogs.com/jackyrong/aggbug/618122.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://jackyrong.cnblogs.com/" target="_blank">jackyrong的世界</a> 2007-01-11 21:23 <a href="http://www.cnblogs.com/jackyrong/archive/2007/01/11/618122.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>数据挖掘中的中位数</title><link>http://www.cnblogs.com/jackyrong/archive/2006/12/21/599832.html</link><dc:creator>jackyrong的世界</dc:creator><author>jackyrong的世界</author><pubDate>Thu, 21 Dec 2006 15:13:00 GMT</pubDate><guid>http://www.cnblogs.com/jackyrong/archive/2006/12/21/599832.html</guid><wfw:comment>http://www.cnblogs.com/jackyrong/comments/599832.html</wfw:comment><comments>http://www.cnblogs.com/jackyrong/archive/2006/12/21/599832.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cnblogs.com/jackyrong/comments/commentRss/599832.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jackyrong/services/trackbacks/599832.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:   在数据挖掘的学习中，遇到了中位数的概念，一GOOGLe之下，其实发现以前的课本等是没学习到的，但现在的中小学生都有学了，<br>现在复习一下&nbsp;&nbsp;<a href='http://www.cnblogs.com/jackyrong/archive/2006/12/21/599832.html'>阅读全文</a><img src ="http://www.cnblogs.com/jackyrong/aggbug/599832.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://jackyrong.cnblogs.com/" target="_blank">jackyrong的世界</a> 2006-12-21 23:13 <a href="http://www.cnblogs.com/jackyrong/archive/2006/12/21/599832.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>一个简单的算法题</title><link>http://www.cnblogs.com/jackyrong/archive/2006/10/27/541736.html</link><dc:creator>jackyrong的世界</dc:creator><author>jackyrong的世界</author><pubDate>Fri, 27 Oct 2006 04:56:00 GMT</pubDate><guid>http://www.cnblogs.com/jackyrong/archive/2006/10/27/541736.html</guid><wfw:comment>http://www.cnblogs.com/jackyrong/comments/541736.html</wfw:comment><comments>http://www.cnblogs.com/jackyrong/archive/2006/10/27/541736.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/jackyrong/comments/commentRss/541736.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jackyrong/services/trackbacks/541736.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 昨天看到一道算法题，是说RSA加密的，大致的原理是，对于给定的三个正整数a,b,c，计算a的b次方除以C的余数。其中1&lt;=ab&lt;c&lt;=32768可以看到，如果用一般的直接算法，会设...&nbsp;&nbsp;<a href='http://www.cnblogs.com/jackyrong/archive/2006/10/27/541736.html'>阅读全文</a><img src ="http://www.cnblogs.com/jackyrong/aggbug/541736.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://jackyrong.cnblogs.com/" target="_blank">jackyrong的世界</a> 2006-10-27 12:56 <a href="http://www.cnblogs.com/jackyrong/archive/2006/10/27/541736.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>如何判断一个点是否在三角形内部</title><link>http://www.cnblogs.com/jackyrong/archive/2006/07/22/457085.html</link><dc:creator>jackyrong的世界</dc:creator><author>jackyrong的世界</author><pubDate>Sat, 22 Jul 2006 03:40:00 GMT</pubDate><guid>http://www.cnblogs.com/jackyrong/archive/2006/07/22/457085.html</guid><wfw:comment>http://www.cnblogs.com/jackyrong/comments/457085.html</wfw:comment><comments>http://www.cnblogs.com/jackyrong/archive/2006/07/22/457085.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/jackyrong/comments/commentRss/457085.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jackyrong/services/trackbacks/457085.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 昨天学到一个方法，虽然是数学上的问题，而且也没找到具体严格的证明，但觉得知道下其用法还是很好的。问题：如何判断一个点是否在三角形内部方法：比如三角型外有点P，三角型ABC，先算ABC的面积，然后算三角...&nbsp;&nbsp;<a href='http://www.cnblogs.com/jackyrong/archive/2006/07/22/457085.html'>阅读全文</a><img src ="http://www.cnblogs.com/jackyrong/aggbug/457085.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://jackyrong.cnblogs.com/" target="_blank">jackyrong的世界</a> 2006-07-22 11:40 <a href="http://www.cnblogs.com/jackyrong/archive/2006/07/22/457085.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>&gt;算法的力量(李开复)</title><link>http://www.cnblogs.com/jackyrong/archive/2006/04/14/375526.html</link><dc:creator>jackyrong的世界</dc:creator><author>jackyrong的世界</author><pubDate>Fri, 14 Apr 2006 11:35:00 GMT</pubDate><guid>http://www.cnblogs.com/jackyrong/archive/2006/04/14/375526.html</guid><wfw:comment>http://www.cnblogs.com/jackyrong/comments/375526.html</wfw:comment><comments>http://www.cnblogs.com/jackyrong/archive/2006/04/14/375526.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cnblogs.com/jackyrong/comments/commentRss/375526.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jackyrong/services/trackbacks/375526.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 算法的力量(李开复),著名计算机科学家李开复的一篇好文&nbsp;&nbsp;<a href='http://www.cnblogs.com/jackyrong/archive/2006/04/14/375526.html'>阅读全文</a><img src ="http://www.cnblogs.com/jackyrong/aggbug/375526.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://jackyrong.cnblogs.com/" target="_blank">jackyrong的世界</a> 2006-04-14 19:35 <a href="http://www.cnblogs.com/jackyrong/archive/2006/04/14/375526.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>老师的一封回信</title><link>http://www.cnblogs.com/jackyrong/archive/2006/03/27/359984.html</link><dc:creator>jackyrong的世界</dc:creator><author>jackyrong的世界</author><pubDate>Mon, 27 Mar 2006 05:37:00 GMT</pubDate><guid>http://www.cnblogs.com/jackyrong/archive/2006/03/27/359984.html</guid><wfw:comment>http://www.cnblogs.com/jackyrong/comments/359984.html</wfw:comment><comments>http://www.cnblogs.com/jackyrong/archive/2006/03/27/359984.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cnblogs.com/jackyrong/comments/commentRss/359984.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jackyrong/services/trackbacks/359984.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 上学期在读在职MSE时，遇上了位不错的优秀导师，教我们的面向对象设计课程；一个学期下来，收获良多，虽然这个学期不教我们里，但依然和我们有书信的来往交换问题的看法，指点我们。前几天，一位同学去信询问几个问题，其中一篇是关于最近网上很流行的一篇文章，也是讲“程序设计经验”的<br>（http://bbs.zol.com.cn/index20060131/index_27_26468.html），其中老师给出了他的一些看法，偶觉得也挺客观的，故摘取之并收藏之，虽然各人有不同的看法，但作为学生，也能从中看到今后努力的方向<br>&nbsp;&nbsp;<a href='http://www.cnblogs.com/jackyrong/archive/2006/03/27/359984.html'>阅读全文</a><img src ="http://www.cnblogs.com/jackyrong/aggbug/359984.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://jackyrong.cnblogs.com/" target="_blank">jackyrong的世界</a> 2006-03-27 13:37 <a href="http://www.cnblogs.com/jackyrong/archive/2006/03/27/359984.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>(转）贝叶斯算法</title><link>http://www.cnblogs.com/jackyrong/archive/2005/09/16/238008.html</link><dc:creator>jackyrong的世界</dc:creator><author>jackyrong的世界</author><pubDate>Thu, 15 Sep 2005 16:08:00 GMT</pubDate><guid>http://www.cnblogs.com/jackyrong/archive/2005/09/16/238008.html</guid><wfw:comment>http://www.cnblogs.com/jackyrong/comments/238008.html</wfw:comment><comments>http://www.cnblogs.com/jackyrong/archive/2005/09/16/238008.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/jackyrong/comments/commentRss/238008.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jackyrong/services/trackbacks/238008.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 很好的介绍算法的文章，很通俗易懂，可以给人信心继续读下去了一．贝叶斯过滤算法的基本步骤1)收集大量的垃圾邮件和非垃圾邮件，建立垃圾邮件集和非垃圾邮件集。2)提取邮件主题和邮件体中的独立字串例如...&nbsp;&nbsp;<a href='http://www.cnblogs.com/jackyrong/archive/2005/09/16/238008.html'>阅读全文</a><img src ="http://www.cnblogs.com/jackyrong/aggbug/238008.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://jackyrong.cnblogs.com/" target="_blank">jackyrong的世界</a> 2005-09-16 00:08 <a href="http://www.cnblogs.com/jackyrong/archive/2005/09/16/238008.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>（转）正则表达式</title><link>http://www.cnblogs.com/jackyrong/archive/2005/09/09/233512.html</link><dc:creator>jackyrong的世界</dc:creator><author>jackyrong的世界</author><pubDate>Fri, 09 Sep 2005 12:03:00 GMT</pubDate><guid>http://www.cnblogs.com/jackyrong/archive/2005/09/09/233512.html</guid><wfw:comment>http://www.cnblogs.com/jackyrong/comments/233512.html</wfw:comment><comments>http://www.cnblogs.com/jackyrong/archive/2005/09/09/233512.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnblogs.com/jackyrong/comments/commentRss/233512.html</wfw:commentRss><trackback:ping>http://www.cnblogs.com/jackyrong/services/trackbacks/233512.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 一个正则表达式就是由普通字符（例如字符a到z）以及特殊字符（称为元字符）组成的文字模式。该模式描述在查找文字主体时待匹配的一个或多个字符串。正则表达式作为一个模板，将某个字符模式与所搜索的字符串...&nbsp;&nbsp;<a href='http://www.cnblogs.com/jackyrong/archive/2005/09/09/233512.html'>阅读全文</a><img src ="http://www.cnblogs.com/jackyrong/aggbug/233512.html?type=1" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://jackyrong.cnblogs.com/" target="_blank">jackyrong的世界</a> 2005-09-09 20:03 <a href="http://www.cnblogs.com/jackyrong/archive/2005/09/09/233512.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>