worst-case RBF

说明：  用有限元分析软件ansys来仿真模拟火车过桥的过程中桥的受力分析(The deformation of high-speed railway track was simulated by ansys)

测井曲线数据处理源代码-log data processing source code

G2EX PHP微社区系统源码是仿照V2EX修改的衍生版本，一个轻型论坛程序，目前此类程序有很多了，每个都有自己的特色，G2EX来源于StartBBS，有兴趣的也可比较一下有什么不同。

中国省市县geojson数据，可用于可视化工具绘制地图使用(Geo JSON data of provinces, cities and counties in China can be used for mapping with visualization tools.)

采用非接触式红外线测量人体体温，用液晶1602做输出显示。-The use of non-contact infrared temperature measurement of the human body, and so the output of liquid crystal display 1602.

台球管理系统（台球管理系统）台球管理系统-Billiards management system (billiards Management System) Billiard Management System

Computes a matrix-vector product with a repeated Kronecker product matrix.

说明：  Sends input to serial COM port

YALE人脸检测数据集，能够应用在人脸检测上(YALE Face Detection Data Set, which can be applied to face detection)

说明：  图着色局部搜索,图着色问题（Graph Coloring Problem, GCP） 又称着色问题，是最著名的NP-完全问题之一。道路着色问题（Road Coloring Problem）是图论中最著名的猜想之一。 数学定义：给定一个无向图G=（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory. Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)