登录
首页 » matlab » Sastolic

Sastolic

于 2017-08-11 发布 文件大小:3KB
0 298
下载积分: 1 下载次数: 6

代码说明:

  云分类器,一种基于云模型理论的分类程序,程序中使用云分类器(Cloud classifier, a classification based on cloud model theory, using the cloud classifier in the program)

文件列表:

Tiriscloud.m

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

发表评论

0 个回复

  • zvite-class
    这是一个自己写的完整的ADO类 包含了两部分(This is a complete write their own ADO class contains two parts)
    2017-04-01 09:37:22下载
    积分:1
  • c
    说明:  用于实现校际运动会管理的程序,主要功能就是实现校际运动会管理(Used to implement inter-school sports management program, the main function is to realize the inter-school sports management)
    2011-07-10 14:58:02下载
    积分:1
  • Mittag-Leffler
    更新的广义Mittag-Leffler函数,支持矩阵输入。源码由Igor Podlubny, Martin Kacenak编写。(Updated generalized Mittag-Leffler function, support for matrix input. Source by Igor Podlubny, Martin Kacenak preparation.)
    2009-11-04 17:09:38下载
    积分:1
  • noviygq3
    98下的按键拦截驱动,VC++6和Vtools编译,很好(98 buttons on the intercept drive, vc + + 6 and Vtools compilation, is very good)
    2017-06-09 14:21:45下载
    积分:1
  • MyMFC
    说明:  在视图区画正弦函数曲线,并且在一个菜单下以对话框形式输入正弦图的起点和终点坐标。(In the view area sine curve drawing, and in the form of a menu in the dialog box enter the start and end the sine map coordinates.)
    2011-04-02 17:02:04下载
    积分:1
  • sin()-8.0
    sin()函数 给定一个弧度值或者任意数值,可以计算相应的sin值即正弦值(sin () function is given a value, or any value in radians, we can calculate the corresponding value of the sine value sin)
    2013-05-31 21:08:32下载
    积分:1
  • array
    c和c++动态数组的实现.visual studio 2008下编译通过(c and c++ realize dynamic array. visual studio 2008 under the compiler through)
    2008-07-21 14:37:57下载
    积分:1
  • 2
    说明:  校园导游系统,是图的最短路径的应用 我短学期的课程小实验(Campus tour guide system, is the shortest path map application, I short-term courses of small experimental)
    2008-04-15 16:12:05下载
    积分:1
  • battstat
    Pocket PC Application - Battery status(Pocket PC Application- Battery status)
    2009-11-19 18:19:01下载
    积分:1
  • closest_pair
    分治法思想,求最邻近点对,考虑将所给的n个点的集合S分成2个子集S1和S2,每个子集中约有n/2个点,然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)
    2013-12-07 16:46:26下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载