登录
首页 » DOS » CS-101501-UGP2

CS-101501-UGP2

于 2013-01-17 发布 文件大小:885KB
0 186
下载积分: 1 下载次数: 5

代码说明:

  This document describes the libraries provided as part of BlueLab.

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • imgsuanfa
    用matlab编写的图像复原程序,好用,大家可以试一下-Prepared to use matlab image restoration procedures, easy to use, everyone can try(Prepared to use matlab image restoration procedures, easy to use, everyone can try)
    2009-06-06 14:28:22下载
    积分:1
  • AntColony
    蚁群算法:matlab编程实现蚁群算法源代码(Ant Colony Algorithm: Matlab programming ant colony algorithm source code)
    2013-03-09 22:38:44下载
    积分:1
  • DOA
    This file compares various low resolution and high resolution direction of arrival algorithms. The low resolution algorithms are bartlett and capon. The high resolution algorithms are Music, PHD.
    2015-03-07 15:32:03下载
    积分:1
  • Mannually_Placed_Landmarks_Based_Registraiton
    a mannually placed landmarks based registration
    2010-07-08 14:40:59下载
    积分:1
  • tuxiangfenge
    多个图像分割程序,都已经验证过,可以使用,适合初学者(thank)
    2010-05-22 00:48:02下载
    积分:1
  • Matlab-testing-instrument-control
    Matlab控制测量仪器产生所需的测试信号详细文档,对于特定开发或者不想购买仪器license的人,很有用(Matlab control test intrument like tek or agilent generating signals)
    2013-10-10 11:13:04下载
    积分:1
  • 分支定界法
    说明:  分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题,使用网格的方法有时更为简单。 [1] 通常,把全部可行解空间反复地分割为越来越小的子集,称为分支;并且对每个子集内的解集计算一个目标下界(对于最小值问题),这称为定界。在每次分枝后,凡是界限超出已知可行解集目标值的那些子集不再进一步分枝,这样,许多子集可不予考虑,这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)
    2021-04-26 12:21:14下载
    积分:1
  • 201233333
    FOR HELP AND DOCUMENT FOR POWER FC CC
    2015-03-06 20:39:22下载
    积分:1
  • Seismic_NMO
    叠前地震数据动校正和叠加的matlab模块,对于学习地震勘探的人十分有效(code for seismic NMO and Seismic stack)
    2016-03-18 16:46:59下载
    积分:1
  • 4
    说明:  插值的函数 函数名 功能 Language 求已知数据点的拉格朗日插值多项式 Atken 求已知数据点的艾特肯插值多项式 Newton 求已知数据点的均差形式的牛顿插值多项式 Newtonforward 求已知数据点的前向牛顿差分插值多项式 Newtonback 求已知数据点的后向牛顿差分插值多项式 Gauss 求已知数据点的高斯插值多项式 Hermite 求已知数据点的埃尔米特插值多项式 SubHermite 求已知数据点的分段三次埃尔米特插值多项式及其插值点处的值 SecSample 求已知数据点的二次样条插值多项式及其插值点处的值 ThrSample1 求已知数据点的第一类三次样条插值多项式及其插值点处的值 ThrSample2 求已知数据点的第二类三次样条插值多项式及其插值点处的值 ThrSample3 求已知数据点的第三类三次样条插值多项式及其插值点处的值 BSample 求已知数据点的第一类B样条的插值 DCS 用倒差商算法求已知数据点的有理分式形式的插值分式 Neville 用Neville算法求已知数据点的有理分式形式的插值分式 FCZ 用倒差商算法求已知数据点的有理分式形式的插值分式 DL 用双线性插值求已知点的插值 DTL 用二元三点拉格朗日插值求已知点的插值 DH 用分片双三次埃尔米特插值求插值点的z坐标 (Interpolation function)
    2011-08-15 09:42:47下载
    积分:1
  • 696518资源总数
  • 106215会员总数
  • 5今日下载