Results 211 to 220 of about 2,511 (267)
ABSTRACT Introduction Glucagon‐like peptide‐1 receptor agonists (GLP‐1 RAs) have demonstrated significant weight‐reducing effects and may offer benefits in idiopathic intracranial hypertension (IIH); however, recent concerns about the risk of non‐arteritic anterior ischemic optic neuropathy (NAION) have emerged.
Faisal A. Al‐Harbi +9 more
wiley +1 more source
Specific Deficiency of Naïve CD4+ T Lymphocytes Characterizes Heart Failure and Heightens Mortality Risk in the HRS. [PDF]
Zidar DA +15 more
europepmc +1 more source
Multiscale Feature Enhancement and Bidirectional Temporal Dependency Networks for Arrhythmia Classification. [PDF]
Yang L +6 more
europepmc +1 more source
Early-Life Climbing Stratifies the Metabolome and Mortality Risk in Genetically Identical Flies. [PDF]
Harrison BR +6 more
europepmc +1 more source
A Work-Based, Fully Remote, and Peer-Supported Exercise Snack Behavior Change Intervention (MOV'D): Protocol for a Randomized Controlled Pilot Trial. [PDF]
Monteiro A +8 more
europepmc +1 more source
Portfolio management based on value distribution reinforcement learning algorithm. [PDF]
Yang Y, Wang T, Fu Y, Huang J, Zhou D.
europepmc +1 more source
Robustness group divisible designs
Robustness of group divisible (GD) designs is investigated, when one block is lost, in terms of efficiency of the residual design. The exact evaluation of the efficiency can be made for singular GD and semi-regular GD designs as ell as regular GD designs with λ1 = 0.
Rahul Mukerjee, Sanpei Kageyama
openaire +2 more sources
On Automorphism Groups of Divisible Designs
A (group) divisible design is a tactical configuration for which the v points are split into m classes of n each, such that points have joining number λ (resp. λ2) if and only if they are in the same (resp. in different) classes. We are interested in such designs with a nice automorphism group.
Dieter Jungnickel
openaire +2 more sources
Divisible design graphs from the symplectic graph
A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a (group) divisible design. Divisible design graphs were introduced in 2011 as a generalization of $(v,k,\lambda)$-graphs.
Bart De Bruyn +2 more
exaly +6 more sources

