AMDF

matlab经典绘图案例。包括三维曲面z=x^2+y^2的动画、正弦曲线的动画、切片图、向量图、三维彗星图、三角形网格图、三角形表面图、球面、等值线图、三维瀑布图、三维火柴杆图、三维散点图、柱形图、三维条形图、三维饼图、带形图、曲线图、高斯分布函数的曲面图、高斯分布函数的网格图、5阶高斯分布矩阵、梯度场矢量图、罗盘图、玫瑰花图、羽列图、数据向量的单轴对数坐标图、矩阵的条形图 矩阵的面积图、二维饼图、散点图、误差图、火柴杆图和碗状曲面图等等。 (Drawing matlab classic case. Including three-dimensional surface z = x ^ 2+ y ^ 2 animation, animated sine curve, slices, vector graphics, three-dimensional map comet, triangular grid map, triangular surface plots, spherical, contour, 3D waterfall, three-dimensional grid graph matchstick figure, three-dimensional scatter plot, bar chart, the three-dimensional bar charts, three-dimensional pie charts, strip charts, graphs, surface, Gaussian distribution function, the Gaussian distribution function, fifth-order Gaussian distribution matrix gradient vector field, compass, rose diagram, feather column chart, the data vector uniaxial logarithmic graph, bar graph matrix Area chart matrix, two-dimensional pie charts, scatter plots, error plots, matchstick figure and bowl surface map and so on.)

NCC算法的matlab的实现，代码简单易懂，只是运行时间稍长。(NCC algorithm matlab implementation, the code is simple to understand, just run a little longer.)

本人对载波同步方面深有研究，这是研究生期间做的用插值算法实现载波估计算法，算法性能很好，接近MCRB。(I have a deep respect for carrier synchronization study, which is done during graduate interpolation algorithm used carrier estimation algorithm, algorithm performance is very good, close to MCRB.)

说明：  分支定界法（branch and bound）是一种求解整数规划问题的最常用算法。这种方法不但可以求解纯整数规划，还可以求解混合整数规划问题。分支定界法是一种搜索与迭代的方法，选择不同的分支变量和子问题进行分支。 对于两个变量的整数规划问题，使用网格的方法有时更为简单。 [1] 通常，把全部可行解空间反复地分割为越来越小的子集，称为分支；并且对每个子集内的解集计算一个目标下界（对于最小值问题），这称为定界。在每次分枝后，凡是界限超出已知可行解集目标值的那些子集不再进一步分枝，这样，许多子集可不予考虑，这称剪枝。这就是分枝定界法的主要思路。(Branch and bound method is one of the most commonly used algorithms to solve integer programming problems. This method can solve not only pure integer programming but also mixed integer programming. Branch and bound algorithm is a method of search and iteration, which selects branches with different branch variables and sub problems. For integer programming problems with two variables, the grid method is sometimes simpler[ 1] Generally, all feasible solution spaces are divided into smaller and smaller subsets repeatedly, which is called bifurcation; And a lower bound of the objective (for the minimum value problem) is calculated for the solution set in each subset, which is called the bound. After each branch, those subsets whose bounds exceed the objective value of the known feasible solution set will not be further branched, so many subsets can not be considered, which is called pruning. This is the main idea of branch and bound method.)

data acquisition in MATLAB

说明：  本文件中有多个matlab内核函数的源代码，可以方便的查阅在matlab内核运行的代码，从而提高个人matlab编程技巧。(This file is about the core code of matlab,can help reader and learner to improve programming in matlab Environment.)

MATLAB有限单元分析书中的源程序，简单实用，是练手的好材料！(MATLAB finite element analysis of the book source code, simple and practical, practiced hand!)

image segmentation for extracting objects from an image

基于并行方法的遗传算法求解多目标优化问题的matlab程序，可作为多目标学习(Parallel genetic algorithm for solving multi-objective optimization problem based method matlab program can learn as a multi-objective)

long memory article 1994