<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Jason's blog]]></title><description><![CDATA[from SNUCSE]]></description><link>https://blog.youkuaiyun.com/xx_snoopy</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; xx_snoopy]]></copyright><item><title><![CDATA[Implement WalkSAT algorithm that solve the CNF Boolean formula]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/5423322</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/5423322</guid><author>xx_snoopy</author><pubDate>Sat, 27 Mar 2010 21:15:00 +0800</pubDate><description><![CDATA[Goal Implement WalkSAT algorithm that solve the CNF Boolean formula.Implement Encoder that generate CNF notation for N-Queen for given Using both module to solve N-Queen problem. First, Wh]]></description><category></category></item><item><title><![CDATA[Dijkstra Algorithm 算法详解]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4993508</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4993508</guid><author>xx_snoopy</author><pubDate>Sat, 12 Dec 2009 20:42:00 +0800</pubDate><description><![CDATA[算法介绍  Dijkstra算法是由荷兰计算机科学家艾兹格·迪科斯彻发现的。算法解决的是有向图中最短路径问题。  举例来说，如果图中的顶点表示城市，而边上的权重表示著城市间开车行经的距离。 Dijkstra算法可以用来找到两个城市之间的最短路径。  Dijkstra算法的输入包含了一个有权重的有向图G，以及G中的一个来源顶点S。 我们以V表示G中所有顶点的集合。 每一个图中的边，都是两个顶点所形成]]></description><category></category></item><item><title><![CDATA[一个很全面的Binary Search Tree java实现]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4927536</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4927536</guid><author>xx_snoopy</author><pubDate>Wed, 02 Dec 2009 23:14:00 +0800</pubDate><description><![CDATA[<img id="_0_90_Open_Image" style="display: inline;" onclick="this.style.display=none; document.getElementById(_0_90_Open_Text).style.display=none; document.getElementById(_0_90_Closed_Image]]></description><category></category></item><item><title><![CDATA[Huffman Tree]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4856652</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4856652</guid><author>xx_snoopy</author><pubDate>Mon, 23 Nov 2009 15:03:00 +0800</pubDate><description><![CDATA[什么是Huffman coding?霍夫曼编码(Huffman Coding)是一种编码方式，是一种用于无损数据压缩算法。1952年，David A. Huffman在麻省理工攻读博士时所发明的，并发表于《一种构建极小多馀编码的方法》（A Method for the Construction of Minimum-Redundancy Codes）一文。在电脑资料处理中，霍夫曼编码使用变]]></description><category></category></item><item><title><![CDATA[Java 读取文件小例一则]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4809565</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4809565</guid><author>xx_snoopy</author><pubDate>Sat, 14 Nov 2009 02:21:00 +0800</pubDate><description><![CDATA[import java.io.BufferedReader;import java.io.FileNotFoundException;import java.io.FileReader;import java.io.IOException;public class TestReadFile{    public static void main(String[] args)]]></description><category></category></item><item><title><![CDATA[二叉树的表示（基于一维数组）]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4795384</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4795384</guid><author>xx_snoopy</author><pubDate>Tue, 10 Nov 2009 20:27:00 +0800</pubDate><description><![CDATA[ 通常有三种方法表示二叉树(Binary Tree)1.基于数组，带有索引。可以表示任何二叉树。2.基于一维数组，通常用来表示完全二叉树(Complete Binary Tree)3.基于引用，类似链表。 以下是基于居于一维数组的JAVA CODE public class ArrayTree  {  	private Object array[]; 	]]></description><category></category></item><item><title><![CDATA[Ocaml 入门整理2]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4790273</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4790273</guid><author>xx_snoopy</author><pubDate>Mon, 09 Nov 2009 17:11:00 +0800</pubDate><description><![CDATA[Ocaml Standard Library 了解ModuleStructure = implementation of module signture = interface of module signture 有点类似Java 里面的Interface举个例子module type STACK =  sig    type a t             e]]></description><category></category></item><item><title><![CDATA[一个关于计求质数的算法]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4745672</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4745672</guid><author>xx_snoopy</author><pubDate>Fri, 30 Oct 2009 00:00:00 +0800</pubDate><description><![CDATA[public class Primes {public static void main(String args[]) {int maxValue = 50; // The maximum value to be checked.// Check all values from 2 to maxValue:OuterLoop:for(int i=2 ; i<=maxValue ]]></description><category></category></item><item><title><![CDATA[TRIE树 介绍]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4729602</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4729602</guid><author>xx_snoopy</author><pubDate>Mon, 26 Oct 2009 15:51:00 +0800</pubDate><description><![CDATA[Trie树就是字符树，其核心思想就是空间换时间。举个简单的例子。给你100000个长度不超过10的单词。对于每一个单词，我们要判断他出没出现过，如果出现了，第一次出现第几个位置。这题当然可以用hash来，但是我要介绍的是trie树。在某些方面它的用途更大。比如说对于某一个单词，我要询问它的前缀是否出现过。这样hash就不好搞了，而用trie还是很简单。现在回到例子中，如果我们用最傻的方法，对于每一]]></description><category></category></item><item><title><![CDATA[Ocaml 的入门整理 1]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4724770</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4724770</guid><author>xx_snoopy</author><pubDate>Sun, 25 Oct 2009 02:11:00 +0800</pubDate><description><![CDATA[最近开始接触Ocaml,一开始也是摸不着头脑。看着PPT，学习一下。  Ocaml 有几个比较显著的特征  1.Value 为中心     所有的一切都是value     一旦定义了就无法改变了  2.函数型的语言     函数也是value  3.具有严格的类型type    保障程序的安全  ML的有很多，比较有名的有Ocaml(INRIA,France) SML(Bell,lab&Prin]]></description><category></category></item><item><title><![CDATA[三种方法求解Fibonacci(斐波那契)数列]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4603634</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4603634</guid><author>xx_snoopy</author><pubDate>Mon, 28 Sep 2009 09:49:00 +0800</pubDate><description><![CDATA[三种方法求解Fibonacci(斐波那契)数列（一）　　所谓Fibonacci数列是指这样一种数列，它的前两项均为1，从第三项开始各项均为前两项之和。用数学公式表示出来就是：1 (n=1,2)fib(n)=fib(n-1)+fib(n-2) (n>2)　　可以证明斐波那契数列的通项公式为fib(n) = [(1＋√5)/2]^n /√5 － [(1－√5)/2]^n /√5 (n=1,2,]]></description><category></category></item><item><title><![CDATA[算法复杂度]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4603629</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4603629</guid><author>xx_snoopy</author><pubDate>Mon, 28 Sep 2009 09:47:00 +0800</pubDate><description><![CDATA[1.时间复杂度（1）时间频度一个算法执行所耗费的时间，从理论上是不能算出来的，必须上机运行测试才能知道。但我们不可能也没有必要对每个算法都上机测试，只需知道哪个算法花费的时间多，哪个算法花费的时间少就可以了。并且一个算法花费的时间与算法中语句的执行次数成正比例，哪个算法中语句执行次数多，它花费时间就多。一个算法中的语句执行次数称为语句频度或时间频度。记为T(n)。（2）时间复杂度在刚才提到的时间频]]></description><category></category></item><item><title><![CDATA[时间复杂度和空间复杂度]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4603623</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4603623</guid><author>xx_snoopy</author><pubDate>Mon, 28 Sep 2009 09:46:00 +0800</pubDate><description><![CDATA[空间复杂度:是程序运行所以需要的额外消耗存储空间,一般的递归算法就要有o(n)的空间复杂度了,简单说就是递归集算时通常是反复调用同一个方法，递归n次，就需要n个空间。时间复杂度：一个算法花费的时间与算法中语句的执行次数成正比例，哪个算法中语句执行次数多，它花费时间就多。一个算法中的语句执行次数称为语句频度或时间频度。记为T(n)。一般情况下，算法中基本操作重复执行的次数是问题规模n的某个函数，]]></description><category></category></item><item><title><![CDATA[从JavaCC入手]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/4014997</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/4014997</guid><author>xx_snoopy</author><pubDate>Sun, 22 Mar 2009 19:09:00 +0800</pubDate><description><![CDATA[这个学期上数据库课，最后的project就是自己写一个数据库。整个PROJECT分为3各阶段这次是第一个阶段，实现SQL parser要求是1.Parses SQL statements such as CREATE TABLE, DROP TABLE, DECS, SHOWTABLES, INSERT, UPDATA, DELETE, SELECT 2.Parses SQL st]]></description><category></category></item><item><title><![CDATA[DISCUZ代码分析]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/3862844</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/3862844</guid><author>xx_snoopy</author><pubDate>Wed, 04 Feb 2009 18:38:00 +0800</pubDate><description><![CDATA[logging.php //定义操作页面define(CURscrīpt, logging);//包含公共文件require_once ./include/common.inc.php;//包含misc函数文件require_once DISCUZ_ROOT../include/misc.func.php;//判断动作//注销if($ac]]></description><category></category></item><item><title><![CDATA[改造自discuz的mysql查询类]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/3862821</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/3862821</guid><author>xx_snoopy</author><pubDate>Wed, 04 Feb 2009 18:20:00 +0800</pubDate><description><![CDATA[/**  * mysql查询类  *  */  class dbQuery {      /**      * 查询总次数      *      * @var int      */      var $querynum = 0;      /**      * 连接句柄      *      * @var object   ]]></description><category></category></item><item><title><![CDATA[Writing device drivers in Linux: A brief tutorial]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/3364674</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/3364674</guid><author>xx_snoopy</author><pubDate>Mon, 24 Nov 2008 22:05:00 +0800</pubDate><description><![CDATA[内容比较多，就不转了http://www.freesoftwaremagazine.com/articles/drivers_linux附加中文知识准备要开发Linux设备驱动，需要掌握以下知识：• C编程 需要掌握深入一些的C语言知识，比如，指针的使用，位处理函数，等。• 微处理器编程 需要理解微机的内部工作原理：存贮器地址，中断，等。这些内容对一个汇编程序员应该比较熟悉。Linux下有好几种不]]></description><category></category></item><item><title><![CDATA[ssize_t and size_t]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/3364307</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/3364307</guid><author>xx_snoopy</author><pubDate>Mon, 24 Nov 2008 21:08:00 +0800</pubDate><description><![CDATA[http://www.delorie.com/gnu/docs/glibc/libc_239.htmlData Type: ssize_t   This data type is used to represent the sizes of blocks that can beread or written in a single operation. It is similar to s]]></description><category></category></item><item><title><![CDATA[Recursive Copy Command]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/3362787</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/3362787</guid><author>xx_snoopy</author><pubDate>Mon, 24 Nov 2008 16:04:00 +0800</pubDate><description><![CDATA[Recursive Copy Command(CP command with -R argument) /*Course: system programming  * *2008-11-24* */#include #include #include #include #include #include #include #include #define BUFFER_SIZE 1048576/*]]></description><category></category></item><item><title><![CDATA[A tiny shell program with job control]]></title><link>https://blog.youkuaiyun.com/xx_snoopy/article/details/3362708</link><guid>https://blog.youkuaiyun.com/xx_snoopy/article/details/3362708</guid><author>xx_snoopy</author><pubDate>Mon, 24 Nov 2008 15:57:00 +0800</pubDate><description><![CDATA[那天被布置了个作业，写SHELL研究了老半天，下面这个是作业的标准答案/* * tsh - A tiny shell program with job control *   *  Clara Raubertas * clara1 */#include #include #include #include #include #include #include #include #include /]]></description><category></category></item></channel></rss>