Results 221 to 230 of about 419,951 (288)

An Implicit Nodal–Staggered Finite Difference Scheme for Damped Shear Beam Models Without Rotational Inertia

open access: yesMathematical Methods in the Applied Sciences, EarlyView.
ABSTRACT We develop and analyze a fully discrete finite difference approximation for a damped shear beam model with mixed boundary conditions and no rotational inertia. The absence of a second‐order time derivative in the rotational equation gives rise to an asymmetric temporal structure.
Anderson de Jesus Araújo Ramos   +3 more
wiley   +1 more source

Self‐Correction of B0 Drift and Trajectory Error in Alternating Unbalanced SSFP‐FID and SSFP‐ECHO (AUSFIDE)‐Based 3D Transverse Relaxometry of the Human Brain

open access: yesMagnetic Resonance in Medicine, EarlyView.
ABSTRACT Purpose The alternating unbalanced SSFP (AUSFIDE) pulse sequence, which consists of multi‐echo trains of SSFP‐FID and SSFP‐ECHO modules, enables rapid estimation of R2 and R2′, but is prone to errors from temporal drift of the main magnetic field (B0) and k‐space trajectory mismatch.
Eunseo Bae   +5 more
wiley   +1 more source

Liposome Particle Size Prediction by In-Line Process Analytical Technology (PAT)-Integrated Machine Learning. [PDF]

open access: yesSmall Methods
Lee J   +6 more
europepmc   +1 more source

Prandial Effects on Intravoxel Incoherent Motion Quantification in the Liver

open access: yesMagnetic Resonance in Medicine, EarlyView.
ABSTRACT Purpose To evaluate the feasibility of detecting prandial (i.e., meal) induced changes in microvascular flow in the liver, including changes in the spatial distribution of flow velocities, using intravoxel incoherent motion (IVIM) MRI. Methods Thirteen (n = 13) healthy volunteers underwent two liver MR exams: one preprandial after fasting and ...
Gregory Simchick   +4 more
wiley   +1 more source

Allocation of Indivisible Items With a Common Preference Graph: Minimizing Total Dissatisfaction

open access: yesNetworks, EarlyView.
ABSTRACT Allocating indivisible items among a set of agents is a frequently studied discrete optimization problem. In the setting considered in this work, the agents' preferences over the items are assumed to be identical. We consider a very recent measure for the overall quality of an allocation which does not rely on numerical valuations of the items.
Nina Chiarelli   +6 more
wiley   +1 more source

Exact Methods for the Cumulative Capacitated Vehicle Routing Problem With Time Windows

open access: yesNetworks, EarlyView.
ABSTRACT This article studies the cumulative capacitated vehicle routing problem with time windows (CCVRPTW). The CCVRPTW consists of deciding the routing schedules for a set of homogeneous capacitated vehicles such that the latency, that is, the sum of the service start times at the customers, is minimized and the time windows as well as the vehicle ...
Alan Osorio‐Mora, Timo Gschwind
wiley   +1 more source

Home - About - Disclaimer - Privacy