avr_oscilloscope.zip液晶示波器

很普通的一个月历，就早很普通的一个月历， 很普通的一个月历，就早很普通的一个月历-很普通的一个月历，就早很普通的一个月历

the pakage simulate a_law and mu_law compander

窗口置顶功能，防止其他窗口挡住指定窗口，使其能一直显示在最前端-Top features a window to prevent other windows to block the designated window, so that they can always show in the most front-end

迷宫求解 求解迷宫中一条通路的伪码算法等-Solving a maze to solve the maze path of pseudo-code algorithm

Serial Port类串口测试，实现两串口数据打包、拆包收发！-Serial Port type serial port test, to achieve two serial data packing, unpacking send and receive!

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

一个很好用的csocket嘞-a good use of csocket gone!

一个小小的有意思的迷宫程序，采用的VC++6开发 ，十分简单明了-migong

透明窗体,类似OFFICE助手-transparent windows, similar aides OFFICE

本程序是编绎原理实验中一个关于语法树生成过程的程序，采用VC++编写，界面友好，只要输入一个数学表达式，就会生成该表达式的语法树过程-This procedure is a series Sounds of principle experiment in a syntax tree generation process procedures, the use of VC++ Prepared, friendly interface, just enter a mathematical expression, it will generate the expression syntax tree process