通过jerk的多涡卷混沌

说明：  1.相关分析法辨识系统程序。2.方波响应与阶跃响应的互相转化的通用程序。3.获取系统模型阶次的函数。4.levy方法辨识系统的函数。5.将相关分析法的辨识结果转成频率响应的程序((1) analysis Identification System program. 2 square wave response and step response of the general program of mutual transformation. (3) for the function of the system model order. 4.levy method recognize the function of the system. The identification of the relevant analysis results converted to the frequency response of the program)

说明：  GA-BP算法Matlab实现，不带说明论文！！！(back propagation genetic algorithm)

描述在matlab环境下，bch的误码率，仿真给出了在编码情况下的误码比较，可以清楚的得出bch码的编码增益。(Describes the matlab environment, bch the BER, the simulation is given in case of error in the code comparison can be drawn clearly bch code coding gain.)

摘 　要:阐述了数字滤波器的设计方法 ,分析了运用 MATLAB软件进行 IIR和 FIR数字滤波器设计的过程。 研究 与实践表明:教学中 ,运用 MATLAB软件进行数字滤波器设计及实现 ,可增强学生的感性认识 ,加深对数字滤波器 设计基本原理的理解 ,改善教学效果。(Abstract: This paper describes the design of digital filter methods, analysis of the use of MATLAB software IIR and FIR digital filter design process. Research and practice shows that: teaching, the use of MATLAB software digital filter design and realization of perceptual knowledge to enhance students understanding of the basic principles of digital filter design understanding, enhance the effectiveness of teaching.)

说明：  现代数字信号处理一些计算机作业和matlab程序(Digital signal processing computer operations and procedures)

电力电子、电机控制系统仿真模型 经典仿真源程序 洪乃刚版本(Power electronics, motor control system simulation model version of the classic simulation source Hong Naigang)

matlab图像处理实例详解chap7——图像分割技术(matlab image processing examples explain chap7- Image Segmentation)

Implemenation of a variant of the rotation forest (Rodriguez et al., Rotation Forest: a new classifier ensemble method, PAMI 2006) proposed in L. Nanni and A. Lumini, Using ensemble of classifiers in Bioinformatics, in H. Peters and M. Vogel, Machine Learning Research Progress, Nova publisher, 2009

Attempt to invert plp cepstra back to a full spectrum and even a waveform.

假设给定一个加权连通图G，G的边集合为E，顶点个数为n，要求其一棵最小生成树T。(Suppose given a weighted connected graph G, G the edge set is E, the number of vertices is n, requiring a minimum spanning tree T.)