小波边缘检测算法

用于分数倍时延调整的farrow滤波器仿真。其中使用了4阶，8阶和16阶farrow滤波器。m文件为滤波器系数产生函数，mdl文件为滤波后偏差估计的情况。(Adjustment for fractional delay filter simulation farrow. Which uses the four bands, 8 bands and 16 bands farrow filter. m file for the filter coefficients of the production function, mdl file for the deviation of the filtered estimate of the situation.)

用matlab编写得一个小程序，一个会变大变小得地球(Matlab was used to prepare a small procedure, a small Earth will change)

基于HRRP和RELAX算法的雷达目标识别，RELAX算法比较经典，适合新手练习。(Radar target recognition algorithm based the HRRP, and RELAX, RELAX algorithm is more classic, suitable for novice practice.)

PID参数的整定就是合理的选择PID三参数。从系统的稳定性、响应速度，超调量和稳态精度等各方面考虑问题，三参数的作用如下：(PID parameter setting is the reasonable choice of three parameters of PID. From the system stability and response speed, overshoot and steady state accuracy and so on various aspects to consider problem, the role of the three parameters are as follows:)

Hamilton-Jacobi solver on unstructured triangular grids

以地基分布式有源雷达组网系统为讨论对象,在具体分析了4种系统定位误差的相互关系的基础上,给出了一种 基于ECEF转换法的系统目标综合定位精度评估模型,并利用典型的雷达参数,对2D与3D混合的雷达组网系统的实际目标 综合定位精度进行了仿真和对比分析,得到了一些对雷达组网系统的实际部署优化处理有参考价值的结论。 (The land-based distributed active radar network system is taken as discussion object.On the basis of the concrete analysis of the interrelation among four sorts of locating errors, a model of evaluating the integrated system locating precision is put forward. By using the typical radar parameters, the simulation a of the actual integrated locating precision of 2D/3D hybrid radar network systems are done. Conclusions that are helpful for optimization of radar network disposition are obtained. )

matlab simulator用matlab制作有具体ECG制作说明(matlab simulator)

求解所输入数据的概率分布，可随意设定所分概率区间个数。(Solving the probability distribution of the input data, can be arbitrarily set the number of sub-probability interval.)

说明：  对数值进行分析，AP聚类算法是基于数据点间的"信息传递"的一种聚类算法。与k-均值算法或k中心点算法不同，AP算法不需要在运行算法之前确定聚类的个数。AP算法寻找的"examplars"即聚类中心点是数据集合中实际存在的点，作为每类的代表(For numerical analysis, AP clustering algorithm is based on the "information transfer" between data points. Unlike k-means algorithm or k-center algorithm, AP algorithm does not need to determine the number of clusters before running the algorithm. The "examples" searched by AP algorithm is the actual points in the data set as the representative of each class)

this program simulate the method simplex for math