KrivenkoTool

多目标遗传算法程序 to run Demo files, is to run SGALAB_demo_*.m what s new: 1) Multiple-Objective GAs VEGA NSGA NPGA MOGA 2) More TSP mutation and Crossover methods PMX OX CX EAX Boolmatrix 3) More selection methods Truncation tornament stochastic 4) mutation methods binary single point int/real single point 5) encoding/decoding methods binary integer/real messy gray DNA permuation to fix the plot bugs for 4001 , download this file and replace old files. (Multi-objective genetic algorithm program to run Demo files, is to run SGALAB_demo_*. m what s new: 1) Multiple-Objective GAsVEGANSGANPGAMOGA2) More TSP mutation and Crossover methodsPMXOXCX EAXBoolmatrix3) More selection methodsTruncationtornamentstochastic4) mutation methodsbinary single pointint/real single point5) encoding/decoding methodsbinaryinteger/realmessygrayDNA permuationto fix the plot bugs for 4001, download this file and replace old files.)

this is matlab code. Very easy to use

This rar file contains some matlab programs and simulation results(generation of on off,isdn,video,data traffic)..

background subtraction technique

说明：  模拟退火计算最优系统维护时间，系统强度与衰减符合高斯分布，cpp文件用来比较蒙特卡洛方法与用分布计算的区别(Monte Carlo Method for Calculating Optimal System Maintenance Time)

基于流函数法求解流体颗粒二相绕流问题的源码(Stream function method based on particle two-phase fluid flow around the issue of source)

对于飞飞行器设计的相关M文件，希望每一个见到它的人都喜欢她(aircraft design for audience)

64-QAM modulator and demodulator

用单纯形法解线性规划 根据单纯形法的原理，在线性规划问题中，决策变量（控制变量）x1，x2，…x n的值称为一个解,满足所有的约束条件的解称为可行解。使目标函数达到最大值（或最小值）的可行解称为最优解。这样，一个最优解能在整个由约束条件所确定的可行区域内使目标函数达到最大值（或最小值）。求解线性规划问题的目的就是要找出最优解。 (According to the principle of the simplex method, in linear programming problem, the decision variables (control variable) x1, x2,... X n value is called a solution, meet all of the constraint conditions of the solution of the called feasible solution. The objective function to achieve maximum (or minimum) feasible solution of the optimal solution is called. So, an optimal solution by constraint conditions throughout the feasible region determined the objective function to achieve maximum or minimum value). To solve the linear programming problem is to find out the purpose of the optimal solution. )

SVM简单应用，最基础的SVM用法，可以入门学习。matlab m文件(SVM simple application, SVM usage is most basic, entry learning)