二叉树平面坐标网及其应用

二叉树平面坐标网、平面坐标网二叉树的定义及其基本定理在本文给出。利用该平面坐标网二叉树，把平面中的网络点一一映射到一个整数集合上，从而可以把平面中的任意点近似地映射为一个整数，而且可以任意精确，对任意平面图形图象的处理、储存和传输起着极其重要的作用。本文给出的应用例子是二维实体的近似表示、储存、处理和打打印。     

基于二叉树的平面实体树生成算法及其应用

本文给出的平面实体树生成算法和凸壳生成算法是基于二叉树表示的平面图形处理基本算法,可广泛用于平面布局、平面图形识别、平面矩形网格生成等和类不同的问题。     

由二叉树的遍历序列返回二叉树

概括出由前序、中序或中序、后序遍历结果还原二叉树的两种方法.     

A Network Flow Algorithm for Reconstructing Binary Images from Discrete X-rays

We present a new algorithm for reconstructing binary images from their projections along a small number of directions. Our algorithm performs a sequence of related reconstructions, each using only two projections. The algorithm makes extensive use of network flow algorithms for solving the two-projection subproblems. Our experimental results demonstrate that the algorithm can compute highly accurate reconstructions from a small number of projections, even in the presence of noise. Although the effectiveness of the algorithm is based on certain smoothness assumptions about the image, even tiny, non-smooth details are reconstructed exactly. The class of images for which the algorithm is most effective includes images of convex objects, but images of objects that contain holes or consist of multiple components can also be reconstructed very well. Kees Joost Batenburg received his PhD degree in Mathematics from the University of Leiden, The Netherlands, in 2006. He also holds a M.Sc. degree in Computer Science. From 2002 to 2006 he worked as a PhD student at CWI in Amsterdam and at the University of Leiden. He is currently a postdoctoral researcher at the Vision Lab of the University of Antwerp, Belgium. His research interests include theory and applications of discrete tomography, combinatorial optimization and natural computing (evolutionary algorithms, neural networks).     

A Network Flow Algorithm for Reconstructing Binary Images from Continuous X-rays

Tomography is a powerful technique to obtain accurate images of the interior of an object in a nondestructive way. Conventional reconstruction algorithms, such as filtered backprojection, require many projections to obtain high quality reconstructions. If the object of interest is known in advance to consist of only a few different materials, corresponding to known image intensities, the use of this prior knowledge in the reconstruction procedure can dramatically reduce the number of required projections. In previous work we proposed a network flow algorithm for reconstructing a binary image defined on a lattice from its projections. In this paper we propose a new algorithm for the reconstruction of binary images that do not have an intrinsic lattice structure and are defined on a continuous domain, from a small number of their projections. Our algorithm relies on the fact that the problem of reconstructing an image from only two projections can be formulated as a network flow problem in a graph. We derive this formulation for parallel beam and fan beam tomography and show how it can be used to compute binary reconstructions from more than two projections. Our algorithm is capable of computing high quality reconstructions from very few projections. We evaluate its performance on both simulated and real experimental projection data and compare it to other reconstruction algorithms.

Realization of a Binary Clocked Linear Tree and Its Use for Processing Texts in Natural Languages

An implementation and the functioning of a synchronized binary linear tree are described. A structure of the so-called time line is proposed; the structure is used at the discourse level to process semantic connections between elements of various sentences. The structure of a system that processes texts in natural languages is considered. It is assumed that a semiotic feedback can lead to an internal monologue and self-consciousness. Based on the synchronized linear tree, a realization of semiotic feedback is described. It is shown that a model of the above-mentioned internal monologue can be used to synthesize phrases in natural languages.     

Reconstructing a Minimum Spanning Tree after Deletion of Any Node

Abstract. Updating a minimum spanning tree (MST) is a basic problem for communication networks. In this paper we consider single node deletions in MSTs. Let G=(V,E) be an undirected graph with n nodes and m edges, and let T be the MST of G . For each node v in V , the node replacement for v is the minimum weight set of edges R(v) that connect the components of T-v . We present a sequential algorithm and a parallel algorithm that find R(v) for all V simultaneously. The sequential algorithm takes O(m log n) time, but only O(m α (m,n)) time when the edges of E are presorted by weight. The parallel algorithm takes O(log ² n) time using m processors on a CREW PRAM.     

Reconstructing a Minimum Spanning Tree after Deletion of Any Node

Abstract. Updating a minimum spanning tree (MST) is a basic problem for communication networks. In this paper we consider single node deletions in MSTs. Let G=(V,E) be an undirected graph with n nodes and m edges, and let T be the MST of G . For each node v in V , the node replacement for v is the minimum weight set of edges R(v) that connect the components of T-v . We present a sequential algorithm and a parallel algorithm that find R(v) for all V simultaneously. The sequential algorithm takes O(m log n) time, but only O(m α (m,n)) time when the edges of E are presorted by weight. The parallel algorithm takes O(log ² n) time using m processors on a CREW PRAM.     

