The ultimate refinement of advanced-generation selection is the development of indices which optimize the relative weighting of half-sib full-sib and individual tree performance.
下一代最后的精选，就是制定适合于全同胞、半同胞和单株表现的相对权重的指数。
One such image features a tree: the High Performance Tree.
比如一张描绘了一棵树的图片：高绩效树。
The tree is organized by performance objects, denoted by folder ICONS, and performance counters, denoted by stop-watch ICONS.
该树是由文件夹图标所标识的性能对象和秒表图标标识的性能计数器组织成的。
Only those nodes that are expanded by the user will be fetched from the server, which can result in better performance of the tree.
服务器只获取那些由用户展开的节点，这可以优化树的性能。
And the fruits of our tree, our indicators of high performance were as follows.
我们这棵树的果实，我们表现卓越的标志如下。
You can tell when the tree has taken hold. It’s when the team talks about the tree as a metaphor for themselves and their chosen pathway to high performance
当团队把这棵树比作他们自己，比作他们选择的通往高绩效的途径时，你就知道这棵树已经落地生根了
With HResult the execution mode can combine MDX and XML in a single run tree, allowing for much higher flexibility and query performance.
通过 HResult，执行模式可以在单个运行树中结合MDX和XML，实现更高的灵活性和查询性能。
The performance comparison was to index all of the PHP test scripts (*.phpt files) under the PHP 5.3 source tree.
性能比较所执行的是对PHP 5.3源树下的所有 PHP测试脚本（*.phpt文件）进行索引。
So, they might circle "Consensus-Driven" on the High Performance Tree and write themselves a reminder that doing this well means hearing a lot of ideas first.
因此，也许他们会在高绩效树的“共识驱动”上画个圈，并写下一个提示：要做好共识驱动，就要聆听众多想法。
The data structure used is a red-black tree, which is ideal for performance-focused applications (and happens to be available generically as a library within the kernel).
这个数据结构是一个“红-黑”树，对于注重性能的应用程序很理想(且恰好作为内核中的一个库普遍可用)。
In order to deal with the significant digits addition we designed three inputs adder tree, and give a simple performance discuss of this method.
针对有效数相加问题，本文提出了三输入加法树的设计方法，并就其性能作了简要的分析。
Multivalue BIOS may result in inducing wrong knowledge from data set, and consequently result in the decline of the performance of decision tree.
多值偏向可能导致从数据集中归纳出错误的知识，使决策树的性能下降。
Results indicate that the performance of the metric-based decision tree is some better than that of the conventional decision tree.
试验结果表明，基于度量的决策树的性能优于传统的决策树。
Then a special Vector Quantization, called Wavelet Tree Vector Quantization (WTVQ), is designed to compress the every spectral image data, and a higher compression performance is obtained.
采用特殊矢量量化编码，叫作小波树矢量量化(WTVQ)编码对每个谱象数据进行压缩，获得较高的压缩性能。
The second one is multicast routing algorithm based on Clone Selection algorithm, Clone Selection algorithm is a global optimization algorithm and can improve the performance of multicast tree.
第二种是基于免疫克隆选择算法的组播路由算法，该算法利用了免疫克隆选择算法全局搜索能力，提高组播树的性能。
The timing requirements for PE structure and the adder array for adder tree structure to optimize performance of design are studied and used.
研究了并利用PE(处理单元)结构时序约束和加法树结构的加法阵列优化设计性能。
To improve the performance of multicast tree, a rearrangement dynamical multicast routing based on Clone Selection is proposed.
为了改善组播树的性能，本章提出了基于免疫克隆选择的重构动态组播路由算法。
To improve query performance of distributed system, a conjunction data distribution tree is proposed by studying relation between data.
为了提高分布式系统的查询性能，通过研究数据之间的关系，提出一个关联数据分布树。
It decomposed the reliability function of complex system and mapped to performance index. Then, the performance index mapped to components and constructed tree modeling in turn.
它将复杂系统可靠性功能分解并映射到性能指标上，再将性能指标映射到部件上，依次构成树状模型。
In designing synchronous digital integrated circuits, the design of clock tree is an important component, which may greatly affect the performance and reliability of the system.
时钟树的设计是同步数字集成电路设计中的一个重要部分，对系统的性能和可靠性有很大影响。
Compared with recursive algorithm for binary tree traversing, non-recursive algorithm reduces expenses of function calls, gains performance advantage.
二叉树遍历的非递归算法相对于递归算法，减少了函数调用等开销，具有性能优势。
The results of experiment demonstrate that the SVM decision tree built up by this method has a good classification performance.
实验结果表明，这种方法构造的SVM决策树分类器分类性能较好。
Dynamic Fault Tree (DFT) method can describe the dynamic performance of satellite system. The processes of modeling are easy, and the structure of model is clear. So, DFT is used widely.
动态故障树(DFT)方法能够描述卫星系统的动态性能，建模过程简单，模型结构清晰，因而运用广泛。
Site tests showed that the PAMAM of tree molecules is a kind of demulsifier with excellent performance for dense oil-polluted water.
现场试验表明，PAMAM树形分子是一类性能优良的稠油原油污水破乳剂。
The performance of this approach strongly depends on the appropriate partition of the tree and the selection of proxies.
这种方法的性能依赖于对组播树适当的划分和代理的位置。
A modification of NB tree based on PCA theory is proposed in this paper. Experiment shows that the search performance can be further improved by...
本文运用PCA原理改进了一种理想的内存索引方法nb树，经过改进以后其检索性能得到进一步提高。
The catalog tree of the system keeps synchronized with the database at the cost of performance.
由于要与数据库保持同步，系统目录树的生成成为项目瓶颈之一。
Compared with grid and R-tree, the index has slightly space costs but most higher index performance.
与网格索引和R树索引相比，该索引以略大的空间开销换取了更高的查找性能。
Compared with grid and R-tree, the index has slightly space costs but most higher index performance.
与网格索引和R树索引相比，该索引以略大的空间开销换取了更高的查找性能。
应用推荐