求凸多边形最优三角剖分。用动态规划问题有效解决该问题。多边形是平面上一条分段线形封闭曲线。-Optimal convex polygon triangulation. Dynamic programming problem with an effective solution to the problem. Sub-polygon is a plane closed curve linear.

采用动态规划算法，实现发动机燃油消耗的最优化。-Dynamic programming algorithm to achieve optimal engine fuel consumption.

自动生成G代码的CAM软件完整程序，软件由用户自己规划加工路径后，生成加工G代码。同时，能够动态仿真加工过程。-G code is generated automatically complete CAM software programs, software the user s own plan after machining path generating process G code. At the same time, the process can be dynamic simul