这个是一个完整的3Ddemo，通过mascot v3引擎实现。

第六章实验二（1）本程序为魔方阵.C 可用来求出所指定大小的魔方-sixth chapter two experiments (1) the procedure for the Demon phalanx. C can be used to specified sizes calculated by the Cube

vc的一些原码,对于帮助学习和提高很有帮助-vc some of the original code, for help to learn and improve very helpful

VB税控的源代码 主要用于地方税务局的税控引用 有完整的控件和代码-Tax VB source code mainly for the local Inland Revenue Department

等离子技术WKB方法的文章。等离子体隐身技术的WKB方法-Plasma technology WKB method article. Plasma stealth technology WKB method

管理学经典案例分析与解析-classic case of management analysis and analytic

采用Java开发的Bubble Breaker游戏。-Developed using Java Games Bubble Breaker.

一个自己开发的学生成绩管理系统，希望大家喜欢！-A self-developed student achievement management system, I hope everyone likes!

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

线程的封装源代码，以及线程组的封装。并采用消息控制线程的方法。-Thread package, source code, as well as the thread group of packages. And using the message thread of control methods.

该压缩包收集了美信MAXIM的2千3百多个器件的封装，采用protel99SE格式制作。-The compressed packets collected Maxim MAXIM 2 1000 3 packages more than 100 devices, using Protel99SE format.