An efficient algorithm for estimating rotation distance between two binary trees

There are a number of ways of measuring the difference in shape between two rooted binary trees with the same number of leaves. Pallo (Computer Journal, 9, 171–175, 1986) introduced a left weight sequence, which is a sequence of positive integers, to characterize the structure of a binary tree. By applying the AVL tree transformation on binary trees, we develop an algorithm for the efficient transformation of the left weight sequences between two binary trees.     

Maximum speedup ratio curve (MSC) in parallel computing of the binary-tree-based drainage network

Restricted computational capacity has become a key factor in limiting the development of a majority of distributed basin models. Parallel computing is one of the most effective methods for solving this problem. Although many parallel-computing methods have been employed in basin models, few studies have carried out theoretical research on parallel characteristics of river basins. In this paper, the drainage network of river basins is treated as a binary-tree structure. Using the binary-tree theory, we find that there exists a maximum speedup curve (MSC) for an arbitrary drainage network. The x-coordinate of the MSC represents the number of processors used during the computing, while the y-coordinate corresponds to the maximum speedup ratio (MSR) that can be obtained. Under several essential assumptions, the theoretical function of MSC is established. The function indicates that the MSC consists of an ascending section and a horizontal section. A parallel algorithm capable of acquiring the MSC is proposed as well. Using this algorithm, the MSC is tested at two different-resolution drainage networks of the Lhasa River Basin. A 2-year rainfall-runoff process is simulated. The results prove the existence of MSC. However, primarily influenced by the load imbalance of subbasins, the simulation values of MSR are usually smaller than the theoretical ones.     

Using structured steiner trees for hierarchical global routing

The Steiner problem in a hierarchical graph model, the structured graph, is defined. The problem finds applications to hierarchical global routing. Properties of minimum-cost Steiner trees in structured graphs are investigated. A “top-down” approximate solution to the Steiner problem in structured graphs, called a top-down Steiner tree, is defined, and an algorithm is given to compute such solution. The top-down Steiner tree provides also an approximate solution to the Steiner problem in graphs admitting a structured representation. The properties of such solution are discussed and some experimental results on the quality of the approximation are presented. A reduction in time complexity is demonstrated with respect to both exact and heuristic algorithms applied to such graphs.     

Comparison of Skidding Performance of Small Track-type Experimental Prototype Skidder and J-50 Skidding Tractor

In this paper, field experimental comparison is made between a small track-type experimental prototype skidder and a J-50 skidding tractor. Experimental data, including skidding productivity, soil compaction on skidding trails, and damage rate of the residual trees, are analyzed. The results indicate that with the condition of scattered skidding area and low skidding volume per cycle, small track-type experimental prototype skidder has advantage on working and a higher skidding productivity. It makes lower soil compaction to the skidding trails in the depth of 0-5 cm, 5-10 cm, and 10-15 cm. Under the same work conditions, the damage rate of the residual trees made by small track-type experimental prototype skidder is only 1/5 of those made by J-50 type skidding tractor. The damage rate is reduced by 80%.     

基于BDD算法的系统安全性分析

随着现代武器系统越来越趋于大型化和复杂化,采用事故树方法进行系统安全性分析的难点问题也日益突出,本文研究了基于BDD的FTA优化求解算法,并采用此方法对某系统进行了相关安全性分析。     

线性可分结构系对二进神经元的覆盖问题

二进神经网络中每个二进神经元等价于一个线性可分函数,但每个二进神经元所表达的线性可分函数的逻辑意义仍不完全清楚。对此,首先分析了已有的几种线性可分结构系;其次,讨论了其是否覆盖了所有的二进神经元;最后,指出阈值在某些范围内二进神经元所对应的线性可分函数的逻辑意义仍不清楚,这为进一步完善二进神经元的覆盖问题指明了方向。     

集合特征码及相关算法研究

在传统的集合运算过程中,集合内的元素一般通过自然语言表示,而不是形式化表示,这就在计算机处理时影响了集合运算的效率。为了解决这个问题,将二进制引入到集合运算过程中,提出集合特征码的概念,并定义了一系列的集合特征码运算规则,从而形成了一个较为完备的、形式化的集合特征码运算体系。在上述集合特征码的理论体系下,提出一系列的相关算法,从而在算法的层次上实现了集合特征码的理论体系。实验结果表明,通过集合特征码理论及相关算法,集合运算可以通过0、1运算快速实现,并且其成功实现了数据库中的查询操作。     

Study on high performance ice slurry formed by cooling emulsion in ice storage (discussion on adaptability of emulsion to thermal storage material)

This study focuses on an emulsion as a new thermal storage material for ice storage. Two types of emulsions were formed using an oil–water mixture with a small amount of additive. A silicone, light and lump oils were used. The water contents of the emulsions were 70, 80 and 90%. The additive was an amino group modified silicone oil. No depression of freezing point was observed for the emulsions because of their hydrophobic properties. In order to determine the structure of the emulsions, their electrical resistances were measured. Moreover, components of the liquids separating from the emulsions were analyzed. The results indicated that one emulsion was a W/O type emulsion, while the other was an O/W type. Finally, adaptability of the two emulsions to ice storage was discussed, it was concluded that a high performance ice slurry could be formed by the W/O type emulsion.     

一种基于量化改动的二值图像水印改进方法

在基于单位块内黑白像素比率的二值图像水印算法的基础上。提出了一种改进的量化水印方案。算法在以合适的量化步长保证水印嵌入的稳健性，并大大提高了可嵌入水印的有效块数，同时使得水印改动的像素个数在一个量化步长以内，从而使得水印系统的容量、稳健性以及视觉失真等指标达到一个有效的折中。另外执行算法时无须记录水印嵌入的位置信息，保证了盲提取的要求。实验结果证明了这种用于二值图像水印算法的有效性和改进性。