-
PyCurvelab-1.0.tar
PyCurvelab-1.0.tar,配合curvelet实用的(PyCurvelab- 1.0.tar cope with the practical curvelet)
- 2007-05-04 23:47:39下载
- 积分：1
-
buckconv_try_pm
A model for PM-synchronous generator connected to 3phase bridge rectifier then buck converter
- 2010-05-13 00:08:23下载
- 积分：1
-
7.5
把各阶导函数的ESD作为a的函数，确定其峰值频率的数值。该函数把以下变量作为输入：a的最小值alphamin，其增量步长alphastep；(various derivative function of the ESD as a function of its peak frequency values. The function of the following variables as input : a minimum of alphamin. its incremental step alphastep;)
- 2007-03-27 19:54:28下载
- 积分：1
-
cal
计算中间接轴在正弦激励下的动态特性，最大剪切应力、最大等效应力、弯曲应力等。(Axis in the calculation of indirect dynamic characteristics under sinusoidal excitation, the maximum shear stress, the maximum equivalent stress, bending stress and so on.)
- 2011-11-07 20:33:08下载
- 积分：1
-
OutputText
OutputText.rar例子，关于txt输出，注释的特别详细(OutputText，special for txt)
- 2013-12-10 10:14:33下载
- 积分：1
-
UFMC_OFDM___TransceiverChain_0
说明： UFMC_OFDM传输
第5 代无线通信系统的关键技术之一，详细细描述了UFMC系统的发送和接收的仿真实现过程(Ufmc OFDM transmission One of the key technologies of the 5th generation wireless communication system, the simulation process of sending and receiving of ufmc system is described in detail)
- 2020-03-12 11:27:15下载
- 积分：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
-
kalmanfilter
maple写的基本kalman算法，可以做入门参考理解(maple write basic kalman algorithm, can be understood to do entry-reference)
- 2008-02-28 16:44:59下载
- 积分：1
-
MUSIC
DOA估计的经典算法：music算法基本程序实现(music algorithm)
- 2011-06-13 17:55:05下载
- 积分：1
-
Huange_emd
黄锷论文中EMD和HHT的源程序，已经打包压缩,解压后可以使用(Wong Ngok paper on EMD and HHT source, has been packaged compression, decompression can be used after)
- 2013-09-25 10:58:18下载
- 积分：1
