Results 51 to 60 of about 34,321,194 (310)
ABSTRACT Purpose Retinoblastoma (RB) is the most common pediatric ocular cancer, yet population‐based data on survival and risk factors remain limited. This study aimed to describe survival in a large national RB cohort and identify predictors of death and complications.
Samuel Sassine +14 more
wiley +1 more source
Edge-Connectivity and Edges of Even Factors of Graphs
An even factor of a graph is a spanning subgraph in which each vertex has a positive even degree. Jackson and Yoshimoto showed that if G is a 3-edge-connected graph with |G| ≥ 5 and v is a vertex with degree 3, then G has an even factor F containing two ...
Haghparast Nastaran, Kiani Dariush
doaj +1 more source
Deciphering the maximal transcendentality principle via bootstrap
We prove the principle of maximal transcendentality for a class of form factors, including the general two-loop minimal form factors, the two-loop three-point form factor of tr(F 2), and the two-loop four-point form factor of tr(F 3).
Yuanhong Guo +3 more
doaj +1 more source
ABSTRACT Purpose Although not always achieved, complete chemotherapy‐induced nausea and vomiting (CINV) control is the conventional goal of CINV prophylaxis. In this two‐center, mixed‐methods study, we sought to understand the preferences of adolescent patients and family caregivers for CINV control endpoints.
Haley Newman +8 more
wiley +1 more source
Density pertubation of unparticle dark matter in the flat Universe
The unparticle has been suggested as a candidate of dark matter. We investigated the growth rate of the density perturbation for the unparticle dark matter in the flat Universe. First, we consider the model in which unparticle is the sole dark matter and
A. Kiakotou +49 more
core +1 more source
On the Complexity Landscape of Connected f-Factor Problems [PDF]
Let G be an undirected simple graph having n vertices and let f be a function defined to be f:V(G) -> {0,..., n-1}. An f-factor of G is a spanning subgraph H such that degree of a vertex v in H is f(v) for every vertex v in V(G). The subgraph H is called a connected f-factor if, in addition, H is connected.
Robert Ganian +4 more
openaire +10 more sources
ABSTRACT Background Nurses are central to cancer care for children and adolescents, yet no comprehensive synthesis has defined essential core competencies for pediatric oncology nursing (PON) practice internationally, particularly in Latin America and the Caribbean (LAC).
Luís Carlos Lopes‐Júnior +7 more
wiley +1 more source
This work presents a novel characterization of complexity for gravitationally bound astrophysical configurations arising from two factors: (i) inhomogeneity and (ii) anisotropy in the complex arrangement of stellar structures. For this purpose, we employ
Abeer M. Albalahi +2 more
doaj +1 more source
Propagators in Coulomb gauge from SU(2) lattice gauge theory
A thorough study of 4-dimensional SU(2) Yang-Mills theory in Coulomb gauge is performed using large scale lattice simulations. The (equal-time) transverse gluon propagator, the ghost form factor d(p) and the Coulomb potential V_{coul} (p) ~ d^2(p) f(p)/p^
A. Cucchieri +22 more
core +1 more source
ABSTRACT Introduction Pulmonary dysfunction and sleep abnormalities are common in children with sickle cell disease (SCD) and are associated with worse clinical outcomes. Whether spirometry abnormalities are associated with polysomnography (PSG) findings remains unclear.
Ammar Saadoon Alishlash +4 more
wiley +1 more source

