-
steepest_descent-in-adaptive_filter
对《自适应滤波器原理》一书中使用“最速下降算法轨道曲线”进行自适应滤波器设计的方法进行了matlab实现。研究图像处理方向滤波器设计的可以参考。(This program is using the "steepest descent algorithm tracks curve" in "Adaptive Filter Theory" to design adaptive filter methods based on matlab. which can refer to who researches the filter of image processing .)
- 2011-12-23 11:28:27下载
- 积分：1
-
model3b
数学建模清华数模讲义\model3b (Mathematical modeling Qinghua digital-analog handouts model3b)
- 2010-01-13 23:22:49下载
- 积分：1
-
Circle-detection-
基于c—v模型和hough变换的圆检测，输出圆的参数(C-v model and hough transform circle detection, the output parameters of the circle)
- 2013-05-19 21:20:10下载
- 积分：1
-
Genetic-neural-network
Used for mathematical modeling neural network training get intelligent algorithms
- 2012-03-20 23:39:06下载
- 积分：1
-
yuanzhen
仿真实现均匀圆阵任意阵元工作时的方向图，工作参数可任意调节(Simulation of uniform circular array of arbitrary array work pattern)
- 2018-05-16 19:06:12下载
- 积分：1
-
GA_Nonuniform
利用浮点数编码的遗传算法优化非均匀天线阵的峰值旁瓣电平(This thesis presents how to design sparse arrays using genetic algorithm with the optimization goal of peak side lobe level and calculate the best positions of array elements.)
- 2016-08-05 18:34:59下载
- 积分：1
-
gauss-seidl
数值分析计算程序例子，高斯-赛德尔迭代法，用来解线性方程组，有注释。(Numerical analysis of the calculation procedure, Gauss-Seidl iterative method.)
- 2012-11-24 11:28:07下载
- 积分：1
-
leachbijiao
一种基于双簇头的能量均衡的无线传感器网络路由算法
(Wireless sensor network routing algorithm based on energy balance of the dual cluster head)
- 2016-06-01 15:24:42下载
- 积分：1
-
Read_nc_files
读取并存储nc文件，不同的文件里的参数可能不一样，按格式修改即可。(Read and store NC files, the parameters in different files may be different, and can be modified according to format.)
- 2018-07-27 18:33:09下载
- 积分：1
-
cebk_tsp
用离散数学或图论的术语来说，假设有一个图g=(v,e)，其中v是顶点集，e是边集，设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵，旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。
(Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
- 2011-05-22 08:12:37下载
- 积分：1
