Results 121 to 130 of about 4,436 (299)

Predictive Value of Modified Lung Ultrasound Score for Late Respiratory Diseases in Premature Infants: A Retrospective Cohort Analysis

Journal of Clinical Ultrasound, EarlyView.
This study is to assess the predictive value of the modified lung ultrasound score (mLUS) for late respiratory diseases in premature infants born before 32 weeks of gestation. It is recommended that the use of mLUS scoring be promoted in clinical practice for the early screening of high‐risk preterm infants.
Shuang Zheng, Yang Zhang, Yanan Gao, Huifen Chen, Sudan Liu   +4 more
wiley   +1 more source

Partitions of integers, Ferrers-Young diagrams, and representational efficacy of spreadsheet modeling

Spreadsheets in Education, 2012
This article shows how concrete materials can be used in the context of partitions of integers to develop recursive definitions of concepts amenable to spreadsheet modeling.
Sergei Abramovich
doaj  

L’interprétation stochastique du sociogramme et le problème des choix exceptionnels; A statistical interpretation of the sociogram and the determination of exceptional choice [PDF]

Tutorials in Quantitative Methods for Psychology, 2012
The mutual designation of a preferred member among a group, be it for presidency, a special mandate or even for psychosocial purposes, proceeds frequently by Moreno’s sociogram technique: in its simpler form, each member votes for some other member, and ...
Louis Laurencelle
doaj  

Limit shapes of Gibbs distributions on the set of integer partitions: The expansive case [PDF]

, 2008
Michael Erlihson, Boris L. Granovsky
openalex   +1 more source

Gaussian integers partition in power-free numbers product [PDF]

, 2020
V. V. Shramko
openalex   +1 more source

Properly Colored Cycles in Edge‐Colored Balanced Bipartite Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT Let G n , n c ${G}_{n,n}^{c}$ denote a (not necessarily properly) edge‐colored balanced bipartite graph on 2 n $2n$ vertices, that is, in which every edge is assigned a color. A cycle C $C$ in G n , n c ${G}_{n,n}^{c}$ is called properly colored if any two consecutive edges of C $C$ have distinct colors. A properly colored cycle‐factor of G n ,
Tingting Han, Hajo Broersma, Shenggui Zhang, Yandong Bai   +3 more
wiley   +1 more source

Another Proof of the Generalized Tutte—Berge Formula for f $f$‐Bounded Subgraphs

Journal of Graph Theory, EarlyView.
ABSTRACT Given a nonnegative integer weight f ( v ) $f(v)$ for each vertex v $v$ in a multigraph G $G$, an f $f$‐bounded subgraph of G $G$ is a multigraph H $H$ contained in G $G$ such that d H ( v ) ≤ f ( v ) ${d}_{H}(v)\le f(v)$ for all v ∈ V ( G ) $v\in V(G)$.
Zishen Qu, Douglas B. West
wiley   +1 more source

Random integer partitions with restricted numbers of parts

, 2013
Locey Kenneth
openalex   +2 more sources

The Independence Ratio of 4‐Cycle‐Free Planar Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT We prove that every n $n$‐vertex planar graph G $G$ with no triangle sharing an edge with a 4‐cycle has independence ratio n ∕ α ( G ) ≤ 4 − ε $n\unicode{x02215}\alpha (G)\le 4-\varepsilon $ for ε = 1 ∕ 30 $\varepsilon =1\unicode{x02215}30$. This result implies that the same bound holds for 4‐cycle‐free planar graphs and planar graphs with no ...
Tom Kelly, Sid Kolichala, Caleb McFarland, Jatong Su   +3 more
wiley   +1 more source

Integer partitions, probabilities and quantum modular forms

, 2017
Hieu T. Ngo, Robert C. Rhoades
openalex   +1 more source