exchange circuit formula, hardware design good helper, a light

用于大型电源厂的电源老化监控和数据采集程序-For large power plant" s power monitoring and data collection procedures for the aging

Delphi编写的一个支持语法高亮显示和很多语言的文本编辑器-Delphi support of a syntax highlighter and many language text editor

多功能计算器能够实现基本计算器的功能，此文件为参考代码，详情请下载之后再查看。-caculater

一个COMBOBOX的扩展类-a COMBOBOX the extension of the class

介绍WCF的基础知识，非常适合初学者学习的源代码。-Introduce the basics of WCF is very suitable for beginners to learn the source code.

明华智能卡的上位机程序，可以给研发智能卡的用户带来方便-Minghua smart card PC procedures to be developed smart card is convenient for users

给四个玩家分发桥牌,每人13张牌，使用Random实现，不会出现重复-deal pokes to four player

Multisim9shuzidianlu.rar, 压缩包解压时不能有密码。-Multisim9shuzidianlu.rar, compressed packets can not extract the password.

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

TS35ND5B-01_TFT_touch_panel.pdf TS35ND5B-01_TFT_touch_panel.pdf-TS35ND5B-01_TFT_touch_panel.pdf