Results 241 to 250 of about 68,879 (310)
Low-Latency Realism Through Randomized Distributed Function Computations: A Shannon Theoretic Approach. [PDF]
Günlü O, Skorski M, Poor HV.
europepmc +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
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
Consensus Control of Saturated Multi-Agent Systems with Heterogeneous Asymmetric Saturation Constraints Under Flexible Topologies. [PDF]
Wang Z, Yang J, Yang H, Jin Z.
europepmc +1 more source
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
A dynamically consistent discrete-time model for monkeypox transmission with implications for quarantine policies. [PDF]
Türk K, Gümüş M.
europepmc +1 more source
Abstract Background Early exposure to maternal depression can increase risk for offspring mental health problems across the lifespan. Less is known about the transdiagnostic pathways through which maternal depression influences offspring mental health risk in young adulthood.
Gabrielle R. Rinne +3 more
wiley +1 more source
Quantum dynamics, master equation and equilibrium for a qubit coupled to a thermal boson field. [PDF]
Nakazato H, Pascazio S.
europepmc +1 more source
Fractional List Packing for Layered Graphs
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

