-
ssi
随机子空间算法,可代入数据进行模态参数识别(Subspace algorithm, modal parameter identification)
- 2018-04-28 11:28:26下载
- 积分:1
-
hhh
Automatic number plate recognition system ....
Best papers found so far...
- 2012-04-21 15:02:17下载
- 积分:1
-
matlab
matlab应用大全的整本书的源代码,可以用于初学者,也可以用于非初学者(Encyclopedia of the entire book matlab application source code.)
- 2013-08-23 15:21:48下载
- 积分:1
-
MATLABlanguagecommonlyusedalgorithmforassembly
说明: 《MATLAB语言常用算法程序集》一书的源程序(" MATLAB language commonly used algorithm for assembly," a source book)
- 2009-08-26 11:52:54下载
- 积分:1
-
MIT118e00
说明: MIT数据库118e00心电信号的小波变化,去除噪声,采用db5,包括分解过程。(MIT 118e00)
- 2011-03-30 15:40:05下载
- 积分:1
-
Hilo-JavaScript
建和运行 Hilo 示例,如何组织源代码,以及它所使用的工具和语言,window metro app 应用开发实例(Hilo built and running the sample, how to organize the source code, as well as its use of tools and languages, application window Metro app development examples)
- 2014-10-22 00:03:28下载
- 积分:1
-
tuyi
基于耦合模理论给出了光纤光栅中的双模耦合方程,采用传输矩阵法数值模拟了均匀光纤光栅和啁啾光纤光栅的反射谱(fiber grating coupled mode theory transfer matrix method
optical properties
)
- 2012-10-13 13:39:11下载
- 积分:1
-
ADRC学习
说明: 基于MATLAB Simulink的系统仿真技术与应用这本书里的自抗扰控制器源码,自己编的,可以运行,适合学习(Based on MATLAB Simulink system simulation technology and application of this book of active disturbance rejection controller source code, self compiled, can run, suitable for learning)
- 2020-07-28 12:47:19下载
- 积分:1
-
PESGM2008-000268
Preparing for New MISO Ancillary-Service Market:
FirstEnergy Perspectives
- 2013-12-03 18:17:01下载
- 积分: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