12DS_uwbprogram

人工免疫算法的工具箱，有需要就拿去用吧！希望能采纳，(Artificial immune algorithm toolbox, there is a need to take with you! Hoping to adopt)

matlab大全，专门用于图像处理和图像获取(matlab codes for graph management)

Hashin-Shtrikman计算体积模量和剪切模量上下边界(Upper and lower bounds of the Hashin-Shtrikman bulk modulus and shear modulus)

This function calculate furier transform to sum of vectors and extract the furier transform for each one

mat lab code .. which converts any to csv file format

part1.m 1. Converts 14 image pairs of a video sequence to grayscale. 2. Computes the absolute difference between the pairs yielding 15 images. camshift.m 1. Implementation of the CAMSHIFT algorithm for tracking a hand in a video sequence. Executing this project from within Matlab At the command prompt enter: >>part1 >>camshift

说明：  高校图象处理,里面的图画可以自己去找一张然后放到程序指定路径即可(college image processing, the picture inside themselves and they can then put a process can be designated trails)

在802.15.4a信道模型下的相关检测的TOA估计算法，能够对目标节点进行测距。(In 802.15.4a channel model correlation detection TOA estimation algorithm, capable of target nodes ranging.)

基于遗传算法的PID控制 用于优化求解控制器的参数 (based on genetic algorithms for optimizing PID control parameters Controller Solution)

遗传算法tsp问题 针对题目中物流配送路径优化问题，本文引入0-1规划思想，建立了带约束条件的物流配送问题的数学模型。求解时，引入遗传算法的编码方式，并针对分区数与客户数量相差较小的情况，灵活运用分区配送算法确定包含最优解的分区序列组，紧密结合枚举法使得其算法兼顾简单、快速的优点。应用Matlab软件可执行得到最短路径。兼顾时间因素导致的复杂影响，我们引入了惩罚函数，并通过设定惩罚系数，进一步由最短路径求得最优路径。(Genetic algorithm tsp problem of logistics distribution routing optimization problem subject, this paper introduces 0-1 programming ideas, a mathematical model with the constraints of logistics and distribution problems. Solving, introducing genetic algorithm encoding, and the number of partitions and the number of customers for a small difference, the flexible use of the partition containing the partition algorithm to determine the distribution of the optimal solution sequence group, closely enumeration method allows both the algorithm is simple, fast advantages. Matlab software application executable to get the shortest path. Complex factors affecting both the time, we introduce a penalty function, and by setting the penalty coefficient, and further obtain the optimal path from the shortest path.)