fuzzy_pid

beam element is a finite element code for assembling of stiffness and mass matrix of bernulli beam with two dof at each node

Image Halftoning by Jarvis Method

Implementation of the Murty algorithm to obtain the best K assignments. Includes the implementation of the Jonker-Volgenant algorithm. Usual applications are multiple target tracking algorithms, Joint Probabilistic Data Association (JPDA), Multiple Hypothesis Tracking (MHT), Global Nearest Neighbours (GNN), etc. Based on the original code by Jonker-Volgenant, and the Murty Matlab implementation by Eric Trautmann Can be used both from Java or Matlab. Time for a 100x100 assignment problem, with k=20: • Matlab implementation: 54.5 sec • Java implementation: 1 sec

本资料是关于MST_Kruskal算法的matlab实现程序(MST_Kruskal matlab)

说明：  遗传算法 多目标优化算法，SPEA2 主要流程：1：首先初始化一个archive的集合P1，以及一个常用的population的集合P。设置P1的大小是N1，P的大小是N。初始的时候P1是空的，而P是已经初始化好的种群个体。 2：对P1进行评价，选出来里面的pareto front为1（下面用PF1来代替了）的个体，copy到P1中，如果PF1的数量大于N1的话，这个接下来再说，目前假定PF1的数量小于N1。(Genetic algorithm, multi-objective optimization algorithm, SPEA2 Main process: 1: first, initialize a set P1 of archive and a set P of popular. Set P1 to N1 and P to n. At the beginning, P1 is empty, and P is the initialized population. 2: Evaluate P1, select the individual whose Pareto front is 1 (Pf1 is used to replace it below), copy to P1, if the number of Pf1 is greater than N1, then let's talk about it. At present, it is assumed that the number of Pf1 is less than N1.)

MATLAB求解ODE方程，里面的WORD文档详细介绍了各文件的作用(MATLAB ODE solving equations, the WORD document which details the role of each document is also loaded.)

floyd算法 主要用于图论中的球最短距离的程序 可以直接求出任意两点间的最短距离(floyd algorithm used in graph theory the ball the shortest distance programs can be obtained the shortest distance between any two points)

target tracking in wsn

CONVERTER-POWER-IN MATLAB

说明：  降低数据维度，提取高级特征，使得用较少的特征来表示最后的结果(Reduce the data dimension, extract high-level features, so that fewer features are used to represent the final result)