gpsnoise

LEACH协议的改进SEP的Maltab仿真代码( SEP,a protocol to improve the LEACH by Maltab)

matlab的工具箱的安装步骤： 1.解压下载的文件包，将tft/mfile复制到matlab的toolbox文件夹下 2.建立搜索路径，matlab->file->Set Path->Add Folder ->选择mfile文件夹复制到matlab的toolbox的路径->save->close 3.测试是否建立搜索路径成功，在matlab命令窗口打入：which fmsin 返回的结果是你放mfile的正确路径说明建立搜索路径成功。此时就完成了安装工具包的工作。 (matlab toolbox installation steps: 1. decompress the downloaded file package, which will tft/mfile matlab' s toolbox copy to folder 2. to establish the search path, matlab-> file-> Set Path-> Add Folder-> Select matlab mfile folder to the path of the toolbox-> save-> close 3. test whether the establishment of a successful search path, in the matlab command window enter: which fmsin return mfile result is you put the correct path to search path that create success. At this point the installation kit to complete the work.)

MATLAB7.0入门到精通第八章的全部实例的MATLAB代码(MATLAB7.0 entry to master all the examples of Chapter XIII of MATLAB code)

用matlab工具实现粒子群算法，并解决TSP问题(Particle swarm optimization with matlab implementation)

BPSK调制和解调，matlab环境下仿真实现(BPSK modulation)

滤波设计,可以修改参数，达到不同的滤波效果，可用于扭矩传递等控制信号(Filter modle)

老外写的压缩传感算法（CS），还是不错的，供大家学习(Foreigner writing compressed sensing algorithm (CS), is good for everyone to learn)

可用于光伏出力预测，引入气象影响因子，效果良好(It can be used to predict PV output, and the effect is good)

板壳理论解析解matlab实例，包括莱维方法、纳维方法(The analytical solution of shell theory MATLAB examples, including Levi method, Navier method)

说明：  遗传算法 多目标优化算法，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.)