PSOPM

说明：  friction lagrang sabrotin link abaqus

说明：  轴承动力学故障诊断，使用ode45解动力学微分方程(Bearing dynamic fault diagnosis, use ode45 to solve dynamic differential equations)

很有意思的小游戏 ，喜欢的人下下来玩一下吧，对与头脑的休息还是大有好处的^_^-very interesting little game, like the people down play with under the bar, with the heads of the rest is good or the ^ _ ^

NXP RC531 PN512 DS 官方英文版 Directly Matched Antenna Design(RC531 PN512 datasheet Directly Matched Antenna Design)

说明：  4阶龙格-库塔算法，只需要输入微分方程就可以解算出数值解。(Rank4 Runge Kutta algorithm,the numerical solution can be obtained only by inputting the differential equation.)

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

说明：  该程序用于Python读取vision research 公司phantom 高速相机的cine文件(this file is for reading cine files recorded by vision research phantom high speed camera)

学习linux的好文档,挂载U盘，很有用处,对学习linux.-A good document to learn linux, mount U disk, very useful for studying linux.

基于matlab的电力系统电压稳定性分析算法程序代码(Power system voltage stability analysis algorithm code based on MATLAB)

一个简单的LSTM神经网络训练的python代码(A simple LSTM neural network training Python code)