Particle-Swarm-Optimization

图像处理中的边缘检测和处理,保证图像恢复的噪声最小(image processing edge detection and processing, image restoration to ensure minimum noise)

This MATLAB program calculate the fractal dimension using Higuchi method.It also show its relationship with the theoretical values.

仿真未编码和进行Hamming编码的QPSK调制通过AWGN信道后的误比特率性能(Hamming coding and for the simulation are not encoded by QPSK modulation in AWGN channel, the bit error rate performance)

前面搞错了,把五个文件一起打包上传了,现在一个一个传 考尔Cauer滤波器的离散滤波算法 模拟程序 程序头上有详细的注释和使用说明(Made a mistake in front of the pack with five file upload, and now one by one Chuan Kaul Cauer filter discrete filtering algorithm simulation program procedures detailed head notes and use)

采用四阶龙格——库塔算法，应用MATLAB编写的常微分方程、偏微分方程求解算法及界面。 关键词：gui,ode,pde,difference method, runge kutta,euler,heun MATLAB版本：7.0 (R14)(EULER.m HEUN.m Rk4.M implement euler heun and runge kutta fourth order to solve ODE VANDERPOLODE.m LOGISTICOODE.m PREDAPREDATOREODE.m describe some ODE problems (van der pol- prey predator- logistic model) diffcorda.m implement difference method for vibrating string (see pizzicata.m) EQUATIONGUI.m is the main program)

《最优化方法及其Matlab程序设计》较系统地介绍了非线性最优化问题的基本理论和算法，以及主要算法的Matlab程序设计，主要内容包括（精确或非精确）线搜索技术、最速下降法与（修正）牛顿法、共轭梯度法、拟牛顿法、信赖域方法、非线性最小二乘问题的解法、约束优化问题的最优性条件、罚函数法、可行方向法、二次规划问题的解法、序列二次规划法等。(" Optimization Methods and Matlab programming" more systematic introduction to the basic theory and algorithms nonlinear optimization problem and the main algorithm Matlab programming, the main contents include (exact or non-exact) line search technique, the steepest descent method and (corrected) Newton method, conjugate gradient method, quasi-Newton method, trust region methods, solution of nonlinear least squares problems, constrained optimization problem optimality conditions, penalty function method, feasible direction method, quadratic programming problems The solution, the sequential quadratic programming method.)

Extended Isogeometric code for analysis of plates with two edge cracks.

This is a MATLAB code (function) which elects two new nodes each time. Nodes are elected relatively to their distance in term of hop count to the initiator. This code is used by tree construction algorithm in networks modeled as weighted matrix.

It is a wondeful program to see the hata-okumara model.

lda face recgnition...............matlab