PlateVib

Browser modularization processing, browser modularization combing, browser modularization expansion

神话2完整数据库~有个很受欢迎的游戏 希望大家喜欢-complete database-a very popular game hope you like

用于计算偶极子天线的三维fdtd程序，用PML吸收边界条件(used to calculate the dipole antenna 3D fdtd procedures, with PML absorbing boundary conditions)

说明：  分割识别的代码，适合图像处理的分割和识别，与测试，已检验，可以运行(Segmentation recognition code, suitable for image processing segmentation and recognition, and testing, has been tested, can run)

renesas electronics. digital circuit design syokai

针对单一的一个酶促反应，可以得到不同的反应物质在盒子空间中的粒子分布状态，对其他化学反应的研究同样适用。(For a single enzymatic reaction, the particle distribution state of different reaction substances in the box space can be obtained, and the study on other chemical reactions is also applicable.)

二重积分 Guass―L高精度求积计算，精度高，速度快-double integral Guass-L for the calculation of high-precision, high accuracy and speed

说明：  图着色局部搜索,图着色问题（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.)

this a raccolta that contains a launcher for some games. YO-this is a raccolta that contains a launcher for some games. YO

这是关于影片管理的，有图形界面。-This is the management of film, graphics interface.