-
ALOHA
随机访问网的性能仿真,附有详细文档和matlab源码(Random access network performance simulation, with detailed documentation and source code matlab)
- 2007-11-14 15:06:50下载
- 积分:1
-
fastICA_data1
信号处理的Fast ICA实现进行快速独立分量分析(Fast ICA signal processing to achieve fast independent component analysis)
- 2013-11-06 14:42:45下载
- 积分:1
-
dpd_simulation
功放数字预失真算法代码,用Volterra模型对功放建模,Ls算法(Power amplifier digital predistortion algorithm code, using the on the model of power amplifier modeling, Ls algorithm
)
- 2021-01-06 16:38:53下载
- 积分:1
-
fips
FIPSO算法,全信息粒子群算法,用于求解一些函数的最优值问题(fully informed particle swarm, a kind of particle swarm)
- 2020-06-22 12:40:01下载
- 积分:1
-
orbit2
给出卫星适当的初始位置和速度,利用其运动微分方程,求卫星运行的轨道(航天航空)(
Appropriate given the initial satellite position and velocity, using the equations of motion, find the satellite orbit)
- 2011-12-14 21:53:00下载
- 积分:1
-
SimulationChart_ADRC
自抗扰控制(ADRC)simulink框架图,包括跟踪微分器,非线性状态反馈,状态观测器(Active disturbance rejection control frame diagram)
- 2021-03-27 09:39:12下载
- 积分:1
-
interactive-segmentation-method
基于图像区域生长的方法之一 交互式分割法(Image-based region growing methods: interactive segmentation method)
- 2011-04-25 17:31:05下载
- 积分:1
-
RSAMultiPrimePrivateCrtKeyImpl
Additional class for verification RSAMultiPrimePrivateCrtKey interface.
- 2013-12-16 11:34:02下载
- 积分:1
-
Calculate
简易四则运算计算器,使用时需将.m和.fig文件放到matlab工作目录下(本人使用的是R2013,放到bin文件夹即可,其他版本放到对应文件夹,有的是work文件夹),然后在命令窗口输入.m文件的文件名,即可显示一个简易计算器界面。有0-9九个数字供点击输入数,有重置和正负号按钮,界面简洁,功能耐用(Simple arithmetic calculator should be used with the. M and. Fig file into matlab working directory (I use the R2013, into the bin folder to the other versions into the corresponding folder, some work folder) , and then in the command window. filenames m file to display a simple calculator interface. 0-9 nine figures for the number of click enter, and the sign has reset button, the interface is simple, functional and durable)
- 2013-12-18 19:05:30下载
- 积分:1
-
k_means
k means techniques de classification non supervisée (clustering) les plus utilisées.
Etant donné un entier K, K-means partitionne les données en K groupes, ou "clusters", ou "classes" ne se chevauchant pas. Ce résultat est obtenu en positionnant K "prototypes", ou "centroï des" dans les régions de l espace les plus peuplées. Chaque observation est alors affectée au prototype le plus proche (règle dite "de la Distance Minimale"). Chaque classe contient donc les observations qui sont plus proches d un certain prototype que de tout autre prototype
- 2010-08-05 23:34:13下载
- 积分:1