这是一个自己写的完整的ADO类 包含了MSADOX 和 MSADO两部分

国外有限元分析源程序2，用FORTRAN编写，用于结构的有限元分析。-abroad Finite Element Analysis source 2, FORTRAN prepared for the structure of the finite element analysis.

计费采集程序,实现对各种交换机文件格式的分检,同时入库-program of charging collection,decompose many switcher s file ,input in the same time.

用Visual C++实现注册表简单操作。学会编程中使用注册表会使你的程序更专业。本例包含基本的编程方法。-achieve registry simple operation. Programming Institute will use the registry your program more professional. The cases include basic programming method.

AVICapture

C#编写的winform程序。功能目标是，类似于腾讯文档，完成对文件的管理。是本人的课程作业，不完善的地方较多，请大家包涵！

很漂亮也很实用的弹出框代码。 在弹出框中加入tree效果最佳 -Very beautiful and very useful code for a pop-up box

压缩包里有5个c程序,分别实现5个不同的算法:1个迷宫算法,-个货郎担算法-Compression bag 5 c procedures, respectively, to achieve five different algorithms: a maze algorithm,- a traveling salesman algorithm ..

料的功能、包含内容为煤矿用的程序开发，用使用文件说明-Material features, including the content for the coal used in program development, with the use of documented

图像压缩问题要求确定象素序列{p1,p2,…,pn}的最优分段，使得依此分段所需的存储空间最少。每个分段的长度不超过256位。数字化图像是m×m的像素阵列。假定每个像素有一个0 ~ 2 5 5的灰度值。因此存储一个像素至多需8位。若每个像素存储都用最大位8位，则总的存储空间为8m^2 位。为了减少存储空间，我们将采用变长模式（ variable bit scheme），即不同像素用不同位数来存储。像素值为0和1时只需1位存储空间； 值2、3各需2位；值4，5，6和7各需3位；以此类推。-image compression defined pixel sequence (p1, p2, ..., pn) sub-optimal, sub accordingly makes the storage space required at least. The length of each section is not more than 256. The digital image is m m pixel arrays. Assume that each pixel is a 0-2 5 5 of the gray values. Therefore storage of up to a pixel 8. If each pixel with the largest storage capacity of 8-bit, the total storage space for 8m ^ 2. In order to reduce storage space, and we will use variable-length model (variable bit scheme), that is different with different pixel median storage. Pixel values of 0 and 1 and only a storage space; The value of 2,3 required two; Value 4,5,6 and 7 of the required three; Analogy.

域名网址搜索器(含源码) 下载下，分享下，呵呵～～ ～～ ～～・-Domain name search engine web site (including source) to download the next, sharing the next,呵呵~ ~ ~ ~ ~ ~