Results 41 to 50 of about 2,902,197 (338)
Pediatric Blood &Cancer, EarlyView.ABSTRACT Ongoing evidence indicates increased risk of sarcopenic obesity among children and young people (CYP) with acute lymphoblastic leukemia (ALL), often beginning early in treatment, persisting into survivorship. This review evaluates current literature on body composition in CYP with ALL during and after treatment.
Lina A. Zahed +5 more
wiley +1 more source
, 2011 In the complete graph on n vertices, when each edge has a weight which is an exponential random variable, Frieze proved that the minimum spanning tree has weight tending to zeta(3)=1/1^3+1/2^3+1/3^3+... as n goes to infinity.
Angel, Omer +2 more
core +1 more source
A study on minimum weight design of vertical corrugated bulkheads for chemical tankers
International Journal of Naval Architecture and Ocean Engineering, 2018 Corrugated bulkhead has been adopted for cargo tank bulkheads of commercial vessels such as bulk carriers, product oil carriers and chemical tankers.
Sang-Hoon Shin, Dae-Eun Ko
doaj +1 more source
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2020 In this paper, we treat a lexicographic bi-criteria combinatorial optimization model of mixture packaging of two types of items, which arises in actual food packing systems, so-called multi-head weighers.
Yoshiyuki KARUNO, Oki NAKAHAMA
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objectives To identify predictors of chronic ITP (cITP) and to develop a model based on several machine learning (ML) methods to estimate the individual risk of chronicity at the timepoint of diagnosis. Methods We analyzed a longitudinal cohort of 944 children enrolled in the Intercontinental Cooperative immune thrombocytopenia (ITP) Study ...
Severin Kasser +6 more
wiley +1 more source
Maximal Flat Antichains of Minimum Weight [PDF]
The Electronic Journal of Combinatorics, 2009 We study maximal families ${\cal A}$ of subsets of $[n]=\{1,2,\dots,n\}$ such that ${\cal A}$ contains only pairs and triples and $A\not\subseteq B$ for all $\{A,B\}\subseteq{\cal A}$, i.e. ${\cal A}$ is an antichain. For any $n$, all such families ${\cal A}$ of minimum size are determined. This is equivalent to finding all graphs $G=(V,E)$ with $|V|=n$
Grüttmüller, Martin +4 more
openaire +2 more sources
Estimating the weight of metric minimum spanning trees in sublinear time [PDF]
, 2008 In this paper we present a sublinear-time $(1+\varepsilon)$-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an $n$-point metric space. The running time of the algorithm is $\widetilde{\mathcal{O}}(n/\varepsilon^{\
Artur Czumaj +2 more
core +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background B‐acute lymphoblastic leukemia (B‐ALL) is the most common pediatric cancer, and while most children in high‐resource settings are cured, therapy carries risks for long‐term toxicities. Understanding parents’ concerns about these late effects is essential to guide anticipatory support and inform evolving therapeutic approaches ...
Kellee N. Parker +7 more
wiley +1 more source
Randomized Algorithms for the Loop Cutset Problem
, 2011 We show how to find a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the first step in the method of conditioning for inference.
Bar-Yehuda, R., Becker, A., Geiger, D.
core +1 more source
Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights [PDF]
, 2005 We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding.
Kelley, Christine +2 more
core +4 more sources