stochastic_opt

说明：  在matlab中充分利用simulink的强大功能仿真通信系统中的调幅。(In matlab to make full use of the power of simulink simulation of communication systems in the AM.)

一种对ofdm的基于DFT的信道估计的改进算法，能得到更好的性能(A DFT based on ofdm channel estimation of the improved algorithm can get better performance)

biometroics lecture notes

半导体器件物理里面BJT的相关MATLAB计算进行分析。(BJT MATLAB)

M/M/1 排队模型，用MATLAB简单写的(M/M/1 queuing model, built up in matlab)

介绍了一种均匀圆阵doa的music源程序(introduces a uniform circular array of music source DOA)

用MATLAB M文件产生4096点的正弦数据(MATLAB M-file to produce a 4096-point sine data)

Managing Diversification投资组合对应的Matlab源代码(We propose a unified, fully general methodology to analyze and act on diver- sification in any environment, including long-short trades in highly correlated markets with complex derivatives.)

单领航者基于距离的协同导航定位, EKF算法, 算法流程部分可以封装为函数直接调用, 还给出了初始化, 用的时候自己分开.(EKF Collaborative navigation based on distance with single leader )

说明：  分支定界法（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.)