Optimal tree fallow rotations: some principles revealed by modelling

1995 ◽  
Vol 29 (2) ◽  
pp. 113-132 ◽  
Author(s):  
D. C. Mobbs ◽  
M. G. R. Cannell
Keyword(s):  
Tree Fallow ◽  
Optimal Tree

scholarly journals Optimal Tree Topology for a Submarine Cable Network With Constrained Internodal Latency

2021 ◽  
pp. 1-1
Author(s):  
Tianjiao Wang ◽  
Xinyu Wang ◽  
Zengfu Wang ◽  
Chao Guo ◽  
William Moran ◽  
...  
Keyword(s):  
Tree Topology ◽  
Submarine Cable ◽  
Cable Network ◽  
Optimal Tree

scholarly journals Calibration Analysis of High-G MEMS Accelerometer Sensor Based on Wavelet and Wavelet Packet Denoising

Sensors ◽  
2021 ◽  
Vol 21 (4) ◽  
pp. 1231
Author(s):  
Yunbo Shi ◽  
Juanjuan Zhang ◽  
Jingjing Jiao ◽  
Rui Zhao ◽  
Huiliang Cao
Keyword(s):  
Wavelet Packet ◽  
Estimation Method ◽  
Likelihood Estimation ◽  
Parameter Extraction ◽  
Accelerometer Sensor ◽  
Oscillation Phase ◽  
Mems Accelerometer ◽  
Optimal Tree ◽  
Adaptive Decomposition ◽  
Entropy Criterion

High-G accelerometers are mainly used for motion measurement in some special fields, such as projectile penetration and aerospace equipment. This paper mainly explores the wavelet threshold denoising and wavelet packet threshold denoising in wavelet analysis, which is more suitable for high-G piezoresistive accelerometers. In this paper, adaptive decomposition and Shannon entropy criterion are used to find the optimal decomposition layer and optimal tree. Both methods use the Stein unbiased likelihood estimation method for soft threshold denoising. Through numerical simulation and Machete hammer test, the wavelet threshold denoising is more suitable for the dynamic calibration of a high-G accelerometer. The wavelet packet threshold denoising is more suitable for the parameter extraction of the oscillation phase.

OPTIMAL TREE RANKING IS IN $\mathcal{NC}$

1992 ◽  
Vol 02 (01) ◽  
pp. 31-41 ◽  
Author(s):  
PILAR DE LA TORRE ◽  
RAYMOND GREENLAW ◽  
TERESA M. PRZYTYCKA
Keyword(s):  
General Problem ◽  
Sequential Algorithm ◽  
Natural Numbers ◽  
Ranking Problem ◽  
Crew Pram ◽  
Optimal Tree ◽  
Optimal Ranking

This paper places the optimal tree ranking problem in [Formula: see text]. A ranking is a labeling of the nodes with natural numbers such that if nodes u and v have the same label then there exists another node with a greater label on the path between them. An optimal ranking is a ranking in which the largest label assigned to any node is as small as possible among all rankings. An O(n) sequential algorithm is known. Researchers have speculated that this problem is P-complete. We show that for an n-node tree, one can compute an optimal ranking in O( log n) time using n2/ log n CREW PRAM processors. In fact, our ranking is super critical in that the label assigned to each node is absolutely as small as possible. We achieve these results by showing that a more general problem, which we call the super critical numbering problem, is in [Formula: see text]. No [Formula: see text] algorithm for the super critical tree ranking problem, approximate or otherwise, was previously known; the only known [Formula: see text] algorithm for optimal tree ranking was an approximate one.

scholarly journals Worst-Case Optimal Tree Layout in External Memory

Algorithmica ◽  
2014 ◽  
Vol 72 (2) ◽  
pp. 369-378 ◽  
Author(s):  
Erik D. Demaine ◽  
John Iacono ◽  
Stefan Langerman
Keyword(s):  
External Memory ◽  
Worst Case ◽  
Optimal Tree

FPGA Realization of the Reconfigurable Mesh Counting Algorithm

2021 ◽  
pp. 2150157
Author(s):  
Yosi Ben-Asher ◽  
Esti Stein ◽  
Vladislav Tartakovsky
Keyword(s):  
Lower Bound ◽  
Neural Nets ◽  
Processing Elements ◽  
Large Numbers ◽  
Unrealistic Assumption ◽  
Reconfigurable Mesh ◽  
Speed Up ◽  
Optimal Tree ◽  
Pass Transistor ◽  
Signal Switching

