在工程中引用 Microsoft Scripting Runtime 就可以了!具体看代码! 可以使用任何vbs脚本的功能!注意是使用vbs脚本的语法，和v...

1个高级的剪贴板程序VC-a senior clipboard procedures VC

MicoChip 公司的 PIC单片机的ICD2下载器，里面有原理图及PCB图，可直接制版使用，USB接口的。-MicoChip the company

很经典的游戏，完全重新开发，很适合工作很忙的人来玩，老少皆移，而且游戏有很强的逻辑性！-classic games, the complete re-development, the work is very suitable for busy people to play, young and old were moved, but the game has a strong logic!

电力系统连续潮流程序，可以计算电力系统最大输电能力-Continuous trend of power system procedures, can calculate the maximum transmission capacity of power system

boxman.exe辅助程序,自由布图,保存文件为map.dat -boxman.exe auxiliary procedures, freedom of layout, save the file to map.dat

一个功能很全面占用空间的小商城程序,适合个人网上开店使用-a very comprehensive functional space occupied a small place procedures for the use of personal Internet lines!

s32410 Nor boot 启动代码-s32410 Nor boot bootcode

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

Bivariate Kamma Kernel Density Estimate for large data set-optimize method

asp 和 flash 的完美结合，含7种计数器样式-asp flash and the perfect combination, with seven species of counter styles