PubMed Health⌕ Search

SEARCH · PubMed Health

Results for “Parallel Algorithms”

Explore indexed PubMed citations for clinical trials, systematic reviews and public health research. Read source abstracts and follow each citation to its original PubMed record.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17Linked to original sources

Inherent smoothness of intensity patterns for intensity modulated radiation therapy generated by simultaneous projection algorithms.

The efficient delivery of intensity modulated radiation therapy (IMRT) depends on finding optimized beam intensity patterns that produce dose distributions, which meet given constraints for the tumour as well as any critical organs to be spared. Many optimization algorithms that are used for beamlet-based inverse planning are susceptible to large variations of neighbouring intensities. Accurately delivering an intensity pattern with a large number of extrema can prove impossible given the mechanical limitations of standard multileaf collimator (MLC) delivery systems. In this study, we apply Cimmino's simultaneous projection algorithm to the beamlet-based inverse planning problem, modelled mathematically as a system of linear inequalities. We show that using this method allows us to arrive at a smoother intensity pattern. Including nonlinear terms in the simultaneous projection algorithm to deal with dose-volume histogram (DVH) constraints does not compromise this property from our experimental observation. The smoothness properties are compared with those from other optimization algorithms which include simulated annealing and the gradient descent method. The simultaneous property of these algorithms is ideally suited to parallel computing technologies.

Algorithms↗

Automatic "pipeline" analysis of 3-D MRI data for clinical trials: application to multiple sclerosis.

The quantitative analysis of magnetic resonance imaging (MRI) data has become increasingly important in both research and clinical studies aiming at human brain development, function, and pathology. Inevitably, the role of quantitative image analysis in the evaluation of drug therapy will increase, driven in part by requirements imposed by regulatory agencies. However, the prohibitive length of time involved and the significant intraand inter-rater variability of the measurements obtained from manual analysis of large MRI databases represent major obstacles to the wider application of quantitative MRI analysis. We have developed a fully automatic "pipeline" image analysis framework and have successfully applied it to a number of large-scale, multicenter studies (more than 1,000 MRI scans). This pipeline system is based on robust image processing algorithms, executed in a parallel, distributed fashion. This paper describes the application of this system to the automatic quantification of multiple sclerosis lesion load in MRI, in the context of a phase III clinical trial. The pipeline results were evaluated through an extensive validation study, revealing that the obtained lesion measurements are statistically indistinguishable from those obtained by trained human observers. Given that intra- and inter-rater measurement variability is eliminated by automatic analysis, this system enhances the ability to detect small treatment effects not readily detectable through conventional analysis techniques. While useful for clinical trial analysis in multiple sclerosis, this system holds widespread potential for applications in other neurological disorders, as well as for the study of neurobiology in general.

Algorithms↗

Image reconstruction algorithm for a spinning strip CZT SPECT camera with a parallel slat collimator and small pixels.

This paper discusses the use of small pixels in a spinning CdZnTe single photon emission computed tomography (SPECT) camera that is mounted with a parallel slat collimator. In a conventional slat collimation configuration, there is a detector pixel between two adjacent collimator slats. In our design, the pixel size is halved. That is, there are two smaller pixels to replace a regular pixel between two adjacent slats while the collimator remains unchanged. It has an advantage over our older design that uses tilted slats. In order to acquire a complete data set the tilted-slat collimator must spin 360 degrees at each SPECT view while the proposed design requires only 180 degrees at each SPECT view. Computer simulations and phantom experiments have been carried out to investigate the performance of the small-pixel configuration. It is observed that this design has the potential to increase the spatial resolution of the detector while keeping photon counts the same.

Algorithms↗

Image reconstruction in peripheral and central regions-of-interest and data redundancy.

Algorithms have been developed for image reconstruction within a region-of-interest (ROI) from fan-beam data less than that required for reconstructing the entire image. However, these algorithms do not admit truncated data. In this work, we investigate exact ROI-image reconstruction from fan-beam data containing truncations by use of the so-called fan-beam backprojection-filtration (BPF) algorithm. We also generalize the fan-beam BPF algorithm to exploit redundant information inherent in the truncated fan-beam data. Because the parallel-beam scan can be interpreted as a special case of the fan-beam scan, based upon the fan-beam BPF algorithm, we derive a parallel-beam BPF algorithm for exactly reconstructing ROI images from truncated parallel-beam data. Furthermore, we investigate image reconstruction within two types of distinctive ROIs, which are referred to as the peripheral and central ROIs, respectively, from fan-beam data containing truncations and discuss their potential clinical applications. The results can readily be generalized to reconstructing 3D ROI images from data acquired in circular and helical cone-beam scan. They can also be extended to address ROI-image-reconstruction problems in parallel-, fan-, and cone-beam scans with general trajectories. The work not only has significant implications for clinical and animal-imaging applications of CT, but also may find applications in other imaging modalities.

