language-identifier

随机权重的粒子群算法，优化过程中权重随机变化(RandWPSO)

本仿真为电动汽车充电桩设计，采用了隔离式的DC/DC环节(Simulation to charge electric cars pile design, isolated DC/DC link)

数字水印DCT嵌入与提取水印matlab实现实例！(Digital Watermarking DCT watermark embedding and extraction matlab examples realize!)

The algorithms are coded in a way that makes it trivial to apply them to other problems. Several generic routines for resampling are provided. The derivation and details are presented in: Rudolph van der Merwe, Arnaud Doucet, Nando de Freitas and Eric Wan. The Unscented Particle Filter. Technical report CUED/F-INFENG/TR 380, Cambridge University Department of Engineering, May 2000. After downloading the file, type "tar -xf upf_demos.tar" to uncompress it. This creates the directory webalgorithm containing the required m files. Go to this directory, load matlab5 and type "demo_MC" for the demo. (The algorithms are coded in a way that makes it trivial to apply them to other problems. Several generic routines for resampling are provided. The derivation and details are presented in: Rudolph van der Merwe, Arnaud Doucet, Nando de Freitas and Eric Wan. The Unscented Particle Filter. Technical report CUED/F-INFENG/TR 380, Cambridge University Department of Engineering, May 2000. After downloading the file, type "tar-xf upf_demos.tar" to uncompress it. This creates the directory webalgorithm containing the required m files. Go to this directory, load matlab5 and type "demo_MC" for the demo. )

基于matalab的最大熵方法的图像分割程序(Segmentation based on maximum entropy)

k均值聚类优化径向基网络中心，遗传算法优化权值，然后用网络进行函数拟合，真实可用(k means clustering for optimizing the center of RBF,GA is used for optimizing the weights.)

说明：  用于画出lorenz的利亚普诺夫指数，该文件算法优秀，比同类程序运算速度快很多(Draw for the Australian Punuo Fu Index lorenz)

Signal Model and Statistical Analysis for the Sequential Sampling Pulse Radar Technique

灰色模型，通过对少数数据的分析，鉴于灰色模型的使用，对未来进行预测。(Gray model, through the analysis of the data on the minority view of gray model used to predict the future.)

The travelling salesman problem (TSP) asks the following question: Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city? It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science.