perceptron

霍夫曼编码非常实用的小程序 ，实用matlab编写(Huffman coding is very useful for small programs, preparation of practical matlab)

induction machine mathematical model

Test implementation for the C code example in Application Note 192 Using the DS2480B Serial 1-Wire Line Driver DLL . This implementation uses the Windows 32-bit serial communication API and a standard DS9097U serial adapter initializing the DS2480B.

运筹学模型的MATLAB实现，附有程序源码(MATLAB realization of operations research model, with program source code)

数字PID算法的Mtalab仿真例程，包含M文件程序和Simulink仿真(Digital PID algorithm of Mtalab simulation routines, including M file and Simulink simulation program)

ICA an optimization algorithm with matlab.

一直基于matlab开发的模拟退火优化算法(Has been developed based on the matlab simulated annealing optimization algorithm)

用MATLAB程序实现了tcm_8psk的中频调制解调，有性能检测以及加入了非线性因素，很详细，毕设用的程序，比较实用。(Using MATLAB program implements tcm_8psk IF modulation and demodulation, a performance test and joined the non-linear factors, very detailed, complete set with the procedure more practical.)

说明：  最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 　　Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。 (The Dijkstra shortest path algorithm for the procedure. Dijkstra algorithm is a typical shortest path algorithm, used to calculate a node to all other nodes of the shortest path. The main characteristics is the starting point as the center outward expansion layers, until the end date be extended to. Dijkstra shortest path algorithm can arrive at the optimal solution, but because of its calculation of the node traversal, so inefficient. Dijkstra algorithm is very representative of the shortest path algorithm, in many professional courses in the basic content as described in detail, such as data structures, graph theory, operational research and so on.)

数据聚类算法的一种K-means算法，可以用于模糊推理系统输入空间及规则数的确定(A data clustering algorithm K-means algorithm for fuzzy inference system of the input space and the number of rules to determine)