MATLAB-using-s-function

mathlab经典算法点到平面距离+matlab代码 很好用的(mathlab classical algorithm point to the horizontal distance+ matlab code is a very good use of)

This function generates a pulse train unit amplitude, is then filtered with an exponential model of the glottis.

Fuzzy knowledge-based system identification and modeling process is composed of two parts: variable identification and parameter identification. In variable identification, the significant variables of the system are identified among the set of possible variables. In parameter identification, the parameters of the knowledge-based system that describe the relationship between input and the output variables are identified. Parameter identification method consist of two steps: 1-find fuzzy clusters to establish the number of fuzzy rules 2-optimize the rule consequents. This code perform a fuzzy clustering using subtractive clustering

一个很好的关于决策树的算法matlab实现，由详细注释，易懂。(A good decision tree algorithm, matlab implementation, by detailed notes, easy to understand.)

说明：  进行联合概率数据互联方面的仿真代码，亲测有效(This a document about JPDA matlab code about object tracking.)

进行滤波的算法，可用来设计滤波器，或者进行数字信号处理(Filtering algorithm can be used to design filters, or digital signal processing)

基于标准的粒子群算法编写了一个简单通用的matlab程序(matlab code of standard particle swarm optimization)

说明：  相量测量工具的优化配置，相量测量装置的功能，向量测量装置的用途(Optimal pmu Placement)

用高阶累积量做的单载波和OFDM信号的识别的matlab全部源代码。对做这方面研究的人绝对会有帮助。(Cumulant to do with single-carrier and OFDM signals recognition matlab full source code. For people who do research in this area will definitely help.)

迭代自适应Simpson，Lobatto积分 In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm. We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (e.g. quad, quadv, and quadl). Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf. (Iterative Adaptive Simpson, Lobatto Points In almost every standard book on numerics quadrature algorithms like the adaptive Simpson or the adaptive Lobatto algorithm are presented in a recursive way. The benefit of the recursive programming is the compact and clear representation. However, recursive quadrature algorithms might be transformed into iterative quadrature algorithms without major modifications in the structure of the algorithm.We present iterative adaptive quadrature algorithm (adaptiveSimpson and adaptiveLobatto), which preserves the compactness and the clarity of the recursive algorithms (eg quad, quadv, and quadl) . Our iterative algorithm provides a parallel calculation of the integration function, which leads to tremendous gain in run-time, in general. Our results suggest a general iterative and not a recursive implementation of adaptive quadrature formulas, once the programming language permits parallel access to the integration function. For details the attached PDF file Conrad_08.pdf.)