1_YuleWalker

说明：  实现遗传算法,选用python3作为平台开发，直接导入即可运行(Implementation of genetic algorithm, using Python 3 as a platform for development, direct import can run)

启发式算法、优化算法和随机三种情况下的仿真对比。(Heuristic algorithm, optimization algorithm and simulation comparison in random three cases.)

实现对点目标的ISAR成像，代码简单易操作，采用距离多普勒成像方式(Achieve ISAR imaging of point targets)

PSCAD，IEEE14节点系统模型，可供参考(PSCAD IEEE 14-bus system model)

神泣4.0客户端登录器，爱仕达回家的时候是的发顺丰到付对方水电费(shaiya is a very good game I LIKE it very much)

java统计当前在线数-few online

本实例采用面向对象的程序设计方法实现了一个简单的时钟控件。从CStatic类（静态控件类）派生出类CClockEx来实现时钟控件类，这样，就可以继承MFC静态控件的很多已经具备的功能和特点。

能够卸载 windows 系统的 directX 的好工具 然后装上低版本的directx-to uninstall windows system directX good tool then loaded version of the low- dir ectx

1 创建给定图的存储结构，从邻接表和邻接矩阵两种存储方式中选择一种。 2 对所创建的图进行深度和广度优先搜索遍历，给出遍历过程中的顶点序列。 3 求图的最小生成树，按构造顺序输出边的序列。（两种方法都要求！） 3 编写一个主函数，将上面函数连在一起，构成一个完整程序。 4 将实验源程序调试并运行。 -Create a storage structure of a given graph from the adjacency list and adjacency matrix are two ways to choose a store. Two pairs of maps created by the depth and breadth-first search traversal, given the culmination of the process of traversal sequence. 3 order to map the minimum spanning tree, according to the order of the output side of the sequence structure. (Both methods require!) 3 to prepare a main function, the above function together to form a complete program. 4 source debugging and running the experiment.

对中海庭给的高精地图数据进行清洗，简易代码(data processing of HD map data)