-
PKUautodophin200507
pku智能控制机器海豚仿真表演成果(PKU dolphins simulation intelligent control machine performance results)
- 2009-01-18 13:23:12下载
- 积分：1
-
divide_sqrt_algorithm_simulation
说明： 里面包含两个matlab程序，分别是对除法和对开方算法（或者是电路工作原理）的模拟。压缩包里分别有这两个算法的详细描述，主要用于学习。(It contains two matlab programs, one for divide algorithm and the other for sqrt algorithm. The .rar file also include two instruction files for the two algorithms.)
- 2010-04-19 11:58:56下载
- 积分：1
-
Resonance-freq
Resonance frequency-1D cavity FDTD(Fast fourier transform)Numeric-analytic-electromagnetic
- 2013-07-12 04:36:01下载
- 积分：1
-
sfunction
S-function of MPPT for PV
- 2013-11-13 20:07:32下载
- 积分：1
-
matlab中替代数据法子函数 surrogate
matlab中替代数据法子函数，已调试通畅，直接调用，无需折腾。(Alternative data in another way matlab function, debugging smooth, direct calls, no toss.)
- 2015-04-15 17:10:06下载
- 积分：1
-
How-Use-ODE45-to-solve-Boundary-Value-ODE
In MATLAB, usually we use function bvp4c() to solve boundary value problem (BVP) of ODE. However, we also can use function ode45() to solve BVP of ODE too. However, ode45() needs all initial values at one point. Therefore we have to construct an auxiliary function, whose input argument is the missing initial value and the return output is the given boundary value, Then we can call function fsolve() to get the missing initial value. This method is particularly efficient it the ODE has one or more parameters. Also this method is essentilal for GNU Octave, because whose function bvp4c() is not programmed for parameter ODE yet.
- 2012-06-24 04:37:26下载
- 积分：1
-
QPSK-MSK-QAM-OFDM
QPSK-MSK-QAM-OFDM matlab仿真m文件(QPSK-MSK-QAM-OFDM matlab simulation m file)
- 2014-01-09 18:02:43下载
- 积分：1
-
maxcost
“基于Floyd最短路算法的Ford和Fulkerson迭加算法”的最小费用最大流算法，其基本思路为：把各条弧上单位流量的费用看成某种长度，用Floyd求最短路的方法确定一条自V1至Vn的最短路；再将这条最短路作为可扩充路，用求解最大流问题的方法将其上的流量增至最大可能值；而这条最短路上的流量增加后，其上各条弧的单位流量的费用要重新确定，如此多次迭代，最终得到最小费用最大流。
(" Floyd shortest path algorithm based on the Ford and Fulkerson algorithm superposition" of the minimum cost maximum flow algorithm, the basic idea is: the flow of each arc on the unit cost as a length, with Floyd for the most short-circuit method to determine a from V1 to Vn of the most short-circuit then this can be expanded as the shortest way, by solving the maximum flow of traffic on the way to its maximum possible value and this increased the flow of the shortest path, on which the arcs of the unit to re-determine the cost of traffic, so several iterations, finally get the minimum cost maximum flow.)
- 2010-12-22 17:27:32下载
- 积分：1
-
Entropy
Entropy R.Data This is an implementation of Entropy in R.
- 2010-05-13 00:24:49下载
- 积分：1
-
matlab
常用matlab的程序，对于初学者是非常有意义的。(The most commonly used MATLAB program for beginners is very meaningful.)
- 2013-04-26 22:18:42下载
- 积分：1
