两种 不同 方式 实现 文件的 拖放

2005首届大学生程序设计大赛试题....哈,可以练练手-2005 First Collegiate Programming Contest questions .... Ha, you can hand练练

此程序是无刷电机控制程序，在实物中以经调试通过．各项性能指标均合格．-This procedure is brushless motor control procedures, in-kind in the adoption by the debugger. The performance indicators were qualified.

Machine Learning with WEKA: An Introduction （讲义） 关于数据挖掘和机器学习的.-Machine Learning with WEKA : An Introduction (s) on the Data Mining and Machine Learning.

应用背景交通信号是一个常见的事情，我们看到在我们的日常生活但实现它是某种有点困难。此代码是正确的工作关键技术AVR Studio是用于开发代码。希望你会喜欢我的工作。

用csharp解决arcgis中的问题，请认真阅读-with csharp arcgis solve the problem, please read carefully

DSP算法标准1。可方便自己快速找到所需要的TI算法文档-a DSP algorithm standard. Facilitate their rapid find the necessary documentation TI algorithm

使用EJB实现的网上商城- Uses on-line commercial city which EJB realizes

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

AT2402测试程序,该程序使用模拟2IC读写AT2402串行存储器数据 -AT2402 test program using simulated 2IC to read and write data on serial memory AT2402