-
array
说明： 极化敏感阵列信号处理，再给定天线阵列分布情况下的处理(Signal Processing of Polarization Sensitive Array and Processing of Antenna Array Distribution)
- 2019-03-07 15:50:43下载
- 积分：1
-
matlab
matlab实验matlab实验matlab实验(matlab)
- 2010-10-29 22:33:14下载
- 积分：1
-
JIT
jit精益生产的论文，很经典的。毕业答辩的优的哈(jit lean production of paper, very classic. Ha excellent graduate reply)
- 2010-05-26 23:04:08下载
- 积分：1
-
MATLAB-(2)
MATLAB函数速查手册有函数使用详说明，不是copy，大部分是经验总结。。(MATLAB Function Quick Reference has detailed instructions to use the function, not the copy, most of lessons learned. .)
- 2011-05-22 16:50:21下载
- 积分：1
-
SBOGA
这个源代码是关于顺序选择遗传算法的实例，其中个体数目为50个(This source code is on the order of the genetic algorithm to instances, where the number of individuals of 50)
- 2014-12-11 14:23:05下载
- 积分：1
-
1001-0548(2012)02-0208-04
宽带CIC抽取滤波器的一种改进方法1001-0548(2012)02-0208-04(Improved Method for Wideband CIC Decimation Filters
)
- 2014-02-01 23:32:08下载
- 积分：1
-
caniter
This class allows one to iterate through all the strings that are canonically equivalent to a given string. For example, here are some sample results.
- 2015-08-30 09:05:15下载
- 积分：1
-
Folde
code for frequency responce
- 2010-11-20 23:48:15下载
- 积分：1
-
myGaussSeidel
用高斯赛德尔迭代法解椭圆型方程，这是一种差分解法(High Sisaideer iterative method for solving elliptic equations, which is a differential solution)
- 2013-12-08 12:27:40下载
- 积分：1
-
matlab_3_opt
提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。
bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。
由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。
(Provide an optimal algorithm Hamilton- trilateral exchange Adjustment Act, requiring running jiaohuan3 (c exchange) before a given adjacency matrix C and the node number N, the results of the path stored in the R in. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.)
- 2007-09-20 19:35:15下载
- 积分：1
