Very good website of a government, we can try, really good, let us look at it.

模仿windows计算器 基本上都实现了-imitation windows calculator basically achieved

HFSS仿真的helix结构，以及结果照片-HFSS simulation of the helix structure

记事本 记事本 记事本 记事本 记事本 -notebook notebook notebook notebook notebook notebook notebook notebook notebook notebook Notebook

基于C++的基础地理信息系统的实现，采用MFC

This TC4 Accounting Management System source code-This is TC4 Accounting Management System source code

文件包然后写出其具体功能LCD12864读写程序可C51控制-xdgsgdgfdgd

一个关于数据挖掘和决策树的单一软件，用于数据仓库。这个应用程序运行在PHP语言上。数据库引擎不需要查询ID。

这个游戏很好玩哦，快快好吧，祝你玩的愉快-Oh this game is a lot of fun, as soon as possible Well, I wish you a happy fun

tec条形码打印机控制示例，有一部尚在完美中-Edge bar code printers control sample, which a still perfect

图像压缩问题要求确定象素序列{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.