rangeobject

MPI实现交叉证验的实验代码，附有测试文件，运行在LInux系统，需要配置MPI环境。(MPI implementation of cross-validation of experimental code, accompanied by the test file, run LInux system, you need to configure the MPI environment.)

一段vc++的dll的编程代码，主要通过dll访问并口，通过并口收发数据(section of the dll vc programming code, mainly through dll visit Parallel, through the parallel port data transceiver)

基于vc6.0的点特征提取算法，包括Moravec算子、Forstner算子以及Harris算子。(Vc6.0 point feature extraction based algorithms, including Moravec operator, Forstner operator and Harris operator.)

此资料能够使自己充分的了解VC++,而且还能在其中熟悉语言环境。(This information can make their full understanding VC++, but also the environment in which you are familiar with the language.)

此种模型绘制类似米字形的网格。由于整个过程递归调用绘图函数，所以可以根据误差判断绘制DEM的精细程度，从而绘制出不同精细程度的DEM，为解决漫游中数据量较大而引起的画面不流畅现象提供了模型基础。 本文并没有对LOD作研究，只是给出了四叉树的建立和遍历绘图的方法。 #include "Pt3d.h" //空间点类(主要记录空间点的x,y,z) (Rendering such a model similar to rice-shaped grid. Recursive calls as a result of the whole process of mapping function, so it can be judged according to the error map of the fine DEM, thus rendering a different degree of precision DEM, for the settlement of roaming in the amount of data arising from the larger screen does not provide a model of fluid based on the phenomenon. This article does not LOD for research, but given quadtree traversal of the establishment and mapping method.# Include Pt3d.h // space-point type (mainly recorded space points x, y, z))

说明：  模糊模式识别，包括最小最大贴近度、最小平均贴近度、海明贴近度、欧几里德贴近度等(Fuzzy pattern recognition, including the largest close to the smallest degree, the smallest average close degree, Haiming close degree, close to the degree of Euclidean)

Simple Tetris for my Grand Daughter Try to Hunt more than 3 Same types before they Reached the top or left more than 100 _ Have fun friends.

TableSorter 2.17.8 - Client-side table sorting with ease!(TableSorter 2.17.8- Client-side table sorting with ease!)

说明：  Euler 回路问题 .问题描述： 对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次 的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务： 对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入： 由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个 顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示 图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)

该程序是使用了串口通信的R232协议进行了编程，-the program is its use of serial communications R232 agreement for programming,