closest_pair

说明：  这个小工具可以实现浮点数（4个字节）和实数之间的转换。(This gadget can achieve floating-point numbers (4 bytes) and the conversion between real numbers.)

输入年月日得出星期，按照代码里面的提示输入就可以得到星期几，输入的年份是有一个范围的，输入没有检错处理的！！！(Enter the date come weeks)

说明：  Description Michael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道载一个区域中最长底滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。elements in that rectangle. In this problem the sub-rectangle with the largest sum is referred to as the maximal sub-rectangle. ()

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

matlab做的模拟ADS-B数据的解码和信号处理整体流程(Matlab to do the simulation of ADS-B data decoding and signal processing the overall process)

lr(0)文法及其预测分析表 lr(0)文法及其预测分析表 lr(0)文法及其预测分析表(lr (0) Analysis and prediction of grammar lr (0) Analysis and prediction of grammar lr (0) grammar analysis and forecast table)

VB简单的影音采集程序,有需要的就下载吧。(VB simple video capture program, there is a need to download it.)

一个复杂的工程通常可以分解成一组小任务的集合,不错(A complex project can usually be broken down into a collection of small tasks.)

抑制载波型差分相位调制，借鉴了主成分分析算法（PCA），有CDF三角函数曲线/三维曲线图。( Suppressed carrier type differential phase modulation, It draws on principal component analysis algorithm (PCA), There CDF trigonometric curve/3D graphs.)

说明：  构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。(Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.)