random_tour_2opt

此源码实现DOA估计中的TCT算法，保证出结果。 (DOA realize that this source is estimated in the TCT algorithm, to guarantee the result.)

描绘出衰落信道中Jakes模型 此为主函数体 并在主函数中调用jakes模型(Jakes model depicts Fading This is the main body of the function in the main function call jakes model)

WPanalysis Function for wavelet processing

物理里面进行数据处理，线性拟合，非线性拟合。画图分析的小李子(data process)

基于matlab的EOF分解程序，包括旋转EOF分解，复数EOF分解等，附带详细的例子(matlab, including rotated EOF decomposition, plural EOF decomposition, etc., along with detailed examples)

matlab傅里叶变换的频域卷积定理，这个程序还不错，想要就下吧这样就20个字了(Fourier transform matlab convolution theorem in frequency domain, this process also good, you want to do on the next word on the 20)

测试可以跑，根据自己情况修改下函数即可. 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.)

相位累加器，即DDS频率合成器的MATALB实现，采用M文件编写的S函数(Phase accumulator, that is, the DDS frequency synthesizer MATALB realized, the use of M' s S function documentation)

Crout Algorithm for Power Flow

caculate newy-west standard deviation