-
weifengfangcheng
用matlab来解决微分方程的问题，包括21个例子程序和一个ppt(Using matlab to solve differential equation problems, including 21 examples of programs and a ppt)
- 2009-11-08 19:42:00下载
- 积分：1
-
Histogram
Make a Histogram in MATLAB from data saved to a file
- 2010-05-18 22:41:02下载
- 积分：1
-
fractal
几种简单的分形程序代码，使用Matlab运行即可，程序内附有运行说明。(several simple fractal code in Matlab)
- 2011-11-21 17:58:06下载
- 积分：1
-
1009
WOJ1009 程序源代码The Legend of Valiant Emigration(WOJ1009 source code The Legend of Valiant Emigration)
- 2014-01-31 19:36:34下载
- 积分：1
-
DSP_MATLAB
产生均匀分布的随机白噪信号,并观察数据分布的直方图产生均匀分布的随机白噪信号,并观察数据分布的直方图(Generate uniformly distributed random white noise signal, and to observe the distribution of the histogram data generated uniformly distributed random white noise signal, and to observe the data distribution histogram)
- 2008-01-01 11:23:08下载
- 积分：1
-
VG_C
利用可视图理论对时间序列建网，得到复杂网络，再求取该网络的聚集系数(throuth the theory of time series of network construction, we get the complex network, and then calculate the clustering coefficient of the network)
- 2012-03-11 11:02:45下载
- 积分：1
-
interleaver
该程序描述的是数字电视地面广播中卷积交织部分.因为是卷积交织所以最后结果中出现为的数值表示该值是前一包缓冲数据的数.但针对第一包数据做卷积交织时,这些零位置上最后确实自动补零.(The procedure is described in digital TV terrestrial broadcasting in parts of Convolutional Interleaver. Convolutional Interleaver because it is so final results for the numerical value is that the previous data on the number of packet buffer. But for the first packet data do Convolutional Interleaver These zero position is indeed the last automatic zero.)
- 2007-11-22 14:56:50下载
- 积分：1
-
az
说明： MATLAB help file for Newton rapson
- 2011-06-16 16:13:24下载
- 积分：1
-
Read_nc_files
读取并存储nc文件，不同的文件里的参数可能不一样，按格式修改即可。(Read and store NC files, the parameters in different files may be different, and can be modified according to format.)
- 2018-07-27 18:33:09下载
- 积分：1
-
Question1
说明： C++源代码，递归实现。原问题描述：鼓上蚤时迁到一个山洞里去盗宝，里面有n件宝贝，价值分别是a1,a2......an，并且满足ai大于a1+a2+....+a(i-1)的和。他身上有一个背包，能装的东西最大价值是K，他只能进洞一次，请问他最多能带出多少？
要求：输入K，n，a1，a2......an
输出：他能最多带出的宝物价值
(C++ Source code Recursive achieve. The original problem description: drum when flea盗宝going to move in a cave, there are n pieces of treasure, valued are a1, a2 ...... an, and to meet ai than a1+ A22B !....+ a (i-1) and. Him to have a backpack, things can hold the greatest value is K, he could only hole once, to ask him to bring out the maximum number of? Requirements: Enter K, n, a1, a2 ...... an output: he can bring out the maximum value of the treasures)
- 2008-12-02 21:07:25下载
- 积分：1