Algorithms↗

Discretized torsional dynamics and the folding of an RNA chain.

The aim of this work is to implement a discrete coarse codification of local torsional states of the RNA chain backbone in order to explore the long-time limit dynamics and ultimately obtain a coarse solution to the RNA folding problem. A discrete representation of the soft-mode dynamics is turned into an algorithm for a rough structure prediction. The algorithm itself is inherently parallel, as it evaluates concurrent folding possibilities by pattern recognition, but it may be implemented in a personal computer as a chain of perturbation-translation-renormalization cycles performed on a binary matrix of local topological constraints. This requires suitable representational tools and a periodic quenching of the dynamics for system renormalization. A binary coding of local topological constraints associated with each structural motif is introduced, with each local topological constraint corresponding to a local torsional state. This treatment enables us to adopt a computation time step far larger than hydrodynamic drag time scales. Accordingly, the solvent is no longer treated as a hydrodynamic drag medium. Instead we incorporate its capacity for forming local conformation-dependent dielectric domains. Each translation of the matrix of local topological constraints (LTM's) depends on the conformation-dependent local dielectric created by a confined solvent. Folding pathways are resolved as transitions between patterns of locally encoded structural signals which change within the 1 ns-100 ms time scale range. These coarse folding pathways are generated by a search at regular intervals for structural patterns in the LTM. Each pattern is recorded as a base-pairing pattern (BPP) matrix, a consensus-evaluation operation subject to a renormalization feedback loop. Since several mutually conflicting consensus evaluations might occur at a given time, the need arises for a probabilistic approach appropriate for an ensemble of RNA molecules. Thus, a statistical dynamics of consensus formation is determined by the time evolution of the base pairing probability matrix. These dynamics are generated for a functional RNA molecule, a representative of the so-called group I ribozymes, in order to test the model. The resulting ensemble of conformations is sharply peaked and the most probable structure features the predominance of all phylogenetically conserved intrachain helices tantamount to ribozyme function. Furthermore, the magnesium-aided cooperativity that leads to the shaping of the catalytic core is elucidated. Once the predictive folding algorithm has been implemented, the validity of the so-called "adiabatic approximation" is tested. This approximation requires that conformational microstates be lumped up into BPP's which are treated as quasiequilibrium states, while folding pathways are coarsely represented as sequences of BPP transitions. To test the validity of this adiabatic ansatz, a computation of the coarse Shannon information entropy sigma associated to the specific partition of conformation space into BPP's is performed taking into account the LTM evolution and contrasted with the adiabatic computation. The results reveal a subordination of torsional microstate dynamics to BPP transitions within time scales relevant to folding. This adiabatic entrainment in the long-time limit is thus identified as responsible for the expediency of the folding process.

Algorithms↗

On the logic of hypothesis testing in functional imaging.

Statistics is nowadays the customary language of functional imaging. It is common to express an experimental setting as a set of null hypotheses over complex models and to present results as maps of p-values derived from sophisticated probability distributions. However, the growing interest in the development of advanced statistical algorithms is not always paralleled by similar attention to how these techniques may regiment the ways in which users draw inferences from their data. This article investigates the logical bases of current statistical approaches in functional imaging and probes their suitability to inductive inference in neuroscience. The frequentist approach to statistical inference is reviewed with attention to its two main constituents: Fisherian "significance testing" and Neyman-Pearson "hypothesis testing". It is shown that these conceptual systems, which are similar in the univariate testing case, dissociate into two quite different methods of inference when applied to the multiple testing problem, the typical framework of functional imaging. This difference is explained with reference to specific issues, like small volume correction, which are most likely to generate confusion in the practitioner. Further insight into this problem is achieved by recasting the multiple comparison problem into a multivariate Bayesian formulation. This formulation introduces a new perspective where the inferential process is more clearly defined in two distinct steps. The first one, inductive in form, uses exploratory techniques to acquire preliminary notions on the spatial patterns and the signal and noise characteristics. The (smaller) set of likely spatial patterns generated is then tested with newer data and a more rigorous multiple hypothesis testing technique (deductive step).

Algorithms↗

Transluminal color-coded three-dimensional magnetic resonance angiography for visualization of signal intensity distribution pattern within an unruptured cerebral aneurysm: preliminarily assessment with anterior communicating artery aneurysms.

The natural history of unruptured cerebral aneurysm is not known; also unknown is the potential growth and rupture in any individual aneurysm. The authors have developed transluminal color-coded three-dimensional magnetic resonance angiography (MRA) obtained by a time-of-flight sequence to investigate the interaction between the intra-aneurysmal signal intensity distribution patterns and configuration of unruptured cerebral aneurysms. Transluminal color-coded images were reconstructed from volume data of source magnetic resonance angiography by using a parallel volume-rendering algorithm with transluminal imaging technique. By selecting a numerical threshold range from a signal intensity opacity chart of the three-dimensional volume-rendering dataset several areas of signal intensity were depicted, assigned different colors, and visualized transparently through the walls of parent arteries and an aneurysm. Patterns of signal intensity distribution were analyzed with three operated cases of an unruptured anterior communicating artery aneurysm and compared with the actual configurations observed at microneurosurgery. A little difference in marginal features of an aneurysm was observed; however, transluminal color-coded images visualized the complex signal intensity distribution within an aneurysm in conjunction with aneurysmal geometry. Transluminal color-coded three-dimensional magnetic resonance angiography can thus provide numerical analysis of the interaction between spatial signal intensity distribution patterns and aneurysmal configurations and may offer an alternative and practical method to investigate the patient-specific natural history of individual unruptured cerebral aneurysms.

Aged↗

Transparent color-coded three-dimensional diffusion-weighted magnetic resonance imaging for the numerical analysis of reversible and irreversible hyperacute ischemic stroke--case report.

Although diffusion-weighted (DW) magnetic resonance (MR) imaging can detect hyperacute ischemic parenchyma with high sensitivity, the ability of DW images to reveal subtle change in abnormal diffusion may be limited by the conventional visual evaluation. To overcome the limitation, we have developed a method of transparent color-coded three-dimensional (3D) DW MR imaging for the computer-aided numerical analysis of hyperacute ischemic stroke. The 3D images were reconstructed from volume data of source DW images by using a parallel volume-rendering algorithm with transluminal imaging technique. By selecting a threshold range from a signal intensity opacity chart of volume-rendering data set, several high signal intensity areas were depicted and assigned to different colors, transparently through contours of the brain. This imaging was applied in a case of a recanalized middle cerebral artery (M2) occlusion with partially reversible ischemic parenchyma accompanied by partial recovery from ischemic neurological deficit. Complex and dynamic change in hyperacute ischemic parenchyma, with regression of subtle high signal intensity areas and progression of ischemic parenchyma, was depicted three-dimensionally. Transparent color-coded 3D DW MR imaging may provide computer-aided numerical analysis of hyperacute ischemic stroke appearing as a high signal intensity area on the source DW images.

Aged↗

Large-scale 3-D geometric reconstruction of the porcine coronary arterial vasculature based on detailed anatomical data.

The temporal and spatial distribution of coronary blood flow, pressure, and volume are determined by the branching pattern and three-dimensional (3-D) geometry of the coronary vasculature, and by the mechanics of heart wall and vascular tone. Consequently, a realistic simulation of coronary blood flow requires, as a first step, an accurate representation of the coronary vasculature in a 3-D model of the beating heart. In the present study, a large-scale stochastic reconstruction of the asymmetric coronary arterial trees (right coronary artery, RCA; left anterior descending, LAD; and left circumflex, LCx) of the porcine heart has been carried out to set the stage for future hemodynamic analysis. The model spans the entire coronary arterial tree down to the capillary vessels. The 3-D tree structure was reconstructed initially in rectangular slab geometry by means of global geometrical optimization using parallel simulated annealing (SA) algorithm. The SA optimization was subject to constraints prescribed by previously measured morphometric features of the coronary arterial trees. Subsequently, the reconstructed trees were mapped onto a prolate spheroid geometry of the heart. The transformed geometry was determined through least squares minimization of the related changes in both segments lengths and their angular characteristics. Vessel diameters were assigned based on a novel representation of diameter asymmetry along bifurcations. The reconstructed RCA, LAD and LCx arterial trees show qualitative resemblance to native coronary networks, and their morphological statistics are consistent with the measured data. The present model constitutes the first most extensive reconstruction of the entire coronary arterial system which will serve as a geometric foundation for future studies of flow in an anatomically accurate 3-D coronary vascular model.

Animals↗

Preverbal and verbal counting and computation.

We describe the preverbal system of counting and arithmetic reasoning revealed by experiments on numerical representations in animals. In this system, numerosities are represented by magnitudes, which are rapidly but inaccurately generated by the Meck and Church (1983) preverbal counting mechanism. We suggest the following. (1) The preverbal counting mechanism is the source of the implicit principles that guide the acquisition of verbal counting. (2) The preverbal system of arithmetic computation provides the framework for the assimilation of the verbal system. (3) Learning to count involves, in part, learning a mapping from the preverbal numerical magnitudes to the verbal and written number symbols and the inverse mappings from these symbols to the preverbal magnitudes. (4) Subitizing is the use of the preverbal counting process and the mapping from the resulting magnitudes to number words in order to generate rapidly the number words for small numerosities. (5) The retrieval of the number facts, which plays a central role in verbal computation, is mediated via the inverse mappings from verbal and written numbers to the preverbal magnitudes and the use of these magnitudes to find the appropriate cells in tabular arrangements of the answers. (6) This model of the fact retrieval process accounts for the salient features of the reaction time differences and error patterns revealed by experiments on mental arithmetic. (7) The application of verbal and written computational algorithms goes on in parallel with, and is to some extent guided by, preverbal computations, both in the child and in the adult.

Animals↗

Simulation of nasal flow by lattice Boltzmann methods.

The lattice Boltzmann method is used to calculate the incompressible, viscous flow of air through a model of a nasal cavity, used in experiments. Computations are performed for steady flows at the inspiration and expiration phase of nose breathing. Computed pressure distributions and friction coefficients compare well with Navier-Stokes solutions from a finite-volume method on structured, curvilinear grids. The comparison with conventional Navier-Stokes solvers shows several advantages of the lattice Boltzmann method in particular for bio-medical flow problems. These are the fast grid generation, the simple, granular algorithm, suited for efficient parallelization and the high flexibility for implementing complex boundary conditions and additional transport equations. Lattice Boltzmann methods are therefore efficient candidates for fast flow predictions in the frame of computer-aided rhino-surgery.

Computer Simulation↗

Numerical implementation of viscoelastic blood flow in a simplified arterial geometry.

The influence of the non-Newtonian stress-strain relation of blood on the oscillatory shear index (OSI) and mean wall shear stress (WSS) are described. The unsteady linear 1D momentum equation is solved for a viscoelastic fluid, with six elements of the Maxwell type and one dashpot element connected in parallel. A novel numerical algorithm is described which uses the upwind finite difference method to solve the equation of momentum. Results obtained by using a finite difference approach show significantly higher values of OSI when blood is assumed to be a viscoelastic fluid compared with those of simplified Newtonian fluid model. The calculation of OSI in human normal conditions for the Newtonian fluid differs in 12% (if alpha=0.02) from the results obtained from using the viscoelastic model.

Arteries↗

Fourier volume rendering for real time preview of digital reconstructed radiographs: a web-based implementation.

Digital reconstructed radiograph (DRR) constitutes an important tool in clinical radio-oncology. In this paper, a Fourier volume rendering (FVR) method is proposed, enabling real time preview of DRR. Important aspects related to re-sampling into the frequency domain are examined, leading to results of high quality. Experiments using phantom and clinical data sets are presented, demonstrating the effectiveness of the method for a real time execution. Furthermore, due to the inherent parallelism of the proposed algorithm, its execution time can be further reduced by distributing the required computations to more than one processors. The computational efficiency of the method highlights its suitability for integration into a web-based radiation treatment planning (RTP) system, using a client-server architecture. Thus, platform independent, real time tele-cooperation in clinical radio-oncology can be achieved.

Algorithms↗

Pore-scale dispersion in electrokinetic flow through a random sphere packing.

The three-dimensional velocity field and corresponding hydrodynamic dispersion in electrokinetic flow through a random bulk packing of impermeable, nonconducting spheres are studied by quantitative numerical analysis. First, a fixed bed with interparticle porosity of 0.38 is generated using a parallel collective-rearrangement algorithm. Then, the interparticle velocity field is calculated using the lattice-Boltzmann (LB) method, and a random-walk particle-tracking method is finally employed to model advection-diffusion of an inert tracer in the LB velocity field. We demonstrate that the pore-scale velocity profile for electroosmotic flow (EOF) is nonuniform even under most ideal conditions, including a negligible thickness of the electrical double layer compared to the mean pore size, a uniform distribution of the electrokinetic potential at the solid-liquid interface, and the absence of applied pressure gradients. This EOF dynamics is caused by a nonuniform distribution of the local electrical field strength in the sphere packing and engenders significant hydrodynamic dispersion compared to pluglike EOF through a single straight channel. Both transient and asymptotic dispersion behaviors are analyzed for EOF in the context of packing microstructure and are compared to pressure-driven flow in dependence of the average velocity through the bed. A better hydrodynamic performance of EOF originates in a still much smaller amplitude of velocity fluctuations on a mesoscopic scale (covering several particle diameters), as well as on the microscopic scale of an individual pore.

Journal Article↗

Structural behavior and self-assembly of Lennard-Jones clusters on rigid surfaces.

The phase behavior and surface pattern formation for intermediate size Lennard-Jones clusters on rigid surfaces are examined. We use a parallel tempering Monte Carlo algorithm, in the canonical ensemble. Tempering is done over the temperature domain in most of the calculations. A two-dimensional temperature and Hamiltonian tempering algorithm is also implemented, to examine its usefulness in investigating this type of problem. In general, we observe gas phase systems as they undergo a condensation transition on the surface, followed by a freezing transition. The final solid state pattern formed by the cluster on the surface is the result of a number of competing effects. First, there is a competition between attraction within the cluster and that between cluster and surface atoms. Second, a monolayer of Lennard-Jones atoms tends to pack in a hexadic geometry. This geometry is frustrated on a surface with a different symmetry. The molecular organization of the substrate has a serious impact on the cluster packing. The surface morphology and the size mismatch between cluster and surface atoms, along with the relative interaction strengths, determine which of the effects prevail. When the surface atoms are small enough, the interactions within the cluster determine the symmetry of the pattern. In such a case, the substrate behaves similarly to a continuous surface, and the low-temperature pattern is a hexadic monolayer. When the sizes of the surface and cluster atoms are comparable, the low-temperature adsorbed geometry mimics the substrate symmetry. On a face-centered cubic surface, face-centered cubic monolayers or droplets are obtained.

Journal Article↗

An algorithm for large scale density matrix renormalization group calculations.

We describe in detail our high-performance density matrix renormalization group (DMRG) algorithm for solving the electronic Schrodinger equation. We illustrate the linear scalability of our algorithm with calculations on up to 64 processors. The use of massively parallel machines in conjunction with our algorithm considerably extends the range of applicability of the DMRG in quantum chemistry.

Journal Article↗

Full configuration interaction approach to the few-electron problem in artificial atoms.

We present a new high performance configuration interaction code optimally designed for the calculation of the lowest-energy eigenstates of a few electrons in semiconductor quantum dots (also called artificial atoms) in the strong interaction regime. The implementation relies on a single-particle representation, but it is independent of the choice of the single-particle basis and, therefore, of the details of the device and configuration of external fields. Assuming no truncation of the Fock space of Slater determinants generated from the chosen single-particle basis, the code may tackle regimes where Coulomb interaction very effectively mixes many determinants. Typical strongly correlated systems lead to very large diagonalization problems; in our implementation, the secular equation is reduced to its minimal rank by exploiting the symmetry of the effective-mass interacting Hamiltonian, including square total spin. The resulting Hamiltonian is diagonalized via parallel implementation of the Lanczos algorithm. The code gives access to both wave functions and energies of first excited states. Excellent code scalability in a parallel environment is demonstrated; accuracy is tested for the case of up to eight electrons confined in a two-dimensional harmonic trap as the density is progressively diluted up to the Wigner regime, where correlations become dominant. Comparison with previous quantum Monte Carlo simulations in the Wigner regime demonstrates power and flexibility of the method.

Journal Article↗

Large-scale grid-enabled lattice Boltzmann simulations of complex fluid flow in porous media and under shear.

Well-designed lattice Boltzmann codes exploit the essentially embarrassingly parallel features of the algorithm and so can be run with considerable efficiency on modern supercomputers. Such scalable codes permit us to simulate the behaviour of increasingly large quantities of complex condensed matter systems. In the present paper, we present some preliminary results on the large-scale three-dimensional lattice Boltzmann simulation of binary immiscible fluid flows through a porous medium, derived from digitized X-ray micro-tomographic data of Bentheimer sandstone, and from the study of the same fluids under shear. Simulations on such scales can benefit considerably from the use of computational steering, and we describe our implementation of steering within the lattice Boltzmann code, called LB3D, making use of the RealityGrid steering library. Our large-scale simulations benefit from the new concept of capability computing, designed to prioritize the execution of big jobs on major supercomputing resources. The advent of persistent computational grids promises to provide an optimal environment in which to deploy these mesoscale simulation methods, which can exploit the distributed nature of computer, visualization and storage resources to reach scientific results rapidly; we discuss our work on the grid-enablement of lattice Boltzmann methods in this context.

Journal Article↗