single_tree

matlab遗传算法代码，非常不错，值得看看(matlab genetic algorithm code, very good, worth a look)

BPSK 系统的卷积编码和viterbi译码过程(Convolutional coding for BPSK system and its viterbi decoding process)

基于DCT的图像检索技术 用统计特征法和不变矩法 MATLAB程序(DCT-based image retrieval method using statistical features and invariant moment method MATLAB program)

颜色空间提取团块，聚类金字塔算法matlab代码实现，可以跑，我把残缺的文件补齐了。入口angitest.m文件。(color segment)

this code extract some moment feature like zernike, zernike radial polynomials, central moments,....d

dijkstra算法，函数，经调试直接可用，直接饮用出结果(Dijkstra algorithm, functions, debugging is available directly consumed results)

it is a project of socket programming in linux . it was witten in c language . it has two parts client and server . clients can connect to server and use some services from server and server service client. client can be more than one but server just one.

fscan 是在matlab里面的一个频率的扫描程序 可以对于一个特定的对象进行频谱的扫描 需要的可以自行下载(matlab at fscan are inside a frequency scanning procedure can be for a specific object to scan the frequency spectrum can download the necessary)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)

uses shanks theorem to approximate series