-
Error-control-coding-using-matlab
A Book published in 2010 on error control coding using matlab(A practical guide to error-control coding using matlab)
- 2011-06-22 15:23:01下载
- 积分:1
-
Matlab2010
简单易懂的matlab较新版本的教程,深入浅出的讲解matlab的代码编写方法。(Straightforward newer version of matlab tutorial, explain in simple terms matlab coding method.)
- 2011-12-21 17:13:20下载
- 积分:1
-
carid
基于MATLAB,根据过往车辆磁场引起的磁场变化,识别车辆通过时刻,车辆类型(Based on MATLAB, the magnetic field caused by passing vehicles under the magnetic field changes, and identify through the moment, the types of vehicles)
- 2010-01-07 13:16:25下载
- 积分:1
-
myselfpburg01
Burg算法AR谱估计发生谱线分裂现象的仿真验证(Burg algorithm for AR spectral estimation spectral splitting phenomenon in the simulation)
- 2012-08-01 21:51:33下载
- 积分:1
-
Design_70085
基于改进粒子群算法的高压配电网的无功优化(Reactive Power Optimization )
- 2015-04-16 11:44:54下载
- 积分:1
-
OFDM
该程序简单的仿真了OFDM系统,包括信号的产生,映射,调制,加噪,解调(The program is simple simulation of the OFDM system, including signal generation, mapping, modulation, noise, demodulation)
- 2013-05-26 23:51:03下载
- 积分:1
-
Genetic-Algorithm2
实数编码和二进制编码的遗传算法程序,程序结构清晰,易懂,是学习遗传算法很好的例子。(Real number coding and binary coded genetic algorithm program, the program structure is clear, and easy to understand, is to study the genetic algorithm is a good example.)
- 2016-05-02 19:29:35下载
- 积分:1
-
tuxiangxiufu
基于稀疏分解的图像信息修复,图片展示了一被“破坏”lina图像,采用此程序可以得到较好修复(Sparse decomposition based on image information restoration, image shows a being " destroyed" lina image, the use of this procedure can get a better fix)
- 2011-01-17 12:28:06下载
- 积分:1
-
danchunxingfa
单纯形法,求解线性规划问题的通用方法。单纯形是美国数学家G.B.丹齐克于1947年首先提出来的。它的理论根据是:线性规划问题的可行域是 n维向量空间Rn中的多面凸集,其最优值如果存在必在该凸集的某顶点处达到。顶点所对应的可行解称为基本可行解。单纯形法的基本思想是:先找出一个基本可行解,对它进行鉴别,看是否是最优解;若不是,则按照一定法则转换到另一改进的基本可行解,再鉴别;若仍不是,则再转换,按此重复进行。因基本可行解的个数有限,故经有限次转换必能得出问题的最优解。如果问题无最优解也可用此法判别。
(Simplex method, for solving linear programming problems common method. Simplex is the American mathematician GB Danzig in 1947 first put forward. Its theory is based on: linear programming problem feasible region is n-dimensional vector space Rn convex set in the multi-faceted, and its optimal value must be if the vertices of a convex set to achieve. Feasible solution corresponding to the vertex is called a basic feasible solution. The basic idea of the simplex method is: first find a basic feasible solution, to identify it and see whether it is the optimal solution If not, switch to another according to certain rules to improve the basic feasible solution, and then identify if still No, the re-conversion, click here to repeat. Due to the limited number of basic feasible solution, it will be converted by the finite optimal solution can be reached. If the problem can also be the optimal solution method has been applied without discrimination.
)
- 2011-01-17 21:01:44下载
- 积分:1
-
l
说明: SIMULATION OF D-STATCOM AND DVR IN POWER SYSTEMS
- 2012-12-29 03:50:43下载
- 积分:1