完全二叉树

完全二叉树模型中元素的CB秩

The CB Rank of the Elements in Complete Binary Trees

基于该结构给出CPU上的BVH构建算法，算法在保证较低复杂度的情况下，将节点构建成完全二叉树。

Based on this data structure , the BVH construction algorithm on CPU is given , with a relatively low complexity .

完全二叉树的一阶理论已被证明具有量词消去的性质，进而计算了完全二叉树模型中元素的CB秩。

The first-order theory of a complete binary tree is decidable by the quantifier elimination , we also know the CB rank of elements of a complete binary tree .

完全二叉树理论的模型及性质

The models and properties of the theory of complete binary tree

完全二叉树的实时判别方法

A simple and convenient method to judge a fully binary tree

顺序二叉树和右（左）完全二叉树的一些性质

Some Characters About Serial Binary Trees and Right ( Left ) Complete Binary Trees

完全二叉树的量词消去

Quantifier Elimination for Complete Binary Trees

最大值堆的枚举生成是将数值映射到结构固定的完全二叉树上。

The generation of max heap is to put values to the structure of fixed complete binary tree .

完全二叉树的概念是计算机科学理论中的重要概念之一。

The conception of complete binary tree is one of the important con-ceptions of the theories of computer science .

文中结合完全二叉树结构，提出了一种新的基于身份的群密钥协商协议。

Combined with complete binary tree architecture , a new identity-based group key agreement protocol is proposed in this paper .

然后，基于树型结构的密钥管理方案，提出了一种基于完全二叉树密钥图的组播密钥管理方案。可扩展分布式安全多播密钥管理协议研究

This scheme combing the advantages of centralized and distributed key management schemes . Research on Scalable Distributed Key Management Protocol for Secure Multicast Groups

根据二叉树的层次遍历原则，设计了一种在遍历二叉树的过程中实时判别完全二叉树的简便方法。

On the basis of the rule of traversing binary tree , a simple and convenient method to judge a fully binary tree is proposed .

本文在构造具有方向导向性的完全二叉树的基础上，提出了一种适合研究蛋白质构象的格子模型快速穷举搜索算法。

This paper presents a fast exhaustive search algorithm in order to search the protein conformation space based on the lattice model by constructing a directional binary tree .

该方案使用服务组的概念将组播用户划分开来，并使用论文提出的基于完全二叉树密钥图的单资源密钥管理方案来更新服务组里的单资源密钥。

This scheme adapts service group to classify group members and uses complete binary tree scheme to update the key that encrypt single data stream in service group .

树型结构是一类非常重要的非线性结构，特别是完全二叉树结构本身的特点，在程序设计中有着广泛的应用。

The tree structure is a kind of extremely important non-linear structure , specially completely two forks trees structure itself characteristic , has the widespread application in the programming .

观测获得环境中许多空间点的4维坐标数据，并采用完全二叉树结构进行存储后，就获得该区域的4维环境地图。

After sampling 4-D coordinate data of points in environment , and storing as a fully binary tree structure , a 4-D environmental map is attained for a environment region .

本文还证明了同结点数的顺序二叉树与右（左）完全二叉树两者的结点高度总和相等。

Moreover , this paper proves that , both of serial binary trees and right ( left ) complete trees have the same total height of nodes , if they have the same number of nodes .

定义了完全二叉树理论的决定公式.利用该类公式证明了此理论是原子理论，且型的个数是可数的。

The determinant formulas of the theory of complete binary tree are defined and used in this paper to prove that the number of the types of this theory is countable and the theory is atomic .