In this way, mapping of placement groups (and replicas) to storage devices does not rely on any metadata but instead on a pseudo-random mapping function.
这样一来，放置组(以及副本)到存储设备的映射就不用依赖任何元数据，而是依赖一个伪随机的映射函数。
Finally, the mapping of the placement group to object storage devices is a pseudo-random mapping using an algorithm called Controlled Replication Under Scalable Hashing (CRUSH).
最后，放置组到对象存储设备的映射是一个伪随机映射，使用一个叫做ControlledReplicationUnderScalable Hashing (CRUSH)的算法。
An outside source, whether it be a different user or developer, a separate thesaurus, or even a random fact found on someone else's web page, can express mapping information.
外部服务来源，不管它来是自一个不同的用户还是开发者，是来自一个不同的词典还是随机在互联网上发现的某个网页，都能解释映射信息。
If a fuzzy random event is described by the mapping on the measurable space, its measure value can be calculated by the basic formulations which have been set up.
若一个随机模糊事件由定义在可测空间上的映射刻划，则可把已建立的基本公式用于求该事件发生的测度值。
Due to the irreversibility of random hash mapping, current sketch data structures have to traverse the key address space to find frequent items.
由于随机哈希函数不可逆，目前的概要数据结构不得不遍历关键字地址空间以查找和估计频繁项集。
Such non-linear relation can not be worked out by formula, While BP network can simulate such non-linear relation for its random non-linear mapping ability.
利用神经网络的学习能力，BP网的任意非线性映射能力可以模拟这复杂的函数关系。
Google "accidentally" collected massive amounts of random personal data while its 1 roving vans were supposed to be mapping streets.
原本应该四处流动测图摄取街景图片的谷歌却“意外”地收集到了海量个人信息。
In this paper, we extend an important fixed point theorem for set-valued. A random fixed-point theorem for random set-valued semi-closed 1-set contraction mapping is obtained.
将集值半闭1 -集压缩映象的一个重要不动点定理随机化，得到随机集值半闭1 -集压缩映象的随机不动点定理。
In this paper, we extend an important fixed point theorem for set-valued. A random fixed-point theorem for random set-valued semi-closed 1-set contraction mapping is obtained.
将集值半闭1 -集压缩映象的一个重要不动点定理随机化，得到随机集值半闭1 -集压缩映象的随机不动点定理。
应用推荐