xunhuanpu

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.

等间隔的OFDMA程序，里面有在多径信道下做的，对OFDMA的入门者有极大的帮助(interval of OFDMA procedures, which are in multi-path channel do, for the beginners OFDMA a great help)

这是TD算法的逆过程，首先将时间序列，划分为相邻点的短序列，当然此时的拟合误差为0，因为第一点和第二点的连线，原始点都落在线段上。将相邻两个线段连接起来，此时每条线段包含三个原始点，计算中间那个点的拟合误差。这样，所有这些三个点的线段中的中间点的拟合误差计算出来后，找出误差最小且误差小于阀值R的分段，作为第一条包含三个点的线段。 在上面的基础上，第一条分段同样的和相邻线段连接，然后计算每一条分段的拟合误差，再找出误差最小且小于阀值R的分段，作为第二个分段。依次方式循环，直到所有分段的拟合误差都小于阀值R，分段结束。 (This is the reverse process of TD algorithm, the first time series is divided into short sequences adjacent dots, of course fitting error is zero at this time, because the first and second points of connection, the original point fall line on. The two adjacent segments are connected, then each segment contains three original point, the intermediate fitting error calculated that point. Thus, after all these segments fitting error of three points in the intermediate point calculated to find the minimum error and the error is less than the threshold R segment, as the first line contains three points. Based on the above, the first segment and the adjacent line segment connecting the same, and then calculate a fitting error for each segment, and then find the smallest error and less than the threshold R segment, as the second segment . Followed by a cyclic manner until all segments fitting error is less than the threshold R, segment ends.)

bp网络训练后的测试，读取已经训练好的bp网络，进行实际应用(bp network training after the test, reading the training has been good bp network for practical application)

该matlab程序可以根据所选择的测试库中图片对人脸进行识别，从而在系统中找到与之匹配的图片。(The matlab program can test the library, the selected image on the human face recognition, which is found in the system to match the pictures.)

matlab GUI编辑的很好讲解，对初学者很有帮助的文档(matlab GUI，helpful to the newer)

遗传算法MATLAB实现，复制粘贴入MATLAB中即可(Genetic algorithms in MATLAB, you can copy and paste into the MATLABGenetic )

Learn how to use matlab in telecommunications, with diferents ways of digital and analog processing.

This paper proposes a novel and computationally efficient global I< optimization method based on swarm ntelligence for locating ti nodes in a WSN environment. The mean squared range error of a all neighbouring anchor nodes is taken as the objective function d for this non linear optimization problem. The Particle Swarm c Optimization (PSO) is a high performance stochastic global b optimization tool that ensures the minimization of the objective a function,

Numerical integral, Romberg integral, matlab .m file, source code.