超大文件传输源码，解决网络超大文件传输的难题

关于游戏对站平台的,服务器和客户端.自己解压后看吧,-Of the game on the station platform, server and client. Check it out myself after decompression,

一个网络方面的源程序,通过网络编程实现对内网电脑各参数信息采集的示例,客户端.-a network source, network programming through internal computer network parameters Information Collection example, the client.

一个在AMPipeCom上开发的即时消息系统.rar-AMPipeCom one on the development of the instant messaging system. Rar

在Windows平台下实现网络封包过滤的一种方法-the Windows platform network packet filtering method

Step by step teach you how to program Objective-C 2.0 on Mac OS X.

这是一个代理服务器程序它使用多线程，Semaphoreblocking-socketan RFC in hand。其中有一个内嵌的Web服务器，使用一个自定义的计数器agCount.dll。内嵌Web服务器使用虚拟域名www.personalproxy.com-This is a proxy server program which uses multi-threaded, Semaphoreblocking-socketan RFC in hand. Which has a built-in Web server, use a custom counter agCount.dll. Embedded Web server using virtual domain www.personalproxy.com

这里是一段关于生成数据是定义数据包中内容时用到的一个byte数组的定义和合并方法-here is a generation of the data definition packet content used in a byte array to the definition and method of merger

单射函数问题 设函数f将点集S = {0,1, , n -1}映射为f (S) = { f (i) | iÎ S} Í S 。单射函数问题要 从S中选取最大子集X Í S 使f (X )是单射函数。 例如，当n=7， f (S) = {1,0,0,2,2,3,6} Í S 时， X = {0,1,6} Í S 是所求的最大子集。-Injective function, the function f the problem will be the point set based S = (0,1,  , n-1) maps to f (S) = (f (i) | iÎ S) Í S. Injective function of the problem from the largest subset of S, select the X Í S so that f (X) is injective function. For example, when n = 7, f (S) = (1,0,0,2,2,3,6) Í S, when, X = (0,1,6) Í S is a subset of the desired maximum.

p-持续CSMA协议下，一个用户在发送之前，先侦听信道，若是空闲，就以概率p发送出去，而以q =1-p的概率推迟到下一帧时。如果下一帧时仍是空闲，便再次以概率p发送而以q推迟到再下一帧时。直到发送成功或另外一用户开始发送时为止。若一开始就侦听到信道忙，它就等到下一帧时，然后再开始上述过程。若发生冲突，这等待一随机时间后重新开始。本实验中取q值为0.5。求的是0.5-持续CSMA。 -p-persistent CSMA agreement, a user before sending the first interception channel, if idle, with probability p sent, and to q = 1-p probability postponed to the next frames. If the next frame was still idle, they again sent with probability p and q to further postponed to the next frames. Until this a success or other users at the beginning of this date. If an interception at the start of the busy channel, it will wait till the next frames, and then begin the process. If conflict breaks out, waiting for a random period of time after the re-start. The experiments take q value of 0.5. For the 0.5-sustained CSMA.