<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[lotus]]></title><description><![CDATA[一沙一世界，一花一天国]]></description><link>https://blog.csdn.net/magicblue</link><language>zh-cn</language><generator>https://blog.csdn.net/</generator><copyright><![CDATA[Copyright &copy; magicblue]]></copyright><item><title><![CDATA[Boost Graph Library 学习笔记]]></title><link>https://blog.csdn.net/magicblue/article/details/4208976</link><guid>https://blog.csdn.net/magicblue/article/details/4208976</guid><author>magicblue</author><pubDate>Fri, 22 May 2009 15:34:00 +0800</pubDate><description><![CDATA[最近研究了一下boost graph library(简称BGL)。由于文档的过于简略和使用者数量较少，一时半会弄明白还不是那么简单的一件事情。网上也有不少入门文章，这些我就不再说了，主要说一下我遇到的一些问题。 1. descriptor 和 iterator的区别BGL里有2种迭代器性质的东西，分别是descriptor和iterator。在STL里只有一种迭代器，就是iterat]]></description><category></category></item><item><title><![CDATA[从C++与Unicode说开去]]></title><link>https://blog.csdn.net/magicblue/article/details/2077625</link><guid>https://blog.csdn.net/magicblue/article/details/2077625</guid><author>magicblue</author><pubDate>Fri, 01 Feb 2008 23:51:00 +0800</pubDate><description><![CDATA[以前遇到过这么一个问题，用C++序列化一个wstring。程序很简单，因为C++有wofstream：std::wstring str   =   L"s"; std::wofstream ofile("F://test.txt"); ofile 我使用的编译器是VC9，wchar_t是2字节。那么test.txt就应该是unicode的宽字节，其大小应该是2字节。但是实际的结果却是1字节]]></description><category></category></item><item><title><![CDATA[据说是一道百度的笔试题]]></title><link>https://blog.csdn.net/magicblue/article/details/2065594</link><guid>https://blog.csdn.net/magicblue/article/details/2065594</guid><author>magicblue</author><pubDate>Fri, 25 Jan 2008 16:28:00 +0800</pubDate><description><![CDATA[在论坛上看到有人问这个，觉得其中一个有点意思就回了。顺便把回的内容发在这里。题目是这样的：/////////////////////////////////////////////////////////////////////  answer beginning  //////////////////////////////////////////////////////////////]]></description><category></category></item><item><title><![CDATA[扩展A*算法]]></title><link>https://blog.csdn.net/magicblue/article/details/2026426</link><guid>https://blog.csdn.net/magicblue/article/details/2026426</guid><author>magicblue</author><pubDate>Sat, 05 Jan 2008 10:43:00 +0800</pubDate><description><![CDATA[ A*算法作为一种启发式寻路算法比一般的shortest path finding比如dijkstra算法更快，但是由于启发式的原因，其结果不一定是最优的。 只有在一定的条件下，A*算法才能保证找到最优解。这个条件是A*算法的启发式h(n)必须是consistency或者monotonicity的：A heuristic h(n) is consistent if, for every]]></description><category></category></item><item><title><![CDATA[boost在vc9(vc2008)下的安装]]></title><link>https://blog.csdn.net/magicblue/article/details/1954399</link><guid>https://blog.csdn.net/magicblue/article/details/1954399</guid><author>magicblue</author><pubDate>Wed, 19 Dec 2007 21:38:00 +0800</pubDate><description><![CDATA[这几天写代码需要序列化自定义类，类的定义可以抽象为vector >。我本想通过重载operator> 来实现序列化。但是写入是写入了，读就读不出来了。在读完第一个对象之后istream的tellg()返回了-1，导致后续的对象无法读取。后来我使用boost很方便的就完成了序列化的工作。但是我使用的编译环境是VC9，boost还没有针对vc9的编译设置，所以编译安装还是花了点时间。针对VC9，下]]></description><category></category></item><item><title><![CDATA[《Chomsky: ideas and ideals》笔记]]></title><link>https://blog.csdn.net/magicblue/article/details/1704534</link><guid>https://blog.csdn.net/magicblue/article/details/1704534</guid><author>magicblue</author><pubDate>Tue, 24 Jul 2007 01:28:00 +0800</pubDate><description><![CDATA[Connectionism的基础是把语言看成技能和习惯的行为主义。Connectionism的致命弱点是它不依赖结构，而语言是有自身结构的。语言习得靠语言结构。Chomsky的理论基础和语言的随机产生初看起来相背离，但是实际上它们并不相关。语言自产生初期到现今，人类已经经历了150万年的进化。在这段时期，进化的力量可以产生很明显的效果：DNA发生变化，使大脑进化出某种结构。Chomsk]]></description><category></category></item><item><title><![CDATA[搜索之路在何方]]></title><link>https://blog.csdn.net/magicblue/article/details/1704533</link><guid>https://blog.csdn.net/magicblue/article/details/1704533</guid><author>magicblue</author><pubDate>Tue, 24 Jul 2007 01:24:00 +0800</pubDate><description><![CDATA[        互联网是一个真正改变人们生活方式的发明，与这种改变相提并论的恐怕得拿出电气化了。互联网最初是一个军方项目，但是在民用化之后，其中的信息量不停的增长。随之而来的问题则是如何在海量的信息中找到你所需要的信息，这很重要。搜索技术的发展时间很短，大概只有十多年。直到今天，搜索技术在本质上仍旧是最开始的关键词匹配。获得高质量的查询结果关键在于你要以机器的方式去思考应该如何写出那几个查询词，如]]></description><category></category></item><item><title><![CDATA[奥卡姆剃刀]]></title><link>https://blog.csdn.net/magicblue/article/details/1662626</link><guid>https://blog.csdn.net/magicblue/article/details/1662626</guid><author>magicblue</author><pubDate>Fri, 22 Jun 2007 22:24:00 +0800</pubDate><description><![CDATA[        奥卡姆剃刀是一个哲学原理，是由经院哲学家奥卡姆提出的。这个原理十分简单：“如无必要，勿增实体”。这不是科学原理，因为这个说法是无法证明的。和数学一样，在一次又一次对自身的验证中，你只需相信它。这个原理被现代科学广泛的使用，在这样一个背景下，更详细的说法是：“给定一观察数据和若干种描述观察数据的理论，优先选择最简单的理论”。        我举个简单的例子：给定一个观察数据，一个]]></description><category></category></item><item><title><![CDATA[Language model of IR]]></title><link>https://blog.csdn.net/magicblue/article/details/1604337</link><guid>https://blog.csdn.net/magicblue/article/details/1604337</guid><author>magicblue</author><pubDate>Fri, 11 May 2007 11:57:00 +0800</pubDate><description><![CDATA[    Traditional IR is divided into 2 parts: index and retrival. Things connect them is words counts: tf and idf. Whatever models traditional IR is(vector, probabilistic...), the core context of repres]]></description><category></category></item><item><title><![CDATA[Notes about NLP and IR]]></title><link>https://blog.csdn.net/magicblue/article/details/1547909</link><guid>https://blog.csdn.net/magicblue/article/details/1547909</guid><author>magicblue</author><pubDate>Sat, 31 Mar 2007 22:37:00 +0800</pubDate><description><![CDATA[NLP introduces First Order Predicate Calculus to implementing meaning of our languages, however this method cant completely express the meaning understanded by ourselves because machine has not perce]]></description><category></category></item><item><title><![CDATA[the initialization of ANN weights and activation function]]></title><link>https://blog.csdn.net/magicblue/article/details/1511491</link><guid>https://blog.csdn.net/magicblue/article/details/1511491</guid><author>magicblue</author><pubDate>Sat, 17 Feb 2007 16:58:00 +0800</pubDate><description><![CDATA[the chioce of weights initialization and activation function is a paradigm: 1. weights must be small suitablely at random(too small is bad). 2. activation function is supposed to be linear in range of]]></description><category></category></item><item><title><![CDATA[Fitness function]]></title><link>https://blog.csdn.net/magicblue/article/details/1489847</link><guid>https://blog.csdn.net/magicblue/article/details/1489847</guid><author>magicblue</author><pubDate>Mon, 22 Jan 2007 11:57:00 +0800</pubDate><description><![CDATA[I am always thinking about the fitness function, its a natural selection pressure simulation with a little bias. the difference between them is that for a given problem, fitness function for it is st]]></description><category></category></item><item><title><![CDATA[A tag of infinite]]></title><link>https://blog.csdn.net/magicblue/article/details/1478170</link><guid>https://blog.csdn.net/magicblue/article/details/1478170</guid><author>magicblue</author><pubDate>Tue, 09 Jan 2007 15:52:00 +0800</pubDate><description><![CDATA[infinite is a important concept in programming. the following is a class which implements this concept.template // T was supposed to be legal number typesclass neg_infinite{public:    explicit neg_i]]></description><category></category></item><item><title><![CDATA[Bayes optimal]]></title><link>https://blog.csdn.net/magicblue/article/details/1475284</link><guid>https://blog.csdn.net/magicblue/article/details/1475284</guid><author>magicblue</author><pubDate>Fri, 05 Jan 2007 23:36:00 +0800</pubDate><description><![CDATA[as its name, bayes optimal decision is the best decision over all decisions, however it is impossible to working out solutions because it requires to summing out all hypothese. you cant obtain ALL hy]]></description><category></category></item><item><title><![CDATA[Rethinking "A refinement..."]]></title><link>https://blog.csdn.net/magicblue/article/details/1470983</link><guid>https://blog.csdn.net/magicblue/article/details/1470983</guid><author>magicblue</author><pubDate>Sun, 31 Dec 2006 13:58:00 +0800</pubDate><description><![CDATA[a paper "Hierarchically classifying documents using very few words" gives a better explanation about the question why refinement works without overfitting. this paper proposes a new classification met]]></description><category></category></item><item><title><![CDATA[Thinking about a paper "A Refinement Approach to Handling Model Misfit in Text Categorization"]]></title><link>https://blog.csdn.net/magicblue/article/details/1422894</link><guid>https://blog.csdn.net/magicblue/article/details/1422894</guid><author>magicblue</author><pubDate>Thu, 30 Nov 2006 19:01:00 +0800</pubDate><description><![CDATA[    in this paper, i think the most interesting thing is why there is no overfitting? overfitting is inevitable when training on training examples too much. because decision line(surface) fits specifi]]></description><category></category></item><item><title><![CDATA[Why evolution involves sex?]]></title><link>https://blog.csdn.net/magicblue/article/details/1351374</link><guid>https://blog.csdn.net/magicblue/article/details/1351374</guid><author>magicblue</author><pubDate>Wed, 25 Oct 2006 23:14:00 +0800</pubDate><description><![CDATA[the author of > David Ruelle says: "because adds is significant". interesting viewpoint! the difference between sexual reproduction and asexual reproduction is the process of DNA does crossover or not]]></description><category></category></item><item><title><![CDATA[With or Without You]]></title><link>https://blog.csdn.net/magicblue/article/details/1333666</link><guid>https://blog.csdn.net/magicblue/article/details/1333666</guid><author>magicblue</author><pubDate>Fri, 13 Oct 2006 20:36:00 +0800</pubDate><description><![CDATA[With or Without YouU2See the stone set in your eyesSee the thorn twist in your sideI wait for youSleight of hand and twist of fateOn a bed of nails she makes me waitAnd I wait.... without you看见你眼里坚硬]]></description><category></category></item><item><title><![CDATA[Measures of information]]></title><link>https://blog.csdn.net/magicblue/article/details/1328681</link><guid>https://blog.csdn.net/magicblue/article/details/1328681</guid><author>magicblue</author><pubDate>Tue, 10 Oct 2006 14:37:00 +0800</pubDate><description><![CDATA[may be the measures of information has many ways, just like distance can be defined in many ways. how to describe a human-being? you have to admit this job is very diffcult in a "normal" way, or you]]></description><category></category></item><item><title><![CDATA[Language and Wittgenstein]]></title><link>https://blog.csdn.net/magicblue/article/details/1197110</link><guid>https://blog.csdn.net/magicblue/article/details/1197110</guid><author>magicblue</author><pubDate>Sat, 09 Sep 2006 00:10:00 +0800</pubDate><description><![CDATA[first of all, consider two problems:1. given a family  which has two children, one of them is a boy, what is the probability of other child is a boy?most people give the answer 1/2, but it is inco]]></description><category></category></item></channel></rss>