weiyizhuanhuan

和Huffman-Tree一样，Shannon-Fano coding也是用一棵二叉树对字符进行编码。但在实际操作中呢，Shannon-Fano却没有大用处，这是由于它与Huffman coding相比，编码效率较低的结果（或者说香农-范诺算法的编码平均码字较大）。(And Huffman-Tree, like, Shannon-Fano coding is using a binary character coding. However, in practice it, Shannon-Fano, but not much use, since it is compared with the Huffman coding, coding efficiency is the result of a lower (or Shannon- Fano coding algorithm larger average code word).)

实现多智能体仿真的matlab程序，可通过仿真很好地实现仿真功能(Matlab program for realizing multi agent simulation)

This page updated 20 September 2018. Latest build = 4.4.07 on 03 Oct 2017. Contact A. David Redish (redish AT umn.edu) with questions, bug-reports, etc. If you would like to be included on an MClust-4.0 email list of bug reports, please send an email to ADR with MClust-4.0-registration in the header. The only messages that will go to this email list will be sent by ADR and will refer to data-level bugs in MClust.

VC++与Matlab混合编程实现图像处理(VC and Matlab Image Processing Mixed Programming)

说明：  Kalman 滤波实际应用，对于初学者来说是一份非常好的学习参考资料，呵呵！(The practical application of Kalman filtering, for beginners is a very good learning references, Ha ha!)

遗传模糊优化算法，对大量信号的处理算法希望对大家研究有帮助。 (Fuzzy genetic optimization algorithm, the algorithm is useful for everyone to want to help.)

说明：  算法源码 Transfer-Knee-DMOEA-code(Transfer-Knee-DMOEA-code)

用于扑克的识别 主要原理是 先把左上角的截去一个角（涉及到智能判断切片大小） 之后通过区域查找和HSV模型 辨别出颜色 和找出相应的区域 然后利用编码形式 识别数字和花式(The main principle for the identification of poker is to first truncate the top left corner (relating to intelligence judgments slice size) after the HSV model through regional search and identify colors and find the appropriate form of identification coding region and then use digital and fancy)

IS95 FIR滤波器低通滤波白噪声(由输入和输出噪声功率谱图可见，IS-95滤波器较好实现了低通滤波。)(IS95 FIR low-pass filter white noise filter)

极值分布的参数的极大似然估计，并绘图比较(Extreme value distribution parameters of maximum likelihood estimation, and drawing comparison)