个人介绍网页源代码（4套）

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

C#窗体上的折叠菜单效果，点击展开二级项，这种菜单 觉得实用性很强，在许多的程序中几乎都可以见到类似的菜单功能，可一级一级显示子菜单，当然，本例中的菜单只是支持二级，若包括更多的子菜单项，则需要改进代码了。

工作计划管理-work plan management

说明：  空气耦合超声传感器的接收信号掺杂有大量噪声信号，根据传感器的参数设计匹配带通滤波器，提高接收信号的质量。(The received signal of air coupled ultrasonic sensor is adulterated with a large number of noise signals. According to the parameters of the sensor, a matched band-pass filter is designed to improve the quality of the received signal.)

通过较多的数据，求出路段最短路径,并进行分区，画出图(Through more data, find the shortest path of the exit section, and partition, draw a map.)

说明：  EA MT4 Ai Genetic Grid Martingale V2.1 Boost Profit

HSS算法程序，matlab编写，方法很好很有用，程序很简单(The HSS algorithm program, written by Matlab, is very good and useful. The program is very simple.)

对zigbee的开发平台cc2430的一些基本操作，是学习cc2430的基本程序(Zigbee cc2430 development platform for some of the basic operations, is to learn the basic procedures cc2430)

说明：  通过51单片机及语音模块实现了简单的小车运动。(Simple car movement is realized by 51 single chip computer and voice module.)

大家如果用的着的话，可以下下来看一看啊，-If used in the U.S., you can take a look at the next down, ah,