MSTParser是以最大生成树理论为基础的判别式依存句法分析器。它将一科依存树的得分看作是 所有依存关系的得分的总和，从而依存分析的问题转化成如何寻找最高得分的依存树。-Spanning tree is the largest MSTParser theory-based discriminant Parser interdependence. Section 1 will be scored as interdependent tree are all interdependent re

通过MATLAB软件；通过仿真得出性能曲线；从而比较bpsk的性能-The bit-error rate (BER) of binary phase-shift keying in Rayleigh fading, using the Alamouti transmission scheme and receiver selection diversity in the presence of channel-estimation error, is studied. Closed-

依据已有的求和公式，通过最简单的求和代码，实现matlab的求和功能。使新手更容易学习。