PUSH_PULL_CONVERTER

圆度测量中用fft和ifft滤波,由于传统的rC滤波和2RC滤波.简单使用-Roundness measurement using fft and IFFT filtering, due to traditional rc 2RC filtering and filtering. Simple to use

进行卫星接收机自主完好性监测，利用RAIM算法中的加权最小二乘法(The Technology of Satellite Autonomous Integrity Monitoring)

说明：  其中一项是ESPRIT算法的性能与信噪比的关系,有矩阵运算，出图对比(One of them is the relationship between the performance of ESPRIT algorithm and signal-to-noise ratio, with matrix operation and plot comparison)

15年国赛一等奖，四旋翼CCD循迹完美实现(The first prize in 15 years, the four rotor CCD tracking perfect implementation.)

说明：  s工具安装包！功能强大111111111111111(S tools installation package! powerful)

飞虹2.0源码, DOS下仿WINDOWS界面的程序,含开发类库，有极高参考价值.作者RedSleeves-Feihong 2.0 source code, DOS interface under the imitation WINDOWS procedures, including the development of class libraries, a high reference value. RedSleeves author

说明：  旅行商问题(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.)

miffy image file. do you like this one.

利用非序贯蒙特卡洛法实现含风电的发电系统可靠性评估(Realize the reliability assessment of wind power generation system.)

Bundel model in Photogrammetry