-
sensorless
关于永磁同步电机DTC系统的无速度传感器，效果还可以(On permanent magnet synchronous motor DTC system without a speed sensor, the effect can also be)
- 2009-05-13 18:53:28下载
- 积分：1
-
simulations-in-complex-networks
复杂网络中典型网络的matlab仿真（包括小世界网络，BA网络，随即图等等）(matlab simulations in complex networks)
- 2012-05-06 21:37:47下载
- 积分：1
-
3.Standard-FOCUSS
FOCUSS算法,是用于压缩感知中的重构算法。(FOCUSS algorithm)
- 2014-12-04 10:32:54下载
- 积分：1
-
lr1
Study of single-loop electronic processing system using SIMULINK PACKAGE
- 2013-02-21 04:37:52下载
- 积分：1
-
matlab-prog-M.Tech-2013
forward and backward search
- 2014-01-09 15:00:58下载
- 积分：1
-
mediumfilter
用MATLAB编写的中值滤波程序，几乎囊括了所有中值滤波的类型，很全的哦。并包含测试的LENA图像。(Written using MATLAB median filter program, covering almost all of the type of median filter, it is full of oh. And includes tests LENA image.)
- 2009-12-19 11:52:02下载
- 积分：1
-
imagecipher4
Bifurcations of Nonlinear Systems
- 2009-06-06 07:31:33下载
- 积分：1
-
One-dimensional_search_method
说明： 无约束优化问题一维搜索的常用方法：黄金分割法（golden_section.m）、加步搜索法（plus_step_search.m）、牛顿法（newton.m）、抛物线法（parabola.m）(Unconstrained optimization problem of one-dimensional search of the commonly used methods: Golden Section (golden_section.m), plus step-by-step search method (plus_step_search.m), Newton (newton.m), parabola method (parabola.m))
- 2008-12-06 22:24:51下载
- 积分：1
-
gmm3.m
高斯混合模型的核心计算方法，matlab里可直接调用(Core calculation method based on Gaussian mixture model, matlab years can be called directly)
- 2014-10-04 12:55:08下载
- 积分：1
-
littleworld
NW小世界网络的构成原则为：从一个环状的规则网络开始，网络含有N个结点，每个结点向与它最近邻的K个结点连出K条边，并满足N>>K>>In(N)>>1。随后进行随机化加边，以概率p在随机选取的一对节点之间加上一条边。其中，任意两个不同的节点之间至多只能有一条边，并且每一个节点都不能有边与自身相连。改变p值可以实现从最近邻耦合网络(p=0)向全局耦合网络(p=1)转变。在p足够小和N足够大时，NW小世界模型本质上等同于WS小世界模型。
(NW constitutive principles of small-world networks: from the rules of a ring network, network with N nodes, each node is connected to the K node with its nearest neighbor K edges, and meet N > > K > > In (N) > > 1. Followed by randomization into the plus side, with probability p with an edge between a pair of nodes in a randomly selected. Wherein between any two different nodes at most only one edge, and each node can not have a side connected with itself. P value can be changed to achieve the transition from the nearest neighbor coupling network (p = 0) coupled to the global network (p = 1). When p is small enough and large enough N, NW small-world model is essentially the same as the WS small-world model.)
- 2013-04-26 21:17:37下载
- 积分：1
