登录
首页 » matlab » ucsd_garch

ucsd_garch

于 2007-04-03 发布 文件大小:988KB
0 191
下载积分: 1 下载次数: 456

代码说明:

  经济类的实用的时间序列分析软件包,已经是目前最好的版本了。USCD_GARCH,可以研究非平稳时间序列数据。(kind of practical time series analysis software package, is the best current version. USCD_GARCH can study non-stationary time series data.)

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

发表评论

0 个回复

  • power_3phPWM
    此为三相正弦波PWM逆变器电路,由IGBT元件构成,可实现三相逆变仿真。(PWM inverter)
    2014-05-30 18:07:31下载
    积分:1
  • 高斯积分matlab
    说明:  计算在同一区域上的二重高斯-勒让德积分。(Calculating double Gauss integral in the same region)
    2021-04-20 12:08:50下载
    积分:1
  • PSNR-NC
    说明:  对图像进行处理后常需要计算图像的PSNR值和NC值(calculate the PSNR and NC of pictures)
    2011-02-24 10:37:54下载
    积分:1
  • ldpc
    matlab运行仿真ldpc的编译码算法,高效可靠,易于理解(matlab run a simulation ldpc encoding and decoding algorithm, efficient and reliable, easy to understand)
    2012-05-18 11:01:47下载
    积分:1
  • MUSIC
    matlab MUSIC算法~~~~~~~~~~~~~~~~~~~~~~(现在数字信号处理 MUSIC算法,大家可借鉴~~~~~~~~~~~~~~~~~~)
    2013-12-27 09:39:58下载
    积分:1
  • MAC-frame-analysis
    对于一个给定二进制 MAC帧, 在 MATLAB 环境下编程,解析出MAC帧中的具体信息。 (For a given binary MAC frame in the MATLAB environment programming, parsing out the specific information in the MAC frame.)
    2021-02-14 10:59:49下载
    积分:1
  • segy
    matlab中读写SU格式的文件,可用于地震资料的读写(read and write su files while doing seismic date processing)
    2010-05-15 20:32:25下载
    积分:1
  • scheduling_algorithm
    三种动态信道分配算法的比较,一种为随机分配算法,另外两种用于认知无线电领域,一种为从资源角度出发的RP算法,一种是从需求角度出发的DP算法。(Three dynamic channel allocation algorithm for comparison, a random allocation algorithm, the other two areas for cognitive radio, a perspective from the resources of the RP algorithm, one is from the demand point of view of the DP algorithm.)
    2011-05-20 09:56:14下载
    积分:1
  • cbir
    CBIR on matlab,using access and matlab code.
    2013-04-16 00:02:44下载
    积分:1
  • Desktop
    最大流问题,一种组合最优化问题,就是要讨论如何充分利用装置的能力,使得运输的流量最大,以取得最好的效果。求最大流的标号算法最早由福特和福克逊于1956年提出,20世纪50年代福特、福克逊建立的“网络流理论”,是网络应用的重要组成成分。(Maximum flow problem, a combinatorial optimization problem, is to discuss how to make full use of the capacity of the device to maximize the flow of transport in order to achieve the best results. The labeling algorithm for maximum flow was first proposed by Ford and Fulkerson in 1956. The network flow theory established by Ford and Fulkerson in 1950s is an important component of network application.)
    2019-06-28 10:29:03下载
    积分:1
  • 696516资源总数
  • 106459会员总数
  • 0今日下载