-
antenna-pattern1
采用口面积分的方法来计算天线方向图,天线设计常用(Orifice area divided by the method to calculate the antenna pattern, antenna design used)
- 2011-05-09 20:37:32下载
- 积分:1
-
subspace
经典子空间算法的完整实现,噪声消除效果比较好(an approach of speech enhancement algorithm)
- 2013-08-26 11:24:39下载
- 积分:1
-
14
说明: 图象压缩方面的论文pdf格式
可用于毕业设计方面的工作(Image compression pdf format papers for school design work)
- 2010-05-26 20:37:45下载
- 积分:1
-
DSP
这是一个有关于免疫遗传算法matlab 程序(This is an on immune genetic algorithm matlab program)
- 2010-05-10 16:05:12下载
- 积分:1
-
qr
说明: qr变换和householder求特征值的算法,可与matlab结果比对(qr transform and householder eigenvalue algorithm, the results compare with matlab)
- 2014-10-16 10:35:19下载
- 积分:1
-
aa
说明: 在过去的几年中, 背包问题吸引了众多理论研究人员和应用工作者的注意力, 因而得到了广泛而深入的研究。理论方面, 研究兴趣主要来自于该问题简单的结构, 而这种特点既可以深入探索许多组合特性, 又可以通过解决一系列背包子问题来最终求解更为复杂的优化问题。实践方面, 这些问题可以表述许多工业场合的应用, 最典型的应用包括货
物装载、存储分配和资本预算等等。在寻找背包问题可行解的过程中, 出现了众多的算法, 本文是利用MATLAB 程序求背包问题可行解的一种算法。(In the past few years, knapsack problem has attracted many researchers and application of theoretical attention of workers, which has been extensive and in-depth study. Theory, research interest mainly from the simple structure of the problem, and this characteristic combination of both in-depth exploration of many features, but also can solve a series of knapsack sub-problems to solve more complex final optimization problem. Practice, these problems can be expressed in many industrial applications where the most typical applications include cargo loading, storage, distribution and capital budgets, and so on. Knapsack problem in finding feasible solutions in the process, there have been many algorithms, this is the knapsack problem using MATLAB program seeking a feasible solution algorithm.)
- 2011-12-01 11:45:25下载
- 积分:1
-
WienerTing2013.m
Wiener filter with multiple parameters
- 2014-01-29 05:15:54下载
- 积分:1
-
FDTD3DCODEUSING
一个三维FDTD的计算程序,比较有用,适合初学者。(A three-dimensional FDTD calculation procedures, more useful for beginners.)
- 2014-01-03 14:55:19下载
- 积分:1
-
DEVIL
没有什么好的程序,就是一个简简单单的8数码(No good program, that is simply one of the eight digital)
- 2009-12-25 10:56:41下载
- 积分:1
-
diedai
迭代法是基于逼近的思想,其步骤如下:
1. 求出图象的最大灰度值和最小灰度值,(Iterative method is based on the idea of approximation, the steps are as follows: 1. To derive the maximum gray value image and the minimum gray value,)
- 2008-03-24 18:58:09下载
- 积分:1