-
dibazhou
在Matlab中解决实际问题的最优解,此文是具体的代码。(Optimal solution to solve practical problems in Matlab, the article is a specific code.)
- 2012-04-10 15:56:28下载
- 积分:1
-
matlabgjxhs
matlab所有的工具箱函数大全,包括了所有的工具箱函数。 (all the Matlab toolbox functions Solutions, including all of the toolbox functions. Matlab toolbox functions of all volumes, including all the Toolbox function.)
- 2007-06-25 14:40:10下载
- 积分:1
-
64QAM_baseband_system_receiver
64QAM基带系统接收机matlab代码:添加AWGN噪声,进行接收端匹配滤波器,8倍下采样,解调信号。(64QAM baseband system receiver matlab code: add AWGN noise, matched filter receiving end, eight times the down-sampling, the demodulated signal.)
- 2014-11-24 09:37:09下载
- 积分:1
-
MT-Bostick
基于Bostick插值算法的大地电磁法一维正反演Matlab程序(Bostick interpolation algorithm based on magnetotelluric method of one-dimensional forward modeling and inversion Matlab program)
- 2021-04-26 19:18:45下载
- 积分:1
-
CS
说明: 我所搜集的有关压缩传感的非常有价值的参考资料,如果想要入门,这些文献是必不可少的(I collected the compressed sensing of extremely useful information, if you want to start, these documents are essential)
- 2011-11-02 09:01:49下载
- 积分:1
-
60_2_ThePSecurityPRoutingPResearchPforPWSNPinPthe
wireless sensor network routing protocol
leach data aggregation
- 2014-12-04 14:39:33下载
- 积分:1
-
keller-box-scheme2
Keller box algorithm and equations for Boundary layer theory problems. For calculating the boundary layer thickness and the velocity profile in a free stream in a pipe.
- 2013-11-17 05:18:22下载
- 积分:1
-
Adams_Onelegged
ADAMS与Matlab 联合仿真单足机器人跳跃(union simulation of one-leg hopping robot by ADAMS and MATLAB)
- 2020-11-19 15:19:37下载
- 积分:1
-
FDTD3DCODEUSING
一个三维FDTD的计算程序,比较有用,适合初学者。(A three-dimensional FDTD calculation procedures, more useful for beginners.)
- 2014-01-03 14:55:19下载
- 积分: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