wmi test

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

Allen braley两种通信通过以太网MICROLOGIX1100有两个CPU传递信息来源，通过以太网

通过栈的应用，实现任意数制之间的转换。第1行输入两个数，即转换前的数制 转换后的数制，以空格分割第2行输入待转换的数 假定全部数值

PHP-Fusion v6.00.109 SQL Injection

用此程序可得到三角函数的曲线，共有两种方法-This procedure can be used trigonometric functions of the curve, a total of two methods

冒泡排序（有时称为下沉排序）是一种简单的排序算法，通过repeate进行排序

rs485串口通信源码-RS485 serial communication FOSS

用java的图形设计，很用的.充分体验到java的图形界面设计-Java with the graphic design, it is used. To fully experience the design of java GUI

利用各种koch曲线生成一个完整的雪花算法-use koch curve generated an algorithm integrity snowflakes

这是五子棋的C++源代码，大家可以下载下来学习一下-This is five chess source code