Forest pruning based on Tree-Node Order

2011 ◽  
Author(s):  
Huaping Guo ◽  
Ming Fan ◽  
Yangdong Ye
Keyword(s):  
Tree Node

scholarly journals Constant-competitive tree node assignment

2014 ◽  
Vol 518 ◽  
pp. 10-21
Author(s):  
Yong Zhang ◽  
Francis Y.L. Chin ◽  
Hing-Fung Ting
Keyword(s):  
Tree Node

A Bidirectional Quintuple Tree Node Expansion Algorithm for UAV Path Planning in Dynamic Environment

2013 ◽  
Vol 765-767 ◽  
pp. 413-416
Author(s):  
Jian Hong Gong ◽  
Bo Li ◽  
Xiao Guang Gao
Keyword(s):  
Path Planning ◽  
Trajectory Planning ◽  
Dynamic Environment ◽  
Security Issues ◽  
Tree Node ◽  
Search Mechanism ◽  
Planning Algorithm ◽  
Path Planning Algorithm ◽  
Optimization Search ◽  
Uav Security

To deal with the problem of penetration trajectory planning for UAV security issues, an improved bidirectional quintuple tree node expansion algorithm is proposed. Compare to traditional quintuple tree node expansion algorithm, the proposed algorithm could reduce the number of the expanded tree node, and it makes the bidirectional quintuple tree node expansion algorithm more efficient in path planning. By combining the bidirectional quintuple tree node expansion algorithm with multi-step optimization search mechanism, a kind of real-time UAV path planning algorithm is presented.

Research on Fault Diagnosis Simulation Training Method Based on Fault Tree with Following Scenes

2013 ◽  
Vol 444-445 ◽  
pp. 1799-1803
Author(s):  
Jin Li ◽  
Xiao Wei Guan ◽  
Shi Bo Guo ◽  
Jian Hui Hou ◽  
Min Bai
Keyword(s):  
Fault Diagnosis ◽  
Simulation Training ◽  
Fault Tree ◽  
Fuzzy Reasoning ◽  
Training Sample ◽  
Assessment Method ◽  
Training Method ◽  
Tree Node ◽  
Complexity Problem ◽  
Proper Training

For resolving the obscurity and complexity problem of equipment fault diagnosis training, gave out a fault diagnosis simulation training method. Based on the fault tree theory, the method can create the training simulative scenes, by building up the mapping between the fault tree node and the simulative scenes node. With the training subject and complexity requirement, this method can control the randomness and complexity of the training sample, the simulative scenes also can improve the training effect. And the fuzzy reasoning result assessment method can give out the proper training mark.

scholarly journals Online tree node assignment with resource augmentation

2010 ◽  
Vol 22 (3) ◽  
pp. 359-377 ◽  
Author(s):  
Joseph Wun-Tat Chan ◽  
Francis Y. L. Chin ◽  
Hing-Fung Ting ◽  
Yong Zhang
Keyword(s):  
Resource Augmentation ◽  
Tree Node

An Image Authentication Scheme Using Merkle Tree Mechanisms

2019 ◽  
Vol 11 (7) ◽  
pp. 149
Author(s):  
Yi-Cheng Chen ◽  
Yueh-Peng Chou ◽  
Yung-Chen Chou
Keyword(s):  
Image Authentication ◽  
Image Features ◽  
Third Party ◽  
Merkle Tree ◽  
Verification Method ◽  
Integrity Verification ◽  
Tree Node ◽  
Image Tampering ◽  
Blockchain Technology ◽  
Image Integrity

Research on digital image processing has become quite popular and rapid in recent years, and scholars have proposed various image verification mechanisms. Similarly , blockchain technology has also become very popular in recent years. This paper proposes a new image verification mechanism based on the Merkle tree technique in the blockchain. The Merkle tree root in the blockchain mechanism provides a reliable environment for storage of image features. In image verification, the verification of each image can be performed by the Merkle tree mechanism to obtain the hash value of the Merkle tree node on the path. In addition, the method combines the Inter-Planetary File System (IPFS) to improve the availability of images. The main purpose of this paper is to achieve the goal of image integrity verification. The proposed method can not only verify the integrity of the image but also restore the tampered area in the case of image tampering. Since the proposed method employs the blockchain mechanism, the image verification mechanism does not need third party resources . The verification method is performed by each node in the blockchain network. The experimental results demonstrate that the proposed method successfully achieved the goal of image authentication and tampered area restoration.

A Dynamic Model of Hierarchical Application Layer Multicast Tree Node Failure Epidemic

2013 ◽  
Vol 321-324 ◽  
pp. 2780-2784
Author(s):  
Hua Sheng Chen ◽  
Yong Qi ◽  
Wei Hua Li
Keyword(s):  
Dynamic Model ◽  
Failure Detection ◽  
Multicast Tree ◽  
Application Layer Multicast ◽  
Application Layer ◽  
Node Failure ◽  
Performance Simulation ◽  
Detection Scheme ◽  
Tree Node ◽  
Interval Value

Failure Detection periodically detects node validity to maintain application layer network stability. The detection cycle interval value is a key parameter for detection scheme performance; there have been few studies on models of analyzing cycle interval value affecting the scheme. We propose a dynamic model of hierarchical application layer multicast tree node failure epidemic SIRS (NFE-SIRS). The NFE-SIRS analyzes statistical node failure in hierarchical application layer multicast tree structure, and models relationship between cycle interval value and detection scheme repair behavior, finally obtains the expected cycle interval value to improve detection scheme performance. Simulation shows that, the NFE-SIRS can dramatically improve detection scheme performance compared with common fixed cycle interval detection scheme.

scholarly journals Recombination strategies and evolutionary dynamics of the Human enterovirus A global gene pool

2014 ◽  
Vol 95 (4) ◽  
pp. 868-873 ◽  
Author(s):  
Alexander N. Lukashev ◽  
Elena Yu. Shumilina ◽  
Ilya S. Belalov ◽  
Olga E. Ivanova ◽  
Tatiana P. Eremeeva ◽  
...  
Keyword(s):  
Half Life ◽  
Evolutionary Dynamics ◽  
Enterovirus 71 ◽  
Human Enterovirus ◽  
Structural Genes ◽  
Genome Region ◽  
Recombinant Viruses ◽  
3D Genome ◽  
Tree Node ◽  
Natural Recombination

We analysed natural recombination in 79 Human enterovirus A strains representing 13 serotypes by sequencing of VP1, 2C and 3D genome regions. The half-life of a non-recombinant tree node in coxsackieviruses 2, 4 and 10 was only 3.5 years, and never more than 9 years. All coxsackieviruses that differed by more than 7 % of the nucleotide sequence in any genome region were recombinants relative to each other. Enterovirus 71 (EV71), on the contrary, displayed remarkable genetic stability. Three major EV71 clades were stable for 19–29 years, with a half-life of non-recombinant viruses between 13 and 18.5 years in different clades. Only five EV71 strains out of over 150 recently acquired non-structural genome regions from coxsackieviruses, while none of 80 contemporary coxsackieviruses had non-structural genes transferred from the three EV71 clades. In contrast to earlier observations, recombination between VP1 and 2C genome regions was not more frequent than between 2C and 3D regions.

Sign in / Sign up

Export Citation Format

Share Document