▍1. ChatDemo
一个简单的点对点聊天程序,学习socket通讯编程时的练习程序。编译环境为VS2008(A simple peer-to-peer chat program, learning socket communication programming practice procedures. The compiled environment for VS2008)
一个简单的点对点聊天程序,学习socket通讯编程时的练习程序。编译环境为VS2008(A simple peer-to-peer chat program, learning socket communication programming practice procedures. The compiled environment for VS2008)
本代码是利用socket套接字实现点对点的简单聊天软件程序。语言是C++。内附源码,项目设计报告,和可执行文件。(This code is using socket to realize P2P-based simple chatting software. Program lauguage is C++. Besides source code, also Included program design report and executable files.)
GTA的脚本大全,能让你的服务器变得更加好玩,使你的服务器的玩家数量更多(More GTA script Guinness, make your server more fun to make your server' s number of players)
这个是利用libnids进行HTTP数据包的分析,可以完整的还原HTTP数据包(This is the use of libnids HTTP packet analysis, you can completely restore the HTTP packet)
我这段代码是一个名为Youtoo的sipphone工程改编而来。(www.pudn.com 上有) 原工程是在vc 6.0下开发,而我是在vs 2005 把代码重新改写了一边,同时稍微改了一下界面。 我用来测试客户端(ua)的服务器是 Brekeke SIP Server(安装完后可以注册)。 在程序运行前应该在vs2005重新设置lib和头文件的位置。 库放在lib目录下 头文件放在include目录下。(I have this code is a Youtoo adapted from the sipphone works. (Www.pudn.com have) the original project is developed in vc 6.0, while I was in vs 2005 to rewrite the code aside, at the same time slightly changed about the interface. I used to test the client (ua) of the server is Brekeke SIP Server (can be registered after installation). Before the program runs in VS2005 should be re-instated in the lib and header file location. Treasury on the lib directory下头document include directory.)
本程序是基于libnids网络入侵检测开发包开发的基于Windows控制台下的对POP3协议的捕获,并且实现对邮件协议的还原。Base64编码与解码,TCP/IP数据包的重组。(This procedure is based on the libnids network intrusion detection kit developed based on the Windows Control Panel under the POP3 protocol to capture, and to achieve the reduction of mail protocols. Base64 encoding and decoding, TCP/IP packet restructuring.)
Forex Megadroid V1.1 No Dll,这个版本是最好最完善的版本,可以做很多种货币兑,测试效果和挂机效果都很理想,并且出去了DLL限制,我们花了很多时间破解这个DLL,希望喜欢EA的朋友可以认真研究下。(Forex Megadroid V1.1 No Dll, this version is the best and most complete version, you can do a variety of currencies against the US, the test results and the hook effect is very satisfactory, and went out DLL restrictions, we spent a lot of time to break this DLL, hope EA like a friend can seriously lower.)
简单神经网络EA 需要训练EA的神经元,两层神经元,具体可以自己摸索也可以百度训练的方法(Simple Neural Network EA EA neurons need to be trained, two layers of neurons, can find their own way to be specific training methods Baidu)
一个随机森林的实现源码,非常实用,可以下载看看(A the random forest realization source very practical and can be downloaded)
KD 树代码,常见的数据搜索算法,比较实用(KD tree code, common data search algorithms, more practical)
遗传算法进行优化神经网络结构(genetic algorithm optimization neural network architecture! !)
iocomp4.02破解 支持WIN7 8 10 64 32(iocomp4.02 SUPORTWIN7 8 10 64 32)
局部敏感哈希(LSH)算法,vs2008实现。(Similarity Search in High Dimensions via Hashing)
此程序实现了IPX/UDP/TCP三种协议的广播( This procedure has realized the IPX/UDP/TCP three kind of agreements broadcasts )
多线程UDP通讯例子( Multi-thread UDP communication example )
K-均值聚类算法的编程实现。包括逐点聚类和批处理聚类。K-均值聚类的的时间复杂度是n*k*m,其中n为样本数,k为类别数,m为样本维数。这个时间复杂度是相当客观的。因为如果用每秒10亿次的计算机对50个样本采用穷举法分两类,寻找最优,列举一遍约66.7天,分成3类,则要约3500万年。针对算法局部最优的缺点,本人正在编制模拟退火程序进行改进。希望及早奉给大家,倾听高手教诲。(K-means clustering algorithm programming. Point by point, including clustering and clustering batch. K-means clustering of the time complexity of n* k* m, n samples, several types of k, m sample dimension. The time complexity is a very objective. Because if we use one billion times per second the computer using 50 samples of two exhaustive method to find the optimal set out again about 66.7 days, divided into three categories, offering 3,500 years. Local optimal algorithm against the shortcomings, I was prepared simulated annealing process improvements. Early Feng hope for everyone, listen to the master teachings.)