登录
首页 » DOS » 02102

02102

于 2016-04-21 发布 文件大小:2KB
0 135
下载积分: 1 下载次数: 1

代码说明:

  VB6.0实现的FLASH导航传递。。和调用(FLASH navigation VB6.0 achieved transmission)

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

发表评论

0 个回复

  • 数据库导入和筛选工具
    数据库导入和筛选工具
    2017-03-17下载
    积分:1
  • room-fire
    火灾动力学模拟软件fds的高校宿舍火灾模拟代码(Fire dynamics simulation software fds college dormitory fire simulation code)
    2013-11-14 15:22:54下载
    积分:1
  • bouffioux-mode_CREEP_UMAT
    A CREEP MODE BASED ON bouffioux CREEP framewok, which accounts for the rheological properties of continuous medium
    2015-05-25 21:09:59下载
    积分:1
  • vbcjdd
    vb的经典插件对于初学者来说很方便的插件可以屏蔽垃圾代码(vb classic plugin for beginners is very convenient plug-shielding can refuse code)
    2007-01-21 23:34:20下载
    积分:1
  • [A
    说明:  Consider a precision structure subjected to varying thermal conditions unless carefully designed, it will distort as a result of the thermal gradients. One way to prevent this is to build the structure a thermally stable composite material this is the passive approach.
    2015-11-19 05:44:26下载
    积分:1
  • 用于生成下载链接的关键类 可用于会员下载内容控制
    用于生成下载链接的关键类 可用于会员下载内容控制-a class used to create a link to download
    2022-01-31 00:56:02下载
    积分:1
  • pvb-gambardbxxxx
    save picture webcam to computer
    2014-02-05 11:23:41下载
    积分:1
  • include
    1)随机输入平面上n个点的集合; 2)使用分治策略编制计算机程序求出这n个点的极大点。 3)编程实现2维极大点问题的求解,且在程序中体现分治策略。程序能处理任意的n个点。 (1) a collection of n points on a random input plane 2) using divide and conquer strategy computer program to calculate the maximum point of the n point. 3) programming for solving 2 dimensional maximal point problem, and reflect the divide and conquer strategy in the program. Program can handle arbitrary n points.)
    2015-11-03 15:43:31下载
    积分:1
  • 在同一个线中实现异步套接字的聊天序,用以音视频…
    在同一个线程中使用异步套接字实现聊天室程序,避免了不读数据时出现阻塞-In the same thread realize the use of Asynchronous Sockets Chat procedures to avoid non-blocking when reading data
    2022-01-22 02:10:31下载
    积分:1
  • 1-持续CSMA协议下,当一个用户要发送数据时,它首先侦听信道,看是否有其他站点在传送。如果信道忙,就持续等待直到信道空闲时,便将数据送出。若发生冲突,就等待一个随机长的时间,然后重新侦听。 对于这种协议,先考虑当前帧i时的前一帧时i-1,得到前一帧时的最后一帧frame0(相对时间最大的帧)的相对时间dt0,然后再在当前帧时查看有哪些帧的相对时间会小于dt0,这些帧若是发送就会与frame0发生冲突,所以这些帧就进入持续等待状态,这些帧并没有发送。再考虑当前帧余下的帧(dt > dt0),它们中的第一帧侦听到信道处于空闲状态,所以就发送,而其他的帧由于第一帧的发送又处于等待状态。若有大于或等于2个帧的相对时间相等,且它们又同时侦听到信道空闲时,就会同时发送而导致冲突,冲突发生后的处理方法同上两个协议的一样。 -1- CSMA continued under the agreement, when a user to send data, it first interception Channel to see if there are other sites in transmission. If Channel busy, continuing to wait until the idle channel, and put more information out. If there is conflict, it is a long wait for a random time, then re-interception. Such agreements, to consider the current frame i am one of the former when i-1, be a time before the final one frame0 (relative to the time frame) the relative dt0 time, and then when the current frame to detect what the relative time frame will be less than dt0, these frames will be sent if and frame0 conflict, th
    2022-03-03 08:55:18下载
    积分:1
  • 696522资源总数
  • 104049会员总数
  • 30今日下载