jbfmxexn

Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.

人脸特征提取经典PCA方法的matlab源码，做这方面的朋友不妨试试。(Human Face Feature Extraction classic PCA method matlab source code, make friends in this area worth a try.)

说明：  分别用LMS和RLS算法实现的一个AR4阶谱估计，附源代码和试验结果(LMS and RLS, respectively, with an algorithm AR4-order spectrum estimation, with source code and test results)

说明：  Canny Edge Detector Algorithm and Matlab Codes

用于线性调频信号的脉冲压缩处理程序，采用相关计算的算法进行的压缩处理(For LFM pulse compression process, using the relevant calculation algorithms for compression processing)

实现matlab gui 界面的人脸检测代码，界面的调用以及设计方法(Achieve matlab gui interface face detection code, interface design method calls and)

异步双馈风力发电感应电机的网侧变换器，电压外环电流内环控制，可以运行(The grid side converter of double fed wind power asynchronous induction motor, voltage loop and current loop control, you can run)

简单蚁群算法解决tsp问题 一共有48城市 花费7分钟(Simple ant colony algorithm to solve the problem 1 tsp spent a total of 48 cities in 7 minutes)

进行话音检测和去除无效的话音，是进行语音识别和处理的预处理必须的功能。(A simple method for silence removal in speech streams)

This is demo code is ued for matlab demo