1

说明：  利用Python面向对象知识实现飞机大战游戏(Application of Aircraft Battle Game with Python)

说明：  PFLD的python实现，用于人脸的关键点检测(Python implementation of PFLD for key point detection of human face)

说明：  CC2531 zigbee2mqtt 固件(Cc2531 ZigBee 2mqtt firmware)

基于压缩感知的图像处理，应用了OMP cosamp romp SAMP 几种压缩感知算法并对其进行了对比分析(Based on compressed sensing image processing, we applied OMP CoSaMP romp SAMP several compressed sensing algorithms and compared them.)

利用三角面片逼近法生成圆柱体 利用opengl中的画图函数直接生成圆柱体(The cylinder is generated by triangle surface approximation)

说明：  KRAKEN声传播模式的使用手册，里面有详细公式推导以及模式的使用方法(KRAKEN's Manual of sound propagation mode,with detailed formula deduction and mode usage.)

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

说明：  旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)

大斜视角的SAR成像 RD快速算法，解决了斜视角比较大的情况(SAR imaging with RD algorithm)

MATLAB写二维FDTD算法，模拟点光源在自由空间传播(MATLAB writes two-dimensional FDTD algorithm to simulate point light propagation in free space.)