MULTITASKING ON AN AVR

此为监控系统的协议解释器中的表达式计算程序原型，可用于表达式的计算-There is a expression calculate program about protocol explain utensil of inspect systemic.It may calculate expression.

大家都知道键盘上几个的事件吧。 今天我就作了一个用上下左右键控制图标的小程序，帮助你理解这几个事件。。很好玩的。-we all know several of the keyboard events. Today I made a key up and down around the small icon control procedures to help you understand these events. . Very fun.

软件学院数据结构与算法分析课程设计 一个文本编辑器的课程设计报告-School of Software Data Structures and Algorithm Analysis course design a text editor, curriculum design report

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

检测光驱的程序例子-drive detection procedures example

龙贝格积分法，文本输入输出，实现数值计算的龙贝格积分法-Romberg integration method, text input and output, to achieve Romberg numerical integration method

开源支持多曲线绘制图表的控件源代码，可以纵横坐标刻度。-Open-source rendering support for multi-curve graph control source code, you can scale vertical and horizontal coordinates.

数据结构关于二叉树的课件，有些是书上没有的，自己补充的-On the binary tree data structure of the courseware, books and some are not, add their own

该程序是采用贪婪法编制的一个小程序，解决问题是：有编号为1到n的物品，各物品的体积已知。将其装入体积均为V的箱子里，所用箱子要少-that the procedure was used in the preparation of greedy law a small program to solve the problem is : No. 1 to n items, the volume of goods known. Its size will load all the boxes V, using fewer boxes

213546 5