-
ESPRIT_DOA
说明： ESPRIT方法进行DOA估计，各种参数见程序内部的参数设置，只是简单的ESPRIT程序，而非修正的ESPRIT方法(ESPRIT DOA estimation methods, see the program within the parameters set of parameters, but simply the ESPRIT program, rather than the ESPRIT method of correction)
- 2011-04-12 16:59:20下载
- 积分：1
-
cavity-MAC
The Driven Cavity Problem by the MAC Method
- 2013-05-03 18:33:32下载
- 积分：1
-
GA
说明： 最优问题求解工具包，通过GA遗传算法，可以求得最优解。(Optimal problem solving toolkit, through the genetic algorithm GA, you can get the optimal solution.)
- 2010-10-30 10:58:39下载
- 积分：1
-
nonlinearmedianv32
(median) Non-Linear Filtering of Images.
- 2010-01-14 19:50:03下载
- 积分：1
-
MATLAB
说明： 这是一个MATLAB中文工具箱，提供了很多有用的，MATLAB自身没有的数学建模的源码，例如：数据拟合，微积分和微分方程，随机模拟和统计分析，数学规划，离散优化等，并有中文的注释。非常好！(This is a MATLAB toolbox Chinese, providing a lot of useful, MATLAB does not own the source of mathematical modeling, such as: data fitting, calculus and differential equations, stochastic simulation and statistical analysis, mathematical programming, discrete optimization, Notes and Chinese. Very good!)
- 2009-08-23 15:19:51下载
- 积分：1
-
Signal-processing-simulation
运用MATLAB对自适应滤波器的应用、非平稳信号、非高斯信号进行分析处理。(Use of MATLAB in adaptive filter, non-stationary signals, the non-Gaussian signal analysis and processing.)
- 2012-05-15 14:58:10下载
- 积分：1
-
three-layers-shot-record
实现了三层介质的地震记录，雷克子波，卷积，采用均方根速度计算。(Implementation of the earthquake record in three layer medium, Ricker wavelet, convolution, using the root mean square velocity calculation.)
- 2020-10-28 08:59:58下载
- 积分：1
-
shuzishuiyindeng
基于LSB图像隐藏系统的设计与实现，LSB算法代码，信息隐藏攻击算法，DCT域的隐藏以及数字水印。(LSB based image hiding system design and implementation, LSB algorithm code, information hiding attack algorithm, DCT hiding and digital watermarking domain.)
- 2021-03-13 14:59:24下载
- 积分：1
-
20084WANGGONG
说明： 2008年4月网工真题.doc 对各位考生有很大的帮助，希望各位考上(April 2008 Network Engineering 真题. Doc candidates of you very helpful, hope you admitted to)
- 2010-04-25 10:31:52下载
- 积分：1
-
L01p_e
[x,f]= L01p_e(c,A,b,N)用枚举法求解下列
0-1线性规划问题min f=c *x, s.t. A*x<=b,x的分量全为整数0或1, 其中N表示约束条件 Ax ≤ b中的前N个是等式，N= 0时可以省略。 返回结果x是最优解，f是最优解处的函数值。 ([X, f] = L01p_e (c, A, b, N) with the following enumeration method for solving linear programming problems 0-1 min f = c ' * x, st A* x < = b, x is an integer of all components 0 or 1, where N represents the constraints Ax ≤ b in the equation of the first N, N = 0 can be omitted. Return result x is the optimal solution, f is the function value at the optimal solution.)
- 2013-07-16 21:51:03下载
- 积分：1
