wind_rose

该算法设计短小精悍，很有参考价值，这是用VC++6.0编写的算法，希望大家可以参考-the algorithm design small and great reference value, which is used to prepare the VC 6.0 algorithm, we can hope that the reference

用友U8V13.0产品手册.zip

一个处理文本文件的程序，演示了如何用vb高效的处理操大文件的方法。-a text document handling procedures, demonstrating how to use vb efficient handling gymnastic documents.

利用粒子群优化算法进行大地电磁视电阻率反演(Inversion of magnetotelluric apparent resistivity using particle swarm optimization algorithm)

下垂控制就是选择与传统发电机相似的频率一次下垂特性曲线（Droop Character）作为微源的控制方式，即分别通过P/f下垂控制和Q/V下垂控制来获取稳定的频率和电压，这种控制方法对微网中的微源输出的有功功率和无功功率分别进行控制，无需机组间的通信协调，实现了微源即插即用和对等控制的目标，保证了孤岛下微电网内电力平衡和频率的统一，具有简单可靠的特点(Droop control is to choose Droop Character, which is similar to the traditional generator, as the control mode of micro-source, that is, to obtain stable frequency and voltage through P/f droop control and Q/V droop control respectively. This control method controls active power and reactive power of micro-source output in micro-grid separately, without communication coordination between units. The goal of micro-source plug-and-play and peer-to-peer control is realized, which ensures the unification of power balance and frequency in the micro-grid under isolated islands, and has the characteristics of simplicity and reliability.)

LABVIEW编写的一款小游戏，缘分计算器。绝对原创，输入自己的和想要配对的人的字，点击运行即可显示分数和对你们缘分的评价。(LABVIEW written a small game, fate calculator. Absolutely original, and you want to enter your own pair of person s name, click Run to display the score and the evaluation of your fate.)

说明：  springBoot hellow word base the version 2.1.3

VB6.0开机启动管理程序，Windows随系统一起运行的启动项管理程序，初次运行本程序，为做首次运行准备，比如备份Windows注册表，在操作失误时可恢复。本程序对加入到开机启动项中的项目进行管理和查看，可删除这些启动项，并显示启动项所属的程序名称。

说明：  为了更好地改善多目标粒子群优化算法的收敛性和多样性的pso 算法(In order to improve the convergence and diversity of multi-objective particle swarm optimization algorithm, PSO algorithm is proposed)

1 编写采用二叉链表形式存储的二叉树的创建、先序、中序、后序和按层遍历的算法。 2 编写将一棵二叉树的所有左右子树进行交换的算法。 提示：验证是否交换可以调用二叉树的遍历算法，比较输出结点序列。 3 编写一个主函数，将上面函数连在一起，构成一个完整的程序。 4 调试并运行实验源程序。 -Prepared using a binary list stored in binary form of the creation, the first sequence, the sequence, after the order and by level traversal algorithms. 2 the preparation of a binary tree will be all about the exchange of sub-tree algorithms. Tip: Verify that the exchange can be called binary tree traversal algorithm to compare the output node sequence. 3 write a main function, the above functions together to form a complete program. 4 debug and run experiments source.