-
smooth
SMOOTH uses a vectorized implementation that may be slow when X and/or FRAME_LENGTH are very large. The number of elements that are used for calculation is length(X)*FRAME_LENGTH. The algorithm vectorizes the operation by creating a matrix of indexes and extracting its diagonals. E.g. for a vector of length 4 and frame_length of 2, the algorithm creates a temporary zero-padded matrix x2 from which it creates a set of indexes:
- 2010-06-11 15:43:35下载
- 积分：1
-
13
说明： Matlab从入门到精通中所有的源程序。(Matlab from entry to master all of the source.)
- 2009-10-09 01:45:43下载
- 积分：1
-
gamble
利用matlab平台，使用蒙特卡洛的方法模拟赌徒问题(Using matlab platform, the use of Monte Carlo simulation problem gamblers)
- 2013-10-28 18:36:46下载
- 积分：1
-
qiujieguoch222
matlab求解reynolds方程程序(matlab program for solving Reynolds equation)
- 2009-02-11 14:00:18下载
- 积分：1
-
altreadsegy
说明： 读取地震数据软件，是地震资料处理的基础性资料(seismic software)
- 2010-04-21 20:23:21下载
- 积分：1
-
How-to-use-Simulink
Simulink官方教學, 內容詳盡, 每個方塊組成都有介紹(Official documentation on Simulink, including details on every elements.)
- 2012-07-20 01:36:22下载
- 积分：1
-
zhengtaihanshu
正态函数的正查反查，可以自己设置标准差与平均值
(Normal function is to check the anti-investigation, can set the standard deviation and mean)
- 2013-02-11 20:50:46下载
- 积分：1
-
最大二分配法
如果G的边集E(G)中有个子集M，满足M中的任何两条边 都不邻接，则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配，最大匹配所包含的边数称为最大匹配数。当 G是二分图时，问题就比较特殊了，这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)
- 2021-01-20 10:38:41下载
- 积分：1
-
wind_rose
说明： MATLAB用于绘制风场玫瑰图的程序源码(MATLAB wind roses for the draw procedure)
- 2011-02-24 09:38:32下载
- 积分：1
-
cmplxsmooth
Matlab code for Complex Smoothening with an example line.
- 2012-04-17 03:24:18下载
- 积分：1
