资源列表
my_pso(0520)
- 粒子群算法在数字图像相关中搜索整像素极值，可以很好识别区域极值-PSO algorithm searches the entire pixel in the digital image correlation in the extreme, can well identify extreme region
random-load-flow
- 基于LOGIT的STOCH配流法（随机配流法），全有全无交通流分配和随机交通流分配是所有复杂交通流分配模型必用的元素代码，现在我把其中之一以函数的形式编出来-Based on the LOGIT STOCH match flow method (with random flow method)
Augsburg-affective-recognition
- 德国奥格斯堡基于生理信号的情感识别GUI工具箱。包括心电，皮电，呼吸和肌电信号。-Augsburg, Germany-based GUI toolkit emotion recognition of physiological signals. Including ECG, galvanic skin, respiratory and EMG.
OCA
- 客观聚类分析OCA算法的源代码，只有一个函数-OCA code
quanpu-quanxipu
- 对机械设备的振动信号进行全谱分析与全息谱分析对比，并画出轨心轨迹-关闭翻译英语中文德语检测语言 中文(简体)英语日语 翻译文字或网页 对机械设备的振动信号进行全谱分析与全息谱分析对比，并画出轨心轨迹 请键入文字或网站地址，或者上传文档。 取消 Duì jīxiè shèbèi de zhèndòng xìnhào jìnxíng quán pǔ fēnxī yǔ quánxí pǔ fēnxī duìbǐ, bìng huà chūguǐ xīn guǐjīMach
FDTD_3D_RCS
- 使用时域有限差分法编写的计算散射截面的简单程序-Scattering cross section is calculated using a simple program written in finite difference time domain method
GeneticAlgorithm_MaxMin
- 目标函数F(s)=21.5+x1*sin(4*pi*x1)+x2*sin(20*pi*x2),运用遗传算法求取函数的最值，课程作业，自己原创。-The objective function F (s) = 21.5+ x1* sin (4* pi* x1)+ x2* sin (20* pi* x2), the use of genetic algorithms to strike the most valued function, course work, their own originali
MCMC
- 详解介绍MCMC，Gibbs抽样和MH算法，找这么多天最详细的-Detailed descr iption MCMC, Gibbs sampling and MH algorithm to find the most detailed so many days
htl4ic
- 使用新兴的机器学习方法：迁移学习进行图片分类，分类效果明显提高。-Use the emerging machine learning methods: migration study carried pictures segments, segment results improved significantly.
rengong2
- 师兄的人工势场法避障实验代码，绝对好用，代码精炼，注释全-Brother of artificial potential field obstacle avoidance test code, absolutely everything, code refining, notes the whole
psoSVMcgForRegress
- 一种基于粒子群参数优化算法的支持向量机，用于数据的回归分析-Particle swarm optimization algorithm based on the parameters of support vector machine for regression analysis of data
TSPLIB
- 蚁群算法解决TSP问题时用到的城市数据，经过整理，可以直接调用。-Ant colony algorithm to solve TSP problem when the data used in the city, after finishing, you can call directly.