test

EP1C6Q240C8的examples 鼠标口测试程序(The examples I EP1C6Q240C8 mouse test procedures)

二阶SISO离散系统MRAS算法的参数估计程序(MRAS algorithm is second-order SISO discrete-time systems parameter estimation procedures)

part 1 solve schrodinger......

说明：  想了解语音增强技术一篇很好的电子科大博士论文(Would like to know a very good speech enhancement technology UESTC doctoral thesis)

该程序可以绘出杨大成《移动传播环境》的7.2.1.1小节的等距离法实现经典功率谱密度，自相关函数，以及自相关函数均方差。文件中含m文件以及绘出的jpg文件。(The program can draw POSTS " mobile communication environment" section of the equidistance method 7.2.1.1 achieve the classic power spectral density, autocorrelation function, and the autocorrelation function of MSE. M file containing the jpg file and draw the file.)

Kalman滤波，能快速收敛，对学习Kalman 滤波的朋友会很有用(Kalman filtering, fast convergence, a friend of the Kalman filter to learn useful)

This code performs weigthed linear discriminant analysis. Weights are applied to observations.

Effective mathematical model of IPMSM with PI controller as speed controller. Good for comparison & simulation results.

附件1是关于FFT算法的详细编程，及详细原理讲解，个人认为，这篇论文对从事信号处理，频谱分析很有帮助，特使是进一步理解FFT算法，很有必要阅读。 程序+原理+运行！ 附件2是关于直接运行FFT工具箱进行频谱分析，请大家可以参考对照，对理解FFT算法肯定有帮助！ (matalb fft 频谱分析)

1,某厂向用户提供发动机，合同规定，第一、二、三季度末分别交货40台、60台、80台．每季度的生产费用为 f=ax+bx^2（元），其中x是该季生产的台数．若交货后有剩余，可用于下季度交货，但需支付存储费，每台每季度c元．已知工厂每季度最大生产能力为100台，第一季度开始时无存货，设a=50、b=0.2、c=4，问工厂应如何安排生产计划，才能既满足合同又使总费用最低． 2,函数的输入为A,B两个矩阵，实现如下功能：从A矩阵中找出与B完全相同的子矩阵，并将该子矩阵左上角的位置保存到2*n的向量index中，最后函数返回A中所有与B完全相同的子矩阵的左上角坐标。(1, a factory to provide users with the engine, the provisions of the contract, first, second and third quarter, respectively Delivery 40 units, 60 units, 80 units. The production cost of each quarter the f = ax+bx ^ 2 ($), where x is the number of Taiwan-quarter production. If after delivery, the surplus can be used for delivery next quarter, but to pay the storage fees, each quarterly c. Factory known each quarter of the maximum production capacity of 100 units of stock in the first quarter, setting a = 50, b = 0.2, c = 4, asked how the factory should arrange production plan, in order to both meet the contract and the lowest total cost of . 2, the function' s input is the two matrices A, B, to achieve the following functions: to identify from the matrix A and B are identical sub-matrix, and a position in the upper-left corner of the sub-matrix is ​ ​ saved to the vector index of 2* n, The last function returns the coordinates of the upper left corner of the sub-matrices A)