Results 191 to 200 of about 2,695 (260)

Chemical Shift Separated and Compensated Ultra‐Short Echo‐Time Imaging

open access: yesMagnetic Resonance in Medicine, EarlyView.
ABSTRACT Purpose To develop a modified binomial excitation scheme for ultra‐short echo‐time (UTE) imaging that allows for the separation of water and fat signals and the correction of chemical shift artifacts. Methods Theoretical derivation and numerical Bloch simulations were performed for a modified water‐excitation binomial pulse scheme to calculate
Martin Krämer   +3 more
wiley   +1 more source

Reducing Inhomogeneous MT (ihMT) Acquisition Time Using Frequency Alternation at Low Duty Cycle for Single Offset (FALSO) MT Preparations

open access: yesMagnetic Resonance in Medicine, EarlyView.
ABSTRACT Purpose To evaluate Frequency Alternation at Low duty cycle for Single Offset (FALSO) as a novel Magnetization Transfer (MT) preparation scheme to increase speed and/or spatial resolution of inhomogeneous MT (ihMT) MRI by reducing the number of volumes required.
Gopal Varma   +5 more
wiley   +1 more source

Aligning family medicine residency learning outcomes with societal needs: a nominal group study. [PDF]

open access: yesBMC Med Educ
Todd KJ   +5 more
europepmc   +1 more source

Multi‐Agent Reinforcement Learning for Joint Police Patrol and Dispatch

open access: yesNaval Research Logistics (NRL), EarlyView.
ABSTRACT Police patrol units need to split their time between performing preventive patrol and being dispatched to serve emergency incidents. In the existing literature, patrol and dispatch decisions are often studied separately. We consider joint optimization of these two decisions to improve police operations efficiency and reduce response time to ...
Matthew Repasky, He Wang, Yao Xie
wiley   +1 more source

Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs

open access: yesNetworks, EarlyView.
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz   +2 more
wiley   +1 more source

Randomized Controlled Trial of Aerobic Exercise for Smoking Cessation Among Individuals With Elevated Depressive Symptoms. [PDF]

open access: yesNicotine Tob Res
Abrantes AM   +10 more
europepmc   +1 more source

Cystic fibrosis-related kidney disease-emerging morbidity and disease modifier. [PDF]

open access: yesPediatr Nephrol
Hart M   +5 more
europepmc   +1 more source

Threats to Women's Health in Prisons and Jails. [PDF]

open access: yesJAMA Intern Med
Haber LA, James JE, Williams BA.
europepmc   +1 more source

Home - About - Disclaimer - Privacy