-
pidsimulatorbldc
pid simulator for bldc
- 2009-03-09 12:48:29下载
- 积分:1
-
Particle-filter
粒子滤波,用来实现目标跟踪,多目标跟踪,及目标跟踪及定位等,解决非线性问题的能力比卡尔曼滤波,EKF,UKF好多了,(Particle filter, used to achieve target tracking, multiple target tracking and target tracking and positioning, the ability to solve nonlinear problems Bikaerman filtering, EKF, UKF much better,)
- 2016-11-30 17:36:22下载
- 积分:1
-
houghlinedetect
hough 变换实现直线检测
在噪声服从高斯分布的背景中构造信噪比为2、长度为34像素的目标线段;在找出线段所在直线后,在采用固定长线段滑动的方法,确定线段的起始点,最终确定线段的确切位置。(hough transform line detection
in the noise to obey Gaussian distribution of the background-noise ratio for the structure 2, with a length of 34 pixels of the target segment at to find out where the straight line segment after the introduction of fixed long-term method of sliding paragraph to determine the segment of starting point, and ultimately determine the exact location of line segments.)
- 2020-12-05 02:49:23下载
- 积分:1
-
digital-code-simulation
为数字仿真处理软件,包括BASK,BPSK和BFSK,包括coherent和non-coherent两种方式(Processing software for digital simulation, including the BASK, BPSK and BFSK, including coherent and non-coherent two ways to)
- 2010-01-24 23:00:43下载
- 积分:1
-
wuchaxingnengbiaomian
数数字信号处理二仿真作业,也可以进行参考学习交流。(Computer Exercises)
- 2010-11-30 23:08:25下载
- 积分:1
-
SPT
SPT 方式最短路径问题,很好的matlab代码(SPT way shortest path problem, the M-file)
- 2020-06-30 13:20:02下载
- 积分:1
-
formback5
matlab 配电网潮流计算程序,前推回代法5节点4支路源代码(matlab distribution power flow calculation program, before and backward substitution method node 4 branch source code)
- 2013-04-11 10:44:20下载
- 积分:1
-
fit
用差分方程或数值微分解决简单的实际问题。
实验3 插值与数值积分
l 插值问题提法和求解思路
l Lagrange插值的原理和优缺点
l 分段线性和三次样条插值的原理和优缺点
l 用MATLAB实现分段线性和三次样条插值
l 梯形、辛普森积分公式的原理及MATLAB实现
l 数值积分公式的误差——收敛阶的概念
l 高斯积分公式
l 广义积分与多重积分
l 用插值和数值积分解决简单的实际问题。
实验4 常微分方程数值解
l 欧拉方法的原理及龙格-库塔方法的思路
l 局部截断误差和精度的概念
l 龙格-库塔方法的MATLAB实现,包括求解微分方程组和高阶微分方程
(data fitting)
- 2009-02-04 22:05:00下载
- 积分:1
-
proj10-01
在试验中编写程序实现了K均值聚类算法,K均值聚类的原理是:在训练样本中找到C个聚类中心,每个聚类中心代表一个类的中心。然后将样本归类到与其最近的聚类中心的那一类。 C的选择是通过先验知识或经验选取的。聚类中心是通过算法迭代求得的。(In the test preparation process to achieve a K means clustering algorithm, K means clustering principle is: in the training samples to find C a cluster center, each cluster center represents a kind of center. Then the samples are classified to the nearest cluster center with the type. C' s choice is a priori knowledge or experience through the selected. Cluster center is obtained through the iterative algorithm.)
- 2010-08-28 19:42:53下载
- 积分:1
-
ch2
离散时间信号与时域分析,包括信号及其采样(Discrete-time signal time domain analysis, including signal its sampling)
- 2013-02-25 15:12:10下载
- 积分:1