vc

灰色模型GM(1,1)的matlab代码(Gray model)

这是一个非常好的关于OFDM的英文文章，它是国外的博士论文，对于想了解整个OFDM的朋友来说，可以了解到许多中文文章所没有的知识。(This is a very good article in English on OFDM, which is the doctoral thesis abroad, who want to understand the overall OFDM' s friends, you can understand that many Chinese do not have knowledge of the article.)

c#调用matlab函数进行动态画图的简单示例，只是进行了功能演示，界面很粗糙(c# call the matlab function dynamically drawing a simple example, just conducted a functional demonstration of the interface is very rough)

programer test is peogramming

粒子群优化算法计算出的PSS优化模型，为四机两区模型(PSS optimization model calculated by particle swarm optimization algorithm)

使用push-relabel方法求解最大流问题，是国外的一个研究机构编写的，速度很快。(This is an efficient implementation of the push-relabel method. See Goldberg and Tarjan, "A New Approach to the Maximum Flow Problem," J. ACM Vol. 35, 921--940, 1988 and Cherkassky and Goldberg, "On Implementing Push-Relabel Method for the Maximum Flow Problem," Proc. IPCO-4, 157--171, 1995.)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

说明：  用vb写的遗传算法程序。是一些通用代码，与具体问题对应的代码空出来，用的时候填进去。(used to write the genetic algorithm. Some common code, with the specific issues the corresponding code space, and the time spent filling into account.)

Sistema de Kardex & Inventario - VF

基于直角坐标的牛顿拉弗逊法潮流计算程序，经过IEEE14模型测试。(the newton_lafason power flow )