登录
首页 » matlab » logrank

logrank

于 2012-04-09 发布 文件大小:4KB
0 181
下载积分: 1 下载次数: 7

代码说明:

  比较生存曲线可以用统计假设测试日志秩检验。它是用来测试的零假设,没有任何区别的人口的生存曲线(即概率事件发生在任何时间点是相同的每个人口).这个函数使用卡普兰曲线的程序来估计生存函数.(Comparison of two survival curves can be done using a statistical hypothesis test called the log rank test. It is used to test the null hypothesis that there is no difference between the population survival curves (i.e. the probability of an event occurring at any time point is the same for each population). This function use the Kaplan-Meier procedure to estimate the survival function, so it is mandatory to download )

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

发表评论

0 个回复

  • DSPkeshe
    数字信号处理课设:窗函数法设计一个数字带通FIR滤波器(Based digital signal processing class: window function method to design a digital FIR band-pass filter)
    2009-07-04 21:07:28下载
    积分:1
  • gpr
    gpr matlab code for sfcw in gpr gpr has a good performance with sfcw
    2011-01-22 20:26:08下载
    积分:1
  • ask_pe
    一个用matlab实现的ask仿真程序,加入了高斯白噪声(Used to achieve a matlab simulation program ask to add a Gaussian white noise)
    2009-05-15 07:47:00下载
    积分:1
  • ADRC
    说明:  自抗扰控制器Simulink仿真,其中包含跟踪微分器,扩张状态观测器,非线性反馈。(Simulink simulation of active disturbance rejection controller, including tracking differentiator, extended state observer, nonlinear feedback.)
    2021-04-20 11:08:50下载
    积分:1
  • gaot
    matlab 遗传算法工具箱(有说明文档)(matlab genetic algorithm toolbox (with documentation))
    2007-08-14 08:52:12下载
    积分:1
  • ymax
    wimax with source code for matlab
    2009-11-07 04:05:04下载
    积分:1
  • MTF
    这是关于调制传递函数MTF如何处理卫星遥感图像的一个讲义,对图像进行复原,提高清晰度(This is the modulation transfer function MTF on how to deal with satellite remote sensing images of a lecture, image recovery, improve clarity)
    2007-07-31 12:10:08下载
    积分:1
  • muAO-MPC-0.2.0.tar
    The MATLAB interface makes it possible to use and control a precompiled solver from MATLAB...
    2013-01-31 14:42:03下载
    积分:1
  • DG
    说明:  MATLAB code for the implementation of genetic algorithm
    2014-10-02 23:27:23下载
    积分:1
  • Recursive_integer_division
    递归法求解整数划分。 整数划分,是指把一个正整数n写成如下形式: n=m1+m2+…+mi (其中mi为正整数,并且1 <= mi <= n),则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m,即max(m1,m2,...,mi)<=m,则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )
    2014-02-06 14:21:38下载
    积分:1
  • 696518资源总数
  • 105540会员总数
  • 37今日下载