verilog fifo

D论坛

本算法使用分治法求解最近点对问题。事先用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.

TCL2543电压表中的应用，能通讯的测量表，内存的分配-TCL2543 voltage meter application that can communicate measurement tables, memory allocation

分治法求大数乘法的问题 等等一些算法分析-datastructure

功能：快进，播放，暂停，后退，调节声音大小，添加播放文件，-Features: fast forward, play, pause, rewind, adjust the size of the sound, add play the file,

对文件进行处理。 包括文件复制、分割、连接、查看等。-of documents processed. Including document reproduction, segmentation, connectivity, View, etc..

这是一个小闹钟程序，可以进行一些简单的时间提醒，很小巧-This is a small alarm clock procedures can be carried out some time to remind the simple, very compact

得到CPU的类型(C++源程序)-be CPU type (C source)

一个数控机床的切割模拟程序。有多种模拟方式。如逐点比较，直线插补等。很好用。内附可执行程序。-a CNC cutting simulation program. A number of simulation. If a case-by-point comparison, such as linear interpolation. Very good use. Enclosing executable.

使用Acrgis Engine 的java api 开发的创建一个shape文件-Acrgis Engine using the java api to create a shape the development of documents