Results 121 to 130 of about 5,579,561 (370)

Fringe trees, Crump-Mode-Jagers branching processes and $m$-ary search trees [PDF]

open access: yesarXiv, 2016
This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump-Mode-Jagers branching process, stopped at a suitable time. This includes random recursive trees, preferential attachment trees, fragmentation trees, binary search trees and (more generally) $m$-ary search ...
arxiv  

Ensemble of optimal trees, random forest and random projection ensemble classification

open access: yesAdvances in Data Analysis and Classification, 2019
The predictive performance of a random forest ensemble is highly associated with the strength of individual trees and their diversity. Ensemble of a small number of accurate and diverse trees, if prediction accuracy is not compromised, will also reduce ...
Zardad Khan   +6 more
semanticscholar   +1 more source

A Natural Lignification Inspired Super‐Hard Wood‐Based Composites with Extreme Resilience

open access: yesAdvanced Materials, EarlyView.
Super‐hard wood‐based composites (WBC) are designed and developed inspired by the mesoscale homogeneous lignification process intrinsic to tree growth. This innovative hybrid structure is achieved by leveraging the infusion of low‐molecular‐weight phenol formaldehyde resin into the cell walls of thin wood slices, followed by a unique multi‐layer ...
Yuxiang Huang   +11 more
wiley   +1 more source

A Weakly 1-Stable Limiting Distribution for the Number of Random Records and Cuttings in Split Trees [PDF]

open access: yesarXiv, 2010
We study the number of random records in an arbitrary split tree (or equivalently, the number of random cuttings required to eliminate the tree). We show that a classical limit theorem for convergence of sums of triangular arrays to infinitely divisible distributions can be used to determine the distribution of this number.
arxiv  

Local convergence of critical random trees and continuous-state branching processes [PDF]

open access: yesarXiv, 2015
We study the local convergence of critical Galton-Watson trees and Levy trees under various conditionings. Assuming a very general monotonicity property on the functional of random trees, we show that random trees conditioned to have large functional values always converge locally to immortal trees.
arxiv  

Dynamic Microfluidic Synthesis of Zinc Oxide Nanowires: Impact of Channel Architecture on Growth Homogeneity and Uniformity

open access: yesAdvanced Materials Interfaces, EarlyView.
In situ synthesis of nanomaterials within microfluidic reactors in dynamic mode boosts the growth rate. Notably, microfluidic reactors with optimized tree‐branched microchannel networks enable outstanding homogeneity of 99% and excellent nanowires uniformity.
Mazen Erfan   +5 more
wiley   +1 more source

Limit theorems for sequences of random trees [PDF]

open access: yesarXiv, 2004
We consider a random tree and introduce a metric in the space of trees to define the ``mean tree'' as the tree minimizing the average distance to the random tree. When the resulting metric space is compact we have laws of large numbers and central limit theorems for sequence of independent identically distributed random trees. As application we propose
arxiv  

Wireless and Self‐Powered Wearable Pressure Sensors Based on Chitosan for Artificial Mechanoreceptors

open access: yesAdvanced Materials Technologies, EarlyView.
A novel self‐powered wearable pressure sensor is fabricated using chitosan‐ZnO composite piezoelectric film, achieving sensitivities of 70.71 mV/kPa and 471.43 mV Hz−1. This lightweight and biodegradable device emulates mechanoreceptors for applications such as object classification, wireless data transmission, and gesture recognition, offering an eco ...
Zhao Wang   +5 more
wiley   +1 more source

Application of Event Based Decision Tree and Ensemble of Data Driven Methods for Maintenance Action Recommendation

open access: yesInternational Journal of Prognostics and Health Management, 2013
This study presents the methods employed by a team from the department of Mechatronics and Dynamics at the University of Paderborn, Germany for the 2013 PHM data challenge.
James K. Kimotho   +3 more
doaj   +1 more source

Convergence of simple random walks on random discrete trees to Brownian motion on the continuum random tree [PDF]

open access: yesAnn. Inst. H. Poincare Probab. Statist. 44 (2008), no. 6, 987-1019, 2007
In this article it is shown that the Brownian motion on the continuum random tree is the scaling limit of the simple random walks on any family of discrete $n$-vertex ordered graph trees whose search-depth functions converge to the Brownian excursion as $n\to\infty$.
arxiv  

Home - About - Disclaimer - Privacy