-
understandCardDataFormats_wp_en
Card Data format Wiegand
- 2010-08-19 04:31:41下载
- 积分：1
-
costas-simulink
用simulink编的科斯塔斯环，希望能有帮助(Simulink compiled Costas ring, hoping to help)
- 2012-10-31 23:03:55下载
- 积分：1
-
voice-filtering-process
matlab应用实例-语音滤波程序，使对matlab编程的简单应用跟熟悉(matlab examples- voice filtering process, so that a simple application of matlab with the familiar programming)
- 2011-06-06 16:41:06下载
- 积分：1
-
MATLAB
LPC denemesi ç alı ş maz
- 2012-05-19 23:24:07下载
- 积分：1
-
lssvm_matlab
用matlab实现基于时间序列的最小二乘支持向量机预测，代码简单易懂，适合初学者使用(achieve the lssvm regression based on time series using matlab)
- 2020-07-15 22:48:51下载
- 积分：1
-
StaMPS_v3.3b1.tar
PS-InSAR处理软件，StaMPS的最新版本v3.3b1(PS-InSAR processing software, the latest edition of m v3.3)
- 2015-07-27 10:21:08下载
- 积分：1
-
simulink
说明： 利用Matlab/simulink搭建纯电动汽车底盘模型，仿真其底盘控制性能。(Using Matlab / Simulink to build a pure electric vehicle chassis model and simulate its chassis control performance.)
- 2020-04-02 23:38:24下载
- 积分：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
-
multi
Multiplicación simplificada
- 2009-10-26 18:06:04下载
- 积分：1
-
psat
PSAT包含了：PF-潮流计算；CPF-连续潮流；OPF-最优潮流；SSSA-小扰动分析；TDS-时域仿真；GUI-用户人机界面；GNE-自定义模型等功能。该工具包已经可以计算上千节点规模的系统。而且该软件包源代码完全公开，因此用户可以根据自己的研究兴趣编写修改相应源代码实现研究目的。(PSAT includes: PF-flow calculation CPF-continuous fashion OPF-OPF SSSA-small perturbation analysis TDS-time domain simulation GUI-user machine interface GNE-custom models and other functions. The kit can have thousands of computing nodes scale systems. And the package source code is completely open, so that the user can modify the source code to write research purposes according to their research interests.)
- 2013-12-14 16:41:54下载
- 积分：1
