-
Adaptive-Kalman-Filter
这个是自适应卡尔曼滤波的程序,可以不用已知观测方程以及状态方程的噪声,能够在滤波时学习出(This is an adaptive Kalman filtering program that can do the known equations of state and noise measurement equation can learn while filtering out)
- 2020-09-09 10:18:03下载
- 积分:1
-
new_wavelet
新的小波算法 里面有检测波形和源码还有图片(The new wave of wavelet detection algorithm and source code there are also pictures)
- 2011-04-30 00:17:51下载
- 积分:1
-
2BYJ48bujindianji
24YJ48,28BYJ48,30BYJ46型步进减速电动机,主要应用于空调器(24YJ48, 28BYJ48 30BYJ46 stepping deceleration motor, mainly used in air conditioners)
- 2013-01-09 11:06:51下载
- 积分:1
-
09-11-Calculator
matlab calculator program
- 2012-10-26 18:30:04下载
- 积分:1
-
b
利用传输矩阵法对相移光纤光栅的反射及透射谱进行了仿真(Phase shifted grating reflection and transmission spectra were simulated using the transfer matrix method)
- 2013-05-03 11:27:26下载
- 积分:1
-
SNR
资料中介绍了几种经典信噪比估计算法的编码并进行比较,包括误差矢量幅值法、最大似然估计、迭代法以及奇异值分解法。(Data introduces several classical coding SNR estimation algorithm and compared, including error vector magnitude, maximum likelihood estimation, iterative method and singular value decomposition.)
- 2021-04-10 10:18:59下载
- 积分:1
-
lla2ecef
Convert from latitude, longitude, and altitude (geodetic with respect to the WGS-84 ellipsoid) to a position vector in the Earth-centered, Earth-fixed (ECEF reference frame.
- 2013-09-26 23:55:27下载
- 积分:1
-
temp3
通过matlab读取文件中的视频,通过代码读取后并保存至盘中(Video read and saved to disk)
- 2013-12-13 10:52:22下载
- 积分:1
-
bidirectional RRT
在已知二维环境中的双向RRT路径规划算法,可用于移动机器人(Bidirectional RRT path planning algorithm in known environment)
- 2021-04-26 13:48:45下载
- 积分:1
-
YTY_GA_Final
To find the largest fitness value and its location
寻找最大适应性及相应的位置!Population N=50;crossover bits=n/2 (half of bits of an individual) with random locations,mutation bits = 4 种群数 N=50,交换位数= n/2, 即个体位数的一半,且位置随机;
变异位数统一取为4;
Nc=20,28,36,44,individuals for crossover(交换的个数)。Nm=1,5,10,15, individuals for mutation(变异的个数)。(To find the largest fitness value and its location to find the location of the maximum adaptability and the corresponding! Population N = 50 crossover bits = n/2 (half of bits of an individual) with random locations, mutation bits = 4 population size N = 50, exchange digits = n/2, ie half of the median individual, and random position variation is taken as unity median 4 Nc = 20,28,36,44, individuals for crossover (exchange number). Nm = 1,5,10,15, individuals for mutation (the number of variations.))
- 2010-12-27 21:23:27下载
- 积分:1