-
m12_4
动态模型参数的极大似然辨识及其MATLAB实现范例(Dynamic model parameters of maximum likelihood identification and implementation examples of MATLAB)
- 2020-11-04 10:19:52下载
- 积分:1
-
FFT
描述的是一个关于快速傅里叶变化的仿真,这是在一个图上描述两个图形。(Describes a simulation on the fast Fourier transform, which is described in a graph of two graphs.)
- 2011-01-06 13:45:12下载
- 积分:1
-
fengshan
利用matlab动画模拟可调速风扇,可自由调节风扇转速。m文件。(Using matlab animation fan speed, fan speed can be adjusted freely. m file.)
- 2013-05-16 21:44:00下载
- 积分:1
-
compute-lyapunov-exponent
说明: 可以方便的计算混沌系统的李雅普诺诺夫指数,只要改变其动力方程即可。(Chaotic system can easily calculate the lyapunov exponent, as long as you change the power equation)
- 2011-03-12 18:36:37下载
- 积分:1
-
Ch-2.-Matlab-Codes
无源定位的一些仿真代码,TOA算法2维的线性、非线性、极大似然算法和克拉美罗下界、均方误差的代码(Passive targeting some simulation code, including when TOA Two-dimensional linear, nonlinear, maximum likelihood algorithm and Cramer-Rao lower bound, mean square error code)
- 2014-11-06 22:37:16下载
- 积分:1
-
txt
说明: 们讨论图像的重构。我编写的重构程序中,为了比较分解图像和重构图像,首先绘出经过小波分解的图像,然后再进行重构。在绘制分解图像和重构图像的过程中,要注意数据格式的转换。(Image Reconstruction discussed. I prepared reconfiguration process, in order to compare decomposition of images and reconstruction of images, first of all draw after a wavelet decomposition of the image, and then reconstructed. Decomposition in the rendering image and reconstructed image of the process, attention should be paid to data format conversion.)
- 2008-09-29 09:20:40下载
- 积分:1
-
5073109307xiajie
说明: aloha算法里的吞吐量描述123123123123(aloha algorithm described in the throughput of 123 123 123 123)
- 2011-03-16 08:24:24下载
- 积分:1
-
7-segment
一个7段的显示器,及按一定顺序循环得到的结果,可重复使用(A 7-segment display, and by a certain sequence and cycle the results obtained can be reused)
- 2010-01-10 18:21:33下载
- 积分:1
-
CCC_PID4_LOAD0
自搭建-4相开关磁阻电机电流斩波控制仿真,有速度闭环。(Since the phase switched reluctance motor structures-4 current chopping control simulation, the speed loop.)
- 2021-04-27 14:38:44下载
- 积分:1
-
TSP(TravelingSalesmanProblem)
Traveling Salesman Problem (TSP) has been an interesting problem for a long
time in classical optimization techniques which are based on linear and nonlinear
programming. TSP can be described as follows: Given a number of cities to visit
and their distances from all other cities know, an optimal travel route has to be
found so that each city is visited one and only once with the least possible distance
traveled. This is a simple problem with handful of cities but becomes complicated
as the number increases.
- 2007-11-15 01:44:52下载
- 积分:1