-
Caofa
Cao法求嵌入维数m,相空间重构理论需计算最优嵌入维数m和最佳延迟时间τ, 重构相空间。(Cao method of embedding dimension of phase space m, to calculate the optimal embedding dimension m and the optimal time delay of phase space reconstruction theory.)
- 2021-04-27 10:48:44下载
- 积分:1
-
Papers
电子稳像综述,阐述电子稳像的发展过程和主要理论、方法等。(Overview of electronic image stabilization to explain the development process of electronic image stabilization and the main theories, methods.)
- 2009-11-28 12:01:42下载
- 积分:1
-
Search-AT-List-Box
search in list box in exe form
- 2013-11-26 15:32:48下载
- 积分:1
-
189144remez
说明: Remez滤波,BPSK复合基带信号仿真,载波生成器!(Designed to meet the following indicators, such as ripple linear phase FIR low-pass filter)
- 2011-03-02 21:40:27下载
- 积分:1
-
k-means
k means 聚类聚类聚类聚类聚类聚类聚类聚类聚类(k means)
- 2011-05-10 14:53:51下载
- 积分:1
-
79419104matlab
基于MATLAB的数字水印程序,我不懂大家下着看吧(MATLAB-based digital watermarking process, I do not know how we look forward to the next)
- 2009-05-24 09:42:51下载
- 积分:1
-
12
说明: 图象压缩方面的论文pdf格式
可用于毕业设计方面的工作(Image compression pdf format papers for school design work)
- 2010-05-26 20:36:43下载
- 积分:1
-
Recursive_integer_division
递归法求解整数划分。
整数划分,是指把一个正整数n写成如下形式:
n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。
如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
- 2014-02-06 14:21:38下载
- 积分:1
-
LYJ@fdtd_11
时域有限差分差分法仿真脉冲在真空以及有损耗和无损耗的介质的一维传播情况(FDTD simulation of a pulse )
- 2014-12-10 21:13:12下载
- 积分:1
-
ddvip_com_043036df18ae2f
matlab+dct+数字水印,这实在linux系统下运行的程序。(matlab+ dct+ digital watermarking, which is running under linux system procedures.)
- 2009-05-08 13:55:09下载
- 积分:1