wave3

自适应量化。读取wav文件，使用2到12比特量化。抽样频率8khz(Adaptive quantization. Read wav files, using 2-12 bit quantify. Sampling frequency of 8kHz)

用于移动机器人SLAM的仿真工具箱（CAS Robot Navigation Toolbox）。由Kai Arras编写。可迅速构建移动机器人仿真平台。(For mobile robot SLAM Simulation Toolbox (CAS Robot Navigation Toolbox). Prepared by Kai Arras. Can quickly build a mobile robot simulation platform.)

Inverse Z Transformation using Matlab

做过模糊PID的朋友很多遇到过这种问题，就是仿真启动不起来，停留在e-7等地方或者仿真很慢，自次上次有个朋友说改变步长能解决这个问题，最后的曲线能达到满足要求的时候，我让他找个例子他就没有后文，以前我做了很多这样的模糊PID，但靠改变步长并没有解决问题，仿真曲线直接发散出去了，我自己这两天也总在思考这个问题，通过不断的调试总结，明白了不少，给遇到这个问题的朋友讲解一下解决办法吧，以一个例子详解：(Done a lot of friends of the fuzzy PID encountered this problem, simulation start up, stay in the e-7 and other local or simulation is very slow, have a friend who said to change the step size to solve this problem since the times the last, the finalcurve to achieve to meet the requirements when I asked him to find examples of his later, I have done a lot of fuzzy PID, but by changing the step does not solve the problem, the simulation curve directly divergence out, Itwo days always thinking about this problem, summarized by the debug and understand a lot of friends to experience this problem to explain the solution, an example Detailed:)

模块化多电平逆变器的simulink仿真（7电平）(The simulation modular multilevel inverter (7 level))

matlab中细化谱的示例程序，操作简单，可直接复制，便于调用。(Zoom Spectrum in matlab sample program, simple operation, can be directly copied, easy call.)

可以试想大型机械零部件的轴承故障诊断功能。并可保存数据。(Bearing fault diagnosis can imagine a large mechanical parts. And save data.)

K最邻近密度估计技术是一种分类方法，不是聚类方法。 不是最优方法，实践中比较流行。 通俗但不一定易懂的规则是： 1.计算待分类数据和不同类中每一个数据的距离（欧氏或马氏）。 2.选出最小的前K数据个距离，这里用到选择排序法。 3.对比这前K个距离，找出K个数据中包含最多的是那个类的数据，即为待分类数据所在的类。(K nearest neighbor density estimation is a classification method, not a clustering method. It is not the best method, but it is popular in practice. Popular but not necessarily understandable rule is: 1. calculate the distance between the data to be classified and the data in each other (Euclidean or Markov). 2. select the minimum distance from the previous K data, where the choice sorting method is used. 3. compare the previous K distances to find out which K data contains the most data of that class, that is, the class to which the data to be classified is located.)

TSP_matlab_code using acs(Ant Colony Optimization) (TSP_matlab_code using acs(Ant Colony Optimization) )

disizhangchegnxu程序集合是北京航空航天大学编写的(disizhangchegnxu collection procedure is to write the Beijing University of Aeronautics and Astronautics)