查询词典 number of partitions

To create a new partition, type a destination partition one greater than the existing number of partitions, if there is enough free space.

若要创建新的分区，如果有足够大的可用空间，则键入一个比现有分区大1的目标分区。

The Apple partition can describe any number of partitions, and the data structures are in consecutive sectors of the disk.

苹果分区可以描述任何的分区编号，而且数据结构位于硬盘上连续的扇区。

The second phrase of TPSI optimizes the number of partitions for each rule in neuro-fuzzy system.

第二个阶段优化神经模糊系统每条规则的前件划分。

The partition data structures are laid out in consecutive sectors, and each map entry has a value for the total number of partitions.

分区数据结构分布在连续的扇区，且每条记录都有一个分区总数的值。

Because Windows must be loaded at startup in each division, with the increase in the number of partitions, the time to complete this total will continue to grow.

因为Windows 在启动时必须装载每个分区，随着分区数量的增多，完成此操作的时间总量也会不断增长。

The data structures are all located in one place, and the maximum number of partitions is based on how the disk was originally partitioned.

数据结构都位于一个位置，最大分区数取决于最初磁盘是如何分区的。

When building trees to price options, we often increase the number of partitions per day, n , to improve accuracy. But increasing n often lowers efficiency.

中文摘要建立树状模型评价选择权时，我们通常以增加一日的切割数，n，来增进评价的正确性，但增加 n 的同时也降低了评价的效率性。

As the name suggests, the Long House develops length ways, and is divided into two main parts: the first being a long and large "common room", and the second comprising a number of partitions, each hosting a family nucleus.

屋子可以被分为两部分：第一部分是一间长度可观又非常宽敞的"公共房间"，第二部分是被划分为小的隔间，每个家庭住一间。

On clustering the data space into a number of partitions, LBD extracts a distance and a simple bitmap representation called Bit Codefor each point in the database with respect to the corresponding reference point.

位码字符串比较时，按照维度贡献优先顺序，大大加快非候选点过滤。LBD利用特殊的B+树组织，降低I/O和距离计算代价。采用模拟数据和真实数据，实验验证了LBD具有更高的检索效率。

Partition search follows this strategy: construct a data structure for quick search and location, and divide the (K-1)th frequency itemset sequence into a number of continuous partitions to obtain a number of disjoint sub-sets of (K-1)th order frequency itemset.

分区查找基于以下策略：建立一种可快速搜索定位的数据结构，将频繁(K-1)-项集序列划分为若干连续的分区，形成(K-1)阶频繁项目集的若干不相交的子集。

The split between the two groups can hardly be papered over.

这两个团体间的分歧难以掩饰。

This approach not only encourages a greater number of responses, but minimizes the likelihood of stale groupthink.

这种做法不仅鼓励了更多的反应，而且减少跟风的可能性。