登录
首页 » IDL » tree_height_cal

tree_height_cal

于 2019-07-11 发布 文件大小:2KB
0 251
下载积分: 1 下载次数: 0

代码说明:

  输入气象数据,根据ASRL模型计算森林区域最大树高(mapping maximum tree height with ASRL model)

文件列表:

tree_height_cal.pro, 7471 , 2019-03-07

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

发表评论

0 个回复

  • 400
    说明:  4wy45y 255y 2yrttj etj ty
    2019-05-31 14:34:20下载
    积分:1
  • USB_switch_schematics
    说明:  USB switch controller
    2019-04-01 20:17:34下载
    积分:1
  • 预测控制
    说明:  预测控制PPT,方便读者可以更好的学习预测控制,里面包含DMC,MPC,GPC等算法(Ppt of predictive control is convenient for readers to learn better predictive control, including DMC, MPC, GPC and other algorithms)
    2019-11-03 18:26:46下载
    积分:1
  • 印刷电路板的设计布线图设计的基本方法接着,确定印刷电路板所需的尺寸,并按原理图,将各个元器件位置初步确定下来,然后经过不断调整使布局更加合理,印刷电路板中各元件...
    印刷电路板的设计布线图设计的基本方法接着,确定印刷电路板所需的尺寸,并按原理图,将各个元器件位置初步确定下来,然后经过不断调整使布局更加合理,印刷电路板中各元件之间的接线安排方式如下:-The design of printed circuit board wiring diagram of the basic methods of design and then to determine the required printed circuit board size, and schematic diagram of the various components to determine the initial position and then continue to adjust after making a more rational layout, printed circuit boards in connection between the components arranged as follows:
    2022-01-31 07:29:06下载
    积分:1
  • weibull
    威布尔分布函数对大阪城数据进行风速拟合,获得拟合曲线,一年数据,风速仿真带曲线(Weibull Wind Speed Simulation Zone Curve)
    2021-05-13 13:30:02下载
    积分:1
  • pro_matlab_bb.m
    分支定界法(branch and bound)是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划,还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法,选择不同的分支变量和子问题进行分支。(Branch and bound (branch and bound) is one of the most commonly used algorithms for integer programming problems. This method can not only solve pure integer programming, but also solve mixed integer programming problems. Branch and bound is a search and iterative method, which selects different branch variables and sub problems to branch.)
    2020-11-02 15:39:53下载
    积分:1
  • core
    Godot AABB #include "AABB.hpp" #include "Plane.hpp" #include "Vector3.hpp" #include <algorithm>
    2020-06-19 15:20:02下载
    积分:1
  • umatS8R5
    使用umat计算蔡吴失效准则,计算失效指数If,弹性模量和强度参数见表3.1.(Compute the Tsai-Wu failure index IF on each layer of Example 3.8 (p. 151) using a UMAT subroutine, available in umatS8R5.for. The elastic moduli and strength values for the lamina are given in Table 3.1)
    2021-04-02 15:29:07下载
    积分:1
  • 自动取款机源代码
    自动取款机源代码-ATMs source code
    2022-07-18 05:27:49下载
    积分:1
  • searching
    /* binarysearch() - A binary search implementation which takes the same * arguments as the C library function bsearch() provided by stdlib.h. It * searches the sorted array at address base, which has nmemb elements, each of * which is size bytes long. compar is a pointer to a comparison function. * The function compares two array elements, and returns a negative, zero, or * positive integer depending on whether the first array element is less than, * equal to, or greater than the second. */
    2010-12-20 04:24:54下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载