医生开方统计,该功能主要是对医生所开的处方进行统计

该文件是基于labview开发的一个虚拟示波器，有需要的可以来-The document is based on the LabVIEW development of a virtual oscilloscope, are in need can come

WIN32汇编大全，您可以通过此文档很好的学习汇编-WIN32 compilation Daquan, you can pass files compiled a good learning

这是自己做的一个FLASH文件，主要显示的是AA大学的图片及其历史-This is their own to do a FLASH file, mainly shown in the picture is AA University and its history

一个很好的Java批量反编译工具，非常好用-A good batch decompile Java tools, very easy to use

这是我同学在IBM面试的一点资料，这里面包括笔试题目，面试题目，以及面试技巧。。 希望对想加入IBM蓝色之路的同仁有所帮助-This is my classmate in an interview that the information on IBM, which included a written examination subject, the interview subject, as well as interviewing techniques. . Want to want to join IBM Blue Tongren road help

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

效果类]神秘探照灯-effects category] mysterious searchlight

对数据的处理，和对具体项目的研发，基于C语言的策划和程序设计-Treatment of data, and research and development for specific projects, based on the C language, planning and program design

网上AVI转YUV还真不少,就是不简单,我的这个算是很简单的了-AVI to YUV online a lot really is not simple, my this is a very simple

程序运行时间的类(c++),经过编译了，可以直接使用-the category (c), after the compiler can be used directly!