基于多分支树结构的电力缴费终端数据完整性验证方案

针对电力缴费终端存在管理人员操作不当和黑客攻击等行为导致数据损坏和丢失等问题,设计了一种基于多分支哈希树结构的数据完整性防护验证方法。该方法利用基于双线性映射的签名机制和多分支树结构的特性,通过使用随机掩码技术对分块的数据进行随机化处理,以确保数据的隐私性,采用多分支树形结构实现对数据块的快速认证和快速签名,并利用哈希树节点的哈希值验证数据块的完整性,引入验证服务器对数据分块进行批量验证和证据计算,并通过设置备份服务器完成对存储数据的备份处理。实验结果表明,该方案可以有效提高对存储数据完整性的批量检测效率,并降低终端和主服务器的计算开销,同时具有较小的计算开销和较高的安全性。     

双通道网络磁盘阵列存储系统的扩展性

从扩展性的角度出发，论述了网络磁盘阵列存储系统的硬件扩展性与软件扩展性。介绍了网络磁盘阵列存储系统在硬件结构上的三种扩展方式－组内扩展、组间扩展和串内级联，并对系统扩展后的数据分块方式展开了讨论。根据数据有无分块、有无校验冗余，得出系统内部数据分块方式的划分类型，指出不同数据分块方式的优点及其应用类型。最后，讨论了相关的数据管理问题。     

基于二叉树的族谱生成系统的设计与实现

针对历史较长的家族数据量大,普通书籍方法查阅起来困难的问题,设计一款基于二叉树的族谱自动生成管理系统,系统主要利用计算机数据结构中的二叉树,对家族的族谱进行生成及实现管理功能。实验证明,系统能有效实现族谱的自动生成,具有一定的应用性。     

Nearest neighbor search algorithm for GBD tree spatial data structure

This paper describes the nearest neighbor (NN) search algorithm on the GBD(generalized BD) tree. The GBD tree is a spatial data structure suitable for two-or three-dimensional data and has good performance characteristics with respect to the dynamic data environment. On GIS and CAD systems, the R-tree and its successors have been used. In addition, the NN search algorithm is also proposed in an attempt to obtain good performance from the R-tree. On the other hand, the GBD tree is superior to the R-tree with respect to exact match retrieval, because the GBD tree has auxiliary data that uniquely determines the position of the object in the structure. The proposed NN search algorithm depends on the property of the GBD tree described above. The NN search algorithm on the GBD tree was studied and the performance thereof was evaluated through experiments.     

Nearest neighbor search algorithm forGBD tree spatial data structure

： This paper describes the nearest neighbor （NN） search algorithm on the GBD（generalized BD） tree. The GBD tree is a spatial data structure suitable for two- or three-dimensional data and has good performance characteristics with respect to the dynamic data environment. On GIS and CAD systems, the R-tree and its-successors have been used. In addition, the NN search algorithm is also proposed in an attempt to obtain good performance from the R-tree. On the other hand, the GBD tree is superior to the R-tree with respect to exact match retrieval, because the GBD tree has auxiliary data that uniquely determines the position of the object in the structure. The proposed NN search algorithm depends on the property of the GBD tree described above. The NN search algorithm on the GBD tree was studied and the performance thereof was evaluated through experiments.     

Design and implementation of binary tree data structure based on DNA computing

The designing,encodings and an instance of simulation of a binary tree for DNA computer were proposed,which utilizes the method of biology to complete inserting and deleting of the binary tree. Firstly,DNA encodings for storage and all elements of the binary tree were completely given out. Then, the implementations of all biooperations in DNA computer were described. Finally, to prove the feasibility of this method, an actual binary tree with detailed nucleotide encodings was introduced. The process of an algorithm implemented on this binary tree was demonstrated. Based on this method, more other data structures in DNA computer can be developed.     

立体二叉树在排序中的应用

提出了立体二叉树的数据结构,对立体二叉树的基本概念进行了讨论;对满立体二叉树结构的结点分布与结点编码之和问题进行了研究并给出了有关的公式;最后探讨了立体二叉树在排序中的应用,提出立体堆的排序方法,并对它的算法实现进行设计与分析,得出了立体堆排序方法在最坏情况下的时间复杂性,从而减少了堆排序方法的时间复杂性的常数因子．     

Design and implementation of binary tree data structure based on DNA computing

The designing,encodings and an instance of simulation of a binary tree for DNA computer were proposed,which utilizes the method of biology to complete inserting and deleting of the binary tree. Firstly,DNA encodings for storage and all elements of the binary tree were completely given out. Then, the implementations of all bio-operations in DNA computer were described. Finally, to prove the feasibility of this method, an actual binary tree with detailed nucleotide encodings was introduced. The process of an ...     

产品数据管理中的产品结构树的设计方法

产品数据管理 (PDM)技术由于具有帮助企业管理与控制企业数据并缩短产品上市时间的强大功能而受到国外大中型制造企业的广泛重视和应用。针对传统的线形模式组织数据 ,提出以产品结构为核心的产品结构树方法组织数据以及实现的方法。     

铁矿球团有机粘结剂的分子构型及选择判据

为开发有效的铁矿球团有机粘结剂 ,需要建立系统的粘结剂结构与性能关系理论 .为此 ,提出了理想的有机粘结剂分子构型 (X—P—K) .通过实例 ,计算了极性基团COO- 及亲水基团O- 的电负性 ,初步确定了极性基团及亲水基团的选择判据 ;对粘结剂有机链架结构与性能的关系进行了定性分析 ,认为选择环形网状结构的链架较为理想 .根据分子结构的理想模型及选择判据 ,研制合成了新型粘结剂S 1 .造球试验结果表明 ,此粘结剂性能优良 ,干球强度为 32 2 .8N 个 ,落下强度为 1 6 .8m 次 ,生球爆裂温度为 82 0℃ ,克服了有机粘结剂热稳定性差的缺陷 .