二叉树顺序存储结构探讨

为了得到一种适合存储所有二叉树的高效顺序存储结构,基于树的双亲数组表示法的思想,提出一种二叉树的顺序存储结构,对比分析表明,它的适用面更广。     

Simulation of Complete Binary Tree Structures in a Faulty Flexible Hypercube

The Flexible Hypercube is a generalization of binary hypercube networks in that the number of nodes can be arbitrary in contrast to a strict power of 2. Restated, the Flexible Hypercube retains the connectivity and diameter properties of the corresponding hypercube. Although the embedding of complete binary trees in faulty hypercubes has received considerable attention, to our knowledge, no paper has demonstrated how to embed a complete binary tree in a faulty Flexible Hypercube. Therefore, this investigation presents a novel algorithm to facilitate the embedding job when the Flexible Hypercube contains faulty nodes. Of particular concern are the network structures of the Flexible Hypercube that balance the load before as well as after faults start to degrade the performance of the Flexible Hypercube. Furthermore, to obtain the replaceable node of the faulty node, 2-expansion is permitted such that up to (n – 2) faults can be tolerated with congestion 1, dilation 4 and load 1. That is, (n – 1) is the dimension of a Flexible Hypercube. Results presented herein demonstrate that embedding methods are optimized.     

表达式与二叉树的相互转换

数学表达式、栈的操作、二又树的遍历,这几个概念在数据结构的教材中是不可缺少的。数学表达式求值是程序设计语言编译中的一个最基本问题,也是栈应用的一个典型例子,用它来研制出各种类型的电子计算器（前缀计算器、中缀计算器（常见的计算器）、后缀计算器）。在数据结构中没有解决表达式与二又树之间的相互转换关系,也就是说不能由一种表达式迅速地得到另外的两种表达式,也就难于解决其他两种计算器的研制过程。本文旨在研究表达式与二叉树间的相互转换关系,便于由一种表达式（或表达式树）迅速求出其他的表达式,再通过栈的应用（操作）研制出三种不同的计算器（栈的应用在数据结构的教材中都有,在此文中不予介绍）。     

用可视化法建立二叉树实例

提出用可视化法建立二叉树实例的概念,并借用满二叉树顺序存储的特殊性来实现可视化,解决了该方法实现时所碰到的一些问题。     

二叉树模型在工程图纸管理中的应用

将二叉树模型引入工程图纸管理,提出了图纸层次关系的二叉树模型,在此基础开发了工程图纸管理软件系统,从而可实现图纸的有效管理。     

平衡排序二叉树的C 算法实现

此文讨论平衡排序二叉树的实现算法,重点解决平衡排序二叉树在插入、删除结点时的平衡化问题,可作为演练教学之用也具有实用价值.     

自根向下压缩的二叉排序证书吊销树方案

在二叉排序证书吊销树的基础上,利用了树中的叶子结点的空链域,在已有的树结构中毋需增加结点,就可建立一种新的线性表结构。树中结点信息采用“自根向下”压缩方法,将整个树的信息汇集到叶结点中,可信中心签名线性表最后一个结点。在该CRT方案中,树结点发生变化后,毋需重新建立树,降低了维护代价,减少了名录服务器至查询者的通信代价。     

改进的BT—SVM应用于电力系统SSA

随着电力系统的广泛发展,电力系统静态安全评估已变得越来越重要。文中比较了现在几种常用的人工智能方法,选择了支持向量机算法解决这一问题。由于解决大样本问题时,支持向量机所需训练时间显著增加,文中提出了约简样本的方法,并结合适合于电力系统的二叉树结构,提出了一种改进的简化二叉树支持向量机算法。将这种新的支持向量机算法应用于IEEE57节点电力系统,结果表明,文中提出的算法取得了比较好的结果,有效可行。     

DNA计算机中二叉树存储结构分析

DNA计算机是未来计算机发展的重要方向,其优势十分明显,本文以顺序二叉树为思路的双链DNA分子法为例,介绍的是DNA计算机存储结构的基本理论和具体操作方式。     

二叉树算法在单总线技术中的应用

介绍了单总线技术和二叉树算法。单总线技术可以将地址线、数据线和控制线合成一根线，并允许在这根线上挂接多个单总线器件。提出了用二叉树算法搜索单总线器件注册码，并给出了软件设计的ROM指令和器件注册码的搜索算法，同时给出了软件流程描述。实践证明：此算法得到了很好的应用，实现了在线检测器件的注册码，该算法适用于任何具有1-Wire接口特性单总线器件。