guangfudezuidagonglvzuizong

说明：  使用HOPfield神经网络求解参数线性约束规划，此代码为原创，可直接运行。(Use HOPfield Neural networks for solving parametric linear constrained programming, the code for the original, can be directly run.)

说明：  压缩感知技术是2006年提出的一个新的技术，该文档主要做一个整体的综述，(Compressed sensing technology is proposed in 2006 a new technology, the main job of a whole document review,)

本案例为不等式约束最优化问题，采用罚函数法（内点法）。具体求解过程是用MATLAB编程求解的。(The Case for inequality constrained optimization problem using penalty function method (interior point method). Specific solution process is solved using MATLAB programming.)

说明：  Matlab学习宝典 解方程 Matlab学习宝典(Matlab solutions of equations Matlab Baodian learning learning Baodian)

电磁计算中利用FDTD算法的mur吸收边界，数值计算。(FDTD method with Mur ABC)

基于非下采样轮廓波的边缘提取程序。最新的程序(Under the sample based on non-profile wave of edge detection procedure. The latest program)

三相交流异步电机直接转矩控制的MATLAB仿真(Three-phase AC induction motor direct torque control of MATLAB Simulation)

FSK modulation scheme with offset

数学建模实验&matlab实现Hill密码体系的关键环节（加密、解密、破译） 实现通用hill密码n维密码(Mathematical modeling of experimental realization of Hill & matlab key password system (encryption, decryption, decoding) to achieve universal hill n-password password)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )