一个含光伏风电的小系统的pscad模型

加载在fluent中，求解水的相变，可以得到水蒸发或冷凝的情况。(The evaporation or condensation of water can be obtained by calculating the phase transition of water loaded in fluent.)

AD538的相关资料，对于实现线性化电路十分有帮助-AD538 relevant information, for the achievement of linear circuits very helpful

安捷伦频谱分析仪编程指南，有完整的例子，对GPIB编程有帮助(ESA Spectrum Analyzers Programmer s Guide)

纯内存操作解压JPGE 很早之前收录的 并非原创 共享给大家(Pure memory operation decompression JPGE. Long ago included, not original. Here to share with you.)

说明：  lammps小分子案例in文件，建立水分子可用(Lammps small molecule case in file to establish water molecule availability)

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

说明：  计算李雅普诺夫指数，仿真模拟实验计算李亚普诺夫指数程序(Calculate Lee Yap Andrianof index and simulate Lyapunov's exponential procedure.)

通信系统仿真原理与无线应用，matlab仿真参考书(Communication System Simulation Theory and wireless applications, matlab simulation of reference books)

sqlnc for pb 11 or 12

说明：  IAPWS-IF97 c语言实现 计算水或水蒸汽各性质(IAPWS-IF97 c for water /stream P/T)