Results 71 to 80 of about 166,958 (306)
Classification of Alpine Skiing Styles Using GNSS and Inertial Measurement Units
Sensors, 2020 In alpine skiing, four commonly used turning styles are snowplow, snowplow-steering, drifting and carving. They differ significantly in speed, directional control and difficulty to execute.
Christina Neuwirth +5 more
doaj +1 more source
IEEE Access, 2022 We propose a new ML model called Topological Forest that contains an ensemble of decision trees. Unlike a vanilla Random Forest, Topological Forest has a special training process that selects a smaller number of decision trees on a topological graph ...
Murat Ali Bayir +3 more
doaj +1 more source
Evolutionarily divergent DUF4465 domains have a common vitamin B12‐binding function
FEBS Open Bio, EarlyView.We show that DUF4465 family proteins, widespread across bacteria from gut microbiomes, hydrothermal vents, and soil, share a common vitamin B12‐binding function. These augmented β‐jellyroll proteins bind vitamin B12 via extended loops. Our findings establish sequence‐diverse DUF4465 proteins as a widespread class of B12‐binding proteins, highlighting ...
Charlea Clarke +4 more
wiley +1 more source
Acta Mathematica Hungarica, 2013 Local convergence of bounded degree graphs was introduced by Benjamini and Schramm. This result was extended further by Lyons to bounded average degree graphs. In this paper, we study the convergence of a random tree sequence where the probability of a given tree is proportional to $\prod_{v_i\in V(T)}d(v_i)!$.
openaire +2 more sources
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Scaling limits of random trees [PDF]
, 2012 We investigate scaling limits of several types of random trees. The study of scaling limits of random trees was initiated by Aldous in the early 1990's. One of the primary goals of his work was to study the uniform distribution on trees with n vertices
Rizzolo, Douglas Paul
core
Unions of random trees and applications
Discrete Mathematics, 2021 In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this result, and we obtain an explicit rate of convergence.
Austen James +3 more
openaire +2 more sources
Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes
FEBS Open Bio, EarlyView.Group A Streptococcus (GAS) acquires covRS mutations driving a hypervirulent bacterial state, frequently associated with invasive disease‐like necrotizing fasciitis. We demonstrate that the newly emerged M1UK GAS lineage can also acquire these mutations.
Jarrad Pritchard +12 more
wiley +1 more source
Non-crossing trees revisited: cutting down and spanning subtrees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Here we consider two parameters for random non-crossing trees: $\textit{(i)}$ the number of random cuts to destroy a size-$n$ non-crossing tree and $\textit{(ii)}$ the spanning subtree-size of $p$ randomly chosen nodes in a size-$n$ non-crossing tree ...
Alois Panholzer
doaj +1 more source
The Block Connectivity of Random Trees [PDF]
The Electronic Journal of Combinatorics, 2009 Let $r$, $m$, and $n$ be positive integers such that $rm=n$. For each $i \in \{1, \ldots, m\}$ let $B_i = \{r(i-1)+1, \ldots, ri\}$. The $r$-block connectivity of a tree on $n$ labelled vertices is the vertex connectivity of the graph obtained by collapsing the vertices in $B_i$, for each $i,$ to a single (pseudo-)vertex $v_i$. In this paper we prove
Andrew R. A. McGrae, Michele Zito 0001
openaire +2 more sources