该方法通过计算排序模式分布的距离来分析两段脑电信号的相异性。
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.
您将学习如何显示文本、执行排序、计算单词和行数、转换字符，以及其他任务。
You will learn how to display text, sort it, count words and lines, and translate characters, among other tasks.
获取一个未编码的文本样例，计算文本中出现特定字母的次数，然后按频率最高到最低的顺序给字母排序。
Take a sample of unencoded text, count how many times specific letters appear in the text, and sort the letters in order from most to least frequent.
查询模型中其他重要的子模型与过滤和排序、计算成员、派生属性以及不对称选择有关。
Other important submodels within the query model relate to filtering and sorting, calculated members, derived attributes, and asymmetrical selections.
根据该输出，可以计算每个事务的排序数目，并可以计算溢出了可用于排序的内存的那部分排序的百分比。
From this, you can calculate the number of sorts per transaction and the percentage of sorts that overflowed the memory that was available to them.
好，今天剩下的时间里，我们不再讲算法，计算和排序这些话题了，我们会做一些非常实用的事，我们主要的讲讲测试。
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.
排序和相关度改进仅使用距离计算，我将在本文的后面介绍它们的实际应用。
Sorting and relevancy enhancement (boosting) just use the distance calculations, and I'll show how they play out in practice later in the article.
公正地说，查找包含关键字的文档列表是件很容易的事情，但是，排序技术却涉及到很多未知的技术和深奥的计算公式。
To be fair, finding the list of documents that contain the keywords is the easy part, while ranking techniques still involve a lot of black magic and secret evaluation formulas.
很多查询都包含连续计算，或对一组已排序的行进行的计算，这些都是业务分析过程中常遇到的查询。
Many of the queries contain sequential calculations, or calculations that operate on an ordered set of rows, queries frequently encountered during business analysis.
索引引擎，它负责在统计层面上分析纯文本(由二进制文档派生而来)，然后计算令牌的列表，按使用频率排序。
An indexing engine, which is responsible to statistically analyze the plain text (derived from the binary document) and compute a list of tokens, sorted by frequency.
其他著名的网格计算示例包括对人类基因排序和计算pi的100万位。
Other well-known examples of grid computing include the sequencing of the human genome and calculating a million digits of PI.
那些不能被拆分为单个微小更新的计算任务（比如对一个文件排序）仍然最好由MapReduce承担。
Computations where the result can’t be broken down into small updates (sorting a file, for example) are better handled by MapReduce.
因此，在使用标准的ODBC包装器的情况下，FederationServer只能将少数SQL操作下推到远程数据源，大多数谓词的计算、聚合、排序和连接仍然是在本地完成。
Thus, Federation Server can push down only a few SQL operations through the standard ODBC wrapper to the remote source and executes most predicate evaluations, aggregations, sorts and joins locally.
修复了MsSql 2005dialect在多个处理器的计算机上有限制的字符串排序不正确的问题。
Fixed an issue with limit string in MsSql2005 dialect sorting incorrectly on machines with multiple processors.
很多查询包含连续计算，或对已排序的一组行执行的计算，这些都是在业务分析过程中常遇到的查询。
Many of the queries contain sequential calculations, or calculations that operate on an ordered set of rows, queries frequently encountered during business analysis. For example.
寻找最优的算法是计算机科学基础研究的方向之一，对数据进行排序或从电子信号中过滤掉噪音都是非常有效的方法。
A t its most fundamental, computer science is about the search for better algorithms - more efficient ways for computers to do things like sort data or filter noise out of digital signals.
您不仅能够按名称进程ID排序，还能够按起动时间排序，如果需要了解计算机上程序的启动顺序这一点可能很有用。
You can sort the processes not only by name and process ID, but also by startup time, which can be very useful if you need to understand the sequence in which programs are started on your computer.
如果每个列表Li由自已排序，那么内存内的排序操作(从存储和计算的角度)可以变得很有效。
The in-memory sort operation can be made effective (from storage and computation standpoints) under the fact that each list li is ordered by itself.
EmadOmara的并行合并排序算法假设了在排序操作的过程中(操作者)对计算机的所有CPU具有完全的访问权限。
Emad Omara's parallel merge sort algorithm assumes that you will have full access to the machine's CPUs for the duration of the sorting operation.
本文列出的十大拥挤都市是通过根据土地面积和人口统计数字(来自美国人口普查局)计算后排序的结果。
Here, the 10 most crowded cities in the United States, based on land area measurements and population statistics from the United States Census Bureau.
该作业计算在最近6 个月的时间里，一般或高优先级订单中通过邮寄或海运发货的行项目的数量，并将这些数量按订单优先级排序。
The job counts the number of line items shipped by mail or sea within the last six months that are part of normal or high-priority orders, and breaks the counts down by order priority.
在网络信息检索中，基于文档向量空间的分类、聚类、排序与相关性反馈需要计算相似度。
In network information retrieval, based on document vector space, class, cluster, ranking and relevance feedback need to compute similarity.
以某车右侧围为例，对拼装时间的计算方法和拼装过程的排序进行了说明。
With the right side panel of a car as the example, calculation method and sort of assembling process are explained.
证明判断矩阵一致性的一个充要条件，并根据此充要条件，提出一种直接进行排序权向量计算的方。
On the basis of the condition, this thesis puts forward a direct calculation method of weight vector in ranking.
基因组翻转排序目的是计算两个基因组之间的最少翻转次数，最少翻转次数称为两个基因组之间的翻转距离。
The genome reversal sorting aims at calculating the least reversal sorting times between genomes, which is called the reversal distance between genomes.
计算依据列表与排序依据列表不匹配。
计算机将这些“连接点”排序并希望获得与原先是时间的连续信号十分相似的信号(因此我们将该信号称为代表信号)。
The computer then sort of "connects the dots" and, hopefully, gives you something that looks similar to the real-world signal (that's why we say it represents the signal).
计算机将这些“连接点”排序并希望获得与原先是时间的连续信号十分相似的信号(因此我们将该信号称为代表信号)。
The computer then sort of "connects the dots" and, hopefully, gives you something that looks similar to the real-world signal (that's why we say it represents the signal).
应用推荐