-
MatLab_7_Programming
此文件是引文原版的matlab programming
它包括以下内容
Creating and Concatenating Matrices
Accessing Elements of a Matrix
Getting Information About a Matrix
。。。。。
总之包括所有matlab的使用方法(This file is the original citation of the matlab programming which includes the following Creating and Concatenating MatricesAccessing Elements of a MatrixGetting Information About a Matrix. . . . . All in all, including the use of all of matlab)
- 2008-05-20 10:07:21下载
- 积分：1
-
可以对已有的信号求其循环谱
可以对已有的信号求其循环谱，信号可以通用的。(The cyclic spectrum of the existing signal can be obtained, and the signal can be universal.)
- 2018-09-22 11:54:56下载
- 积分：1
-
FOMA_LOD
应用局部最优检测技术的导航信号捕获，对其进行了捕获分析，提供计算信噪比的方法(Application of local optimum detection of navigation signal capture, catch analysis was carried out, provided the SNR calculation method)
- 2010-05-16 18:10:11下载
- 积分：1
-
MaxDistence
基于类间最大距离的阈值处理方法对一幅彩色图像进行图像分割(Between class thresholding method based on a maximum distance of a color image segmentation)
- 2014-12-17 22:13:35下载
- 积分：1
-
LINEAL
linear function to linealize UAV dynamics
- 2014-09-21 10:51:31下载
- 积分：1
-
matched_filter
匹配滤波程序
可以得出目标的位置速度等信息(match filtering)
- 2011-07-11 16:35:27下载
- 积分：1
-
Valve-stiction-model
过程工业中带有粘滞的阀门数据驱动模型，模型采用SCI论文《Two-layer banary tree data-driven model for valve stiction》中提出的算法，本人自己独立编制转化，成功运行，性能良好。模型由Matlab文件和Simulink模型两部分完成，且内设注释，可直接运行。(A data-driven model of valve stiction. The algorithm is from the paper"Two-layer banary tree data-driven model for valve stiction," and the model runs successfully in MATLAB/SIMULINK.)
- 2020-12-10 21:59:18下载
- 积分：1
-
FastICA
它主要介绍了独立分量分析法的步骤以及matlab实现所调用的函数。还有一些例子。(It mainly covers the steps and independent component analysis method to achieve the matlab function call. There are also examples.)
- 2015-04-14 17:42:38下载
- 积分：1
-
referentiel
MATLAB instruction mimo
- 2011-11-16 03:52:32下载
- 积分：1
-
kmeansPP
一个有效的实现k - means+ +聚类多元数据算法。已经证明,这种算法有一个预期值的上界值。此外,k - means + +具有较好的收敛性。(An efficient implementation of the k-means++ algorithm for clustering multivariate data. It has been shown that this algorithm has an upper bound for the expected value of the total intra-cluster distance which is log(k) competitive. Additionally, k-means++ usually converges in far fewer than vanilla k-means.)
- 2021-01-22 19:38:45下载
- 积分：1
