-
shiXuTu
作业A和作业B串行（不采用缓输出技术）的时序图
作业A和作业B并发（采用缓输出技术）情况下的一种时序图(Job A and job B serial (non-use of slow output technology) and timing diagram concurrent operation A and operation B (using slow output technology) in case of a timing diagram)
- 2009-12-14 10:34:43下载
- 积分：1
-
fengjunbi
目前已经提出了许多不同的算法来解决OFDM 系统中的PAPR 问题，本章详
细介绍了其中的限幅法、压缩扩张法、星座图扩展法、选择性映射法和部分传输
序列法。在介绍每一种算法时，针对其主要存在的问题进行了相应的改进，使每
一种算法都成为比较实用的算法。(Has put forward a number of different algorithms to solve the problem PAPR OFDM system, this chapter details
Fine describes one of the limiting, compression expansion method, constellation expansion method, selective mapping method and partial transmission
Sequence method. In introducing each algorithm, for which the main problem for the corresponding improvements, so that each
An algorithm have become more practical algorithms.)
- 2014-08-17 12:32:24下载
- 积分：1
-
zixiangguanhanshu
基于自相关函数的语音信号端点检测方法，可以用于语音信号的处理(Endpoint detection method based on a speech signal autocorrelation function, can be used for processing a speech signal)
- 2015-01-13 16:58:43下载
- 积分：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
-
QualNet-3.9.5-UsersGuide
Qualnet 3.9.5 userguide
- 2011-01-17 23:28:07下载
- 积分：1
-
DLTcode
Robust Non-negative Dictionary Learning for Visual Tracking
The provided codes could be either embedded into the benchmark framework of paper Online Object Tracking: A Benchmark (CVPR2013) (You can find details here: http://visual-tracking.net/) or run on individual sequence.
To run the benchmark, just put the entire folder into the /trackers folder in the benchmark code base, and modify the configTrackers.m in util folder. DLT gets an AUC of 0.436, which ranks 5th among 26 in the benchmark by 19/03/2014. We don t tune parameters for single sequence in this case, all the parameters are stored in trackparam_DLT.m.
To run on individual video, you need to modify the dataPath and title in run_individual.m.
If you run MATLAB version after 2012, and have a CUDA compatible GPU installed, you may enjoy the fast computation speed by GPU, just set useGPU to true in trackparam_DLT.m and run_individual.m!
- 2014-09-02 12:25:35下载
- 积分：1
-
matlabfiles
Generation of different beampattern
- 2013-09-02 09:42:07下载
- 积分：1
-
dongtai
动态规划的课件，对于学习matlab算法的朋友有一定参考价值(Dynamic programming courseware, matlab algorithm for learning is valuable friends)
- 2011-01-10 16:50:24下载
- 积分：1
-
13
说明： 有详细的粒子群优化算法源代码，可以用于控制器参数寻优(Detailed particle swarm optimization algorithm source code, can be used for controller parameters optimization)
- 2011-06-12 18:43:41下载
- 积分：1
-
work
MATLAB的一般的M文件；很有用很好，是MATLAB没有自带，但却很实用的M文件，很好用(MATLAB M-files in general useful good is not native MATLAB, but very practical M-file, useful)
- 2010-05-29 17:24:31下载
- 积分：1
