SL0MatlabCode

说明：  用单片机来直接驱动步进电机很精确走小步子.(Using single-chip to directly drive stepper motor is very accurate take small steps.)

Huffman 编码是第一个实用的无损压缩编码技术，经过了多年的不断改进，已经形成了系统的理论和方法。目前主要有两种类型的Huffman编码方式，即静态Huffman编码和动态Huffman编码。Huffman编码有着广泛的应用，但是不再是压缩算法的全部，而是被当作最终的编码方法。(Huffman coding is the first practical lossless compression coding technology, after years of continuous improvement, has formed a system of theories and methods. There are currently two types of Huffman encoding, namely, static and dynamic Huffman coding Huffman coding. Huffman coding has been widely used, but the compression algorithm is no longer all, but rather be treated as the final coding.)

设电文字符集D及各字符出现的概率F如下： D={a，b，c，d，e，f，g，h}（字符数n=8） F={5，29，7，8，14，23，3，11}( ) 编写完成下列功能的程序： ①构造关于F的Huffman树； ②求出并打印D总各字符的Huffman编码。 程序结构： 类型说明； 构造Huffman树的函数：Huffman_tree(H[m+1])； 求Huffman编码的函数：Huffman_code(code[n+1])； main() { 变量说明； 输入字符集D及频率F； 调用Huffman_tree(H)； 调用Huffman_code(code)； 打印编码； Y 继续？ N 停止 }

ECLIPSE下的SVG图模一体化功能eclipsesvgnodesimple(eclipsesvgnodesimpleeclipsesvgnodesimple)

本压缩文件包含利用LUT（查找表）进行MODIS气溶胶反演的系统、源代码及说明文档 源代码为idl的pro文件,易于学习查看 还附赠了6s大气传输模型用以生成查找表（LUT）之用 (Modis 6s.)

对图像进行斑点噪声的添加，用方程f=f+n*f将乘性噪音添加到图像f上，其中n是均值为零，方差为var的均匀分布的随机噪声。(Image speckle noise addition, the equation f = f+ N* f will be added to the multiplicative noise on the image f, in which n is zero mean, variance var of the uniform distribution for the random noise.)

说明：  提供JPEG标准压缩压缩的编码解码过程，90%以上的代码有注释，配有GUI设计。代码能够运行，但可能只起到借鉴的作用。(Provide JPEG standard compression coding and decoding process, more than 90% of the code is annotated, with GUI design. Code can run, but it may only serve as a reference.)

随机解调器，可在压缩感知中获取压缩采样。(Get compressed samples)

灰色系统用于预测未知数据，是一种比较好的方法，此程序只需改变原始数据即可得到结果！(Gray system is used to predict the unknown data is a better method, this procedure simply by changing the raw data you can get the results!)

基于DC3压缩、BWt压缩、FM_index查询的基因精确查询代码，可以实现对大数据的压缩预处理，再输入查询串，进行精确查询匹配。(Based DC3 compression, BWt compression the query gene precise queries FM_index code can achieve large data compression preprocessing, and then enter a query string, to precisely match the query.)