-
qwffq
常微分方程的初值问题多种求解方法 各种犀利算法 (Initial value problems for ordinary differential equations to solve a variety of ways)
- 2011-11-15 12:04:23下载
- 积分:1
-
double-spectral
Matlab双谱分析,高阶累积量的定阶,用相邻奇异值差最大定阶,绘制双谱(等高线图,双谱图,相位图,切片图)(Matlab double spectral analysis, fixed-order cumulant, with the largest difference between adjacent fixed-order singular value, drawing double spectrum (contour maps, dual spectra, phase diagram, slices))
- 2020-12-25 17:29:04下载
- 积分:1
-
RD
说明: RD成像雷达干扰,基于MATLAB的成像算法,有关雷达干扰欺骗模型,sar成像,多普勒雷达(Rd imaging radar jamming, imaging algorithm based on MATLAB, radar jamming deception model, SAR imaging, Doppler radar)
- 2021-03-20 17:32:44下载
- 积分:1
-
KNN
说明: 用k-means算法实现KNN算法,是模式识别中的经典算法再现(K-means algorithm with KNN algorithm is a classical pattern recognition algorithm for reconstruction)
- 2010-05-04 20:24:37下载
- 积分:1
-
Source-code
This file include many matlab file (.m) to simulate about antenna in telecommunication
- 2011-08-29 12:51:12下载
- 积分:1
-
scramblingadescrambling-vhdl
scrambling and descrambling
- 2015-03-11 09:55:08下载
- 积分:1
-
FLL
锁频环程序仿真,需自行选用不同的鉴频算法,例如CPAFC等(FLL-freqence lock loop simulation)
- 2014-08-01 14:55:00下载
- 积分:1
-
VideoGameTheory
Video Game Theory to develop game
- 2014-01-22 09:37:53下载
- 积分:1
-
Functionals
泛函求极值的一种解法,希望那个对大家有用!(Functionals)
- 2009-11-08 15:38:35下载
- 积分:1
-
bottom_up_segmentation
这是TD算法的逆过程,首先将时间序列,划分为相邻点的短序列,当然此时的拟合误差为0,因为第一点和第二点的连线,原始点都落在线段上。将相邻两个线段连接起来,此时每条线段包含三个原始点,计算中间那个点的拟合误差。这样,所有这些三个点的线段中的中间点的拟合误差计算出来后,找出误差最小且误差小于阀值R的分段,作为第一条包含三个点的线段。 在上面的基础上,第一条分段同样的和相邻线段连接,然后计算每一条分段的拟合误差,再找出误差最小且小于阀值R的分段,作为第二个分段。依次方式循环,直到所有分段的拟合误差都小于阀值R,分段结束。
(This is the reverse process of TD algorithm, the first time series is divided into short sequences adjacent dots, of course fitting error is zero at this time, because the first and second points of connection, the original point fall line on. The two adjacent segments are connected, then each segment contains three original point, the intermediate fitting error calculated that point. Thus, after all these segments fitting error of three points in the intermediate point calculated to find the minimum error and the error is less than the threshold R segment, as the first line contains three points. Based on the above, the first segment and the adjacent line segment connecting the same, and then calculate a fitting error for each segment, and then find the smallest error and less than the threshold R segment, as the second segment . Followed by a cyclic manner until all segments fitting error is less than the threshold R, segment ends.)
- 2021-03-20 16:29:18下载
- 积分:1