资源列表
MPC860_SCC1_ENET
- MPC860开发板的简单的网卡驱动程序，供大家学习研究-MPC860 development board the simple card driver, for your study
udpsocket
- 用C语言实现的UDP协议的socket编程，请大家研究研究-C language of the UDP socket programming, please studies
internet
- 1从ie向列表控件中拖曳连接地址 2建立internet快捷 3创建拨号连接对象 4邮件客户端程序 5简单聊天程序 6ftp下载 7 socket传输 8 http服务监视器-ie from a list of controls to drag link which addresses the establishment of two fast internet dial-up connections create 3 Object four-mail client
simFTP
- 一个简单的ftp实现，用c语言实现的，供大家研究-a simple ftp realize that the C Language for everyone to consider
avisound
- 程序１实现了avi图像捕获包，2是录制播放，存储声音的多线程，程序3简单的混音控制器，程序4 透明的动画控件-procedures for the realization of an avi image capture packets, two players is recorded, stored voice of the multi-thread, 3 simple procedures mixing controller, 4 transparent procedures Animatio
adalin
- 用Ｃ语言实现的神经网络，采用遗传算法对网络进行训练，有很快的收敛速度！-C language of neural networks, genetic algorithm was used to train the network, the speed of convergence very soon!
bp
- 用C语言实现的BP网络的程序,严格按照BP的算法流程,开发环境为WIN-TC-C language of BP procedures in strict accordance with the BP algorithm. Development Environment for the WIN-TC
String
- 程序1处理unicode字符串，程序2 进行资源读取和字符串类的CString 扩展类 程序3 不依赖系统的CString类，程序4CUnicodeString类，程序５实现基本功能的 字符串类-procedures for handling a unicode string, two procedures resources, and the string read like CString extension of the class three procedures do not re
ga
- 用C语言实现的遗传算法的程序,实现的是y=x+10*sin(5*x)+5*cos(10*x)求最大值.实现环境为win-tc.-C language GA procedures, achieving is y = x 10 * sin (x 5 *) 5 * cos (10 * x) for the maximum. To achieve environmental w in-tc.
vc
- 几个常用的算法，包括消元，迭代，三角分解等-several commonly used algorithms, including the elimination, iterative, triangular decomposition, etc.
database
- 程序1，2，3分别实现了vc++对access,BDE,DSN的访问；程序4串行化对象到数据字段，程序5从ODBC 动态读取数据，程序6 DAO组合框，程序7 ODBC的日期和时间 程序8 9，交互式的SQL工具；程序10在DLL中使用DAO-procedures were achieved vc right access, BDE, DSN visits; 4 Serial procedures objects to the data fields, procedures five dynam
zxjd
- 求图中的祖先节点(不含父亲节点) 内含说明，学图论或人工智能的朋友会用到的。希望有利于理解书上的论述。-plans for their ancestral nodes (excluding the father nodes) intron show that studying graph theory in artificial intelligence or a friend will use the. Hope to understand book expositions.