CMA_Equalizer

Simple demonstration of modeling intermodulation tones.

一篇关于MATLAB的基础知识，供大家使用，希望对大家有用，(A basic knowledge of MATLAB for everyone to use, we want to be useful,)

排课问题是一个有约束的、多目标的组合优化问题，并且已经被证明是一个NP完全问题。 遗传算法借鉴生物界自然选择和自然遗传机制，使用群体搜索技术，尤其是用于处理传统搜索方法难以解决的复杂的和非线性的问题。经过近40年的发展，遗传算法在理论研究和实际应用中取得了巨大的成功，本文将遗传算法用于排课问题的求解，首先讨论了排课问题中的影响因素、主要约束条件、求解目标和难点，并用数学模型完整地描述了排课问题。其次对多个模糊排课目标进行了定量分析，建立了排课优化目标空间。针对排课问题研究了染色体编码方式以及遗传算子的设计，提出了适应度函数的计算方法。最后对排课问题进行了实验。实验结果表明，其过程的目标值跟踪显示，算法稳健趋优，所得结果令人满意。(Course Scheduling problem is a constrained, multi-objective optimization problem, and has proven to be a NP complete problem. Genetic algorithms reference biosphere and the natural genetic mechanism of natural selection, using the group search technology, particularly the traditional search methods for handling complex and difficult to solve nonlinear problems. After nearly 40 years of development, the genetic algorithm in the theoretical study and practical application was a great success, this paper genetic algorithm for solving the course timetabling problem, first discussed the impact of factors in the course arrangement, the main constraints, to solve goals and difficulties, and a complete mathematical model to describe the course arrangement. Arranging multiple fuzzy goals followed by a quantitative analysis, the optimal target Arranging space. Arranging for the Study of the chromosome coding and genetic operators design, proposed fitness function is calculated. Finally, the co)

GPS信号抗干扰方法中的KLMS算法，matlab程序(GPS signal interference methods KLMS algorithm, matlab program)

Shunt Generator equation

参数估计与假设检验 内含matlab详细代码 已经经过调试 可以使用(Parameters estimation and hypothesis testing with detailed code )

带有现象对象界面的matlab的滤波器设计，能对信号进行各种滤波(Object interface matlab with the phenomenon of the filter design, can signal a variety of filtering)

这个是关于purning-fft的算法，即一种改进型的fft。适用于只有一部分有值，并非所有的都有值。(This is on purning-fft algorithm, an improved version of fft. Applies to only part of the value, not all have value.)

一种贪婪算法：正交匹配追踪算法的matlab代码(matlab code of orthogonal match pursuit algorithm)

传统的K-medoids聚类算法的聚类结果随初始中心点的 不同而波动，且计算复杂度较高不适宜处理大规模数据集； 快速K-medoids聚类算法通过选择合适的初始聚类中心改进 了传统K-medoids聚类算法，但是快速K-medoids聚类算法 的初始聚类中心有可能位于同一类簇。为了克服传统的K- medoids聚类算法和快速K-medoids聚类算法的缺陷，提出 一种基于粒计算的K-medoids聚类算法。(The traditional K-medoids clustering algorithm clustering results with different initial center points and volatility, and high computational complexity is not suitable for processing large data sets; K-medoids clustering algorithm by choosing proper initial cluster centers to improve the traditional K-medoids clustering algorithm, but the initial cluster center of K-medoids clustering algorithm can be located in the same cluster. In order to overcome the shortcomings of the traditional K- medoids clustering algorithm and the fast K-medoids clustering algorithm, a K-medoids clustering algorithm based on granular computing is proposed.)