该方法通过计算排序模式分布的距离来分析两段脑电信号的相异性。
The dissimilarity between two EEG epochs can be qualified via a simple distance measure between the distributions of order patterns.
理论研究和算例分析都表明,这是两种比较好的计算排序向量的方法。
Theoretical studies and example analyses all show that these are two better methods for calculating priority vector than LAM and REM.
另一类方法是直接由一致性或具有满意一致性的模糊判断矩阵计算排序向量。
In the second kind of approach, the priority weight vector is calculated directly from a (consistent) fuzzy judgment matrix or one with satisfactory consistency.
Well, we saw the teaser in terms of that animation that suggests this merge sort algorithm when implemented by a computer is absolutely faster.
我们从前面的动画中可以看到,这个归并排序算法在计算机上实现之后,绝对比其他算法更快。
OK. Today, for the rest of the lecture, we're going to take a break from the topic of algorithms, and computation, and things of the sort. And do something pretty pragmatic.
好,今天剩下的时间里,我们不再讲算法,计算和排序这些话题了,我们会做一些非常实用的事,我们主要的讲讲测试。
应用推荐