schmidl-ParkaCheon

For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra s algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).

hdf5 is a very important Lib for unix ......

时频处理的一个例子，在时频分析的matlab那本书里面有详细的说明(Deal with time-frequency an example, in the time-frequency analysis of matlab that book there are detailed instructions)

说明：  四种支持向量机用于函数拟合与模式识别的MATLAB示例程序.(Four support vector machines for pattern recognition function fitting with MATLAB examples of procedures.)

使用神经网络实现了异或的功能，代码为matlab代码，输入为二维数组，输出为一个数，训练样本为异或的四种情况，结果误差为1e-010,(Using a neural network to achieve the XOR functions, code for matlab code, enter a two-dimensional array, the output is a number of training samples for exclusive or four cases, the result error is 1e-010,)

Invokes the closed-loop identification toolbox main window GUI.

说明：  MATLAB程序， 半参数线性回归模型的最小二乘核估计 半参数线性回归模型的最小二乘正交序列估计。(MATLAB program, semi-parametric linear regression model of least squares kernel estimation Semiparametric least squares linear regression model orthogonal sequence estimation.)

递推最小二乘的老师给的很好的matlab程序(Recursive least squares parameter identification procedures)

神经元PID控制源码，可以用于室内温度，电机加速器等的控制(Neuron PID control source, can be used for indoor temperature, controls the motor Accelerator)

DBSCAN是一个基于密度的聚类算法。改算法将具有足够高度的区域划分为簇，并可以在带有“噪声”的空间数据库中发现任意形状的聚类。(DBSCAN is a density-based clustering algorithm. Algorithm change will have enough height to the regional cluster. and to be with the "noise" of the spatial database found clusters of arbitrary shape.)