-
WaveformDownloadAssistant.v2
Tool to load waveforms into a agilemt esg signal generator
- 2010-09-25 03:54:31下载
- 积分:1
-
RLS
智能天线自适应RLS算法matlab仿真(Smart Antenna Adaptive RLS algorithm simulation)
- 2021-04-27 17:58:44下载
- 积分:1
-
boostconverter
this is the simulink model for boost converter
- 2012-05-30 20:45:09下载
- 积分:1
-
Foundations-of-Fuzzy-Control---A-Practical-Approa
FOUNDATIONS OF FUZZY CONTROL A PRACTICAL APPROACH, Jan Jantzen, 2nd, 2013
- 2015-02-07 12:06:03下载
- 积分:1
-
BP-NN
matlab神经网络算法优化实现,可自己调节各项参数(matlab neural network algorithm optimization to achieve, you can adjust the parameters of their own)
- 2014-02-09 09:36:36下载
- 积分:1
-
Matlab2010-Classic-Cource
这是一本关于Matlab2010版本软件的经典教程,内容丰富,清晰明了,非常适合初学者学习之用(This is a classic version of the software on Matlab2010 tutorials, rich in content, clarity, very suitable for beginners learning)
- 2013-11-05 20:48:29下载
- 积分:1
-
PVdiodeModelRsRsh
PV diode Model Rs Rsh
- 2013-12-05 16:14:11下载
- 积分:1
-
cos--sin
t - time series
y - value of series at time t
w - cycle length, defined by user based on prior knowledge of time
series
alpha - type I error used for cofidence interval calculations. Usually
set to be 0.05 which corresponds with 95 cofidence intervals(t- time series
y- value of series at time t
w- cycle length, defined by user based on prior knowledge of time
series
alpha- type I error used for cofidence interval calculations. Usually
set to be 0.05 which corresponds with 95 cofidence intervals)
- 2015-01-24 15:27:48下载
- 积分:1
-
matlab_3_opt
提供一种求解最优哈密尔顿的算法---三边交换调整法,要求在运行jiaohuan3(三交换法)之前,给定邻接矩阵C和节点个数N,结果路径存放于R中。
bianquan.m文件给出了一个参数实例,可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,,回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验,又是近似算法,对于网络比较复杂的情况,可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。
(Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)
- 2007-09-20 19:35:15下载
- 积分:1
-
20100808
电脑鼠学习计划书,可以帮助你规划电脑鼠设计。(Computer mouse study plan can help you plan the computer mouse design.)
- 2010-08-08 12:55:52下载
- 积分:1