gasanzhongcaozuosuanzidegaijin

this document a list of mathemtical forms

direct torque control of induction machine with thre level inverter

eco and reverberation matlab codes

利用小波和霍夫曼对单声道文件进行压缩编码 并解码输出(The use of wavelet and Hoffman files for mono coding and decoding output)

这是一个相对完整的OFDM通信系统的仿真设计，包括编码，调制，IFFT，上下变频，高斯信道建模，FFT，PAPR抑制，各种同步，解调和解码等模块，并统括系统性能的仿真验证了系统设计的可靠性。 (This is a relatively complete simulation of OFDM communication system design, including coding, modulation, IFFT, the upper and lower frequency, Gaussian channel model, FFT, PAPR suppression, a variety of synchronization, demodulation and decoding module, and system performance omnibus simulation of the system reliability.)

Particle swarm optimization is a derivative-free global optimum search algorithm based on the collective intelligence of a large group of intercommunicating entities. The individual particles are simple and primitive, knowing only their own current locations and fitness values, their personal best locations, and the swarm s best location. Each particle continually adjusts its trajectory based this information, moving towards the global optimum with each iteration. The swarm as a whole displays a remarkable level of coherence and coordination despite the simplicity of its individual particles. The coordinated behavior of the swarm has been compared with that of a flock of birds or a school of fish.

严恭敏博士后研究工作报告——捷联惯导系统动基座初始对准及其它相关问题研究报告 内容包括：大失准角下捷联惯导系统动基座初始对准，激光陀螺整周期采样对姿态解算的影响极其修正方法。SINS内杆臂效应分析与补偿，圆锥误差补偿。(Yan Gong Min postdoctoral research report- Moving Base SINS initial alignment study and other related issues Content includes: Large Misalignment under SINS Moving Base initial alignment, laser gyro effect on the attitude of the entire sampling period solver extremely correction method. SINS inner lever arm effect analysis and compensation, cone error compensation.)

学习MATLAB很好的课件，非常全面，对于新手更是好工具！(good file)

K-nearest neighbors 搜索 聚类时经常使用的一种方法 国外网站转载( The following utilities are provided: - Nearest neighbor - K-Nearest neighbors - Radius Search They al supports N-dimensions and work on double, it is possible to choose if return the distances. Here is a time comparison with a vectrized m-code: N=1000000 number of reference points Nq=100 number of query points dim=3 dimension of points k=3 number of neighbor tic [idc,dist]=BruteSearchMex(p ,qp , k ,k) MEX toc tic [idc,dist]=knnsearch(qp,p,k) VECTORIZED M-CODE toc p=rand(N,dim) qp=rand(Nq,dim) Output: Elapsed time is 0.962640 seconds. Elapsed time is 18.813100 seconds. )

a code for seismology Inversion