Pass transistor logic (PTL) is a circuit design technique wherein transistors are used as switches. The reconfigurable mesh (RM) is a model that exploits the power of PTLs signal switching, by enabling flexible bus connections in a grid of processing elements containing switches. RM algorithms have theoretical results proving that [Formula: see text] can speed up computations significantly. However, the RM assumes that the latency of broadcasting a signal through [Formula: see text] switches (bus length) is 1. This is an unrealistic assumption preventing physical realizations of the RM. We propose the restricted-RM (RRM) wherein the bus lengths are restricted to [Formula: see text], [Formula: see text]. We show that counting the number of 1-bits in an input of [Formula: see text] bits can be done in [Formula: see text] steps for [Formula: see text] by an [Formula: see text] RRM. An almost matching lower bound is presented, using a technique which adds to the few existing lower-bound techniques in this area. Finally, the algorithm was directly coded over an FPGA, outperforming an optimal tree of adders. This work presents an alternative way of counting, which is fundamental for summing, beating regular Boolean circuits for large numbers, where summing a vast amount of numbers is the basis of any accelerator in embedded systems such as neural-nets and streaming. a

Optimal Tree Contraction and Term Matching on the Hypercube and Related Networks

Algorithmica ◽  
1997 ◽  
Vol 18 (3) ◽  
pp. 445-460 ◽  
Author(s):  
E. W. Mayr ◽  
R. Werchner
Keyword(s):  
Tree Contraction ◽  
Optimal Tree

Optimal Tree Cutting

1994 ◽  
pp. 171-174
Author(s):  
Bruce Hannon ◽  
Matthias Ruth
Keyword(s):  
Optimal Tree ◽  
Tree Cutting

scholarly journals SISFLOR: A COMPUTATIONAL SYSTEM TO DETERMINE THE OPTIMAL TREE BUCKING

2020 ◽  
Vol 28 ◽  
pp. 192-201
Author(s):  
Rodrigo Freitas Silva ◽  
Marcelo Otone Aguiar ◽  
Mayra Luiza Marques Da Silva ◽  
Gilson Fernandes Da Silva ◽  
Adriano Ribeiro De Mendonça
Keyword(s):  
Optimization Technique ◽  
Wood Products ◽  
Tree Level ◽  
Economic Losses ◽  
Computational System ◽  
Individual Tree ◽  
Optimal Tree ◽  
Cutting Pattern ◽  
Forest Enterprises ◽  
The Individual

A continuously competitive forest market and tied to the demands for wood products promotes the study and development of applications that increase the revenue of the forest enterprises. At harvesting, the cutting pattern (forest assortment) in which the trees are traced is traditionally determined by the experience of the chainsaw operator without using any optimization technique, which may result in economic losses in relation to the commercialized products. In general, there are numerous distinct assortments that can be chosen and hardly processed by a brute-force algorithm. This is the forest assortment problem at the individual tree level with the objetice of maximizing the commercial values of the felled trees. stem-level bucking optimization problem. The aim is to maximize the sales value of harvested trees. Dynamic Programming (DP) is an efficient optimization technique to determine the optimum bucking tree as it significantly reduces the number of calculations to be made. Thus, the objective of this work was to develop a modern and intuitive computational system that is able to find the optimum tree stem bucking through DP to help companies over the bole tracing, therefore, characterizing itself as a tool that supports decision making. After the execution of the system, the optimum assortment is shown by sequentially detailing all products that should be removed from the analyzed bole as well as their respective volumes and revenue.

An Improved Genetic Algorithm for Optimal Tree Decomposition of Bayesian Networks

2011 ◽  
Vol 3 (2) ◽  
pp. 95-103
Author(s):  
Xuchu Dong ◽  
Zhanshan Li ◽  
Dantong Ouyang ◽  
Yuxin Ye ◽  
Haihong Yu ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Bayesian Networks ◽  
Tree Decomposition ◽  
Improved Genetic Algorithm ◽  
Optimal Tree
Sign in / Sign up

Export Citation Format

Share Document