chouhaochange

You can use this script to generate synthetic DWMRI or DTI datasets

说明：  共轭梯度法求最优值，这个程序是上课的时候做的，还行就发过来了(good)

关于matlab基础操作、矩阵运算、程序设计、绘图等的学习资料(Learning materials of the underlying operating on matlab, matrix operations, program design, graphics, etc.)

电力系统潮流计算程序,采用牛顿拉夫逊法对3节点系统进行仿真(load flow calculation of 3 point system)

Multiscale performance

经典的压缩感知重建算法，可以很方便的使用。(it good)

1．进一步掌握栈的基本操作的实现。 2．掌握栈在算术表达式的计算方面的应用。 (1. Further understand the basic operation of the stack implementation. 2. Control stack in the calculation of arithmetic expression applications.)

The WSN clustering based upon fuzzy logic has been discussed, which elaborates the step wise clustering on the different distances. One directional clustering has been represented. The fuzzy clustering has been represented the right to left connection establishment. The energy consumption has been monitored over the given simulation.

聚类问题的matlab程序,聚类问题在图像处理中有着广泛的应用(Clustering problem matlab procedures, clustering problem in image processing has a broad application)

) Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. () Compression using huffman code -with a number of bits k per code word -provide huffman table Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree. )