lyapunov_wolf

包括种群初始化、选择、交叉、变异各个子程序，每一部分都作为一个单独M文件。主程序是实现遗传算法网络的训练过程；测试程序可以对训练得到的网络进行结果测试(Including population initialization, selection, crossover and mutation all subroutines, each of which as a separate M-file. Main program is to achieve genetic algorithm network training process test procedures can be trained to get the results of the test network)

BER performance of RCPC codes over Reilaygh fading

有关PCM编码的，并有误码率分析，无密码(The PCM coding, no password)

bm3d图像去噪算法，3个文件 用于处理灰度图像(version 1.7 grey image)

内点法最优潮流程序，其中可以修改相关目标函数来计算不同情况下的最优点(Interior point optimal power flow program)

医学图像形变配准在图像引导放射治疗中的应用(The Application of deformable Medical Image Registration in Image-guided Radiotherapy)

MATLAB中应用RBF神经网络对模式识别处理(MATLAB Application of RBF neural networks for pattern recognition processing)

有关信号波形、幅值谱、相位谱，互相关函数的算法、波形(the signal waveform amplitude spectrum and phase spectrum, cross-correlation function of the algorithm, waveform)

在需要检测的音频中加入白噪声序列来检测音频的特性(Add white noise sequence to be detected in the audio features to detect audio)

说明：  分支定界法（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.)