The-Booth-Tolls-for-Thee

This function is for training a codebook for vector quantization. The data set is split to two clusters, first, and the mean of each cluster is found (centroids). The disttance of each vector from these centroids is found and each vector is associated with a cluster. The mean of vectors of each cluster replaces the centroid first. If the total distance is not improved substantially, The centroids are each split to two. This goes on untill the required number of clusters is reached and the improvement is not substantial.

采用MATLAB GUI 设计的加法器界面，输入两个数，实现两数相加的功能，适合于刚刚接触的同学。(Using MATLAB GUI interface design adder, enter two numbers, two numbers together to achieve the function, just contact for students.)

matlab monte-carlo simulation for American option pricing and other path dependent derivative(matlab monte-carlo simulation for American option pricing and other path dependent derivative)

Image displayed in 16, 8, 4,2 gray levels. Image displayed in 256,128,64,32 gray levels.

说明：  I don t know what it is

主要的粒子群优化方法的matlab实现,粒子群优化算法的主要理论的实现方法(the methods of the PSO)

power systems-lamda iteration

采用栅格对机器人的工作空间进行划分，再利用优化算法对机器人路径优化，是采用智能算法求最优路径的一个经典问题。目前，采用蚁群算法在栅格地图上进行路径优化取得比较好的效果，而利用遗传算法在栅格地图上进行路径优化在算法显得更加难以实现。 利用遗传算法处理栅格地图的机器人路径规划的难点主要包括：1保证路径不间断，2保证路径不穿过障碍。 用遗传算法解决优化问题时的步骤是固定的，就是种群初始化，选择，交叉，变异，适应度计算这样，那么下面我就说一下遗传算法求栅格地图中机器人路径规划在每个步骤的问题、难点以及解决办法。(It is a classical problem to divide the workspace of the robot by grids and optimize the path of the robot by using optimization algorithm. At present, the ant colony algorithm is used to optimize the path on the grid map, and the genetic algorithm is used to optimize the path on the grid map, which is more difficult to achieve. The difficulties of using genetic algorithm to deal with the path planning of robot on raster map mainly include: 1. guaranteeing that the path is uninterrupted, 2. guaranteeing that the path does not cross obstacles. The steps of genetic algorithm in solving optimization problems are fixed, that is, population initialization, selection, crossover, mutation, fitness calculation. Then I will talk about the problems, difficulties and solutions of genetic algorithm in each step of robot path planning in raster map.)

最短路这个说明倒不是说明函数的功能，只是声明一下函数中出现的问题。 shortest()函数没有问题，在secshortest中我希望只得到一条次短路（或几条roadcost()值相同的次短路），结果却出来好几条，我仔细检查了一下程序，应该没有什么问题。 因此在使用时，要得到次短路，只能用roadcost()函数分别求一下各条路的权重和，找到最小的。 有些奇怪 (short path)

说明：  对rosenstein求解最大李雅普诺夫指数算法,实现成功(Rosenstein solving of the largest Lyapunov exponent algorithm, to achieve successful)