因此，本文从一个全新的角度来研究规则表优化问题——优化过滤域排序。
So we try to solve the problem from a fire-new perspective—filtering fields.
这样将创建一个直观的链接重排序，并留下空间用于作用域的进一步修改。
This creates a straightforward reordering of the links, with room for further modification of the scores.
清单7是一个简单的程序，它从数据库中读出数据的内容，并将其打印到屏幕上，在打印时对name域进行排序。
Listing 7 is a simple program to read and print out the contents of the database, sorted by the name field.
编程基础（变量，数据类型，引用，指针，作用域，错误处理，迭代，核心算法-搜索，排序等）
The basics of Programming (variables, data types, references, pointers, scope, error handling, iteration, core algorithms - searching, sorting, etc.)
从日志文件可以看出，用户对why.html页面的请求比较频繁，但是如果您认为how.html 对于用户更为重要，那么只需修改相应的作用域值对排序做出纠正。
Users may more frequently request the why.html page according to the log files, but if you know it's more important they know the how.html, simply provide corresponding scores for correct sorting.
前三个域名称以及Headline 域按照升序进行排序，即从1到4。
The first three field names plus the Headline field are set to sort in ascending order, in that order (1 through 4).
排序一组对象的标准通常由域的名称形成，同时指出是升序还是降序。
The criteria to sort an array of objects is usually formed by the name of the fields, and an indication of ascending or descending order (like an SQL "order by" clause).
以图像的布朗维数为纹理特征对编码中的图像块进行聚类和排序，实现了对每个值域块所需比较定义域块数目的精确控制。
Taking the Brownian dimension as their texture feature, image blocks were clustered and sorted, to control the number of domain blocks to be compared with each range block in coding.
通过对可靠度相关参量的分析，根据软件在进行分域测试时的特点给出一种新的排序方法。
After the analysis of the parameters relate to reliability, a new way of ordering is given according to the characteristics of partition testing.
文中用作者提出的通用前馈网络和排序学习算法，提出了一种设计具有期望容错域的前向掩蔽联想记忆模型的方法。
A design method of ahead masking associative memory model with expecting fault-tolerant field is proposed by use of the general feed-forward network and sequential learning algorithm given by authors.
帮助文档对这个例子的解释明确告诉咱们：这三个命令是等价的，第一个指定域忽略前导空白，第二个指定域按数值排序；
These three commands have equivalent effect. The first specifies that the first key's start position ignores leading blanks and the second key is sorted numerically.
仿真实验结果表明，与传统的相关性排序算法相比，该算法可以提高网页搜索中简短网页域的相关性排序性能。
Simulation experimental results show this algorithm can significantly outperform the traditional algorithms for relevance ranking on short Web fields, especially for very short fields.
仿真实验结果表明，与传统的相关性排序算法相比，该算法可以提高网页搜索中简短网页域的相关性排序性能。
Simulation experimental results show this algorithm can significantly outperform the traditional algorithms for relevance ranking on short Web fields, especially for very short fields.
应用推荐