用友U8v12.5 13.0写狗工具

用于电力系统潮流计算，潮流方程的求解基本方法是迭代，包括牛顿-拉夫逊法，以及P-Q分解法(Power Flow Calculation for Power System)

visualc++6.0开发，基于MFC的单机版俄罗斯方块游戏-visualc++6.0 development, MFC-based stand-alone version of Tetris game

c语言之存储篇，从基础学起，让你彻底精通c语言的应用。-memory of c language,learn form base,lead you to be well up to application of c language

说明：  蝗虫算法：蝗虫优化算法是模拟自然界蝗虫种群捕食行为而提出的一种群智能优化算法,主要利用了蝗虫间的社会作用力把空间分为吸引空间、舒适空间和排斥空间,根据不同蝗虫间距离大小的变化来改变空间范围从而找到最优位置。该算法具有结构简单、稳定性强、参数较少、收敛较快等特点。(The locust optimization algorithm is a swarm intelligence optimization algorithm proposed by simulating the predation behavior of locust populations in nature. It mainly uses the social force between locusts to divide the space into attractive space, comfortable space and repulsive space, according to the changes in the distance between different locusts. Change the spatial range to find the optimal position. The algorithm has the characteristics of simple structure, strong stability, fewer parameters and faster convergence.)

这个程序是利用时域有限差分方法求多层介质中的电场分布的(this procedure is to use the finite difference time domain method for multi-media distribution of the electric field)

三相的光伏发电模块，是传统的PI环控制。控制效果比较稳定，电压外环和电流内环(Three-phase photovoltaic module, PI loop control.)

求解模态叠加法的轴向运动悬臂梁。并画出图像(Solving the axially moving cantilever beam by modal superposition method. And draw the image.)

说明：  我提供了一个基于FXLMS的单通道前馈有源噪声控制系统的一个小例子. 为了减少噪声，我们使用控制器C（z）产生另一个“噪声”yw（k）。我们希望它破坏性地干扰X（k）。这意味着控制器必须是传播介质P（z）的模型。采用最小均方算法对控制器系数/权重进行调整。 然而，还有流体介质S（Z）留在致动器和传感器之间。我们称之为二次传播路径。所以，为了使解正确，我们需要用SH（z）来补偿调整过程，这是S（z）的估计(I provided him a little example of a single channel feed-forward active noise control system based on the FxLMS. To reduce noise, we generate another 'noise' yw(k) using the controller C(z). We hope that it destructively interferes x(k). It means that the controller has to be a model of the propagation medium P(z). Least mean square algorithm is applied to adjust the controller coefficient/weight. However, there is also fluid medium S(z) that stay between the actuator and sensor. We called it the secondary propagation path. So, to make the solusion right, we need to compensate the adjustment process using Sh(z), which is an estimate of S(z).)

读取一个文本文件（英文，ASCII编码），对出现的单词次数进行统计，并按照出现次数从低到高排序，输出到一个文本文件中（每行一个单词信息，格式：单词 出现次数）。采用二叉树结构存储，中序遍历，快速排序。(Reads a text file (English, ASCII encoding), the number of occurrences of the word statistics, and in accordance with the number of occurrences of the sort low to high, output to a text file (one word per line message format: word occurrences). Binary tree structure stored in preorder, quick sort.)

说明：  J1939 Specification - 1 Document