-
yaoli1111
利用分步傅里叶方法计算光纤激光器输出脉冲光谱(The use of step-by-step Fourier method pulse fiber laser output spectrum)
- 2009-05-14 13:41:56下载
- 积分:1
-
matlab-gauss
matlab-gauss,实现matlab上的gauss迭代法(Matlab- gauss, the realization of Matlab gauss iterative method)
- 2007-05-09 20:32:35下载
- 积分:1
-
q
说明: 量子粒子群算法的matlab原程序,采用量子技术在收敛速度方面优于遗传算法(Quantum particle swarm algorithm matlab original program, the use of quantum technology is superior to the genetic algorithm in terms of convergence speed)
- 2013-02-28 13:59:23下载
- 积分:1
-
MultipleAccess_SimulationByMatlabCode
通信系统中的几种多接入方式性能比较的Matlab程序(Communication systems of several multi-access performance comparison of Matlab procedures)
- 2008-04-07 21:14:36下载
- 积分:1
-
yiqunsuanfa
实用的蚁群算法,程序试图对具有31个城市的VRP进行求解,简单实用(Ant colony algorithm practical, the program attempts to have 31 cities to solve the VRP, simple and practical)
- 2009-05-07 07:50:39下载
- 积分:1
-
simulation
总体最小二乘方法的谐波频率估计。线性参数估计问题广泛存在于众多科学与工程学科,如信号处理、自动控制、系统理论、物理、化学工程、统计学、经济学、生物学、医学和军事工程等。最小二乘方法是最常用的线性参数估计方法。(Total least squares method of harmonic frequency estimation. Linear parameter estimation problem is widespread in many scientific and engineering disciplines, such as signal processing, automatic control, systems theory, physics, chemical engineering, statistics, economics, biology, medicine and military engineering. Least-squares method is the most common linear parameter estimation methods.)
- 2011-08-30 15:47:00下载
- 积分:1
-
matlabjiaocheng
以幻灯片的形式讲解matlab应用.其中包含了例题所含的原程序.(The form of a slide on the matlab application. Which contains sample questions contained in the original procedure.)
- 2007-08-14 17:09:14下载
- 积分:1
-
ideal_comp
说明: 在matlab环境下理想比较器的simulink建模(In an ideal environment matlab simulink model comparator)
- 2011-04-12 13:52:07下载
- 积分:1
-
matlab
newmark迭代法求解SMA的伪弹性效应的相变(Newmark iteration method for solving the pseudo elastic effect of SMA)
- 2021-03-23 10:19:15下载
- 积分:1
-
k_means
k means techniques de classification non supervisée (clustering) les plus utilisées.
Etant donné un entier K, K-means partitionne les données en K groupes, ou "clusters", ou "classes" ne se chevauchant pas. Ce résultat est obtenu en positionnant K "prototypes", ou "centroï des" dans les régions de l espace les plus peuplées. Chaque observation est alors affectée au prototype le plus proche (règle dite "de la Distance Minimale"). Chaque classe contient donc les observations qui sont plus proches d un certain prototype que de tout autre prototype
- 2010-08-05 23:34:13下载
- 积分:1