登录
首页 » matlab » 程序

程序

于 2020-06-20 发布 文件大小:3KB
0 207
下载积分: 1 下载次数: 4

代码说明:

  DS证据理论,用于信息融合,融合不同特征之间的信息 四种信息熵的计算程序(DS evidence theory for information fusion, fusion of information between different features Four Computing Procedures of Information Entropy)

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

发表评论

0 个回复

  • sys6
    滑膜观测器,功能性测试,观测器估计参数,估计不确定(Synovio observer, functional test, observer estimation parameter, estimation uncertainty)
    2018-03-15 02:18:33下载
    积分:1
  • 数字图像处理第三版中文答案(冈萨雷斯)
    说明:  数字图像处理第三版中文的答案解析冈萨雷斯(Digital Image Processing third Edition (Gonzalez))
    2020-12-30 17:07:29下载
    积分:1
  • src
    银行管理程序,实现简单管理员删户开户,转账等功能(Bank management program)
    2013-05-28 13:54:49下载
    积分:1
  • FORTRANppt
    说明:  初学者学习Fortran的课件,蛮有用的(Fortran for beginners learning courseware, giving a pleasing use)
    2010-04-25 11:16:51下载
    积分:1
  • motaifenxi_1
    说明:  计算悬臂梁模态,给出参数计算悬臂梁模态,利用有限元方法。(CALCULATION OF MODE OF CANTILEVER BEAM)
    2019-02-23 09:43:23下载
    积分:1
  • ImageToPDForXPS
    image to xps driver for windows
    2017-10-13 13:00:55下载
    积分:1
  • PSCAD电力电子
    谭甜源老师编写的基于PSCAD的 电力电子仿真,能帮助读者方便使用PSCAD来学习电力电子。(Power CAD simulation based on PSCAD written by Teacher Tan Tianyuan can help readers to use PSCAD to learn power electronics.)
    2020-06-21 22:00:01下载
    积分:1
  • Find prime numbers prepared by screening the function: void sieve (bool isPrime...
    编写筛选查找素数函数: void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组,n为数组大小。由于2是第一个素数, 所以设置isPrime[0]和isPrime[1]的值为false,并设置其余的元素初值为true。 然后对从4到n-1的每一个i,判断i是否能够被2整除,如果i能够被2整除,则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理,当操作结束时,所有值为true的isPrime[i]所对应的i就是素数,它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.
    2023-03-02 04:45:03下载
    积分:1
  • 练习利用Windows时钟编程
    练习利用Windows时钟编程-exercises using Windows clock programming
    2022-01-28 01:33:44下载
    积分:1
  • NimbleKitDoc
    NimbleKitDoc.pdf 一个第三方 开发 平台(NimbleKitDoc.pdf a third-party development platform)
    2010-08-21 06:38:58下载
    积分:1
  • 696516资源总数
  • 106432会员总数
  • 11今日下载