-
潮汐调和分析相关程序包t_tide_v1.3beta
潮汐调和分析相关程序包，用于潮位和潮流数据的调和分析(Tide harmonic analysis)
- 2020-06-15 22:25:02下载
- 积分：1
-
target-tracking
一辆车在前，一车在后，前车匀速，加速，转弯，后车跟踪的matlab程序。(The previous vehicle, a car after the vehicle speed, acceleration, turning, vehicle tracking matlab after the procedure.)
- 2009-05-12 23:25:15下载
- 积分：1
-
pca
主元分析(pca)的matlab程序,运算时间短,程序简单(Principal component analysis (pca) of matlab procedures, computing time is short, simple procedures)
- 2008-07-01 11:43:43下载
- 积分：1
-
genetic-algorithm-
遗传算法实例分析，应用遗传算法实现了例子的最终结果值(Examples of genetic algorithm analysis)
- 2014-01-15 17:22:13下载
- 积分：1
-
Levinson
即用Levinson-Durbin算法求解Yule-Walker方程。(The use of Levinson-Durbin algorithm Yule-Walker equation.)
- 2010-07-02 16:50:56下载
- 积分：1
-
dxbebylwktbg_mydown0315
我自己编的一个,大家可以看看,我们可以讨论一下(my own addendum to the one, we can see that we can talk about)
- 2007-05-01 21:55:55下载
- 积分：1
-
sun
双馈式电机的控制策略方法的仿真搭建和运行(The control method of operation DFIG)
- 2015-01-09 15:02:23下载
- 积分：1
-
for_pdn2
These are MATLAB codes for implementing Chebyshev-Type 2 Bandpass and Bandstop filters.
- 2013-11-15 18:08:46下载
- 积分：1
-
K-meanCluster
How the K-mean Cluster work
Step 1. Begin with a decision the value of k = number of clusters
Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following:
Take the first k training sample as single-element clusters
Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster.
Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample.
Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments. (How the K-mean Cluster workStep 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (Nk) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3. Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4. Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.)
- 2007-11-15 01:49:03下载
- 积分：1
-
Sschhrodingeeo
求解量子力学的薛定谔方程，说明见readme.ttxt，使用matlab编制。能现运行start.m
(Solving the Schrodinger equation of quantum mechanics shows see readme.ttxt, using matlab prepared. Can now run start.m)
- 2012-06-12 13:50:18下载
- 积分：1
