-
matlab_sph
This is an matlab source code for smoothed particle hydrodynamic simulaiton. It include matlab routines and input data.
- 2020-12-16 10:49:13下载
- 积分：1
-
fuzzy
fuzzy and pid contrô le appliction of transfer function
- 2011-01-13 16:33:05下载
- 积分：1
-
GAL_ANC
说明： 噪声主动控制之基于随机梯度的格型滤波算法；基于随机梯度的格型滤波算法(Active noise control based on stochastic gradient lattice filter algorithm based on stochastic gradient lattice filter algorithm)
- 2011-04-09 19:13:09下载
- 积分：1
-
PM
说明： This is a matlab/simulink file for simulation a permanet magnet dc machine.
- 2013-02-07 02:17:49下载
- 积分：1
-
Kalman_matlab_coding
卡尔曼滤波，matlab程序实现，对初学者希望有用(Kalman filtering, matlab program realization, hope helpful for beginners)
- 2010-05-06 12:53:12下载
- 积分：1
-
aiffread
An matlab script that open an audio aiff file and extract the data put into a raw pcm variable.
- 2011-06-02 21:56:08下载
- 积分：1
-
plateloss
finite difference scheme for the thin plate equation with loss
- 2014-11-11 08:52:15下载
- 积分：1
-
longteng4
Welch法：Welch法对Bartlett法进行了两方面的修正：一是选择适当的窗函数w(n)，并在周期图计算前直接加进去，加窗的优点是无论什么样的窗函数均可使谱估计非负。二是在分段时,可使各段之间有重叠，这样会使方差减小。(Welch method: Welch method of Bartlett method amendments in two respects: First, select the appropriate window function w (n), and in the cycle before CALPHAD directly incorporated, plus the advantage of the window, no matter what kind of window function can be so spectral estimation of non-negative. Second, when in subparagraph can overlap between paragraphs, this would reduce the variance.)
- 2007-12-19 11:08:18下载
- 积分：1
-
Okumura_Hata
说明： 日本科学家奥村通过对城市进行大量无线电波传播损耗的测量，得出了一系列经验曲线用于无线蜂窝网络的规划设计。在这些经验曲线的基础上，推出了简化的Hata模型。(Olympic Village by Japanese scientists a great deal of radio waves in urban propagation loss measurement, the experience curve obtained for a series of planning and design of wireless cellular networks. In the curves on the basis of these experiences, the introduction of a simplified Hata model.)
- 2011-02-27 10:17:35下载
- 积分：1
-
k-means
说明： k均值聚类算法（k-means clustering algorithm）是一种迭代求解的聚类分析算法，其步骤是，预将数据分为K组，则随机选取K个对象作为初始的聚类中心，然后计算每个对象与各个种子聚类中心之间的距离，把每个对象分配给距离它最近的聚类中心。(The k-means clustering algorithm is an iteratively solved clustering algorithm in which the data is pre-divided into K groups, the K objects are randomly selected as the initial clustering center, and then the distance between each object and the seed clustering center is calculated, and each object is assigned to the clustering center closest to it.)
- 2020-11-08 10:47:08下载
- 积分：1
|
联系客服（QQ：3324461878）
