Results 241 to 250 of about 1,325 (293)

Colourings of Uniform Group Divisible Designs and Maximum Packings

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess   +6 more
wiley   +1 more source

Steady bubbles and drops in inviscid fluids. [PDF]

open access: yesCalc Var Partial Differ Equ
Meyer D, Niebel L, Seis C.
europepmc   +1 more source

Performance Evaluation of a Premier Resolution HPLC System for Detecting Hemoglobin Constant Spring, Hemoglobin Paksé, and Coexisting α‐ and β‐Thalassemia Mutations

open access: yesJournal of Clinical Laboratory Analysis, EarlyView.
This study compared Premier Resolution HPLC with Capillary Electrophoresis for detecting HbCS/Hb Paksé variants and coexisting thalassemia mutations. Premier Resolution HPLC demonstrated superior performance with 50% fewer false negative cases (11 vs. 22) compared to Capillary Electrophoresis, particularly in heterozygous cases.
Surada Satthakarn   +2 more
wiley   +1 more source

Cyclothymic‐hypersensitive temperament in early adolescence: Longitudinal measurement invariance and associations with psychopathology over time

open access: yesJCPP Advances, EarlyView.
Abstract Background Cyclothymic‐Hypersensitive Temperament (CHT) is characterised by mood instability, interpersonal hypersensitivity, and emotional hyperreactivity, traits frequently observed in general population as well as clinical settings but often eluding strict diagnostic classifications.
Anna Pezzella   +9 more
wiley   +1 more source

Maximum persistent Betti numbers of Čech complexes. [PDF]

open access: yesJ Appl Comput Topol
Edelsbrunner H, Kahle M, Kanazawa S.
europepmc   +1 more source

Precise asymptotic analysis of Sobolev training for random feature models

open access: green
Fisher, Katharine E   +3 more
openalex   +1 more source

Fractional List Packing for Layered Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

Hitting Times in the Binomial Random Graph

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT Fix k ≥ 2 $k\ge 2$, choose log n n ( k − 1 ) ∕ k ≤ p ≤ 1 − Ω ( log 4 n n ) $\frac{\mathrm{log}n}{{n}^{(k-1)\unicode{x02215}k}}\le p\le 1-{\rm{\Omega }}(\frac{{\mathrm{log}}^{4}n}{n})$, and consider G ~ G ( n , p ) $G\unicode{x0007E}G(n,p)$. For any pair of vertices v , w ∈ V ( G ) $v,w\in V(G)$, we give a simple and precise formula for the ...
Bertille Granet   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy