DUO-CHI-DU

Genetic annealing evolutionary algorithm

说明：  模态频率和阻尼比计算可用机械行业，交通行业MODAL FREQUENCY AND DAMPING RATIO ( MODAL FREQUENCY AND DAMPING RATIO)

用saleh模型拟合功率放大器，采用n组功放的输入输出数据标识模型中的参数，拟合功放输入输出曲线(Fitting power amplifier with Saleh model. The input and output data of N group power amplifier are used to identify the parameters in the model, to fit Input and output curve of fitted power amplifier.)

说明：  利用AR模型仿真瑞利衰落信道，可用为信道建模做参考(Program to simulate Rayleigh fading using a p-th order autoregressive model AR(p) )

针对变压器的故障诊断，通过概率神经网络对其进行分类。运行程序后，网络输出值和实际值非常接近，很好的实现了对变压器的故障分类。(For the transformer fault diagnosis, we use the probability neural network to classify it. After running the program, the network output value and the actual value is very close, which achieves the good classification of transformer fault .)

ionosphere problem solving

用matlab对chirp信号进行了仿真，表现出了chirp信号的frft的峰值搜索，参数估计(Using matlab for chirp signal simulation, showing a peak search chirp signal frft, the parameter estimates)

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)

基本遗传算法(GA)的matlab源程序!许多改进的遗传算法均可在此基础上修改而成.()

自己写的几个小程序，包括冲激函数，阶跃函数，时域采样，恢复，内插等程序。很好用。(Write several small programs, including the impulse function, step function, time domain sampling, recovery, interpolation procedures. Good use.)