-
naturalness_gradident_arithmetic
此代码只要是自然梯度算法（naturalness_gradident_arithmetic，使用matlab编写的，一起学习(This code as long as it is the natural gradient algorithm (naturalness_gradident_arithmetic, using matlab prepared to learn)
- 2021-05-10 00:08:34下载
- 积分：1
-
MATLAB
在erdas中，用于各种打开图像文字综合，并富含图片等举例说明(In erdas in, open the images for a variety of integrated text and photographs, and other examples of rich)
- 2009-06-07 07:26:11下载
- 积分：1
-
emd
说明： 分析矩阵的相关性，即给出两个矩阵，计算两个矩阵之间的距离，并画出矩阵的相关分析图。(this matlab code can compute the two matrix length, and can give analysy ficture )
- 2010-04-20 08:50:13下载
- 积分：1
-
mai---run
prosessing image by matlab
- 2012-09-20 23:18:31下载
- 积分：1
-
BPNET
结合Matlab的GUI和神经网络开发出来的界面(Combination of Matlab' s GUI and neural network developed interface)
- 2009-03-10 10:35:02下载
- 积分：1
-
2-shapes3d.m.tar
This code shows you how to generate level set descriptions of various three dimensional interfaces.
- 2012-06-22 18:06:24下载
- 积分：1
-
matlab-help
关于matlab帮助命令的中文文档，很有用的(Matlab help command on the Chinese document, very useful)
- 2011-11-01 11:18:14下载
- 积分：1
-
JSAC
认知无线电中基于机会频谱接入方案，仿真感知信道的选择、发送和休眠时间优化。(Opportunities for cognitive radio spectrum access scheme based on the simulation perception channel selection, transmit and sleep time optimization.)
- 2013-10-08 09:35:51下载
- 积分：1
-
chaoliushuoming
潮流算法潮流算法潮流算法潮流算法潮流算法潮流算法潮流算法潮流算法潮流算法潮流算法潮流算法潮流算法潮流算法潮流算法(chaoliuchaoliuchaoliuchaoliuchaoliuchaoliuchaoliuchaoliuchaoliuchaoliuchaoliuchaoliuchaoliuchaoliuchaoliu)
- 2010-11-15 19:54:12下载
- 积分：1
-
path_discovery
自己编写的利用matlab实现无线自组织网AODV仿真的算法源码。
为由50个节点构成的网络。在50m×50m大小的区域内，随机的产生50个节点。由用户指定源节点和目的节点，程序负责给出从源节点到目的节点的最小路径和此路径的跳数。各个节点之间设定为只要在自己直接通信范围内的其它节点，均一跳可达。(Write your own realization of the use of matlab simulation of wireless self-organizing network algorithms AODV source. The grounds of a network of 50 nodes. Size of 50m × 50m in area, randomly generated 50 nodes. By the user to specify the source node and destination node, the program responsible for the given node from the source node to the destination path and this path is the minimum number of hops. Set between each node to communicate directly as long as within the scope of their other nodes, all jump up.)
- 2021-04-15 16:08:55下载
- 积分：1
