BeSplitv0.82 is a GUI

天线阵列为均匀圆阵时，采用MUSIC算法进行DOA估计的源程序。-Antenna array for uniform circular array, the MUSIC algorithm using the estimated DOA of the source.

因为速度比较慢，适合练习，免得我是唯一能过关的人。

the document is so good thatyou can ues it anywhere

字符串的强悍操作，值得学习-string of tough operation, it is worth learning

使用java编写的足球游戏,非常有意思,适合学习!-prepared by the use of football games, very interesting, suitable for learning!

关于c++中继承和多态非常好的讲解实例.能够非常快速地学习理解继承。-a program of c++.the best instance of study c++.

电子制版中常用的封装，包括了平时经常用的大部分元件，省去了很多做封装的时间，可以下来用-Commonly used in e-plate package, including the most frequently used in peacetime components, eliminating the need for a lot of time to do packages can be used down

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

西门子授权，没这东西西门子的软件用不了的。-Siemens authorization, the software did not take these things for Siemens.

飞思卡尔电磁试跑程序，六个传感器，很牛的底文件库，让电磁车飞起来，不一样的感觉，不一样的代码