A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Filters
Noncrossing trees are almost conditioned Galton-Watson trees
2002
Random structures & algorithms (Print)
A non-crossing tree (NC-tree) is a tree drawn on the plane having as vertices a set of points on the boundary of a circle, and whose edges are straight line segments that do not cross. ...
In this paper, we show that NC-trees with size n are conditioned Galton-Watson trees. As corollaries, we give the limit law of depth-first traversal processes and the limit profile of NC-trees. ...
Using above combinatorial decomposition of NC-trees, in Panholzer [13] the distribution of the height h(j) of the node j was studied and appears to be related to the Brownian excursion. ...
doi:10.1002/rsa.10016
fatcat:2nmibistsvfypjddoqmh475z44
Triangular grid protocol: An efficient scheme for replica control with uniform access quorums
1998
Theoretical Computer Science
Replication is an important technique in distributed database systems. ...
It not only advances almost all the achievements mentioned above but also reduces the size of a write quorum to the size of a read quorum. ...
Non-minimal BCT in a triangular grid with height = 5. ...
doi:10.1016/s0304-3975(97)86793-x
fatcat:2t62uke2xfg4tmdaedoku7r7ce
Cyclic structure induced by load fluctuations in adaptive transportation networks
[article]
2018
arXiv
pre-print
Here, we consider tree-like networks under the influence of spatially heterogeneous distribution of fluctuations, where the root of the tree is supplied by a constant source and the leaves at the bottom ...
Dropping this assumption, fluctuations of net flow at source and/or sink nodes may render the pure tree solutions unstable even under a simple local adaptation rule for conductances. ...
Acknowledgments EAM and KK acknowledge travel funding from Action CA15109, European Cooperation for Statistics of Network Data Science (COSTNET). ...
arXiv:1810.10049v1
fatcat:rqzhtw6zzfg6jkngzsudlwfbvy
Self-Stabilizing Balancing Algorithm for Containment-Based Trees
[article]
2012
arXiv
pre-print
However, this robustness is achieved at the cost of un-balancing the structure. While the structure remains correct in terms of searchability, its performance can be significantly decreased. ...
In this paper, we propose a distributed self-stabilizing algorithm to balance containment-based trees. ...
University of Picardie Jules Verne, France. It was partially funded by french National Research Agency (08-ANR-SEGI-025). Details of the project on http://graal.ens-lyon.fr/SPADES. ...
arXiv:1212.3418v1
fatcat:nysl5jcrnneqjdxznvyk5pjaqm
Self-stabilizing Balancing Algorithm for Containment-Based Trees
[chapter]
2013
Lecture Notes in Computer Science
However, this robustness is achieved at the cost of unbalancing the structure. While the structure remains correct in terms of searchability, its performance can be significantly decreased. ...
In this paper, we propose a distributed self-stabilizing algorithm to balance containment-based trees. ...
University of Picardie Jules Verne, France. It was partially funded by french National Research Agency (08-ANR-SEGI-025). Details of the project on http://graal.ens-lyon.fr/SPADES. ...
doi:10.1007/978-3-319-03089-0_14
fatcat:t2bn3p7gpfeahhzmmoyga2nlpe
Using the Non-Parametric Classifier CART to Model Wood Density
2021
Journal of Data Science
Fifty trees were sampled in each sector, obtaining from each one six wood discs from different stem heights. ...
The results found that the stand attributes that contributed significantly to basic density classification were the basal area, the number of trees per hectare, and the mean height. ...
The regression tree reduced by cross validation diminishes the dimensionality of the final model, incorporating the basal area and mean height as the only stand variables in the classification of basic ...
doi:10.6339/jds.201104_09(2).0008
fatcat:frjav5u3ajdbrnocog7svojniy
Transitions from Trees to Cycles in Adaptive Flow Networks
2017
Frontiers in Physics
We assume a spatially non-uniform distribution of rapidly fluctuating loads in the sinks and investigate what network configurations are dynamically stable. ...
These findings may explain why natural transport networks display cyclic structures in the micro-vascular regions near terminal nodes, but tree-like features in the regions with larger veins. ...
Research conducted by EM is supported by the Dynamical Systems Interdisciplinary Network, University of Copenhagen. ...
doi:10.3389/fphy.2017.00062
fatcat:cejcgrcbojb2vd5tryri74soqm
Efficient and adaptive epidemic-style protocols for reliable and scalable multicast
2006
IEEE Transactions on Parallel and Distributed Systems
Processes can be allocated in a topologically aware manner to the leaf boxes of this structure, so that (1) and (2) produce low traffic across domain boundaries in the network, and induce minimal overhead ...
Epidemic-style (gossip-based) techniques have recently emerged as a class of scalable and reliable protocols for peer-to-peer multicast dissemination in large process groups. ...
Consider a Tree message initiated from IN h , the internal node ancestor of IN j at height h. ...
doi:10.1109/tpds.2006.85
fatcat:iq44z7xednd6dodkk6stx6v7am
Analysis of the Static Behavior of a Single Tree on a Finite Element Model
2021
Plants
Thus, we observed a maximal horizontal displacement of 280.4 mm in node N34 and dangerous tensile stress in node N26, where it reaches +23.6 MPa. ...
The results of the structural analysis called attention to potentially dangerous places within the tree structure with extreme node displacements or tensile stresses on beams. ...
Conflicts of Interest: The authors declare no conflict of interest. ...
doi:10.3390/plants10071284
fatcat:mhxmrefbmjdfbgxw55ldqx2nau
Hybrid Ring-Star-Tree Topology with Optical Add Drop Multiplexer: Cost Effective and Capacity Enhancement
2017
Journal of Engineering Science and Technology Review
In this paper, the performance of Ring-Star-Tree hybrid topology with OADM is investigated with 0.8 nm channel spacing at bit rate of 20 Gbps. ...
The distance between the nodes of ring network is 150 km without dispersion compensating fiber. ...
This is an Open Access article distributed under the terms of the Creative Commons Attribution Licence
______________________________ References ...
doi:10.25103/jestr.103.25
fatcat:ghtduxrrzrbktbmnuym5vcgnma
Red Green Black Trees: Extension to Red Black Trees
2018
Journal of Computers
Through the use of three color nodes, the structure tolerates series of two nodes between Black nodes and defines a less balanced tree. ...
In fact, Red Green Black trees can provide better performances in environment where the restructuring is most frequent with Red Black trees. ...
The increase in search time and height of the tree is due to the increase of the number of Red nodes in each path in accordance with theory. ...
doi:10.17706/jcp.13.4.461-470
fatcat:4fh6diom5ng7xcwh2svibiuf3m
Leveraging Hierarchical Structures for Few-Shot Musical Instrument Recognition
[article]
2021
arXiv
pre-print
We apply a hierarchical loss function to the training of prototypical networks, combined with a method to aggregate prototypes hierarchically, mirroring the structure of a predefined musical instrument ...
Compared to a non-hierarchical few-shot baseline, our method leads to a significant increase in classification accuracy and significant decrease mistake severity on instrument classes unseen in training ...
ACKNOWLEDGEMENTS This work was funded, in part, by USA National Science Foundation Award 1901456. ...
arXiv:2107.07029v2
fatcat:hcsakt427jdxtgjfrnitvcktsi
Leveraging Hierarchical Structures for Few-Shot Musical Instrument Recognition
2021
Zenodo
We apply a hierarchical loss function to the training of prototypical networks, combined with a method to aggregate prototypes hierarchically, mirroring the structure of a predefined musical instrument ...
Compared to a non-hierarchical few-shot baseline, our method leads to a significant increase in classification accuracy and significant decrease in mistake severity on instrument classes unseen in training ...
Tree Height To observe the effect of tree height on classification, we constructed shorter trees from the Hornbostel-Sachs class tree by removing every leaf node's parent until the desired max height of ...
doi:10.5281/zenodo.5624615
fatcat:kwpblujcsffbbckacgrkurqzp4
Modelling the biomechanical behaviour of growing trees at the forest stand scale. Part I: Development of an Incremental Transfer Matrix Method and application to simplified tree structures
2004
Annals of Forest Science
A simplified description of tree structure, separating trunk and crown, has been used in order to perform future calculations at the stand level. ...
This paper presents a numerical model which is dedicated to simulate the biomechanical behaviour of growing trees. ...
m
Total tree height
m
Crown base height
-
Current crown zone on the stem
-
Intermediate pruned zone
-
Stem zone without branches
-
Number of stem nodes in the crown
(in
)
m
Height in ...
doi:10.1051/forest:2004019
fatcat:pouiimtvbrek7hrhhck7eqbqf4
Quantitative Assessment of Abdominal Aortic Aneurysm Geometry
2010
Annals of Biomedical Engineering
A model was created using a J48 decision tree algorithm and its performance was assessed using ten-fold cross validation. Feature selection was performed using the v 2 -test. ...
We hypothesize that aneurysm morphology and wall thickness are more predictive of rupture risk and can be the deciding factors in the clinical management of the disease. ...
The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Institutes of Health. Dr. ...
doi:10.1007/s10439-010-0175-3
pmid:20890661
pmcid:PMC3070409
fatcat:qewqobjbpjezdjg24kqhfpjc5i
« Previous
Showing results 1 — 15 out of 38,068 results