树的

The principle of large event tree/small fault tree approach, the gist and rule for small event classification, and the establishing rule and modularization of large event tree are introduced.

介绍了大事件树／小故障树方法的原理、小事件的划分依据和规则、大事件树的建立规则以及大事件树的模块化方法等。

ERRY GILLIAM: Trees, I became obsessed with trees, and the textures of trees.

G：树！我对那些树和树的质地着迷。

Plant tall, thick trail of tea, fat shoots, leaf quality of soft, tender and strong hold, and dried mm long and dense, with natural fragrance, containing tea polyphenols, amino acids, is rich in pectin and other ingredients, natural growth of trees as high as 6 to 9 meters, semi-open树姿, than the thin branches.

植株高大，茶树径粗，芽叶肥壮，叶质柔软，持嫩性强，茸毫长而密，具有天然的清香，内含茶多酚、氨基酸、果胶等成份十分丰富，自然生长树高达6~9米，树姿半张开，分枝较稀。

Water from the roots at the bottom of the plant. But root pressure is not nearly

如果水不是被泵到高树的树顶，也不是被推到树顶，那麼我们会

The traditional query tree optimization methods,parallel database optimization methods based on left linear trees and right linear trees,bushy trees,and operation of the forest,have their own pros and cons,they have been more in-depth and maturity of the study.The query optimization method based on multiple weighted tree has studied its model of parallel query plan,its complexity model of parallel query plan and query optimization algorithms.The semantic query method transforms an inquiry into one or several semantic equivalence inquiries then has to find and implement a strategy to achieve a better query.Agent-based parallel database query optimization using Multi-Agent technology to automatically search the integrity constraint conditions which are related to the determined query,there for,the efficiency between several relations' joins has been greatly improved.The parallel optimization algorithm,based on genetic algorithm which is suitable for multi-joins of cluster environment,has deeply studied the relations storage options,multi-joins query optimization and query processing and other key technologies based on cluster parallel database.

传统的查询树优化方法，即基于左线性树、右线性树、浓密树、操作森林的并行数据库查询优化方法，各有优劣，对其的研究比较深入、成熟；基于多重加权树的查询优化方法，研究了其并行查询计划模型、并行查询计划的复杂性模型和查询优化算法；语义查询优化方法将一个查询变换成一个或数个语义等价的查询，进而寻找并执行这些等价查询中具有较好实现策略的一个；基于Agent的并行数据库查询优化采用Multi-Agent技术自动查找与给定查询有关的完整性约束条件，使得多个关系间连接操作的效率得到很大的提高；基于遗传算法的并行优化算法，深入研究了基于机群并行数据库中关系存储的选择、多连接查询优化和查询处理等关键技术。

It was concluded that Glomus mosseae inoculation improved the drought resistance of Broussonetia papyrifera Vent, especially in moderate stressed conditions. And the contribution of AM symbiosis to plant to avoid the stress or to increase its tolerance might be the result of modification of root morphology and fractal character.

由此作者认为，接种G.mosseae在不同土壤水分条件下促进了构树幼苗的生物量积累，这种促进作用在土壤干旱条件下尤为明显，表明AM菌根真菌G.mosseae提高了宿主构树的抗旱性；G.mosseae对宿主构树抗旱性的提高与G.mosseae对构树根系形态特征、分形特征的改变密切相关。

Nowadays most of researches on the multicast routing are how to generate multicast tree. In case of multicast tree failure, there need to re-route all of nodes behind the failure point so much as re-build the whole tree, this will deteriorate Quality-of-Service, on the other hand, it is insufferable in some multicast applications. We proposed a Fault-Tolerant multicast scheme to resolve this problem. Our scheme creates backup paths crosswise in the ramose node. It can reduce additional cost greatly and recover the failure of multicast tree rapidly.

现在关于多播路由的研究大多着眼于多播树的生成，一旦多播树出现故障，就需要对故障点以下的所有多播接收节点进行重新路由甚至对整个多播树进行重新构造，这一方面降低了服务质量，另一方面有些多播应用不允许长时间的中断，对此本文提出了一种多播容错方案，采用在分枝节点之间建立备份路径的措施，可以在很大程度上减少额外的代价，能够在最快的时间内恢复多播树的故障，并使得恢复后的多播树形状基本上没有改变。

Nowadays most of researches on the multicast routing are how to generate multicast tree. In case of multicast tree failure, there need to re-route all of nodes behind the failure point so much as re-build the whole tree, this will deteriorate Quality-of-Service, on the other hand, it is insufferable in some multicast applications. We proposed a Fault-Tolerant multicast scheme to resolve this problem. Our scheme creates backup paths crosswise in the ramose node. It can reduce additional cost greatly and recover the failure of multicast tree rapidly.

现在关于多播路由的研究大多著眼于多播树的生成，一旦多播树出现故障，就需要对故障点以下的所有多播接收节点进行重新路由甚至对整个多播树进行重新构造，这一方面降低了服务质量，另一方面有些多播应用不允许长时间的中断，对此本文提出了一种多播容错方案，采用在分枝节点之间建立备份路径的措施，可以在很大程度上减少额外的代价，能够在最快的时间内恢复多播树的故障，并使得恢复后的多播树形状基本上没有改变。

This paper first gives an introduction to the AVL tree.Then the paper analyses the definition,properties and main operations of red-black trees.At last, this paper implements the operations of red-black trees in C,and compares the search time of binary search trees and red-black trees.

本文首先介绍了AVL树的定义及其主要操作，然后重点分析了红黑树的定义，特性和它的主要操作，并用C语言实现了红黑树的操作，对二叉查找树和红黑树的查找时间进行了实验对比。

This thesis discusses firstly the IGMP, describes the specification of the protocol and explains the differences between the three different versions of protocol. Then the RPF rule used by the router to forward multicast packets and the multicast forwarding tree are discussed. The process of building SPT and RPT is also illustrated. In this thesis, we also discuss the mechanism of Flooding and Pruning in Dense-Mode multicast routing protocol and the process of switch from RPT to SPT in Sparse-Mode routing protocol.

本论文讨论了实现IP组播的IGMP协议，对IGMP协议的协议规范进行了描述，并对IGMP三个版本的不同点作了详细说明；讨论了进行组播数据包进行转发的RPF基本原理、组播转发树的类型，并对SPT树和RPT树的建立过程进行了探讨；并分别对密集模式组播路由协议的扩散和剪枝机制、稀疏模式组播路由协议中的RPT树到SPT树的切换过程进行了详细的探讨。

Since historical times,England ,where the early inhabitants were Celts, has been conquered three times .

从有历史以来，英国，在此地早期居住的是凯尔特人，已经被征服了三次。

Bluetooth OBEX File Transfer Enables the sending and receiving of files on your phone via Bluetooth.

蓝牙OBEX文件移动允许经过蓝牙传送和接受文件。。。。