Optimizing saturation-recovery measurements of the longitudinal relaxation rate under time constraints
نویسندگان
چکیده
منابع مشابه
Optimizing saturation-recovery measurements of the longitudinal relaxation rate under time constraints.
The saturation-recovery method using two and three recovery times is studied for conditions in which the sum of recovery times is 1.5T(1) to 3T(1), where T(1) is the longitudinal relaxation time. These conditions can reduce scan time considerably for long T(1) species and make longitudinal relaxation rate R(1) (R(1) = 1/T(1)) mapping for body fluids clinically feasible. Monte Carlo computer sim...
متن کاملOptimizing Recurrent Neural Networks Architectures under Time Constraints
Recurrent neural network (RNN)’s architecture is a key factor influencing its performance. We propose algorithms to optimize hidden sizes under running time constraint. We convert the discrete optimization into a subset selection problem. By novel transformations, the objective function becomes submodular and constraint becomes supermodular. A greedy algorithm with bounds is suggested to solve ...
متن کاملOptimizing phylogenetic diversity under constraints.
Phylogenetic diversity (PD) is a measure of the extent to which different subsets of taxa span an evolutionary tree, and provides a quantitative tool for studying biodiversity conservation. Recently, it was shown that the problem of finding subsets of taxa of given size to maximize PD can be efficiently solved by a greedy algorithm. In this paper, we extend this earlier work, beginning with a m...
متن کاملOn the Validity Domain of H∞ Controllers under Saturation Constraints
The H∞ disturbance rejection problem for a family of linear systems subject to control input constraints is considered. A class of controllers generalizing the standard Riccati equationbased state feedback is proposed and an estimate of their domain of validity is derived. A simple criterion for tuning controller parameters for validity domain maximization and local performance improvement is p...
متن کاملOptimizing Query Answering under Ontological Constraints
Ontological queries are evaluated against a database combined with ontological constraints. Answering such queries is a challenging new problem for database research. For many ontological modelling languages, query answering can be solved via query rewriting: given a conjunctive query and an ontology, the query can be transformed into a first-order query, called the perfect rewriting, that take...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Magnetic Resonance in Medicine
سال: 2009
ISSN: 0740-3194
DOI: 10.1002/mrm.22111