996 resultados para parallel garbage collection
Resumo:
PURPOSE: Most existing methods for accelerated parallel imaging in MRI require additional data, which are used to derive information about the sensitivity profile of each radiofrequency (RF) channel. In this work, a method is presented to avoid the acquisition of separate coil calibration data for accelerated Cartesian trajectories. METHODS: Quadratic phase is imparted to the image to spread the signals in k-space (aka phase scrambling). By rewriting the Fourier transform as a convolution operation, a window can be introduced to the convolved chirp function, allowing a low-resolution image to be reconstructed from phase-scrambled data without prominent aliasing. This image (for each RF channel) can be used to derive coil sensitivities to drive existing parallel imaging techniques. As a proof of concept, the quadratic phase was applied by introducing an offset to the x(2) - y(2) shim and the data were reconstructed using adapted versions of the image space-based sensitivity encoding and GeneRalized Autocalibrating Partially Parallel Acquisitions algorithms. RESULTS: The method is demonstrated in a phantom (1 × 2, 1 × 3, and 2 × 2 acceleration) and in vivo (2 × 2 acceleration) using a 3D gradient echo acquisition. CONCLUSION: Phase scrambling can be used to perform parallel imaging acceleration without acquisition of separate coil calibration data, demonstrated here for a 3D-Cartesian trajectory. Further research is required to prove the applicability to other 2D and 3D sampling schemes. Magn Reson Med, 2014. © 2014 Wiley Periodicals, Inc.
Resumo:
The use of self-calibrating techniques in parallel magnetic resonance imaging eliminates the need for coil sensitivity calibration scans and avoids potential mismatches between calibration scans and subsequent accelerated acquisitions (e.g., as a result of patient motion). Most examples of self-calibrating Cartesian parallel imaging techniques have required the use of modified k-space trajectories that are densely sampled at the center and more sparsely sampled in the periphery. However, spiral and radial trajectories offer inherent self-calibrating characteristics because of their densely sampled center. At no additional cost in acquisition time and with no modification in scanning protocols, in vivo coil sensitivity maps may be extracted from the densely sampled central region of k-space. This work demonstrates the feasibility of self-calibrated spiral and radial parallel imaging using a previously described iterative non-Cartesian sensitivity encoding algorithm.
Resumo:
We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.
Resumo:
The Attorney General’s Consumer Protection Division receives hundreds of calls and consumer complaints every year. Follow these tips to avoid unexpected expense and disappointments. This record is about: Fair Debt Collection: Know Your Rights
Resumo:
Comprend : Mémoires concernant les affaires de France sous la régence de Marie de Médicis ; Mémoires du duc de Rohan
Resumo:
Donateur : Touring-Club de France
Resumo:
Donateur : Touring-Club de France
Resumo:
Donateur : Touring-Club de France
Resumo:
A catalogue of type specimens of Collembola, Diplura, Archaeognatha, Ephemeroptera, and Blattaria deposited in the Invertebrate Collection of the Instituto Nacional de Pesquisas da Amazônia (INPA), Manaus, Brazil, is presented and updated to June, 2007. It contains a total of 22 holotypes and 18 lots of paratypes of 22 species of Collembola; one holotype and one paratype of one species of Diplura; four holotypes and four paratypes of four species of Archaeognatha; 10 holotypes and thirteen lots of paratypes of 11 species of Ephemeroptera; and one holotype and two lots of paratypes of one species of Blattaria. Specific names are listed alphabetically within family, followed by bibliographical citation, original genus name, status of type, collection number and locality data.
Resumo:
A catalogue of the type specimens of Isoptera, Mantodea, Mecoptera, Orthoptera, Plecoptera, Trichoptera, and Zoraptera deposited in the Invertebrate Collection of the Instituto Nacional de Pesquisas da Amazônia (INPA), Manaus, Brazil, is presented and updated to December, 2007. A total of eight holotypes and seven lots of paratypes of nine species of Isoptera; three holotypes and one paratype of three species of Mantodea; five holotypes and five lots of paratypes of five species of Mecoptera; eight holotypes and five lots of paratypes of eleven species of Orthoptera; three holotypes, three neotypes and two lots of paratypes of seven species of Plecoptera; six holotypes and seven lots of paratypes of ten species of Trichoptera; and two holotypes and three lots of paratypes of three species of Zoraptera, are listed. Specific names are listed alphabetically within the family, followed by bibliographic citation, original genus name, status of type, collection number, locality data and remarks when appropriate.