登录
首页 » matlab » nccmp

nccmp

于 2014-09-16 发布 文件大小:4KB
0 322
下载积分: 1 下载次数: 2

代码说明:

  比较两个netcdf文件 1。通过添加内部ind2sub1函数remove函数依赖第三方 2。格式化文本(Description NCCMP compares two netcdf files and prints the differences. This function is useful for testing mathematical forecasting or prediction models. USAGE: NCCMP(ncfile1,ncfile2) NCCMP(ncfile1,ncfile2,tolerance,forceCompare) INPUT: ncfile1- name of the NetCDF file to compare ncfile2- name of the NetCDF file to compare tolerance- Compare numeric data using a tolerance threshold forceCompare- if false, exit when first difference is found true: continues to process all variables EXAMPLES: nccmp( old.nc , new.nc ,0.000001) nccmp( old.nc , new.nc ,[],true) FEATURES: 1. Print the differences and their locations 2. Exits when first difference is found or optionally continues to process all variables 3. User defined tolerance threshold to compare the variables TO DO: 1. Specific variable inclusion or exclusion 2. Specific attribute inclusion or exclusion 3. Option to ignore the history attribute 4. Ignore difference between v)

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

发表评论

0 个回复

  • HowtouseSimulink
    simulink的经典用法,偶然在其他地方看到的,和大家共享(simulink classic usage, occasionally, in other places to see, and everyone shared)
    2007-08-31 10:23:54下载
    积分:1
  • microcontroller
    基于MATLAB与单片机的测控应用系统的程序代码(Based on MATLAB and MCU control application code)
    2013-08-02 17:25:30下载
    积分:1
  • LIVRE_Automatique-Systemes-linaires-non-linEAires
    LIVRE_Automatique-Systemes-linaires-non linEAires
    2015-02-18 07:37:47下载
    积分:1
  • 块状导频信道估计 ofdm
    块状导频信道估计 对于基础学习有很好的帮助(Massive pilot channel estimation based learning for good help)
    2014-06-24 10:57:57下载
    积分: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
  • IDW
    IDW距离反比加权方法,权重选择为2,可根据需要自己改变(IDW inverse distance weighting, the weight chosen as 2, can be changed according to need their own)
    2010-07-24 15:48:39下载
    积分:1
  • boyilun
    说明:  张维迎的《博弈论与信息经济学》,很能锻炼人的思维,介绍了四种类型的博弈模型(Weiying' s &quot Game Theory and Information Economics,&quot is to train a person' s thinking, describes four types of game models)
    2010-04-17 11:44:45下载
    积分:1
  • czesc_warsztatow
    Motor de corriente continua en simulink
    2014-02-10 01:07:38下载
    积分:1
  • FLch3RLSeg3
    递推的最小二乘辨识程序,系统辨识中应用,用MATLAB实现,毕竟实用(Recursive least squares identification procedure, the application of system identification using MATLAB realize, after all, practical)
    2007-11-07 14:40:52下载
    积分:1
  • hw1
    pattern classification homework 2
    2010-02-09 08:06:19下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载