Tree densities have increased greatly in olive orchards over the last few decades. In many annual crop species, density reduces horizontal red/far-red (R/FR) and blue/green (B/G) ratios during canopy development even before direct shading occurs, such changes are known to alter plant morphology. This study with trees evaluated: (1) whether leaf area index (LAI) of neighboring modifies light qua...

This paper reviews P´olya urn models and their connection to random trees. Basic results are presented, together with proofs that underly the historical evolution of the accompanying thought process. Extensions and generalizations are given according to chronology: • P´olya-Eggenberger’s urn • Bernard Friedman’s urn • Generalized P´olya urns • Extended urn schemes • Invertible urn schemes ...

The binary partition tree (BPT) allows for the hierarchical representation of images in a multiscale way, by providing nodes corresponding to image regions. In particular, cuts BPT can be interpreted as segmentations associated image. Building an then constitutes relevant preliminary step optimization-based segmentation methods. A wide literature has been devoted construction BPTs, and their in...

Differences in pest management of olive orchards may affect the development of olive trees and may be reflected in terms of absolute and relative asymmetry, mass, and quality of the leaves. Leaf mass and residual leaf mass of olive trees were significantly greater under organic management than other pest management regimes. The analysis revealed that leaves from trees under different pest manag...

The story of Gentzen’s original consistency proof for first-order number theory (Gentzen 1974), as told by Paul Bernays (Gentzen 1974), (Bernays 1970), (Gödel 2003, Letter 69, pp. 76-79), is now familiar: Gentzen sent it off to Mathematische Annalen in August of 1935 and then withdrew it in December after receiving criticism and, in particular, the criticism that the proof used the Fan Theorem,...

We present a new, simple algorithmic idea for exploiting the potential for bidirectional communication present in many modern interconnects for the collective MPI operations broadcast, reduction and scan. Our algorithms achieve up to twice the bandwidth of most previous and commonly used algorithms. In particular, our algorithms for reduction and scan are the currently best known. Experiments o...

In binary jumbled pattern matching we wish to preprocess a binary string S in order to answer queries (i, j) which ask for a substring of S that is of size i and has exactly j 1-bits. The problem naturally generalizes to node-labeled trees and graphs by replacing “substring” with “connected subgraph”. In this paper, we give an n/2 n/ log log n) 1/2 time solution for both strings and trees. This...

We study an NP-complete (and MaxSNP-hard) communication problem on tree networks, the so-calledMulticut in Trees: given an undirected tree and some pairs of nodes of the tree, find out whether there is a set of at most k tree edges whose removal separates all given pairs of nodes. Multicut has been intensively studied for trees as well as for general graphs mainly from the viewpoint of polynomi...