Search-AT-List-Box

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

数字图像处理。MATLAB写的程序。免费下载。。。。。。。。。。。。。(Digital image processing. Programs written in MATLAB. Free Download. . . . . . . . . . . . .)

这是关于MATLAB和CShaarp混合编程的资料，讲解的很清楚 (About the MATLAB and CShaarp hybrid programming information, explain very clearly)

这个是霍夫曼编码的问题，要求输入只含有ABCD的四句话，且每句8个字符的长度，然后求出四个字符每个的概率，然后当成权值计算霍夫曼编码，我的这个程序已经实现了输入、概率统计、计算出霍夫曼编码存在了bian[]这个数组中(hoffuman decoding)

数字水印源码，基于matlab的，可实现，共同分享。(Digital watermarking source code, based on the matlab can be realized.)

含：分析物理磁盘的分区表和各分区的bootsector for bitlocker以及WINDOWS下设备枚举.(including : Analysis of the physical disk partition table and the district for the bootsector bitlocker and W INDOWS equipment under enumeration.)

FVS 算法在MATLAB平台上的实现，包括源代码，说明等(FVS experiment on MATLAB)

用于计算汉字笔画的程序,可对多个汉字同时计算(The procedures used to calculate the Chinese character strokes)

采用c++调用matlab写的一个sift算法，其中调用matlab只是使用其中几个函数。可以很准确的检测出sift特征点。(Using c++ to call a matlab write sift algorithm, which used to call only a few matlab function. Can accurately detect the feature points sift.)

均匀圆阵部分阵元失效情况下的DOA估计方法(Part of uniform circular array element failure in case of DOA Estimation)