-
IntelligentControl(MATLABsource)
各种控制,从难到易,需要的可以看看,主要部分是神经智能控制,不多解释了(A variety of control, from difficult to easy, we need to look at the main part is the neural intelligent control, no more and no explanation of)
- 2008-12-13 10:25:54下载
- 积分:1
-
soliton
说明: 用于模拟光纤中的非线性薛定谔方程,包含了色散、非线性等现象的模拟,对与想了解脉冲在光纤中的传输变化非常有帮助(Used to simulate the optical fiber in the nonlinear Schrö dinger equation, including the dispersion, nonlinear phenomena such as analog, pulse on and want to understand changes in the transmission fiber is very helpful)
- 2011-03-03 09:39:58下载
- 积分:1
-
Capon
共三个文件,以子函数调用的形式,分别实现了Capon的基本算法以及改进的MVDR算法(Of the three files, subroutine calls in the form of, respectively, to achieve the basic algorithm of Capon and improved MVDR algorithm)
- 2012-11-22 19:51:36下载
- 积分:1
-
A04803285327
about nuclear reactor and control of them. it is presented a new method
- 2010-12-16 03:50:40下载
- 积分:1
-
chap2_5
PID控制,可以实现大延迟和史密斯PID控制算法。(PID control, and can achieve large delay and Smith PID control algorithm.)
- 2013-03-25 17:45:10下载
- 积分:1
-
Metropolis-Hasting Random Walk
Metropolis Hastings code
- 2020-12-03 18:19:24下载
- 积分: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
-
MKpls
说明: 多模型PLS算法,用来适应多模型的情况,避免误报漏报(PLS algorithm for multi-model, used to adapt the case of multi-model)
- 2011-03-19 11:24:27下载
- 积分:1
-
work
对接收到的磁场信号进行低通滤波,去除高频噪声(Docking of the magnetic field signal received by low-pass filter to remove high frequency noise)
- 2009-04-03 08:05:40下载
- 积分:1
-
jiefangcheng
利用matlab来求解方程,包括13个程序例子和一个ppt(Using matlab to solve equations, including 13 program examples and a ppt)
- 2009-11-08 19:36:38下载
- 积分:1