-
theproblemoftheprogram
程序设计问题和学习有效题目，可以有效提高初学者学习能力。(it can inprove the ability of the learners)
- 2010-02-09 11:35:56下载
- 积分：1
-
ROSAR
基于机载的旋转式合成孔径雷达成像（包含点目标、多目标、时域脉压、频域脉压、RD算法）(Rotary Airborne Synthetic Aperture Radar imaging (including point target, multi-target, time domain pulse compression, frequency-domain pulse pressure, RD algorithm))
- 2021-02-04 00:09:58下载
- 积分：1
-
bss
To calculate symmetric bispectrum
- 2010-11-03 01:04:26下载
- 积分：1
-
FDTD_1
由于Matlab软件的网络通信局限,使得在并行时域有限差分( FDTD)计算仿真中,难以实现子域间的消息发送与接收操作(As the Matlab software, network communications limited, so in parallel finite difference time domain (FDTD) simulation calculation, it is difficult to achieve sub-domain of the message and receive operation)
- 2010-05-18 20:12:16下载
- 积分：1
-
Pulso
Simulation poulse wave on matlab try it
- 2013-10-31 04:54:28下载
- 积分：1
-
GCCA_zq
典型相关分析的源代码 亲手所做 解释详细 (Canonical correlation analysis of the source code is hand-made to explain in detail)
- 2012-09-10 02:09:29下载
- 积分：1
-
SPARSE-SAR
SAR图像的稀疏表示的重要示例，有样本的SAR图像可以调用(The representation of sar images.Including the datnadard images.)
- 2015-12-28 21:39:40下载
- 积分：1
-
shili
说明： 包含32个图形应用matlab 编程实例，是matlab初学者的优秀参考资料。(Contains 32 graphics applications matlab programming examples, matlab beginners is an excellent reference.)
- 2008-11-11 15:24:52下载
- 积分：1
-
ulawcompander.m
Companding is essentially a technique for achieving non-uniform quantization. There are basically 2 methods which are most popular in literature.:-A-law companding and u-law companding. These algorithms help in achieving to an extend, compression. The given code shows how to compress a 14-bit code to 8-bit code and its digital implementation using matlab. Please contact by mail if a detailed description of code is needed.
- 2010-05-17 14:06:08下载
- 积分：1
-
ga_tsp
This paper is the result of a literature study carried out by the authors. It is a review of the dierent attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with dierent representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with dierent standard examples using combination of crossover and mutation operators in relation with path representation. Keywords: Travelling Salesman Problem Genetic Algorithms Binary representation Path representation Adjacency representation Ordinal representation Matrix representation Hybridation. 1 1 Introduction In nature, there exist many processes which seek a stable state. These processes can be seen as natural optimization processes. Over the last...
- 2013-04-09 22:15:26下载
- 积分：1
