-
File1-Presentation
THis is a presentation on Viola Joans Method and SIFT method introduced by David.G.Lowe
- 2010-10-06 03:59:51下载
- 积分：1
-
pugujijingdian
说明： 经典谱估计的所有算法，有注解，全面。直接法，间接法，BATLETT法，WELCH法等。(All the classic spectral estimation algorithm, annotated and comprehensive. Direct method, indirect method, BATLETT law, WELCH law.)
- 2011-03-17 22:13:06下载
- 积分：1
-
Slam
移动机器人栅格地图创建，SLAM方法，可以采用多种地图进行创建(Grid map building mobile robots, SLAM method, using a variety of maps can be created)
- 2010-05-21 08:54:12下载
- 积分：1
-
36146388ofdm_gitosimulink
Rs code on Fading channel Model
- 2013-04-11 15:03:24下载
- 积分：1
-
PSO-Fuzzy-Modeler-for-MATLAB
说明： 详细给定了模糊PSO模型算法，可以用于matlab工具箱(PSO Fuzzy Modeler for MATLAB)
- 2011-03-25 23:41:53下载
- 积分：1
-
scilab
Scilab培训教程，scilab是可代替MATLAB的开源软件，其程序语言与MATLAB相似，有很好的发展前途。(Scilab training course, scilab is the open source alternative to MATLAB, the MATLAB language and similar procedures, have good development prospects.)
- 2010-05-12 23:31:02下载
- 积分：1
-
volume
This is a source code for controlling volume via DSP techniques
- 2015-03-21 19:57:41下载
- 积分：1
-
InternetQos
说明： 关键词:网络QOS文档,这个网站注册真费事(KEYWORD:network qos,please let me in,THANK YOU,VERY VERY VERY VERY THANK YOU)
- 2011-03-12 16:03:35下载
- 积分：1
-
theory-of-radar
详细介绍雷达工作原理的一本书籍，直接进入主题，废话不多(introduce the theory of radar)
- 2014-11-19 16:40:39下载
- 积分：1
-
xiashan
MATLAB 牛顿下山法的一个小程序，原理就不详细说了。因牛顿迭代法受初值选取的限制，为防止迭代发散，对迭代过程再附加一项要求:|f(x(k+1))|<|f(x(k))|,将牛顿法迭代的结果:x(k+1) =x(k)-f(x(k))/f (x(k))和前一近似值x(k)适当加权平均做为新的改进值:x(k+1)=u*x(k+1) +(1-u)*x(k),其中u(0<>
迭代时u取1开始，逐次减半计算，直至附加要求符合为止。实例计算中x(k)=x(0)不变，只更新u和x(k+1)，直至:|f(x(k+1))|<|f(x(k))|（即|f(x(1))|<|f(x(0))|)，然后更新下山因子为u=1,继续以牛顿法迭代。(MATLAB Newton-down a small program, the principle is not explained in detail. Newton iteration by the initial value of the selected limit, in order to prevent additional iterative divergence, the iterative process a request: | f (x (k+1)) | < | f (x (k)) | Newton iteration Results: x (k+1) ' = X (k)-f (x (k))/f' (x (k)) and a previous approximation x (k), appropriately weighted average as a new improved value: x (k+1 ) = u* x (k+1) ' + (1-u)* x (k), where u (0 < u> iteration take successive calculated at 50 until the additional requirements found so far. examples of calculation of X ( k) = x (0) unchanged profile u and x (k+1, hungry) until: | f (x (k+1)) | < | f (x (k)) | (i.e. | f (x (1)) | < | f (x (0)) |), then profile downhill factor for u = 1, to continue to Newton iteration.)
- 2013-05-15 08:52:09下载
- 积分：1
