-
FFTDemo
FFT信号分析模型,实时显示FFT分析结果(FFT signal analysis model, real-time FFT analysis results show)
- 2007-10-11 11:30:16下载
- 积分:1
-
Real-GA
Genetic Algorithm for real problems
- 2014-12-19 16:07:43下载
- 积分:1
-
markovchainmodel
Markov Chain model for regime switching time series
- 2013-04-14 06:02:24下载
- 积分:1
-
woodward
利用woodward合成的过程得到的合成方向图和理想方向图。(Woodward synthesis procedure)
- 2011-12-21 12:26:53下载
- 积分:1
-
Rayleigh_Channel
to generate rayleigh enveloppe
- 2010-10-07 09:53:22下载
- 积分:1
-
Shape
在图像检索中需要利用对图像的形状处理,本代码求7个HU不变矩(In image retrieval need to use the shape of the image processing, the code same moment seeking 7 HU)
- 2010-11-13 08:55:55下载
- 积分:1
-
1
说明: matlab开发环境,Broyden迭代法解非线性方程组,其中的M文件(matlab development environment, Broyden iteration method for solution of nonlinear equations, in which M-file)
- 2009-04-23 17:42:52下载
- 积分:1
-
matlabret
基于matlab的粗糙集工具箱,与网上可查的“matlab的粗糙集工具箱的设计”论文的软件(Matlab toolbox based on rough sets, and online to check the " matlab toolbox rough set design" paper software)
- 2010-09-26 16:03:49下载
- 积分: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
-
Neurocal
利用MATLAB仿真神经元的动作电位及各种电参数的变化,离子通道电导变化等(HH cells using Matlab simulation model of changes in all parameters and dynamics of Action Potential generation process)
- 2010-05-16 23:59:50下载
- 积分:1