shiva_combined

Frequency Hopping Spread Spectrum Code

A toolbox to handle 2D curve and multiresolution representation of curve(A toolbox to handle 2D curve and multiresol ution representation of curve)

用于最大信噪比准则方向图和功率谱，自己编写，仅供参考(Pattern for maximum signal-to-noise ratio criterion and the power spectrum, write your own, for reference only)

说明：  数据分类，AdaBoost算法提升SVM，MATLAB算法(it is useful。)

Matlab Files for QPSK using MIMO and Doppler Effects

实现了最低有效位LSB水印算法。 压缩文件中含有原图，可直接放到Matlab中运行。(We realize the least significant bit （LSB） watermarking algorithm. It contains all the images you need,and it can be run directly in Matlab.)

MATLAB用于AWGN信道中产生512点算法!(MATLAB for AWGN channel generated 512 points algorithm!)

基于栅格法的路径规划算法实现（Matlab环境下）(Grid method is based path planning algorithm (Matlab environment))

THE SYNTAX OF A PROGRAMMING LANGUAGE tells you what code it is possible to write—what the machine will understand. Style tells you what you ought to write— what the humans reading the code will understand. Code written with a consistent, simple style will be maintainable, robust, and contain fewer bugs. Code written with no regard to style will contain more bugs. It may simply be thrown away and rewritten rather than maintained.(var OF THE PROGRAMMING LANGUAGE tells A. you what code it is possible to write-what the ma chine will understand. Style tells you what you ought to write-what the humans reading the code will understand. Code written with a consisten t, simple style will be maintainable, and robust. and contain fewer bugs. Code written with no reg ard to style will contain more bugs. It may simpl y be thrown away and rewritten rather than maint ained.)

测试可以跑，根据自己情况修改下函数即可. NSGA-III 首先定义一组参考点。然后随机生成含有 N 个（原文献说最好与参考点个数相同）个体的初始种群，其中 N 是种群大小。接下来，算法进行迭代直至终止条件满足。在第 t 代，算法在当前种群 Pt的基础上，通过随机选择，模拟两点交叉（Simulated Binary Crossover，SBX）和多项式变异 产生子代种群 Qt。Pt和 Qt的大小均为 N。因此，两个种群 Pt和 Qt合并会形成种群大小为 2N 的新的种群 Rt=Pt∪Qt。 为了从种群 Rt中选择最好的 N 个解进入下一代，首先利用基于Pareto支配的非支配排序将 Rt分为若干不同的非支配层（F1，F2等等）。然后，算法构建一个新的种群St，构建方法是从 F1开始，逐次将各非支配层的解加入到 St，直至 St的大小等于 N，或首次大于 N。假设最后可以接受的非支配层是 L层，那么在 L+ 1 层以及之后的那些解就被丢弃掉了，且 St FL中的解已经确定被选择作为 Pt+1中的解。Pt+1中余下的个体需要从 FL中选取，选择的依据是要使种群在目标空间中具有理想的多样性。(The test can run and modify the function according to its own situation. NSGA-III first defines a set of reference points. Then the initial population containing N individuals (preferably the same number of reference points as the original literature) was randomly generated, where N was the size of the population. Next, the algorithm is iterated until the termination condition is satisfied. On the basis of current population Pt, the algorithm simulates two-point crossover (SBX) and polynomial mutation to produce offspring population Qt by random selection.)