登录
首页 » IDL » zhu_npp_calc

zhu_npp_calc

于 2014-03-23 发布 文件大小:97KB
0 302
下载积分: 1 下载次数: 89

代码说明:

  朱文泉博士NPP计算模型,放入ENVI扩展文件夹后使用(Dr. Zhu Wenquan NPP model, into the Extensions folder using ENVI)

文件列表:

zhu_npp_calc.sav,111796,2013-11-26

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

发表评论

0 个回复

  • 腐蚀,膨胀,细化算法
    说明:  基于C程序的图像腐蚀,图像膨胀,细化算法代码,供大家参考。(The image erosion based on the C program, the image expansion, and the algorithm code are refined for your reference.)
    2020-04-04 12:06:53下载
    积分:1
  • 为了实现WINDOWS与LINUX的串口通讯,利用Csocket实现的一个小型数据交换软件,对学习Csocket类很有启发作用。...
    为了实现WINDOWS与LINUX的串口通讯,利用Csocket实现的一个小型数据交换软件,对学习Csocket类编程很有启发作用。-in order to achieve the Windows and LINUX serial communications, Csocket achieved using a small data exchange software. Csocket type of learning program is very enlightening role.
    2023-01-01 09:40:03下载
    积分:1
  • 聊天序基于winsocket,包括客户端和服务器端。在VC++6.0下译通过...
    聊天程序基于winsocket,包括客户端和服务器端。在VC++6.0下编译通过-winsocket based chat program, including the client and server side. The VC 6.0 compiler through
    2022-02-07 23:25:30下载
    积分:1
  • vb 写的防火墙,可以与自己加载一些另外的安全功能
    vb 写的防火墙,可以与自己加载一些另外的安全功能-vb wrote firewalls, can be loaded with its own number of additional security features
    2023-01-20 04:45:03下载
    积分:1
  • 多用户通信的时分复用,每个节点在其固定的时间内发送数据包,采用OPNET仿真工具-Multi-user time division multiplexing communications, each node in the fixed period of time to send data packets, using OPNET simulation tool
    2022-03-01 12:51:17下载
    积分:1
  • 群举法查询国际域名,包括.com .net后缀。可自定义包涵的前缀后缀...
    群举法查询国际域名,包括.com .net后缀。可自定义包涵的前缀后缀-groups cite international law for domain names, including. Com. Net suffix. Self-definition includes the suffix prefix
    2022-08-04 03:09:15下载
    积分:1
  • 实时碰撞检测算法技术
    说明:  实时碰撞算法的随书源码,实现了相关碰撞检测算法(Real-time Collision Algorithms with Book Source Code)
    2018-12-25 09:41:35下载
    积分:1
  • JarInputStream
    The input stream from which the JAR file to be read may be fetched Source Code for Andriod.
    2014-01-03 19:39:01下载
    积分:1
  • FibonacciHeap
    斐波那契堆基于二项式堆,在支持以O(1)时间实现插入、合并和以O(log n)实现删除最小元素的基础上,进一步实现了以O(1)实现指定节点值减少和用O(log n)时间完成删除任意节点操作(Fibonacci heap-based binomial heaps of support to the O (1) time to achieve insertion, Merger and O (log n) to achieve the smallest element deleted on the basis of further to the O (1) to achieve specified nodes and reduce the value of O (log n) time to complete the deletion of arbitrary nodes parade for)
    2007-01-04 22:36:07下载
    积分:1
  • wsnn
    omnet++ project in wsn
    2019-07-02 00:12:28下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载