dghm

在大学生或者研究生数学建模竞赛中旅行商优化问题是一个很重要而又难解决的问题，本人自编程蚁群算法智能程序很好的解决此问题。(University students or graduate students in the Mathematical Contest in Modeling in the traveling salesman optimization problem is a very important and difficult to resolve the problem, I self-programming smart procedures ant colony algorithm to solve this problem very well.)

现代电力系统分析书后PQ分解潮流计算程序(Modern power system analysis book PQ decomposition flow calculation procedures)

Generation Travelling sellman

灰度图像的二维Otsu自动阈值分割法 matlab源程序(Two-dimensional gray image Otsu automatic thresholding method)

说明：  用欧拉法计算微积分的源代码，以及改进的欧拉法，用matlab实现(Euler method with the source code of calculus, and the modified Euler method, using matlab implementation)

说明：   empirical formula with kaiser clc clear all fs=1000 fc=250 df=50 r=0.001 f=fc/fs dw=2*pi*(df/fs) a=-20*log(r) n=floor(((a-8)/(2.285*dw))+1) if a>50 b=0.1102*(a-8.7) elseif a>=21 && a<=50 b=0.5842*((a-21)^0.4)+0.07886*(a-21) elseif a<21 b=0.0 end w=kaiser(n,b) for i=1:n if i~=(n-1)/2 hd(i)= (2*f*sin((i-((n-1)/2))*2*pi*f))/((i-((n-1)/2))*2*pi*f) elseif i==(n-1)/2 hd(i)=2*f end end for j=1:n h(j)=w(j)*hd(j) end subplot(3,1,1), plot(w) subplot(3,1,2), plot(h) subplot(3,1,3), plot(h,n)

this code calculate the euclidian distance. h = waitbar(0, Distance Computation ) switch nargin case 1

牛顿迭代法，用于求解非线性方程的解。此程序比较详细，虽然程序看上去很多，但是各方面都很到位。(Newton iterative method for solving nonlinear equations. This procedure in more detail, although the process seems a lot, but all aspects are in place.)

Programa que calcula as curvas de I x v e potencia de PV solar

说明：  MIMO信道估计算法 含有大量各种估计方法(MIMO channel estimation algorithm with a large variety of estimation methods)