music

a c++ code developed by Chris H. Rycroft for 2D voronoi diagram generation

这是数据库的教程,是某重点大学的非常专业的讲稿,-This is the Directory database is a key university in a very professional script,

用于数据聚类，无监督学习，可以直接使用，望大家指导批评(For data clustering, unsupervised learning)

粒子群算法，也称粒子群优化算法或鸟群觅食算法（Particle Swarm Optimization），缩写为 PSO， 是由J. Kennedy和R. C. Eberhart等开发的一种新的进化算法(Evolutionary Algorithm - EA)。PSO 算法属于进化算法的一种，和模拟退火算法相似，它也是从随机解出发，通过迭代寻找最优解，它也是通过适应度来评价解的品质，但它比遗传算法规则更为简单，它没有遗传算法的“交叉”(Crossover) 和“变异”(Mutation) 操作，它通过追随当前搜索到的最优值来寻找全局最优。这种算法以其实现容易、精度高、收敛快等优点引起了学术界的重视，并且在解决实际问题中展示了其优越性。粒子群算法是一种并行算法(Particle Swarm Optimization (PSO), also known as Particle Swarm Optimization (PSO), is a new evolutionary algorithm developed by J. Kennedy and R. C. Eberhart. PSO is a kind of evolutionary algorithm, which is similar to simulated annealing algorithm. It starts from random solution and searches for the best solution by iteration. It also evaluates the quality of solution by fitness. But it is simpler than genetic algorithm rules. It has no Crossover and Mutation operation of genetic algorithm. As a result, it searches for global optimum by following the optimal value currently searched. This algorithm has attracted the attention of academia for its advantages of easy implementation, high accuracy and fast convergence, and has shown its superiority in solving practical problems. Particle swarm optimization is a parallel algorithm)

Tun2Socks for Windows

本套网络视频教程由提供，解压后，打开主文件夹下的文件即可收看视频。-This set of video tutorials from

用c++语言编写的简单闹钟程序，可以实现设置日期，时间和闹钟提醒功能！非常实用！！

演化博弈动态复制仿真，用于演化博弈一方多策略博弈，或两方两策略博弈(simulation of evolutionary game)

说明：  低通滤波，运用fft快速傅里叶变换，测试文件，已搭构框架(Low-pass filtering, FFT fast Fourier transform, test files, has been constructed framework)

说明：  全搜索算法重构图。像顾名思义，穷尽法就是对搜索范围内的每个位置都进行计算并比较，从原图像块中找到与待匹配块最相似（误差最小）位置的方法。对于一个搜索范围为[-7,7]的区域来说，x，y两个方向全部搜索一遍需要进行 15X15 = 225 次计算。穷尽法的缺点很明显就是计算量太大，速度很慢，另一方面，由于全部范围都进行了计算，其匹配精度是最高的。(Reconstruction graph of full search algorithm. As the name implies, the exhaustive method is to calculate and compare each position within the search range, and find the most similar (least error) position with the block to be matched from the original image block. For an area with a search range of [- 7,7], 15x15 = 225 calculations are required for searching both directions X and Y once. The disadvantage of exhaustive method is that the calculation is too large and the speed is very slow. On the other hand, the matching accuracy is the highest because all the ranges are calculated.)