-
graydct
DCT给灰度图像加二值的水印信息,运行显示四幅图,分别是原图像,水印图像,加水印的图像和提取的水印图像(DCT to gray image plus two watermark values, run the show four maps are the original image, watermark image, add watermark image and extracted watermark image)
- 2010-05-05 14:40:49下载
- 积分:1
-
RFLNA
本文设计了低噪声LNA放大器,较好了达到了指标,但是仍需改进。(This article is designed LNA low-noise amplifier has achieved a good target, but still needed improvement.)
- 2009-12-13 00:15:36下载
- 积分:1
-
wuwei
2010年国际自动化测量技术和机电一体化会议
无位置传感器开关磁阻电机的研究(Automation of measurement technology in 2010 International Conference and Mechatronics Sensorless Switched Reluctance Motor with)
- 2010-12-06 23:12:10下载
- 积分:1
-
MATLAB
说明: 求解约束极小值问题的函数fmincon,fmincon是求解多维约束优化问题的优化工具箱函数(Problem solving constrained minimum function fmincon, fmincon is a multi-dimensional constrained optimization problems for solving the optimization toolbox function)
- 2008-12-05 01:01:06下载
- 积分:1
-
lininsterp
线性内插的MATLAB程序,从最简单的开始,教你慢慢学会MATLAB编程!(linear interpolation MATLAB procedures, from the most simple, teach you slowly learn MATLAB programming!)
- 2006-12-13 14:10:19下载
- 积分:1
-
5_2_01
Differential Evolution with DEoptim
- 2015-04-10 04:01:44下载
- 积分:1
-
pidmatlab
一个pid仿真例子,有程序和仿真模拟图,可以直接应用,希望有用!(A simulation example of a pid, have procedures and simulation map, can be applied directly, I hope useful!)
- 2008-02-03 16:41:48下载
- 积分:1
-
Antenna_Gui
c est programme pour afficher les lobs d un antenne
- 2012-06-06 18:52:38下载
- 积分:1
-
a-bilnd-dection
基于子空间的盲多用户检测技术,里面包含PASTd算法和秩算法的介绍与计算。下面我会把自己的翻译也上传上来。(Subspace-based blind multi-user detection technology, which containing PASTd algorithm and rank algorithm describes calculation. I will own translation post it here.)
- 2013-02-27 21:34:42下载
- 积分:1
-
GraphTheoryAlgorithmMATLAB
说明: 图论算法及其MATLAB 程序代码
1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法
2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法
3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法
6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)
- 2010-03-28 15:39:29下载
- 积分:1