自己编的赛马程序

CMemBlockArray模板类：按指定的块大小从系统中申请内存，然后以C语言数组的方式使用。VirtualQue模板类：对循环队列的索引操作进行封装，可以将轻易地将一个数组当作循环队列进行管理。

[FIF]ASP互动视频VIP教程下载4.1.3程序流程图-[FIF] ASP interactive video tutorials download VIP program flowchart .1.3

运用asp知识设计在线投票系统-use asp design knowledge online voting system

利用产生式推理识别若干动物，动物种类有：虎，豹，长颈鹿等-use production identification number reasoning animal, a species : the tiger, leopard, giraffe, etc.

三层架构的内容・・可以参考一下-The three-tier content can reference

极力给推荐大家--“用感光板制作电路板全程图解” 。包你在3分钟内学会用感光板制作电路板。-Strongly recommend you to- " with the production of circuit board plate illustrations throughout." Package within three minutes you learn how to use the production of circuit board plate.

应用背景用于大学51单片机课程设计，数码管显示时间，设置闹铃，电子钟，显示时间、日期，秒表用于计时，用于51单片机关键技术AT89S52单片机电子钟（含万年历、闹铃、秒表）有注释，可以删除部分功能，所有功能都采用子函数，采用8位数码管显示，采用8位IO口独立式按键输入。涵盖电子钟所有内容。

this program performs the functonality of 4 bit alu

ns2 zigbee implementation tcl code.

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.