登录
首页 » Unix_Linux » webservers

webservers

于 2013-10-05 发布 文件大小:13KB
0 318
下载积分: 1 下载次数: 1

代码说明:

  根据互联网流行的各种中间件版本特征,整理出来的最新中间件对比分析文档(According to the Internet version of the popular features of a variety of middleware, middleware sorted out comparative analysis of the latest documents)

文件列表:

webservers.doc,149504,2013-07-24

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

发表评论

0 个回复

  • K3BOSSeorderTwoDev
    金蝶K3 BOS销售出库单审核反写接口,中间层二次开发,先在二次开发模板中插入记录(t_ThirdPartyComponent) (failed to translate)
    2013-05-02 11:13:57下载
    积分:1
  • current_rose
    利用windrose绘制海流过程曲线,对流向进行修正(Using Windrose to draw ocean current process curve and correct the current direction)
    2019-01-24 09:32:02下载
    积分:1
  • dist
    说明:  图像间距离测量可以轻松实现,还有大量源码可共分享(Measuring the distance between images can be easily achieved, there are a large number of source code can be a total share)
    2008-11-08 22:10:29下载
    积分:1
  • uostorder-safe
    NT_INFO 查看NT的系统配置信息,很好的源代码,学习用(NT_INFO view NT system configuration information, very good source code, learning to use)
    2017-04-15 05:42:19下载
    积分:1
  • OfusionPro
    著名的OGRE的3DS MAX导出插件ofusion的PRO版本(已破解).(OGRE famous exporter of 3DS MAX plug-ofusion the PRO version (cracked).)
    2020-10-07 16:37:36下载
    积分:1
  • MUL_RAYLEIGH
    说明:  使用MATLAB语言编辑产生瑞利信道模型,可用于多径效应仿真(The Rayleigh channel model is edited by MATLAB language, which can be used in multipath effect simulation)
    2020-05-01 16:51:41下载
    积分:1
  • mpool
    说明:  文件是内存池分析源码,分析内存的高效管理,及它的设计思路(File is the memory pool of source code, analysis and efficient memory management, and its design ideas)
    2011-03-03 08:47:16下载
    积分:1
  • sampe-fft
    这是在matlab/simulink环境下,对一个连续信号采样及离散化.并进行FFT频谱分析的实例(This is in the matlab/simulink environment, for a continuous signal sampling and discretization. And FFT spectrum analysis examples)
    2008-03-22 13:54:22下载
    积分:1
  • current_rose
    说明:  利用windrose绘制海流过程曲线,对流向进行修正(Using Windrose to draw ocean current process curve and correct the current direction)
    2019-01-24 09:32:02下载
    积分:1
  • Desktop
    假设有n个任务由k个可并行工作的机器来完成,完成任务i需要的时间为ti,试设计一个算法找出完成这n个任务的最佳调度,式的完成全部任务的时间最早(Suppose there are n tasks done by the k-th machine can work in parallel, needed to complete the task i time Ti, try to design an algorithm to find the complete optimal scheduling of the n tasks, the task time of the completion of the formula earliest)
    2013-01-23 14:40:57下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载