PENTAX-MV-SELCT20110506

说明：  用c++写的一个程序，可以用来设置2组ip，并且迅速的在两个ip之间切换，以实现不同ip的转化。(With c++ Write a procedure that can be used to set up 2 ip, and quickly switch between the two ip in order to achieve the transformation of a different ip.)

这是用VB写的数控G代码读取，编译，并显示。给做数控系统的朋友做参考。(It is written in VB CNC G-code read, compile, and displayed. CNC system to make a friend for reference.)

网页版小闹钟，可以定时提醒，重复提醒，提醒多个时间段(Web version of a small alarm clock, can be regularly reminded repeatedly reminded, reminded more than one time period)

c8051f320之W25X80读写测试实验（keil-c）,使用keil-c编写，具有较好的工程移植性(the c8051f320 W25X80 reading and writing test experiment (keil-c), written in keil-c, and with good engineering portability)

是一种双隐层反向传播神经网络，LZ复杂度反映的是一个时间序列中，用MATLAB实现的压缩传感。( Is a two hidden layer back propagation neural network, LZ complexity is reflected in a time sequence, Using MATLAB compressed sensing.)

编写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.)

说明：  实现汽车销售人员的销售，购买人员资料的统计，销售统计，出入库管理以及系统管理(Car sales staff to achieve the sale, purchase statistics personnel information, sales statistics, out of storage management and system management)

A simple vector operation class and header

Colormatrix for the chemalux coating AR.

VC调用java的简单例子。需要注意jvm.dll路径，路径不对就不能成功！(VC called a simple example. Attention jvm.dll path, the road would not be wrong!)