-
duopule
该程序是信号的多普勒现象，通过设置不同的参数，可得到不同的现象，具有一定的参考价值。(that the procedure was the Doppler signal, by setting different parameters, will be different, has some reference value.)
- 2020-08-14 14:48:26下载
- 积分：1
-
FDTD-Maxwell_equations
FDTD解Maxwell旋度方程，三维直角坐标空间格子内包含均匀三次单元格(finite-difference time-domain solution of Maxwell s curl equations over a three-dimensional Cartesian space lattice comprised of uniform cubic grid cells.
)
- 2009-04-30 10:47:55下载
- 积分：1
-
MBKPLS
MBKPLS在故障诊断中提出一种新的方法(DAIMA)
- 2010-03-14 11:03:41下载
- 积分：1
-
Signal-and-System-Experiment-Docs
信号与系统的matlab编程实验与仿真。(Signals and systems matlab programming experiment and simulation.)
- 2012-06-16 15:55:22下载
- 积分：1
-
D10248025
全国研究生数学建模大赛2012年优秀参赛论文集D题1解法与程序(National Graduate Mathematical Modeling Contest 2012 entry Engineering D problem an excellent solution and Procedures)
- 2013-09-21 08:49:17下载
- 积分：1
-
simulated_annealing-
模拟退火算法源码及相关论文，代码有详细注释，配以论文解释(Simulated annealing algorithm source code and related paper , the code has detailed notes , together with the paper explains)
- 2012-01-28 22:53:36下载
- 积分：1
-
分支定界法
说明： 分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。
对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1]
通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems.
For integer programming problems with two variables, the grid method is sometimes simpler[ 1]
Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
- 2021-04-26 12:21:14下载
- 积分：1
-
supercontinuu_english
说明： 以上是关于超连续谱的一些英文资料，这些资料很好的介绍的超连续谱的成因，以及通过分布傅里叶方法模拟超连续谱形成的过程(These are some on supercontinuum information in English, the information super good introduction to the causes of a continuous spectrum, and by Fourier method simulation of the formation process of supercontinuum)
- 2011-03-30 21:14:15下载
- 积分：1
-
Asmartantenna
智能天线设计资料，请多多指教，是关于TDSCDMA系统的，希望对您有帮助！(smart antenna)
- 2009-04-10 20:12:02下载
- 积分：1
-
Untitled1
可以用来对单入单出被控对象进行广义预测控制，采用显示GPC算法，需求取丢潘图方程。(Can be used to single out a single controlled object into the generalized predictive control, GPC algorithm using display, needs to take throw Pan map equation.)
- 2011-01-03 18:36:29下载
- 积分：1
