7yt6fc

SQP方法详细介绍，好东西啊，想认真学习matlab的认真看下。。(Details SQP method, a good thing, ah, would like to study matlab serious look. .)

Training a neural network

共五个程序包括劳伦兹图像、区域图像、三维图像、向量场及简单运算器(A total of five procedures, including Lorentz image, regional images, three-dimensional images, vector field and a simple calculator)

基于matlab的模态分析1，可以进行采样数据的模态分析，获得振型，阻尼比，频率等(Based matlab die state analysis, modal analysis of the sampling data obtained modes, damping ratio, frequency, etc.)

回声信道模型,双通道,无法正确识别的情况.(Echo channel model, dual-channel, can not correctly identify the situation.)

本资料详细的介绍了，mathlab软件编程的知识点，对于初学者有很大的帮助。(Details mathlab software programming knowledge, a great help for beginners.)

EFG 2D problems cantilever beam

说明：  差分粒子群算法是一种新的模仿鸟类群体行为的智能优化算法，现已成为进化算法的一个新的重要分支。在基本粒子群算法和改进粒子群算法原理的基础上，实现了粒子群算法在函数优化、图像压缩和基因聚类中的应用。(Differential particle swarm optimization (DPSO) is a new intelligent optimization algorithm which imitates the behavior of bird swarm. It has become a new important branch of evolutionary algorithm. Based on the basic particle swarm optimization (PSO) algorithm and the improved principle of PSO, the application of PSO in function optimization, image compression and gene clustering is realized.)

利用matlab编程实现偏最小二乘算法，可完成辨识模型的参数(partial least square)

计算成组滑动的滑窗检测器的最佳门限已知: 击中数N = 128, 组宽n = 8，PF = 10¡ 6，PD = 90 假设以下条件: (a) 信号不起伏 (b) 忽略天线波束调制 1 (c) 计算PD时忽略目标区以外噪声的影响 组门限(第二门限)为K=8 滑窗的门限(第三门限)为L=16 (滑窗中包含的组数为16) 求解: 最佳的KOPT 和LOPT，对这题做了具体仿真实现。需要的朋友，一定知道很有用。(Optimal threshold calculated as group slidable window detector is known: hit number N = 128, the group width n = 8, PF = 106, PD = 90 assuming the following conditions: (a) signal is not undulation ( b) ignore the antenna beam modulation 1 (c) the calculation of PD ignored outside the target area noise of impact group door limit (the second door limit) for K = 8 sliding window of the door limit (third door limit) for L = 16 (sliding window contains group 16) to solve: the best of the KOPT the LOPT, these questions do specific simulation to achieve. A friend in need, we must know to be useful.)