-
MATLAB-lina
说明： 图像处理应用。对LINA图的直方图提取等(Image processing applications. Histogram graph of extraction LINA)
- 2011-03-18 08:40:08下载
- 积分：1
-
R_N_U
原理：乘同余法产生随机数来生成均匀分布、瑞利分布、正态分布，压缩包包括3个分布的Matlab源代码(Principle: multiplicative congruential method to generate random numbers to generate uniformly distributed ，Rayleigh distribution and normal distribution.This package includes three distribution of Matlab source code.)
- 2013-11-02 14:24:01下载
- 积分：1
-
diphw4
A matlab source code in digital image processing using the smoothing and sharpening filers
- 2015-01-14 18:16:52下载
- 积分：1
-
TranslateToolsV1.3
能够实现调用GP工具，功能解释详细，功能强大，实现简单，说明简要(Can realize the calls to the GP tool, detailed, powerful, simple function of interpretation, brief)
- 2014-01-24 21:44:37下载
- 积分：1
-
抛物方程紧差分格式
追赶法求解，可以直接调用，抛物方程紧差分(Chasing method can be called directly)
- 2018-07-24 11:06:36下载
- 积分：1
-
m1
说明： 蓄电池容量检测数据采集，matlab 6.5(Battery capacity test data acquisition, matlab 6.5)
- 2011-06-30 11:44:23下载
- 积分：1
-
fangyen
sar图像去噪的几种新的方法，基于matlab GUI界面设计,鲁棒性好，性能优越。( Several new methods sar image denoising, Based on matlab GUI interface design, Robustness, superior performance.)
- 2016-11-10 19:20:07下载
- 积分：1
-
BPSK
QPSK仿真，实现，matlab，m文件(QPSK simulation)
- 2011-05-11 12:18:20下载
- 积分：1
-
equalization
着篇文章是关于均衡的 感觉很好 尤其是概念方面 值得学习 分享一下(Forward to articles about the balanced feel good, especially the concept of worth learning to share)
- 2013-02-28 22:46:09下载
- 积分：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
