-
Basic-ICA-code-
ICA程序,1996提出的ica算法Basic ICA code in MATLAB (as used in Bell and Sejnowski 1996).(Basic ICA code)
- 2011-10-18 19:53:52下载
- 积分:1
-
Analysis_K-SVD_package
一种经典的K-SVD的分析工具包,有需要的可以一起下载下来研究下(A classic K-SVD analysis toolkit can be downloaded along with the need to study down under)
- 2014-12-15 11:14:27下载
- 积分:1
-
Tensor_unfold
张量的模式展开是一个基本的技术,已有各种代码展开结果不尽相同,本代码是根据张量研究领域权威文献“Tensor Deco们positions and Applications”中的公式编写,并经过多次实例验证,与理论描述相符。文件包括两个m文件,一个是按模n展开,而另一个是逆变换,即按模n叠合。(unfolding of the tensor mode is a basic technology, there are a variety of code to make different result. However this code is written by referring to the authority of the tensor field of research literature Tensor Deco their positions and Applications and after several instances verification, is consistent with the theoretical description. The documents include two m-files, one is unfold.m, and the other is the inverse transformation, that is refold.m.)
- 2013-04-16 19:46:24下载
- 积分:1
-
UnitySteer-master
OpenSteer libary for stering
- 2013-12-27 14:02:16下载
- 积分:1
-
Lyapunov_exponents
运用matlab计算小数据量情况下的最大Lyapunov指数(Small amount of data calculated using matlab maximum Lyapunov index case)
- 2010-11-05 22:05:39下载
- 积分:1
-
im_sim_model(1)
induction motor simulation in matlab
- 2012-05-28 13:15:28下载
- 积分:1
-
Attachments_2012_03_11.zip.mmmmm
optimization with iteration pso
- 2014-08-22 19:24:34下载
- 积分:1
-
fuzzy_suspension
基于磁流变半主动悬架的模糊控制优化,其中磁流变减振器使用Bouc_Wen模型。(Fuzzy control optimization based on magnetorheological semi-active suspension,The Bouc_Wen model is used in the magnetorheological damper.)
- 2021-01-25 18:38:42下载
- 积分:1
-
Rectifier
说明: 12脉动换流器MATLAB-simulink仿真(rectifierSimulation of UHVDC lcc-hvdc, 12-pulse converter by MATLAB-simulink)
- 2020-12-08 09:09:21下载
- 积分:1
-
Floyd
从任意一条单边路径开始。所有两点之间的距离是边的权,或者无穷大,如果两点之间没有边相连。 2,对于每一对顶点 u 和 v,看看是否存在一个顶点 w 使得从 u 到 w 再到 v 比己知的路径更短。如果是更新它。 3,不可思议的是,只要按排适当,就能得到结果。(A unilateral path from any start. All the distance between two points is the right side, or infinity, if there is no edge between two points connected. 2, for each pair of vertices u and v, to see if there is a vertex w from u to w and then to make than the known path v shorter. If you are updating it. 3, incredibly, just press the appropriate row, you can get results.)
- 2011-09-02 23:33:33下载
- 积分:1