-
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
-
zhongxinjixian
中心极限定理的验证,三种独立分布具有同样的均值与方差,大量叠加后分布趋于正态(Central limit theorem verification, three kinds of independent distribution has the same mean and variance, a large number of superimposed normal after the distribution tends)
- 2009-12-02 15:53:07下载
- 积分:1
-
root-MUSIC-MATLAB
root-MUSIC算法MATLAB程序(root-MUSIC algorithm based on MATLAB program)
- 2014-10-23 18:01:43下载
- 积分:1
-
GUDAO
一个关于孤岛效应的仿真,尽量模拟电力系统孤岛效应(A simulation on the island effect, try to simulate the power system islanding)
- 2014-12-12 09:35:29下载
- 积分:1
-
Splash_Window
Splash Window. A windows program demo.
- 2006-12-04 10:20:12下载
- 积分:1
-
Autofocus
介绍Auto focus的文章,主要介绍了对焦技术,探测技术;包括频域分析、目标函数、目标函数效能验证、影像评估效能之因素、高斯低通滤波器参数的选取、自动对焦技术;以及相关实验结果与分析。(Introduction Auto focus of the article introduces the focus technology, detection technology including frequency domain analysis, the objective function, the objective function performance verification, image assessment of the effectiveness of the factors, Gaussian low-pass filter parameter selection, auto-focus technology and related experimental results and analysis.)
- 2009-11-26 15:51:46下载
- 积分:1
-
pipe
某石油公司计划建造一条由东向西的主输油管道。该管道要穿过一个有n 口油井的油田。从每口油井都要有一条输油管道沿最短路经(或南或北)与主管道相连。如果给定n 口油井的位置,即它们的x 坐标(东西向)和y 坐标(南北向),应如何确定主管道的最优位置, 即使各油井到主管道之间的输油管道长度总和最小的位置?证明可在线性时间内确定主管道的最优位置。(An oil company plans to construct a east to west from the main pipeline. The pipeline to pass through an oil field n wells. Wells from each must have a pipeline along the shortest path (or South or North) connected with the competent Road. If given the location of oil wells in n, that is, their x coordinates (east-west) and y coordinates (north-south), should be how to determine the optimal position in charge of Road, even if the wells to the pipeline in charge of Road between the sum of the smallest length location? proved to be linear time to determine the optimal position in charge of Road.)
- 2008-07-07 10:25:25下载
- 积分:1
-
FFTPFIR
matlab与VC版本的FFT与FIR程序代码(FFT and FIR code written in both matlab and stand C)
- 2013-01-29 11:05:59下载
- 积分:1
-
Matlab_Path_Planning
基于栅格法的路径规划算法实现(Matlab环境下)(Grid method is based path planning algorithm (Matlab environment))
- 2012-12-30 13:34:40下载
- 积分:1
-
TVP_VAR_CK
time varying VAR code
- 2013-05-15 23:56:45下载
- 积分:1