ml

this kalman with decouple

使用卡尔曼滤波对一个弹跳的小球进行跟踪并绘出其运动轨迹(target tracking using kalman)

多元变化检测（MAD）、最大自相关因子（MAF）、典型相关分析（CCA）、主成份分析（PCA）的Matlab代码(Matlab code to perform multivariate alteration detection (MAD) analysis, maximum autocorrelation factor (MAF) analysis, canonical correlation analysis (CCA) and principal component analysis (PCA) on multivariate image data)

单相光伏电流双环控制模型，电流内环加电压外环，测试通过直接运行(Single phase photovoltaic current dual loop control model)

使用c语言及c++来实现matlab编程(using c or c++ to complete matlab programing)

Bandwidth (signal processing) or analog bandwidth, frequency bandwidth or radio bandwidth: a measure of the width of a range of frequencies, measured in hertz Bandwidth (computing) or digital bandwidth: a rate of data transfer, bit rate or throughput, measured in bits per second (bps) Spectral linewidth: the width of an atomic or molecular spectral line, measured in hertz

用于流型学习的算法：局部邻域保持 可以分析任何符合流型分布的数据集，常用语人脸识别(For the flow pattern learning algorithm: the local neighborhood to maintain consistent flow pattern can be analyzed the distribution of any data set, common language recognition)

Some thing about the communication

说明：  最短路径的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.)

计算了贝塞尔函数的一阶导数的零点。 更新BessDerivZerosBisect.m这些变化： 1。允许对m= 0 2。允许用户指定特定的m和k值理想。 3。允许公差输入参数 4。使用一个表的查找能为m和k的小值接近初始化 5。添加错误检查 6。计算衍生w.r.t.以X而不是w.r.t.米（虽然老方法的工作也。）(Calculates the zeros of the first derivatives of Bessel function. Updates BessDerivZerosBisect.m with these changes: 1. Allows for m = 0 2. Allow the user to specify the particular m and k values desired. 3. Allows for a tolerance input parameter 4. Uses a table look-up to get closer initializations for small values of m and k. 5. Adds error checking 6. Computes the derivative w.r.t. to x rather than w.r.t. m (although the old method works, too.))