erase_userdata_e3372

利用遗传算法优化TSP问题,较好的一个例程，在VC++平台下开发(use GA optimize TSP problem under VC++)

用两个字符形成点阵大字，VC++经典编程源码，很好的参考资料。(Lattice with two characters form characters, VC++ classical programming source code, a good reference.)

Criation of Messages

纯ALOHA协议 在该协议下，用户只要有帧产生，就会传送出去，发生冲突时，就等待一个随机时间后再重发。 所以对当前帧时，只有两种情况下可以发送成功： 1）当前帧时只有一帧要发送，且当前帧时的前一帧时无帧发送； 2）当前帧时只有一帧要发送（发送时刻为t），且前一帧时的最后一帧的发送时间不在（t- FRAMETIME）~ t这段时间内。 其他情况下都会产生冲突。 发生冲突时，错误帧继续传送，用户重新发送帧，设定一个随机数Rt，将该帧添加到第Rt/ FRAMETIME帧时上去，并设该帧的相对时间为Rt% FRAMETIME。这样即相当于用户等待一随机时间后重发。 对每一帧时进行上述控制，最终可得到成功发送的次数Suc，将其除以Suc = Suc /ARRAYLENGTH即得平均每帧时发送成功的帧数。 对于不同G，得到不同FrameArray，所得的Suc也不同，用一个数组来保存G与Suc的对应关系，再将其画出来。 -pure ALOHA agreement under the agreement, as long as users have a frame, it will transmit out, conflict, will wait for a random period of time before re-issued. Therefore, the current frame, there are only two circumstances can this success : 1) the current frame only one to send, and the current frame before one-time frame sent; 2) the current frame only to send a (t this moment), but before a final of a transmission time not (t-FRAMETIME) ~ t this time. Other cases will have conflict. Conflict, to continue to disseminate the wrong frame, users re-sending fram

说明：  source wyd 762 com codigo em c++, source wyd 762 com codigo em c++

Sandcastle Help File Builder

Prolog Learning in Persian.Chapter4

捕获局域网内的数据包，并从中的到数据，和相关信息，没开线程，我vc初学，欢迎朋友对它改进，别忘发我一份fecon@tom.com，用winpcap捕获.先安装winpcap3.1，注意改一下opnion里的lib路径-capture the data packets to and from the data, and related information, not open threads, I vc beginners welcome friends to improve it, do not forget that I made a fecon@tom.com with winpcap capture. Install winpcap3.1, to change it"s lib opnion Path

ISIGHT初级、中级和高级培训教程及例子代码(ISIGHT beginner, intermediate and advanced training tutorials and example code)

XP系统清理源码，例程程序调用API函数实现XP系统临时文件的清理。(XP system clean source , routine program calls API functions to clean XP system temporary files.)