我做的一个基于JAVA APPLET的语音聊天程序(73KB).zip

显示开机时间的总和，还可以把任何东西拖到里面-show the total uptime, but also anything dragged inside

应用程序容易看懂并为我们所用-applications easily accessible and has been used

这是一个很好的unicode编码的源代码，值得一看。-This is a good coding unicode source overseas.

Hanoi Algorithm I tried to drow the animated Hannoi algorithm. I hope that it can help your study.. If you need more comment, please send me e-mail

判定一个图是否是双连通图,没有实现图形界面，是DOS程序-To determine whether a graph is a two-connected graph, there is no realization of a graphical interface is DOS program

log4j 日志 输出-log4j log and output.

这是MSDN里面带的程序例子，用来检查某一个进程GDI的使用情况。对于在95、98下面进行调试和测试很有帮助。适用于测试人员。-inside with the procedures example, used to check a process of the use of GDI. In the following 95, 98, debug and test helpful. To test.

用来监控系统进程，如出现预定义拦截进程，则终止进程。通过ini文件载入拦截进程名，压缩文件中已带有一个事例ini文件-Used to monitor system processes, where there is a predefined block the process, then terminate the process. Ini file loading process by blocking the name of the file has been compressed with an example ini file

此源代码是在明华读写器基础上对M1卡的读写数据操作-This source code is at Ming Wah reader on basic reading and writing on the M1 card data manipulation

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