Parallel preconditioning techniques for sparse CG solvers
Energy Technology Data Exchange (ETDEWEB)
Basermann, A.; Reichel, B.; Schelthoff, C. [Central Institute for Applied Mathematics, Juelich (Germany)
1996-12-31
Conjugate gradient (CG) methods to solve sparse systems of linear equations play an important role in numerical methods for solving discretized partial differential equations. The large size and the condition of many technical or physical applications in this area result in the need for efficient parallelization and preconditioning techniques of the CG method. In particular for very ill-conditioned matrices, sophisticated preconditioner are necessary to obtain both acceptable convergence and accuracy of CG. Here, we investigate variants of polynomial and incomplete Cholesky preconditioners that markedly reduce the iterations of the simply diagonally scaled CG and are shown to be well suited for massively parallel machines.
Longoni, Gianluca
In the nuclear science and engineering field, radiation transport calculations play a key-role in the design and optimization of nuclear devices. The linear Boltzmann equation describes the angular, energy and spatial variations of the particle or radiation distribution. The discrete ordinates method (S N) is the most widely used technique for solving the linear Boltzmann equation. However, for realistic problems, the memory and computing time require the use of supercomputers. This research is devoted to the development of new formulations for the SN method, especially for highly angular dependent problems, in parallel environments. The present research work addresses two main issues affecting the accuracy and performance of SN transport theory methods: quadrature sets and acceleration techniques. New advanced quadrature techniques which allow for large numbers of angles with a capability for local angular refinement have been developed. These techniques have been integrated into the 3-D SN PENTRAN (Parallel Environment Neutral-particle TRANsport) code and applied to highly angular dependent problems, such as CT-Scan devices, that are widely used to obtain detailed 3-D images for industrial/medical applications. In addition, the accurate simulation of core physics and shielding problems with strong heterogeneities and transport effects requires the numerical solution of the transport equation. In general, the convergence rate of the solution methods for the transport equation is reduced for large problems with optically thick regions and scattering ratios approaching unity. To remedy this situation, new acceleration algorithms based on the Even-Parity Simplified SN (EP-SSN) method have been developed. A new stand-alone code system, PENSSn (Parallel Environment Neutral-particle Simplified SN), has been developed based on the EP-SSN method. The code is designed for parallel computing environments with spatial, angular and hybrid (spatial/angular) domain
A Hybrid Parallel Preconditioning Algorithm For CFD
Barth,Timothy J.; Tang, Wei-Pai; Kwak, Dochan (Technical Monitor)
1995-01-01
A new hybrid preconditioning algorithm will be presented which combines the favorable attributes of incomplete lower-upper (ILU) factorization with the favorable attributes of the approximate inverse method recently advocated by numerous researchers. The quality of the preconditioner is adjustable and can be increased at the cost of additional computation while at the same time the storage required is roughly constant and approximately equal to the storage required for the original matrix. In addition, the preconditioning algorithm suggests an efficient and natural parallel implementation with reduced communication. Sample calculations will be presented for the numerical solution of multi-dimensional advection-diffusion equations. The matrix solver has also been embedded into a Newton algorithm for solving the nonlinear Euler and Navier-Stokes equations governing compressible flow. The full paper will show numerous examples in CFD to demonstrate the efficiency and robustness of the method.
Parallel preconditioned conjugate gradient algorithm applied to neutron diffusion problem
International Nuclear Information System (INIS)
Majumdar, A.; Martin, W.R.
1992-01-01
Numerical solution of the neutron diffusion problem requires solving a linear system of equations such as Ax = b, where A is an n x n symmetric positive definite (SPD) matrix; x and b are vectors with n components. The preconditioned conjugate gradient (PCG) algorithm is an efficient iterative method for solving such a linear system of equations. In this paper, the authors describe the implementation of a parallel PCG algorithm on a shared memory machine (BBN TC2000) and on a distributed workstation (IBM RS6000) environment created by the parallel virtual machine parallelization software
An M-step preconditioned conjugate gradient method for parallel computation
Adams, L.
1983-01-01
This paper describes a preconditioned conjugate gradient method that can be effectively implemented on both vector machines and parallel arrays to solve sparse symmetric and positive definite systems of linear equations. The implementation on the CYBER 203/205 and on the Finite Element Machine is discussed and results obtained using the method on these machines are given.
Parallelized preconditioned BiCGStab solution of sparse linear system equations in F-COBRA-TF
International Nuclear Information System (INIS)
Geemert, Rene van; Glück, Markus; Riedmann, Michael; Gabriel, Harry
2011-01-01
Recently, the in-house development of a preconditioned and parallelized BiCGStab solver has been pursued successfully in AREVA’s advanced sub-channel code F-COBRA-TF. This solver can be run either in a sequential computation mode on a single CPU, or in a parallel computation mode on multiple parallel CPUs. The developed procedure enables the computation of several thousands of successive sparse linear system solutions in F-COBRA-TF with acceptable wall clock run times. The current paper provides general information about F-COBRA-TF in terms of modeling capabilities and application areas, and points out where the relevance arises for the efficient iterative solution of sparse linear systems. Furthermore, the preconditioning and parallelization strategies in the developed BiCGStab iterative solution approach are discussed. The paper is concluded with a number of verification examples. (author)
Weighted graph based ordering techniques for preconditioned conjugate gradient methods
Clift, Simon S.; Tang, Wei-Pai
1994-01-01
We describe the basis of a matrix ordering heuristic for improving the incomplete factorization used in preconditioned conjugate gradient techniques applied to anisotropic PDE's. Several new matrix ordering techniques, derived from well-known algorithms in combinatorial graph theory, which attempt to implement this heuristic, are described. These ordering techniques are tested against a number of matrices arising from linear anisotropic PDE's, and compared with other matrix ordering techniques. A variation of RCM is shown to generally improve the quality of incomplete factorization preconditioners.
Parallelization of the preconditioned IDR solver for modern multicore computer systems
Bessonov, O. A.; Fedoseyev, A. I.
2012-10-01
This paper present the analysis, parallelization and optimization approach for the large sparse matrix solver CNSPACK for modern multicore microprocessors. CNSPACK is an advanced solver successfully used for coupled solution of stiff problems arising in multiphysics applications such as CFD, semiconductor transport, kinetic and quantum problems. It employs iterative IDR algorithm with ILU preconditioning (user chosen ILU preconditioning order). CNSPACK has been successfully used during last decade for solving problems in several application areas, including fluid dynamics and semiconductor device simulation. However, there was a dramatic change in processor architectures and computer system organization in recent years. Due to this, performance criteria and methods have been revisited, together with involving the parallelization of the solver and preconditioner using Open MP environment. Results of the successful implementation for efficient parallelization are presented for the most advances computer system (Intel Core i7-9xx or two-processor Xeon 55xx/56xx).
Koldan, Jelena; Puzyrev, Vladimir; de la Puente, Josep; Houzeaux, Guillaume; Cela, José María
2014-06-01
We present an elaborate preconditioning scheme for Krylov subspace methods which has been developed to improve the performance and reduce the execution time of parallel node-based finite-element (FE) solvers for 3-D electromagnetic (EM) numerical modelling in exploration geophysics. This new preconditioner is based on algebraic multigrid (AMG) that uses different basic relaxation methods, such as Jacobi, symmetric successive over-relaxation (SSOR) and Gauss-Seidel, as smoothers and the wave front algorithm to create groups, which are used for a coarse-level generation. We have implemented and tested this new preconditioner within our parallel nodal FE solver for 3-D forward problems in EM induction geophysics. We have performed series of experiments for several models with different conductivity structures and characteristics to test the performance of our AMG preconditioning technique when combined with biconjugate gradient stabilized method. The results have shown that, the more challenging the problem is in terms of conductivity contrasts, ratio between the sizes of grid elements and/or frequency, the more benefit is obtained by using this preconditioner. Compared to other preconditioning schemes, such as diagonal, SSOR and truncated approximate inverse, the AMG preconditioner greatly improves the convergence of the iterative solver for all tested models. Also, when it comes to cases in which other preconditioners succeed to converge to a desired precision, AMG is able to considerably reduce the total execution time of the forward-problem code-up to an order of magnitude. Furthermore, the tests have confirmed that our AMG scheme ensures grid-independent rate of convergence, as well as improvement in convergence regardless of how big local mesh refinements are. In addition, AMG is designed to be a black-box preconditioner, which makes it easy to use and combine with different iterative methods. Finally, it has proved to be very practical and efficient in the
CSIR Research Space (South Africa)
Toper, AZ
1998-01-01
Full Text Available This research report discusses the development of preconditioning techniques to control face bursts, for safer mining in seismically hazardous areas. Preconditioning involves regularly setting off carefully tailored blasts in the fractured rock...
A Preconditioning Technique for First-Order Primal-Dual Splitting Method in Convex Optimization
Directory of Open Access Journals (Sweden)
Meng Wen
2017-01-01
Full Text Available We introduce a preconditioning technique for the first-order primal-dual splitting method. The primal-dual splitting method offers a very general framework for solving a large class of optimization problems arising in image processing. The key idea of the preconditioning technique is that the constant iterative parameters are updated self-adaptively in the iteration process. We also give a simple and easy way to choose the diagonal preconditioners while the convergence of the iterative algorithm is maintained. The efficiency of the proposed method is demonstrated on an image denoising problem. Numerical results show that the preconditioned iterative algorithm performs better than the original one.
Preconditioned conjugate gradient technique for the analysis of symmetric anisotropic structures
Noor, Ahmed K.; Peters, Jeanne M.
1987-01-01
An efficient preconditioned conjugate gradient (PCG) technique and a computational procedure are presented for the analysis of symmetric anisotropic structures. The technique is based on selecting the preconditioning matrix as the orthotropic part of the global stiffness matrix of the structure, with all the nonorthotropic terms set equal to zero. This particular choice of the preconditioning matrix results in reducing the size of the analysis model of the anisotropic structure to that of the corresponding orthotropic structure. The similarities between the proposed PCG technique and a reduction technique previously presented by the authors are identified and exploited to generate from the PCG technique direct measures for the sensitivity of the different response quantities to the nonorthotropic (anisotropic) material coefficients of the structure. The effectiveness of the PCG technique is demonstrated by means of a numerical example of an anisotropic cylindrical panel.
Energy Technology Data Exchange (ETDEWEB)
Chen, Ke [Univ. of Liverpool (United Kingdom)
1996-12-31
We study various preconditioning techniques for the iterative solution of boundary integral equations, and aim to provide a theory for a class of sparse preconditioners. Two related ideas are explored here: singularity separation and inverse approximation. Our preliminary conclusion is that singularity separation based preconditioners perform better than approximate inverse based while it is desirable to have both features.
International Nuclear Information System (INIS)
Hwang, F-N; Wei, Z-H; Huang, T-M; Wang Weichung
2010-01-01
We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc's efficient and various parallel operations, linear solvers, preconditioning schemes, and easy usages. The parallel eigenvalue solver is then used to solve higher degree polynomial eigenvalue problems arising in numerical simulations of three dimensional quantum dots governed by Schroedinger's equations. We find that the parallel restricted additive Schwarz preconditioner in conjunction with a parallel Krylov subspace method (e.g. GMRES) can solve the correction equations, the most costly step in the Jacobi-Davidson algorithm, very efficiently in parallel. Besides, the overall performance is quite satisfactory. We have observed near perfect superlinear speedup by using up to 320 processors. The parallel eigensolver can find all target interior eigenpairs of a quintic polynomial eigenvalue problem with more than 32 million variables within 12 minutes by using 272 Intel 3.0 GHz processors.
Synchronization Techniques in Parallel Discrete Event Simulation
Lindén, Jonatan
2018-01-01
Discrete event simulation is an important tool for evaluating system models in many fields of science and engineering. To improve the performance of large-scale discrete event simulations, several techniques to parallelize discrete event simulation have been developed. In parallel discrete event simulation, the work of a single discrete event simulation is distributed over multiple processing elements. A key challenge in parallel discrete event simulation is to ensure that causally dependent ...
Energy Technology Data Exchange (ETDEWEB)
McLay, R.T.; Carey, G.F.
1996-12-31
In this study we consider parallel solution of sparse linear systems arising from discretized PDE`s. As part of our continuing work on our parallel PCG Solver package, we have made improvements in two areas. The first is improving the performance of the matrix-vector product. Here on regular finite-difference grids, we are able to use the cache memory more efficiently for smaller domains or where there are multiple degrees of freedom. The second problem of interest in the present work is the construction of preconditioners in the context of the parallel PCG solver we are developing. Here the problem is partitioned over a set of processors subdomains and the matrix-vector product for PCG is carried out in parallel for overlapping grid subblocks. For problems of scaled speedup, the actual rate of convergence of the unpreconditioned system deteriorates as the mesh is refined. Multigrid and subdomain strategies provide a logical approach to resolving the problem. We consider the parallel trade-offs between communication and computation and provide a complexity analysis of a representative algorithm. Some preliminary calculations using the parallel package and comparisons with other preconditioners are provided together with parallel performance results.
Sprick, Justin D; Rickards, Caroline A
2017-11-01
Remote ischemic preconditioning (RIPC) is characterized by the cyclical application of limb blood flow restriction and reperfusion and has been shown to protect vital organs during a subsequent ischemic insult. Blood flow restriction exercise (BFRE) similarly combines bouts of blood flow restriction with low-intensity exercise and thus could potentially emulate the protection demonstrated by RIPC. One concern with BFRE, however, is the potential for an augmented rise in sympathetic outflow due to greater activation of the exercise pressor reflex. Because of the use of lower workloads, however, we hypothesized that BFRE would elicit an attenuated increase in sympathetic outflow [assessed via plasma norepinephrine (NE) and mean arterial pressure (MAP)] and middle cerebral artery velocity (MCAv) when compared with conventional exercise (CE). Fifteen subjects underwent two leg press exercise interventions: 1 ) BFRE-220 mmHg bilateral thigh occlusion at 20% 1 rep-max (1RM), and 2 ) CE-65% 1RM without occlusion. Each condition consisted of 4 × 5-min cycles of exercise, with 3 × 10-reps in each cycle. Five minutes of rest and reperfusion (for BFRE) followed each cycle. MAP increased with exercise ( P exercise ( P exercise only ( P = 0.07). Plasma NE concentration increased with CE only ( P exercise ( P ≤ 0.02). The attenuated sympathetic response, combined with similar cerebrovascular responses, suggest that cyclical BFRE could be explored as an alternative to CE in the clinical setting. Copyright © 2017 the American Physiological Society.
Jönsthövel, T.B.; Van Gijzen, M.B.; MacLachlan, S.; Vuik, C.; Scarpas, A.
2011-01-01
The demand for large FE meshes increases as parallel computing becomes the standard in FE simulations. Direct and iterative solution methods are used to solve the resulting linear systems. Many applications concern composite materials, which are characterized by large discontinuities in the material
Xu, Zheng; Wang, Sheng; Li, Yeqing; Zhu, Feiyun; Huang, Junzhou
2018-02-08
The most recent history of parallel Magnetic Resonance Imaging (pMRI) has in large part been devoted to finding ways to reduce acquisition time. While joint total variation (JTV) regularized model has been demonstrated as a powerful tool in increasing sampling speed for pMRI, however, the major bottleneck is the inefficiency of the optimization method. While all present state-of-the-art optimizations for the JTV model could only reach a sublinear convergence rate, in this paper, we squeeze the performance by proposing a linear-convergent optimization method for the JTV model. The proposed method is based on the Iterative Reweighted Least Squares algorithm. Due to the complexity of the tangled JTV objective, we design a novel preconditioner to further accelerate the proposed method. Extensive experiments demonstrate the superior performance of the proposed algorithm for pMRI regarding both accuracy and efficiency compared with state-of-the-art methods.
Parallel computing techniques for rotorcraft aerodynamics
Ekici, Kivanc
The modification of unsteady three-dimensional Navier-Stokes codes for application on massively parallel and distributed computing environments is investigated. The Euler/Navier-Stokes code TURNS (Transonic Unsteady Rotor Navier-Stokes) was chosen as a test bed because of its wide use by universities and industry. For the efficient implementation of TURNS on parallel computing systems, two algorithmic changes are developed. First, main modifications to the implicit operator, Lower-Upper Symmetric Gauss Seidel (LU-SGS) originally used in TURNS, is performed. Second, application of an inexact Newton method, coupled with a Krylov subspace iterative method (Newton-Krylov method) is carried out. Both techniques have been tried previously for the Euler equations mode of the code. In this work, we have extended the methods to the Navier-Stokes mode. Several new implicit operators were tried because of convergence problems of traditional operators with the high cell aspect ratio (CAR) grids needed for viscous calculations on structured grids. Promising results for both Euler and Navier-Stokes cases are presented for these operators. For the efficient implementation of Newton-Krylov methods to the Navier-Stokes mode of TURNS, efficient preconditioners must be used. The parallel implicit operators used in the previous step are employed as preconditioners and the results are compared. The Message Passing Interface (MPI) protocol has been used because of its portability to various parallel architectures. It should be noted that the proposed methodology is general and can be applied to several other CFD codes (e.g. OVERFLOW).
Constraint treatment techniques and parallel algorithms for multibody dynamic analysis. Ph.D. Thesis
Chiou, Jin-Chern
1990-01-01
Computational procedures for kinematic and dynamic analysis of three-dimensional multibody dynamic (MBD) systems are developed from the differential-algebraic equations (DAE's) viewpoint. Constraint violations during the time integration process are minimized and penalty constraint stabilization techniques and partitioning schemes are developed. The governing equations of motion, a two-stage staggered explicit-implicit numerical algorithm, are treated which takes advantage of a partitioned solution procedure. A robust and parallelizable integration algorithm is developed. This algorithm uses a two-stage staggered central difference algorithm to integrate the translational coordinates and the angular velocities. The angular orientations of bodies in MBD systems are then obtained by using an implicit algorithm via the kinematic relationship between Euler parameters and angular velocities. It is shown that the combination of the present solution procedures yields a computationally more accurate solution. To speed up the computational procedures, parallel implementation of the present constraint treatment techniques, the two-stage staggered explicit-implicit numerical algorithm was efficiently carried out. The DAE's and the constraint treatment techniques were transformed into arrowhead matrices to which Schur complement form was derived. By fully exploiting the sparse matrix structural analysis techniques, a parallel preconditioned conjugate gradient numerical algorithm is used to solve the systems equations written in Schur complement form. A software testbed was designed and implemented in both sequential and parallel computers. This testbed was used to demonstrate the robustness and efficiency of the constraint treatment techniques, the accuracy of the two-stage staggered explicit-implicit numerical algorithm, and the speed up of the Schur-complement-based parallel preconditioned conjugate gradient algorithm on a parallel computer.
An efficient preconditioning technique using Krylov subspace methods for 3D characteristics solvers
International Nuclear Information System (INIS)
Dahmani, M.; Le Tellier, R.; Roy, R.; Hebert, A.
2005-01-01
The Generalized Minimal RESidual (GMRES) method, using a Krylov subspace projection, is adapted and implemented to accelerate a 3D iterative transport solver based on the characteristics method. Another acceleration technique called the self-collision rebalancing technique (SCR) can also be used to accelerate the solution or as a left preconditioner for GMRES. The GMRES method is usually used to solve a linear algebraic system (Ax=b). It uses K(r (o) ,A) as projection subspace and AK(r (o) ,A) for the orthogonalization of the residual. This paper compares the performance of these two combined methods on various problems. To implement the GMRES iterative method, the characteristics equations are derived in linear algebra formalism by using the equivalence between the method of characteristics and the method of collision probability to end up with a linear algebraic system involving fluxes and currents. Numerical results show good performance of the GMRES technique especially for the cases presenting large material heterogeneity with a scattering ratio close to 1. Similarly, the SCR preconditioning slightly increases the GMRES efficiency
Parallel halftoning technique using dot diffusion optimization
Molina-Garcia, Javier; Ponomaryov, Volodymyr I.; Reyes-Reyes, Rogelio; Cruz-Ramos, Clara
2017-05-01
In this paper, a novel approach for halftone images is proposed and implemented for images that are obtained by the Dot Diffusion (DD) method. Designed technique is based on an optimization of the so-called class matrix used in DD algorithm and it consists of generation new versions of class matrix, which has no baron and near-baron in order to minimize inconsistencies during the distribution of the error. Proposed class matrix has different properties and each is designed for two different applications: applications where the inverse-halftoning is necessary, and applications where this method is not required. The proposed method has been implemented in GPU (NVIDIA GeForce GTX 750 Ti), multicore processors (AMD FX(tm)-6300 Six-Core Processor and in Intel core i5-4200U), using CUDA and OpenCV over a PC with linux. Experimental results have shown that novel framework generates a good quality of the halftone images and the inverse halftone images obtained. The simulation results using parallel architectures have demonstrated the efficiency of the novel technique when it is implemented in real-time processing.
Kronecker Products on Preconditioning
Gao, Longfei
2013-01-01
techniques have become increasingly popular due to their great potential on large scale computation. In this work, we present preconditioning techniques for linear systems built with tensor product basis functions. Efficient algorithms are designed
Logical inference techniques for loop parallelization
DEFF Research Database (Denmark)
Oancea, Cosmin Eugen; Rauchwerger, Lawrence
2012-01-01
the parallelization transformation by verifying the independence of the loop's memory references. To this end it represents array references using the USR (uniform set representation) language and expresses the independence condition as an equation, S={}, where S is a set expression representing array indexes. Using...... of their estimated complexities. We evaluate our automated solution on 26 benchmarks from PERFECT-CLUB and SPEC suites and show that our approach is effective in parallelizing large, complex loops and obtains much better full program speedups than the Intel and IBM Fortran compilers....
Logical inference techniques for loop parallelization
Oancea, Cosmin E.; Rauchwerger, Lawrence
2012-01-01
This paper presents a fully automatic approach to loop parallelization that integrates the use of static and run-time analysis and thus overcomes many known difficulties such as nonlinear and indirect array indexing and complex control flow. Our hybrid analysis framework validates the parallelization transformation by verifying the independence of the loop's memory references. To this end it represents array references using the USR (uniform set representation) language and expresses the independence condition as an equation, S = Ø, where S is a set expression representing array indexes. Using a language instead of an array-abstraction representation for S results in a smaller number of conservative approximations but exhibits a potentially-high runtime cost. To alleviate this cost we introduce a language translation F from the USR set-expression language to an equally rich language of predicates (F(S) ⇒ S = Ø). Loop parallelization is then validated using a novel logic inference algorithm that factorizes the obtained complex predicates (F(S)) into a sequence of sufficient-independence conditions that are evaluated first statically and, when needed, dynamically, in increasing order of their estimated complexities. We evaluate our automated solution on 26 benchmarks from PERFECTCLUB and SPEC suites and show that our approach is effective in parallelizing large, complex loops and obtains much better full program speedups than the Intel and IBM Fortran compilers. Copyright © 2012 ACM.
Logical inference techniques for loop parallelization
Oancea, Cosmin E.
2012-01-01
This paper presents a fully automatic approach to loop parallelization that integrates the use of static and run-time analysis and thus overcomes many known difficulties such as nonlinear and indirect array indexing and complex control flow. Our hybrid analysis framework validates the parallelization transformation by verifying the independence of the loop\\'s memory references. To this end it represents array references using the USR (uniform set representation) language and expresses the independence condition as an equation, S = Ø, where S is a set expression representing array indexes. Using a language instead of an array-abstraction representation for S results in a smaller number of conservative approximations but exhibits a potentially-high runtime cost. To alleviate this cost we introduce a language translation F from the USR set-expression language to an equally rich language of predicates (F(S) ⇒ S = Ø). Loop parallelization is then validated using a novel logic inference algorithm that factorizes the obtained complex predicates (F(S)) into a sequence of sufficient-independence conditions that are evaluated first statically and, when needed, dynamically, in increasing order of their estimated complexities. We evaluate our automated solution on 26 benchmarks from PERFECTCLUB and SPEC suites and show that our approach is effective in parallelizing large, complex loops and obtains much better full program speedups than the Intel and IBM Fortran compilers. Copyright © 2012 ACM.
Parallel pic plasma simulation through particle decomposition techniques
International Nuclear Information System (INIS)
Briguglio, S.; Vlad, G.; Di Martino, B.; Naples, Univ. 'Federico II'
1998-02-01
Particle-in-cell (PIC) codes are among the major candidates to yield a satisfactory description of the detail of kinetic effects, such as the resonant wave-particle interaction, relevant in determining the transport mechanism in magnetically confined plasmas. A significant improvement of the simulation performance of such codes con be expected from parallelization, e.g., by distributing the particle population among several parallel processors. Parallelization of a hybrid magnetohydrodynamic-gyrokinetic code has been accomplished within the High Performance Fortran (HPF) framework, and tested on the IBM SP2 parallel system, using a 'particle decomposition' technique. The adopted technique requires a moderate effort in porting the code in parallel form and results in intrinsic load balancing and modest inter processor communication. The performance tests obtained confirm the hypothesis of high effectiveness of the strategy, if targeted towards moderately parallel architectures. Optimal use of resources is also discussed with reference to a specific physics problem [it
International Nuclear Information System (INIS)
Longoni, G.; Haghighat, A.; Sjoden, G.
2005-01-01
This paper discusses a new preconditioned Sn algorithm referred to as FAST (Flux Acceleration Sn Transport). This algorithm uses the PENSSn code as the pre-conditioner, and the PENTRANSSn code system as the transport solver. PENSSn is developed based on the even-parity simplified Sn formulation in a parallel environment, and PENTRAN-SSn is a version of PENTRAN that uses PENSSn as the pre-conditioner with the FAST system. The paper briefly discusses the EP-SSn formulation and important numerical features of PENSSn. The FAST algorithm is discussed and tested for the C5G7 MOX eigenvalue benchmark problem. It is demonstrated that FAST leads to significant speedups (∼7) over the standard PENTRAN code. Moreover, FAST shows closer agreement with a reference Monte Carlo simulation. (authors)
Energy Technology Data Exchange (ETDEWEB)
Choi, Kwan Woo; Son, Soon Yong [Dept. of Radiology, Asan Medical Center, Seoul (Korea, Republic of); Min, Jung Whan [Dept. of Radiological Technology, Shingu University, Sungnam (Korea, Republic of); Kwon, Kyung Tae [Dept. of Radiological Technology, Dongnam Health University, Suwon (Korea, Republic of); Yoo, Beong Gyu; Lee, Jong Seok [Dept. of Radiotechnology, Wonkwang Health Science University, Iksan (Korea, Republic of)
2015-12-15
The purpose of this study was to investigate the problems of a signal to noise ratio measurement using a two region measurement method that is conventionally used when using a multi-channel coil and a parallel imaging technique. As a research method, after calculating the standard SNR using a single channel head coil of which coil satisfies three preconditions when using a two region measurement method, we made comparisons and evaluations after calculating an SNR by using a two region measurement method of which method is problematic because it is used without considering the methods recommended by reputable organizations and the preconditions at the time of using a multi-channel coil and a parallel imaging technique. We found that a two region measurement method using a multi-channel coil and a parallel imaging technique shows the highest relative standard deviation, and thus shows a low degree of precision. In addition, we found out that the difference of SNR according to ROI location was very high, and thus a spatial noise distribution was not uniform. Also, 95% confidence interval through Blend-Altman plot is the widest, and thus the conformity degree with a two region measurement method using the standard single channel head coil is low. By directly comparing an AAPM method, which serves as a standard of a performance evaluation test of a magnetic resonance imaging device under the same image acquisition conditions, an NEMA method which can accurately determine the noise level in a signal region and the methods recommended by manufacturers of a magnetic resonance imaging device, there is a significance in that we quantitatively verified the inaccurate problems of a signal to noise ratio using a two region measurement method when using a multi-channel coil and a parallel imaging technique of which method does not satisfy the preconditions that researchers could overlook.
New partially parallel acquisition technique in cerebral imaging: preliminary findings
International Nuclear Information System (INIS)
Tintera, Jaroslav; Gawehn, Joachim; Bauermann, Thomas; Vucurevic, Goran; Stoeter, Peter
2004-01-01
In MRI applications where short acquisition time is necessary, the increase of acquisition speed is often at the expense of image resolution and SNR. In such cases, the newly developed parallel acquisition techniques could provide images without mentioned limitations and in reasonably shortened measurement time. A newly designed eight-channel head coil array (i-PAT coil) allowing for parallel acquisition of independently reconstructed images (GRAPPA mode) has been tested for its applicability in neuroradiology. Image homogeneity was tested in standard phantom and healthy volunteers. BOLD signal changes were studied in a group of six volunteers using finger tapping stimulation. Phantom studies revealed an important drop of signal even after the use of a normalization filter in the center of the image and an important increase of artifact power with reduction of measurement time strongly depending on the combination of acceleration parameters. The additional application of a parallel acquisition technique such as GRAPPA decreases measurement time in the range of about 30%, but further reduction is often possible only at the expense of SNR. This technique performs best in conditions in which imaging speed is important, such as CE MRA, but time resolution still does not allow the acquisition of angiograms separating the arterial and venous phase. Significantly larger areas of BOLD activation were found using the i-PAT coil compared to the standard head coil. Being an eight-channel surface coil array, peripheral cortical structures profit from high SNR as high-resolution imaging of small cortical dysplasias and functional activation of cortical areas imaged by BOLD contrast. In BOLD contrast imaging, susceptibility artifacts are reduced, but only if an appropriate combination of acceleration parameters is used. (orig.)
New partially parallel acquisition technique in cerebral imaging: preliminary findings
Energy Technology Data Exchange (ETDEWEB)
Tintera, Jaroslav [Institute for Clinical and Experimental Medicine, Prague (Czech Republic); Gawehn, Joachim; Bauermann, Thomas; Vucurevic, Goran; Stoeter, Peter [University Clinic Mainz, Institute of Neuroradiology, Mainz (Germany)
2004-12-01
In MRI applications where short acquisition time is necessary, the increase of acquisition speed is often at the expense of image resolution and SNR. In such cases, the newly developed parallel acquisition techniques could provide images without mentioned limitations and in reasonably shortened measurement time. A newly designed eight-channel head coil array (i-PAT coil) allowing for parallel acquisition of independently reconstructed images (GRAPPA mode) has been tested for its applicability in neuroradiology. Image homogeneity was tested in standard phantom and healthy volunteers. BOLD signal changes were studied in a group of six volunteers using finger tapping stimulation. Phantom studies revealed an important drop of signal even after the use of a normalization filter in the center of the image and an important increase of artifact power with reduction of measurement time strongly depending on the combination of acceleration parameters. The additional application of a parallel acquisition technique such as GRAPPA decreases measurement time in the range of about 30%, but further reduction is often possible only at the expense of SNR. This technique performs best in conditions in which imaging speed is important, such as CE MRA, but time resolution still does not allow the acquisition of angiograms separating the arterial and venous phase. Significantly larger areas of BOLD activation were found using the i-PAT coil compared to the standard head coil. Being an eight-channel surface coil array, peripheral cortical structures profit from high SNR as high-resolution imaging of small cortical dysplasias and functional activation of cortical areas imaged by BOLD contrast. In BOLD contrast imaging, susceptibility artifacts are reduced, but only if an appropriate combination of acceleration parameters is used. (orig.)
Improved parallel solution techniques for the integral transport matrix method
Energy Technology Data Exchange (ETDEWEB)
Zerr, R. Joseph, E-mail: rjz116@psu.edu [Department of Mechanical and Nuclear Engineering, The Pennsylvania State University, University Park, PA (United States); Azmy, Yousry Y., E-mail: yyazmy@ncsu.edu [Department of Nuclear Engineering, North Carolina State University, Burlington Engineering Laboratories, Raleigh, NC (United States)
2011-07-01
Alternative solution strategies to the parallel block Jacobi (PBJ) method for the solution of the global problem with the integral transport matrix method operators have been designed and tested. The most straightforward improvement to the Jacobi iterative method is the Gauss-Seidel alternative. The parallel red-black Gauss-Seidel (PGS) algorithm can improve on the number of iterations and reduce work per iteration by applying an alternating red-black color-set to the subdomains and assigning multiple sub-domains per processor. A parallel GMRES(m) method was implemented as an alternative to stationary iterations. Computational results show that the PGS method can improve on the PBJ method execution time by up to 10´ when eight sub-domains per processor are used. However, compared to traditional source iterations with diffusion synthetic acceleration, it is still approximately an order of magnitude slower. The best-performing cases are optically thick because sub-domains decouple, yielding faster convergence. Further tests revealed that 64 sub-domains per processor was the best performing level of sub-domain division. An acceleration technique that improves the convergence rate would greatly improve the ITMM. The GMRES(m) method with a diagonal block pre conditioner consumes approximately the same time as the PBJ solver but could be improved by an as yet undeveloped, more efficient pre conditioner. (author)
Improved parallel solution techniques for the integral transport matrix method
International Nuclear Information System (INIS)
Zerr, R. Joseph; Azmy, Yousry Y.
2011-01-01
Alternative solution strategies to the parallel block Jacobi (PBJ) method for the solution of the global problem with the integral transport matrix method operators have been designed and tested. The most straightforward improvement to the Jacobi iterative method is the Gauss-Seidel alternative. The parallel red-black Gauss-Seidel (PGS) algorithm can improve on the number of iterations and reduce work per iteration by applying an alternating red-black color-set to the subdomains and assigning multiple sub-domains per processor. A parallel GMRES(m) method was implemented as an alternative to stationary iterations. Computational results show that the PGS method can improve on the PBJ method execution time by up to 10´ when eight sub-domains per processor are used. However, compared to traditional source iterations with diffusion synthetic acceleration, it is still approximately an order of magnitude slower. The best-performing cases are optically thick because sub-domains decouple, yielding faster convergence. Further tests revealed that 64 sub-domains per processor was the best performing level of sub-domain division. An acceleration technique that improves the convergence rate would greatly improve the ITMM. The GMRES(m) method with a diagonal block pre conditioner consumes approximately the same time as the PBJ solver but could be improved by an as yet undeveloped, more efficient pre conditioner. (author)
A Linguistic Technique for Marking and Analyzing Syntactic Parallelism.
Sackler, Jessie Brome
Sentences in rhetoric texts were used in this study to determine a way in which thetorical syntactic parallelism can be analyzed. A tagmemic analysis determined tagmas which were parallel or identical or similar to one another. These were distinguished from tagmas which were identical because of the syntactic constraints of the language…
Techniques applied in design optimization of parallel manipulators
CSIR Research Space (South Africa)
Modungwa, D
2011-11-01
Full Text Available the desired dexterous workspace " Robot.Comput.Integrated Manuf., vol. 23, pp. 38 - 46, 2007. [12] A.P. Murray, F. Pierrot, P. Dauchez and J.M. McCarthy, "A planar quaternion approach to the kinematic synthesis of a parallel manipulator " Robotica, vol... design of a three translational DoFs parallel manipulator " Robotica, vol. 24, pp. 239, 2005. [15] J. Angeles, "The robust design of parallel manipulators," in 1st Int. Colloquium, Collaborative Research Centre 562, 2002. [16] S. Bhattacharya, H...
High-energy physics software parallelization using database techniques
International Nuclear Information System (INIS)
Argante, E.; Van der Stok, P.D.V.; Willers, I.
1997-01-01
A programming model for software parallelization, called CoCa, is introduced that copes with problems caused by typical features of high-energy physics software. By basing CoCa on the database transaction paradigm, the complexity induced by the parallelization is for a large part transparent to the programmer, resulting in a higher level of abstraction than the native message passing software. CoCa is implemented on a Meiko CS-2 and on a SUN SPARCcenter 2000 parallel computer. On the CS-2, the performance is comparable with the performance of native PVM and MPI. (orig.)
Automatic Parallelization An Overview of Fundamental Compiler Techniques
Midkiff, Samuel P
2012-01-01
Compiling for parallelism is a longstanding topic of compiler research. This book describes the fundamental principles of compiling "regular" numerical programs for parallelism. We begin with an explanation of analyses that allow a compiler to understand the interaction of data reads and writes in different statements and loop iterations during program execution. These analyses include dependence analysis, use-def analysis and pointer analysis. Next, we describe how the results of these analyses are used to enable transformations that make loops more amenable to parallelization, and
Kronecker Products on Preconditioning
Gao, Longfei
2013-08-01
Numerical techniques for linear systems arising from discretization of partial differential equations are nowadays essential for understanding the physical world. Among these techniques, iterative methods and the accompanying preconditioning techniques have become increasingly popular due to their great potential on large scale computation. In this work, we present preconditioning techniques for linear systems built with tensor product basis functions. Efficient algorithms are designed for various problems by exploiting the Kronecker product structure in the matrices, inherited from tensor product basis functions. Specifically, we design preconditioners for mass matrices to remove the complexity from the basis functions used in isogeometric analysis, obtaining numerical performance independent of mesh size, polynomial order and continuity order; we also present a compound iteration preconditioner for stiffness matrices in two dimensions, obtaining fast convergence speed; lastly, for the Helmholtz problem, we present a strategy to `hide\\' its indefiniteness from Krylov subspace methods by eliminating the part of initial error that corresponds to those negative generalized eigenvalues. For all three cases, the Kronecker product structure in the matrices is exploited to achieve high computational efficiency.
Scalable multi-grid preconditioning techniques for the even-parity S_N solver in UNIC
International Nuclear Information System (INIS)
Mahadevan, Vijay S.; Smith, Michael A.
2011-01-01
The Even-parity neutron transport equation with FE-S_N discretization is solved traditionally using SOR preconditioned CG method at the lowest level of iterations in order to compute the criticality in reactor analysis problems. The use of high order isoparametric finite elements prohibits the formation of the discrete operator explicitly due to memory constraints in peta scale architectures. Hence, a h-p multi-grid preconditioner based on linear tessellation of the higher order mesh is introduced here for the space-angle system and compared against SOR and Algebraic MG black-box solvers. The performance and scalability of the multi-grid scheme was determined for two test problems and found to be competitive in terms of both computational time and memory requirements. The implementation of this preconditioner in an even-parity solver like UNIC from ANL can further enable high fidelity calculations in a scalable manner on peta flop machines. (author)
Decomposition based parallel processing technique for efficient collaborative optimization
International Nuclear Information System (INIS)
Park, Hyung Wook; Kim, Sung Chan; Kim, Min Soo; Choi, Dong Hoon
2000-01-01
In practical design studies, most of designers solve multidisciplinary problems with complex design structure. These multidisciplinary problems have hundreds of analysis and thousands of variables. The sequence of process to solve these problems affects the speed of total design cycle. Thus it is very important for designer to reorder original design processes to minimize total cost and time. This is accomplished by decomposing large multidisciplinary problem into several MultiDisciplinary Analysis SubSystem (MDASS) and processing it in parallel. This paper proposes new strategy for parallel decomposition of multidisciplinary problem to raise design efficiency by using genetic algorithm and shows the relationship between decomposition and Multidisciplinary Design Optimization(MDO) methodology
Using Motivational Interviewing Techniques to Address Parallel Process in Supervision
Giordano, Amanda; Clarke, Philip; Borders, L. DiAnne
2013-01-01
Supervision offers a distinct opportunity to experience the interconnection of counselor-client and counselor-supervisor interactions. One product of this network of interactions is parallel process, a phenomenon by which counselors unconsciously identify with their clients and subsequently present to their supervisors in a similar fashion…
Parallel processing based decomposition technique for efficient collaborative optimization
International Nuclear Information System (INIS)
Park, Hyung Wook; Kim, Sung Chan; Kim, Min Soo; Choi, Dong Hoon
2001-01-01
In practical design studies, most of designers solve multidisciplinary problems with large sized and complex design system. These multidisciplinary problems have hundreds of analysis and thousands of variables. The sequence of process to solve these problems affects the speed of total design cycle. Thus it is very important for designer to reorder the original design processes to minimize total computational cost. This is accomplished by decomposing large multidisciplinary problem into several MultiDisciplinary Analysis SubSystem (MDASS) and processing it in parallel. This paper proposes new strategy for parallel decomposition of multidisciplinary problem to raise design efficiency by using genetic algorithm and shows the relationship between decomposition and Multidisciplinary Design Optimization(MDO) methodology
VALU, AVX and GPU acceleration techniques for parallel FDTD methods
Yu, Wenhua
2013-01-01
This book introduces a general hardware acceleration technique that can significantly speed up FDTD simulations and their applications to engineering problems without requiring any additional hardware devices. This acceleration of complex problems can be efficient in saving both time and money and once learned these new techniques can be used repeatedly.
Matrix preconditioning: a robust operation for optical linear algebra processors.
Ghosh, A; Paparao, P
1987-07-15
Analog electrooptical processors are best suited for applications demanding high computational throughput with tolerance for inaccuracies. Matrix preconditioning is one such application. Matrix preconditioning is a preprocessing step for reducing the condition number of a matrix and is used extensively with gradient algorithms for increasing the rate of convergence and improving the accuracy of the solution. In this paper, we describe a simple parallel algorithm for matrix preconditioning, which can be implemented efficiently on a pipelined optical linear algebra processor. From the results of our numerical experiments we show that the efficacy of the preconditioning algorithm is affected very little by the errors of the optical system.
Directory of Open Access Journals (Sweden)
Mehiddin Al-Baali
2015-12-01
Full Text Available We deal with the design of parallel algorithms by using variable partitioning techniques to solve nonlinear optimization problems. We propose an iterative solution method that is very efficient for separable functions, our scope being to discuss its performance for general functions. Experimental results on an illustrative example have suggested some useful modifications that, even though they improve the efficiency of our parallel method, leave some questions open for further investigation.
Solving the Stokes problem on a massively parallel computer
DEFF Research Database (Denmark)
Axelsson, Owe; Barker, Vincent A.; Neytcheva, Maya
2001-01-01
boundary value problem for each velocity component, are solved by the conjugate gradient method with a preconditioning based on the algebraic multi‐level iteration (AMLI) technique. The velocity is found from the computed pressure. The method is optimal in the sense that the computational work...... is proportional to the number of unknowns. Further, it is designed to exploit a massively parallel computer with distributed memory architecture. Numerical experiments on a Cray T3E computer illustrate the parallel performance of the method....
International Nuclear Information System (INIS)
Ullmann, P.
2007-06-01
The primary objective of this work was the first experimental realization of parallel RF transmission for accelerating spatially selective excitation in magnetic resonance imaging. Furthermore, basic aspects regarding the performance of this technique were investigated, potential risks regarding the specific absorption rate (SAR) were considered and feasibility studies under application-oriented conditions as first steps towards a practical utilisation of this technique were undertaken. At first, based on the RF electronics platform of the Bruker Avance MRI systems, the technical foundations were laid to perform simultaneous transmission of individual RF waveforms on different RF channels. Another essential requirement for the realization of Parallel Excitation (PEX) was the design and construction of suitable RF transmit arrays with elements driven by separate transmit channels. In order to image the PEX results two imaging methods were implemented based on a spin-echo and a gradient-echo sequence, in which a parallel spatially selective pulse was included as an excitation pulse. In the course of this work PEX experiments were successfully performed on three different MRI systems, a 4.7 T and a 9.4 T animal system and a 3 T human scanner, using 5 different RF coil setups in total. In the last part of this work investigations regarding possible applications of Parallel Excitation were performed. A first study comprised experiments of slice-selective B1 inhomogeneity correction by using 3D-selective Parallel Excitation. The investigations were performed in a phantom as well as in a rat fixed in paraformaldehyde solution. In conjunction with these experiments a novel method of calculating RF pulses for spatially selective excitation based on a so-called Direct Calibration approach was developed, which is particularly suitable for this type of experiments. In the context of these experiments it was demonstrated how to combine the advantages of parallel transmission
Fast implementations of 3D PET reconstruction using vector and parallel programming techniques
International Nuclear Information System (INIS)
Guerrero, T.M.; Cherry, S.R.; Dahlbom, M.; Ricci, A.R.; Hoffman, E.J.
1993-01-01
Computationally intensive techniques that offer potential clinical use have arisen in nuclear medicine. Examples include iterative reconstruction, 3D PET data acquisition and reconstruction, and 3D image volume manipulation including image registration. One obstacle in achieving clinical acceptance of these techniques is the computational time required. This study focuses on methods to reduce the computation time for 3D PET reconstruction through the use of fast computer hardware, vector and parallel programming techniques, and algorithm optimization. The strengths and weaknesses of i860 microprocessor based workstation accelerator boards are investigated in implementations of 3D PET reconstruction
Directory of Open Access Journals (Sweden)
Sushama R Galgali
2011-01-01
Full Text Available Background: Maintenance of gingival health is a key factor for longevity of the teeth as well as of restorations. The physiologic dentogingival unit (DGU, which is composed of the epithelial and connective tissue attachments of the gingiva, functions as a barrier against microbial entry into the periodontium. Invasion of this space triggers inflammation and causes periodontal destruction. Despite the clinical relevance of the determination of the length and width of the DGU, there is no standardized technique. The length of the DGU can be either determined by histologic preparations or by transgingival probing. Although width can also be assessed by transgingival probing or with an ultrasound device, they are either invasive or expensive Aims: This study sought to evaluate an innovative radiographic exploration technique - parallel profile radiography - for measuring the dimensions of the DGU on the labial surfaces of anterior teeth. Materials and Methods: Two radiographs were made using the long-cone parallel technique in ten individuals, one in frontal projection, while the second radiograph was a parallel profile radiograph obtained from a lateral position. The length and width of the DGU was measured using computer software. Transgingival probing (trans-sulcular was done for these same patients and length of the DGU was measured. The values obtained by the two methods were compared. Pearson product correlation coefficient was calculated to examine the agreement between the values obtained by PPRx and transgingival probing. Results: The mean biologic width by the parallel profile radiography (PPRx technique was 1.72 mm (range 0.94-2.11 mm, while the mean thickness of the gingiva was 1.38 mm (range 0.92-1.77 mm. The mean biologic width by trans-gingival probing was 1.6 mm (range 0.8-2.2mm. Pearson product correlation coefficient (r for the above values was 0.914; thus, a high degree of agreement exists between the PPRx and TGP techniques
Techniques and environments for big data analysis parallel, cloud, and grid computing
Dehuri, Satchidananda; Kim, Euiwhan; Wang, Gi-Name
2016-01-01
This volume is aiming at a wide range of readers and researchers in the area of Big Data by presenting the recent advances in the fields of Big Data Analysis, as well as the techniques and tools used to analyze it. The book includes 10 distinct chapters providing a concise introduction to Big Data Analysis and recent Techniques and Environments for Big Data Analysis. It gives insight into how the expensive fitness evaluation of evolutionary learning can play a vital role in big data analysis by adopting Parallel, Grid, and Cloud computing environments.
The parallel-sequential field subtraction technique for coherent nonlinear ultrasonic imaging
Cheng, Jingwei; Potter, Jack N.; Drinkwater, Bruce W.
2018-06-01
Nonlinear imaging techniques have recently emerged which have the potential to detect cracks at a much earlier stage than was previously possible and have sensitivity to partially closed defects. This study explores a coherent imaging technique based on the subtraction of two modes of focusing: parallel, in which the elements are fired together with a delay law and sequential, in which elements are fired independently. In the parallel focusing a high intensity ultrasonic beam is formed in the specimen at the focal point. However, in sequential focusing only low intensity signals from individual elements enter the sample and the full matrix of transmit-receive signals is recorded and post-processed to form an image. Under linear elastic assumptions, both parallel and sequential images are expected to be identical. Here we measure the difference between these images and use this to characterise the nonlinearity of small closed fatigue cracks. In particular we monitor the change in relative phase and amplitude at the fundamental frequencies for each focal point and use this nonlinear coherent imaging metric to form images of the spatial distribution of nonlinearity. The results suggest the subtracted image can suppress linear features (e.g. back wall or large scatters) effectively when instrumentation noise compensation in applied, thereby allowing damage to be detected at an early stage (c. 15% of fatigue life) and reliably quantified in later fatigue life.
10-channel fiber array fabrication technique for parallel optical coherence tomography system
Arauz, Lina J.; Luo, Yuan; Castillo, Jose E.; Kostuk, Raymond K.; Barton, Jennifer
2007-02-01
Optical Coherence Tomography (OCT) shows great promise for low intrusive biomedical imaging applications. A parallel OCT system is a novel technique that replaces mechanical transverse scanning with electronic scanning. This will reduce the time required to acquire image data. In this system an array of small diameter fibers is required to obtain an image in the transverse direction. Each fiber in the array is configured in an interferometer and is used to image one pixel in the transverse direction. In this paper we describe a technique to package 15μm diameter fibers on a siliconsilica substrate to be used in a 2mm endoscopic probe tip. Single mode fibers are etched to reduce the cladding diameter from 125μm to 15μm. Etched fibers are placed into a 4mm by 150μm trench in a silicon-silica substrate and secured with UV glue. Active alignment was used to simplify the lay out of the fibers and minimize unwanted horizontal displacement of the fibers. A 10-channel fiber array was built, tested and later incorporated into a parallel optical coherence system. This paper describes the packaging, testing, and operation of the array in a parallel OCT system.
Parallel Reservoir Simulations with Sparse Grid Techniques and Applications to Wormhole Propagation
Wu, Yuanqing
2015-09-08
In this work, two topics of reservoir simulations are discussed. The first topic is the two-phase compositional flow simulation in hydrocarbon reservoir. The major obstacle that impedes the applicability of the simulation code is the long run time of the simulation procedure, and thus speeding up the simulation code is necessary. Two means are demonstrated to address the problem: parallelism in physical space and the application of sparse grids in parameter space. The parallel code can gain satisfactory scalability, and the sparse grids can remove the bottleneck of flash calculations. Instead of carrying out the flash calculation in each time step of the simulation, a sparse grid approximation of all possible results of the flash calculation is generated before the simulation. Then the constructed surrogate model is evaluated to approximate the flash calculation results during the simulation. The second topic is the wormhole propagation simulation in carbonate reservoir. In this work, different from the traditional simulation technique relying on the Darcy framework, we propose a new framework called Darcy-Brinkman-Forchheimer framework to simulate wormhole propagation. Furthermore, to process the large quantity of cells in the simulation grid and shorten the long simulation time of the traditional serial code, standard domain-based parallelism is employed, using the Hypre multigrid library. In addition to that, a new technique called “experimenting field approach” to set coefficients in the model equations is introduced. In the 2D dissolution experiments, different configurations of wormholes and a series of properties simulated by both frameworks are compared. We conclude that the numerical results of the DBF framework are more like wormholes and more stable than the Darcy framework, which is a demonstration of the advantages of the DBF framework. The scalability of the parallel code is also evaluated, and good scalability can be achieved. Finally, a mixed
International Nuclear Information System (INIS)
Romaneehsen, B.; Oberholzer, K.; Kreitner, K.-F.; Mueller, L.P.
2003-01-01
Purpose: To investigate the feasibility of using multiple receiver coil elements for time saving integrated parallel imaging techniques (iPAT) in traumatic musculoskeletal disorders. Material and methods: 6 patients with traumatic derangements of the knee, ankle and hip underwent MR imaging at 1.5 T. For signal detection of the knee and ankle, we used a 6-channel body array coil that was placed around the joints, for hip imaging two 4-channel body array coils and two elements of the spine array coil were combined for signal detection. All patients were investigated with a standard imaging protocol that mainly consisted of different turbo spin-echo sequences (PD-, T 2 -weighted TSE with and without fat suppression, STIR). All sequences were repeated with an integrated parallel acquisition technique (iPAT) using a modified sensitivity encoding (mSENSE) technique with an acceleration factor of 2. Overall image quality was subjectively assessed using a five-point scale as well as the ability for detection of pathologic findings. Results: Regarding overall image quality, there were no significant differences between standard imaging and imaging using mSENSE. All pathologies (occult fracture, meniscal tear, torn and interpositioned Hoffa's cleft, cartilage damage) were detected by both techniques. iPAT led to a 48% reduction of acquisition time compared with standard technique. Additionally, time savings with iPAT led to a decrease of pain-induced motion artifacts in two cases. Conclusion: In times of increasing cost pressure, iPAT using multiple coil elements seems to be an efficient and economic tool for fast musculoskeletal imaging with diagnostic performance comparable to conventional techniques. (orig.) [de
Techniques and Architectures for Hazard-Free Semi-Parallel Decoding of LDPC Codes
Directory of Open Access Journals (Sweden)
Rovini Massimo
2009-01-01
Full Text Available The layered decoding algorithm has recently been proposed as an efficient means for the decoding of low-density parity-check (LDPC codes, thanks to the remarkable improvement in the convergence speed (2x of the decoding process. However, pipelined semi-parallel decoders suffer from violations or "hazards" between consecutive updates, which not only violate the layered principle but also enforce the loops in the code, thus spoiling the error correction performance. This paper describes three different techniques to properly reschedule the decoding updates, based on the careful insertion of "idle" cycles, to prevent the hazards of the pipeline mechanism. Also, different semi-parallel architectures of a layered LDPC decoder suitable for use with such techniques are analyzed. Then, taking the LDPC codes for the wireless local area network (IEEE 802.11n as a case study, a detailed analysis of the performance attained with the proposed techniques and architectures is reported, and results of the logic synthesis on a 65 nm low-power CMOS technology are shown.
Zaripov, D. I.; Renfu, Li
2018-05-01
The implementation of high-efficiency digital image correlation methods based on a zero-normalized cross-correlation (ZNCC) procedure for high-speed, time-resolved measurements using a high-resolution digital camera is associated with big data processing and is often time consuming. In order to speed-up ZNCC computation, a high-speed technique based on a parallel projection correlation procedure is proposed. The proposed technique involves the use of interrogation window projections instead of its two-dimensional field of luminous intensity. This simplification allows acceleration of ZNCC computation up to 28.8 times compared to ZNCC calculated directly, depending on the size of interrogation window and region of interest. The results of three synthetic test cases, such as a one-dimensional uniform flow, a linear shear flow and a turbulent boundary-layer flow, are discussed in terms of accuracy. In the latter case, the proposed technique is implemented together with an iterative window-deformation technique. On the basis of the results of the present work, the proposed technique is recommended to be used for initial velocity field calculation, with further correction using more accurate techniques.
Application of parallel computing techniques to a large-scale reservoir simulation
International Nuclear Information System (INIS)
Zhang, Keni; Wu, Yu-Shu; Ding, Chris; Pruess, Karsten
2001-01-01
Even with the continual advances made in both computational algorithms and computer hardware used in reservoir modeling studies, large-scale simulation of fluid and heat flow in heterogeneous reservoirs remains a challenge. The problem commonly arises from intensive computational requirement for detailed modeling investigations of real-world reservoirs. This paper presents the application of a massive parallel-computing version of the TOUGH2 code developed for performing large-scale field simulations. As an application example, the parallelized TOUGH2 code is applied to develop a three-dimensional unsaturated-zone numerical model simulating flow of moisture, gas, and heat in the unsaturated zone of Yucca Mountain, Nevada, a potential repository for high-level radioactive waste. The modeling approach employs refined spatial discretization to represent the heterogeneous fractured tuffs of the system, using more than a million 3-D gridblocks. The problem of two-phase flow and heat transfer within the model domain leads to a total of 3,226,566 linear equations to be solved per Newton iteration. The simulation is conducted on a Cray T3E-900, a distributed-memory massively parallel computer. Simulation results indicate that the parallel computing technique, as implemented in the TOUGH2 code, is very efficient. The reliability and accuracy of the model results have been demonstrated by comparing them to those of small-scale (coarse-grid) models. These comparisons show that simulation results obtained with the refined grid provide more detailed predictions of the future flow conditions at the site, aiding in the assessment of proposed repository performance
Energy Technology Data Exchange (ETDEWEB)
Ullmann, P.
2007-06-15
The primary objective of this work was the first experimental realization of parallel RF transmission for accelerating spatially selective excitation in magnetic resonance imaging. Furthermore, basic aspects regarding the performance of this technique were investigated, potential risks regarding the specific absorption rate (SAR) were considered and feasibility studies under application-oriented conditions as first steps towards a practical utilisation of this technique were undertaken. At first, based on the RF electronics platform of the Bruker Avance MRI systems, the technical foundations were laid to perform simultaneous transmission of individual RF waveforms on different RF channels. Another essential requirement for the realization of Parallel Excitation (PEX) was the design and construction of suitable RF transmit arrays with elements driven by separate transmit channels. In order to image the PEX results two imaging methods were implemented based on a spin-echo and a gradient-echo sequence, in which a parallel spatially selective pulse was included as an excitation pulse. In the course of this work PEX experiments were successfully performed on three different MRI systems, a 4.7 T and a 9.4 T animal system and a 3 T human scanner, using 5 different RF coil setups in total. In the last part of this work investigations regarding possible applications of Parallel Excitation were performed. A first study comprised experiments of slice-selective B1 inhomogeneity correction by using 3D-selective Parallel Excitation. The investigations were performed in a phantom as well as in a rat fixed in paraformaldehyde solution. In conjunction with these experiments a novel method of calculating RF pulses for spatially selective excitation based on a so-called Direct Calibration approach was developed, which is particularly suitable for this type of experiments. In the context of these experiments it was demonstrated how to combine the advantages of parallel transmission
Directory of Open Access Journals (Sweden)
Rovini Massimo
2009-01-01
Full Text Available This is a reply to the comments by Gunnam et al. "Comments on 'Techniques and architectures for hazard-free semi-parallel decoding of LDPC codes'", EURASIP Journal on Embedded Systems, vol. 2009, Article ID 704174 on our recent work "Techniques and architectures for hazard-free semi-parallel decoding of LDPC codes", EURASIP Journal on Embedded Systems, vol. 2009, Article ID 723465.
Energy Technology Data Exchange (ETDEWEB)
Romaneehsen, B.; Oberholzer, K.; Kreitner, K.-F. [Johannes Gutenberg-Univ. Mainz (Germany). Klinik und Poliklinik fuer Radiologie; Mueller, L.P. [Johannes Gutenberg-Univ. Mainz (Germany). Klinik und Poliklinik fuer Unfallchirurgie
2003-09-01
Purpose: To investigate the feasibility of using multiple receiver coil elements for time saving integrated parallel imaging techniques (iPAT) in traumatic musculoskeletal disorders. Material and methods: 6 patients with traumatic derangements of the knee, ankle and hip underwent MR imaging at 1.5 T. For signal detection of the knee and ankle, we used a 6-channel body array coil that was placed around the joints, for hip imaging two 4-channel body array coils and two elements of the spine array coil were combined for signal detection. All patients were investigated with a standard imaging protocol that mainly consisted of different turbo spin-echo sequences (PD-, T{sub 2}-weighted TSE with and without fat suppression, STIR). All sequences were repeated with an integrated parallel acquisition technique (iPAT) using a modified sensitivity encoding (mSENSE) technique with an acceleration factor of 2. Overall image quality was subjectively assessed using a five-point scale as well as the ability for detection of pathologic findings. Results: Regarding overall image quality, there were no significant differences between standard imaging and imaging using mSENSE. All pathologies (occult fracture, meniscal tear, torn and interpositioned Hoffa's cleft, cartilage damage) were detected by both techniques. iPAT led to a 48% reduction of acquisition time compared with standard technique. Additionally, time savings with iPAT led to a decrease of pain-induced motion artifacts in two cases. Conclusion: In times of increasing cost pressure, iPAT using multiple coil elements seems to be an efficient and economic tool for fast musculoskeletal imaging with diagnostic performance comparable to conventional techniques. (orig.) [German] Ziel: Einsatz integrierter paralleler Akquisitionstechniken (iPAT) zur Verkuerzung der Untersuchungszeit bei muskuloskelettalen Verletzungen. Material und Methoden: 6 Patienten mit einem Knie, Sprunggelenks- oder Huefttrauma wurden bei 1,5 T
The multigrid preconditioned conjugate gradient method
Tatebe, Osamu
1993-01-01
A multigrid preconditioned conjugate gradient method (MGCG method), which uses the multigrid method as a preconditioner of the PCG method, is proposed. The multigrid method has inherent high parallelism and improves convergence of long wavelength components, which is important in iterative methods. By using this method as a preconditioner of the PCG method, an efficient method with high parallelism and fast convergence is obtained. First, it is considered a necessary condition of the multigrid preconditioner in order to satisfy requirements of a preconditioner of the PCG method. Next numerical experiments show a behavior of the MGCG method and that the MGCG method is superior to both the ICCG method and the multigrid method in point of fast convergence and high parallelism. This fast convergence is understood in terms of the eigenvalue analysis of the preconditioned matrix. From this observation of the multigrid preconditioner, it is realized that the MGCG method converges in very few iterations and the multigrid preconditioner is a desirable preconditioner of the conjugate gradient method.
Evaluation of onboard hyperspectral-image compression techniques for a parallel push-broom sensor
Energy Technology Data Exchange (ETDEWEB)
Briles, S.
1996-04-01
A single hyperspectral imaging sensor can produce frames with spatially-continuous rows of differing, but adjacent, spectral wavelength. If the frame sample-rate of the sensor is such that subsequent hyperspectral frames are spatially shifted by one row, then the sensor can be thought of as a parallel (in wavelength) push-broom sensor. An examination of data compression techniques for such a sensor is presented. The compression techniques are intended to be implemented onboard a space-based platform and to have implementation speeds that match the date rate of the sensor. Data partitions examined extend from individually operating on a single hyperspectral frame to operating on a data cube comprising the two spatial axes and the spectral axis. Compression algorithms investigated utilize JPEG-based image compression, wavelet-based compression and differential pulse code modulation. Algorithm performance is quantitatively presented in terms of root-mean-squared error and root-mean-squared correlation coefficient error. Implementation issues are considered in algorithm development.
International Nuclear Information System (INIS)
Kreitner, K.F.; Romaneehsen, Bernd; Oberholzer, Katja; Dueber, Christoph; Krummenauer, Frank; Mueller, L.P.
2006-01-01
The performance of a magnetic resonance (MR) imaging strategy that uses multiple receiver coil elements and integrated parallel imaging techniques (iPAT) in traumatic and degenerative disorders of the knee and to compare this technique with a standard MR imaging protocol was evaluated. Ninety patients with suspected internal derangements of the knee joint prospectively underwent MR imaging at 1.5 T. For signal detection, a 6-channel array coil was used. All patients were investigated with a standard imaging protocol consisting of different turbo spin-echo sequences proton density (PD), T 2 -weighted turbo spin echo (TSE) with and without fat suppression in three imaging planes. All sequences were repeated with an integrated parallel acquisition technique (iPAT) using the modified sensitivity encoding (mSENSE) algorithm with an acceleration factor of 2. Two radiologists independently evaluated and scored all images with regard to overall image quality, artefacts and pathologic findings. Agreement of the parallel ratings between readers and imaging techniques, respectively, was evaluated by means of pairwise kappa coefficients that were stratified for the area of evaluation. Agreement between the parallel readers for both the iPAT imaging and the conventional technique, respectively, as well as between imaging techniques was found encouraging with inter-observer kappa values ranging between 0.78 and 0.98 for both imaging techniques, and the inter-method kappa values ranging between 0.88 and 1.00 for both clinical readers. All pathological findings (e.g. occult fractures, meniscal and cruciate ligament tears, torn and interpositioned Hoffa's cleft, cartilage damage) were detected by both techniques with comparable performance. The use of iPAT lead to a 48% reduction of acquisition time compared with standard technique. Parallel imaging using mSENSE proved to be an efficient and economic tool for fast musculoskeletal MR imaging of the knee joint with comparable
40 CFR 80.52 - Vehicle preconditioning.
2010-07-01
... 40 Protection of Environment 16 2010-07-01 2010-07-01 false Vehicle preconditioning. 80.52 Section...) REGULATION OF FUELS AND FUEL ADDITIVES Reformulated Gasoline § 80.52 Vehicle preconditioning. (a) Initial vehicle preconditioning and preconditioning between tests with different fuels shall be performed in...
Energy Technology Data Exchange (ETDEWEB)
Kohn, S.; Weare, J.; Ong, E.; Baden, S.
1997-05-01
We have applied structured adaptive mesh refinement techniques to the solution of the LDA equations for electronic structure calculations. Local spatial refinement concentrates memory resources and numerical effort where it is most needed, near the atomic centers and in regions of rapidly varying charge density. The structured grid representation enables us to employ efficient iterative solver techniques such as conjugate gradient with FAC multigrid preconditioning. We have parallelized our solver using an object- oriented adaptive mesh refinement framework.
Energy Technology Data Exchange (ETDEWEB)
Franz, A., LLNL
1998-02-17
The numerical simulation of chemically reacting flows is a topic, that has attracted a great deal of current research At the heart of numerical reactive flow simulations are large sets of coupled, nonlinear Partial Differential Equations (PDES). Due to the stiffness that is usually present, explicit time differencing schemes are not used despite their inherent simplicity and efficiency on parallel and vector machines, since these schemes require prohibitively small numerical stepsizes. Implicit time differencing schemes, although possessing good stability characteristics, introduce a great deal of computational overhead necessary to solve the simultaneous algebraic system at each timestep. This thesis examines an algorithm based on a preconditioned time differencing scheme. The algorithm is explicit and permits a large stable time step. An investigation of the algorithm`s accuracy, stability and performance on a parallel architecture is presented
Load-balancing techniques for a parallel electromagnetic particle-in-cell code
Energy Technology Data Exchange (ETDEWEB)
PLIMPTON,STEVEN J.; SEIDEL,DAVID B.; PASIK,MICHAEL F.; COATS,REBECCA S.
2000-01-01
QUICKSILVER is a 3-d electromagnetic particle-in-cell simulation code developed and used at Sandia to model relativistic charged particle transport. It models the time-response of electromagnetic fields and low-density-plasmas in a self-consistent manner: the fields push the plasma particles and the plasma current modifies the fields. Through an LDRD project a new parallel version of QUICKSILVER was created to enable large-scale plasma simulations to be run on massively-parallel distributed-memory supercomputers with thousands of processors, such as the Intel Tflops and DEC CPlant machines at Sandia. The new parallel code implements nearly all the features of the original serial QUICKSILVER and can be run on any platform which supports the message-passing interface (MPI) standard as well as on single-processor workstations. This report describes basic strategies useful for parallelizing and load-balancing particle-in-cell codes, outlines the parallel algorithms used in this implementation, and provides a summary of the modifications made to QUICKSILVER. It also highlights a series of benchmark simulations which have been run with the new code that illustrate its performance and parallel efficiency. These calculations have up to a billion grid cells and particles and were run on thousands of processors. This report also serves as a user manual for people wishing to run parallel QUICKSILVER.
Load-balancing techniques for a parallel electromagnetic particle-in-cell code
International Nuclear Information System (INIS)
Plimpton, Steven J.; Seidel, David B.; Pasik, Michael F.; Coats, Rebecca S.
2000-01-01
QUICKSILVER is a 3-d electromagnetic particle-in-cell simulation code developed and used at Sandia to model relativistic charged particle transport. It models the time-response of electromagnetic fields and low-density-plasmas in a self-consistent manner: the fields push the plasma particles and the plasma current modifies the fields. Through an LDRD project a new parallel version of QUICKSILVER was created to enable large-scale plasma simulations to be run on massively-parallel distributed-memory supercomputers with thousands of processors, such as the Intel Tflops and DEC CPlant machines at Sandia. The new parallel code implements nearly all the features of the original serial QUICKSILVER and can be run on any platform which supports the message-passing interface (MPI) standard as well as on single-processor workstations. This report describes basic strategies useful for parallelizing and load-balancing particle-in-cell codes, outlines the parallel algorithms used in this implementation, and provides a summary of the modifications made to QUICKSILVER. It also highlights a series of benchmark simulations which have been run with the new code that illustrate its performance and parallel efficiency. These calculations have up to a billion grid cells and particles and were run on thousands of processors. This report also serves as a user manual for people wishing to run parallel QUICKSILVER
Parallel Implicit Algorithms for CFD
Keyes, David E.
1998-01-01
The main goal of this project was efficient distributed parallel and workstation cluster implementations of Newton-Krylov-Schwarz (NKS) solvers for implicit Computational Fluid Dynamics (CFD.) "Newton" refers to a quadratically convergent nonlinear iteration using gradient information based on the true residual, "Krylov" to an inner linear iteration that accesses the Jacobian matrix only through highly parallelizable sparse matrix-vector products, and "Schwarz" to a domain decomposition form of preconditioning the inner Krylov iterations with primarily neighbor-only exchange of data between the processors. Prior experience has established that Newton-Krylov methods are competitive solvers in the CFD context and that Krylov-Schwarz methods port well to distributed memory computers. The combination of the techniques into Newton-Krylov-Schwarz was implemented on 2D and 3D unstructured Euler codes on the parallel testbeds that used to be at LaRC and on several other parallel computers operated by other agencies or made available by the vendors. Early implementations were made directly in Massively Parallel Integration (MPI) with parallel solvers we adapted from legacy NASA codes and enhanced for full NKS functionality. Later implementations were made in the framework of the PETSC library from Argonne National Laboratory, which now includes pseudo-transient continuation Newton-Krylov-Schwarz solver capability (as a result of demands we made upon PETSC during our early porting experiences). A secondary project pursued with funding from this contract was parallel implicit solvers in acoustics, specifically in the Helmholtz formulation. A 2D acoustic inverse problem has been solved in parallel within the PETSC framework.
Directory of Open Access Journals (Sweden)
Jianjun Hu
2016-01-01
Full Text Available Commercial 41Cr4 (ISO standard steel was treated by a composite technique. An intermediate layer was introduced firstly at the 41Cr4 steel surface by traditional carburizing and nitriding. Then a hard Cr coating was brush-plated on the intermediate layer. Finally, the coating layer was modified by high current pulsed electron beam (HCPEB, followed by quenching and subsequent tempering treatment. The microstructure, mechanical properties, and fracture behavior were characterized. The results show that a nanocrystalline Cr coating is formed at the 41Cr4 steel surface by the treatment of the new composite technique. Such nanocrystalline Cr coating has acceptable hardness and high corrosion resistance performance, which satisfies the demands of the gears working under high speed and corrosive environment. The composite process proposed in this study is considered as a new prospect method due to the multifunction layer design on the gear surface.
National Research Council Canada - National Science Library
Steed, Chad A; Fitzpatrick, Patrick J; Jankun-Kelly, T. J; Swan II, J. E
2008-01-01
... for a particular dependent variable. These capabilities are combined into a unique visualization system that is demonstrated via a North Atlantic hurricane climate study using a systematic workflow. This research corroborates the notion that enhanced parallel coordinates coupled with statistical analysis can be used for more effective knowledge discovery and confirmation in complex, real-world data sets.
Comments on “Techniques and Architectures for Hazard-Free Semi-Parallel Decoding of LDPC Codes”
Directory of Open Access Journals (Sweden)
Mark B. Yeary
2009-01-01
Full Text Available This is a comment article on the publication “Techniques and Architectures for Hazard-Free Semi-Parallel Decoding of LDPC Codes” Rovini et al. (2009. We mention that there has been similar work reported in the literature before, and the previous work has not been cited correctly, for example Gunnam et al. (2006, 2007. This brief note serves to clarify these issues.
2008-07-07
analyzing multivariate data sets. The system was developed using the Java Development Kit (JDK) version 1.5; and it yields interactive performance on a... script and captures output from the MATLAB’s “regress” and “stepwisefit” utilities that perform simple and stepwise regression, respectively. The MATLAB...Statistical Association, vol. 85, no. 411, pp. 664–675, 1990. [9] H. Hauser, F. Ledermann, and H. Doleisch, “ Angular brushing of extended parallel coordinates
Parallel analysis tools and new visualization techniques for ultra-large climate data set
Energy Technology Data Exchange (ETDEWEB)
Middleton, Don [National Center for Atmospheric Research, Boulder, CO (United States); Haley, Mary [National Center for Atmospheric Research, Boulder, CO (United States)
2014-12-10
ParVis was a project funded under LAB 10-05: “Earth System Modeling: Advanced Scientific Visualization of Ultra-Large Climate Data Sets”. Argonne was the lead lab with partners at PNNL, SNL, NCAR and UC-Davis. This report covers progress from January 1st, 2013 through Dec 1st, 2014. Two previous reports covered the period from Summer, 2010, through September 2011 and October 2011 through December 2012, respectively. While the project was originally planned to end on April 30, 2013, personnel and priority changes allowed many of the institutions to continue work through FY14 using existing funds. A primary focus of ParVis was introducing parallelism to climate model analysis to greatly reduce the time-to-visualization for ultra-large climate data sets. Work in the first two years was conducted on two tracks with different time horizons: one track to provide immediate help to climate scientists already struggling to apply their analysis to existing large data sets and another focused on building a new data-parallel library and tool for climate analysis and visualization that will give the field a platform for performing analysis and visualization on ultra-large datasets for the foreseeable future. In the final 2 years of the project, we focused mostly on the new data-parallel library and associated tools for climate analysis and visualization.
A subspace preconditioning algorithm for eigenvector/eigenvalue computation
Energy Technology Data Exchange (ETDEWEB)
Bramble, J.H.; Knyazev, A.V.; Pasciak, J.E.
1996-12-31
We consider the problem of computing a modest number of the smallest eigenvalues along with orthogonal bases for the corresponding eigen-spaces of a symmetric positive definite matrix. In our applications, the dimension of a matrix is large and the cost of its inverting is prohibitive. In this paper, we shall develop an effective parallelizable technique for computing these eigenvalues and eigenvectors utilizing subspace iteration and preconditioning. Estimates will be provided which show that the preconditioned method converges linearly and uniformly in the matrix dimension when used with a uniform preconditioner under the assumption that the approximating subspace is close enough to the span of desired eigenvectors.
Orderings for conjugate gradient preconditionings
Ortega, James M.
1991-01-01
The effect of orderings on the rate of convergence of the conjugate gradient method with SSOR or incomplete Cholesky preconditioning is examined. Some results also are presented that help to explain why red/black ordering gives an inferior rate of convergence.
Macro-elementwise preconditioning methods
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe
2012-01-01
Roč. 82, č. 10 (2012), s. 1952-1963 ISSN 0378-4754 Institutional research plan: CEZ:AV0Z30860518 Keywords : heterogeniety * elementwise preconditioning * block matrix partitioning * macro-elements Subject RIV: BA - General Mathematics Impact factor: 0.836, year: 2012 http://www.sciencedirect.com/science/journal/03784754
A Full Parallel Event Driven Readout Technique for Area Array SPAD FLIM Image Sensors
Directory of Open Access Journals (Sweden)
Kaiming Nie
2016-01-01
Full Text Available This paper presents a full parallel event driven readout method which is implemented in an area array single-photon avalanche diode (SPAD image sensor for high-speed fluorescence lifetime imaging microscopy (FLIM. The sensor only records and reads out effective time and position information by adopting full parallel event driven readout method, aiming at reducing the amount of data. The image sensor includes four 8 × 8 pixel arrays. In each array, four time-to-digital converters (TDCs are used to quantize the time of photons’ arrival, and two address record modules are used to record the column and row information. In this work, Monte Carlo simulations were performed in Matlab in terms of the pile-up effect induced by the readout method. The sensor’s resolution is 16 × 16. The time resolution of TDCs is 97.6 ps and the quantization range is 100 ns. The readout frame rate is 10 Mfps, and the maximum imaging frame rate is 100 fps. The chip’s output bandwidth is 720 MHz with an average power of 15 mW. The lifetime resolvability range is 5–20 ns, and the average error of estimated fluorescence lifetimes is below 1% by employing CMM to estimate lifetimes.
Baghelani, Masoud; Ghavifekr, Habib Badri
2017-12-01
This paper introduces a novel method for designing of low actuation voltage, high tuning ratio electrostatic parallel plate RF MEMS variable capacitors. It is feasible to achieve ultra-high tuning ratios way beyond 1.5:1 barrier, imposed by pull-in effect, by the proposed method. The proposed method is based on spring strengthening of the structure just before the unstable region. Spring strengthening could be realized by embedding some dimples on the spring arms with the precise height. These dimples shorten the spring length when achieved to the substrate. By the proposed method, as high tuning ratios as 7.5:1 is attainable by only considering four dimple sets. The required actuation voltage for this high tuning ratio is 14.33 V which is simply achievable on-chip by charge pump circuits. Brownian noise effect is also discussed and mechanical natural frequency of the structure is calculated.
Parallel Reservoir Simulations with Sparse Grid Techniques and Applications to Wormhole Propagation
Wu, Yuanqing
2015-01-01
the traditional simulation technique relying on the Darcy framework, we propose a new framework called Darcy-Brinkman-Forchheimer framework to simulate wormhole propagation. Furthermore, to process the large quantity of cells in the simulation grid and shorten
Energy Technology Data Exchange (ETDEWEB)
Daneshmand, Morteza [University of Tartu, Tartu (Estonia); Saadatzi, Mohammad Hossein [Colorado School of Mines, Golden (United States); Kaloorazi, Mohammad Hadi [École de Technologie Supérieur, Montréal (Canada); Masouleh, Mehdi Tale [University of Tehran, Tehran (Iran, Islamic Republic of); Anbarjafari, Gholamreza [Hasan Kalyoncu University, Gaziantep (Turkmenistan)
2016-03-15
This study aims to provide an optimal design for a Spherical parallel manipulator (SPM), namely, the Agile Eye. This aim is approached by investigating kinetostatic performance and workspace and searching for the most promising design. Previously recommended designs are examined to determine whether they provide acceptable kinetostatic performance and workspace. Optimal designs are provided according to different kinetostatic performance indices, especially kinematic sensitivity. The optimization process is launched based on the concept of the genetic algorithm. A single-objective process is implemented in accordance with the guidelines of an evolutionary algorithm called differential evolution. A multi-objective procedure is then provided following the reasoning of the nondominated sorting genetic algorithm-II. This process results in several sets of Pareto points for reconciliation between kinetostatic performance indices and workspace. The concept of numerous kinetostatic performance indices and the results of optimization algorithms are elaborated. The conclusions provide hints on the provided set of designs and their credibility to provide a well-conditioned workspace and acceptable kinetostatic performance for the SPM under study, which can be well extended to other types of SPMs.
International Nuclear Information System (INIS)
Ito, Satoshi; Kawawa, Yasuhiro; Yamada, Yoshifumi
2010-01-01
We propose an image reconstruction technique in which parallel image reconstruction is performed based on the sensitivity encoding (SENSE) algorithm using only a single set of signals. The signal obtained in the phase-scrambling Fourier transform (PSFT) imaging technique can be transformed to the signal described by the Fresnel transform of the objects, which is known as the diffracted wave-front equation of the object in acoustics or optics. Since the Fresnel transform is a convolution integral on the object space, the space where the PSFT signal exists can be considered as both in the Fourier domain and in the object domain. This notable feature indicates that weighting functions corresponding to the sensitivity of radiofrequency (RF) coils can be approximately given in the PSFT signal space. Therefore, we can obtain two folded images from a single set of signals with different weighting functions, and image reconstruction based on the SENSE parallel imaging algorithm is possible using a series of folded images. Simulation and experimental studies showed that almost alias-free images can be synthesized using a single signal that does not satisfy the sampling theorem. (author)
A smart technique for attendance system to recognize faces through parallelism
Prabhavathi, B.; Tanuja, V.; Madhu Viswanatham, V.; Rajashekhara Babu, M.
2017-11-01
Major part of recognising a person is face with the help of image processing techniques we can exploit the physical features of a person. In the old approach method that is used in schools and colleges it is there that the professor calls the student name and then the attendance for the students marked. Here in paper want to deviate from the old approach and go with the new approach by using techniques that are there in image processing. In this paper we presenting spontaneous presence for students in classroom. At first classroom image has been in use and after that image is kept in data record. For the images that are stored in the database we apply system algorithm which includes steps such as, histogram classification, noise removal, face detection and face recognition methods. So by using these steps we detect the faces and then compare it with the database. The attendance gets marked automatically if the system recognizes the faces.
A fast, preconditioned conjugate gradient Toeplitz solver
Pan, Victor; Schrieber, Robert
1989-01-01
A simple factorization is given of an arbitrary hermitian, positive definite matrix in which the factors are well-conditioned, hermitian, and positive definite. In fact, given knowledge of the extreme eigenvalues of the original matrix A, an optimal improvement can be achieved, making the condition numbers of each of the two factors equal to the square root of the condition number of A. This technique is to applied to the solution of hermitian, positive definite Toeplitz systems. Large linear systems with hermitian, positive definite Toeplitz matrices arise in some signal processing applications. A stable fast algorithm is given for solving these systems that is based on the preconditioned conjugate gradient method. The algorithm exploits Toeplitz structure to reduce the cost of an iteration to O(n log n) by applying the fast Fourier Transform to compute matrix-vector products. Matrix factorization is used as a preconditioner.
Preconditioned iterations to calculate extreme eigenvalues
Energy Technology Data Exchange (ETDEWEB)
Brand, C.W.; Petrova, S. [Institut fuer Angewandte Mathematik, Leoben (Austria)
1994-12-31
Common iterative algorithms to calculate a few extreme eigenvalues of a large, sparse matrix are Lanczos methods or power iterations. They converge at a rate proportional to the separation of the extreme eigenvalues from the rest of the spectrum. Appropriate preconditioning improves the separation of the eigenvalues. Davidson`s method and its generalizations exploit this fact. The authors examine a preconditioned iteration that resembles a truncated version of Davidson`s method with a different preconditioning strategy.
Management of Preconditioned Calves and Impacts of Preconditioning.
Hilton, W Mark
2015-07-01
When studying the practice of preconditioning (PC) calves, many factors need to be examined to determine if cow-calf producers should make this investment. Factors such as average daily gain, feed efficiency, available labor, length of the PC period, genetics, and marketing options must be analyzed. The health sales price advantage is an additional benefit in producing and selling PC calves but not the sole determinant of PC's financially feasibility. Studies show that a substantial advantage of PC is the selling of additional pounds at a cost of gain well below the marginal return of producing those additional pounds. Copyright © 2015 Elsevier Inc. All rights reserved.
International Nuclear Information System (INIS)
Dobritz, M.; Radkow, T.; Bautz, W.; Fellner, F.A.; Nittka, M.
2002-01-01
Purpose: The VIBE (volume interpolated breath-hold examination) sequence in combination with parallel acquisition technique (iPAT: integrated parallel acquisition technique) allows dynamic contrast-enhanced MRI of the liver with high temporal and spatial resolution. The aim of this study was to obtain first clinical experience with this technique for the detection and characterization of focal liver lesions. Materials and Methods: We examined 10 consecutive patients using a 1.5 T MR system (gradient field strength 30 mT/m) with a phased-array coil combination. Following sequences- were acquired: T 2 -w TSE and T 1 -w FLASH, after administration of gadolinium, 6 VIBE sequences with iPAT (TR/TE/matrix/partition thickness/time of acquisition: 6.2 ms/ 3.2 ms/256 x 192/4 mm/13 s), as well as T 1 -weighted FLASH with fat saturation. Two observers evaluated the different sequences concerning the number of lesions and their dignity. Following lesions were found: hepatocellular carcinoma (5 patients), hemangioma (2), metastasis (1), cyst (1), adenoma (1). Results: The VIBE sequences were superior for the detection of lesions with arterial hyperperfusion with a total of 33 focal lesions. 21 lesions were found with T 2 -w TSE and 20 with plain T 1 -weighted FLASH. Diagnostic accuracy increased with the VIBE sequence in comparison to the other sequences. Conclusion: VIBE with iPAT allows MR imaging of the liver with high spatial and temporal resolution providing dynamic contrast-enhanced information about the whole liver. This may lead to improved detection of liver lesions, especially hepatocellular carcinoma. (orig.) [de
International Nuclear Information System (INIS)
Ito, Satoshi; Kawawa, Yasuhiro; Yamada, Yoshifumi
2010-01-01
The signal obtained in the phase-scrambling Fourier transform (PSFT) imaging technique can be transformed to the signal described by the Fresnel transform of the objects, in which the amplitude of the PSFT presents some kind of blurred image of the objects. Therefore, the signal can be considered to exist in the object domain as well as the Fourier domain of the object. This notable feature makes it possible to assign weights to the reconstructed images by applying a weighting function to the PSFT signal after data acquisition, and as a result, pseudo-parallel image reconstruction using these aliased image data with different weights on the images is feasible. In this study, the improvements in image quality with such pseudo-parallel imaging were examined and demonstrated. The weighting function of the PSFT signal that provides a given weight on the image is estimated using the obtained image data and is iteratively updated after sensitivity encoding (SENSE)-based image reconstruction. Simulation studies showed that reconstruction errors were dramatically reduced and that the spatial resolution was also improved in almost all image spaces. The proposed method was applied to signals synthesized from MR image data with phase variations to verify its effectiveness. It was found that the image quality was improved and that images almost entirely free of aliasing artifacts could be obtained. (author)
Tian, Shan; Zhu, Fengping; Hu, Ruiping; Tian, Song; Chen, Xingxing; Lou, Dan; Cao, Bing; Chen, Qiulei; Li, Bai; Li, Fang; Bai, Yulong; Wu, Yi; Zhu, Yulian
2018-01-01
Exercise preconditioning is a simple and effective way to prevent ischemia. This paper further provided the mechanism in hemodynamic aspects at the cellular level. To study the anti-apoptotic effects of fluid mechanics preconditioning, Cultured rats brain microvascular endothelial cells were given fluid intervention in a parallel plate flow chamber before oxygen glucose deprivation. It showed that fluid mechanics preconditioning could inhibit the apoptosis of endothelial cells, and this process might be mediated by the shear stress activation of Tie-2 on cells membrane surface and Bcl-2 on the mitochondria surface. Copyright © 2017 Elsevier B.V. All rights reserved.
Parallelized preconditioned model building algorithm for matrix factorization
Kaya, Kamer; Birbil, İlker; Birbil, Ilker; Öztürk, Mehmet Kaan; Ozturk, Mehmet Kaan; Gohari, Amir
2017-01-01
Matrix factorization is a common task underlying several machine learning applications such as recommender systems, topic modeling, or compressed sensing. Given a large and possibly sparse matrix A, we seek two smaller matrices W and H such that their product is as close to A as possible. The objective is minimizing the sum of square errors in the approximation. Typically such problems involve hundreds of thousands of unknowns, so an optimizer must be exceptionally efficient. In this study, a...
Isoflurane preconditions myocardium against infarction via release of free radicals
Müllenheim, Jost; Ebel, Dirk; Frässdorf, Jan; Preckel, Benedikt; Thämer, Volker; Schlack, Wolfgang
2002-01-01
BACKGROUND: Isoflurane exerts cardioprotective effects that mimic the ischemic preconditioning phenomenon. Generation of free radicals is implicated in ischemic preconditioning. The authors investigated whether isoflurane-induced preconditioning may involve release of free radicals. METHODS:
Shao, Meiyue; Aktulga, H. Metin; Yang, Chao; Ng, Esmond G.; Maris, Pieter; Vary, James P.
2018-01-01
We describe a number of recently developed techniques for improving the performance of large-scale nuclear configuration interaction calculations on high performance parallel computers. We show the benefit of using a preconditioned block iterative method to replace the Lanczos algorithm that has traditionally been used to perform this type of computation. The rapid convergence of the block iterative method is achieved by a proper choice of starting guesses of the eigenvectors and the construction of an effective preconditioner. These acceleration techniques take advantage of special structure of the nuclear configuration interaction problem which we discuss in detail. The use of a block method also allows us to improve the concurrency of the computation, and take advantage of the memory hierarchy of modern microprocessors to increase the arithmetic intensity of the computation relative to data movement. We also discuss the implementation details that are critical to achieving high performance on massively parallel multi-core supercomputers, and demonstrate that the new block iterative solver is two to three times faster than the Lanczos based algorithm for problems of moderate sizes on a Cray XC30 system.
Design Considerations for a Flexible Multigrid Preconditioning Library
Directory of Open Access Journals (Sweden)
Jérémie Gaidamour
2012-01-01
Full Text Available MueLu is a library within the Trilinos software project [An overview of Trilinos, Technical Report SAND2003-2927, Sandia National Laboratories, 2003] and provides a framework for parallel multigrid preconditioning methods for large sparse linear systems. While providing efficient implementations of modern multigrid methods based on smoothed aggregation and energy minimization concepts, MueLu is designed to be customized and extended. This article gives an overview of design considerations for the MueLu package: user interfaces, internal design, data management, usage of modern software constructs, leveraging Trilinos capabilities, linear algebra operations and advanced application.
Hejranfar, Kazem; Parseh, Kaveh
2017-09-01
The preconditioned characteristic boundary conditions based on the artificial compressibility (AC) method are implemented at artificial boundaries for the solution of two- and three-dimensional incompressible viscous flows in the generalized curvilinear coordinates. The compatibility equations and the corresponding characteristic variables (or the Riemann invariants) are mathematically derived and then applied as suitable boundary conditions in a high-order accurate incompressible flow solver. The spatial discretization of the resulting system of equations is carried out by the fourth-order compact finite-difference (FD) scheme. In the preconditioning applied here, the value of AC parameter in the flow field and also at the far-field boundary is automatically calculated based on the local flow conditions to enhance the robustness and performance of the solution algorithm. The code is fully parallelized using the Concurrency Runtime standard and Parallel Patterns Library (PPL) and its performance on a multi-core CPU is analyzed. The incompressible viscous flows around a 2-D circular cylinder, a 2-D NACA0012 airfoil and also a 3-D wavy cylinder are simulated and the accuracy and performance of the preconditioned characteristic boundary conditions applied at the far-field boundaries are evaluated in comparison to the simplified boundary conditions and the non-preconditioned characteristic boundary conditions. It is indicated that the preconditioned characteristic boundary conditions considerably improve the convergence rate of the solution of incompressible flows compared to the other boundary conditions and the computational costs are significantly decreased.
Ischemic preconditioning protects against ischemic brain injury
Directory of Open Access Journals (Sweden)
Xiao-meng Ma
2016-01-01
Full Text Available In this study, we hypothesized that an increase in integrin αv ß 3 and its co-activator vascular endothelial growth factor play important neuroprotective roles in ischemic injury. We performed ischemic preconditioning with bilateral common carotid artery occlusion for 5 minutes in C57BL/6J mice. This was followed by ischemic injury with bilateral common carotid artery occlusion for 30 minutes. The time interval between ischemic preconditioning and lethal ischemia was 48 hours. Histopathological analysis showed that ischemic preconditioning substantially diminished damage to neurons in the hippocampus 7 days after ischemia. Evans Blue dye assay showed that ischemic preconditioning reduced damage to the blood-brain barrier 24 hours after ischemia. This demonstrates the neuroprotective effect of ischemic preconditioning. Western blot assay revealed a significant reduction in protein levels of integrin αv ß 3, vascular endothelial growth factor and its receptor in mice given ischemic preconditioning compared with mice not given ischemic preconditioning 24 hours after ischemia. These findings suggest that the neuroprotective effect of ischemic preconditioning is associated with lower integrin αv ß 3 and vascular endothelial growth factor levels in the brain following ischemia.
Directory of Open Access Journals (Sweden)
Kamran Siddique
2017-09-01
Full Text Available Anomaly detection systems, also known as intrusion detection systems (IDSs, continuously monitor network traffic aiming to identify malicious actions. Extensive research has been conducted to build efficient IDSs emphasizing two essential characteristics. The first is concerned with finding optimal feature selection, while another deals with employing robust classification schemes. However, the advent of big data concepts in anomaly detection domain and the appearance of sophisticated network attacks in the modern era require some fundamental methodological revisions to develop IDSs. Therefore, we first identify two more significant characteristics in addition to the ones mentioned above. These refer to the need for employing specialized big data processing frameworks and utilizing appropriate datasets for validating system’s performance, which is largely overlooked in existing studies. Afterwards, we set out to develop an anomaly detection system that comprehensively follows these four identified characteristics, i.e., the proposed system (i performs feature ranking and selection using information gain and automated branch-and-bound algorithms respectively; (ii employs logistic regression and extreme gradient boosting techniques for classification; (iii introduces bulk synchronous parallel processing to cater computational requirements of high-speed big data networks; and; (iv uses the Infromation Security Centre of Excellence, of the University of Brunswick real-time contemporary dataset for performance evaluation. We present experimental results that verify the efficacy of the proposed system.
Algorithms for computational fluid dynamics n parallel processors
International Nuclear Information System (INIS)
Van de Velde, E.F.
1986-01-01
A study of parallel algorithms for the numerical solution of partial differential equations arising in computational fluid dynamics is presented. The actual implementation on parallel processors of shared and nonshared memory design is discussed. The performance of these algorithms is analyzed in terms of machine efficiency, communication time, bottlenecks and software development costs. For elliptic equations, a parallel preconditioned conjugate gradient method is described, which has been used to solve pressure equations discretized with high order finite elements on irregular grids. A parallel full multigrid method and a parallel fast Poisson solver are also presented. Hyperbolic conservation laws were discretized with parallel versions of finite difference methods like the Lax-Wendroff scheme and with the Random Choice method. Techniques are developed for comparing the behavior of an algorithm on different architectures as a function of problem size and local computational effort. Effective use of these advanced architecture machines requires the use of machine dependent programming. It is shown that the portability problems can be minimized by introducing high level operations on vectors and matrices structured into program libraries
Preconditioned Krylov subspace methods for eigenvalue problems
Energy Technology Data Exchange (ETDEWEB)
Wu, Kesheng; Saad, Y.; Stathopoulos, A. [Univ. of Minnesota, Minneapolis, MN (United States)
1996-12-31
Lanczos algorithm is a commonly used method for finding a few extreme eigenvalues of symmetric matrices. It is effective if the wanted eigenvalues have large relative separations. If separations are small, several alternatives are often used, including the shift-invert Lanczos method, the preconditioned Lanczos method, and Davidson method. The shift-invert Lanczos method requires direct factorization of the matrix, which is often impractical if the matrix is large. In these cases preconditioned schemes are preferred. Many applications require solution of hundreds or thousands of eigenvalues of large sparse matrices, which pose serious challenges for both iterative eigenvalue solver and preconditioner. In this paper we will explore several preconditioned eigenvalue solvers and identify the ones suited for finding large number of eigenvalues. Methods discussed in this paper make up the core of a preconditioned eigenvalue toolkit under construction.
Distributed Memory Parallel Computing with SEAWAT
Verkaik, J.; Huizer, S.; van Engelen, J.; Oude Essink, G.; Ram, R.; Vuik, K.
2017-12-01
Fresh groundwater reserves in coastal aquifers are threatened by sea-level rise, extreme weather conditions, increasing urbanization and associated groundwater extraction rates. To counteract these threats, accurate high-resolution numerical models are required to optimize the management of these precious reserves. The major model drawbacks are long run times and large memory requirements, limiting the predictive power of these models. Distributed memory parallel computing is an efficient technique for reducing run times and memory requirements, where the problem is divided over multiple processor cores. A new Parallel Krylov Solver (PKS) for SEAWAT is presented. PKS has recently been applied to MODFLOW and includes Conjugate Gradient (CG) and Biconjugate Gradient Stabilized (BiCGSTAB) linear accelerators. Both accelerators are preconditioned by an overlapping additive Schwarz preconditioner in a way that: a) subdomains are partitioned using Recursive Coordinate Bisection (RCB) load balancing, b) each subdomain uses local memory only and communicates with other subdomains by Message Passing Interface (MPI) within the linear accelerator, c) it is fully integrated in SEAWAT. Within SEAWAT, the PKS-CG solver replaces the Preconditioned Conjugate Gradient (PCG) solver for solving the variable-density groundwater flow equation and the PKS-BiCGSTAB solver replaces the Generalized Conjugate Gradient (GCG) solver for solving the advection-diffusion equation. PKS supports the third-order Total Variation Diminishing (TVD) scheme for computing advection. Benchmarks were performed on the Dutch national supercomputer (https://userinfo.surfsara.nl/systems/cartesius) using up to 128 cores, for a synthetic 3D Henry model (100 million cells) and the real-life Sand Engine model ( 10 million cells). The Sand Engine model was used to investigate the potential effect of the long-term morphological evolution of a large sand replenishment and climate change on fresh groundwater resources
Preconditioning for Mixed Finite Element Formulations of Elliptic Problems
Wildey, Tim; Xue, Guangri
2013-01-01
In this paper, we discuss a preconditioning technique for mixed finite element discretizations of elliptic equations. The technique is based on a block-diagonal approximation of the mass matrix which maintains the sparsity and positive definiteness of the corresponding Schur complement. This preconditioner arises from the multipoint flux mixed finite element method and is robust with respect to mesh size and is better conditioned for full permeability tensors than a preconditioner based on a diagonal approximation of the mass matrix. © Springer-Verlag Berlin Heidelberg 2013.
Directory of Open Access Journals (Sweden)
Ahmad Sukari Halim
2013-11-01
Full Text Available BackgroundIschemic preconditioning has been shown to improve the outcomes of hypoxic tolerance of the heart, brain, lung, liver, jejunum, skin, and muscle tissues. However, to date, no report of ischemic preconditioning on vascularized bone grafts has been published.MethodsSixteen rabbits were divided into four groups with ischemic times of 2, 6, 14, and 18 hours. Half of the rabbits in each group underwent ischemic preconditioning. The osteomyocutaneous flaps consisted of the tibia bone, from which the overlying muscle and skin were raised. The technique of ischemic preconditioning involved applying a vascular clamp to the pedicle for 3 cycles of 10 minutes each. The rabbits then underwent serial plain radiography and computed tomography imaging on the first, second, fourth, and sixth postoperative weeks. Following this, all of the rabbits were sacrificed and histological examinations were performed.ResultsThe results showed that for clinical analysis of the skin flaps and bone grafts, the preconditioned groups showed better survivability. In the plain radiographs, except for two non-preconditioned rabbits with intraoperative ischemic times of 6 hours, all began to show early callus formation at the fourth week. The computed tomography findings showed more callus formation in the preconditioned groups for all of the ischemic times except for the 18-hour group. The histological findings correlated with the radiological findings. There was no statistical significance in the difference between the two groups.ConclusionsIn conclusion, ischemic preconditioning improved the survivability of skin flaps and increased callus formation during the healing process of vascularized bone grafts.
Preconditioned conjugate gradient methods for the Navier-Stokes equations
Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing
1994-01-01
A preconditioned Krylov subspace method (GMRES) is used to solve the linear systems of equations formed at each time-integration step of the unsteady, two-dimensional, compressible Navier-Stokes equations of fluid flow. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux-split formulation. Several preconditioning techniques are investigated to enhance the efficiency and convergence rate of the implicit solver based on the GMRES algorithm. The superiority of the new solver is established by comparisons with a conventional implicit solver, namely line Gauss-Seidel relaxation (LGSR). Computational test results for low-speed (incompressible flow over a backward-facing step at Mach 0.1), transonic flow (trailing edge flow in a transonic turbine cascade), and hypersonic flow (shock-on-shock interactions on a cylindrical leading edge at Mach 6.0) are presented. For the Mach 0.1 case, overall speedup factors of up to 17 (in terms of time-steps) and 15 (in terms of CPU time on a CRAY-YMP/8) are found in favor of the preconditioned GMRES solver, when compared with the LGSR solver. The corresponding speedup factors for the transonic flow case are 17 and 23, respectively. The hypersonic flow case shows slightly lower speedup factors of 9 and 13, respectively. The study of preconditioners conducted in this research reveals that a new LUSGS-type preconditioner is much more efficient than a conventional incomplete LU-type preconditioner.
International Nuclear Information System (INIS)
Shibata, Koichi; Notohara, Daisuke; Sakai, Takihito
2014-01-01
Purpose: Parallel-scanning tomosynthesis (PS-TS) is a novel technique that fuses the slot scanning technique and the conventional tomosynthesis (TS) technique. This approach allows one to obtain long-view tomosynthesis images in addition to normally sized tomosynthesis images, even when using a system that has no linear tomographic scanning function. The reconstruction technique and an evaluation of the resulting image quality for PS-TS are described in this paper. Methods: The PS-TS image-reconstruction technique consists of several steps (1) the projection images are divided into strips, (2) the strips are stitched together to construct images corresponding to the reconstruction plane, (3) the stitched images are filtered, and (4) the filtered stitched images are back-projected. In the case of PS-TS using the fixed-focus reconstruction method (PS-TS-F), one set of stitched images is used for the reconstruction planes at all heights, thus avoiding the necessity of repeating steps (1)–(3). A physical evaluation of the image quality of PS-TS-F compared with that of the conventional linear TS was performed using a R/F table (Sonialvision safire, Shimadzu Corp., Kyoto, Japan). The tomographic plane with the best theoretical spatial resolution (the in-focus plane, IFP) was set at a height of 100 mm from the table top by adjusting the reconstruction program. First, the spatial frequency response was evaluated at heights of −100, −50, 0, 50, 100, and 150 mm from the IFP using the edge of a 0.3-mm-thick copper plate. Second, the spatial resolution at each height was visually evaluated using an x-ray test pattern (Model No. 38, PTW Freiburg, Germany). Third, the slice sensitivity at each height was evaluated via the wire method using a 0.1-mm-diameter tungsten wire. Phantom studies using a knee phantom and a whole-body phantom were also performed. Results: The spatial frequency response of PS-TS-F yielded the best results at the IFP and degraded slightly as the
Shibata, Koichi; Notohara, Daisuke; Sakai, Takihito
2014-11-01
Parallel-scanning tomosynthesis (PS-TS) is a novel technique that fuses the slot scanning technique and the conventional tomosynthesis (TS) technique. This approach allows one to obtain long-view tomosynthesis images in addition to normally sized tomosynthesis images, even when using a system that has no linear tomographic scanning function. The reconstruction technique and an evaluation of the resulting image quality for PS-TS are described in this paper. The PS-TS image-reconstruction technique consists of several steps (1) the projection images are divided into strips, (2) the strips are stitched together to construct images corresponding to the reconstruction plane, (3) the stitched images are filtered, and (4) the filtered stitched images are back-projected. In the case of PS-TS using the fixed-focus reconstruction method (PS-TS-F), one set of stitched images is used for the reconstruction planes at all heights, thus avoiding the necessity of repeating steps (1)-(3). A physical evaluation of the image quality of PS-TS-F compared with that of the conventional linear TS was performed using a R/F table (Sonialvision safire, Shimadzu Corp., Kyoto, Japan). The tomographic plane with the best theoretical spatial resolution (the in-focus plane, IFP) was set at a height of 100 mm from the table top by adjusting the reconstruction program. First, the spatial frequency response was evaluated at heights of -100, -50, 0, 50, 100, and 150 mm from the IFP using the edge of a 0.3-mm-thick copper plate. Second, the spatial resolution at each height was visually evaluated using an x-ray test pattern (Model No. 38, PTW Freiburg, Germany). Third, the slice sensitivity at each height was evaluated via the wire method using a 0.1-mm-diameter tungsten wire. Phantom studies using a knee phantom and a whole-body phantom were also performed. The spatial frequency response of PS-TS-F yielded the best results at the IFP and degraded slightly as the distance from the IFP increased. A
Energy Technology Data Exchange (ETDEWEB)
Shibata, Koichi, E-mail: shibatak@suzuka-u.ac.jp [Department of Radiological Technology, Faculty of Health Science, Suzuka University of Medical Science 1001-1, Kishioka-cho, Suzuka 510-0293 (Japan); Notohara, Daisuke; Sakai, Takihito [R and D Department, Medical Systems Division, Shimadzu Corporation 1, Nishinokyo-Kuwabara-cho, Nakagyo-ku, Kyoto 604-8511 (Japan)
2014-11-01
Purpose: Parallel-scanning tomosynthesis (PS-TS) is a novel technique that fuses the slot scanning technique and the conventional tomosynthesis (TS) technique. This approach allows one to obtain long-view tomosynthesis images in addition to normally sized tomosynthesis images, even when using a system that has no linear tomographic scanning function. The reconstruction technique and an evaluation of the resulting image quality for PS-TS are described in this paper. Methods: The PS-TS image-reconstruction technique consists of several steps (1) the projection images are divided into strips, (2) the strips are stitched together to construct images corresponding to the reconstruction plane, (3) the stitched images are filtered, and (4) the filtered stitched images are back-projected. In the case of PS-TS using the fixed-focus reconstruction method (PS-TS-F), one set of stitched images is used for the reconstruction planes at all heights, thus avoiding the necessity of repeating steps (1)–(3). A physical evaluation of the image quality of PS-TS-F compared with that of the conventional linear TS was performed using a R/F table (Sonialvision safire, Shimadzu Corp., Kyoto, Japan). The tomographic plane with the best theoretical spatial resolution (the in-focus plane, IFP) was set at a height of 100 mm from the table top by adjusting the reconstruction program. First, the spatial frequency response was evaluated at heights of −100, −50, 0, 50, 100, and 150 mm from the IFP using the edge of a 0.3-mm-thick copper plate. Second, the spatial resolution at each height was visually evaluated using an x-ray test pattern (Model No. 38, PTW Freiburg, Germany). Third, the slice sensitivity at each height was evaluated via the wire method using a 0.1-mm-diameter tungsten wire. Phantom studies using a knee phantom and a whole-body phantom were also performed. Results: The spatial frequency response of PS-TS-F yielded the best results at the IFP and degraded slightly as the
Energy Technology Data Exchange (ETDEWEB)
Habermann, C.R.; Cramer, M.C.; Aldefeld, D.; Weiss, F.; Kaul, M.G.; Adam, G. [Radiologisches Zentrum, Klinik und Poliklinik fuer Diagnostische und Interventionelle Radiologie, Universitaetsklinikum Hamburg-Eppendorf (Germany); Graessner, J. [Siemens Medical Systems, Hamburg (Germany); Reitmeier, F.; Jaehne, M. [Kopf- und Hautzentrum, Klinik und Poliklinik fuer Hals-, Nasen- und Ohrenheilkunde, Universitaetsklinikum Hamburg-Eppendorf (Germany); Petersen, K.U. [Zentrum fuer Psychosoziale Medizin, Klinik und Poliklinik fuer Psychiatrie und Psychotherapie, Universitaetsklinikum Hamburg-Eppendorf (Germany)
2005-04-01
Purpose: To optimise a fast sequence for MR-sialography and to compare a parallel and non-parallel acquisition technique. Additionally, the effect of oral stimulation regarding the image quality was evaluated. Material and Methods: All examinations were performed by using a 1.5-T superconducting system. After developing a sufficient sequence for MR-sialography, a single-shot turbo-spin-echo sequence (ss-TSE) with an acquisition time of 2.8 sec was used in transverse and oblique sagittal orientation in 27 healthy volunteers. All images were performed with and without parallel imaging technique. The assessment of the ductal system of the submandibular and parotid gland was performed using a 1 to 5 visual scale for each side separately. Images were evaluated by four independent experienced radiologists. For statistical evaluation, an ANOVA with post-hoc comparisons was used with an overall two-tailed significance level of P=.05. For evaluation of interobserver variability, an intraclass correlation was computed and correlation >.08 was determined to indicate a high correlation. Results: All parts of salivary excretal ducts could be visualised in all volunteers, with an overall rating for all ducts of 2.26 (SD{+-}1.09). Between the four observers a high correlation could be obtained with an intraclass correlation of 0.9475. A significant influence regarding the slice angulations could not be obtained (p=0.74). In all healthy volunteers the visibility of excretory ducts improved significantly after oral application of a Sialogogum (p<0.001; {eta}{sup 2}=0.049). The use of a parallel imaging technique did not lead to an improvement of visualisation, showing a significant loss of image quality compared to an acquistion technique without parallel imaging (p<0.001; {eta}{sup 2}=0.013). Conclusion: The optimised ss-TSE MR-sialography seems to be a fast and sufficient technique for visualisation of excretory ducts of the main salivary glands, with no elaborate post
International Nuclear Information System (INIS)
Yanes, Enrique G.; Miller-Ihli, Nancy J.
2005-01-01
Four different, low flow parallel path Mira Mist CE nebulizers were evaluated and compared in support of an ongoing project related to the use of microseparation techniques interfaced to inductively coupled plasma mass spectrometry for the quantification of cobalamin species (Vitamin B12). For the characterization of the different Mira Mist CE nebulizers, the nebulizer orientation as well as the effect of methanol on analytical response was the focus of the study. The position of the gas outlet on the nebulizer which consistently provided the maximum signal was when it was rotated to the 11 o'clock position when the nebulizer is viewed end-on. With this orientation the increased signal may be explained by the fact that the cone angle of the aerosol is such that the largest percentage of the aerosol is directed to the center of the spray chamber and consequently into the plasma. To characterize the nebulizer's performance, the signal response of a multielement solution containing elements with a variety of ionization potentials was used. The selection of elements with varying ionization energies and degrees of ionization was essential for a better understanding of observed increases in signal enhancement when methanol was used. Two different phenomena contribute to signal enhancement when using methanol: the first is improved transport efficiency and the second is the 'carbon enhancement effect'. The net result was that as much as a 30-fold increase in signal was observed for As and Mg when using a make-up solution of 20% methanol at a 15 μL/min flow rate which is equivalent to a net volume of 3 μL/min of pure methanol
Introduction to parallel programming
Brawer, Steven
1989-01-01
Introduction to Parallel Programming focuses on the techniques, processes, methodologies, and approaches involved in parallel programming. The book first offers information on Fortran, hardware and operating system models, and processes, shared memory, and simple parallel programs. Discussions focus on processes and processors, joining processes, shared memory, time-sharing with multiple processors, hardware, loops, passing arguments in function/subroutine calls, program structure, and arithmetic expressions. The text then elaborates on basic parallel programming techniques, barriers and race
Iterative algorithms for large sparse linear systems on parallel computers
Adams, L. M.
1982-01-01
Algorithms for assembling in parallel the sparse system of linear equations that result from finite difference or finite element discretizations of elliptic partial differential equations, such as those that arise in structural engineering are developed. Parallel linear stationary iterative algorithms and parallel preconditioned conjugate gradient algorithms are developed for solving these systems. In addition, a model for comparing parallel algorithms on array architectures is developed and results of this model for the algorithms are given.
Parallelizable approximate solvers for recursions arising in preconditioning
Energy Technology Data Exchange (ETDEWEB)
Shapira, Y. [Israel Inst. of Technology, Haifa (Israel)
1996-12-31
For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.
Ischemic Preconditioning of One Forearm Enhances Static and Dynamic Apnea
DEFF Research Database (Denmark)
Kjeld, Thomas; Rasmussen, Mads Reinholdt; Jattu, Timo
2014-01-01
INTRODUCTION: Ischemic preconditioning enhances ergometer cycling and swimming performance. We evaluated whether ischemic preconditioning of one forearm (four times for 5 min) also affects static breath hold and underwater swimming, whereas the effect of similar preconditioning on ergometer rowing...... preconditioning reduced the forearm oxygen saturation from 65% ± 7% to 19% ± 7% (mean ± SD; P right thigh.......05). CONCLUSIONS: We conclude that while the effect of ischemic preconditioning (of one forearm) on ergometer rowing was minimal, probably because of reduced muscle oxygenation during the warm-up, ischemic preconditioning does enhance both static and dynamic apnea, supporting that muscle ischemia is an important...
Xenon preconditioning: molecular mechanisms and biological effects
Directory of Open Access Journals (Sweden)
Liu Wenwu
2013-01-01
Full Text Available Abstract Xenon is one of noble gases and has been recognized as an anesthetic for more than 50 years. Xenon possesses many of the characteristics of an ideal anesthetic, but it is not widely applied in clinical practice mainly because of its high cost. In recent years, numerous studies have demonstrated that xenon as an anesthetic can exert neuroprotective and cardioprotective effects in different models. Moreover, xenon has been applied in the preconditioning, and the neuroprotective and cardioprotective effects of xenon preconditioning have been investigated in a lot of studies in which some mechanisms related to these protections are proposed. In this review, we summarized these mechanisms and the biological effects of xenon preconditioning.
Minimal residual method stronger than polynomial preconditioning
Energy Technology Data Exchange (ETDEWEB)
Faber, V.; Joubert, W.; Knill, E. [Los Alamos National Lab., NM (United States)] [and others
1994-12-31
Two popular methods for solving symmetric and nonsymmetric systems of equations are the minimal residual method, implemented by algorithms such as GMRES, and polynomial preconditioning methods. In this study results are given on the convergence rates of these methods for various classes of matrices. It is shown that for some matrices, such as normal matrices, the convergence rates for GMRES and for the optimal polynomial preconditioning are the same, and for other matrices such as the upper triangular Toeplitz matrices, it is at least assured that if one method converges then the other must converge. On the other hand, it is shown that matrices exist for which restarted GMRES always converges but any polynomial preconditioning of corresponding degree makes no progress toward the solution for some initial error. The implications of these results for these and other iterative methods are discussed.
Projection preconditioning for Lanczos-type methods
Energy Technology Data Exchange (ETDEWEB)
Bielawski, S.S.; Mulyarchik, S.G.; Popov, A.V. [Belarusian State Univ., Minsk (Belarus)
1996-12-31
We show how auxiliary subspaces and related projectors may be used for preconditioning nonsymmetric system of linear equations. It is shown that preconditioned in such a way (or projected) system is better conditioned than original system (at least if the coefficient matrix of the system to be solved is symmetrizable). Two approaches for solving projected system are outlined. The first one implies straightforward computation of the projected matrix and consequent using some direct or iterative method. The second approach is the projection preconditioning of conjugate gradient-type solver. The latter approach is developed here in context with biconjugate gradient iteration and some related Lanczos-type algorithms. Some possible particular choices of auxiliary subspaces are discussed. It is shown that one of them is equivalent to using colorings. Some results of numerical experiments are reported.
Filli, Lukas; Piccirelli, Marco; Kenkel, David; Guggenberger, Roman; Andreisek, Gustav; Beck, Thomas; Runge, Val M; Boss, Andreas
2015-01-01
PURPOSE The aim of this study was to investigate the feasibility of accelerated diffusion tensor imaging (DTI) of skeletal muscle using echo planar imaging (EPI) applying simultaneous multislice excitation with a blipped controlled aliasing in parallel imaging results in higher acceleration unaliasing technique. MATERIALS AND METHODS After federal ethics board approval, the lower leg muscles of 8 healthy volunteers (mean [SD] age, 29.4 [2.9] years) were examined in a clinical 3-T magnetic ...
International Nuclear Information System (INIS)
Habermann, C.R.; Cramer, M.C.; Aldefeld, D.; Weiss, F.; Kaul, M.G.; Adam, G.; Graessner, J.; Reitmeier, F.; Jaehne, M.; Petersen, K.U.
2005-01-01
Purpose: To optimise a fast sequence for MR-sialography and to compare a parallel and non-parallel acquisition technique. Additionally, the effect of oral stimulation regarding the image quality was evaluated. Material and Methods: All examinations were performed by using a 1.5-T superconducting system. After developing a sufficient sequence for MR-sialography, a single-shot turbo-spin-echo sequence (ss-TSE) with an acquisition time of 2.8 sec was used in transverse and oblique sagittal orientation in 27 healthy volunteers. All images were performed with and without parallel imaging technique. The assessment of the ductal system of the submandibular and parotid gland was performed using a 1 to 5 visual scale for each side separately. Images were evaluated by four independent experienced radiologists. For statistical evaluation, an ANOVA with post-hoc comparisons was used with an overall two-tailed significance level of P=.05. For evaluation of interobserver variability, an intraclass correlation was computed and correlation >.08 was determined to indicate a high correlation. Results: All parts of salivary excretal ducts could be visualised in all volunteers, with an overall rating for all ducts of 2.26 (SD±1.09). Between the four observers a high correlation could be obtained with an intraclass correlation of 0.9475. A significant influence regarding the slice angulations could not be obtained (p=0.74). In all healthy volunteers the visibility of excretory ducts improved significantly after oral application of a Sialogogum (p 2 =0.049). The use of a parallel imaging technique did not lead to an improvement of visualisation, showing a significant loss of image quality compared to an acquistion technique without parallel imaging (p 2 =0.013). Conclusion: The optimised ss-TSE MR-sialography seems to be a fast and sufficient technique for visualisation of excretory ducts of the main salivary glands, with no elaborate post-processing needed. To improve results of MR
International Nuclear Information System (INIS)
Cookson, Daniel T.; Zaman, Zubayr; Gordon-Smith, James; Ireland, Hamish M.; Hayes, Peter C.
2011-01-01
Purpose: To investigate the reproducibility and technical and clinical success of the parallel technique of transjugular intrahepatic portosystemic shunt (TIPS) reduction in the management of refractory hepatic encephalopathy (HE). Materials and Methods: A 10-mm-diameter self-expanding stent graft and a 5–6-mm-diameter balloon-expandable stent were placed in parallel inside the existing TIPS in 8 patients via a dual unilateral transjugular approach. Changes in portosystemic pressure gradient and HE grade were used as primary end points. Results: TIPS reduction was technically successful in all patients. Mean ± standard deviation portosystemic pressure gradient before and after shunt reduction was 4.9 ± 3.6 mmHg (range, 0–12 mmHg) and 10.5 ± 3.9 mmHg (range, 6–18 mmHg). Duration of follow-up was 137 ± 117.8 days (range, 18–326 days). Clinical improvement of HE occurred in 5 patients (62.5%) with resolution of HE in 4 patients (50%). Single episodes of recurrent gastrointestinal hemorrhage occurred in 3 patients (37.5%). These were self-limiting in 2 cases and successfully managed in 1 case by correction of coagulopathy and blood transfusion. Two of these patients (25%) died, one each of renal failure and hepatorenal failure. Conclusion: The parallel technique of TIPS reduction is reproducible and has a high technical success rate. A dual unilateral transjugular approach is advantageous when performing this procedure. The parallel technique allows repeat bidirectional TIPS adjustment and may be of significant clinical benefit in the management of refractory HE.
International Nuclear Information System (INIS)
Petridis, C.; Ries, T.; Cramer, M.C.; Graessner, J.; Petersen, K.U.; Reitmeier, F.; Jaehne, M.; Weiss, F.; Adam, G.; Habermann, C.R.
2007-01-01
Purpose: To evaluate an ultra-fast sequence for MR sialography requiring no post-processing and to compare the acquisition technique regarding the effect of oral stimulation with a parallel acquisition technique in patients with salivary gland diseases. Materials and Methods: 128 patients with salivary gland disease were prospectively examined using a 1.5-T superconducting system with a 30 mT/m maximum gradient capability and a maximum slew rate of 125 mT/m/sec. A single-shot turbo-spin-echo sequence (ss-TSE) with an acquisition time of 2.8 sec was used in transverse and oblique sagittal orientation. All images were obtained with and without a parallel imaging technique. The evaluation of the ductal system of the parotid and submandibular gland was performed using a visual scale of 1-5 for each side. The images were assessed by two independent experienced radiologists. An ANOVA with posthoc comparisons and an overall two tailed significance level of p=0.05 was used for the statistical evaluation. An intraclass correlation was computed to evaluate interobserver variability and a correlation of >0.8 was determined, thereby indicating a high correlation. Results: Depending on the diagnosed diseases and the absence of abruption of the ducts, all parts of excretory ducts were able to be visualized in all patients using the developed technique with an overall rating for all ducts of 2.70 (SD±0.89). A high correlation was achieved between the two observers with an intraclass correlation of 0.73. Oral application of a sialogogum improved the visibility of excretory ducts significantly (p<0.001). In contrast, the use of a parallel imaging technique led to a significant decrease in image quality (p=0,011). (orig.)
Kaporin, I. E.
2012-02-01
In order to precondition a sparse symmetric positive definite matrix, its approximate inverse is examined, which is represented as the product of two sparse mutually adjoint triangular matrices. In this way, the solution of the corresponding system of linear algebraic equations (SLAE) by applying the preconditioned conjugate gradient method (CGM) is reduced to performing only elementary vector operations and calculating sparse matrix-vector products. A method for constructing the above preconditioner is described and analyzed. The triangular factor has a fixed sparsity pattern and is optimal in the sense that the preconditioned matrix has a minimum K-condition number. The use of polynomial preconditioning based on Chebyshev polynomials makes it possible to considerably reduce the amount of scalar product operations (at the cost of an insignificant increase in the total number of arithmetic operations). The possibility of an efficient massively parallel implementation of the resulting method for solving SLAEs is discussed. For a sequential version of this method, the results obtained by solving 56 test problems from the Florida sparse matrix collection (which are large-scale and ill-conditioned) are presented. These results show that the method is highly reliable and has low computational costs.
Preconditioning the modified conjugate gradient method ...
African Journals Online (AJOL)
In this paper, the convergence analysis of the conventional conjugate Gradient method was reviewed. And the convergence analysis of the modified conjugate Gradient method was analysed with our extension on preconditioning the algorithm. Convergence of the algorithm is a function of the condition number of M-1A.
Equivalent operator preconditioning for elliptic problems
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Karátson, J.
2009-01-01
Roč. 50, č. 3 (2009), s. 297-380 ISSN 1017-1398 Institutional research plan: CEZ:AV0Z30860518 Keywords : Elliptic problem * Conjugate gradient method * preconditioning * equivalent operators * compact operators Subject RIV: BA - General Mathematics Impact factor: 0.716, year: 2009 http://en.scientificcommons.org/42514649
Preconditioning of iterative methods - theory and applications
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Blaheta, Radim; Neytcheva, M.; Pultarová, I.
2015-01-01
Roč. 22, č. 6 (2015), s. 901-902 ISSN 1070-5325 Institutional support: RVO:68145535 Keywords : preconditioning * iterative methods * applications Subject RIV: BA - General Mathematics Impact factor: 1.431, year: 2015 http://onlinelibrary.wiley.com/doi/10.1002/nla.2016/epdf
Itoh, Shoji; Sugihara, Masaaki
2016-01-01
We present a theorem that defines the direction of a preconditioned system for the bi-conjugate gradient (BiCG) method, and we extend it to preconditioned bi-Lanczos-type algorithms. We show that the direction of a preconditioned system is switched by construction and by the settings of the initial shadow residual vector. We analyze and compare the polynomial structures of four preconditioned BiCG algorithms.
GPU acceleration of preconditioned solvers for ill-conditioned linear systems
Gupta, R.
2015-01-01
In this work we study the implementations of deflation and preconditioning techniques for solving ill-conditioned linear systems using iterative methods. Solving such systems can be a time-consuming process because of the jumps in the coefficients due to large difference in material properties. We
Chabory, A.; Hon, de B.P.; Schilders, W.H.A.; Tijhuis, A.G.
2008-01-01
Finite-difference techniques are very popular and versatile numerical tools in computational electromagnetics. In this paper, we propose a preconditioned finite-difference frequency-domain method (FDFD) to model periodic structures in 2D and 3D. The preconditioner follows from a modal decoupling
Chabory, A.; Hon, de B.P.; Schilders, W.H.A.; Tijhuis, A.G.
2008-01-01
Finite-difference techniques are very popular and versatile numerical tools in computational electromagnetics. In this paper, we propose a preconditioned finite-difference frequency-domain method (FDFD) to model periodic structures in 2D and 3D. The preconditioner follows from a modal decoupling
Zapata, M. A. Uh; Van Bang, D. Pham; Nguyen, K. D.
2016-05-01
This paper presents a parallel algorithm for the finite-volume discretisation of the Poisson equation on three-dimensional arbitrary geometries. The proposed method is formulated by using a 2D horizontal block domain decomposition and interprocessor data communication techniques with message passing interface. The horizontal unstructured-grid cells are reordered according to the neighbouring relations and decomposed into blocks using a load-balanced distribution to give all processors an equal amount of elements. In this algorithm, two parallel successive over-relaxation methods are presented: a multi-colour ordering technique for unstructured grids based on distributed memory and a block method using reordering index following similar ideas of the partitioning for structured grids. In all cases, the parallel algorithms are implemented with a combination of an acceleration iterative solver. This solver is based on a parabolic-diffusion equation introduced to obtain faster solutions of the linear systems arising from the discretisation. Numerical results are given to evaluate the performances of the methods showing speedups better than linear.
Parallel Programming with Intel Parallel Studio XE
Blair-Chappell , Stephen
2012-01-01
Optimize code for multi-core processors with Intel's Parallel Studio Parallel programming is rapidly becoming a "must-know" skill for developers. Yet, where to start? This teach-yourself tutorial is an ideal starting point for developers who already know Windows C and C++ and are eager to add parallelism to their code. With a focus on applying tools, techniques, and language extensions to implement parallelism, this essential resource teaches you how to write programs for multicore and leverage the power of multicore in your programs. Sharing hands-on case studies and real-world examples, the
Preconditioned Conjugate Gradient methods for low speed flow calculations
Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing
1993-01-01
An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations are integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and the convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the lower-upper (L-U)-successive symmetric over-relaxation iterative scheme is more efficient than a preconditioner based on incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional line Gauss-Seidel relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.
Directory of Open Access Journals (Sweden)
Maryam Banitalebi Dehkordi
2012-11-01
Full Text Available This paper presents the modelling and experimental evaluation of the gravity compensation of a horizontal 3-UPU parallel mechanism. The conventional Newton-Euler method for static analysis and balancing of mechanisms works for serial robots; however, it can become computationally expensive when applied to the analysis of parallel manipulators. To overcome this difficulty, in this paper we propose an approach, based on a Lagrangian method, that is more efficient in terms of computation time. The derivation of the gravity compensation model is based on the analytical computation of the total potential energy of the system at each position of the end-effector. In order to satisfy the gravity compensation condition, the total potential energy of the system should remain constant for all of the manipulator's configurations. Analytical and mechanical gravity compensation is taken into account, and the set of conditions and the system of springs are defined. Finally, employing a virtual reality environment, some experiments are carried out and the reliability and feasibility of the proposed model are evaluated in the presence and absence of the elastic components.
Large-Scale Parallel Finite Element Analysis of the Stress Singular Problems
International Nuclear Information System (INIS)
Noriyuki Kushida; Hiroshi Okuda; Genki Yagawa
2002-01-01
In this paper, the convergence behavior of large-scale parallel finite element method for the stress singular problems was investigated. The convergence behavior of iterative solvers depends on the efficiency of the pre-conditioners. However, efficiency of pre-conditioners may be influenced by the domain decomposition that is necessary for parallel FEM. In this study the following results were obtained: Conjugate gradient method without preconditioning and the diagonal scaling preconditioned conjugate gradient method were not influenced by the domain decomposition as expected. symmetric successive over relaxation method preconditioned conjugate gradient method converged 6% faster as maximum if the stress singular area was contained in one sub-domain. (authors)
Solving large mixed linear models using preconditioned conjugate gradient iteration.
Strandén, I; Lidauer, M
1999-12-01
Continuous evaluation of dairy cattle with a random regression test-day model requires a fast solving method and algorithm. A new computing technique feasible in Jacobi and conjugate gradient based iterative methods using iteration on data is presented. In the new computing technique, the calculations in multiplication of a vector by a matrix were recorded to three steps instead of the commonly used two steps. The three-step method was implemented in a general mixed linear model program that used preconditioned conjugate gradient iteration. Performance of this program in comparison to other general solving programs was assessed via estimation of breeding values using univariate, multivariate, and random regression test-day models. Central processing unit time per iteration with the new three-step technique was, at best, one-third that needed with the old technique. Performance was best with the test-day model, which was the largest and most complex model used. The new program did well in comparison to other general software. Programs keeping the mixed model equations in random access memory required at least 20 and 435% more time to solve the univariate and multivariate animal models, respectively. Computations of the second best iteration on data took approximately three and five times longer for the animal and test-day models, respectively, than did the new program. Good performance was due to fast computing time per iteration and quick convergence to the final solutions. Use of preconditioned conjugate gradient based methods in solving large breeding value problems is supported by our findings.
He, Zhijie; Lu, Hongyang; Yang, Xiaojiao; Zhang, Li; Wu, Yi; Niu, Wenxiu; Ding, Li; Wang, Guili; Tong, Shanbao; Jia, Jie
2018-01-01
Exercise preconditioning induces neuroprotective effects during cerebral ischemia and reperfusion, which involves the recovery of cerebral blood flow (CBF). Mechanisms underlying the neuroprotective effects of re-established CBF following ischemia and reperfusion are unclear. The present study investigated CBF in hyper-early stage of reperfusion by laser speckle contrast imaging, a full-field high-resolution optical imaging technique. Rats with or without treadmill training were subjected to middle cerebral artery occlusion followed by reperfusion. CBF in arteries, veins, and capillaries in hyper-early stage of reperfusion (1, 2, and 3 h after reperfusion) and in subacute stage (24 h after reperfusion) were measured. Neurological scoring and 2,3,5-triphenyltetrazolium chloride staining were further applied to determine the neuroprotective effects of exercise preconditioning. In hyper-early stage of reperfusion, CBF in the rats with exercise preconditioning was reduced significantly in arteries and veins, respectively, compared to rats with no exercise preconditioning. Capillary CBF remained stable in the hyper-early stage of reperfusion, though it increased significantly 24 h after reperfusion in the rats with exercise preconditioning. As a neuroprotective strategy, exercise preconditioning reduced the blood perfusion of arteries and veins in the hyper-early stage of reperfusion, which indicated intervention-induced neuroprotective hypoperfusion after reperfusion onset.
Ghosh, A
1988-08-01
Lanczos and conjugate gradient algorithms are important in computational linear algebra. In this paper, a parallel pipelined realization of these algorithms on a ring of optical linear algebra processors is described. The flow of data is designed to minimize the idle times of the optical multiprocessor and the redundancy of computations. The effects of optical round-off errors on the solutions obtained by the optical Lanczos and conjugate gradient algorithms are analyzed, and it is shown that optical preconditioning can improve the accuracy of these algorithms substantially. Algorithms for optical preconditioning and results of numerical experiments on solving linear systems of equations arising from partial differential equations are discussed. Since the Lanczos algorithm is used mostly with sparse matrices, a folded storage scheme to represent sparse matrices on spatial light modulators is also described.
Preconditions for Citizen Journalism: A Sociological Assessment
Hayley Watson
2011-01-01
The rise of the citizen journalist and increased attention to this phenomenon requires a sociological assessment that seeks to develop an understanding of how citizen journalism has emerged in contemporary society. This article makes a distinction between two different subcategories of citizen journalism, that is independent and dependent citizen journalism. The purpose of this article is to present four preconditions for citizen journalism to emerge in contemporary society: advanced technolo...
Error Estimation in Preconditioned Conjugate Gradients
Czech Academy of Sciences Publication Activity Database
Strakoš, Zdeněk; Tichý, Petr
2005-01-01
Roč. 45, - (2005), s. 789-817 ISSN 0006-3835 R&D Projects: GA AV ČR 1ET400300415; GA AV ČR KJB1030306 Institutional research plan: CEZ:AV0Z10300504 Keywords : preconditioned conjugate gradient method * error bounds * stopping criteria * evaluation of convergence * numerical stability * finite precision arithmetic * rounding errors Subject RIV: BA - General Mathematics Impact factor: 0.509, year: 2005
M-step preconditioned conjugate gradient methods
Adams, L.
1983-01-01
Preconditioned conjugate gradient methods for solving sparse symmetric and positive finite systems of linear equations are described. Necessary and sufficient conditions are given for when these preconditioners can be used and an analysis of their effectiveness is given. Efficient computer implementations of these methods are discussed and results on the CYBER 203 and the Finite Element Machine under construction at NASA Langley Research Center are included.
Hennelly, B. M.; Javidi, B.; Sheridan, J. T.
2005-09-01
A number of methods have been recently proposed in the literature for the encryption of 2-D information using linear optical systems. In particular the double random phase encoding system has received widespread attention. This system uses two Random Phase Keys (RPK) positioned in the input spatial domain and the spatial frequency domain and if these random phases are described by statistically independent white noises then the encrypted image can be shown to be a white noise. Decryption only requires knowledge of the RPK in the frequency domain. The RPK may be implemented using a Spatial Light Modulators (SLM). In this paper we propose and investigate the use of SLMs for secure optical multiplexing. We show that in this case it is possible to encrypt multiple images in parallel and multiplex them for transmission or storage. The signal energy is effectively spread in the spatial frequency domain. As expected the number of images that can be multiplexed together and recovered without loss is proportional to the ratio of the input image and the SLM resolution. Many more images may be multiplexed with some loss in recovery. Furthermore each individual encryption is more robust than traditional double random phase encoding since decryption requires knowledge of both RPK and a lowpass filter in order to despread the spectrum and decrypt the image. Numerical simulations are presented and discussed.
Event- and Time-Driven Techniques Using Parallel CPU-GPU Co-processing for Spiking Neural Networks.
Naveros, Francisco; Garrido, Jesus A; Carrillo, Richard R; Ros, Eduardo; Luque, Niceto R
2017-01-01
Modeling and simulating the neural structures which make up our central neural system is instrumental for deciphering the computational neural cues beneath. Higher levels of biological plausibility usually impose higher levels of complexity in mathematical modeling, from neural to behavioral levels. This paper focuses on overcoming the simulation problems (accuracy and performance) derived from using higher levels of mathematical complexity at a neural level. This study proposes different techniques for simulating neural models that hold incremental levels of mathematical complexity: leaky integrate-and-fire (LIF), adaptive exponential integrate-and-fire (AdEx), and Hodgkin-Huxley (HH) neural models (ranged from low to high neural complexity). The studied techniques are classified into two main families depending on how the neural-model dynamic evaluation is computed: the event-driven or the time-driven families. Whilst event-driven techniques pre-compile and store the neural dynamics within look-up tables, time-driven techniques compute the neural dynamics iteratively during the simulation time. We propose two modifications for the event-driven family: a look-up table recombination to better cope with the incremental neural complexity together with a better handling of the synchronous input activity. Regarding the time-driven family, we propose a modification in computing the neural dynamics: the bi-fixed-step integration method. This method automatically adjusts the simulation step size to better cope with the stiffness of the neural model dynamics running in CPU platforms. One version of this method is also implemented for hybrid CPU-GPU platforms. Finally, we analyze how the performance and accuracy of these modifications evolve with increasing levels of neural complexity. We also demonstrate how the proposed modifications which constitute the main contribution of this study systematically outperform the traditional event- and time-driven techniques under
Radiographers' preconditions for evidence-based radiography
International Nuclear Information System (INIS)
Ahonen, Sanna-Mari; Liikanen, Eeva
2010-01-01
Evidence-based practice (EBP) is essential in today's health care, but its establishment requires several preconditions from individuals and organizations (e.g. knowledge, understanding, attitudes, abilities, self-confidence, support, and resources). Previous studies suggest that radiographers do generate and use evidence in their work, but evidence-based radiography (EBR) is not yet used routinely as established practice, especially in terms of research utilization. This paper aims to describe radiographers' preconditions for EBR, and their participation in research activities. Main focus is on research utilization. Using an electronic questionnaire developed for this study, a survey was conducted: data collected from Finnish radiographers and radiotherapists (N = 438) were analysed both statistically and qualitatively. The final response rate was 39%. The results suggest radiographers' preconditions for EBR to consist of knowledge of research, significance of research activities, research-orientated way of working, and support. In addition, adequate resourcing is essential. Reading scientific journals, participation in research activities, a higher degree of education, and senior post seem to be significant promoters of EBR and research utilization. The results support the notion that EBR, and especially research utilization, are not yet well-established in Finland, and radiographers' viewpoints concerning the role and significance of research evidence and research activities still seem to vary.
International Nuclear Information System (INIS)
Mao, Xiaoan; Jaworski, Artur J
2010-01-01
This paper describes the development of the experimental setup and measurement methodologies to study the physics of oscillatory flows in the vicinity of parallel-plate stacks by using the particle image velocimetry (PIV) techniques. Parallel-plate configurations often appear as internal structures in thermoacoustic devices and are responsible for the hydrodynamic energy transfer processes. The flow around selected stack configurations is induced by a standing acoustic wave, whose amplitude can be varied. Depending on the direction of the flow within the acoustic cycle, relative to the stack, it can be treated as an entrance flow or a wake flow. The insight into the flow behaviour, its kinematics, dynamics and scales of turbulence, is obtained using the classical Reynolds decomposition to separate the instantaneous velocity fields into ensemble-averaged mean velocity fields and fluctuations in a set of predetermined phases within an oscillation cycle. The mean velocity field and the fluctuation intensity distributions are investigated over the acoustic oscillation cycle. The velocity fluctuation is further divided into large- and small-scale fluctuations by using fast Fourier transform (FFT) spatial filtering techniques
Caspar, Thibault; Schultz, Anthony; Schaeffer, Mickaël; Labani, Aïssam; Jeung, Mi-Young; Jurgens, Paul Thomas; El Ghannudi, Soraya; Roy, Catherine; Ohana, Mickaël
To compare cine MR b-TFE sequences acquired before and after gadolinium injection, on a 3T scanner with a parallel RF transmission technique in order to potentially improve scanning time efficiency when evaluating LV function. 25 consecutive patients scheduled for a cardiac MRI were prospectively included and had their b-TFE cine sequences acquired before and right after gadobutrol injection. Images were assessed qualitatively (overall image quality, LV edge sharpness, artifacts and LV wall motion) and quantitatively with measurement of LVEF, LV mass, and telediastolic volume and contrast-to-noise ratio (CNR) between the myocardium and the cardiac chamber. Statistical analysis was conducted using a Bayesian paradigm. No difference was found before or after injection for the LVEF, LV mass and telediastolic volume evaluations. Overall image quality and CNR were significantly lower after injection (estimated coefficient cine after > cine before gadolinium: -1.75 CI = [-3.78;-0.0305], prob(coef>0) = 0% and -0.23 CI = [-0.49;0.04], prob(coef>0) = 4%) respectively), but this decrease did not affect the visual assessment of LV wall motion (cine after > cine before gadolinium: -1.46 CI = [-4.72;1.13], prob(coef>0) = 15%). In 3T cardiac MRI acquired with parallel RF transmission technique, qualitative and quantitative assessment of LV function can reliably be performed with cine sequences acquired after gadolinium injection, despite a significant decrease in the CNR and the overall image quality.
International Nuclear Information System (INIS)
Shibasaki, Toshiro; Seno Masafumi; Takoi, Kunihiro; Sato, Hirofumi; Hino, Tsuyoshi
2003-01-01
In this study of 3D contrast enhanced MR angiography of the renal artery using the array spatial sensitivity encoding technique (ASSET), the acquisition time per 1 phase shortened fairly. And using the technique of spectral inversion at lipids (SPECIAL) together with ASSET, the quality of image was improved by emphasizing the contrast. The timing of acquisition was determined by the test injection. We started acquiring the MR angiography 2 seconds after the arrival of maximum enhancement of the test injection at the upper abdominal aorta near the renal artery. As a result parenchymal enhancement was not visible and depiction of the segmental artery was possible in 14 (82%) of 17 patients. At the present time we consider it better not to use the Fractional number of excitation (NEX) together with ASSET, as it may cause various artifacts. (author)
Energy Technology Data Exchange (ETDEWEB)
Dobritz, M.; Radkow, T.; Bautz, W.; Fellner, F.A. [Inst. fuer Diagnostische Radiologie, Friedrich-Alexander-Univ. Erlangen-Nuernberg (Germany); Nittka, M. [Siemens Medical Solutions, Erlangen (Germany)
2002-06-01
Purpose: The VIBE (volume interpolated breath-hold examination) sequence in combination with parallel acquisition technique (iPAT: integrated parallel acquisition technique) allows dynamic contrast-enhanced MRI of the liver with high temporal and spatial resolution. The aim of this study was to obtain first clinical experience with this technique for the detection and characterization of focal liver lesions. Materials and Methods: We examined 10 consecutive patients using a 1.5 T MR system (gradient field strength 30 mT/m) with a phased-array coil combination. Following sequences- were acquired: T{sub 2}-w TSE and T{sub 1}-w FLASH, after administration of gadolinium, 6 VIBE sequences with iPAT (TR/TE/matrix/partition thickness/time of acquisition: 6.2 ms/ 3.2 ms/256 x 192/4 mm/13 s), as well as T{sub 1}-weighted FLASH with fat saturation. Two observers evaluated the different sequences concerning the number of lesions and their dignity. Following lesions were found: hepatocellular carcinoma (5 patients), hemangioma (2), metastasis (1), cyst (1), adenoma (1). Results: The VIBE sequences were superior for the detection of lesions with arterial hyperperfusion with a total of 33 focal lesions. 21 lesions were found with T{sub 2}-w TSE and 20 with plain T{sub 1}-weighted FLASH. Diagnostic accuracy increased with the VIBE sequence in comparison to the other sequences. Conclusion: VIBE with iPAT allows MR imaging of the liver with high spatial and temporal resolution providing dynamic contrast-enhanced information about the whole liver. This may lead to improved detection of liver lesions, especially hepatocellular carcinoma. (orig.) [German] Ziel: Die VIBE-Sequenz (Volume Interpolated Breath-hold Examination) in Kombination mit paralleler Bildgebung (iPAT) ermoeglicht eine dynamische kontrastmittel-gestuetzte Untersuchung der Leber in hoher zeitlicher und oertlicher Aufloesung. Ziel war es, erste klinische Erfahrungen mit dieser Technik in der Detektion fokaler
Barth, Timothy J.; Chan, Tony F.; Tang, Wei-Pai
1998-01-01
This paper considers an algebraic preconditioning algorithm for hyperbolic-elliptic fluid flow problems. The algorithm is based on a parallel non-overlapping Schur complement domain-decomposition technique for triangulated domains. In the Schur complement technique, the triangulation is first partitioned into a number of non-overlapping subdomains and interfaces. This suggests a reordering of triangulation vertices which separates subdomain and interface solution unknowns. The reordering induces a natural 2 x 2 block partitioning of the discretization matrix. Exact LU factorization of this block system yields a Schur complement matrix which couples subdomains and the interface together. The remaining sections of this paper present a family of approximate techniques for both constructing and applying the Schur complement as a domain-decomposition preconditioner. The approximate Schur complement serves as an algebraic coarse space operator, thus avoiding the known difficulties associated with the direct formation of a coarse space discretization. In developing Schur complement approximations, particular attention has been given to improving sequential and parallel efficiency of implementations without significantly degrading the quality of the preconditioner. A computer code based on these developments has been tested on the IBM SP2 using MPI message passing protocol. A number of 2-D calculations are presented for both scalar advection-diffusion equations as well as the Euler equations governing compressible fluid flow to demonstrate performance of the preconditioning algorithm.
Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging
Desmal, Abdulla; Bagci, Hakan
2014-01-01
Newton-type algorithms have been extensively studied in nonlinear microwave imaging due to their quadratic convergence rate and ability to recover images with high contrast values. In the past, Newton methods have been implemented in conjunction with smoothness promoting optimization/regularization schemes. However, this type of regularization schemes are known to perform poorly when applied in imagining domains with sparse content or sharp variations. In this work, an inexact Newton algorithm is formulated and implemented in conjunction with a linear sparse optimization scheme. A novel preconditioning technique is proposed to increase the convergence rate of the optimization problem. Numerical results demonstrate that the proposed framework produces sharper and more accurate images when applied in sparse/sparsified domains.
Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging
Desmal, Abdulla
2014-05-04
Newton-type algorithms have been extensively studied in nonlinear microwave imaging due to their quadratic convergence rate and ability to recover images with high contrast values. In the past, Newton methods have been implemented in conjunction with smoothness promoting optimization/regularization schemes. However, this type of regularization schemes are known to perform poorly when applied in imagining domains with sparse content or sharp variations. In this work, an inexact Newton algorithm is formulated and implemented in conjunction with a linear sparse optimization scheme. A novel preconditioning technique is proposed to increase the convergence rate of the optimization problem. Numerical results demonstrate that the proposed framework produces sharper and more accurate images when applied in sparse/sparsified domains.
Preconditioned Inexact Newton for Nonlinear Sparse Electromagnetic Imaging
Desmal, Abdulla
2014-01-06
Newton-type algorithms have been extensively studied in nonlinear microwave imaging due to their quadratic convergence rate and ability to recover images with high contrast values. In the past, Newton methods have been implemented in conjunction with smoothness promoting optimization/regularization schemes. However, this type of regularization schemes are known to perform poorly when applied in imagining domains with sparse content or sharp variations. In this work, an inexact Newton algorithm is formulated and implemented in conjunction with a linear sparse optimization scheme. A novel preconditioning technique is proposed to increase the convergence rate of the optimization problem. Numerical results demonstrate that the proposed framework produces sharper and more accurate images when applied in sparse/sparsified domains.
International Nuclear Information System (INIS)
Brown, P.; Chang, B.
1998-01-01
The linear Boltzmann transport equation (BTE) is an integro-differential equation arising in deterministic models of neutral and charged particle transport. In slab (one-dimensional Cartesian) geometry and certain higher-dimensional cases, Diffusion Synthetic Acceleration (DSA) is known to be an effective algorithm for the iterative solution of the discretized BTE. Fourier and asymptotic analyses have been applied to various idealizations (e.g., problems on infinite domains with constant coefficients) to obtain sharp bounds on the convergence rate of DSA in such cases. While DSA has been shown to be a highly effective acceleration (or preconditioning) technique in one-dimensional problems, it has been observed to be less effective in higher dimensions. This is due in part to the expense of solving the related diffusion linear system. We investigate here the effectiveness of a parallel semicoarsening multigrid (SMG) solution approach to DSA preconditioning in several three dimensional problems. In particular, we consider the algorithmic and implementation scalability of a parallel SMG-DSA preconditioner on several types of test problems
Ischemic preconditioning protects against gap junctional uncoupling in cardiac myofibroblasts.
Sundset, Rune; Cooper, Marie; Mikalsen, Svein-Ole; Ytrehus, Kirsti
2004-01-01
Ischemic preconditioning increases the heart's tolerance to a subsequent longer ischemic period. The purpose of this study was to investigate the role of gap junction communication in simulated preconditioning in cultured neonatal rat cardiac myofibroblasts. Gap junctional intercellular communication was assessed by Lucifer yellow dye transfer. Preconditioning preserved intercellular coupling after prolonged ischemia. An initial reduction in coupling in response to the preconditioning stimulus was also observed. This may protect neighboring cells from damaging substances produced during subsequent regional ischemia in vivo, and may preserve gap junctional communication required for enhanced functional recovery during subsequent reperfusion.
van Caster, Patrick; Eiling, Sandra; Boekholt, Yvonne; Behmenburg, Friederike; Dorsch, Marianne; Heinen, André; Hollmann, Markus W.; Huhn, Ragnar
2018-01-01
Prior studies have suggested that the antifibrinolytic drug aprotinin increases the infarct size after ischemia and reperfusion (I/R) and attenuates the effect of ischemic preconditioning (IPC). Aprotinin was replaced by tranexamic acid (TXA) in clinical practice. Here, we investigated whether TXA
GPU Parallel Bundle Block Adjustment
Directory of Open Access Journals (Sweden)
ZHENG Maoteng
2017-09-01
Full Text Available To deal with massive data in photogrammetry, we introduce the GPU parallel computing technology. The preconditioned conjugate gradient and inexact Newton method are also applied to decrease the iteration times while solving the normal equation. A brand new workflow of bundle adjustment is developed to utilize GPU parallel computing technology. Our method can avoid the storage and inversion of the big normal matrix, and compute the normal matrix in real time. The proposed method can not only largely decrease the memory requirement of normal matrix, but also largely improve the efficiency of bundle adjustment. It also achieves the same accuracy as the conventional method. Preliminary experiment results show that the bundle adjustment of a dataset with about 4500 images and 9 million image points can be done in only 1.5 minutes while achieving sub-pixel accuracy.
Energy Technology Data Exchange (ETDEWEB)
Gates, I.D. [Gushor Inc., Calgary, AB (Canada)]|[Calgary Univ., AB (Canada). Dept. of Chemical and Petroleum Engineering; Larter, S.R.; Adams, J.J.; Snowdon, L.; Jiang, C. [Gushor Inc., Calgary, AB (Canada)]|[Calgary Univ., Calgary, AB (Canada). Dept. of Geoscience
2008-10-15
This study investigated preconditioning techniques for altering reservoir fluid properties prior to steam assisted gravity drainage (SAGD) recovery processes. Viscosity-reducing agents were distributed in mobile reservoir water. Simulations were conducted to demonstrate the method's ability to modify oil viscosity prior to steam injection. The study simulated the action of water soluble organic solvents that preferentially partitioned in the oil phase. The solvent was injected with water into the reservoir in a slow waterflood that did not displace oil from the near wellbore region. A reservoir simulation model was used to investigate the technique. Shu's correlation was used to establish a viscosity correlation for the bitumen and solvent mixtures. Solvent injection was modelled by converting the oil phase viscosity through time. Over the first 2 years, oil rates of the preconditioned case were double that of the non-preconditioned case study. However, after 11 years, the preconditioned case's rates declined below rates observed in the non-preconditioned case. The model demonstrated that oil viscosity distributions were significantly altered using the preconditioners. The majority of the most viscous oil surrounding the production well was significantly reduced. It was concluded that accelerated steam chamber growth provided faster access to lower viscosity materials at the top of the reservoir. 12 refs., 9 figs.
International Nuclear Information System (INIS)
Schultz, Anthony; Caspar, Thibault; Schaeffer, Mickael; Labani, Aissam; Jeung, Mi-Young; El Ghannudi, Soraya; Roy, Catherine; Ohana, Mickael
2016-01-01
To qualitatively and quantitatively compare different late gadolinium enhancement (LGE) sequences acquired at 3T with a parallel RF transmission technique. One hundred and sixty participants prospectively enrolled underwent a 3T cardiac MRI with 3 different LGE sequences: 3D Phase-Sensitive Inversion-Recovery (3D-PSIR) acquired 5 minutes after injection, 3D Inversion-Recovery (3D-IR) at 9 minutes and 3D-PSIR at 13 minutes. All LGE-positive patients were qualitatively evaluated both independently and blindly by two radiologists using a 4-level scale, and quantitatively assessed with measurement of contrast-to-noise ratio and LGE maximal surface. Statistical analyses were calculated under a Bayesian paradigm using MCMC methods. Fifty patients (70 % men, 56yo ± 19) exhibited LGE (62 % were post-ischemic, 30 % related to cardiomyopathy and 8 % post-myocarditis). Early and late 3D-PSIR were superior to 3D-IR sequences (global quality, estimated coefficient IR > early-PSIR: -2.37 CI = [-3.46; -1.38], prob(coef > 0) = 0 % and late-PSIR > IR: 3.12 CI = [0.62; 4.41], prob(coef > 0) = 100 %), LGE surface estimated coefficient IR > early-PSIR: -0.09 CI = [-1.11; -0.74], prob(coef > 0) = 0 % and late-PSIR > IR: 0.96 CI = [0.77; 1.15], prob(coef > 0) = 100 %. Probabilities for late PSIR being superior to early PSIR concerning global quality and CNR were over 90 %, regardless of the aetiological subgroup. In 3T cardiac MRI acquired with parallel RF transmission technique, 3D-PSIR is qualitatively and quantitatively superior to 3D-IR. (orig.)
A Parallel Solver for Large-Scale Markov Chains
Czech Academy of Sciences Publication Activity Database
Benzi, M.; Tůma, Miroslav
2002-01-01
Roč. 41, - (2002), s. 135-153 ISSN 0168-9274 R&D Projects: GA AV ČR IAA2030801; GA ČR GA101/00/1035 Keywords : parallel preconditioning * iterative methods * discrete Markov chains * generalized inverses * singular matrices * graph partitioning * AINV * Bi-CGSTAB Subject RIV: BA - General Mathematics Impact factor: 0.504, year: 2002
Preconditioning, postconditioning and their application to clinical cardiology.
Kloner, Robert A; Rezkalla, Shereif H
2006-05-01
Ischemic preconditioning is a well-established phenomenon first described in experimental preparations in which brief episodes of ischemia/reperfusion applied prior to a longer coronary artery occlusion reduce myocardial infarct size. There are ample correlates of ischemic preconditioning in the clinical realm. Preconditioning mimetic agents that stimulate the biochemical pathways of ischemic preconditioning and protect the heart without inducing ischemia have been examined in numerous experimental studies. However, despite the effectiveness of ischemic preconditioning and preconditioning mimetics for protecting ischemic myocardium, there are no preconditioning-based therapies that are routinely used in clinical medicine at the current time. Part of the problem is the need to administer therapy prior to the known ischemic event. Other issues are that percutaneous coronary intervention technology has advanced so far (with the development of stents and drug-eluting stents) that ischemic preconditioning or preconditioning mimetics have not been needed in most interventional cases. Recent clinical trials such as AMISTAD I and II (Acute Myocardial Infarction STudy of ADenosine) suggest that some preconditioning mimetics may reduce myocardial infarct size when given along with reperfusion or, as in the IONA trial, have benefit on clinical events when administered chronically in patients with known coronary artery disease. It is possible that some of the benefit described for adenosine in the AMISTAD 1 and 2 trials represents a manifestation of the recently described postconditioning phenomenon. It is probable that postconditioning--in which reperfusion is interrupted with brief coronary occlusions and reperfusion sequences--is more likely than preconditioning to be feasible as a clinical application to patients undergoing percutaneous coronary intervention for acute myocardial infarction.
Kraus, Natascha; Haas, Norbert P; Scheibel, Markus; Gerhardt, Christian
2013-10-01
The arthroscopically assisted Double-TightRope technique has recently been reported to yield good to excellent clinical results in the treatment of acute, high-grade acromioclavicular dislocation. However, the orientation of the transclavicular-transcoracoidal drill holes remains a matter of debate. A V-shaped drill hole orientation leads to better clinical and radiologic results and provides a higher vertical and horizontal stability compared to parallel drill hole placement. This was a cohort study; level of evidence, 2b. Two groups of patients with acute high-grade acromioclavicular joint instability (Rockwood type V) were included in this prospective, non-randomized cohort study. 15 patients (1 female/14 male) with a mean age of 37.7 (18-66) years were treated with a Double-TightRope technique using a V-shaped orientation of the drill holes (group 1). 13 patients (1 female/12 male) with a mean age of 40.9 (21-59) years were treated with a Double-TightRope technique with a parallel drill hole placement (group 2). After 2 years, the final evaluation consisted of a complete physical examination of both shoulders, evaluation of the Subjective Shoulder Value (SSV), Constant Score (CS), Taft Score (TF) and Acromioclavicular Joint Instability Score (ACJI) as well as a radiologic examination including bilateral anteroposterior stress views and bilateral Alexander views. After a mean follow-up of 2 years, all patients were free of shoulder pain at rest and during daily activities. Range of motion did not differ significantly between both groups (p > 0.05). Patients in group 1 reached on average 92.4 points in the CS, 96.2 % in the SSV, 10.5 points in the TF and 75.9 points in the ACJI. Patients in group 2 scored 90.5 points in the CS, 93.9 % in the SSV, 10.5 points in the TF and 84.5 points in the ACJI (p > 0.05). Radiographically, the coracoclavicular distance was found to be 13.9 mm (group 1) and 13.4 mm (group 2) on the affected side and 9.3 mm (group 1
Field-Split Preconditioned Inexact Newton Algorithms
Liu, Lulu
2015-06-02
The multiplicative Schwarz preconditioned inexact Newton (MSPIN) algorithm is presented as a complement to additive Schwarz preconditioned inexact Newton (ASPIN). At an algebraic level, ASPIN and MSPIN are variants of the same strategy to improve the convergence of systems with unbalanced nonlinearities; however, they have natural complementarity in practice. MSPIN is naturally based on partitioning of degrees of freedom in a nonlinear PDE system by field type rather than by subdomain, where a modest factor of concurrency can be sacrificed for physically motivated convergence robustness. ASPIN, originally introduced for decompositions into subdomains, is natural for high concurrency and reduction of global synchronization. We consider both types of inexact Newton algorithms in the field-split context, and we augment the classical convergence theory of ASPIN for the multiplicative case. Numerical experiments show that MSPIN can be significantly more robust than Newton methods based on global linearizations, and that MSPIN can be more robust than ASPIN and maintain fast convergence even for challenging problems, such as high Reynolds number Navier--Stokes equations.
Field-Split Preconditioned Inexact Newton Algorithms
Liu, Lulu; Keyes, David E.
2015-01-01
The multiplicative Schwarz preconditioned inexact Newton (MSPIN) algorithm is presented as a complement to additive Schwarz preconditioned inexact Newton (ASPIN). At an algebraic level, ASPIN and MSPIN are variants of the same strategy to improve the convergence of systems with unbalanced nonlinearities; however, they have natural complementarity in practice. MSPIN is naturally based on partitioning of degrees of freedom in a nonlinear PDE system by field type rather than by subdomain, where a modest factor of concurrency can be sacrificed for physically motivated convergence robustness. ASPIN, originally introduced for decompositions into subdomains, is natural for high concurrency and reduction of global synchronization. We consider both types of inexact Newton algorithms in the field-split context, and we augment the classical convergence theory of ASPIN for the multiplicative case. Numerical experiments show that MSPIN can be significantly more robust than Newton methods based on global linearizations, and that MSPIN can be more robust than ASPIN and maintain fast convergence even for challenging problems, such as high Reynolds number Navier--Stokes equations.
Crockett, Thomas W.
1995-01-01
This article provides a broad introduction to the subject of parallel rendering, encompassing both hardware and software systems. The focus is on the underlying concepts and the issues which arise in the design of parallel rendering algorithms and systems. We examine the different types of parallelism and how they can be applied in rendering applications. Concepts from parallel computing, such as data decomposition, task granularity, scalability, and load balancing, are considered in relation to the rendering problem. We also explore concepts from computer graphics, such as coherence and projection, which have a significant impact on the structure of parallel rendering algorithms. Our survey covers a number of practical considerations as well, including the choice of architectural platform, communication and memory requirements, and the problem of image assembly and display. We illustrate the discussion with numerous examples from the parallel rendering literature, representing most of the principal rendering methods currently used in computer graphics.
Ren, Chuancheng; Gao, Xuwen; Steinberg, Gary K.; Zhao, Heng
2009-01-01
Remote ischemic preconditioning is an emerging concept for stroke treatment, but its protection against focal stroke has not been established. We tested whether remote preconditioning, performed in the ipsilateral hind limb, protects against focal stroke and explored its protective parameters. Stroke was generated by a permanent occlusion of the left distal middle cerebral artery (MCA) combined with a 30 minute occlusion of the bilateral common carotid arteries (CCA) in male rats. Limb preconditioning was generated by 5 or 15 minute occlusion followed with the same period of reperfusion of the left hind femoral artery, and repeated for 2 or 3 cycles. Infarct was measured 2 days later. The results showed that rapid preconditioning with 3 cycles of 15 minutes performed immediately before stroke reduced infarct size from 47.7±7.6% of control ischemia to 9.8±8.6%; at 2 cycles of 15 minutes, infarct was reduced to 24.7±7.3%; at 2 cycles of 5 minutes, infarct was not reduced. Delayed preconditioning with 3 cycles of 15 minutes conducted 2 days before stroke also reduced infarct to 23.0 ±10.9%, but with 2 cycles of 15 minutes it offered no protection. The protective effects at these two therapeutic time windows of remote preconditioning are consistent with those of conventional preconditioning, in which the preconditioning ischemia is induced in the brain itself. Unexpectedly, intermediate preconditioning with 3 cycles of 15 minutes performed 12 hours before stroke also reduced infarct to 24.7±4.7%, which contradicts the current dogma for therapeutic time windows for the conventional preconditioning that has no protection at this time point. In conclusion, remote preconditioning performed in one limb protected against ischemic damage after focal cerebral ischemia. PMID:18201834
40 CFR 86.532-78 - Vehicle preconditioning.
2010-07-01
... 40 Protection of Environment 18 2010-07-01 2010-07-01 false Vehicle preconditioning. 86.532-78... (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission Regulations for 1978 and Later New Motorcycles; Test Procedures § 86.532-78 Vehicle preconditioning. (a) The vehicle...
Helium induces preconditioning in human endothelium in vivo
Smit, Kirsten F.; Oei, Gezina T. M. L.; Brevoord, Daniel; Stroes, Erik S.; Nieuwland, Rienk; Schlack, Wolfgang S.; Hollmann, Markus W.; Weber, Nina C.; Preckel, Benedikt
2013-01-01
Helium protects myocardium by inducing preconditioning in animals. We investigated whether human endothelium is preconditioned by helium inhalation in vivo. Forearm ischemia-reperfusion (I/R) in healthy volunteers (each group n = 10) was performed by inflating a blood pressure cuff for 20 min.
AZTEC: A parallel iterative package for the solving linear systems
Energy Technology Data Exchange (ETDEWEB)
Hutchinson, S.A.; Shadid, J.N.; Tuminaro, R.S. [Sandia National Labs., Albuquerque, NM (United States)
1996-12-31
We describe a parallel linear system package, AZTEC. The package incorporates a number of parallel iterative methods (e.g. GMRES, biCGSTAB, CGS, TFQMR) and preconditioners (e.g. Jacobi, Gauss-Seidel, polynomial, domain decomposition with LU or ILU within subdomains). Additionally, AZTEC allows for the reuse of previous preconditioning factorizations within Newton schemes for nonlinear methods. Currently, a number of different users are using this package to solve a variety of PDE applications.
1982-01-01
Parallel Computations focuses on parallel computation, with emphasis on algorithms used in a variety of numerical and physical applications and for many different types of parallel computers. Topics covered range from vectorization of fast Fourier transforms (FFTs) and of the incomplete Cholesky conjugate gradient (ICCG) algorithm on the Cray-1 to calculation of table lookups and piecewise functions. Single tridiagonal linear systems and vectorized computation of reactive flow are also discussed.Comprised of 13 chapters, this volume begins by classifying parallel computers and describing techn
Choudhary, Alok Nidhi; Leung, Mun K.; Huang, Thomas S.; Patel, Janak H.
1989-01-01
Computer vision systems employ a sequence of vision algorithms in which the output of an algorithm is the input of the next algorithm in the sequence. Algorithms that constitute such systems exhibit vastly different computational characteristics, and therefore, require different data decomposition techniques and efficient load balancing techniques for parallel implementation. However, since the input data for a task is produced as the output data of the previous task, this information can be exploited to perform knowledge based data decomposition and load balancing. Presented here are algorithms for a motion estimation system. The motion estimation is based on the point correspondence between the involved images which are a sequence of stereo image pairs. Researchers propose algorithms to obtain point correspondences by matching feature points among stereo image pairs at any two consecutive time instants. Furthermore, the proposed algorithms employ non-iterative procedures, which results in saving considerable amounts of computation time. The system consists of the following steps: (1) extraction of features; (2) stereo match of images in one time instant; (3) time match of images from consecutive time instants; (4) stereo match to compute final unambiguous points; and (5) computation of motion parameters.
Weston, Brian; Nourgaliev, Robert; Delplanque, Jean-Pierre
2017-11-01
We present a new block-based Schur complement preconditioner for simulating all-speed compressible flow with phase change. The conservation equations are discretized with a reconstructed Discontinuous Galerkin method and integrated in time with fully implicit time discretization schemes. The resulting set of non-linear equations is converged using a robust Newton-Krylov framework. Due to the stiffness of the underlying physics associated with stiff acoustic waves and viscous material strength effects, we solve for the primitive-variables (pressure, velocity, and temperature). To enable convergence of the highly ill-conditioned linearized systems, we develop a physics-based preconditioner, utilizing approximate block factorization techniques to reduce the fully-coupled 3×3 system to a pair of reduced 2×2 systems. We demonstrate that our preconditioned Newton-Krylov framework converges on very stiff multi-physics problems, corresponding to large CFL and Fourier numbers, with excellent algorithmic and parallel scalability. Results are shown for the classic lid-driven cavity flow problem as well as for 3D laser-induced phase change. This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344.
Massively parallel mathematical sieves
Energy Technology Data Exchange (ETDEWEB)
Montry, G.R.
1989-01-01
The Sieve of Eratosthenes is a well-known algorithm for finding all prime numbers in a given subset of integers. A parallel version of the Sieve is described that produces computational speedups over 800 on a hypercube with 1,024 processing elements for problems of fixed size. Computational speedups as high as 980 are achieved when the problem size per processor is fixed. The method of parallelization generalizes to other sieves and will be efficient on any ensemble architecture. We investigate two highly parallel sieves using scattered decomposition and compare their performance on a hypercube multiprocessor. A comparison of different parallelization techniques for the sieve illustrates the trade-offs necessary in the design and implementation of massively parallel algorithms for large ensemble computers.
International Nuclear Information System (INIS)
McGhee, J.M.; Roberts, R.M.; Morel, J.E.
1997-01-01
A spherical harmonics research code (DANTE) has been developed which is compatible with parallel computer architectures. DANTE provides 3-D, multi-material, deterministic, transport capabilities using an arbitrary finite element mesh. The linearized Boltzmann transport equation is solved in a second order self-adjoint form utilizing a Galerkin finite element spatial differencing scheme. The core solver utilizes a preconditioned conjugate gradient algorithm. Other distinguishing features of the code include options for discrete-ordinates and simplified spherical harmonics angular differencing, an exact Marshak boundary treatment for arbitrarily oriented boundary faces, in-line matrix construction techniques to minimize memory consumption, and an effective diffusion based preconditioner for scattering dominated problems. Algorithm efficiency is demonstrated for a massively parallel SIMD architecture (CM-5), and compatibility with MPP multiprocessor platforms or workstation clusters is anticipated
Anesthetic Preconditioning as Endogenous Neuroprotection in Glaucoma
Directory of Open Access Journals (Sweden)
Tsung-Han Chou
2018-01-01
Full Text Available Blindness in glaucoma is the result of death of Retinal Ganglion Cells (RGCs and their axons. RGC death is generally preceded by a stage of reversible dysfunction and structural remodeling. Current treatments aimed at reducing intraocular pressure (IOP are ineffective or incompletely effective in management of the disease. IOP-independent neuroprotection or neuroprotection as adjuvant to IOP lowering in glaucoma remains a challenge as effective agents without side effects have not been identified yet. We show in DBA/2J mice with spontaneous IOP elevation and glaucoma that the lifespan of functional RGCs can be extended by preconditioning RGCs with retrobulbar lidocaine in one eye at four months of age that temporary blocks RGC axonal transport. The contralateral, PBS-injected eye served as control. Lidocaine-induced impairment of axonal transport to superior colliculi was assessed by intravitreal injection of cholera toxin B. Long-term (nine months effect of lidocaine were assessed on RGC electrical responsiveness (PERG, IOP, expression of relevant protein (BDNF, TrkB, PSD95, GFAP, Synaptophysin, and GAPDH and RGC density. While lidocaine treatment did not alter the age-related increase of IOP, TrkB expression was elevated, GFAP expression was decreased, RGC survival was improved by 35%, and PERG function was preserved. Results suggest that the lifespan of functional RGCs in mouse glaucoma can be extended by preconditioning RGCs in early stages of the disease using a minimally invasive treatment with retrobulbar lidocaine, a common ophthalmologic procedure. Lidocaine is inexpensive, safe and is approved by Food and Drug Administration (FDA to be administered intravenously.
The Conceptual Preconditions of Studying Collective Professional Mobility of Management Personnel
Directory of Open Access Journals (Sweden)
Doronin Andrii V.
2016-08-01
Full Text Available The preconditions and problems of developing the concept of the study and transformation of collective professional mobility of management personnel are generalized. The necessity of specifying the content and structure of the scientific and methodological concept of «paradigm» is justified. The possibility of using philosophy and economic theory to determine the initial ideas on the development of technique for studying collective professional mobility of management personnel are analyzed; contradictions, which resolution would create a constructive theoretical basis of such a study are revealed. The need to focus on the interdisciplinary approach in the development of the conceptual preconditions of studying collective professional mobility is substantiated. The versions of the world view allowing to ensure productive discussions of representatives of various scientific disciplines at the phenomenological stage of building a new paradigm are developed.
Casanova, Henri; Robert, Yves
2008-01-01
""…The authors of the present book, who have extensive credentials in both research and instruction in the area of parallelism, present a sound, principled treatment of parallel algorithms. … This book is very well written and extremely well designed from an instructional point of view. … The authors have created an instructive and fascinating text. The book will serve researchers as well as instructors who need a solid, readable text for a course on parallelism in computing. Indeed, for anyone who wants an understandable text from which to acquire a current, rigorous, and broad vi
Psychological preconditions of game activity development in the early childhood
Valeriya Spitsyna; Ekaterina Saraykina
2013-01-01
The article is devoted for detection the psychological preconditions of game activity development at early age and interrelation of game formation with the development of subject actions, informative activity and procedural game.
Association of Exercise Preconditioning With Immediate Cardioprotection: A Review.
Thijssen, D.H.J.; Redington, A.; George, K.P.; Hopman, M.T.E.; Jones, H.
2018-01-01
Importance: Exercise reduces the risk of cardiovascular events, including through an underrecognized, clinically useful form of acute cardioprotection accessible after a single episode of exercise, which is called cardiovascular preconditioning. Observations: Preclinical evidence shows that 1 to 3
McArdle, F; Spiers, S; Aldemir, H; Vasilaki, A; Beaver, A; Iwanejko, L; McArdle, A; Jackson, M J
2004-11-15
Adaptations of skeletal muscle following exercise are accompanied by changes in gene expression, which can result in protection against subsequent potentially damaging exercise. One cellular signal activating these adaptations may be an increased production of reactive oxygen and nitrogen species (ROS). The aim of this study was to examine the effect of a short period of non-damaging contractions on the subsequent susceptibility of muscle to contraction-induced damage and to examine the changes in gene expression that occur following the initial contraction protocol. Comparisons with changes in gene expression in cultured myotubes following treatment with a non-damaging concentration of hydrogen peroxide (H(2)O(2)) were used to identify redox-sensitive genes whose expression may be modified by the increased ROS production during contractions. Hindlimb muscles of mice were subjected to a preconditioning, non-damaging isometric contraction protocol in vivo. After 4 or 12 h, extensor digitorum longus (EDL) and soleus muscles were removed and subjected to a (normally) damaging contraction protocol in vitro. Muscles were also analysed for changes in gene expression induced by the preconditioning protocol using cDNA expression techniques. In a parallel study, C(2)C(12) myotubes were treated with a non-damaging concentration (100 microM) of H(2)O(2) and, at 4 and 12 h following treatment, myotubes were treated with a damaging concentration of H(2)O(2) (2 mM). Myotubes were analysed for changes in gene expression at 4 h following treatment with 100 microM H(2)O(2) alone. Data demonstrate that a prior period of non-damaging contractile activity resulted in significant protection of EDL and soleus muscles against a normally damaging contraction protocol 4 h later. This protection was associated with significant changes in gene expression. Prior treatment of myotubes with a non-damaging concentration of H(2)O(2) also resulted in significant protection against a damaging
Nonlinear Multiplicative Schwarz Preconditioning in Natural Convection Cavity Flow
Liu, Lulu; Zhang, Wei; Keyes, David E.
2017-01-01
A natural convection cavity flow problem is solved using nonlinear multiplicative Schwarz preconditioners, as a Gauss-Seidel-like variant of additive Schwarz preconditioned inexact Newton (ASPIN). The nonlinear preconditioning extends the domain of convergence of Newton’s method to high Rayleigh numbers. Convergence performance varies widely with respect to different groupings of the fields of this multicomponent problem, and with respect to different orderings of the groupings.
Decentralisation in developing countries: preconditions for successful implementation
Directory of Open Access Journals (Sweden)
Yasin Olum
2014-07-01
Full Text Available Decentralisation has been implemented and is being implemented in many developing countries without much success. Although several unique factors inhibit the implementation of decentralisation in individual countries, the paper argues that there are six pre-conditions that these countries should fulfill before decentralisation can be successfully implemented. These preconditions are: institutional mechanisms; creation of spaces for participation; political will and civil will; capacity development at the local level; careful implementation; and democratic governance.
Nonlinear Multiplicative Schwarz Preconditioning in Natural Convection Cavity Flow
Liu, Lulu
2017-03-17
A natural convection cavity flow problem is solved using nonlinear multiplicative Schwarz preconditioners, as a Gauss-Seidel-like variant of additive Schwarz preconditioned inexact Newton (ASPIN). The nonlinear preconditioning extends the domain of convergence of Newton’s method to high Rayleigh numbers. Convergence performance varies widely with respect to different groupings of the fields of this multicomponent problem, and with respect to different orderings of the groupings.
Filli, Lukas; Piccirelli, Marco; Kenkel, David; Guggenberger, Roman; Andreisek, Gustav; Beck, Thomas; Runge, Val M; Boss, Andreas
2015-07-01
The aim of this study was to investigate the feasibility of accelerated diffusion tensor imaging (DTI) of skeletal muscle using echo planar imaging (EPI) applying simultaneous multislice excitation with a blipped controlled aliasing in parallel imaging results in higher acceleration unaliasing technique. After federal ethics board approval, the lower leg muscles of 8 healthy volunteers (mean [SD] age, 29.4 [2.9] years) were examined in a clinical 3-T magnetic resonance scanner using a 15-channel knee coil. The EPI was performed at a b value of 500 s/mm2 without slice acceleration (conventional DTI) as well as with 2-fold and 3-fold acceleration. Fractional anisotropy (FA) and mean diffusivity (MD) were measured in all 3 acquisitions. Fiber tracking performance was compared between the acquisitions regarding the number of tracks, average track length, and anatomical precision using multivariate analysis of variance and Mann-Whitney U tests. Acquisition time was 7:24 minutes for conventional DTI, 3:53 minutes for 2-fold acceleration, and 2:38 minutes for 3-fold acceleration. Overall FA and MD values ranged from 0.220 to 0.378 and 1.595 to 1.829 mm2/s, respectively. Two-fold acceleration yielded similar FA and MD values (P ≥ 0.901) and similar fiber tracking performance compared with conventional DTI. Three-fold acceleration resulted in comparable MD (P = 0.199) but higher FA values (P = 0.006) and significantly impaired fiber tracking in the soleus and tibialis anterior muscles (number of tracks, P DTI of skeletal muscle with similar image quality and quantification accuracy of diffusion parameters. This may increase the clinical applicability of muscle anisotropy measurements.
International Nuclear Information System (INIS)
Chen, G.S.; Yang, D.Y.
1998-01-01
We apply and compare the preconditioned generalized conjugate gradient methods to solve the linear system equation that arises in the two-dimensional neutron and photon transport equation in this paper. Several subroutines are developed on the basis of preconditioned generalized conjugate gradient methods for time-independent, two-dimensional neutron and photon transport equation in the transport theory. These generalized conjugate gradient methods are used: TFQMR (transpose free quasi-minimal residual algorithm) CGS (conjugate gradient square algorithm), Bi-CGSTAB (bi-conjugate gradient stabilized algorithm) and QMRCGSTAB (quasi-minimal residual variant of bi-conjugate gradient stabilized algorithm). These subroutines are connected to computer program DORT. Several problems are tested on a personal computer with Intel Pentium CPU. The reasons to choose the generalized conjugate gradient methods are that the methods have better residual (equivalent to error) control procedures in the computation and have better convergent rate. The pointwise incomplete LU factorization ILU, modified pointwise incomplete LU factorization MILU, block incomplete factorization BILU and modified blockwise incomplete LU factorization MBILU are the preconditioning techniques used in the several testing problems. In Bi-CGSTAB, CGS, TFQMR and QMRCGSTAB method, we find that either CGS or Bi-CGSTAB method combined with preconditioner MBILU is the most efficient algorithm in these methods in the several testing problems. The numerical solution of flux by preconditioned CGS and Bi-CGSTAB methods has the same result as those from Cray computer, obtained by either the point successive relaxation method or the line successive relaxation method combined with Gaussian elimination
Nonlinear Preconditioning and its Application in Multicomponent Problems
Liu, Lulu
2015-12-07
The Multiplicative Schwarz Preconditioned Inexact Newton (MSPIN) algorithm is presented as a complement to Additive Schwarz Preconditioned Inexact Newton (ASPIN). At an algebraic level, ASPIN and MSPIN are variants of the same strategy to improve the convergence of systems with unbalanced nonlinearities; however, they have natural complementarity in practice. MSPIN is naturally based on partitioning of degrees of freedom in a nonlinear PDE system by field type rather than by subdomain, where a modest factor of concurrency can be sacrificed for physically motivated convergence robustness. ASPIN, originally introduced for decompositions into subdomains, is natural for high concurrency and reduction of global synchronization. The ASPIN framework, as an option for the outermost solver, successfully handles strong nonlinearities in computational fluid dynamics, but is barely explored for the highly nonlinear models of complex multiphase flow with capillarity, heterogeneity, and complex geometry. In this dissertation, the fully implicit ASPIN method is demonstrated for a finite volume discretization based on incompressible two-phase reservoir simulators in the presence of capillary forces and gravity. Numerical experiments show that the number of global nonlinear iterations is not only scalable with respect to the number of processors, but also significantly reduced compared with the standard inexact Newton method with a backtracking technique. Moreover, the ASPIN method, in contrast with the IMPES method, saves overall execution time because of the savings in timestep size. We consider the additive and multiplicative types of inexact Newton algorithms in the field-split context, and we augment the classical convergence theory of ASPIN for the multiplicative case. Moreover, we provide the convergence analysis of the MSPIN algorithm. Under suitable assumptions, it is shown that MSPIN is locally convergent, and desired superlinear or even quadratic convergence can be
Weighted SGD for ℓp Regression with Randomized Preconditioning*
Yang, Jiyan; Chow, Yin-Lam; Ré, Christopher; Mahoney, Michael W.
2018-01-01
In recent years, stochastic gradient descent (SGD) methods and randomized linear algebra (RLA) algorithms have been applied to many large-scale problems in machine learning and data analysis. SGD methods are easy to implement and applicable to a wide range of convex optimization problems. In contrast, RLA algorithms provide much stronger performance guarantees but are applicable to a narrower class of problems. We aim to bridge the gap between these two methods in solving constrained overdetermined linear regression problems—e.g., ℓ2 and ℓ1 regression problems. We propose a hybrid algorithm named pwSGD that uses RLA techniques for preconditioning and constructing an importance sampling distribution, and then performs an SGD-like iterative process with weighted sampling on the preconditioned system.By rewriting a deterministic ℓp regression problem as a stochastic optimization problem, we connect pwSGD to several existing ℓp solvers including RLA methods with algorithmic leveraging (RLA for short).We prove that pwSGD inherits faster convergence rates that only depend on the lower dimension of the linear system, while maintaining low computation complexity. Such SGD convergence rates are superior to other related SGD algorithm such as the weighted randomized Kaczmarz algorithm.Particularly, when solving ℓ1 regression with size n by d, pwSGD returns an approximate solution with ε relative error in the objective value in 𝒪(log n·nnz(A)+poly(d)/ε2) time. This complexity is uniformly better than that of RLA methods in terms of both ε and d when the problem is unconstrained. In the presence of constraints, pwSGD only has to solve a sequence of much simpler and smaller optimization problem over the same constraints. In general this is more efficient than solving the constrained subproblem required in RLA.For ℓ2 regression, pwSGD returns an approximate solution with ε relative error in the objective value and the solution vector measured in
Ukraine Agricultural Land Market Formation Preconditions
Directory of Open Access Journals (Sweden)
Evgen Dankevych
2017-01-01
Full Text Available The theoretical land relations reforming principles were reviewed.Land relations in agriculture transformation process was studied. The land use features were detected and agricultural land use efficiency analysis was conducted.Ukraine land market formation research problems results have been shown. It was established that private land ownership institution ambiguous attitude, rent relations deformation, lack of the property rights ensure mechanism inhibit the land market development. Sociological research of Ukrainian Polesie region to determine the prerequisites for agricultural land marketformation preconditions has been conducted. 787 respondents from Zhytomyr, Rivne and Volyn regions were interviewed. Land shares owners age structure, their distribution by education level, their employment, land shares owners and agricultural enterprises executives to the agricultural land sale moratorium cancellation attitudes, land purchase financial resources, directions of Ukrainian Polissya region land shares use, shares owners land issues level of awareness have been determined during the research. Was substantiated that agricultural land market turnover includes not only land sale moratorium cancellation but also the adoption of the legislative framework and the appropriate infrastructure development, one of the key elements of which is land relations regulation specialized state agency – State Land Bank.
Linear multifrequency-grey acceleration recast for preconditioned Krylov iterations
International Nuclear Information System (INIS)
Morel, Jim E.; Brian Yang, T.-Y.; Warsa, James S.
2007-01-01
The linear multifrequency-grey acceleration (LMFGA) technique is used to accelerate the iterative convergence of multigroup thermal radiation diffusion calculations in high energy density simulations. Although it is effective and efficient in one-dimensional calculations, the LMFGA method has recently been observed to significantly degrade under certain conditions in multidimensional calculations with large discontinuities in material properties. To address this deficiency, we recast the LMFGA method in terms of a preconditioned system that is solved with a Krylov method (LMFGK). Results are presented demonstrating that the new LMFGK method always requires fewer iterations than the original LMFGA method. The reduction in iteration count increases with both the size of the time step and the inhomogeneity of the problem. However, for reasons later explained, the LMFGK method can cost more per iteration than the LMFGA method, resulting in lower but comparable efficiency in problems with small time steps and weak inhomogeneities. In problems with large time steps and strong inhomogeneities, the LMFGK method is significantly more efficient than the LMFGA method
Fijany, Amir
1993-01-01
In this paper, parallel O(log n) algorithms for computation of rigid multibody dynamics are developed. These parallel algorithms are derived by parallelization of new O(n) algorithms for the problem. The underlying feature of these O(n) algorithms is a drastically different strategy for decomposition of interbody force which leads to a new factorization of the mass matrix (M). Specifically, it is shown that a factorization of the inverse of the mass matrix in the form of the Schur Complement is derived as M(exp -1) = C - B(exp *)A(exp -1)B, wherein matrices C, A, and B are block tridiagonal matrices. The new O(n) algorithm is then derived as a recursive implementation of this factorization of M(exp -1). For the closed-chain systems, similar factorizations and O(n) algorithms for computation of Operational Space Mass Matrix lambda and its inverse lambda(exp -1) are also derived. It is shown that these O(n) algorithms are strictly parallel, that is, they are less efficient than other algorithms for serial computation of the problem. But, to our knowledge, they are the only known algorithms that can be parallelized and that lead to both time- and processor-optimal parallel algorithms for the problem, i.e., parallel O(log n) algorithms with O(n) processors. The developed parallel algorithms, in addition to their theoretical significance, are also practical from an implementation point of view due to their simple architectural requirements.
The protective effect of ischemic preconditioning on rat testis
Directory of Open Access Journals (Sweden)
Ciralik Harun
2007-12-01
Full Text Available Abstract Background It has been demonstrated that brief episodes of sublethal ischemia-reperfusion, so-called ischemic preconditioning, provide powerful tissue protection in different tissues such as heart, brain, skeletal muscle, lung, liver, intestine, kidney, retina, and endothelial cells. Although a recent study has claimed that there are no protective effects of ischemic preconditioning in rat testis, the protective effects of ischemic preconditioning on testicular tissue have not been investigated adequately. The present study was thus planned to investigate whether ischemic preconditioning has a protective effect on testicular tissue. Methods Rats were divided into seven groups that each contained seven rats. In group 1 (control group, only unilateral testicular ischemia was performed by creating a testicular torsion by a 720 degree clockwise rotation for 180 min. In group 2, group 3, group 4, group 5, group 6, and group 7, unilateral testicular ischemia was performed for 180 min following different periods of ischemic preconditioning. The ischemic preconditioning periods were as follows: 10 minutes of ischemia with 10 minutes of reperfusion in group 2; 20 minutes of ischemia with 10 minutes of reperfusion in group 3; 30 minutes of ischemia with 10 minutes of reperfusion in group 4; multiple preconditioning periods were used (3 × 10 min early phase transient ischemia with 10 min reperfusion in all episodes in group 5; multiple preconditioning periods were used (5, 10, and 15 min early phase transient ischemia with 10 min reperfusion in all episodes in group 6; and, multiple preconditioning periods were used (10, 20, and 30 min early phase transient ischemia with 10 min reperfusion in all episodes in group 7. After the ischemic protocols were carried out, animals were sacrificed by cervical dislocation and testicular tissue samples were taken for biochemical measurements (protein, malondialdehyde, nitric oxide and histological examination
Parallel CFD Algorithms for Aerodynamical Flow Solvers on Unstructured Meshes. Parts 1 and 2
Barth, Timothy J.; Kwak, Dochan (Technical Monitor)
1995-01-01
The Advisory Group for Aerospace Research and Development (AGARD) has requested my participation in the lecture series entitled Parallel Computing in Computational Fluid Dynamics to be held at the von Karman Institute in Brussels, Belgium on May 15-19, 1995. In addition, a request has been made from the US Coordinator for AGARD at the Pentagon for NASA Ames to hold a repetition of the lecture series on October 16-20, 1995. I have been asked to be a local coordinator for the Ames event. All AGARD lecture series events have attendance limited to NATO allied countries. A brief of the lecture series is provided in the attached enclosure. Specifically, I have been asked to give two lectures of approximately 75 minutes each on the subject of parallel solution techniques for the fluid flow equations on unstructured meshes. The title of my lectures is "Parallel CFD Algorithms for Aerodynamical Flow Solvers on Unstructured Meshes" (Parts I-II). The contents of these lectures will be largely review in nature and will draw upon previously published work in this area. Topics of my lectures will include: (1) Mesh partitioning algorithms. Recursive techniques based on coordinate bisection, Cuthill-McKee level structures, and spectral bisection. (2) Newton's method for large scale CFD problems. Size and complexity estimates for Newton's method, modifications for insuring global convergence. (3) Techniques for constructing the Jacobian matrix. Analytic and numerical techniques for Jacobian matrix-vector products, constructing the transposed matrix, extensions to optimization and homotopy theories. (4) Iterative solution algorithms. Practical experience with GIVIRES and BICG-STAB matrix solvers. (5) Parallel matrix preconditioning. Incomplete Lower-Upper (ILU) factorization, domain-decomposed ILU, approximate Schur complement strategies.
Parallel Monte Carlo reactor neutronics
International Nuclear Information System (INIS)
Blomquist, R.N.; Brown, F.B.
1994-01-01
The issues affecting implementation of parallel algorithms for large-scale engineering Monte Carlo neutron transport simulations are discussed. For nuclear reactor calculations, these include load balancing, recoding effort, reproducibility, domain decomposition techniques, I/O minimization, and strategies for different parallel architectures. Two codes were parallelized and tested for performance. The architectures employed include SIMD, MIMD-distributed memory, and workstation network with uneven interactive load. Speedups linear with the number of nodes were achieved
International Nuclear Information System (INIS)
Jejcic, A.; Maillard, J.; Maurel, G.; Silva, J.; Wolff-Bacha, F.
1997-01-01
The work in the field of parallel processing has developed as research activities using several numerical Monte Carlo simulations related to basic or applied current problems of nuclear and particle physics. For the applications utilizing the GEANT code development or improvement works were done on parts simulating low energy physical phenomena like radiation, transport and interaction. The problem of actinide burning by means of accelerators was approached using a simulation with the GEANT code. A program of neutron tracking in the range of low energies up to the thermal region has been developed. It is coupled to the GEANT code and permits in a single pass the simulation of a hybrid reactor core receiving a proton burst. Other works in this field refers to simulations for nuclear medicine applications like, for instance, development of biological probes, evaluation and characterization of the gamma cameras (collimators, crystal thickness) as well as the method for dosimetric calculations. Particularly, these calculations are suited for a geometrical parallelization approach especially adapted to parallel machines of the TN310 type. Other works mentioned in the same field refer to simulation of the electron channelling in crystals and simulation of the beam-beam interaction effect in colliders. The GEANT code was also used to simulate the operation of germanium detectors designed for natural and artificial radioactivity monitoring of environment
Preconditioned Krylov and Gauss-Seidel solutions of response matrix equations
International Nuclear Information System (INIS)
Lewis, E.E.; Smith, M.A.; Yang, W.S.; Wollaber, A.
2011-01-01
The use of preconditioned Krylov methods is examined as an alternative to the partitioned matrix acceleration applied to red-black Gauss Seidel (RBGS) iteration that is presently used in the variational nodal code, VARIANT. We employ the GMRES algorithm to treat non-symmetric response matrix equations. A pre conditioner is formulated for the within-group diffusion equation which is equivalent to partitioned matrix acceleration of RBGS iterations. We employ the pre conditioner, which closely parallels two-level p multigrid, to improve RBGS and GMRES algorithms. Of the accelerated algorithms, GMRES converges with less computational effort than RBGS and therefore is chosen for further development. The p multigrid pre conditioner requires response matrices with two or more degrees of freedom (DOF) per interface that are polynomials, which are both orthogonal and hierarchical. It is therefore not directly applicable to very fine mesh calculations that are both slow to converge and that are often modeled with response matrices with only one DOF per interface. Orthogonal matrix aggregation (OMA) is introduced to circumvent this difficulty by combining N×N fine mesh response matrices with one DOF per interface into a coarse mesh response matrix with N orthogonal DOF per interface. Numerical results show that OMA used alone or in combination with p multigrid preconditioning substantially accelerates GMRES solutions. (author)
Preconditioned Krylov and Gauss-Seidel solutions of response matrix equations
Energy Technology Data Exchange (ETDEWEB)
Lewis, E.E., E-mail: e-lewis@northwestern.edu [Department of Mechanical Engineering, Northwestern University, Evanston, IL (United States); Smith, M.A.; Yang, W.S.; Wollaber, A., E-mail: masmith@anl.gov, E-mail: wsyang@anl.gov, E-mail: wollaber@lanl.gov [Nuclear Engineering Division, Argonne National Laboratory, Argonne, IL (United States)
2011-07-01
The use of preconditioned Krylov methods is examined as an alternative to the partitioned matrix acceleration applied to red-black Gauss Seidel (RBGS) iteration that is presently used in the variational nodal code, VARIANT. We employ the GMRES algorithm to treat non-symmetric response matrix equations. A pre conditioner is formulated for the within-group diffusion equation which is equivalent to partitioned matrix acceleration of RBGS iterations. We employ the pre conditioner, which closely parallels two-level p multigrid, to improve RBGS and GMRES algorithms. Of the accelerated algorithms, GMRES converges with less computational effort than RBGS and therefore is chosen for further development. The p multigrid pre conditioner requires response matrices with two or more degrees of freedom (DOF) per interface that are polynomials, which are both orthogonal and hierarchical. It is therefore not directly applicable to very fine mesh calculations that are both slow to converge and that are often modeled with response matrices with only one DOF per interface. Orthogonal matrix aggregation (OMA) is introduced to circumvent this difficulty by combining N×N fine mesh response matrices with one DOF per interface into a coarse mesh response matrix with N orthogonal DOF per interface. Numerical results show that OMA used alone or in combination with p multigrid preconditioning substantially accelerates GMRES solutions. (author)
Parallel programming with Python
Palach, Jan
2014-01-01
A fast, easy-to-follow and clear tutorial to help you develop Parallel computing systems using Python. Along with explaining the fundamentals, the book will also introduce you to slightly advanced concepts and will help you in implementing these techniques in the real world. If you are an experienced Python programmer and are willing to utilize the available computing resources by parallelizing applications in a simple way, then this book is for you. You are required to have a basic knowledge of Python development to get the most of this book.
[Anaesthetic-induced myocardial preconditioning: fundamental basis and clinical implications].
Chiari, P; Bouvet, F; Piriou, V
2005-04-01
Volatile halogenated anaesthetics offer a myocardial protection when they are administrated before a myocardial ischaemia. Cellular mechanisms involved in anaesthetic preconditioning are now better understood. The objectives of this review are to understand the anaesthetic-induced preconditioning underlying mechanisms and to know the clinical implications. References were obtained from PubMed data bank (http://www.ncbi.nlm.nih.gov/entrez/query.fcgi) using the following keywords: volatile anaesthetic, isoflurane, halothane, sevoflurane, desflurane, preconditioning, protection, myocardium. Ischaemic preconditioning (PC) is a myocardial endogenous protection against ischaemia. It has been described as one or several short ischaemia before a sustained ischemia. These short ischaemia trigger a protective signal against this longer ischaemia. An ischemic organ is able to precondition a remote organ. It is possible to replace the short ischaemia by a preadministration of halogenated volatile anaesthetic with the same protective effect, this is called anaesthetic PC (APC). APC and ischaemic PC share similar underlying biochemical mechanisms including protein kinase C, tyrosine kinase activation and mitochondrial and sarcolemnal K(ATP) channels opening. All halogenated anaesthetics can produce an anaesthetic PC effect. Myocardial protection during reperfusion, after the long ischaemia, has been shown by successive short ischaemia or volatile anaesthetic administration, this is called postconditioning. Ischaemic PC has been described in humans in 1993. Clinical studies in human cardiac surgery have shown the possibility of anaesthetic PC with volatile anaesthetics. These studies have shown a decrease of postoperative troponin in patient receiving halogenated anaesthetics.
V. V. Likhvantsev; O. A. Grebenchikov; R. A. Cherpakov; Yu. V. Skripkin; K. Yu. Borisov
2016-01-01
The purpose of this study is to determine and evaluate if the preconditioning with desflurane depends on level of phosphoGSK3β.Material and methods. White outbred male rats (56) were randomly allocated to 6 groups. Ischemia/reperfusion modeling was performed using V. G.Korpachev's technique. The reference group consisted of sham (falselyoperated) animals. The second group underwent global ischemia/reperfusion after anesthesia with chloral hydrate. The next two groups were treated with either ...
Massively parallel multicanonical simulations
Gross, Jonathan; Zierenberg, Johannes; Weigel, Martin; Janke, Wolfhard
2018-03-01
Generalized-ensemble Monte Carlo simulations such as the multicanonical method and similar techniques are among the most efficient approaches for simulations of systems undergoing discontinuous phase transitions or with rugged free-energy landscapes. As Markov chain methods, they are inherently serial computationally. It was demonstrated recently, however, that a combination of independent simulations that communicate weight updates at variable intervals allows for the efficient utilization of parallel computational resources for multicanonical simulations. Implementing this approach for the many-thread architecture provided by current generations of graphics processing units (GPUs), we show how it can be efficiently employed with of the order of 104 parallel walkers and beyond, thus constituting a versatile tool for Monte Carlo simulations in the era of massively parallel computing. We provide the fully documented source code for the approach applied to the paradigmatic example of the two-dimensional Ising model as starting point and reference for practitioners in the field.
Operator-Based Preconditioning of Stiff Hyperbolic Systems
International Nuclear Information System (INIS)
Reynolds, Daniel R.; Samtaney, Ravi; Woodward, Carol S.
2009-01-01
We introduce an operator-based scheme for preconditioning stiff components encountered in implicit methods for hyperbolic systems of partial differential equations posed on regular grids. The method is based on a directional splitting of the implicit operator, followed by a characteristic decomposition of the resulting directional parts. This approach allows for solution to any number of characteristic components, from the entire system to only the fastest, stiffness-inducing waves. We apply the preconditioning method to stiff hyperbolic systems arising in magnetohydro- dynamics and gas dynamics. We then present numerical results showing that this preconditioning scheme works well on problems where the underlying stiffness results from the interaction of fast transient waves with slowly-evolving dynamics, scales well to large problem sizes and numbers of processors, and allows for additional customization based on the specific problems under study
A nonrecursive order N preconditioned conjugate gradient: Range space formulation of MDOF dynamics
Kurdila, Andrew J.
1990-01-01
While excellent progress has been made in deriving algorithms that are efficient for certain combinations of system topologies and concurrent multiprocessing hardware, several issues must be resolved to incorporate transient simulation in the control design process for large space structures. Specifically, strategies must be developed that are applicable to systems with numerous degrees of freedom. In addition, the algorithms must have a growth potential in that they must also be amenable to implementation on forthcoming parallel system architectures. For mechanical system simulation, this fact implies that algorithms are required that induce parallelism on a fine scale, suitable for the emerging class of highly parallel processors; and transient simulation methods must be automatically load balancing for a wider collection of system topologies and hardware configurations. These problems are addressed by employing a combination range space/preconditioned conjugate gradient formulation of multi-degree-of-freedom dynamics. The method described has several advantages. In a sequential computing environment, the method has the features that: by employing regular ordering of the system connectivity graph, an extremely efficient preconditioner can be derived from the 'range space metric', as opposed to the system coefficient matrix; because of the effectiveness of the preconditioner, preliminary studies indicate that the method can achieve performance rates that depend linearly upon the number of substructures, hence the title 'Order N'; and the method is non-assembling. Furthermore, the approach is promising as a potential parallel processing algorithm in that the method exhibits a fine parallel granularity suitable for a wide collection of combinations of physical system topologies/computer architectures; and the method is easily load balanced among processors, and does not rely upon system topology to induce parallelism.
McCallum, Ethan
2011-01-01
It's tough to argue with R as a high-quality, cross-platform, open source statistical software product-unless you're in the business of crunching Big Data. This concise book introduces you to several strategies for using R to analyze large datasets. You'll learn the basics of Snow, Multicore, Parallel, and some Hadoop-related tools, including how to find them, how to use them, when they work well, and when they don't. With these packages, you can overcome R's single-threaded nature by spreading work across multiple CPUs, or offloading work to multiple machines to address R's memory barrier.
The Role of Ionospheric Outflow Preconditioning in Determining Storm Geoeffectiveness
Welling, D. T.; Liemohn, M. W.; Ridley, A. J.
2012-12-01
It is now well accepted that ionospheric outflow plays an important role in the development of the plasma sheet and ring current during geomagnetic storms. Furthermore, even during quiet times, ionospheric plasma populates the magnetospheric lobes, producing a reservoir of hydrogen and oxygen ions. When the Interplanetary Magnetic Field (IMF) turns southward, this reservoir is connected to the plasma sheet and ring current through magnetospheric convection. Hence, the conditions of the ionosphere and magnetospheric lobes leading up to magnetospheric storm onset have important implications for storm development. Despite this, there has been little research on this preconditioning; most global simulations begin just before storm onset, neglecting preconditioning altogether. This work explores the role of preconditioning in determining the geoeffectiveness of storms using a coupled global model system. A model of ionospheric outflow (the Polar Wind Outflow Model, PWOM) is two-way coupled to a global magnetohydrodynamic model (the Block-Adaptive Tree Solar wind Roe-type Upwind Scheme, BATS-R-US), which in turn drives a ring current model (the Ring current Atmosphere interactions Model, RAM). This unique setup is used to simulate an idealized storm. The model is started at many different times, from 1 hour before storm onset to 12 hours before. The effects of storm preconditioning are examined by investigating the total ionospheric plasma content in the lobes just before onset, the total ionospheric contribution in the ring current just after onset, and the effects on Dst, magnetic elevation angle at geosynchronous, and total ring current energy density. This experiment is repeated for different solar activity levels as set by F10.7 flux. Finally, a synthetic double-dip storm is constructed to see how two closely spaced storms affect each other by changing the preconditioning environment. It is found that preconditioning of the magnetospheric lobes via ionospheric
Fourier analysis of finite element preconditioned collocation schemes
Deville, Michel O.; Mund, Ernest H.
1990-01-01
The spectrum of the iteration operator of some finite element preconditioned Fourier collocation schemes is investigated. The first part of the paper analyses one-dimensional elliptic and hyperbolic model problems and the advection-diffusion equation. Analytical expressions of the eigenvalues are obtained with use of symbolic computation. The second part of the paper considers the set of one-dimensional differential equations resulting from Fourier analysis (in the tranverse direction) of the 2-D Stokes problem. All results agree with previous conclusions on the numerical efficiency of finite element preconditioning schemes.
Parallel multiphysics algorithms and software for computational nuclear engineering
International Nuclear Information System (INIS)
Gaston, D; Hansen, G; Kadioglu, S; Knoll, D A; Newman, C; Park, H; Permann, C; Taitano, W
2009-01-01
There is a growing trend in nuclear reactor simulation to consider multiphysics problems. This can be seen in reactor analysis where analysts are interested in coupled flow, heat transfer and neutronics, and in fuel performance simulation where analysts are interested in thermomechanics with contact coupled to species transport and chemistry. These more ambitious simulations usually motivate some level of parallel computing. Many of the coupling efforts to date utilize simple code coupling or first-order operator splitting, often referred to as loose coupling. While these approaches can produce answers, they usually leave questions of accuracy and stability unanswered. Additionally, the different physics often reside on separate grids which are coupled via simple interpolation, again leaving open questions of stability and accuracy. Utilizing state of the art mathematics and software development techniques we are deploying next generation tools for nuclear engineering applications. The Jacobian-free Newton-Krylov (JFNK) method combined with physics-based preconditioning provide the underlying mathematical structure for our tools. JFNK is understood to be a modern multiphysics algorithm, but we are also utilizing its unique properties as a scale bridging algorithm. To facilitate rapid development of multiphysics applications we have developed the Multiphysics Object-Oriented Simulation Environment (MOOSE). Examples from two MOOSE-based applications: PRONGHORN, our multiphysics gas cooled reactor simulation tool and BISON, our multiphysics, multiscale fuel performance simulation tool will be presented.
Energy Technology Data Exchange (ETDEWEB)
2017-04-04
A parallelization of the k-means++ seed selection algorithm on three distinct hardware platforms: GPU, multicore CPU, and multithreaded architecture. K-means++ was developed by David Arthur and Sergei Vassilvitskii in 2007 as an extension of the k-means data clustering technique. These algorithms allow people to cluster multidimensional data, by attempting to minimize the mean distance of data points within a cluster. K-means++ improved upon traditional k-means by using a more intelligent approach to selecting the initial seeds for the clustering process. While k-means++ has become a popular alternative to traditional k-means clustering, little work has been done to parallelize this technique. We have developed original C++ code for parallelizing the algorithm on three unique hardware architectures: GPU using NVidia's CUDA/Thrust framework, multicore CPU using OpenMP, and the Cray XMT multithreaded architecture. By parallelizing the process for these platforms, we are able to perform k-means++ clustering much more quickly than it could be done before.
Effects of ketamine and its isomers on ischemic preconditioning in the isolated rat heart
Molojavyi, A.; Preckel, B.; Comfère, T.; Müllenheim, J.; Thämer, V.; Schlack, W.
2001-01-01
BACKGROUND: Ischemic preconditioning protects the heart against subsequent ischemia. Opening of the adenosine triphosphate-sensitive potassium (KATP) channel is a key mechanism of preconditioning. Ketamine blocks KATP channels of isolated cardiomyocytes. The authors investigated the effects of
Zhang, Xiao-bo; Tan, Jun; Song, Peng; Li, Jin-shan; Xia, Dong-ming; Liu, Zhao-lun
2017-01-01
The gradient preconditioning approach based on seismic wave energy can effectively avoid the huge storage consumption in the gradient preconditioning algorithms based on Hessian matrices in time-domain full waveform inversion (FWI), but the accuracy
Directory of Open Access Journals (Sweden)
James G. Worner
2017-05-01
Full Text Available James Worner is an Australian-based writer and scholar currently pursuing a PhD at the University of Technology Sydney. His research seeks to expose masculinities lost in the shadow of Australia’s Anzac hegemony while exploring new opportunities for contemporary historiography. He is the recipient of the Doctoral Scholarship in Historical Consciousness at the university’s Australian Centre of Public History and will be hosted by the University of Bologna during 2017 on a doctoral research writing scholarship. ‘Parallel Lines’ is one of a collection of stories, The Shapes of Us, exploring liminal spaces of modern life: class, gender, sexuality, race, religion and education. It looks at lives, like lines, that do not meet but which travel in proximity, simultaneously attracted and repelled. James’ short stories have been published in various journals and anthologies.
Parallel pathways for cross-modal memory retrieval in Drosophila.
Zhang, Xiaonan; Ren, Qingzhong; Guo, Aike
2013-05-15
Memory-retrieval processing of cross-modal sensory preconditioning is vital for understanding the plasticity underlying the interactions between modalities. As part of the sensory preconditioning paradigm, it has been hypothesized that the conditioned response to an unreinforced cue depends on the memory of the reinforced cue via a sensory link between the two cues. To test this hypothesis, we studied cross-modal memory-retrieval processing in a genetically tractable model organism, Drosophila melanogaster. By expressing the dominant temperature-sensitive shibire(ts1) (shi(ts1)) transgene, which blocks synaptic vesicle recycling of specific neural subsets with the Gal4/UAS system at the restrictive temperature, we specifically blocked visual and olfactory memory retrieval, either alone or in combination; memory acquisition remained intact for these modalities. Blocking the memory retrieval of the reinforced olfactory cues did not impair the conditioned response to the unreinforced visual cues or vice versa, in contrast to the canonical memory-retrieval processing of sensory preconditioning. In addition, these conditioned responses can be abolished by blocking the memory retrieval of the two modalities simultaneously. In sum, our results indicated that a conditioned response to an unreinforced cue in cross-modal sensory preconditioning can be recalled through parallel pathways.
Parallel-vector algorithms for particle simulations on shared-memory multiprocessors
International Nuclear Information System (INIS)
Nishiura, Daisuke; Sakaguchi, Hide
2011-01-01
Over the last few decades, the computational demands of massive particle-based simulations for both scientific and industrial purposes have been continuously increasing. Hence, considerable efforts are being made to develop parallel computing techniques on various platforms. In such simulations, particles freely move within a given space, and so on a distributed-memory system, load balancing, i.e., assigning an equal number of particles to each processor, is not guaranteed. However, shared-memory systems achieve better load balancing for particle models, but suffer from the intrinsic drawback of memory access competition, particularly during (1) paring of contact candidates from among neighboring particles and (2) force summation for each particle. Here, novel algorithms are proposed to overcome these two problems. For the first problem, the key is a pre-conditioning process during which particle labels are sorted by a cell label in the domain to which the particles belong. Then, a list of contact candidates is constructed by pairing the sorted particle labels. For the latter problem, a table comprising the list indexes of the contact candidate pairs is created and used to sum the contact forces acting on each particle for all contacts according to Newton's third law. With just these methods, memory access competition is avoided without additional redundant procedures. The parallel efficiency and compatibility of these two algorithms were evaluated in discrete element method (DEM) simulations on four types of shared-memory parallel computers: a multicore multiprocessor computer, scalar supercomputer, vector supercomputer, and graphics processing unit. The computational efficiency of a DEM code was found to be drastically improved with our algorithms on all but the scalar supercomputer. Thus, the developed parallel algorithms are useful on shared-memory parallel computers with sufficient memory bandwidth.
A Parallel Algebraic Multigrid Solver on Graphics Processing Units
Haase, Gundolf
2010-01-01
The paper presents a multi-GPU implementation of the preconditioned conjugate gradient algorithm with an algebraic multigrid preconditioner (PCG-AMG) for an elliptic model problem on a 3D unstructured grid. An efficient parallel sparse matrix-vector multiplication scheme underlying the PCG-AMG algorithm is presented for the many-core GPU architecture. A performance comparison of the parallel solver shows that a singe Nvidia Tesla C1060 GPU board delivers the performance of a sixteen node Infiniband cluster and a multi-GPU configuration with eight GPUs is about 100 times faster than a typical server CPU core. © 2010 Springer-Verlag.
40 CFR 86.132-00 - Vehicle preconditioning.
2010-07-01
... 40 Protection of Environment 18 2010-07-01 2010-07-01 false Vehicle preconditioning. 86.132-00... (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission Regulations for 1977 and Later Model Year New Light-Duty Vehicles and New Light-Duty Trucks and New Otto-Cycle Complete...
40 CFR 86.232-94 - Vehicle preconditioning.
2010-07-01
... 40 Protection of Environment 18 2010-07-01 2010-07-01 false Vehicle preconditioning. 86.232-94... (CONTINUED) CONTROL OF EMISSIONS FROM NEW AND IN-USE HIGHWAY VEHICLES AND ENGINES Emission Regulations for 1994 and Later Model Year Gasoline-Fueled New Light-Duty Vehicles, New Light-Duty Trucks and New Medium...
Preconditioned stochastic gradient descent optimisation for monomodal image registration
Klein, S.; Staring, M.; Andersson, J.P.; Pluim, J.P.W.; Fichtinger, G.; Martel, A.; Peters, T.
2011-01-01
We present a stochastic optimisation method for intensity-based monomodal image registration. The method is based on a Robbins-Monro stochastic gradient descent method with adaptive step size estimation, and adds a preconditioning matrix. The derivation of the pre-conditioner is based on the
Manipulation in political stock markets: Preconditions and evidence
Hansen, Jan; Schmidt, Carsten; Strobel, Martin
2001-01-01
Political stock markets (PSM) are sometimes seen as substitutes for opinion polls. On the bases of a behavioral model, specific preconditions were drawn out under which manipulation in PSM can weaken this argument. Evidence for manipulation is reported from the data of two separate PSM during the Berlin 99 state elections.
Preconditioned Iterative Methods for Solving Weighted Linear Least Squares Problems
Czech Academy of Sciences Publication Activity Database
Bru, R.; Marín, J.; Mas, J.; Tůma, Miroslav
2014-01-01
Roč. 36, č. 4 (2014), A2002-A2022 ISSN 1064-8275 Institutional support: RVO:67985807 Keywords : preconditioned iterative methods * incomplete decompositions * approximate inverses * linear least squares Subject RIV: BA - General Mathematics Impact factor: 1.854, year: 2014
Preconditions of origin, essence and assignment of strategic managerial accounting
Boiko, I.
2010-01-01
The article is devoted to the research of preconditions and necessity of creation strategic managerial accounting in the accounting system of enterprise. There are investigated economic essence and assignment of strategic managerial accounting and substantiated its importance for making strategic decisions on an enterprise.
New preconditioned conjugate gradient algorithms for nonlinear unconstrained optimization problems
International Nuclear Information System (INIS)
Al-Bayati, A.; Al-Asadi, N.
1997-01-01
This paper presents two new predilection conjugate gradient algorithms for nonlinear unconstrained optimization problems and examines their computational performance. Computational experience shows that the new proposed algorithms generally imp lone the efficiency of Nazareth's [13] preconditioned conjugate gradient algorithm. (authors). 16 refs., 1 tab
Deflation in preconditioned conjugate gradient methods for Finite Element Problems
Vermolen, F.J.; Vuik, C.; Segal, A.
2002-01-01
We investigate the influence of the value of deflation vectors at interfaces on the rate of convergence of preconditioned conjugate gradient methods applied to a Finite Element discretization for an elliptic equation. Our set-up is a Poisson problem in two dimensions with continuous or discontinuous
Accurate reanalysis of structures by a preconditioned conjugate gradient method
Czech Academy of Sciences Publication Activity Database
Kirsch, U.; Kočvara, Michal; Zowe, J.
2002-01-01
Roč. 55, č. 2 (2002), s. 233-251 ISSN 0029-5981 R&D Projects: GA AV ČR IAA1075005 Grant - others:BMBF(DE) 03ZOM3ER Institutional research plan: CEZ:AV0Z1075907 Keywords : preconditioned conjugate gradient s * structural reanalysis Subject RIV: BA - General Mathematics Impact factor: 1.468, year: 2002
Preconditioned conjugate-gradient methods for low-speed flow calculations
Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing
1993-01-01
An investigation is conducted into the viability of using a generalized Conjugate Gradient-like method as an iterative solver to obtain steady-state solutions of very low-speed fluid flow problems. Low-speed flow at Mach 0.1 over a backward-facing step is chosen as a representative test problem. The unsteady form of the two dimensional, compressible Navier-Stokes equations is integrated in time using discrete time-steps. The Navier-Stokes equations are cast in an implicit, upwind finite-volume, flux split formulation. The new iterative solver is used to solve a linear system of equations at each step of the time-integration. Preconditioning techniques are used with the new solver to enhance the stability and convergence rate of the solver and are found to be critical to the overall success of the solver. A study of various preconditioners reveals that a preconditioner based on the Lower-Upper Successive Symmetric Over-Relaxation iterative scheme is more efficient than a preconditioner based on Incomplete L-U factorizations of the iteration matrix. The performance of the new preconditioned solver is compared with a conventional Line Gauss-Seidel Relaxation (LGSR) solver. Overall speed-up factors of 28 (in terms of global time-steps required to converge to a steady-state solution) and 20 (in terms of total CPU time on one processor of a CRAY-YMP) are found in favor of the new preconditioned solver, when compared with the LGSR solver.
Application of preconditioned conjugate gradient-like methods to reactor kinetics
International Nuclear Information System (INIS)
Yang, D.Y.; Chen, G.S.; Chou, H.P.
1993-01-01
Several conjugate gradient-like (CG-like) methods are applied to solve the nonsymmetric linear systems of equations derived from the time-dependent two-dimensional two-energy-group neutron diffusion equations by a finite difference approximation. The methods are: the generalized conjugate residual method; the generalized conjugate gradient least-square method; the generalized minimal residual method (GMRES); the conjugate gradient square method; and a variant of bi-conjugate gradient method (Bi-CGSTAB). In order to accelerate these methods, six preconditioning techniques are investigated. Two are based on pointwise incomplete factorization: the incomplete LU (ILU) and the modified incomplete LU (MILU) decompositions; two, based on the block tridiagonal structure of the coefficient matrix, are blockwise and modified blockwise incomplete factorizations, BILU and MBILU; two are the alternating-direction implicit and symmetric successive overrelaxation (SSOR) preconditioners, derived from the basic iterative schemes. Comparisons are made by using CG-like methods combined with different preconditioners to solve a sequence of time-step reactor transient problems. Numerical tests indicate that preconditioned BI-CGSTAB with the preconditioner MBILU requires less CPU time and fewer iterations than other methods. The preconditioned CG-like methods are less sensitive to the time-step size used than the Chebyshev semi-iteration method and line SOR method. The indication is that the CGS, Bi-CGSTAB and GMRES methods are, on average, better than the other methods in reactor kinetics computation and that a good preconditioner is more important than the choice of CG-like methods. The MILU decomposition based on the conventional row-sum criterion has difficulty yielding a convergent solution and an improved version is introduced. (author)
Pharmacological preconditioning with GYKI 52466: a prophylactic approach to neuroprotection
Directory of Open Access Journals (Sweden)
Chelsea S Goulton
2010-08-01
Full Text Available Some toxins and drugs can trigger lasting neuroprotective mechanisms that enable neurons to resist a subsequent severe insult. This ‘pharmacological preconditioning’ has far-reaching implications for conditions in which blood flow to the brain is interrupted. We have previously shown that in vitro preconditioning with the AMPA receptor antagonist GYKI 52466 induces tolerance to kainic acid (KA toxicity in hippocampus. This effect persists well after washout of the drug and may be mediated via inverse agonism of G protein linked receptors. Given the amplifying nature of metabotropic modulation, we hypothesised that GYKI 52466 may be effective in reducing seizure severity at doses well below those normally associated with adverse side effects. Here we report that pharmacological preconditioning with low-dose GYKI imparts a significant protection against KA-induced seizures in vivo. GYKI (3 mg/kg, s.c., 90 to 180 min. prior to high-dose KA, markedly reduced seizure scores, virtually abolished all level 3 and level 4 seizures, and completely suppressed KA-induced hippocampal cFOS expression. In addition, preconditioned animals exhibited significant reductions in high frequency/high amplitude spiking and ECoG power in the delta, theta, alpha and beta bands during KA. Adverse behaviours often associated with higher doses of GYKI were not evident during preconditioning. The fact that GYKI is effective at doses well-below, and at pre-administration intervals well-beyond previous studies, suggests that a classical blockade of ionotropic AMPA receptors does not underlie anticonvulsant effects. Low-dose GYKI preconditioning may represent a novel, prophylactic strategy for neuroprotection in a field almost completely devoid of effective pharmaceuticals.
Priming of the Cells: Hypoxic Preconditioning for Stem Cell Therapy.
Wei, Zheng Z; Zhu, Yan-Bing; Zhang, James Y; McCrary, Myles R; Wang, Song; Zhang, Yong-Bo; Yu, Shan-Ping; Wei, Ling
2017-10-05
Stem cell-based therapies are promising in regenerative medicine for protecting and repairing damaged brain tissues after injury or in the context of chronic diseases. Hypoxia can induce physiological and pathological responses. A hypoxic insult might act as a double-edged sword, it induces cell death and brain damage, but on the other hand, sublethal hypoxia can trigger an adaptation response called hypoxic preconditioning or hypoxic tolerance that is of immense importance for the survival of cells and tissues. This review was based on articles published in PubMed databases up to August 16, 2017, with the following keywords: "stem cells," "hypoxic preconditioning," "ischemic preconditioning," and "cell transplantation." Original articles and critical reviews on the topics were selected. Hypoxic preconditioning has been investigated as a primary endogenous protective mechanism and possible treatment against ischemic injuries. Many cellular and molecular mechanisms underlying the protective effects of hypoxic preconditioning have been identified. In cell transplantation therapy, hypoxic pretreatment of stem cells and neural progenitors markedly increases the survival and regenerative capabilities of these cells in the host environment, leading to enhanced therapeutic effects in various disease models. Regenerative treatments can mobilize endogenous stem cells for neurogenesis and angiogenesis in the adult brain. Furthermore, transplantation of stem cells/neural progenitors achieves therapeutic benefits via cell replacement and/or increased trophic support. Combinatorial approaches of cell-based therapy with additional strategies such as neuroprotective protocols, anti-inflammatory treatment, and rehabilitation therapy can significantly improve therapeutic benefits. In this review, we will discuss the recent progress regarding cell types and applications in regenerative medicine as well as future applications.
Parallel hierarchical radiosity rendering
Energy Technology Data Exchange (ETDEWEB)
Carter, Michael [Iowa State Univ., Ames, IA (United States)
1993-07-01
In this dissertation, the step-by-step development of a scalable parallel hierarchical radiosity renderer is documented. First, a new look is taken at the traditional radiosity equation, and a new form is presented in which the matrix of linear system coefficients is transformed into a symmetric matrix, thereby simplifying the problem and enabling a new solution technique to be applied. Next, the state-of-the-art hierarchical radiosity methods are examined for their suitability to parallel implementation, and scalability. Significant enhancements are also discovered which both improve their theoretical foundations and improve the images they generate. The resultant hierarchical radiosity algorithm is then examined for sources of parallelism, and for an architectural mapping. Several architectural mappings are discussed. A few key algorithmic changes are suggested during the process of making the algorithm parallel. Next, the performance, efficiency, and scalability of the algorithm are analyzed. The dissertation closes with a discussion of several ideas which have the potential to further enhance the hierarchical radiosity method, or provide an entirely new forum for the application of hierarchical methods.
Blokhin, I O; Galagudza, M M; Vlasov, T D; Nifontov, E M; Petrishchev, N N
2008-07-01
Traditionally infarction size reduction by ischemic preconditioning is estimated in duration of test ischemia. This approach limits the understanding of real antiischemic efficacy of ischemic preconditioning. Present study was performed in the in vivo rat model of regional myocardial ischemia-reperfusion and showed that protective effect afforded by ischemic preconditioning progressively decreased with prolongation of test ischemia. There were no statistically significant differences in infarction size between control and preconditioned animals when the duration of test ischemia was increased up to 1 hour. Preconditioning ensured maximal infarction-limiting effect in duration of test ischemia varying from 20 to 40 minutes.
Directory of Open Access Journals (Sweden)
James W. Tam
2012-02-01
Full Text Available Chronic total occlusion (CTO angioplasty is one of the most challenging procedures remaining for the interventional operator. Recanalizing CTOs can improve exercise capacity, symptoms, left ventricular function and possibly reduce mortality. Multiple strategies such as escalating wire, parallel wire, seesaw, contralateral injection, subintimal tracking and re-entry (STAR, retrograde wire techniques (controlled antegrade retrograde subintimal tracking, CART, reverse CART, confluent balloon, rendezvous in coronary, and other techniques have all been described. Selection of the most appropriate approach is based on assessment of vessel course, length of occluded segment, presence of bridging collaterals, presence of bifurcating side branches at the occlusion site, and other variables. Today, with significant operator expertise and the use of available techniques, the literature reports a 50-95% success rate for recanalizing CTOs.
Compiling Scientific Programs for Scalable Parallel Systems
National Research Council Canada - National Science Library
Kennedy, Ken
2001-01-01
...). The research performed in this project included new techniques for recognizing implicit parallelism in sequential programs, a powerful and precise set-based framework for analysis and transformation...
Exploiting Symmetry on Parallel Architectures.
Stiller, Lewis Benjamin
1995-01-01
This thesis describes techniques for the design of parallel programs that solve well-structured problems with inherent symmetry. Part I demonstrates the reduction of such problems to generalized matrix multiplication by a group-equivariant matrix. Fast techniques for this multiplication are described, including factorization, orbit decomposition, and Fourier transforms over finite groups. Our algorithms entail interaction between two symmetry groups: one arising at the software level from the problem's symmetry and the other arising at the hardware level from the processors' communication network. Part II illustrates the applicability of our symmetry -exploitation techniques by presenting a series of case studies of the design and implementation of parallel programs. First, a parallel program that solves chess endgames by factorization of an associated dihedral group-equivariant matrix is described. This code runs faster than previous serial programs, and discovered it a number of results. Second, parallel algorithms for Fourier transforms for finite groups are developed, and preliminary parallel implementations for group transforms of dihedral and of symmetric groups are described. Applications in learning, vision, pattern recognition, and statistics are proposed. Third, parallel implementations solving several computational science problems are described, including the direct n-body problem, convolutions arising from molecular biology, and some communication primitives such as broadcast and reduce. Some of our implementations ran orders of magnitude faster than previous techniques, and were used in the investigation of various physical phenomena.
Aspects of computation on asynchronous parallel processors
International Nuclear Information System (INIS)
Wright, M.
1989-01-01
The increasing availability of asynchronous parallel processors has provided opportunities for original and useful work in scientific computing. However, the field of parallel computing is still in a highly volatile state, and researchers display a wide range of opinion about many fundamental questions such as models of parallelism, approaches for detecting and analyzing parallelism of algorithms, and tools that allow software developers and users to make effective use of diverse forms of complex hardware. This volume collects the work of researchers specializing in different aspects of parallel computing, who met to discuss the framework and the mechanics of numerical computing. The far-reaching impact of high-performance asynchronous systems is reflected in the wide variety of topics, which include scientific applications (e.g. linear algebra, lattice gauge simulation, ordinary and partial differential equations), models of parallelism, parallel language features, task scheduling, automatic parallelization techniques, tools for algorithm development in parallel environments, and system design issues
Codd, A. L.; Gross, L.
2018-03-01
We present a new inversion method for Electrical Resistivity Tomography which, in contrast to established approaches, minimizes the cost function prior to finite element discretization for the unknown electric conductivity and electric potential. Minimization is performed with the Broyden-Fletcher-Goldfarb-Shanno method (BFGS) in an appropriate function space. BFGS is self-preconditioning and avoids construction of the dense Hessian which is the major obstacle to solving large 3-D problems using parallel computers. In addition to the forward problem predicting the measurement from the injected current, the so-called adjoint problem also needs to be solved. For this problem a virtual current is injected through the measurement electrodes and an adjoint electric potential is obtained. The magnitude of the injected virtual current is equal to the misfit at the measurement electrodes. This new approach has the advantage that the solution process of the optimization problem remains independent to the meshes used for discretization and allows for mesh adaptation during inversion. Computation time is reduced by using superposition of pole loads for the forward and adjoint problems. A smoothed aggregation algebraic multigrid (AMG) preconditioned conjugate gradient is applied to construct the potentials for a given electric conductivity estimate and for constructing a first level BFGS preconditioner. Through the additional reuse of AMG operators and coarse grid solvers inversion time for large 3-D problems can be reduced further. We apply our new inversion method to synthetic survey data created by the resistivity profile representing the characteristics of subsurface fluid injection. We further test it on data obtained from a 2-D surface electrode survey on Heron Island, a small tropical island off the east coast of central Queensland, Australia.
HMC algorithm with multiple time scale integration and mass preconditioning
Urbach, C.; Jansen, K.; Shindler, A.; Wenger, U.
2006-01-01
We present a variant of the HMC algorithm with mass preconditioning (Hasenbusch acceleration) and multiple time scale integration. We have tested this variant for standard Wilson fermions at β=5.6 and at pion masses ranging from 380 to 680 MeV. We show that in this situation its performance is comparable to the recently proposed HMC variant with domain decomposition as preconditioner. We give an update of the "Berlin Wall" figure, comparing the performance of our variant of the HMC algorithm to other published performance data. Advantages of the HMC algorithm with mass preconditioning and multiple time scale integration are that it is straightforward to implement and can be used in combination with a wide variety of lattice Dirac operators.
Fourier domain preconditioned conjugate gradient algorithm for atmospheric tomography.
Yang, Qiang; Vogel, Curtis R; Ellerbroek, Brent L
2006-07-20
By 'atmospheric tomography' we mean the estimation of a layered atmospheric turbulence profile from measurements of the pupil-plane phase (or phase gradients) corresponding to several different guide star directions. We introduce what we believe to be a new Fourier domain preconditioned conjugate gradient (FD-PCG) algorithm for atmospheric tomography, and we compare its performance against an existing multigrid preconditioned conjugate gradient (MG-PCG) approach. Numerical results indicate that on conventional serial computers, FD-PCG is as accurate and robust as MG-PCG, but it is from one to two orders of magnitude faster for atmospheric tomography on 30 m class telescopes. Simulations are carried out for both natural guide stars and for a combination of finite-altitude laser guide stars and natural guide stars to resolve tip-tilt uncertainty.
PRECONDITIONS AND DETERMINING CAUSES OF THE SHADOW ECONOMY IN UKRAINE
Directory of Open Access Journals (Sweden)
Z. Varnalii
2014-03-01
Full Text Available The article analyzes the main processes that led to the high level of the economy shadowing. The historical aspects of the formation of the shadow economy in Ukraine are highlighted. The socio-economic aspects of the shadow economy of Ukraine causality are discussed. The theoretical contribution of foreign and domestic researchers on the preconditions of formation of the shadow economy in transition economies is studied. Theoretical perspective on the factors of the shadowing processes in the economy of Ukraine from the standpoint of modern scientific researches is analyzed. The paper also provides scientific vectors for further development of researches aimed at studying the causes and preconditions of the shadow economy.
Combined incomplete LU and strongly implicit procedure preconditioning
Energy Technology Data Exchange (ETDEWEB)
Meese, E.A. [Univ. of Trondheim (Norway)
1996-12-31
For the solution of large sparse linear systems of equations, the Krylov-subspace methods have gained great merit. Their efficiency are, however, largely dependent upon preconditioning of the equation-system. A family of matrix factorisations often used for preconditioning, is obtained from a truncated Gaussian elimination, ILU(p). Less common, supposedly due to it`s restriction to certain sparsity patterns, is factorisations generated by the strongly implicit procedure (SIP). The ideas from ILU(p) and SIP are used in this paper to construct a generalized strongly implicit procedure, applicable to matrices with any sparsity pattern. The new algorithm has been run on some test equations, and efficiency improvements over ILU(p) was found.
Remote Ischemic Preconditioning and Outcomes of Cardiac Surgery.
Hausenloy, DJ; Candilio, L; Evans, R; Ariti, C; Jenkins, DP; Kolvekar, S; Knight, R; Kunst, G; Laing, C; Nicholas, J; Pepper, J; Robertson, S; Xenou, M; Clayton, T; Yellon, DM
2015-01-01
: Whether remote ischemic preconditioning (transient ischemia and reperfusion of the arm) can improve clinical outcomes in patients undergoing coronary-artery bypass graft (CABG) surgery is not known. We investigated this question in a randomized trial. : We conducted a multicenter, sham-controlled trial involving adults at increased surgical risk who were undergoing on-pump CABG (with or without valve surgery) with blood cardioplegia. After anesthesia induction and before surgical incision, ...
Convergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithm
Liu, Lulu
2016-10-26
The multiplicative Schwarz preconditioned inexact Newton (MSPIN) algorithm, based on decomposition by field type rather than by subdomain, was recently introduced to improve the convergence of systems with unbalanced nonlinearities. This paper provides a convergence analysis of the MSPIN algorithm. Under reasonable assumptions, it is shown that MSPIN is locally convergent, and desired superlinear or even quadratic convergence can be obtained when the forcing terms are picked suitably.
Convergence Analysis for the Multiplicative Schwarz Preconditioned Inexact Newton Algorithm
Liu, Lulu; Keyes, David E.
2016-01-01
The multiplicative Schwarz preconditioned inexact Newton (MSPIN) algorithm, based on decomposition by field type rather than by subdomain, was recently introduced to improve the convergence of systems with unbalanced nonlinearities. This paper provides a convergence analysis of the MSPIN algorithm. Under reasonable assumptions, it is shown that MSPIN is locally convergent, and desired superlinear or even quadratic convergence can be obtained when the forcing terms are picked suitably.
Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
Czech Academy of Sciences Publication Activity Database
Rozložník, Miroslav; Simoncini, V.
2002-01-01
Roč. 24, č. 2 (2002), s. 368-391 ISSN 0895-4798 R&D Projects: GA ČR GA101/00/1035; GA ČR GA201/00/0080 Institutional research plan: AV0Z1030915 Keywords : saddle point problems * preconditioning * indefinite linear systems * finite precision arithmetic * conjugate gradients Subject RIV: BA - General Mathematics Impact factor: 0.753, year: 2002
Ischemic preconditioning enhances integrity of coronary endothelial tight junctions
International Nuclear Information System (INIS)
Li, Zhao; Jin, Zhu-Qiu
2012-01-01
Highlights: ► Cardiac tight junctions are present between coronary endothelial cells. ► Ischemic preconditioning preserves the structural and functional integrity of tight junctions. ► Myocardial edema is prevented in hearts subjected to ischemic preconditioning. ► Ischemic preconditioning enhances translocation of ZO-2 from cytosol to cytoskeleton. -- Abstract: Ischemic preconditioning (IPC) is one of the most effective procedures known to protect hearts against ischemia/reperfusion (IR) injury. Tight junction (TJ) barriers occur between coronary endothelial cells. TJs provide barrier function to maintain the homeostasis of the inner environment of tissues. However, the effect of IPC on the structure and function of cardiac TJs remains unknown. We tested the hypothesis that myocardial IR injury ruptures the structure of TJs and impairs endothelial permeability whereas IPC preserves the structural and functional integrity of TJs in the blood–heart barrier. Langendorff hearts from C57BL/6J mice were prepared and perfused with Krebs–Henseleit buffer. Cardiac function, creatine kinase release, and myocardial edema were measured. Cardiac TJ function was evaluated by measuring Evans blue-conjugated albumin (EBA) content in the extravascular compartment of hearts. Expression and translocation of zonula occludens (ZO)-2 in IR and IPC hearts were detected with Western blot. A subset of hearts was processed for the observation of ultra-structure of cardiac TJs with transmission electron microscopy. There were clear TJs between coronary endothelial cells of mouse hearts. IR caused the collapse of TJs whereas IPC sustained the structure of TJs. IR increased extravascular EBA content in the heart and myocardial edema but decreased the expression of ZO-2 in the cytoskeleton. IPC maintained the structure of TJs. Cardiac EBA content and edema were reduced in IPC hearts. IPC enhanced the translocation of ZO-2 from cytosol to cytoskeleton. In conclusion, TJs occur in
An Adaptive Multilevel Factorized Sparse Approximate Inverse Preconditioning
Czech Academy of Sciences Publication Activity Database
Kopal, Jiří; Rozložník, Miroslav; Tůma, Miroslav
2017-01-01
Roč. 113, November (2017), s. 19-24 ISSN 0965-9978 R&D Projects: GA ČR GA13-06684S Grant - others:GA MŠk(CZ) LL1202 Institutional support: RVO:67985807 Keywords : approximate inverse * Gram–Schmidt orthogonalization * incomplete factorization * multilevel methods * preconditioned conjugate gradient method Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 3.000, year: 2016
Efficient Preconditioning of Sequences of Nonsymmetric Linear Systems
Czech Academy of Sciences Publication Activity Database
Duintjer Tebbens, Jurjen; Tůma, Miroslav
2007-01-01
Roč. 29, č. 5 (2007), s. 1918-1941 ISSN 1064-8275 R&D Projects: GA AV ČR 1ET400300415; GA AV ČR KJB100300703 Institutional research plan: CEZ:AV0Z10300504 Keywords : preconditioned iterative methods * sparse matrices * sequences of linear algebraic systems * incomplete factorizations * factorization updates * Gauss–Jordan transformations * minimum spanning tree Subject RIV: BA - General Mathematics Impact factor: 1.784, year: 2007
Unified analysis of preconditioning methods for saddle point matrices
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe
2015-01-01
Roč. 22, č. 2 (2015), s. 233-253 ISSN 1070-5325 R&D Projects: GA MŠk ED1.1.00/02.0070 Institutional support: RVO:68145535 Keywords : saddle point problems * preconditioning * spectral properties Subject RIV: BA - General Mathematics Impact factor: 1.431, year: 2015 http://onlinelibrary.wiley.com/doi/10.1002/nla.1947/pdf
Remote ischaemic preconditioning and prevention of cerebral injury.
Rehni, Ashish K; Shri, Richa; Singh, Manjeet
2007-03-01
Bilateral carotid artery occlusion of 10 min followed by reperfusion for 24 hr was employed in present study to produce ischaemia and reperfusion induced cerebral injury in mice. Cerebral infarct size was measured using triphenyltetrazolium chloride staining. Short-term memory was evaluated using elevated plus maze. Inclined beam walking test was employed to assess motor incoordination. Bilateral carotid artery occlusion followed by reperfusion produced cerebral infarction and impaired short-term memory, motor co-ordination and lateral push response. A preceding episode of mesenteric artery occlusion for 15 min and reperfusion of 15 min (remote mesenteric ischaemic preconditioning) prevented markedly ischaemia-reperfusion-induced cerebral injury measured in terms of infarct size, loss of short-term memory, motor coordination and lateral push response. Glibenclamide (5 mg/kg, iv) a KATP channel blocker and caffeine (7 mg/kg, iv) an adenosine receptor blocker attenuated the neuroprotective effect of remote mesenteric ischaemic preconditioning. It may be concluded that neuroprotective effect of remote mesenteric ischaemic preconditioning may be due to activation of adenosine receptors and consequent activation of KATP channels in mice.
Li, Bingyi; Chen, Liang; Yu, Wenyue; Xie, Yizhuang; Bian, Mingming; Zhang, Qingjun; Pang, Long
2018-01-01
With the development of satellite load technology and very large-scale integrated (VLSI) circuit technology, on-board real-time synthetic aperture radar (SAR) imaging systems have facilitated rapid response to disasters. A key goal of the on-board SAR imaging system design is to achieve high real-time processing performance under severe size, weight, and power consumption constraints. This paper presents a multi-node prototype system for real-time SAR imaging processing. We decompose the commonly used chirp scaling (CS) SAR imaging algorithm into two parts according to the computing features. The linearization and logic-memory optimum allocation methods are adopted to realize the nonlinear part in a reconfigurable structure, and the two-part bandwidth balance method is used to realize the linear part. Thus, float-point SAR imaging processing can be integrated into a single Field Programmable Gate Array (FPGA) chip instead of relying on distributed technologies. A single-processing node requires 10.6 s and consumes 17 W to focus on 25-km swath width, 5-m resolution stripmap SAR raw data with a granularity of 16,384 × 16,384. The design methodology of the multi-FPGA parallel accelerating system under the real-time principle is introduced. As a proof of concept, a prototype with four processing nodes and one master node is implemented using a Xilinx xc6vlx315t FPGA. The weight and volume of one single machine are 10 kg and 32 cm × 24 cm × 20 cm, respectively, and the power consumption is under 100 W. The real-time performance of the proposed design is demonstrated on Chinese Gaofen-3 stripmap continuous imaging. PMID:29495637
Yang, Chen; Li, Bingyi; Chen, Liang; Wei, Chunpeng; Xie, Yizhuang; Chen, He; Yu, Wenyue
2017-06-24
With the development of satellite load technology and very large scale integrated (VLSI) circuit technology, onboard real-time synthetic aperture radar (SAR) imaging systems have become a solution for allowing rapid response to disasters. A key goal of the onboard SAR imaging system design is to achieve high real-time processing performance with severe size, weight, and power consumption constraints. In this paper, we analyse the computational burden of the commonly used chirp scaling (CS) SAR imaging algorithm. To reduce the system hardware cost, we propose a partial fixed-point processing scheme. The fast Fourier transform (FFT), which is the most computation-sensitive operation in the CS algorithm, is processed with fixed-point, while other operations are processed with single precision floating-point. With the proposed fixed-point processing error propagation model, the fixed-point processing word length is determined. The fidelity and accuracy relative to conventional ground-based software processors is verified by evaluating both the point target imaging quality and the actual scene imaging quality. As a proof of concept, a field- programmable gate array-application-specific integrated circuit (FPGA-ASIC) hybrid heterogeneous parallel accelerating architecture is designed and realized. The customized fixed-point FFT is implemented using the 130 nm complementary metal oxide semiconductor (CMOS) technology as a co-processor of the Xilinx xc6vlx760t FPGA. A single processing board requires 12 s and consumes 21 W to focus a 50-km swath width, 5-m resolution stripmap SAR raw data with a granularity of 16,384 × 16,384.
Directory of Open Access Journals (Sweden)
Chen Yang
2017-06-01
Full Text Available With the development of satellite load technology and very large scale integrated (VLSI circuit technology, onboard real-time synthetic aperture radar (SAR imaging systems have become a solution for allowing rapid response to disasters. A key goal of the onboard SAR imaging system design is to achieve high real-time processing performance with severe size, weight, and power consumption constraints. In this paper, we analyse the computational burden of the commonly used chirp scaling (CS SAR imaging algorithm. To reduce the system hardware cost, we propose a partial fixed-point processing scheme. The fast Fourier transform (FFT, which is the most computation-sensitive operation in the CS algorithm, is processed with fixed-point, while other operations are processed with single precision floating-point. With the proposed fixed-point processing error propagation model, the fixed-point processing word length is determined. The fidelity and accuracy relative to conventional ground-based software processors is verified by evaluating both the point target imaging quality and the actual scene imaging quality. As a proof of concept, a field- programmable gate array−application-specific integrated circuit (FPGA-ASIC hybrid heterogeneous parallel accelerating architecture is designed and realized. The customized fixed-point FFT is implemented using the 130 nm complementary metal oxide semiconductor (CMOS technology as a co-processor of the Xilinx xc6vlx760t FPGA. A single processing board requires 12 s and consumes 21 W to focus a 50-km swath width, 5-m resolution stripmap SAR raw data with a granularity of 16,384 × 16,384.
Energy Technology Data Exchange (ETDEWEB)
Alleon, G. [EADS-CCR, 31 - Blagnac (France); Carpentieri, B.; Du, I.S.; Giraud, L.; Langou, J.; Martin, E. [Cerfacs, 31 - Toulouse (France)
2003-07-01
The boundary element method has become a popular tool for the solution of Maxwell's equations in electromagnetism. It discretizes only the surface of the radiating object and gives rise to linear systems that are smaller in size compared to those arising from finite element or finite difference discretizations. However, these systems are prohibitively demanding in terms of memory for direct methods and challenging to solve by iterative methods. In this paper we address the iterative solution via preconditioned Krylov methods of electromagnetic scattering problems expressed in an integral formulation, with main focus on the design of the pre-conditioner. We consider an approximate inverse method based on the Frobenius-norm minimization with a pattern prescribed in advance. The pre-conditioner is constructed from a sparse approximation of the dense coefficient matrix, and the patterns both for the pre-conditioner and for the coefficient matrix are computed a priori using geometric information from the mesh. We describe the implementation of the approximate inverse in an out-of-core parallel code that uses multipole techniques for the matrix-vector products, and show results on the numerical scalability of our method on systems of size up to one million unknowns. We propose an embedded iterative scheme based on the GMRES method and combined with multipole techniques, aimed at improving the robustness of the approximate inverse for large problems. We prove by numerical experiments that the proposed scheme enables the solution of very large and difficult problems efficiently at reduced computational and memory cost. Finally we perform a preliminary study on a spectral two-level pre-conditioner to enhance the robustness of our method. This numerical technique exploits spectral information of the preconditioned systems to build a low rank-update of the pre-conditioner. (authors)
International Nuclear Information System (INIS)
Alleon, G.; Carpentieri, B.; Du, I.S.; Giraud, L.; Langou, J.; Martin, E.
2003-01-01
The boundary element method has become a popular tool for the solution of Maxwell's equations in electromagnetism. It discretizes only the surface of the radiating object and gives rise to linear systems that are smaller in size compared to those arising from finite element or finite difference discretizations. However, these systems are prohibitively demanding in terms of memory for direct methods and challenging to solve by iterative methods. In this paper we address the iterative solution via preconditioned Krylov methods of electromagnetic scattering problems expressed in an integral formulation, with main focus on the design of the pre-conditioner. We consider an approximate inverse method based on the Frobenius-norm minimization with a pattern prescribed in advance. The pre-conditioner is constructed from a sparse approximation of the dense coefficient matrix, and the patterns both for the pre-conditioner and for the coefficient matrix are computed a priori using geometric information from the mesh. We describe the implementation of the approximate inverse in an out-of-core parallel code that uses multipole techniques for the matrix-vector products, and show results on the numerical scalability of our method on systems of size up to one million unknowns. We propose an embedded iterative scheme based on the GMRES method and combined with multipole techniques, aimed at improving the robustness of the approximate inverse for large problems. We prove by numerical experiments that the proposed scheme enables the solution of very large and difficult problems efficiently at reduced computational and memory cost. Finally we perform a preliminary study on a spectral two-level pre-conditioner to enhance the robustness of our method. This numerical technique exploits spectral information of the preconditioned systems to build a low rank-update of the pre-conditioner. (authors)
International Nuclear Information System (INIS)
Heilmaier, C.; Sutter, R.; Lutz, A.M.; Willmann, J.K.; Seifert, B.
2008-01-01
Purpose: to retrospectively evaluate the performance of breath-hold contrast-enhanced 3D dynamic parallel gradient echo MRI (pMRT) for the characterization of focal liver lesions (standard of reference: histology) and for the analysis of hepatic vasculature (standard of reference: contrast-enhanced 64-detector row computed tomography; MSCT) in a single MRI session. Materials and method: two blinded readers independently analyzed preoperative pMRT data sets (1.5T-MRT) of 45 patients (23 men, 22 women; 28 - 77 years, average age, 48 years) with a total of 68 focal liver lesions with regard to image quality of hepatic arteries, portal and hepatic veins, presence of variant anatomy of the hepatic vasculature, as well as presence of portal vein thrombosis and hemodynamically significant arterial stenosis. In addition, both readers were asked to identify and characterize focal liver lesions. Imaging parameters of pMRT were: TR/TE/matrix/slice thickness/acquisition time: 3.1 ms/1.4 ms/384 x 224/4 mm/15 - 17 s. MSCT was performed with a pitch of 1.2, an effective slice thickness of 1 mm and a matrix of 512 x 512. Results: based on histology, the 68 liver lesions were found to be 42 hepatocellular carcinomas (HCC), 20 metastases, 3 cholangiocellular carcinomas (CCC) as well as 1 dysplastic nodule, 1 focal nodular hyperplasia (FNH) and 1 atypical hemangioma. Overall, the diagnostic accuracy was high for both readers (91 - 100%) in the characterization of these focal liver lesions with an excellent interobserver agreement (κ-values of 0.89 [metastases], 0.97 [HCC] and 1 [CCC]). On average, the image quality of all vessels under consideration was rated good or excellent in 89% (reader 1) and 90% (reader 2). Anatomical variants of the hepatic arteries, hepatic veins and portal vein as well as thrombosis of the portal vein were reliably detected by pMRT. Significant arterial stenosis was found with a sensitivity between 86% and 100% and an excellent interobserver agreement (κ
International Nuclear Information System (INIS)
Ito, Daisuke; Kikura, Hiroshige; Aritomi, Masanori
2009-01-01
A novel two-phase flow measuring technique based on local electrical conductivity measurement was developed for clarifications of three-dimensional flow structure in gas-liquid two-phase flow in a narrow channel. The measuring method applies the principle of conventional wire-mesh tomography, which can measure the instantaneous void fraction distributions in a cross-section of a flow channel. In this technique, the electrodes are fixed on the inside of the walls facing each other, and the local void fractions were obtained by the electrical conductivity measurement between electrodes arranged on each wall. Therefore, the flow structure and the bubble behavior can be investigated by three-dimensional void fraction distributions in the channel with narrow gap. In this paper, a micro Wire-Mesh Sensor (μWMS) which has the gap of 3 mm was developed, and the instantaneous void fraction distributions were measured. From the measured distributions, three-dimensional bubble distributions were reconstructed, and bubble volumes and bubble velocities were estimated. (author)
International Nuclear Information System (INIS)
Yan Yongbin; Luo Xuechun; Zhang Riqing; Wang Xiaoyin; Zuo Lin; Liu Wei
2000-01-01
ischemic preconditioning (IPC) will protect the heart from the damage caused by a subsequent long ischemia period. 31 P spectra of isolated perfused rat heart measured by the nuclear magnetic resonance (NMR) surface coil technique can be used to continually, dynamically and noninvasively obtain metabolism information. This paper explores the IPC mechanisms by NMR. This study shows that IPC has no effect on enhancing the ATP and PCr levels during reperfusion but makes significantly slows and smooths the changes of intracellular pH and ATP during ischemia periods. The ATP and PCr recovery rate of the IPC group after ischemia is significantly higher than that of the control group. In conclusion, the above results support that IPC can protect the rat heart by reducing damage during the ischemia period
Simulation of neutron transport equation using parallel Monte Carlo for deep penetration problems
International Nuclear Information System (INIS)
Bekar, K. K.; Tombakoglu, M.; Soekmen, C. N.
2001-01-01
Neutron transport equation is simulated using parallel Monte Carlo method for deep penetration neutron transport problem. Monte Carlo simulation is parallelized by using three different techniques; direct parallelization, domain decomposition and domain decomposition with load balancing, which are used with PVM (Parallel Virtual Machine) software on LAN (Local Area Network). The results of parallel simulation are given for various model problems. The performances of the parallelization techniques are compared with each other. Moreover, the effects of variance reduction techniques on parallelization are discussed
International Nuclear Information System (INIS)
Wang Shuxia
2001-01-01
Ischemic preconditioning is the intrinsic and most potently myocardial protection. Its mechanism is the foundation of rational therapeutic application. Nowadays there are some theories about delayed phase of preconditioning such as nitric oxide hypothesis, free radical mechanisms, protective protein synthesis and opening of ATP-sensitive potassium channels. By incorporation 3 H-leucine, using liquid scintillation counter, the authors know there was protective protein synthesis during preconditioning. SPECT could study the characteristics of preconditioned myocardium in vivo, and PET might further show the metabolism, energy consumption and its relationship to myocardium dysfunction
Preconditioned iterative methods for space-time fractional advection-diffusion equations
Zhao, Zhi; Jin, Xiao-Qing; Lin, Matthew M.
2016-08-01
In this paper, we propose practical numerical methods for solving a class of initial-boundary value problems of space-time fractional advection-diffusion equations. First, we propose an implicit method based on two-sided Grünwald formulae and discuss its stability and consistency. Then, we develop the preconditioned generalized minimal residual (preconditioned GMRES) method and preconditioned conjugate gradient normal residual (preconditioned CGNR) method with easily constructed preconditioners. Importantly, because resulting systems are Toeplitz-like, fast Fourier transform can be applied to significantly reduce the computational cost. We perform numerical experiments to demonstrate the efficiency of our preconditioners, even in cases with variable coefficients.
Preconditioned alternating projection algorithms for maximum a posteriori ECT reconstruction
International Nuclear Information System (INIS)
Krol, Andrzej; Li, Si; Shen, Lixin; Xu, Yuesheng
2012-01-01
We propose a preconditioned alternating projection algorithm (PAPA) for solving the maximum a posteriori (MAP) emission computed tomography (ECT) reconstruction problem. Specifically, we formulate the reconstruction problem as a constrained convex optimization problem with the total variation (TV) regularization. We then characterize the solution of the constrained convex optimization problem and show that it satisfies a system of fixed-point equations defined in terms of two proximity operators raised from the convex functions that define the TV-norm and the constraint involved in the problem. The characterization (of the solution) via the proximity operators that define two projection operators naturally leads to an alternating projection algorithm for finding the solution. For efficient numerical computation, we introduce to the alternating projection algorithm a preconditioning matrix (the EM-preconditioner) for the dense system matrix involved in the optimization problem. We prove theoretically convergence of the PAPA. In numerical experiments, performance of our algorithms, with an appropriately selected preconditioning matrix, is compared with performance of the conventional MAP expectation-maximization (MAP-EM) algorithm with TV regularizer (EM-TV) and that of the recently developed nested EM-TV algorithm for ECT reconstruction. Based on the numerical experiments performed in this work, we observe that the alternating projection algorithm with the EM-preconditioner outperforms significantly the EM-TV in all aspects including the convergence speed, the noise in the reconstructed images and the image quality. It also outperforms the nested EM-TV in the convergence speed while providing comparable image quality. (paper)
Ischemic preconditioning enhances integrity of coronary endothelial tight junctions
Energy Technology Data Exchange (ETDEWEB)
Li, Zhao [Department of Pharmaceutical Sciences, College of Pharmacy, South Dakota State University, Brookings, SD 57007 (United States); Jin, Zhu-Qiu, E-mail: zhu-qiu.jin@sdstate.edu [Department of Pharmaceutical Sciences, College of Pharmacy, South Dakota State University, Brookings, SD 57007 (United States)
2012-08-31
Highlights: Black-Right-Pointing-Pointer Cardiac tight junctions are present between coronary endothelial cells. Black-Right-Pointing-Pointer Ischemic preconditioning preserves the structural and functional integrity of tight junctions. Black-Right-Pointing-Pointer Myocardial edema is prevented in hearts subjected to ischemic preconditioning. Black-Right-Pointing-Pointer Ischemic preconditioning enhances translocation of ZO-2 from cytosol to cytoskeleton. -- Abstract: Ischemic preconditioning (IPC) is one of the most effective procedures known to protect hearts against ischemia/reperfusion (IR) injury. Tight junction (TJ) barriers occur between coronary endothelial cells. TJs provide barrier function to maintain the homeostasis of the inner environment of tissues. However, the effect of IPC on the structure and function of cardiac TJs remains unknown. We tested the hypothesis that myocardial IR injury ruptures the structure of TJs and impairs endothelial permeability whereas IPC preserves the structural and functional integrity of TJs in the blood-heart barrier. Langendorff hearts from C57BL/6J mice were prepared and perfused with Krebs-Henseleit buffer. Cardiac function, creatine kinase release, and myocardial edema were measured. Cardiac TJ function was evaluated by measuring Evans blue-conjugated albumin (EBA) content in the extravascular compartment of hearts. Expression and translocation of zonula occludens (ZO)-2 in IR and IPC hearts were detected with Western blot. A subset of hearts was processed for the observation of ultra-structure of cardiac TJs with transmission electron microscopy. There were clear TJs between coronary endothelial cells of mouse hearts. IR caused the collapse of TJs whereas IPC sustained the structure of TJs. IR increased extravascular EBA content in the heart and myocardial edema but decreased the expression of ZO-2 in the cytoskeleton. IPC maintained the structure of TJs. Cardiac EBA content and edema were reduced in IPC hearts. IPC
Incomplete block factorization preconditioning for indefinite elliptic problems
Energy Technology Data Exchange (ETDEWEB)
Guo, Chun-Hua [Univ. of Calgary, Alberta (Canada)
1996-12-31
The application of the finite difference method to approximate the solution of an indefinite elliptic problem produces a linear system whose coefficient matrix is block tridiagonal and symmetric indefinite. Such a linear system can be solved efficiently by a conjugate residual method, particularly when combined with a good preconditioner. We show that specific incomplete block factorization exists for the indefinite matrix if the mesh size is reasonably small. And this factorization can serve as an efficient preconditioner. Some efforts are made to estimate the eigenvalues of the preconditioned matrix. Numerical results are also given.
International Nuclear Information System (INIS)
Chiueh, C.C.; Andoh, Tsugunobu; Chock, P. Boon
2005-01-01
Hormesis, a stress tolerance, can be induced by ischemic preconditioning stress. In addition to preconditioning, it may be induced by other means, such as gas anesthetics. Preconditioning mechanisms, which may be mediated by reprogramming survival genes and proteins, are obscure. A known neurotoxicant, 1-Methyl-4-phenyl-1,2,3,6-tetrahydropyridine (MPTP), causes less neurotoxicity in the mice that are preconditioned. Pharmacological evidences suggest that the signaling pathway of ·NO-cGMP-PKG (protein kinase G) may mediate preconditioning phenomenon. We developed a human SH-SY5Y cell model for investigating · NO-mediated signaling pathway, gene regulation, and protein expression following a sublethal preconditioning stress caused by a brief 2-h serum deprivation. Preconditioned human SH-SY5Y cells are more resistant against severe oxidative stress and apoptosis caused by lethal serum deprivation and 1-mehtyl-4-phenylpyridinium (MPP + ). Both sublethal and lethal oxidative stress caused by serum withdrawal increased neuronal nitric oxide synthase (nNOS/NOS1) expression and · NO levels to a similar extent. In addition to free radical scavengers, inhibition of nNOS, guanylyl cyclase, and PKG blocks hormesis induced by preconditioning. S-nitrosothiols and 6-Br-cGMP produce a cytoprotection mimicking the action of preconditioning tolerance. There are two distinct cGMP-mediated survival pathways: (i) the up-regulation of a redox protein thioredoxin (Trx) for elevating mitochondrial levels of antioxidant protein Mn superoxide dismutase (MnSOD) and antiapoptotic protein Bcl-2, and (ii) the activation of mitochondrial ATP-sensitive potassium channels [K(ATP)]. Preconditioning induction of Trx increased tolerance against MPP + , which was blocked by Trx mRNA antisense oligonucleotide and Trx reductase inhibitor. It is concluded that Trx plays a pivotal role in · NO-dependent preconditioning hormesis against MPTP/MPP +
Writing parallel programs that work
CERN. Geneva
2012-01-01
Serial algorithms typically run inefficiently on parallel machines. This may sound like an obvious statement, but it is the root cause of why parallel programming is considered to be difficult. The current state of the computer industry is still that almost all programs in existence are serial. This talk will describe the techniques used in the Intel Parallel Studio to provide a developer with the tools necessary to understand the behaviors and limitations of the existing serial programs. Once the limitations are known the developer can refactor the algorithms and reanalyze the resulting programs with the tools in the Intel Parallel Studio to create parallel programs that work. About the speaker Paul Petersen is a Sr. Principal Engineer in the Software and Solutions Group (SSG) at Intel. He received a Ph.D. degree in Computer Science from the University of Illinois in 1993. After UIUC, he was employed at Kuck and Associates, Inc. (KAI) working on auto-parallelizing compiler (KAP), and was involved in th...
Block Preconditioning to Enable Physics-Compatible Implicit Multifluid Plasma Simulations
Phillips, Edward; Shadid, John; Cyr, Eric; Miller, Sean
2017-10-01
Multifluid plasma simulations involve large systems of partial differential equations in which many time-scales ranging over many orders of magnitude arise. Since the fastest of these time-scales may set a restrictively small time-step limit for explicit methods, the use of implicit or implicit-explicit time integrators can be more tractable for obtaining dynamics at time-scales of interest. Furthermore, to enforce properties such as charge conservation and divergence-free magnetic field, mixed discretizations using volume, nodal, edge-based, and face-based degrees of freedom are often employed in some form. Together with the presence of stiff modes due to integrating over fast time-scales, the mixed discretization makes the required linear solves for implicit methods particularly difficult for black box and monolithic solvers. This work presents a block preconditioning strategy for multifluid plasma systems that segregates the linear system based on discretization type and approximates off-diagonal coupling in block diagonal Schur complement operators. By employing multilevel methods for the block diagonal subsolves, this strategy yields algorithmic and parallel scalability which we demonstrate on a range of problems.
International Nuclear Information System (INIS)
Belliard, M.; Grandotto, M.
2003-01-01
In the framework of the two-phase fluid simulations of the steam generators of pressurized water nuclear reactors, we present in this paper a geometric version of a pseudo-Full MultiGrid (pseudo- FMG) Full Approximation Storage (FAS) preconditioning of balance equations in the GENEPI code. In our application, the 3D steady state flow is reached by a transient computation using a semi-implicit fractional step algorithm for the averaged two-phase mixture balance equations (mass, momentum and energy for the secondary flow). Our application, running on workstation clusters, is based on a CEA code-linker and the PVM package. The difficulties to apply the geometric FAS multigrid method to the momentum and mass balance equations are addressed. The use of a sequential pseudo-FMG FAS twogrid method for both energy and mass/momentum balance equations, using dynamic multigrid cycles, leads to perceptibly improvements in the computation convergences. An original parallel red-black pseudo-FMG FAS three-grid algorithm is presented too. The numerical tests (steam generator mockup simulations) underline the sizable increase in speed of convergence of the computations, essentially for the ones involving a large number of freedom degrees (about 100 thousand cells). The two-phase mixture balance equation residuals are quickly reduced: the reached speed-up stands between 2 and 3 following the number of grids. The effects on the convergence behavior of the numerical parameters are investigated
Preconditioning 2D Integer Data for Fast Convex Hull Computations.
Cadenas, José Oswaldo; Megson, Graham M; Luengo Hendriks, Cris L
2016-01-01
In order to accelerate computing the convex hull on a set of n points, a heuristic procedure is often applied to reduce the number of points to a set of s points, s ≤ n, which also contains the same hull. We present an algorithm to precondition 2D data with integer coordinates bounded by a box of size p × q before building a 2D convex hull, with three distinct advantages. First, we prove that under the condition min(p, q) ≤ n the algorithm executes in time within O(n); second, no explicit sorting of data is required; and third, the reduced set of s points forms a simple polygonal chain and thus can be directly pipelined into an O(n) time convex hull algorithm. This paper empirically evaluates and quantifies the speed up gained by preconditioning a set of points by a method based on the proposed algorithm before using common convex hull algorithms to build the final hull. A speedup factor of at least four is consistently found from experiments on various datasets when the condition min(p, q) ≤ n holds; the smaller the ratio min(p, q)/n is in the dataset, the greater the speedup factor achieved.
Moving force identification based on modified preconditioned conjugate gradient method
Chen, Zhen; Chan, Tommy H. T.; Nguyen, Andy
2018-06-01
This paper develops a modified preconditioned conjugate gradient (M-PCG) method for moving force identification (MFI) by improving the conjugate gradient (CG) and preconditioned conjugate gradient (PCG) methods with a modified Gram-Schmidt algorithm. The method aims to obtain more accurate and more efficient identification results from the responses of bridge deck caused by vehicles passing by, which are known to be sensitive to ill-posed problems that exist in the inverse problem. A simply supported beam model with biaxial time-varying forces is used to generate numerical simulations with various analysis scenarios to assess the effectiveness of the method. Evaluation results show that regularization matrix L and number of iterations j are very important influence factors to identification accuracy and noise immunity of M-PCG. Compared with the conventional counterpart SVD embedded in the time domain method (TDM) and the standard form of CG, the M-PCG with proper regularization matrix has many advantages such as better adaptability and more robust to ill-posed problems. More importantly, it is shown that the average optimal numbers of iterations of M-PCG can be reduced by more than 70% compared with PCG and this apparently makes M-PCG a preferred choice for field MFI applications.
Bilirubin nanoparticle preconditioning protects against hepatic ischemia-reperfusion injury.
Kim, Jin Yong; Lee, Dong Yun; Kang, Sukmo; Miao, Wenjun; Kim, Hyungjun; Lee, Yonghyun; Jon, Sangyong
2017-07-01
Hepatic ischemia-reperfusion injury (IRI) remains a major concern in liver transplantation and resection, despite continuing efforts to prevent it. Accumulating evidence suggests that bilirubin possesses antioxidant, anti-inflammatory and anti-apoptotic properties. However, despite obvious potential health benefits of bilirubin, its clinical applications are limited by its poor solubility. We recently developed bilirubin nanoparticles (BRNPs) consisting of polyethylene glycol (PEG)-conjugated bilirubin. Here, we sought to investigate whether BRNPs protect against IRI in the liver by preventing oxidative stress. BRNPs exerted potent antioxidant and anti-apoptotic activity in primary hepatocytes exposed to hydrogen peroxide, a precursor of reactive oxygen species (ROS). In a model of hepatic IRI in mice, BRNP preconditioning exerted profound protective effects against hepatocellular injury by reducing oxidative stress, pro-inflammatory cytokine production, and recruitment of neutrophils. They also preferentially accumulated in IRI-induced inflammatory lesions. Collectively, our findings indicate that BRNP preconditioning provides a simple and safe approach that can be easily monitored in the blood like endogenous bilirubin, and could be a promising strategy to protect against IRI in a clinical setting. Copyright © 2017 Elsevier Ltd. All rights reserved.
Stress preconditioning of spreading depression in the locust CNS.
Directory of Open Access Journals (Sweden)
Corinne I Rodgers
Full Text Available Cortical spreading depression (CSD is closely associated with important pathologies including stroke, seizures and migraine. The mechanisms underlying SD in its various forms are still incompletely understood. Here we describe SD-like events in an invertebrate model, the ventilatory central pattern generator (CPG of locusts. Using K(+ -sensitive microelectrodes, we measured extracellular K(+ concentration ([K(+](o in the metathoracic neuropile of the CPG while monitoring CPG output electromyographically from muscle 161 in the second abdominal segment to investigate the role K(+ in failure of neural circuit operation induced by various stressors. Failure of ventilation in response to different stressors (hyperthermia, anoxia, ATP depletion, Na(+/K(+ ATPase impairment, K(+ injection was associated with a disturbance of CNS ion homeostasis that shares the characteristics of CSD and SD-like events in vertebrates. Hyperthermic failure was preconditioned by prior heat shock (3 h, 45 degrees C and induced-thermotolerance was associated with an increase in the rate of clearance of extracellular K(+ that was not linked to changes in ATP levels or total Na(+/K(+ ATPase activity. Our findings suggest that SD-like events in locusts are adaptive to terminate neural network operation and conserve energy during stress and that they can be preconditioned by experience. We propose that they share mechanisms with CSD in mammals suggesting a common evolutionary origin.
Refinement of Parallel and Reactive Programs
Back, R. J. R.
1992-01-01
We show how to apply the refinement calculus to stepwise refinement of parallel and reactive programs. We use action systems as our basic program model. Action systems are sequential programs which can be implemented in a parallel fashion. Hence refinement calculus methods, originally developed for sequential programs, carry over to the derivation of parallel programs. Refinement of reactive programs is handled by data refinement techniques originally developed for the sequential refinement c...
Ketamine, but not S(+)-ketamine, blocks ischemic preconditioning in rabbit hearts in vivo
Müllenheim, J.; Frässdorf, J.; Preckel, B.; Thämer, V.; Schlack, W.
2001-01-01
BACKGROUND: Ketamine blocks KATP channels in isolated cells and abolishes the cardioprotective effect of ischemic preconditioning in vitro. The authors investigated the effects of ketamine and S(+)-ketamine on ischemic preconditioning in the rabbit heart in vivo. METHODS: In 46
Two-level preconditioned conjugate gradient methods with applications to bubbly flow problems
Tang, J.M.
2008-01-01
The Preconditioned Conjugate Gradient (PCG) method is one of the most popular iterative methods for solving large linear systems with a symmetric and positive semi-definite coefficient matrix. However, if the preconditioned coefficient matrix is ill-conditioned, the convergence of the PCG method
Sensory Preconditioning in Newborn Rabbits: From Common to Distinct Odor Memories
Coureaud, Gerard; Tourat, Audrey; Ferreira, Guillaume
2013-01-01
This study evaluated whether olfactory preconditioning is functional in newborn rabbits and based on joined or independent memory of odorants. First, after exposure to odorants A+B, the conditioning of A led to high responsiveness to odorant B. Second, responsiveness to B persisted after amnesia of A. Third, preconditioning was also functional…
Advanced parallel processing with supercomputer architectures
International Nuclear Information System (INIS)
Hwang, K.
1987-01-01
This paper investigates advanced parallel processing techniques and innovative hardware/software architectures that can be applied to boost the performance of supercomputers. Critical issues on architectural choices, parallel languages, compiling techniques, resource management, concurrency control, programming environment, parallel algorithms, and performance enhancement methods are examined and the best answers are presented. The authors cover advanced processing techniques suitable for supercomputers, high-end mainframes, minisupers, and array processors. The coverage emphasizes vectorization, multitasking, multiprocessing, and distributed computing. In order to achieve these operation modes, parallel languages, smart compilers, synchronization mechanisms, load balancing methods, mapping parallel algorithms, operating system functions, application library, and multidiscipline interactions are investigated to ensure high performance. At the end, they assess the potentials of optical and neural technologies for developing future supercomputers
Morse, H Stephen
1994-01-01
Practical Parallel Computing provides information pertinent to the fundamental aspects of high-performance parallel processing. This book discusses the development of parallel applications on a variety of equipment.Organized into three parts encompassing 12 chapters, this book begins with an overview of the technology trends that converge to favor massively parallel hardware over traditional mainframes and vector machines. This text then gives a tutorial introduction to parallel hardware architectures. Other chapters provide worked-out examples of programs using several parallel languages. Thi
Akl, Selim G
1985-01-01
Parallel Sorting Algorithms explains how to use parallel algorithms to sort a sequence of items on a variety of parallel computers. The book reviews the sorting problem, the parallel models of computation, parallel algorithms, and the lower bounds on the parallel sorting problems. The text also presents twenty different algorithms, such as linear arrays, mesh-connected computers, cube-connected computers. Another example where algorithm can be applied is on the shared-memory SIMD (single instruction stream multiple data stream) computers in which the whole sequence to be sorted can fit in the
Murni, Bustamam, A.; Ernastuti, Handhika, T.; Kerami, D.
2017-07-01
Calculation of the matrix-vector multiplication in the real-world problems often involves large matrix with arbitrary size. Therefore, parallelization is needed to speed up the calculation process that usually takes a long time. Graph partitioning techniques that have been discussed in the previous studies cannot be used to complete the parallelized calculation of matrix-vector multiplication with arbitrary size. This is due to the assumption of graph partitioning techniques that can only solve the square and symmetric matrix. Hypergraph partitioning techniques will overcome the shortcomings of the graph partitioning technique. This paper addresses the efficient parallelization of matrix-vector multiplication through hypergraph partitioning techniques using CUDA GPU-based parallel computing. CUDA (compute unified device architecture) is a parallel computing platform and programming model that was created by NVIDIA and implemented by the GPU (graphics processing unit).
Parallelization of TMVA Machine Learning Algorithms
Hajili, Mammad
2017-01-01
This report reflects my work on Parallelization of TMVA Machine Learning Algorithms integrated to ROOT Data Analysis Framework during summer internship at CERN. The report consists of 4 impor- tant part - data set used in training and validation, algorithms that multiprocessing applied on them, parallelization techniques and re- sults of execution time changes due to number of workers.
Parallel fuzzy connected image segmentation on GPU
Zhuge, Ying; Cao, Yong; Udupa, Jayaram K.; Miller, Robert W.
2011-01-01
Purpose: Image segmentation techniques using fuzzy connectedness (FC) principles have shown their effectiveness in segmenting a variety of objects in several large applications. However, one challenge in these algorithms has been their excessive computational requirements when processing large image datasets. Nowadays, commodity graphics hardware provides a highly parallel computing environment. In this paper, the authors present a parallel fuzzy connected image segmentation algorithm impleme...
Effects Of Ischemic Preconditioning On The Renal Ischemia- Reperfusion Injury
Directory of Open Access Journals (Sweden)
Anyamanesh S
2003-07-01
Full Text Available During kidney and other organ transplantation, the organ to be transplanted, must inevitably remain out of the body with little or no blood perfusion at all for a long period of time (ischemia. These events have been suggested to cause the formation of oxygen- derived free radicals (OFR. Reperfusion (reintroduction of blood flow will further exacerbate the initial damage caused by the ischemic insult and may result in the production of free radicals. The aim of this study was to investigate whether induction of brief periods of renal artery occlusion (ischemic pre¬conditioning, IPC can provide protection from the effects of a subsequent period of ischemia and reperfusion (IR in the rat kidney."nMaterials and Methods: In this regard, 28 white, male rats were randomly and equally divided into four groups: Control (sham- operated, IPC alone, IR alone (30 min ischemia followed by 10 min reperfusion, and IPC- IR. Preconditioning involved the sequential clamping of the right renal artery for 5 min and declamping for 5 min for a total of 3 cycles. To demonstrate the effectiveness of IPC regimen, vitamin E as an endogenous antioxidant and an index of lipid peroxidation was measured by HPLC after its extraction from right renal venous plasma and right renal tissue."nResults: Results of this study showed that the amount of vitamin E of renal tissue and venous plasma in the IR group had a significant decrease when compared to the control group (P< 0.0001. Whereas the amount of this vitamin in both renal tissue and venous plasma of the IPC- IR group was significantly higher than that in the IR group (P< 0.0001, but did not show any significant difference with the control group."nConclusion: In this study, preconditioning method prevented the reduction of the endogenous antioxidant (Vit. E in encountering the following sustained ischemic insult. Therefore, we suggest that ischemic preconditioning can be used to protect the Vit. E level of kidney from its
Fox, Geoffrey C; Messina, Guiseppe C
2014-01-01
A clear illustration of how parallel computers can be successfully appliedto large-scale scientific computations. This book demonstrates how avariety of applications in physics, biology, mathematics and other scienceswere implemented on real parallel computers to produce new scientificresults. It investigates issues of fine-grained parallelism relevant forfuture supercomputers with particular emphasis on hypercube architecture. The authors describe how they used an experimental approach to configuredifferent massively parallel machines, design and implement basic systemsoftware, and develop
Programming massively parallel processors a hands-on approach
Kirk, David B
2010-01-01
Programming Massively Parallel Processors discusses basic concepts about parallel programming and GPU architecture. ""Massively parallel"" refers to the use of a large number of processors to perform a set of computations in a coordinated parallel way. The book details various techniques for constructing parallel programs. It also discusses the development process, performance level, floating-point format, parallel patterns, and dynamic parallelism. The book serves as a teaching guide where parallel programming is the main topic of the course. It builds on the basics of C programming for CUDA, a parallel programming environment that is supported on NVI- DIA GPUs. Composed of 12 chapters, the book begins with basic information about the GPU as a parallel computer source. It also explains the main concepts of CUDA, data parallelism, and the importance of memory access efficiency using CUDA. The target audience of the book is graduate and undergraduate students from all science and engineering disciplines who ...
Parallel Monte Carlo simulation of aerosol dynamics
Zhou, K.; He, Z.; Xiao, M.; Zhang, Z.
2014-01-01
is simulated with a stochastic method (Marcus-Lushnikov stochastic process). Operator splitting techniques are used to synthesize the deterministic and stochastic parts in the algorithm. The algorithm is parallelized using the Message Passing Interface (MPI
Parallel fabrication of macroporous scaffolds.
Dobos, Andrew; Grandhi, Taraka Sai Pavan; Godeshala, Sudhakar; Meldrum, Deirdre R; Rege, Kaushal
2018-07-01
Scaffolds generated from naturally occurring and synthetic polymers have been investigated in several applications because of their biocompatibility and tunable chemo-mechanical properties. Existing methods for generation of 3D polymeric scaffolds typically cannot be parallelized, suffer from low throughputs, and do not allow for quick and easy removal of the fragile structures that are formed. Current molds used in hydrogel and scaffold fabrication using solvent casting and porogen leaching are often single-use and do not facilitate 3D scaffold formation in parallel. Here, we describe a simple device and related approaches for the parallel fabrication of macroporous scaffolds. This approach was employed for the generation of macroporous and non-macroporous materials in parallel, in higher throughput and allowed for easy retrieval of these 3D scaffolds once formed. In addition, macroporous scaffolds with interconnected as well as non-interconnected pores were generated, and the versatility of this approach was employed for the generation of 3D scaffolds from diverse materials including an aminoglycoside-derived cationic hydrogel ("Amikagel"), poly(lactic-co-glycolic acid) or PLGA, and collagen. Macroporous scaffolds generated using the device were investigated for plasmid DNA binding and cell loading, indicating the use of this approach for developing materials for different applications in biotechnology. Our results demonstrate that the device-based approach is a simple technology for generating scaffolds in parallel, which can enhance the toolbox of current fabrication techniques. © 2018 Wiley Periodicals, Inc.
Institutionalized Ignorance as a Precondition for Rational Risk Expertise
DEFF Research Database (Denmark)
Merkelsen, Henrik
2011-01-01
the lowest organizational level, where concrete risks occur, to the highest organizational level, where the body of professional risk expertise is situated. The article emphasizes the role of knowledge, responsibility, loyalty, and trust as risk-attenuation factors and concludes by suggesting......The present case study seeks to explain the conditions for experts’ rational risk perception by analyzing the institutional contexts that constitute a field of food safety expertise in Denmark. The study highlights the role of risk reporting and how contextual factors affect risk reporting from...... that the preconditions for the expert's rationality may rather be a lack of risk-specific knowledge due to poor risk reporting than a superior level of risk knowledge....
Explicit solution of Calderon preconditioned time domain integral equations
Ulku, Huseyin Arda
2013-07-01
An explicit marching on-in-time (MOT) scheme for solving Calderon-preconditioned time domain integral equations is proposed. The scheme uses Rao-Wilton-Glisson and Buffa-Christiansen functions to discretize the domain and range of the integral operators and a PE(CE)m type linear multistep to march on in time. Unlike its implicit counterpart, the proposed explicit solver requires the solution of an MOT system with a Gram matrix that is sparse and well-conditioned independent of the time step size. Numerical results demonstrate that the explicit solver maintains its accuracy and stability even when the time step size is chosen as large as that typically used by an implicit solver. © 2013 IEEE.
Least-squares reverse time migration with radon preconditioning
Dutta, Gaurav
2016-09-06
We present a least-squares reverse time migration (LSRTM) method using Radon preconditioning to regularize noisy or severely undersampled data. A high resolution local radon transform is used as a change of basis for the reflectivity and sparseness constraints are applied to the inverted reflectivity in the transform domain. This reflects the prior that for each location of the subsurface the number of geological dips is limited. The forward and the adjoint mapping of the reflectivity to the local Radon domain and back are done through 3D Fourier-based discrete Radon transform operators. The sparseness is enforced by applying weights to the Radon domain components which either vary with the amplitudes of the local dips or are thresholded at given quantiles. Numerical tests on synthetic and field data validate the effectiveness of the proposed approach in producing images with improved SNR and reduced aliasing artifacts when compared with standard RTM or LSRTM.
Natural Preconditioning and Iterative Methods for Saddle Point Systems
Pestana, Jennifer
2015-01-01
© 2015 Society for Industrial and Applied Mathematics. The solution of quadratic or locally quadratic extremum problems subject to linear(ized) constraints gives rise to linear systems in saddle point form. This is true whether in the continuous or the discrete setting, so saddle point systems arising from the discretization of partial differential equation problems, such as those describing electromagnetic problems or incompressible flow, lead to equations with this structure, as do, for example, interior point methods and the sequential quadratic programming approach to nonlinear optimization. This survey concerns iterative solution methods for these problems and, in particular, shows how the problem formulation leads to natural preconditioners which guarantee a fast rate of convergence of the relevant iterative methods. These preconditioners are related to the original extremum problem and their effectiveness - in terms of rapidity of convergence - is established here via a proof of general bounds on the eigenvalues of the preconditioned saddle point matrix on which iteration convergence depends.
Aerodynamic shape optimization using preconditioned conjugate gradient methods
Burgreen, Greg W.; Baysal, Oktay
1993-01-01
In an effort to further improve upon the latest advancements made in aerodynamic shape optimization procedures, a systematic study is performed to examine several current solution methodologies as applied to various aspects of the optimization procedure. It is demonstrated that preconditioned conjugate gradient-like methodologies dramatically decrease the computational efforts required for such procedures. The design problem investigated is the shape optimization of the upper and lower surfaces of an initially symmetric (NACA-012) airfoil in inviscid transonic flow and at zero degree angle-of-attack. The complete surface shape is represented using a Bezier-Bernstein polynomial. The present optimization method then automatically obtains supercritical airfoil shapes over a variety of freestream Mach numbers. Furthermore, the best optimization strategy examined resulted in a factor of 8 decrease in computational time as well as a factor of 4 decrease in memory over the most efficient strategies in current use.
Can endurance exercise preconditioning prevention disuse muscle atrophy?
Directory of Open Access Journals (Sweden)
Michael P Wiggs
2015-03-01
Full Text Available Emerging evidence suggests that exercise training can provide a level of protection against disuse muscle atrophy. Endurance exercise training imposes oxidative, metabolic, and heat stress on skeletal muscle which activates a variety of cellular signaling pathways that ultimately leads to the increased expression of proteins that have been demonstrated to protect muscle from inactivity –induced atrophy. This review will highlight the effect of exercise-induced oxidative stress on endogenous enzymatic antioxidant capacity (i.e., superoxide dismutase, glutathione peroxidase, and catalase, the role of oxidative and metabolic stress on PGC1-α, and finally highlight the effect heat stress and HSP70 induction. Finally, this review will discuss the supporting scientific evidence that these proteins can attenuate muscle atrophy through exercise preconditioning.
Effect of ozone oxidative preconditioning in preventing early radiation-induced lung injury in rats
Energy Technology Data Exchange (ETDEWEB)
Bakkal, B.H. [Department of Radiation Oncology, School of Medicine, Bulent Ecevit University, Kozlu, Zonguldak (Turkey); Gultekin, F.A. [Department of General Surgery, School of Medicine, Bulent Ecevit University, Kozlu, Zonguldak (Turkey); Guven, B. [Department of Biochemistry, School of Medicine, Bulent Ecevit University, Kozlu, Zonguldak (Turkey); Turkcu, U.O. [Mugla School of Health Sciences, Mugla Sitki Kocman University, Mugla (Turkey); Bektas, S. [Department of Pathology, School of Medicine, Bulent Ecevit University, Kozlu, Zonguldak (Turkey); Can, M. [Department of Biochemistry, School of Medicine, Bulent Ecevit University, Kozlu, Zonguldak (Turkey)
2013-09-27
Ionizing radiation causes its biological effects mainly through oxidative damage induced by reactive oxygen species. Previous studies showed that ozone oxidative preconditioning attenuated pathophysiological events mediated by reactive oxygen species. As inhalation of ozone induces lung injury, the aim of this study was to examine whether ozone oxidative preconditioning potentiates or attenuates the effects of irradiation on the lung. Rats were subjected to total body irradiation, with or without treatment with ozone oxidative preconditioning (0.72 mg/kg). Serum proinflammatory cytokine levels, oxidative damage markers, and histopathological analysis were compared at 6 and 72 h after total body irradiation. Irradiation significantly increased lung malondialdehyde levels as an end-product of lipoperoxidation. Irradiation also significantly decreased lung superoxide dismutase activity, which is an indicator of the generation of oxidative stress and an early protective response to oxidative damage. Ozone oxidative preconditioning plus irradiation significantly decreased malondialdehyde levels and increased the activity of superoxide dismutase, which might indicate protection of the lung from radiation-induced lung injury. Serum tumor necrosis factor alpha and interleukin-1 beta levels, which increased significantly following total body irradiation, were decreased with ozone oxidative preconditioning. Moreover, ozone oxidative preconditioning was able to ameliorate radiation-induced lung injury assessed by histopathological evaluation. In conclusion, ozone oxidative preconditioning, repeated low-dose intraperitoneal administration of ozone, did not exacerbate radiation-induced lung injury, and, on the contrary, it provided protection against radiation-induced lung damage.
Warner, Dennis B.
1984-02-01
Recognition of the socioeconomic preconditions for successful rural water-supply and sanitation projects in developing countries is the key to identifying a new project. Preconditions are the social, economic and technical characteristics defining the project environment. There are two basic types of preconditions: those existing at the time of the initial investigation and those induced by subsequent project activities. Successful project identification is dependent upon an accurate recognition of existing constraints and a carefully tailored package of complementary investments intended to overcome the constraints. This paper discusses the socioeconomic aspects of preconditions in the context of a five-step procedure for project identification. The procedure includes: (1) problem identification; (2) determination of socioeconomic status; (3) technology selection; (4) utilization of support conditions; and (5) benefit estimation. Although the establishment of specific preconditions should be based upon the types of projects likely to be implemented, the paper outlines a number of general relationships regarding favourable preconditions in water and sanitation planning. These relationships are used within the above five-step procedure to develop a set of general guidelines for the application of preconditions in the identification of rural water-supply and sanitation projects.
Effect of ozone oxidative preconditioning in preventing early radiation-induced lung injury in rats
International Nuclear Information System (INIS)
Bakkal, B.H.; Gultekin, F.A.; Guven, B.; Turkcu, U.O.; Bektas, S.; Can, M.
2013-01-01
Ionizing radiation causes its biological effects mainly through oxidative damage induced by reactive oxygen species. Previous studies showed that ozone oxidative preconditioning attenuated pathophysiological events mediated by reactive oxygen species. As inhalation of ozone induces lung injury, the aim of this study was to examine whether ozone oxidative preconditioning potentiates or attenuates the effects of irradiation on the lung. Rats were subjected to total body irradiation, with or without treatment with ozone oxidative preconditioning (0.72 mg/kg). Serum proinflammatory cytokine levels, oxidative damage markers, and histopathological analysis were compared at 6 and 72 h after total body irradiation. Irradiation significantly increased lung malondialdehyde levels as an end-product of lipoperoxidation. Irradiation also significantly decreased lung superoxide dismutase activity, which is an indicator of the generation of oxidative stress and an early protective response to oxidative damage. Ozone oxidative preconditioning plus irradiation significantly decreased malondialdehyde levels and increased the activity of superoxide dismutase, which might indicate protection of the lung from radiation-induced lung injury. Serum tumor necrosis factor alpha and interleukin-1 beta levels, which increased significantly following total body irradiation, were decreased with ozone oxidative preconditioning. Moreover, ozone oxidative preconditioning was able to ameliorate radiation-induced lung injury assessed by histopathological evaluation. In conclusion, ozone oxidative preconditioning, repeated low-dose intraperitoneal administration of ozone, did not exacerbate radiation-induced lung injury, and, on the contrary, it provided protection against radiation-induced lung damage
Parallel Atomistic Simulations
Energy Technology Data Exchange (ETDEWEB)
HEFFELFINGER,GRANT S.
2000-01-18
Algorithms developed to enable the use of atomistic molecular simulation methods with parallel computers are reviewed. Methods appropriate for bonded as well as non-bonded (and charged) interactions are included. While strategies for obtaining parallel molecular simulations have been developed for the full variety of atomistic simulation methods, molecular dynamics and Monte Carlo have received the most attention. Three main types of parallel molecular dynamics simulations have been developed, the replicated data decomposition, the spatial decomposition, and the force decomposition. For Monte Carlo simulations, parallel algorithms have been developed which can be divided into two categories, those which require a modified Markov chain and those which do not. Parallel algorithms developed for other simulation methods such as Gibbs ensemble Monte Carlo, grand canonical molecular dynamics, and Monte Carlo methods for protein structure determination are also reviewed and issues such as how to measure parallel efficiency, especially in the case of parallel Monte Carlo algorithms with modified Markov chains are discussed.
A finite element solution method for quadrics parallel computer
International Nuclear Information System (INIS)
Zucchini, A.
1996-08-01
A distributed preconditioned conjugate gradient method for finite element analysis has been developed and implemented on a parallel SIMD Quadrics computer. The main characteristic of the method is that it does not require any actual assembling of all element equations in a global system. The physical domain of the problem is partitioned in cells of n p finite elements and each cell element is assigned to a different node of an n p -processors machine. Element stiffness matrices are stored in the data memory of the assigned processing node and the solution process is completely executed in parallel at element level. Inter-element and therefore inter-processor communications are required once per iteration to perform local sums of vector quantities between neighbouring elements. A prototype implementation has been tested on an 8-nodes Quadrics machine in a simple 2D benchmark problem
Compiler Technology for Parallel Scientific Computation
Directory of Open Access Journals (Sweden)
Can Özturan
1994-01-01
Full Text Available There is a need for compiler technology that, given the source program, will generate efficient parallel codes for different architectures with minimal user involvement. Parallel computation is becoming indispensable in solving large-scale problems in science and engineering. Yet, the use of parallel computation is limited by the high costs of developing the needed software. To overcome this difficulty we advocate a comprehensive approach to the development of scalable architecture-independent software for scientific computation based on our experience with equational programming language (EPL. Our approach is based on a program decomposition, parallel code synthesis, and run-time support for parallel scientific computation. The program decomposition is guided by the source program annotations provided by the user. The synthesis of parallel code is based on configurations that describe the overall computation as a set of interacting components. Run-time support is provided by the compiler-generated code that redistributes computation and data during object program execution. The generated parallel code is optimized using techniques of data alignment, operator placement, wavefront determination, and memory optimization. In this article we discuss annotations, configurations, parallel code generation, and run-time support suitable for parallel programs written in the functional parallel programming language EPL and in Fortran.
Directory of Open Access Journals (Sweden)
Wu Ann
2011-01-01
Full Text Available Abstract Background A preconditioning stimulus can trigger a neuroprotective phenotype in the nervous system - a preconditioning nerve lesion causes a significant increase in axonal regeneration, and cerebral preconditioning protects against subsequent ischemia. We hypothesized that a preconditioning nerve lesion induces gene/protein modifications, neuronal changes, and immune activation that may affect pain sensation following subsequent nerve injury. We examined whether a preconditioning lesion affects neuropathic pain and neuroinflammation after peripheral nerve injury. Results We found that a preconditioning crush injury to a terminal branch of the sciatic nerve seven days before partial ligation of the sciatic nerve (PSNL; a model of neuropathic pain induced a significant attenuation of pain hypersensitivity, particularly mechanical allodynia. A preconditioning lesion of the tibial nerve induced a long-term significant increase in paw-withdrawal threshold to mechanical stimuli and paw-withdrawal latency to thermal stimuli, after PSNL. A preconditioning lesion of the common peroneal induced a smaller but significant short-term increase in paw-withdrawal threshold to mechanical stimuli, after PSNL. There was no difference between preconditioned and unconditioned animals in neuronal damage and macrophage and T-cell infiltration into the dorsal root ganglia (DRGs or in astrocyte and microglia activation in the spinal dorsal and ventral horns. Conclusions These results suggest that prior exposure to a mild nerve lesion protects against adverse effects of subsequent neuropathic injury, and that this conditioning-induced inhibition of pain hypersensitivity is not dependent on neuroinflammation in DRGs and spinal cord. Identifying the underlying mechanisms may have important implications for the understanding of neuropathic pain due to nerve injury.
An, Gary C; Faeder, James R
2009-01-01
Intracellular signaling/synthetic pathways are being increasingly extensively characterized. However, while these pathways can be displayed in static diagrams, in reality they exist with a degree of dynamic complexity that is responsible for heterogeneous cellular behavior. Multiple parallel pathways exist and interact concurrently, limiting the ability to integrate the various identified mechanisms into a cohesive whole. Computational methods have been suggested as a means of concatenating this knowledge to aid in the understanding of overall system dynamics. Since the eventual goal of biomedical research is the identification and development of therapeutic modalities, computational representation must have sufficient detail to facilitate this 'engineering' process. Adding to the challenge, this type of representation must occur in a perpetual state of incomplete knowledge. We present a modeling approach to address this challenge that is both detailed and qualitative. This approach is termed 'dynamic knowledge representation,' and is intended to be an integrated component of the iterative cycle of scientific discovery. BioNetGen (BNG), a software platform for modeling intracellular signaling pathways, was used to model the toll-like receptor 4 (TLR-4) signal transduction cascade. The informational basis of the model was a series of reference papers on modulation of (TLR-4) signaling, and some specific primary research papers to aid in the characterization of specific mechanistic steps in the pathway. This model was detailed with respect to the components of the pathway represented, but qualitative with respect to the specific reaction coefficients utilized to execute the reactions. Responsiveness to simulated lipopolysaccharide (LPS) administration was measured by tumor necrosis factor (TNF) production. Simulation runs included evaluation of initial dose-dependent response to LPS administration at 10, 100, 1000 and 10,000, and a subsequent examination of
T2CG1, a package of preconditioned conjugate gradient solvers for TOUGH2
International Nuclear Information System (INIS)
Moridis, G.; Pruess, K.; Antunez, E.
1994-03-01
Most of the computational work in the numerical simulation of fluid and heat flows in permeable media arises in the solution of large systems of linear equations. The simplest technique for solving such equations is by direct methods. However, because of large storage requirements and accumulation of roundoff errors, the application of direct solution techniques is limited, depending on matrix bandwidth, to systems of a few hundred to at most a few thousand simultaneous equations. T2CG1, a package of preconditioned conjugate gradient solvers, has been added to TOUGH2 to complement its direct solver and significantly increase the size of problems tractable on PCs. T2CG1 includes three different solvers: a Bi-Conjugate Gradient (BCG) solver, a Bi-Conjugate Gradient Squared (BCGS) solver, and a Generalized Minimum Residual (GMRES) solver. Results from six test problems with up to 30,000 equations show that T2CG1 (1) is significantly (and invariably) faster and requires far less memory than the MA28 direct solver, (2) it makes possible the solution of very large three-dimensional problems on PCs, and (3) that the BCGS solver is the fastest of the three in the tested problems. Sample problems are presented related to heat and fluid flow at Yucca Mountain and WIPP, environmental remediation by the Thermal Enhanced Vapor Extraction System, and geothermal resources
Valdés, Felipe
2011-06-01
A new regularized single source equation for analyzing scattering from homogeneous penetrable objects is presented. The proposed equation is a linear combination of a Calderón-preconditioned single source electric field integral equation and a single source magnetic field integral equation. The equation is immune to low-frequency and dense-mesh breakdown, and free from spurious resonances. Unlike dual source formulations, this equation involves operator products that cannot be discretized using standard procedures for discretizing standalone electric, magnetic, and combined field operators. Instead, the single source equation proposed here is discretized using a recently developed technique that achieves a well-conditioned mapping from div- to curl-conforming function spaces, thereby fully respecting the space mapping properties of the operators involved, and guaranteeing accuracy and stability. Numerical results show that the proposed equation and discretization technique give rise to rapidly convergent solutions. They also validate the equation\\'s resonant free character. © 2006 IEEE.
Chitu, Zenaida; Bogaard, Thom; Busuioc, Aristita; Burcea, Sorin; Adler, Mary-Jeanne; Sandric, Ionut
2015-04-01
Like in many parts of the world, in Romania, landslides represent recurrent phenomena that produce numerous damages to infrastructure every few years. Various studies on landslide occurrence in the Curvature Subcarpathians reveal that rainfall represents the most important triggering factor for landslides. Depending on rainfall characteristics and environmental factors different types of landslides were recorded in the Ialomita Subcarpathians: slumps, earthflows and complex landslides. This area, located in the western part of Curvature Subcarpathians, is characterized by a very complex geology whose main features are represented by the nappes system, the post tectonic covers, the diapirism phenomena and vertical faults. This work aims to investigate hydrological pre-conditions and rainfall characteristics which triggered slope failures in 2014 in the Ialomita Subcarpathians, Romania. Hydrological pre-conditions were investigated by means of water balance analysis and low flow techniques, while spatial and temporal patterns of rainfalls were estimated using radar data and six rain gauges. Additionally, six soil moisture stations that are fitted with volumetric soil moisture sensors and temperature soil sensors were used to estimate the antecedent soil moisture conditions.
Hoffmann, Gerd-Albert; Wolfer, Tim; Zeitler, Jochen; Franke, Jörg; Suttmann, Oliver; Overmeyer, Ludger
2017-02-01
Optical data communication is increasingly interesting for many applications in industrial processes. Therefore mass production is required to meet the requested price and lot sizes. Polymer optical waveguides show great promises to comply with price requirements while providing sufficient optical quality for short range data transmission. A high efficient fabrication technology using polymer materials could be able to create the essential backbone for 3D-optical data transmission in the future. The approach for high efficient fabrication technology of micro optics described in this paper is based on a self-assembly effect of fluids on preconditioned 3D-thermoformed polymer foils. Adjusting the surface energy on certain areas on the flexible substrate by flexographic printing mechanism is presented in this paper. With this technique conditioning lines made of silicone containing UV-varnish are printed on top of the foils and create gaps with the exposed substrate material in between. Subsequent fabrication processes are selected whether the preconditioned foil is coated with acrylate containing waveguide material prior or after the thermoforming process. Due to the different surface energy this material tends to dewet from the conditioning lines. It acts like regional barriers and sets the width of the arising waveguides. With this fabrication technology it is possible to produce multiple waveguides with a single coating process. The relevant printing process parameters that affect the quality of the generated waveguides are discussed and results of the produced waveguides with width ranging from 10 to 300 μm are shown.
CERN. Geneva
2016-01-01
The traditionally used and well established parallel programming models OpenMP and MPI are both targeting lower level parallelism and are meant to be as language agnostic as possible. For a long time, those models were the only widely available portable options for developing parallel C++ applications beyond using plain threads. This has strongly limited the optimization capabilities of compilers, has inhibited extensibility and genericity, and has restricted the use of those models together with other, modern higher level abstractions introduced by the C++11 and C++14 standards. The recent revival of interest in the industry and wider community for the C++ language has also spurred a remarkable amount of standardization proposals and technical specifications being developed. Those efforts however have so far failed to build a vision on how to seamlessly integrate various types of parallelism, such as iterative parallel execution, task-based parallelism, asynchronous many-task execution flows, continuation s...
Parallelism in matrix computations
Gallopoulos, Efstratios; Sameh, Ahmed H
2016-01-01
This book is primarily intended as a research monograph that could also be used in graduate courses for the design of parallel algorithms in matrix computations. It assumes general but not extensive knowledge of numerical linear algebra, parallel architectures, and parallel programming paradigms. The book consists of four parts: (I) Basics; (II) Dense and Special Matrix Computations; (III) Sparse Matrix Computations; and (IV) Matrix functions and characteristics. Part I deals with parallel programming paradigms and fundamental kernels, including reordering schemes for sparse matrices. Part II is devoted to dense matrix computations such as parallel algorithms for solving linear systems, linear least squares, the symmetric algebraic eigenvalue problem, and the singular-value decomposition. It also deals with the development of parallel algorithms for special linear systems such as banded ,Vandermonde ,Toeplitz ,and block Toeplitz systems. Part III addresses sparse matrix computations: (a) the development of pa...
Bayer image parallel decoding based on GPU
Hu, Rihui; Xu, Zhiyong; Wei, Yuxing; Sun, Shaohua
2012-11-01
In the photoelectrical tracking system, Bayer image is decompressed in traditional method, which is CPU-based. However, it is too slow when the images become large, for example, 2K×2K×16bit. In order to accelerate the Bayer image decoding, this paper introduces a parallel speedup method for NVIDA's Graphics Processor Unit (GPU) which supports CUDA architecture. The decoding procedure can be divided into three parts: the first is serial part, the second is task-parallelism part, and the last is data-parallelism part including inverse quantization, inverse discrete wavelet transform (IDWT) as well as image post-processing part. For reducing the execution time, the task-parallelism part is optimized by OpenMP techniques. The data-parallelism part could advance its efficiency through executing on the GPU as CUDA parallel program. The optimization techniques include instruction optimization, shared memory access optimization, the access memory coalesced optimization and texture memory optimization. In particular, it can significantly speed up the IDWT by rewriting the 2D (Tow-dimensional) serial IDWT into 1D parallel IDWT. Through experimenting with 1K×1K×16bit Bayer image, data-parallelism part is 10 more times faster than CPU-based implementation. Finally, a CPU+GPU heterogeneous decompression system was designed. The experimental result shows that it could achieve 3 to 5 times speed increase compared to the CPU serial method.
Parallel S/sub n/ iteration schemes
International Nuclear Information System (INIS)
Wienke, B.R.; Hiromoto, R.E.
1986-01-01
The iterative, multigroup, discrete ordinates (S/sub n/) technique for solving the linear transport equation enjoys widespread usage and appeal. Serial iteration schemes and numerical algorithms developed over the years provide a timely framework for parallel extension. On the Denelcor HEP, the authors investigate three parallel iteration schemes for solving the one-dimensional S/sub n/ transport equation. The multigroup representation and serial iteration methods are also reviewed. This analysis represents a first attempt to extend serial S/sub n/ algorithms to parallel environments and provides good baseline estimates on ease of parallel implementation, relative algorithm efficiency, comparative speedup, and some future directions. The authors examine ordered and chaotic versions of these strategies, with and without concurrent rebalance and diffusion acceleration. Two strategies efficiently support high degrees of parallelization and appear to be robust parallel iteration techniques. The third strategy is a weaker parallel algorithm. Chaotic iteration, difficult to simulate on serial machines, holds promise and converges faster than ordered versions of the schemes. Actual parallel speedup and efficiency are high and payoff appears substantial
DEFF Research Database (Denmark)
Sitchinava, Nodar; Zeh, Norbert
2012-01-01
We present the parallel buffer tree, a parallel external memory (PEM) data structure for batched search problems. This data structure is a non-trivial extension of Arge's sequential buffer tree to a private-cache multiprocessor environment and reduces the number of I/O operations by the number of...... in the optimal OhOf(psortN + K/PB) parallel I/O complexity, where K is the size of the output reported in the process and psortN is the parallel I/O complexity of sorting N elements using P processors....
Deshmane, Anagha; Gulani, Vikas; Griswold, Mark A; Seiberlich, Nicole
2012-07-01
Parallel imaging is a robust method for accelerating the acquisition of magnetic resonance imaging (MRI) data, and has made possible many new applications of MR imaging. Parallel imaging works by acquiring a reduced amount of k-space data with an array of receiver coils. These undersampled data can be acquired more quickly, but the undersampling leads to aliased images. One of several parallel imaging algorithms can then be used to reconstruct artifact-free images from either the aliased images (SENSE-type reconstruction) or from the undersampled data (GRAPPA-type reconstruction). The advantages of parallel imaging in a clinical setting include faster image acquisition, which can be used, for instance, to shorten breath-hold times resulting in fewer motion-corrupted examinations. In this article the basic concepts behind parallel imaging are introduced. The relationship between undersampling and aliasing is discussed and two commonly used parallel imaging methods, SENSE and GRAPPA, are explained in detail. Examples of artifacts arising from parallel imaging are shown and ways to detect and mitigate these artifacts are described. Finally, several current applications of parallel imaging are presented and recent advancements and promising research in parallel imaging are briefly reviewed. Copyright © 2012 Wiley Periodicals, Inc.
Parallel Algorithms and Patterns
Energy Technology Data Exchange (ETDEWEB)
Robey, Robert W. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2016-06-16
This is a powerpoint presentation on parallel algorithms and patterns. A parallel algorithm is a well-defined, step-by-step computational procedure that emphasizes concurrency to solve a problem. Examples of problems include: Sorting, searching, optimization, matrix operations. A parallel pattern is a computational step in a sequence of independent, potentially concurrent operations that occurs in diverse scenarios with some frequency. Examples are: Reductions, prefix scans, ghost cell updates. We only touch on parallel patterns in this presentation. It really deserves its own detailed discussion which Gabe Rockefeller would like to develop.
Application Portable Parallel Library
Cole, Gary L.; Blech, Richard A.; Quealy, Angela; Townsend, Scott
1995-01-01
Application Portable Parallel Library (APPL) computer program is subroutine-based message-passing software library intended to provide consistent interface to variety of multiprocessor computers on market today. Minimizes effort needed to move application program from one computer to another. User develops application program once and then easily moves application program from parallel computer on which created to another parallel computer. ("Parallel computer" also include heterogeneous collection of networked computers). Written in C language with one FORTRAN 77 subroutine for UNIX-based computers and callable from application programs written in C language or FORTRAN 77.
Preconditioned alternating direction method of multipliers for inverse problems with constraints
International Nuclear Information System (INIS)
Jiao, Yuling; Jin, Qinian; Lu, Xiliang; Wang, Weijie
2017-01-01
We propose a preconditioned alternating direction method of multipliers (ADMM) to solve linear inverse problems in Hilbert spaces with constraints, where the feature of the sought solution under a linear transformation is captured by a possibly non-smooth convex function. During each iteration step, our method avoids solving large linear systems by choosing a suitable preconditioning operator. In case the data is given exactly, we prove the convergence of our preconditioned ADMM without assuming the existence of a Lagrange multiplier. In case the data is corrupted by noise, we propose a stopping rule using information on noise level and show that our preconditioned ADMM is a regularization method; we also propose a heuristic rule when the information on noise level is unavailable or unreliable and give its detailed analysis. Numerical examples are presented to test the performance of the proposed method. (paper)
S2SA preconditioning for the Sn equations with strictly non negative spatial discretization
International Nuclear Information System (INIS)
Bruss, D. E.; Morel, J. E.; Ragusa, J. C.
2013-01-01
Preconditioners based upon sweeps and diffusion-synthetic acceleration have been constructed and applied to the zeroth and first spatial moments of the 1-D S n transport equation using a strictly non negative nonlinear spatial closure. Linear and nonlinear preconditioners have been analyzed. The effectiveness of various combinations of these preconditioners are compared. In one dimension, nonlinear sweep preconditioning is shown to be superior to linear sweep preconditioning, and DSA preconditioning using nonlinear sweeps in conjunction with a linear diffusion equation is found to be essentially equivalent to nonlinear sweeps in conjunction with a nonlinear diffusion equation. The ability to use a linear diffusion equation has important implications for preconditioning the S n equations with a strictly non negative spatial discretization in multiple dimensions. (authors)
Rapamycin preconditioning attenuates transient focal cerebral ischemia/reperfusion injury in mice.
Yin, Lele; Ye, Shasha; Chen, Zhen; Zeng, Yaoying
2012-12-01
Rapamycin, an mTOR inhibitor and immunosuppressive agent in clinic, has protective effects on traumatic brain injury and neurodegenerative diseases. But, its effects on transient focal ischemia/reperfusion disease are not very clear. In this study, we examined the effects of rapamycin preconditioning on mice treated with middle cerebral artery occlusion/reperfusion operation (MCAO/R). We found that the rapamycin preconditioning by intrahippocampal injection 20 hr before MCAO/R significantly improved the survival rate and longevity of mice. It also decreased the neurological deficit score, infracted areas and brain edema. In addition, rapamycin preconditioning decreased the production of NF-κB, TNF-α, and Bax, but not Bcl-2, an antiapoptotic protein in the ischemic area. From these results, we may conclude that rapamycin preconditioning attenuate transient focal cerebral ischemia/reperfusion injury and inhibits apoptosis induced by MCAO/R in mice.
Parallel imaging with phase scrambling.
Zaitsev, Maxim; Schultz, Gerrit; Hennig, Juergen; Gruetter, Rolf; Gallichan, Daniel
2015-04-01
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. 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. 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. 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. © 2014 Wiley Periodicals, Inc.
Ischemic preconditioning improves mitochondrial tolerance to experimental calcium overload.
Crestanello, Juan A; Doliba, Nicolai M; Babsky, Andriy M; Doliba, Natalia M; Niibori, Koki; Whitman, Glenn J R; Osbakken, Mary D
2002-04-01
Ca(2+) overload leads to mitochondrial uncoupling, decreased ATP synthesis, and myocardial dysfunction. Pharmacologically opening of mitochondrial K(ATP) channels decreases mitochondrial Ca(2+) uptake, improving mitochondrial function during Ca(2+) overload. Ischemic preconditioning (IPC), by activating mitochondrial K(ATP) channels, may attenuate mitochondrial Ca(2+) overload and improve mitochondrial function during reperfusion. The purpose of these experiments was to study the effect of IPC (1) on mitochondrial function and (2) on mitochondrial tolerance to experimental Ca(2+) overload. Rat hearts (n = 6/group) were subjected to (a) 30 min of equilibration, 25 min of ischemia, and 30 min of reperfusion (Control) or (b) two 5-min episodes of ischemic preconditioning, 25 min of ischemia, and 30 min of reperfusion (IPC). Developed pressure (DP) was measured. Heart mitochondria were isolated at end-Equilibration (end-EQ) and at end-Reperfusion (end-RP). Mitochondrial respiratory function (state 2, oxygen consumption with substrate only; state 3, oxygen consumption stimulated by ADP; state 4, oxygen consumption after cessation of ADP phosphorylation; respiratory control index (RCI, state 3/state 4); rate of oxidative phosphorylation (ADP/Deltat), and ADP:O ratio) was measured with polarography using alpha-ketoglutarate as a substrate in the presence of different Ca(2+) concentrations (0 to 5 x 10(-7) M) to simulate Ca(2+) overload. IPC improved DP at end-RP. IPC did not improve preischemic mitochondrial respiratory function or preischemic mitochondrial response to Ca(2+) loading. IPC improved state 3, ADP/Deltat, and RCI during RP. Low Ca(2+) levels (0.5 and 1 x 10(-7) M) stimulated mitochondrial function in both groups predominantly in IPC. The Control group showed evidence of mitochondrial uncoupling at lower Ca(2+) concentrations (1 x 10(-7) M). IPC preserved state 3 at high Ca(2+) concentrations. The cardioprotective effect of IPC results, in part, from
Key cognitive preconditions for the evolution of language.
Donald, Merlin
2017-02-01
Languages are socially constructed systems of expression, generated interactively in social networks, which can be assimilated by the individual brain as it develops. Languages co-evolved with culture, reflecting the changing complexity of human culture as it acquired the properties of a distributed cognitive system. Two key preconditions set the stage for the evolution of such cultures: a very general ability to rehearse and refine skills (evident early in hominin evolution in toolmaking), and the emergence of material culture as an external (to the brain) memory record that could retain and accumulate knowledge across generations. The ability to practice and rehearse skill provided immediate survival-related benefits in that it expanded the physical powers of early hominins, but the same adaptation also provided the imaginative substrate for a system of "mimetic" expression, such as found in ritual and pantomime, and in proto-words, which performed an expressive function somewhat like the home signs of deaf non-signers. The hominid brain continued to adapt to the increasing importance and complexity of culture as human interactions with material culture became more complex; above all, this entailed a gradual expansion in the integrative systems of the brain, especially those involved in the metacognitive supervision of self-performances. This supported a style of embodied mimetic imagination that improved the coordination of shared activities such as fire tending, but also in rituals and reciprocal mimetic games. The time-depth of this mimetic adaptation, and its role in both the construction and acquisition of languages, explains the importance of mimetic expression in the media, religion, and politics. Spoken language evolved out of voco-mimesis, and emerged long after the more basic abilities needed to refine skill and share intentions, probably coinciding with the common ancestor of sapient humans. Self-monitoring and self-supervised practice were necessary
Opioid-induced preconditioning: recent advances and future perspectives.
Peart, Jason N; Gross, Eric R; Gross, Garrett J
2005-01-01
Opioids, named by Acheson for compounds with morphine-like actions despite chemically distinct structures, have received much research interest, particularly for their central nervous system (CNS) actions involved in pain management, resulting in thousands of scientific papers focusing on their effects on the CNS and other organ systems. A more recent area which may have great clinical importance concerns the role of opioids, either endogenous or exogenous compounds, in limiting the pathogenesis of ischemia-reperfusion injury in heart and brain. The role of endogenous opioids in hibernation provides tantalizing evidence for the protective potential of opioids against ischemia or hypoxia. Mammalian hibernation, a distinct energy-conserving state, is associated with depletion of energy stores, intracellular acidosis and hypoxia, similar to those which occur during ischemia. However, despite the potentially detrimental cellular state induced with hibernation, the myocardium remains resilient for many months. What accounts for the hypoxia-tolerant state is of great interest. During hibernation, circulating levels of opioid peptides are increased dramatically, and indeed, are considered a "trigger" of hibernation. Furthermore, administration of opioid antagonists can effectively reverse hibernation in mammals. Therefore, it is not surprising that activation of opioid receptors has been demonstrated to preserve cellular status following a hypoxic insult, such as ischemia-reperfusion in many model systems including the intestine [Zhang, Y., Wu, Y.X., Hao, Y.B., Dun, Y. Yang, S.P., 2001. Role of endogenous opioid peptides in protection of ischemic preconditioning in rat small intestine. Life Sci. 68, 1013-1019], skeletal muscle [Addison, P.D., Neligan, P.C., Ashrafpour, H., Khan, A., Zhong, A., Moses, M., Forrest, C.R., Pang, C.Y., 2003. Noninvasive remote ischemic preconditioning for global protection of skeletal muscle against infarction. Am. J. Physiol. Heart Circ
Energy Technology Data Exchange (ETDEWEB)
Weston, Brian T. [Univ. of California, Davis, CA (United States)
2017-05-17
This dissertation focuses on the development of a fully-implicit, high-order compressible ow solver with phase change. The work is motivated by laser-induced phase change applications, particularly by the need to develop large-scale multi-physics simulations of the selective laser melting (SLM) process in metal additive manufacturing (3D printing). Simulations of the SLM process require precise tracking of multi-material solid-liquid-gas interfaces, due to laser-induced melting/ solidi cation and evaporation/condensation of metal powder in an ambient gas. These rapid density variations and phase change processes tightly couple the governing equations, requiring a fully compressible framework to robustly capture the rapid density variations of the ambient gas and the melting/evaporation of the metal powder. For non-isothermal phase change, the velocity is gradually suppressed through the mushy region by a variable viscosity and Darcy source term model. The governing equations are discretized up to 4th-order accuracy with our reconstructed Discontinuous Galerkin spatial discretization scheme and up to 5th-order accuracy with L-stable fully implicit time discretization schemes (BDF2 and ESDIRK3-5). The resulting set of non-linear equations is solved using a robust Newton-Krylov method, with the Jacobian-free version of the GMRES solver for linear iterations. Due to the sti nes associated with the acoustic waves and thermal and viscous/material strength e ects, preconditioning the GMRES solver is essential. A robust and scalable approximate block factorization preconditioner was developed, which utilizes the velocity-pressure (vP) and velocity-temperature (vT) Schur complement systems. This multigrid block reduction preconditioning technique converges for high CFL/Fourier numbers and exhibits excellent parallel and algorithmic scalability on classic benchmark problems in uid dynamics (lid-driven cavity ow and natural convection heat transfer) as well as for laser
Wang, Peng-Fei; Xiong, Xiao-Yi; Chen, Jing; Wang, Yan-Chun; Duan, Wei; Yang, Qing-Wu
2015-01-01
Increasing evidence suggests that toll-like receptors (TLRs) play an important role in cerebral ischemia-reperfusion injury. The endogenous ligands released from ischemic neurons activate the TLR signaling pathway, resulting in the production of a large number of inflammatory cytokines, thereby causing secondary inflammation damage following cerebral ischemia. However, the preconditioning for minor cerebral ischemia or the preconditioning with TLR ligands can reduce cerebral ischemic injury b...
Soman, S; Liu, Z; Kim, G; Nemec, U; Holdsworth, S J; Main, K; Lee, B; Kolakowsky-Hayner, S; Selim, M; Furst, A J; Massaband, P; Yesavage, J; Adamson, M M; Spincemallie, P; Moseley, M; Wang, Y
2018-04-01
Identifying cerebral microhemorrhage burden can aid in the diagnosis and management of traumatic brain injury, stroke, hypertension, and cerebral amyloid angiopathy. MR imaging susceptibility-based methods are more sensitive than CT for detecting cerebral microhemorrhage, but methods other than quantitative susceptibility mapping provide results that vary with field strength and TE, require additional phase maps to distinguish blood from calcification, and depict cerebral microhemorrhages as bloom artifacts. Quantitative susceptibility mapping provides universal quantification of tissue magnetic property without these constraints but traditionally requires a mask generated by skull-stripping, which can pose challenges at tissue interphases. We evaluated the preconditioned quantitative susceptibility mapping MR imaging method, which does not require skull-stripping, for improved depiction of brain parenchyma and pathology. Fifty-six subjects underwent brain MR imaging with a 3D multiecho gradient recalled echo acquisition. Mask-based quantitative susceptibility mapping images were created using a commonly used mask-based quantitative susceptibility mapping method, and preconditioned quantitative susceptibility images were made using precondition-based total field inversion. All images were reviewed by a neuroradiologist and a radiology resident. Ten subjects (18%), all with traumatic brain injury, demonstrated blood products on 3D gradient recalled echo imaging. All lesions were visible on preconditioned quantitative susceptibility mapping, while 6 were not visible on mask-based quantitative susceptibility mapping. Thirty-one subjects (55%) demonstrated brain parenchyma and/or lesions that were visible on preconditioned quantitative susceptibility mapping but not on mask-based quantitative susceptibility mapping. Six subjects (11%) demonstrated pons artifacts on preconditioned quantitative susceptibility mapping and mask-based quantitative susceptibility mapping
Rethinking The Going Concern Assumption As A Pre-Condition For Accounting Measurement
Saratiel Wedzerai Musvoto; Daan G Gouws
2011-01-01
This study compares the principles of the going concern concept against the principles of representational measurement to determine if it is possible to establish foundations of accounting measurement with the going concern concept as a precondition. Representational measurement theory is a theory that establishes measurement in social scientific disciplines such as accounting. The going concern assumption is prescribed as one of the preconditions for measuring the attributes of the elements ...
Veres, Tünde Gyöngyvér; Takács, Ildikó; Nagy, Tibor; Jancsó, Gábor; Kondor, Ariella; Pótó, László; Vereczkei, András
2018-04-13
Laparoscopy is more beneficial than the conventional open technique, however the pneumoperitoneum created may have an ischemic side effect. Our aim was to evaluate the protective effects of preconditioning during laparoscopic cholecystectomies (LC). 30 patients were randomized into 2 groups: I. PreC (preconditioning: 5 min. inflation, 5 min. deflation, followed by conventional LC), II: LC (conventional LC). Blood samples were taken before hospitalization (C = control), before surgery, after anaesthesia (B.S.), after surgery (A.S.) and 24 hours after the procedure (24 h). Measured parameters were: malondialdehyde (MDA), reduced glutathione (GSH), sulfhydril groups (-SH), superoxide-dismutase (SOD), catalase (CAT), myeloperoxidase (MPO), length of hospitalization and pain (VAS = visual analogue scale). Compared to the BS levels, no significant changes were detected in SOD's activity and MDA levels. GSH concentrations were significantly increased in the PreC group after operation. SH-, MPO, CAT and liver function enzymes were not significantly different. Hospitalization was shorter in the PreC group. Based on the VAS score patients had less pain in the PreC group. Significant differences concerning PreC group were found in GSH values. In the PreC group pain decreased by 2-2.5 units following the procedure, 24 h after surgery, and hospitalisation was also significantly shorter. In our pilot study the potential protective effect of preconditioning could be defined.
Directory of Open Access Journals (Sweden)
Daniel Marcsa
2015-01-01
Full Text Available The analysis and design of electromechanical devices involve the solution of large sparse linear systems, and require therefore high performance algorithms. In this paper, the primal Domain Decomposition Method (DDM with parallel forward-backward and with parallel Preconditioned Conjugate Gradient (PCG solvers are introduced in two-dimensional parallel time-stepping finite element formulation to analyze rotating machine considering the electromagnetic field, external circuit and rotor movement. The proposed parallel direct and the iterative solver with two preconditioners are analyzed concerning its computational efficiency and number of iterations of the solver with different preconditioners. Simulation results of a rotating machine is also presented.
Directory of Open Access Journals (Sweden)
Norio Saga
2008-03-01
Full Text Available The purpose of this study was to clarify whether heat preconditioning results in less eccentric exercise-induced muscle damage and muscle soreness, and whether the repeated bout effect is enhanced by heat preconditioning prior to eccentric exercise. Nine untrained male volunteers aged 23 ± 3 years participated in this study. Heat preconditioning included treatment with a microwave hyperthermia unit (150 W, 20 min that was randomly applied to one of the subject's arms (MW; the other arm was used as a control (CON. One day after heat preconditioning, the subjects performed 24 maximal isokinetic eccentric contractions of the elbow flexors at 30°·s-1 (ECC1. One week after ECC1, the subjects repeated the procedure (ECC2. After each bout of exercise, maximal voluntary contraction (MVC, range of motion (ROM of the elbow joint, upper arm circumference, blood creatine kinase (CK activity and muscle soreness were measured. The subjects experienced both conditions at an interval of 3 weeks. MVC and ROM in the MW were significantly higher than those in the CON (p < 0.05 for ECC1; however, the heat preconditioning had no significant effect on upper arm circumference, blood CK activity, or muscle soreness following ECC1 and ECC2. Heat preconditioning may protect human skeletal muscle from eccentric exercise-induced muscle damage after a single bout of eccentric exercise but does not appear to promote the repeated bout effect after a second bout of eccentric exercise
Parallel sparse direct solver for integrated circuit simulation
Chen, Xiaoming; Yang, Huazhong
2017-01-01
This book describes algorithmic methods and parallelization techniques to design a parallel sparse direct solver which is specifically targeted at integrated circuit simulation problems. The authors describe a complete flow and detailed parallel algorithms of the sparse direct solver. They also show how to improve the performance by simple but effective numerical techniques. The sparse direct solver techniques described can be applied to any SPICE-like integrated circuit simulator and have been proven to be high-performance in actual circuit simulation. Readers will benefit from the state-of-the-art parallel integrated circuit simulation techniques described in this book, especially the latest parallel sparse matrix solution techniques. · Introduces complicated algorithms of sparse linear solvers, using concise principles and simple examples, without complex theory or lengthy derivations; · Describes a parallel sparse direct solver that can be adopted to accelerate any SPICE-like integrated circuit simulato...
Prolonged preconditioning with natural honey against myocardial infarction injuries.
Eteraf-Oskouei, Tahereh; Shaseb, Elnaz; Ghaffary, Saba; Najafi, Moslem
2013-07-01
Potential protective effects of prolonged preconditioning with natural honey against myocardial infarction were investigated. Male Wistar rats were pre-treated with honey (1%, 2% and 4%) for 45 days then their hearts were isolated and mounted on a Langendorff apparatus and perfused with a modified Krebs-Henseleit solution during 30 min regional ischemia fallowed by 120 min reperfusion. Two important indexes of ischemia-induced damage (infarction size and arrhythmias) were determined by computerized planimetry and ECG analysis, respectively. Honey (1% and 2%) reduced infarct size from 23±3.1% (control) to 9.7±2.4 and 9.5±2.3%, respectively (Phoney (1%) significantly reduced (PHoney (1% and 2%) also significantly decreased number of ventricular ectopic beats (VEBs). In addition, incidence and duration of reversible ventricular fibrillation (Rev VF) were lowered by honey 2% (Phoney produced significant reduction in the incidences of VT, total and Rev VF, duration and number of VT. The results showed cardioprotective effects of prolonged pre-treatment of rats with honey following myocardial infarction. Maybe, the existence of antioxidants and energy sources (glucose and fructose) in honey composition and improvement of hemodynamic functions may involve in those protective effects.
Sirtinol abrogates late phase of cardiac ischemia preconditioning in rats.
Safari, Fereshteh; Shekarforoosh, Shahnaz; Hashemi, Tahmineh; Namvar Aghdash, Simin; Fekri, Asefeh; Safari, Fatemeh
2017-07-01
The aim of this study was to investigate the effect of sirtinol, as an inhibitor of sirtuin NAD-dependent histone deacetylases, on myocardial ischemia reperfusion injury following early and late ischemia preconditioning (IPC). Rats underwent sustained ischemia and reperfusion (IR) alone or proceeded by early or late IPC. Sirtinol (S) was administered before IPC. Arrhythmias were evaluated based on the Lambeth model. Infarct size (IS) was measured using triphenyltetrazolium chloride staining. The transcription level of antioxidant-coding genes was assessed by real-time PCR. In early and late IPC groups, IS and the number of arrhythmia were significantly decreased (P < 0.05 and P < 0.01 vs IR, respectively). In S + early IPC, incidences of arrhythmia and IS were not different compared with the early IPC group. However, in S + late IPC the IS was different from the late IPC group (P < 0.05). In late IPC but not early IPC, transcription levels of catalase (P < 0.01) and Mn-SOD (P < 0.05) increased, although this upregulation was not significant in the S + late IPC group. Our results are consistent with the notion that different mechanisms are responsible for early and late IPC. In addition, sirtuin NAD-dependent histone deacetylases may be implicated in late IPC-induced cardioprotection.
Cerenkov luminescence tomography based on preconditioning orthogonal matching pursuit
Liu, Haixiao; Hu, Zhenhua; Wang, Kun; Tian, Jie; Yang, Xin
2015-03-01
Cerenkov luminescence imaging (CLI) is a novel optical imaging method and has been proved to be a potential substitute of the traditional radionuclide imaging such as positron emission tomography (PET) and single-photon emission computed tomography (SPECT). This imaging method inherits the high sensitivity of nuclear medicine and low cost of optical molecular imaging. To obtain the depth information of the radioactive isotope, Cerenkov luminescence tomography (CLT) is established and the 3D distribution of the isotope is reconstructed. However, because of the strong absorption and scatter, the reconstruction of the CLT sources is always converted to an ill-posed linear system which is hard to be solved. In this work, the sparse nature of the light source was taken into account and the preconditioning orthogonal matching pursuit (POMP) method was established to effectively reduce the ill-posedness and obtain better reconstruction accuracy. To prove the accuracy and speed of this algorithm, a heterogeneous numerical phantom experiment and an in vivo mouse experiment were conducted. Both the simulation result and the mouse experiment showed that our reconstruction method can provide more accurate reconstruction result compared with the traditional Tikhonov regularization method and the ordinary orthogonal matching pursuit (OMP) method. Our reconstruction method will provide technical support for the biological application for Cerenkov luminescence.
Deregulation - precondition for distributed energy in the economies in transition
International Nuclear Information System (INIS)
Brendow, K.
2001-01-01
This paper holds that deregulation, i.e. restructuring, competition and privatisation, is the main precondition for a more pronounced development of distributed power (DP) in the economies in transition in central and eastern Europe. This, then, raises the question how far the electricity, gas, steam and heat generating industries have presently moved on their way towards more market-oriented frameworks, competition and private ownership. A good benchmark for measuring progress is the existence (or lack thereof), and nature, of regulatory regimes enabling fair competition among large centralised and small decentralised power, and between wholesale generators and distributors on the one hand and customers or ''autoproducers'' or power merchants on the other. The paper describes the regulatory models applied or contemplated in the winter 2000/2001 in the various countries of central and eastern Europe and identifies fifteen general issues that require attention and solution. With regard to DP, it concludes that a major upswing is unlikely to occur before 2005-2008. While technological options abound, the institutional frameworks for customer-owned competitive DP systems are only being contemplated at present and only rarely put in place.(author)
FALCON Code Simulation for Verification of Fuel Preconditioning Guideline
Energy Technology Data Exchange (ETDEWEB)
Lee, Hee-Hun; Kwon, Oh-Hyun; Kim, Hong-Jin; Kim, Yong-Hwan [KEPCO Nuclear Fuel Co. Ltd., Daejeon (Korea, Republic of)
2015-10-15
The magnitude and rate of power increases are key factors in the PCI failure process. KEPCO NF (KNF) provides operational restrictions called fuel preconditioning guideline (FPG) to mitigate PCI failures. The FPG contains recommended power maneuvering restrictions that should be followed when the KNF supplied fuel is being operated in-reactor. This guideline typically includes controlled power ramp rates, threshold power levels to initiate controlled ramp rates, and restrictions on the operating conditions that impact the potential for PCI failure. The purpose of the FPG is to allow time for stress relaxation to reduce cladding stress buildup during power maneuvers. Two general approaches have been adopted in the development of FPG to mitigate PCI failure in operating commercial reactors. The first approach relies primarily on past operational experience and power ramp test. The second one uses an analytical methodology where a figure-of-merit representative of PCI vulnerability, generally cladding hoop stress, is calculated using a fuel performance code. FALCON simulation can be the identification of a PCI limit parameter, typically cladding hoop stress, which can be used to evaluate a power maneuvering restriction on FPG. The PCI analysis is to assess the cladding hoop stress under various power ramp conditions. Startup ramp rate doesn't affect PCI failure until 50% of rated thermal power.
Inelastic scattering with Chebyshev polynomials and preconditioned conjugate gradient minimization.
Temel, Burcin; Mills, Greg; Metiu, Horia
2008-03-27
We describe and test an implementation, using a basis set of Chebyshev polynomials, of a variational method for solving scattering problems in quantum mechanics. This minimum error method (MEM) determines the wave function Psi by minimizing the least-squares error in the function (H Psi - E Psi), where E is the desired scattering energy. We compare the MEM to an alternative, the Kohn variational principle (KVP), by solving the Secrest-Johnson model of two-dimensional inelastic scattering, which has been studied previously using the KVP and for which other numerical solutions are available. We use a conjugate gradient (CG) method to minimize the error, and by preconditioning the CG search, we are able to greatly reduce the number of iterations necessary; the method is thus faster and more stable than a matrix inversion, as is required in the KVP. Also, we avoid errors due to scattering off of the boundaries, which presents substantial problems for other methods, by matching the wave function in the interaction region to the correct asymptotic states at the specified energy; the use of Chebyshev polynomials allows this boundary condition to be implemented accurately. The use of Chebyshev polynomials allows for a rapid and accurate evaluation of the kinetic energy. This basis set is as efficient as plane waves but does not impose an artificial periodicity on the system. There are problems in surface science and molecular electronics which cannot be solved if periodicity is imposed, and the Chebyshev basis set is a good alternative in such situations.
Preconditioned augmented Lagrangian formulation for nearly incompressible cardiac mechanics.
Campos, Joventino Oliveira; Dos Santos, Rodrigo Weber; Sundnes, Joakim; Rocha, Bernardo Martins
2018-04-01
Computational modeling of the heart is a subject of substantial medical and scientific interest, which may contribute to increase the understanding of several phenomena associated with cardiac physiological and pathological states. Modeling the mechanics of the heart have led to considerable insights, but it still represents a complex and a demanding computational problem, especially in a strongly coupled electromechanical setting. Passive cardiac tissue is commonly modeled as hyperelastic and is characterized by quasi-incompressible, orthotropic, and nonlinear material behavior. These factors are known to be very challenging for the numerical solution of the model. The near-incompressibility is known to cause numerical issues such as the well-known locking phenomenon and ill-conditioning of the stiffness matrix. In this work, the augmented Lagrangian method is used to handle the nearly incompressible condition. This approach can potentially improve computational performance by reducing the condition number of the stiffness matrix and thereby improving the convergence of iterative solvers. We also improve the performance of iterative solvers by the use of an algebraic multigrid preconditioner. Numerical results of the augmented Lagrangian method combined with a preconditioned iterative solver for a cardiac mechanics benchmark suite are presented to show its improved performance. Copyright © 2017 John Wiley & Sons, Ltd.
Liu, Lulu
2013-01-01
The fully implicit approach is attractive in reservoir simulation for reasons of numerical stability and the avoidance of splitting errors when solving multiphase flow problems, but a large nonlinear system must be solved at each time step, so efficient and robust numerical methods are required to treat the nonlinearity. The Additive Schwarz Preconditioned Inexact Newton (ASPIN) framework, as an option for the outermost solver, successfully handles strong nonlinearities in computational fluid dynamics, but is barely explored for the highly nonlinear models of complex multiphase flow with capillarity, heterogeneity, and complex geometry. In this paper, the fully implicit ASPIN method is demonstrated for a finite volume discretization based on incompressible two-phase reservoir simulators in the presence of capillary forces and gravity. Numerical experiments show that the number of global nonlinear iterations is not only scalable with respect to the number of processors, but also significantly reduced compared with the standard inexact Newton method with a backtracking technique. Moreover, the ASPIN method, in contrast with the IMPES method, saves overall execution time because of the savings in timestep size.
A systematic approach to robust preconditioning for gradient-based inverse scattering algorithms
International Nuclear Information System (INIS)
Nordebo, Sven; Fhager, Andreas; Persson, Mikael; Gustafsson, Mats
2008-01-01
This paper presents a systematic approach to robust preconditioning for gradient-based nonlinear inverse scattering algorithms. In particular, one- and two-dimensional inverse problems are considered where the permittivity and conductivity profiles are unknown and the input data consist of the scattered field over a certain bandwidth. A time-domain least-squares formulation is employed and the inversion algorithm is based on a conjugate gradient or quasi-Newton algorithm together with an FDTD-electromagnetic solver. A Fisher information analysis is used to estimate the Hessian of the error functional. A robust preconditioner is then obtained by incorporating a parameter scaling such that the scaled Fisher information has a unit diagonal. By improving the conditioning of the Hessian, the convergence rate of the conjugate gradient or quasi-Newton methods are improved. The preconditioner is robust in the sense that the scaling, i.e. the diagonal Fisher information, is virtually invariant to the numerical resolution and the discretization model that is employed. Numerical examples of image reconstruction are included to illustrate the efficiency of the proposed technique
Application of preconditioned GMRES to the numerical solution of the neutron transport equation
International Nuclear Information System (INIS)
Patton, B.W.; Holloway, J.P.
2002-01-01
The generalized minimal residual (GMRES) method with right preconditioning is examined as an alternative to both standard and accelerated transport sweeps for the iterative solution of the diamond differenced discrete ordinates neutron transport equation. Incomplete factorization (ILU) type preconditioners are used to determine their effectiveness in accelerating GMRES for this application. ILU(τ), which requires the specification of a dropping criteria τ, proves to be a good choice for the types of problems examined in this paper. The combination of ILU(τ) and GMRES is compared with both DSA and unaccelerated transport sweeps for several model problems. It is found that the computational workload of the ILU(τ)-GMRES combination scales nonlinearly with the number of energy groups and quadrature order, making this technique most effective for problems with a small number of groups and discrete ordinates. However, the cost of preconditioner construction can be amortized over several calculations with different source and/or boundary values. Preconditioners built upon standard transport sweep algorithms are also evaluated as to their effectiveness in accelerating the convergence of GMRES. These preconditioners show better scaling with such problem parameters as the scattering ratio, the number of discrete ordinates, and the number of spatial meshes. These sweeps based preconditioners can also be cast in a matrix free form that greatly reduces storage requirements
Parallel discrete event simulation
Overeinder, B.J.; Hertzberger, L.O.; Sloot, P.M.A.; Withagen, W.J.
1991-01-01
In simulating applications for execution on specific computing systems, the simulation performance figures must be known in a short period of time. One basic approach to the problem of reducing the required simulation time is the exploitation of parallelism. However, in parallelizing the simulation
Parallel reservoir simulator computations
International Nuclear Information System (INIS)
Hemanth-Kumar, K.; Young, L.C.
1995-01-01
The adaptation of a reservoir simulator for parallel computations is described. The simulator was originally designed for vector processors. It performs approximately 99% of its calculations in vector/parallel mode and relative to scalar calculations it achieves speedups of 65 and 81 for black oil and EOS simulations, respectively on the CRAY C-90
Totally parallel multilevel algorithms
Frederickson, Paul O.
1988-01-01
Four totally parallel algorithms for the solution of a sparse linear system have common characteristics which become quite apparent when they are implemented on a highly parallel hypercube such as the CM2. These four algorithms are Parallel Superconvergent Multigrid (PSMG) of Frederickson and McBryan, Robust Multigrid (RMG) of Hackbusch, the FFT based Spectral Algorithm, and Parallel Cyclic Reduction. In fact, all four can be formulated as particular cases of the same totally parallel multilevel algorithm, which are referred to as TPMA. In certain cases the spectral radius of TPMA is zero, and it is recognized to be a direct algorithm. In many other cases the spectral radius, although not zero, is small enough that a single iteration per timestep keeps the local error within the required tolerance.
Energy Technology Data Exchange (ETDEWEB)
1991-10-23
An account of the Caltech Concurrent Computation Program (C{sup 3}P), a five year project that focused on answering the question: Can parallel computers be used to do large-scale scientific computations '' As the title indicates, the question is answered in the affirmative, by implementing numerous scientific applications on real parallel computers and doing computations that produced new scientific results. In the process of doing so, C{sup 3}P helped design and build several new computers, designed and implemented basic system software, developed algorithms for frequently used mathematical computations on massively parallel machines, devised performance models and measured the performance of many computers, and created a high performance computing facility based exclusively on parallel computers. While the initial focus of C{sup 3}P was the hypercube architecture developed by C. Seitz, many of the methods developed and lessons learned have been applied successfully on other massively parallel architectures.
Domain decomposition methods and parallel computing
International Nuclear Information System (INIS)
Meurant, G.
1991-01-01
In this paper, we show how to efficiently solve large linear systems on parallel computers. These linear systems arise from discretization of scientific computing problems described by systems of partial differential equations. We show how to get a discrete finite dimensional system from the continuous problem and the chosen conjugate gradient iterative algorithm is briefly described. Then, the different kinds of parallel architectures are reviewed and their advantages and deficiencies are emphasized. We sketch the problems found in programming the conjugate gradient method on parallel computers. For this algorithm to be efficient on parallel machines, domain decomposition techniques are introduced. We give results of numerical experiments showing that these techniques allow a good rate of convergence for the conjugate gradient algorithm as well as computational speeds in excess of a billion of floating point operations per second. (author). 5 refs., 11 figs., 2 tabs., 1 inset
Shared Variable Oriented Parallel Precompiler for SPMD Model
Institute of Scientific and Technical Information of China (English)
无
1995-01-01
For the moment,commercial parallel computer systems with distributed memory architecture are usually provided with parallel FORTRAN or parallel C compliers,which are just traditional sequential FORTRAN or C compilers expanded with communication statements.Programmers suffer from writing parallel programs with communication statements. The Shared Variable Oriented Parallel Precompiler (SVOPP) proposed in this paper can automatically generate appropriate communication statements based on shared variables for SPMD(Single Program Multiple Data) computation model and greatly ease the parallel programming with high communication efficiency.The core function of parallel C precompiler has been successfully verified on a transputer-based parallel computer.Its prominent performance shows that SVOPP is probably a break-through in parallel programming technique.
International Nuclear Information System (INIS)
Yamazaki, Takao; Fujisaki, Masahide; Okuda, Motoi; Takano, Makoto; Masukawa, Fumihiro; Naito, Yoshitaka
1993-01-01
The general purpose Monte Carlo code MCNP4 has been implemented on the Fujitsu AP1000 distributed memory highly parallel computer. Parallelization techniques developed and studied are reported. A shielding analysis function of the MCNP4 code is parallelized in this study. A technique to map a history to each processor dynamically and to map control process to a certain processor was applied. The efficiency of parallelized code is up to 80% for a typical practical problem with 512 processors. These results demonstrate the advantages of a highly parallel computer to the conventional computers in the field of shielding analysis by Monte Carlo method. (orig.)
Implementations of BLAST for parallel computers.
Jülich, A
1995-02-01
The BLAST sequence comparison programs have been ported to a variety of parallel computers-the shared memory machine Cray Y-MP 8/864 and the distributed memory architectures Intel iPSC/860 and nCUBE. Additionally, the programs were ported to run on workstation clusters. We explain the parallelization techniques and consider the pros and cons of these methods. The BLAST programs are very well suited for parallelization for a moderate number of processors. We illustrate our results using the program blastp as an example. As input data for blastp, a 799 residue protein query sequence and the protein database PIR were used.
Language constructs for modular parallel programs
Energy Technology Data Exchange (ETDEWEB)
Foster, I.
1996-03-01
We describe programming language constructs that facilitate the application of modular design techniques in parallel programming. These constructs allow us to isolate resource management and processor scheduling decisions from the specification of individual modules, which can themselves encapsulate design decisions concerned with concurrence, communication, process mapping, and data distribution. This approach permits development of libraries of reusable parallel program components and the reuse of these components in different contexts. In particular, alternative mapping strategies can be explored without modifying other aspects of program logic. We describe how these constructs are incorporated in two practical parallel programming languages, PCN and Fortran M. Compilers have been developed for both languages, allowing experimentation in substantial applications.
Portable, parallel, reusable Krylov space codes
Energy Technology Data Exchange (ETDEWEB)
Smith, B.; Gropp, W. [Argonne National Lab., IL (United States)
1994-12-31
Krylov space accelerators are an important component of many algorithms for the iterative solution of linear systems. Each Krylov space method has it`s own particular advantages and disadvantages, therefore it is desirable to have a variety of them available all with an identical, easy to use, interface. A common complaint application programmers have with available software libraries for the iterative solution of linear systems is that they require the programmer to use the data structures provided by the library. The library is not able to work with the data structures of the application code. Hence, application programmers find themselves constantly recoding the Krlov space algorithms. The Krylov space package (KSP) is a data-structure-neutral implementation of a variety of Krylov space methods including preconditioned conjugate gradient, GMRES, BiCG-Stab, transpose free QMR and CGS. Unlike all other software libraries for linear systems that the authors are aware of, KSP will work with any application codes data structures, in Fortran or C. Due to it`s data-structure-neutral design KSP runs unchanged on both sequential and parallel machines. KSP has been tested on workstations, the Intel i860 and Paragon, Thinking Machines CM-5 and the IBM SP1.
Parallel Computing Strategies for Irregular Algorithms
Biswas, Rupak; Oliker, Leonid; Shan, Hongzhang; Biegel, Bryan (Technical Monitor)
2002-01-01
Parallel computing promises several orders of magnitude increase in our ability to solve realistic computationally-intensive problems, but relies on their efficient mapping and execution on large-scale multiprocessor architectures. Unfortunately, many important applications are irregular and dynamic in nature, making their effective parallel implementation a daunting task. Moreover, with the proliferation of parallel architectures and programming paradigms, the typical scientist is faced with a plethora of questions that must be answered in order to obtain an acceptable parallel implementation of the solution algorithm. In this paper, we consider three representative irregular applications: unstructured remeshing, sparse matrix computations, and N-body problems, and parallelize them using various popular programming paradigms on a wide spectrum of computer platforms ranging from state-of-the-art supercomputers to PC clusters. We present the underlying problems, the solution algorithms, and the parallel implementation strategies. Smart load-balancing, partitioning, and ordering techniques are used to enhance parallel performance. Overall results demonstrate the complexity of efficiently parallelizing irregular algorithms.
Non-Cartesian parallel imaging reconstruction.
Wright, Katherine L; Hamilton, Jesse I; Griswold, Mark A; Gulani, Vikas; Seiberlich, Nicole
2014-11-01
Non-Cartesian parallel imaging has played an important role in reducing data acquisition time in MRI. The use of non-Cartesian trajectories can enable more efficient coverage of k-space, which can be leveraged to reduce scan times. These trajectories can be undersampled to achieve even faster scan times, but the resulting images may contain aliasing artifacts. Just as Cartesian parallel imaging can be used to reconstruct images from undersampled Cartesian data, non-Cartesian parallel imaging methods can mitigate aliasing artifacts by using additional spatial encoding information in the form of the nonhomogeneous sensitivities of multi-coil phased arrays. This review will begin with an overview of non-Cartesian k-space trajectories and their sampling properties, followed by an in-depth discussion of several selected non-Cartesian parallel imaging algorithms. Three representative non-Cartesian parallel imaging methods will be described, including Conjugate Gradient SENSE (CG SENSE), non-Cartesian generalized autocalibrating partially parallel acquisition (GRAPPA), and Iterative Self-Consistent Parallel Imaging Reconstruction (SPIRiT). After a discussion of these three techniques, several potential promising clinical applications of non-Cartesian parallel imaging will be covered. © 2014 Wiley Periodicals, Inc.
Parallel conjugate gradient algorithms for manipulator dynamic simulation
Fijany, Amir; Scheld, Robert E.
1989-01-01
Parallel conjugate gradient algorithms for the computation of multibody dynamics are developed for the specialized case of a robot manipulator. For an n-dimensional positive-definite linear system, the Classical Conjugate Gradient (CCG) algorithms are guaranteed to converge in n iterations, each with a computation cost of O(n); this leads to a total computational cost of O(n sq) on a serial processor. A conjugate gradient algorithms is presented that provide greater efficiency using a preconditioner, which reduces the number of iterations required, and by exploiting parallelism, which reduces the cost of each iteration. Two Preconditioned Conjugate Gradient (PCG) algorithms are proposed which respectively use a diagonal and a tridiagonal matrix, composed of the diagonal and tridiagonal elements of the mass matrix, as preconditioners. Parallel algorithms are developed to compute the preconditioners and their inversions in O(log sub 2 n) steps using n processors. A parallel algorithm is also presented which, on the same architecture, achieves the computational time of O(log sub 2 n) for each iteration. Simulation results for a seven degree-of-freedom manipulator are presented. Variants of the proposed algorithms are also developed which can be efficiently implemented on the Robot Mathematics Processor (RMP).
Improving image quality of parallel phase-shifting digital holography
International Nuclear Information System (INIS)
Awatsuji, Yasuhiro; Tahara, Tatsuki; Kaneko, Atsushi; Koyama, Takamasa; Nishio, Kenzo; Ura, Shogo; Kubota, Toshihiro; Matoba, Osamu
2008-01-01
The authors propose parallel two-step phase-shifting digital holography to improve the image quality of parallel phase-shifting digital holography. The proposed technique can increase the effective number of pixels of hologram twice in comparison to the conventional parallel four-step technique. The increase of the number of pixels makes it possible to improve the image quality of the reconstructed image of the parallel phase-shifting digital holography. Numerical simulation and preliminary experiment of the proposed technique were conducted and the effectiveness of the technique was confirmed. The proposed technique is more practical than the conventional parallel phase-shifting digital holography, because the composition of the digital holographic system based on the proposed technique is simpler.
Hyperbaric oxygen preconditioning protects against traumatic brain injury at high altitude.
Hu, S L; Hu, R; Li, F; Liu, Z; Xia, Y Z; Cui, G Y; Feng, H
2008-01-01
Recent studies have shown that preconditioning with hyperbaric oxygen (HBO) can reduce ischemic and hemorrhagic brain injury. We investigated effects of HBO preconditioning on traumatic brain injury (TBI) at high altitude and examined the role of matrix metalloproteinase-9 (MMP-9) in such protection. Rats were randomly divided into 3 groups: HBO preconditioning group (HBOP; n = 13), high-altitude group (HA; n = 13), and high-altitude sham operation group (HASO; n = 13). All groups were subjected to head trauma by weight-drop device, except for HASO group. HBOP rats received 5 sessions of HBO preconditioning (2.5 ATA, 100% oxygen, 1 h daily) and then were kept in hypobaric chamber at 0.6 ATA (to simulate pressure at 4000m altitude) for 3 days before operation. HA rats received control pretreatment (1 ATA, room air, 1 h daily), then followed the same procedures as HBOP group. HASO rats were subjected to skull opening only without brain injury. Twenty-four hours after TBI, 7 rats from each group were examined for neurological function and brain water content; 6 rats from each group were killed for analysis by H&E staining and immunohistochemistry. Neurological outcome in HBOP group (0.71 +/- 0.49) was better than HA group (1.57 +/- 0.53; p < 0.05). Preconditioning with HBO significantly reduced percentage of brain water content (86.24 +/- 0.52 vs. 84.60 +/- 0.37; p < 0.01). Brain morphology and structure seen by light microscopy was diminished in HA group, while fewer pathological injuries occurred in HBOP group. Compared to HA group, pretreatment with HBO significantly reduced the number of MMP-9-positive cells (92.25 +/- 8.85 vs. 74.42 +/- 6.27; p < 0.01). HBO preconditioning attenuates TBI in rats at high altitude. Decline in MMP-9 expression may contribute to HBO preconditioning-induced protection of brain tissue against TBI.
Preconditioning with endoplasmic reticulum stress ameliorates endothelial cell inflammation.
Leonard, Antony; Paton, Adrienne W; El-Quadi, Monaliza; Paton, James C; Fazal, Fabeha
2014-01-01
Endoplasmic Reticulum (ER) stress, caused by disturbance in ER homeostasis, has been implicated in several pathological conditions such as ischemic injury, neurodegenerative disorders, metabolic diseases and more recently in inflammatory conditions. Our present study aims at understanding the role of ER stress in endothelial cell (EC) inflammation, a critical event in the pathogenesis of acute lung injury (ALI). We found that preconditioning human pulmonary artery endothelial cells (HPAEC) to ER stress either by depleting ER chaperone and signaling regulator BiP using siRNA, or specifically cleaving (inactivating) BiP using subtilase cytotoxin (SubAB), alleviates EC inflammation. The two approaches adopted to abrogate BiP function induced ATF4 protein expression and the phosphorylation of eIF2α, both markers of ER stress, which in turn resulted in blunting the activation of NF-κB, and restoring endothelial barrier integrity. Pretreatment of HPAEC with BiP siRNA inhibited thrombin-induced IκBα degradation and its resulting downstream signaling pathway involving NF-κB nuclear translocation, DNA binding, phosphorylation at serine536, transcriptional activation and subsequent expression of adhesion molecules. However, TNFα-mediated NF-κB signaling was unaffected upon BiP knockdown. In an alternative approach, SubAB-mediated inactivation of NF-κB was independent of IκBα degradation. Mechanistic analysis revealed that pretreatment of EC with SubAB interfered with the binding of the liberated NF-κB to the DNA, thereby resulting in reduced expression of adhesion molecules, cytokines and chemokines. In addition, both knockdown and inactivation of BiP stimulated actin cytoskeletal reorganization resulting in restoration of endothelial permeability. Together our studies indicate that BiP plays a central role in EC inflammation and injury via its action on NF-κB activation and regulation of vascular permeability.
Preconditioning of Interplanetary Space Due to Transient CME Disturbances
International Nuclear Information System (INIS)
Temmer, M.; Reiss, M. A.; Hofmeister, S. J.; Veronig, A. M.; Nikolic, L.
2017-01-01
Interplanetary space is characteristically structured mainly by high-speed solar wind streams emanating from coronal holes and transient disturbances such as coronal mass ejections (CMEs). While high-speed solar wind streams pose a continuous outflow, CMEs abruptly disrupt the rather steady structure, causing large deviations from the quiet solar wind conditions. For the first time, we give a quantification of the duration of disturbed conditions (preconditioning) for interplanetary space caused by CMEs. To this aim, we investigate the plasma speed component of the solar wind and the impact of in situ detected interplanetary CMEs (ICMEs), compared to different background solar wind models (ESWF, WSA, persistence model) for the time range 2011–2015. We quantify in terms of standard error measures the deviations between modeled background solar wind speed and observed solar wind speed. Using the mean absolute error, we obtain an average deviation for quiet solar activity within a range of 75.1–83.1 km s −1 . Compared to this baseline level, periods within the ICME interval showed an increase of 18%–32% above the expected background, and the period of two days after the ICME displayed an increase of 9%–24%. We obtain a total duration of enhanced deviations over about three and up to six days after the ICME start, which is much longer than the average duration of an ICME disturbance itself (∼1.3 days), concluding that interplanetary space needs ∼2–5 days to recover from the impact of ICMEs. The obtained results have strong implications for studying CME propagation behavior and also for space weather forecasting.
Preconditioning of Interplanetary Space Due to Transient CME Disturbances
Energy Technology Data Exchange (ETDEWEB)
Temmer, M.; Reiss, M. A.; Hofmeister, S. J.; Veronig, A. M. [Institute of Physics, University of Graz, Universitätsplatz 5/II, A-8010 Graz (Austria); Nikolic, L., E-mail: manuela.temmer@uni-graz.at [Canadian Hazards Information Service, Natural Resources Canada, 2617 Anderson Road, Ottawa, Ontario K1A 0Y3 (Canada)
2017-02-01
Interplanetary space is characteristically structured mainly by high-speed solar wind streams emanating from coronal holes and transient disturbances such as coronal mass ejections (CMEs). While high-speed solar wind streams pose a continuous outflow, CMEs abruptly disrupt the rather steady structure, causing large deviations from the quiet solar wind conditions. For the first time, we give a quantification of the duration of disturbed conditions (preconditioning) for interplanetary space caused by CMEs. To this aim, we investigate the plasma speed component of the solar wind and the impact of in situ detected interplanetary CMEs (ICMEs), compared to different background solar wind models (ESWF, WSA, persistence model) for the time range 2011–2015. We quantify in terms of standard error measures the deviations between modeled background solar wind speed and observed solar wind speed. Using the mean absolute error, we obtain an average deviation for quiet solar activity within a range of 75.1–83.1 km s{sup −1}. Compared to this baseline level, periods within the ICME interval showed an increase of 18%–32% above the expected background, and the period of two days after the ICME displayed an increase of 9%–24%. We obtain a total duration of enhanced deviations over about three and up to six days after the ICME start, which is much longer than the average duration of an ICME disturbance itself (∼1.3 days), concluding that interplanetary space needs ∼2–5 days to recover from the impact of ICMEs. The obtained results have strong implications for studying CME propagation behavior and also for space weather forecasting.
Angiotensin II Removes Kidney Resistance Conferred by Ischemic Preconditioning
Directory of Open Access Journals (Sweden)
Hee-Seong Jang
2014-01-01
Full Text Available Ischemic preconditioning (IPC by ischemia/reperfusion (I/R renders resistance to the kidney. Strong IPC triggers kidney fibrosis, which is involved in angiotensin II (AngII and its type 1 receptor (AT1R signaling. Here, we investigated the role of AngII/AT1R signal pathway in the resistance of IPC kidneys to subsequent I/R injury. IPC of kidneys was generated by 30 minutes of bilateral renal ischemia and 8 days of reperfusion. Sham-operation was performed to generate control (non-IPC mice. To examine the roles of AngII and AT1R in IPC kidneys to subsequent I/R, IPC kidneys were subjected to either 30 minutes of bilateral kidney ischemia or sham-operation following treatment with AngII, losartan (AT1R blocker, or AngII plus losartan. IPC kidneys showed fibrotic changes, decreased AngII, and increased AT1R expression. I/R dramatically increased plasma creatinine concentrations in non-IPC mice, but not in IPC mice. AngII treatment in IPC mice resulted in enhanced morphological damage, oxidative stress, and inflammatory responses, with functional impairment, whereas losartan treatment reversed these effects. However, AngII treatment in non-IPC mice did not change I/R-induced injury. AngII abolished the resistance of IPC kidneys to subsequent I/R via the enhancement of oxidative stress and inflammatory responses, suggesting that the AngII/AT1R signaling pathway is associated with outcome in injury-experienced kidney.
Algorithms for parallel computers
International Nuclear Information System (INIS)
Churchhouse, R.F.
1985-01-01
Until relatively recently almost all the algorithms for use on computers had been designed on the (usually unstated) assumption that they were to be run on single processor, serial machines. With the introduction of vector processors, array processors and interconnected systems of mainframes, minis and micros, however, various forms of parallelism have become available. The advantage of parallelism is that it offers increased overall processing speed but it also raises some fundamental questions, including: (i) which, if any, of the existing 'serial' algorithms can be adapted for use in the parallel mode. (ii) How close to optimal can such adapted algorithms be and, where relevant, what are the convergence criteria. (iii) How can we design new algorithms specifically for parallel systems. (iv) For multi-processor systems how can we handle the software aspects of the interprocessor communications. Aspects of these questions illustrated by examples are considered in these lectures. (orig.)
Parallelism and array processing
International Nuclear Information System (INIS)
Zacharov, V.
1983-01-01
Modern computing, as well as the historical development of computing, has been dominated by sequential monoprocessing. Yet there is the alternative of parallelism, where several processes may be in concurrent execution. This alternative is discussed in a series of lectures, in which the main developments involving parallelism are considered, both from the standpoint of computing systems and that of applications that can exploit such systems. The lectures seek to discuss parallelism in a historical context, and to identify all the main aspects of concurrency in computation right up to the present time. Included will be consideration of the important question as to what use parallelism might be in the field of data processing. (orig.)
Parallel magnetic resonance imaging
International Nuclear Information System (INIS)
Larkman, David J; Nunes, Rita G
2007-01-01
Parallel imaging has been the single biggest innovation in magnetic resonance imaging in the last decade. The use of multiple receiver coils to augment the time consuming Fourier encoding has reduced acquisition times significantly. This increase in speed comes at a time when other approaches to acquisition time reduction were reaching engineering and human limits. A brief summary of spatial encoding in MRI is followed by an introduction to the problem parallel imaging is designed to solve. There are a large number of parallel reconstruction algorithms; this article reviews a cross-section, SENSE, SMASH, g-SMASH and GRAPPA, selected to demonstrate the different approaches. Theoretical (the g-factor) and practical (coil design) limits to acquisition speed are reviewed. The practical implementation of parallel imaging is also discussed, in particular coil calibration. How to recognize potential failure modes and their associated artefacts are shown. Well-established applications including angiography, cardiac imaging and applications using echo planar imaging are reviewed and we discuss what makes a good application for parallel imaging. Finally, active research areas where parallel imaging is being used to improve data quality by repairing artefacted images are also reviewed. (invited topical review)
Microwave tomography global optimization, parallelization and performance evaluation
Noghanian, Sima; Desell, Travis; Ashtari, Ali
2014-01-01
This book provides a detailed overview on the use of global optimization and parallel computing in microwave tomography techniques. The book focuses on techniques that are based on global optimization and electromagnetic numerical methods. The authors provide parallelization techniques on homogeneous and heterogeneous computing architectures on high performance and general purpose futuristic computers. The book also discusses the multi-level optimization technique, hybrid genetic algorithm and its application in breast cancer imaging.
Directory of Open Access Journals (Sweden)
Eugene V. Golanov
2017-09-01
Full Text Available Excitation of intrinsic neurons of cerebellar fastigial nucleus (FN renders brain tolerant to local and global ischemia. This effect reaches a maximum 72 h after the stimulation and lasts over 10 days. Comparable neuroprotection is observed following sublethal global brain ischemia, a phenomenon known as preconditioning. We hypothesized that FN may participate in the mechanisms of ischemic preconditioning as a part of the intrinsic neuroprotective mechanism. To explore potential significance of FN neurons in brain ischemic tolerance we lesioned intrinsic FN neurons with excitotoxin ibotenic acid five days before exposure to 20 min four-vessel occlusion (4-VO global ischemia while analyzing neuronal damage in Cornu Ammoni area 1 (CA1 hippocampal area one week later. In FN-lesioned animals, loss of CA1 cells was higher by 22% compared to control (phosphate buffered saline (PBS-injected animals. Moreover, lesion of FN neurons increased morbidity following global ischemia by 50%. Ablation of FN neurons also reversed salvaging effects of five-minute ischemic preconditioning on CA1 neurons and morbidity, while ablation of cerebellar dentate nucleus neurons did not change effect of ischemic preconditioning. We conclude that FN is an important part of intrinsic neuroprotective system, which participates in ischemic preconditioning and may participate in naturally occurring neuroprotection, such as “diving response”.
Zhang, Xiao-bo
2017-06-01
The gradient preconditioning approach based on seismic wave energy can effectively avoid the huge storage consumption in the gradient preconditioning algorithms based on Hessian matrices in time-domain full waveform inversion (FWI), but the accuracy is affected by the energy of reflected waves when strong reflectors are present in velocity model. To address this problem, we propose a gradient preconditioning method, which scales the gradient based on the energy of the “approximated transmitted wavefield” simulated by the nonreflecting acoustic wave equation. The method does not require computing or storing the Hessian matrix or its inverse. Furthermore, it can effectively eliminate the effects caused by geometric diffusion and non-uniformity illumination on gradient. The results of model experiments confirm that the time-domain FWI using the gradient preconditioning based on transmitted waves energy can achieve higher inversion precision for high-velocity body and the deep strata below when compared with using the gradient preconditioning based on seismic waves energy.
Super-low dose endotoxin pre-conditioning exacerbates sepsis mortality.
Chen, Keqiang; Geng, Shuo; Yuan, Ruoxi; Diao, Na; Upchurch, Zachary; Li, Liwu
2015-04-01
Sepsis mortality varies dramatically in individuals of variable immune conditions, with poorly defined mechanisms. This phenomenon complements the hypothesis that innate immunity may adopt rudimentary memory, as demonstrated in vitro with endotoxin priming and tolerance in cultured monocytes. However, previous in vivo studies only examined the protective effect of endotoxin tolerance in the context of sepsis. In sharp contrast, we report herein that pre-conditionings with super-low or low dose endotoxin lipopolysaccharide (LPS) cause strikingly opposite survival outcomes. Mice pre-conditioned with super-low dose LPS experienced severe tissue damage, inflammation, increased bacterial load in circulation, and elevated mortality when they were subjected to cecal-ligation and puncture (CLP). This is in opposite to the well-reported protective phenomenon with CLP mice pre-conditioned with low dose LPS. Mechanistically, we demonstrated that super-low and low dose LPS differentially modulate the formation of neutrophil extracellular trap (NET) in neutrophils. Instead of increased ERK activation and NET formation in neutrophils pre-conditioned with low dose LPS, we observed significantly reduced ERK activation and compromised NET generation in neutrophils pre-conditioned with super-low dose LPS. Collectively, our findings reveal a novel mechanism potentially responsible for the dynamic programming of innate immunity in vivo as it relates to sepsis risks.
Super-low Dose Endotoxin Pre-conditioning Exacerbates Sepsis Mortality
Directory of Open Access Journals (Sweden)
Keqiang Chen
2015-04-01
Full Text Available Sepsis mortality varies dramatically in individuals of variable immune conditions, with poorly defined mechanisms. This phenomenon complements the hypothesis that innate immunity may adopt rudimentary memory, as demonstrated in vitro with endotoxin priming and tolerance in cultured monocytes. However, previous in vivo studies only examined the protective effect of endotoxin tolerance in the context of sepsis. In sharp contrast, we report herein that pre-conditioning with super-low or low dose endotoxin lipopolysaccharide (LPS cause strikingly opposite survival outcomes. Mice pre-conditioned with super-low dose LPS experienced severe tissue damage, inflammation, increased bacterial load in circulation, and elevated mortality when they were subjected to cecal-ligation and puncture (CLP. This is in contrast to the well-reported protective phenomenon with CLP mice pre-conditioned with low dose LPS. Mechanistically, we demonstrated that super-low and low dose LPS differentially modulate the formation of neutrophil extracellular trap (NET in neutrophils. Instead of increased ERK activation and NET formation in neutrophils pre-conditioned with low dose LPS, we observed significantly reduced ERK activation and compromised NET generation in neutrophils pre-conditioned with super-low dose LPS. Collectively, our findings reveal a mechanism potentially responsible for the dynamic programming of innate immunity in vivo as it relates to sepsis risks.
Rehni, Ashish K; Singh, Thakur Gurjeet
2012-10-01
The present study has been designed to investigate the potential role of CCR-2 chemokine receptor in ischemic preconditioning as well as postconditioning induced reversal of ischemia-reperfusion injury in mouse brain. Bilateral carotid artery occlusion of 17 min followed by reperfusion for 24h was employed in present study to produce ischemia and reperfusion induced cerebral injury in mice. Cerebral infarct size was measured using triphenyltetrazolium chloride staining. Memory was evaluated using elevated plus-maze test and Morris water maze test. Rota rod test was employed to assess motor incoordination. Bilateral carotid artery occlusion followed by reperfusion produced cerebral infarction and impaired memory and motor co-ordination. Three preceding episodes of bilateral carotid artery occlusion for 1 min and reperfusion of 1 min were employed to elicit ischemic preconditioning of brain, while three episodes of bilateral carotid artery occlusion for 10s and reperfusion of 10s immediately after the completion of were employed to elicit ischemic postconditioning of brain. Both prior ischemic preconditioning as well as ischemic postconditioning immediately after global cerebral ischemia prevented markedly ischemia-reperfusion-induced cerebral injury as measured in terms of infarct size, loss of memory and motor coordination. RS 102895, a selective CCR-2 chemokine receptor antagonist, attenuated the neuroprotective effect of both the ischemic preconditioning as well as postconditioning. It is concluded that the neuroprotective effect of both ischemic preconditioning as well as ischemic postconditioning may involve the activation of CCR-2 chemokine receptors. Copyright © 2012 Elsevier Ltd. All rights reserved.
The role of adenosine in preconditioning by brief pressure overload in rats.
Huang, Cheng-Hsiung; Tsai, Shen-Kou; Chiang, Shu-Chiung; Lai, Chang-Chi; Weng, Zen-Chung
2015-08-01
Brief pressure overload of the left ventricle reduced myocardial infarct (MI) size in rabbits has been previously reported. Its effects in other species are not known. This study investigates effects of pressure overload and the role of adenosine in rats in this study. MI was induced by 40-minute occlusion of the left anterior descending coronary artery followed by 3-hour reperfusion. MI size was determined by triphenyl tetrazolium chloride staining. Brief pressure overload was induced by two 10-minute episodes of partial snaring of the ascending aorta. Systolic left ventricular pressure was raised 50% above the baseline value. Ischemic preconditioning was elicited by two 10-minute coronary artery occlusions. The MI size (mean ± standard deviation), expressed as percentage of area at risk, was significantly reduced in the pressure overload group as well as in the ischemic preconditioning group (17.4 ± 3.0% and 18.2 ± 1.5% vs. 26.6 ± 2.4% in the control group, p overload and ischemic preconditioning (18.3 ± 1.5% and 18.2 ± 2.0%, respectively, p overload of the left ventricle preconditioned rat myocardium against infarction. Because SPT did not significantly alter MI size reduction, our results did not support a role of adenosine in preconditioning by pressure overload in rats. Copyright © 2013. Published by Elsevier B.V.
Use of a preconditioned Bi-conjugate gradient method for hybrid plasma stability analysis
International Nuclear Information System (INIS)
Mikic, Z.; Morse, E.C.
1985-01-01
The numerical stability analysis of compact toroidal plasmas using implicit time differencing requires the solution of a set of coupled, 2-dimensional, elliptic partial differential equations for the field quantities at every timestep. When the equations are spatially finite-differenced and written in matrix form, the resulting matrix is large, sparse, complex, non-Hermitian, and indefinite. The use of the preconditioned bi-conjugate gradient method for solving these equations is discussed. The effect of block-diagonal preconditioning and incomplete block-LU preconditionig on the convergence of the method is investigated. For typical matrices arising in our studies, the eigenvalue spectra of the original and preconditioned matrices are calculated as an illustration of the effectiveness of the preconditioning. We show that the preconditioned bi-conjugate gradient method coverages more rapidly than the conjugate gradient method applied to the normal equations, and that it is an effective iterative method for the class of non-Hermitian, indefinite problems of interest
The STAPL Parallel Graph Library
Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable
CSIR Research Space (South Africa)
Lysko, AA
2011-08-01
Full Text Available The condition number for a method-of-moments’ impedance matrix resulting from a junction of several wires is frequency dependant and can be minimized at a given frequency using several approaches. An empirical formula for an optimum, condition...
Portable parallel programming in a Fortran environment
International Nuclear Information System (INIS)
May, E.N.
1989-01-01
Experience using the Argonne-developed PARMACs macro package to implement a portable parallel programming environment is described. Fortran programs with intrinsic parallelism of coarse and medium granularity are easily converted to parallel programs which are portable among a number of commercially available parallel processors in the class of shared-memory bus-based and local-memory network based MIMD processors. The parallelism is implemented using standard UNIX (tm) tools and a small number of easily understood synchronization concepts (monitors and message-passing techniques) to construct and coordinate multiple cooperating processes on one or many processors. Benchmark results are presented for parallel computers such as the Alliant FX/8, the Encore MultiMax, the Sequent Balance, the Intel iPSC/2 Hypercube and a network of Sun 3 workstations. These parallel machines are typical MIMD types with from 8 to 30 processors, each rated at from 1 to 10 MIPS processing power. The demonstration code used for this work is a Monte Carlo simulation of the response to photons of a ''nearly realistic'' lead, iron and plastic electromagnetic and hadronic calorimeter, using the EGS4 code system. 6 refs., 2 figs., 2 tabs
Hypoxic preconditioning induces neuroprotective stanniocalcin-1 in brain via IL-6 signaling
DEFF Research Database (Denmark)
Westberg, Johan A; Serlachius, Martina; Lankila, Petri
2007-01-01
BACKGROUND AND PURPOSE: Exposure of animals for a few hours to moderate hypoxia confers relative protection against subsequent ischemic brain damage. This phenomenon, known as hypoxic preconditioning, depends on new RNA and protein synthesis, but its molecular mechanisms are poorly understood...... originally reported expression of mammalian STC-1 in brain neurons and showed that STC-1 guards neurons against hypercalcemic and hypoxic damage. METHODS: We treated neural Paju cells with IL-6 and measured the induction of STC-1 mRNA. In addition, we quantified the effect of hypoxic preconditioning on Stc-1...... mRNA levels in brains of wild-type and IL-6 deficient mice. Furthermore, we monitored the Stc-1 response in brains of wild-type and transgenic mice, overexpressing IL-6 in the astroglia, before and after induced brain injury. RESULTS: Hypoxic preconditioning induced an upregulated expression of Stc...
Nitroglycerine and sodium trioxodinitrate: from the discovery to the preconditioning effect.
Pagliaro, Pasquale; Gattullo, Donatella; Penna, Claudia
2013-10-01
The history began in the 19th century with Ascanio Sobrero (1812-1888), the discoverer of glycerol trinitrate (nitroglycerine, NTG), and with Angelo Angeli (1864-1931), the discoverer of sodium trioxodinitrate (Angeli's salt). It is likely that Angeli and Sobrero never met, but their two histories will join each other more than a century later. In fact, it has been discovered that both NTG and Angeli's salt are able to induce a preconditioning effect. As NTG has a long history as an antianginal drug its newly discovered property as a preconditioning agent has also been tested in humans. Angeli's salt properties as a preconditioning and inotropic agent have only been tested in animals so far.
DEFF Research Database (Denmark)
Vlassaks, Evi; Brudek, Tomasz; Pakkenberg, Bente
2014-01-01
the effects of perinatal asphyxia and fetal asphyctic preconditioning on the inflammatory cytokine response in the cerebellum. Fetal asphyxia was induced at embryonic day 17 by clamping the uterine vasculature for 30 min. At term birth, global perinatal asphyxia was induced by placing the uterine horns...... was decreased 96 h postfetal asphyxia. When applied as preconditioning stimulus, fetal asphyxia attenuates the cerebellar cytokine response. These results indicate that sublethal fetal asphyxia may protect the cerebellum from perinatal asphyxia-induced damage via inhibition of inflammation.......Asphyctic brain injury is a major cause of neuronal inflammation in the perinatal period. Fetal asphyctic preconditioning has been shown to modulate the cerebral inflammatory cytokine response, hereby protecting the brain against asphyctic injury at birth. This study was designated to examine...
Analysis of a Lipid/Polymer Membrane for Bitterness Sensing with a Preconditioning Process
Directory of Open Access Journals (Sweden)
Rui Yatabe
2015-09-01
Full Text Available It is possible to evaluate the taste of foods or medicines using a taste sensor. The taste sensor converts information on taste into an electrical signal using several lipid/polymer membranes. A lipid/polymer membrane for bitterness sensing can evaluate aftertaste after immersion in monosodium glutamate (MSG, which is called “preconditioning”. However, we have not yet analyzed the change in the surface structure of the membrane as a result of preconditioning. Thus, we analyzed the change in the surface by performing contact angle and surface zeta potential measurements, Fourier transform infrared spectroscopy (FTIR, X-ray photon spectroscopy (XPS and gas cluster ion beam time-of-flight secondary ion mass spectrometry (GCIB-TOF-SIMS. After preconditioning, the concentrations of MSG and tetradodecylammonium bromide (TDAB, contained in the lipid membrane were found to be higher in the surface region than in the bulk region. The effect of preconditioning was revealed by the above analysis methods.
Parallel computation of nondeterministic algorithms in VLSI
Energy Technology Data Exchange (ETDEWEB)
Hortensius, P D
1987-01-01
This work examines parallel VLSI implementations of nondeterministic algorithms. It is demonstrated that conventional pseudorandom number generators are unsuitable for highly parallel applications. Efficient parallel pseudorandom sequence generation can be accomplished using certain classes of elementary one-dimensional cellular automata. The pseudorandom numbers appear in parallel on each clock cycle. Extensive study of the properties of these new pseudorandom number generators is made using standard empirical random number tests, cycle length tests, and implementation considerations. Furthermore, it is shown these particular cellular automata can form the basis of efficient VLSI architectures for computations involved in the Monte Carlo simulation of both the percolation and Ising models from statistical mechanics. Finally, a variation on a Built-In Self-Test technique based upon cellular automata is presented. These Cellular Automata-Logic-Block-Observation (CALBO) circuits improve upon conventional design for testability circuitry.
Helgeland, Erik; Breivik, Lars Ertesvåg; Vaudel, Marc; Svendsen, Øyvind Sverre; Garberg, Hilde; Nordrehaug, Jan Erik; Berven, Frode Steingrimsen; Jonassen, Anne Kristine
2014-01-01
Despite major advances in early revascularization techniques, cardiovascular diseases are still the leading cause of death worldwide, and myocardial infarctions contribute heavily to this. Over the past decades, it has become apparent that reperfusion of blood to a previously ischemic area of the heart causes damage in and of itself, and that this ischemia reperfusion induced injury can be reduced by up to 50% by mechanical manipulation of the blood flow to the heart. The recent discovery of remote ischemic preconditioning (RIPC) provides a non-invasive approach of inducing this cardioprotection at a distance. Finding its endogenous mediators and their operative mode is an important step toward increasing the ischemic tolerance. The release of humoral factor(s) upon RIPC was recently demonstrated and several candidate proteins were published as possible mediators of the cardioprotection. Before clinical applicability, these potential biomarkers and their efficiency must be validated, a task made challenging by the large heterogeneity in reported data and results. Here, in an attempt to reproduce and provide more experimental data on these mediators, we conducted an unbiased in-depth analysis of the human plasma proteome before and after RIPC. From the 68 protein markers reported in the literature, only 28 could be mapped to manually reviewed (Swiss-Prot) protein sequences. 23 of them were monitored in our untargeted experiment. However, their significant regulation could not be reproducibly estimated. In fact, among the 394 plasma proteins we accurately quantified, no significant regulation could be confidently and reproducibly assessed. This indicates that it is difficult to both monitor and reproduce published data from experiments exploring for RIPC induced plasma proteomic regulations, and suggests that further work should be directed towards small humoral factors. To simplify this task, we made our proteomic dataset available via ProteomeXchange, where
SPINning parallel systems software
International Nuclear Information System (INIS)
Matlin, O.S.; Lusk, E.; McCune, W.
2002-01-01
We describe our experiences in using Spin to verify parts of the Multi Purpose Daemon (MPD) parallel process management system. MPD is a distributed collection of processes connected by Unix network sockets. MPD is dynamic processes and connections among them are created and destroyed as MPD is initialized, runs user processes, recovers from faults, and terminates. This dynamic nature is easily expressible in the Spin/Promela framework but poses performance and scalability challenges. We present here the results of expressing some of the parallel algorithms of MPD and executing both simulation and verification runs with Spin
High-Order Calderón Preconditioned Time Domain Integral Equation Solvers
Valdes, Felipe
2013-05-01
Two high-order accurate Calderón preconditioned time domain electric field integral equation (TDEFIE) solvers are presented. In contrast to existing Calderón preconditioned time domain solvers, the proposed preconditioner allows for high-order surface representations and current expansions by using a novel set of fully-localized high-order div-and quasi curl-conforming (DQCC) basis functions. Numerical results demonstrate that the linear systems of equations obtained using the proposed basis functions converge rapidly, regardless of the mesh density and of the order of the current expansion. © 1963-2012 IEEE.
PBMC: Pre-conditioned Backward Monte Carlo code for radiative transport in planetary atmospheres
García Muñoz, A.; Mills, F. P.
2017-08-01
PBMC (Pre-Conditioned Backward Monte Carlo) solves the vector Radiative Transport Equation (vRTE) and can be applied to planetary atmospheres irradiated from above. The code builds the solution by simulating the photon trajectories from the detector towards the radiation source, i.e. in the reverse order of the actual photon displacements. In accounting for the polarization in the sampling of photon propagation directions and pre-conditioning the scattering matrix with information from the scattering matrices of prior (in the BMC integration order) photon collisions, PBMC avoids the unstable and biased solutions of classical BMC algorithms for conservative, optically-thick, strongly-polarizing media such as Rayleigh atmospheres.
High-Order Calderón Preconditioned Time Domain Integral Equation Solvers
Valdes, Felipe; Ghaffari-Miab, Mohsen; Andriulli, Francesco P.; Cools, Kristof; Michielssen,
2013-01-01
Two high-order accurate Calderón preconditioned time domain electric field integral equation (TDEFIE) solvers are presented. In contrast to existing Calderón preconditioned time domain solvers, the proposed preconditioner allows for high-order surface representations and current expansions by using a novel set of fully-localized high-order div-and quasi curl-conforming (DQCC) basis functions. Numerical results demonstrate that the linear systems of equations obtained using the proposed basis functions converge rapidly, regardless of the mesh density and of the order of the current expansion. © 1963-2012 IEEE.
Ohmichi, Yuya
2017-07-01
In this letter, we propose a simple and efficient framework of dynamic mode decomposition (DMD) and mode selection for large datasets. The proposed framework explicitly introduces a preconditioning step using an incremental proper orthogonal decomposition (POD) to DMD and mode selection algorithms. By performing the preconditioning step, the DMD and mode selection can be performed with low memory consumption and therefore can be applied to large datasets. Additionally, we propose a simple mode selection algorithm based on a greedy method. The proposed framework is applied to the analysis of three-dimensional flow around a circular cylinder.
Impact of pre-conditioning on the qualification of safety-related equipment
International Nuclear Information System (INIS)
Isgro, J.R.
1982-01-01
This paper shares some recent experiences on the effects of preconditioning on the qualification of safety-related equipment not located in a harsh environment. Environmental and seismic qualification testing programs were conducted following the guidelines of IEEE 323-1974, IEEE 344-1975 and appropriate IEEE daughter standards, where available. The examples that follow will illustrate the degree of pre-conditioning of safety-related equipment qualified to the requirements of IEEE-323-1974, and its effect on the outcome of the qualification program
Preconditions for Emergence of Lithuanian Clusters: from Informal Cooperation to Its Legitimation
Directory of Open Access Journals (Sweden)
Grumadaitė Kristina
2017-06-01
Full Text Available This paper reveals preconditions for the emergence of clusters as self-organisation based industrial systems in a context, in which cooperation traditions are insufficiently developed. These preconditions reflect the principles of the emergence of self-organising complex adaptive systems that are analysed in the complexity theory. Those principles are based on the initiation of non-equilibrium and its purposeful direction into the creation of a new order. This paper highlights the main external and internal tensions that influence informal or formal clustering of enterprises, while various change agents perform different roles making self-organising processes to occur.
Improving the making ready process - Exploring the preconditions to work tasks in construction
DEFF Research Database (Denmark)
Lindhard, Søren; Wandahl, Søren
2012-01-01
preconditions have been revealed. The seven first is basically corresponding to the ones presented by Koskela (1999), while the last two are new and extends the existing knowledge. The preconditions are as follows: 1) Construction design and management. 2) Components and materials are present. 3) Workers...... are present. 4) Equipment and machinery are present. 5) Sufficient space for conduction. 6) Previous activities must be completed. 7) Climate conditions must be in order. 8) Safe working conditions in relation to national “Health and Safety at Work Act ” have to be present, 9) Known working conditions. Often...... productivity....
PRECONDITIONED BI-CONJUGATE GRADIENT METHOD FOR RADIATIVE TRANSFER IN SPHERICAL MEDIA
International Nuclear Information System (INIS)
Anusha, L. S.; Nagendra, K. N.; Paletou, F.; Leger, L.
2009-01-01
A robust numerical method called the Preconditioned Bi-Conjugate Gradient (Pre-BiCG) method is proposed for the solution of the radiative transfer equation in spherical geometry. A variant of this method called Stabilized Preconditioned Bi-Conjugate Gradient (Pre-BiCG-STAB) is also presented. These are iterative methods based on the construction of a set of bi-orthogonal vectors. The application of the Pre-BiCG method in some benchmark tests shows that the method is quite versatile, and can handle difficult problems that may arise in astrophysical radiative transfer theory.
Weber, Nina C.; Toma, Octavian; Awan, Saqib; Frässdorf, Jan; Preckel, Benedikt; Schlack, Wolfgang
2005-01-01
BACKGROUND: For nitrous oxide, a preconditioning effect on the heart has yet not been investigated. This is important because nitrous oxide is commonly used in combination with volatile anesthetics, which are known to precondition the heart. The authors aimed to clarify (1) whether nitrous oxide
Comparison of the mass preconditioned HMC and the DD-HMC algorithm for two-flavour QCD
Marinkovic, Marina
2010-01-01
Mass preconditioned HMC and DD-HMC are among the most popular algorithms to simulate Wilson fermions. We present a comparison of the performance of the two algorithms for realistic quark masses and lattice sizes. In particular, we use the locally deflated solver of the DD-HMC environment also for the mass preconditioned simulations.
Bredeweg, Steef W.; Zijlstra, Sjouke; Bessem, Bram; Buist, Ida
Objectives There is no consensus on the aetiology and prevention of running-related injuries in runners. Preconditioning studies among different athlete populations show positive effects on the incidence of sports injuries. Hypothesis A 4-week preconditioning programme in novice runners will reduce
Expressing Parallelism with ROOT
Energy Technology Data Exchange (ETDEWEB)
Piparo, D. [CERN; Tejedor, E. [CERN; Guiraud, E. [CERN; Ganis, G. [CERN; Mato, P. [CERN; Moneta, L. [CERN; Valls Pla, X. [CERN; Canal, P. [Fermilab
2017-11-22
The need for processing the ever-increasing amount of data generated by the LHC experiments in a more efficient way has motivated ROOT to further develop its support for parallelism. Such support is being tackled both for shared-memory and distributed-memory environments. The incarnations of the aforementioned parallelism are multi-threading, multi-processing and cluster-wide executions. In the area of multi-threading, we discuss the new implicit parallelism and related interfaces, as well as the new building blocks to safely operate with ROOT objects in a multi-threaded environment. Regarding multi-processing, we review the new MultiProc framework, comparing it with similar tools (e.g. multiprocessing module in Python). Finally, as an alternative to PROOF for cluster-wide executions, we introduce the efforts on integrating ROOT with state-of-the-art distributed data processing technologies like Spark, both in terms of programming model and runtime design (with EOS as one of the main components). For all the levels of parallelism, we discuss, based on real-life examples and measurements, how our proposals can increase the productivity of scientists.
Expressing Parallelism with ROOT
Piparo, D.; Tejedor, E.; Guiraud, E.; Ganis, G.; Mato, P.; Moneta, L.; Valls Pla, X.; Canal, P.
2017-10-01
The need for processing the ever-increasing amount of data generated by the LHC experiments in a more efficient way has motivated ROOT to further develop its support for parallelism. Such support is being tackled both for shared-memory and distributed-memory environments. The incarnations of the aforementioned parallelism are multi-threading, multi-processing and cluster-wide executions. In the area of multi-threading, we discuss the new implicit parallelism and related interfaces, as well as the new building blocks to safely operate with ROOT objects in a multi-threaded environment. Regarding multi-processing, we review the new MultiProc framework, comparing it with similar tools (e.g. multiprocessing module in Python). Finally, as an alternative to PROOF for cluster-wide executions, we introduce the efforts on integrating ROOT with state-of-the-art distributed data processing technologies like Spark, both in terms of programming model and runtime design (with EOS as one of the main components). For all the levels of parallelism, we discuss, based on real-life examples and measurements, how our proposals can increase the productivity of scientists.
Parallel Fast Legendre Transform
Alves de Inda, M.; Bisseling, R.H.; Maslen, D.K.
1998-01-01
We discuss a parallel implementation of a fast algorithm for the discrete polynomial Legendre transform We give an introduction to the DriscollHealy algorithm using polynomial arithmetic and present experimental results on the eciency and accuracy of our implementation The algorithms were
Practical parallel programming
Bauer, Barr E
2014-01-01
This is the book that will teach programmers to write faster, more efficient code for parallel processors. The reader is introduced to a vast array of procedures and paradigms on which actual coding may be based. Examples and real-life simulations using these devices are presented in C and FORTRAN.
Parallel universes beguile science
2007-01-01
A staple of mind-bending science fiction, the possibility of multiple universes has long intrigued hard-nosed physicists, mathematicians and cosmologists too. We may not be able -- as least not yet -- to prove they exist, many serious scientists say, but there are plenty of reasons to think that parallel dimensions are more than figments of eggheaded imagination.
International Nuclear Information System (INIS)
Gardes, D.; Volkov, P.
1981-01-01
A 5x3cm 2 (timing only) and a 15x5cm 2 (timing and position) parallel plate avalanche counters (PPAC) are considered. The theory of operation and timing resolution is given. The measurement set-up and the curves of experimental results illustrate the possibilities of the two counters [fr
Parallel hierarchical global illumination
Energy Technology Data Exchange (ETDEWEB)
Snell, Quinn O. [Iowa State Univ., Ames, IA (United States)
1997-10-08
Solving the global illumination problem is equivalent to determining the intensity of every wavelength of light in all directions at every point in a given scene. The complexity of the problem has led researchers to use approximation methods for solving the problem on serial computers. Rather than using an approximation method, such as backward ray tracing or radiosity, the authors have chosen to solve the Rendering Equation by direct simulation of light transport from the light sources. This paper presents an algorithm that solves the Rendering Equation to any desired accuracy, and can be run in parallel on distributed memory or shared memory computer systems with excellent scaling properties. It appears superior in both speed and physical correctness to recent published methods involving bidirectional ray tracing or hybrid treatments of diffuse and specular surfaces. Like progressive radiosity methods, it dynamically refines the geometry decomposition where required, but does so without the excessive storage requirements for ray histories. The algorithm, called Photon, produces a scene which converges to the global illumination solution. This amounts to a huge task for a 1997-vintage serial computer, but using the power of a parallel supercomputer significantly reduces the time required to generate a solution. Currently, Photon can be run on most parallel environments from a shared memory multiprocessor to a parallel supercomputer, as well as on clusters of heterogeneous workstations.
Kalman Filter Tracking on Parallel Architectures
International Nuclear Information System (INIS)
Cerati, Giuseppe; Elmer, Peter; Krutelyov, Slava; Lantz, Steven; Lefebvre, Matthieu; McDermott, Kevin; Riley, Daniel; Tadel, Matevž; Wittich, Peter; Würthwein, Frank; Yagil, Avi
2016-01-01
Power density constraints are limiting the performance improvements of modern CPUs. To address this we have seen the introduction of lower-power, multi-core processors such as GPGPU, ARM and Intel MIC. In order to achieve the theoretical performance gains of these processors, it will be necessary to parallelize algorithms to exploit larger numbers of lightweight cores and specialized functions like large vector units. Track finding and fitting is one of the most computationally challenging problems for event reconstruction in particle physics. At the High-Luminosity Large Hadron Collider (HL-LHC), for example, this will be by far the dominant problem. The need for greater parallelism has driven investigations of very different track finding techniques such as Cellular Automata or Hough Transforms. The most common track finding techniques in use today, however, are those based on a Kalman filter approach. Significant experience has been accumulated with these techniques on real tracking detector systems, both in the trigger and offline. They are known to provide high physics performance, are robust, and are in use today at the LHC. Given the utility of the Kalman filter in track finding, we have begun to port these algorithms to parallel architectures, namely Intel Xeon and Xeon Phi. We report here on our progress towards an end-to-end track reconstruction algorithm fully exploiting vectorization and parallelization techniques in a simplified experimental environment
Heuristic framework for parallel sorting computations | Nwanze ...
African Journals Online (AJOL)
Parallel sorting techniques have become of practical interest with the advent of new multiprocessor architectures. The decreasing cost of these processors will probably in the future, make the solutions that are derived thereof to be more appealing. Efficient algorithms for sorting scheme that are encountered in a number of ...
Directory of Open Access Journals (Sweden)
Yuhei Harada
2016-02-01
Full Text Available A taste sensor that uses lipid/polymer membranes can evaluate aftertastes felt by humans using Change in membrane Potential caused by Adsorption (CPA measurements. The sensor membrane for evaluating bitterness, which is caused by acidic bitter substances such as iso-alpha acid contained in beer, needs an immersion process in monosodium glutamate (MSG solution, called “MSG preconditioning”. However, what happens to the lipid/polymer membrane during MSG preconditioning is not clear. Therefore, we carried out three experiments to investigate the changes in the lipid/polymer membrane caused by the MSG preconditioning, i.e., measurements of the taste sensor, measurements of the amount of the bitterness substance adsorbed onto the membrane and measurements of the contact angle of the membrane surface. The CPA values increased as the preconditioning process progressed, and became stable after 3 d of preconditioning. The response potentials to the reference solution showed the same tendency of the CPA value change during the preconditioning period. The contact angle of the lipid/polymer membrane surface decreased after 7 d of MSG preconditioning; in short, the surface of the lipid/polymer membrane became hydrophilic during MSG preconditioning. The amount of adsorbed iso-alpha acid was increased until 5 d preconditioning, and then it decreased. In this study, we revealed that the CPA values increased with the progress of MSG preconditioning in spite of the decrease of the amount of iso-alpha acid adsorbed onto the lipid/polymer membrane, and it was indicated that the CPA values increase because the sensor sensitivity was improved by the MSG preconditioning.
A SPECT reconstruction method for extending parallel to non-parallel geometries
International Nuclear Information System (INIS)
Wen Junhai; Liang Zhengrong
2010-01-01
Due to its simplicity, parallel-beam geometry is usually assumed for the development of image reconstruction algorithms. The established reconstruction methodologies are then extended to fan-beam, cone-beam and other non-parallel geometries for practical application. This situation occurs for quantitative SPECT (single photon emission computed tomography) imaging in inverting the attenuated Radon transform. Novikov reported an explicit parallel-beam formula for the inversion of the attenuated Radon transform in 2000. Thereafter, a formula for fan-beam geometry was reported by Bukhgeim and Kazantsev (2002 Preprint N. 99 Sobolev Institute of Mathematics). At the same time, we presented a formula for varying focal-length fan-beam geometry. Sometimes, the reconstruction formula is so implicit that we cannot obtain the explicit reconstruction formula in the non-parallel geometries. In this work, we propose a unified reconstruction framework for extending parallel-beam geometry to any non-parallel geometry using ray-driven techniques. Studies by computer simulations demonstrated the accuracy of the presented unified reconstruction framework for extending parallel-beam to non-parallel geometries in inverting the attenuated Radon transform.
Smoothing-Norm Preconditioning for Regularizing Minimum-Residual Methods
DEFF Research Database (Denmark)
Hansen, Per Christian; Jensen, Toke Koldborg
2006-01-01
take into account a smoothing norm for the solution. This technique is well established for CGLS, but it does not immediately carry over to minimum-residual methods when the smoothing norm is a seminorm or a Sobolev norm. We develop a new technique which works for any smoothing norm of the form $\\|L...
Energy Technology Data Exchange (ETDEWEB)
Bylaska, Eric J., E-mail: Eric.Bylaska@pnnl.gov [Environmental Molecular Sciences Laboratory, Pacific Northwest National Laboratory, P.O. Box 999, Richland, Washington 99352 (United States); Weare, Jonathan Q., E-mail: weare@uchicago.edu [Department of Mathematics, University of Chicago, Chicago, Illinois 60637 (United States); Weare, John H., E-mail: jweare@ucsd.edu [Department of Chemistry and Biochemistry, University of California, San Diego, La Jolla, California 92093 (United States)
2013-08-21
Parallel in time simulation algorithms are presented and applied to conventional molecular dynamics (MD) and ab initio molecular dynamics (AIMD) models of realistic complexity. Assuming that a forward time integrator, f (e.g., Verlet algorithm), is available to propagate the system from time t{sub i} (trajectory positions and velocities x{sub i} = (r{sub i}, v{sub i})) to time t{sub i+1} (x{sub i+1}) by x{sub i+1} = f{sub i}(x{sub i}), the dynamics problem spanning an interval from t{sub 0}…t{sub M} can be transformed into a root finding problem, F(X) = [x{sub i} − f(x{sub (i−1})]{sub i} {sub =1,M} = 0, for the trajectory variables. The root finding problem is solved using a variety of root finding techniques, including quasi-Newton and preconditioned quasi-Newton schemes that are all unconditionally convergent. The algorithms are parallelized by assigning a processor to each time-step entry in the columns of F(X). The relation of this approach to other recently proposed parallel in time methods is discussed, and the effectiveness of various approaches to solving the root finding problem is tested. We demonstrate that more efficient dynamical models based on simplified interactions or coarsening time-steps provide preconditioners for the root finding problem. However, for MD and AIMD simulations, such preconditioners are not required to obtain reasonable convergence and their cost must be considered in the performance of the algorithm. The parallel in time algorithms developed are tested by applying them to MD and AIMD simulations of size and complexity similar to those encountered in present day applications. These include a 1000 Si atom MD simulation using Stillinger-Weber potentials, and a HCl + 4H{sub 2}O AIMD simulation at the MP2 level. The maximum speedup ((serial execution time)/(parallel execution time) ) obtained by parallelizing the Stillinger-Weber MD simulation was nearly 3.0. For the AIMD MP2 simulations, the algorithms achieved speedups of up
International Nuclear Information System (INIS)
Bylaska, Eric J.; Weare, Jonathan Q.; Weare, John H.
2013-01-01
Parallel in time simulation algorithms are presented and applied to conventional molecular dynamics (MD) and ab initio molecular dynamics (AIMD) models of realistic complexity. Assuming that a forward time integrator, f (e.g., Verlet algorithm), is available to propagate the system from time t i (trajectory positions and velocities x i = (r i , v i )) to time t i+1 (x i+1 ) by x i+1 = f i (x i ), the dynamics problem spanning an interval from t 0 …t M can be transformed into a root finding problem, F(X) = [x i − f(x (i−1 )] i =1,M = 0, for the trajectory variables. The root finding problem is solved using a variety of root finding techniques, including quasi-Newton and preconditioned quasi-Newton schemes that are all unconditionally convergent. The algorithms are parallelized by assigning a processor to each time-step entry in the columns of F(X). The relation of this approach to other recently proposed parallel in time methods is discussed, and the effectiveness of various approaches to solving the root finding problem is tested. We demonstrate that more efficient dynamical models based on simplified interactions or coarsening time-steps provide preconditioners for the root finding problem. However, for MD and AIMD simulations, such preconditioners are not required to obtain reasonable convergence and their cost must be considered in the performance of the algorithm. The parallel in time algorithms developed are tested by applying them to MD and AIMD simulations of size and complexity similar to those encountered in present day applications. These include a 1000 Si atom MD simulation using Stillinger-Weber potentials, and a HCl + 4H 2 O AIMD simulation at the MP2 level. The maximum speedup ((serial execution time)/(parallel execution time) ) obtained by parallelizing the Stillinger-Weber MD simulation was nearly 3.0. For the AIMD MP2 simulations, the algorithms achieved speedups of up to 14.3. The parallel in time algorithms can be implemented in a
Late preconditioning is blocked by racemic ketamine, but not by S(+)-ketamine
Müllenheim, J.; Rulands, R.; Wietschorke, T.; Frässdorf, J.; Preckel, B.; Schlack, W.
2001-01-01
Racemic ketamine blocks K(ATP) channels in isolated cells and abolishes short-term cardioprotection against prolonged ischemia. We investigated the effects of racemic ketamine and S(+)-ketamine on ischemic late preconditioning (LPC) in the rabbit heart in vivo. A coronary occluder was chronically
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Farouq, S.; Neytcheva, M.
2017-01-01
Roč. 74, č. 1 (2017), s. 19-37 ISSN 1017-1398 Institutional support: RVO:68145535 Keywords : PDE-constrained optimization problems * finite elements * iterative solution method s * preconditioning Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.241, year: 2016 https://link.springer.com/article/10.1007%2Fs11075-016-0136-5
Kolb, Alexander L; Corridon, Peter R; Zhang, Shijun; Xu, Weimin; Witzmann, Frank A; Collett, Jason A; Rhodes, George J; Winfree, Seth; Bready, Devin; Pfeffenberger, Zechariah J; Pomerantz, Jeremy M; Hato, Takashi; Nagami, Glenn T; Molitoris, Bruce A; Basile, David P; Atkinson, Simon J; Bacallao, Robert L
2018-04-01
Ischemic preconditioning confers organ-wide protection against subsequent ischemic stress. A substantial body of evidence underscores the importance of mitochondria adaptation as a critical component of cell protection from ischemia. To identify changes in mitochondria protein expression in response to ischemic preconditioning, we isolated mitochondria from ischemic preconditioned kidneys and sham-treated kidneys as a basis for comparison. The proteomic screen identified highly upregulated proteins, including NADP+-dependent isocitrate dehydrogenase 2 (IDH2), and we confirmed the ability of this protein to confer cellular protection from injury in murine S3 proximal tubule cells subjected to hypoxia. To further evaluate the role of IDH2 in cell protection, we performed detailed analysis of the effects of Idh2 gene delivery on kidney susceptibility to ischemia-reperfusion injury. Gene delivery of IDH2 before injury attenuated the injury-induced rise in serum creatinine ( P <0.05) observed in controls and increased the mitochondria membrane potential ( P <0.05), maximal respiratory capacity ( P <0.05), and intracellular ATP levels ( P <0.05) above those in controls. This communication shows that gene delivery of Idh2 can confer organ-wide protection against subsequent ischemia-reperfusion injury and mimics ischemic preconditioning. Copyright © 2018 by the American Society of Nephrology.
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Karátson, J.
2017-01-01
Roč. 210, January 2017 (2017), s. 155-164 ISSN 0377-0427 Institutional support: RVO:68145535 Keywords : finite difference method * error estimates * matrix splitting * preconditioning Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.357, year: 2016 http://www. science direct.com/ science /article/pii/S0377042716301492?via%3Dihub
On the Eigenvalues and Eigenvectors of Block Triangular Preconditioned Block Matrices
Pestana, Jennifer
2014-01-01
Block lower triangular matrices and block upper triangular matrices are popular preconditioners for 2×2 block matrices. In this note we show that a block lower triangular preconditioner gives the same spectrum as a block upper triangular preconditioner and that the eigenvectors of the two preconditioned matrices are related. © 2014 Society for Industrial and Applied Mathematics.
Comparison results on preconditioned SOR-type iterative method for Z-matrices linear systems
Wang, Xue-Zhong; Huang, Ting-Zhu; Fu, Ying-Ding
2007-09-01
In this paper, we present some comparison theorems on preconditioned iterative method for solving Z-matrices linear systems, Comparison results show that the rate of convergence of the Gauss-Seidel-type method is faster than the rate of convergence of the SOR-type iterative method.
Solving large test-day models by iteration on data and preconditioned conjugate gradient.
Lidauer, M; Strandén, I; Mäntysaari, E A; Pösö, J; Kettunen, A
1999-12-01
A preconditioned conjugate gradient method was implemented into an iteration on a program for data estimation of breeding values, and its convergence characteristics were studied. An algorithm was used as a reference in which one fixed effect was solved by Gauss-Seidel method, and other effects were solved by a second-order Jacobi method. Implementation of the preconditioned conjugate gradient required storing four vectors (size equal to number of unknowns in the mixed model equations) in random access memory and reading the data at each round of iteration. The preconditioner comprised diagonal blocks of the coefficient matrix. Comparison of algorithms was based on solutions of mixed model equations obtained by a single-trait animal model and a single-trait, random regression test-day model. Data sets for both models used milk yield records of primiparous Finnish dairy cows. Animal model data comprised 665,629 lactation milk yields and random regression test-day model data of 6,732,765 test-day milk yields. Both models included pedigree information of 1,099,622 animals. The animal model ¿random regression test-day model¿ required 122 ¿305¿ rounds of iteration to converge with the reference algorithm, but only 88 ¿149¿ were required with the preconditioned conjugate gradient. To solve the random regression test-day model with the preconditioned conjugate gradient required 237 megabytes of random access memory and took 14% of the computation time needed by the reference algorithm.
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Farouq, S.; Neytcheva, M.
2017-01-01
Roč. 74, č. 1 (2017), s. 19-37 ISSN 1017-1398 Institutional support: RVO:68145535 Keywords : PDE-constrained optimization problems * finite elements * iterative solution methods * preconditioning Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.241, year: 2016 https://link.springer.com/article/10.1007%2Fs11075-016-0136-5
Preßler, Anna-Lena; Könen, Tanja; Hasselhorn, Marcus; Krajewski, Kristin
2014-01-01
The aim of the present study was to empirically disentangle the interdependencies of the impact of nonverbal intelligence, working memory capacities, and phonological processing skills on early reading decoding and spelling within a latent variable approach. In a sample of 127 children, these cognitive preconditions were assessed before the onset…
Lotgering, F.K.; Bishai, J.M.; Struijk, P.C.; Blood, A.B.; Hunter, C.J.; Oberg, K.C.; Power, G.G.; Longo, L.D.
2004-01-01
OBJECTIVE: To determine to what extent a series of five 1-minute total umbilical cord occlusions, intended to induce ischemic preconditioning (IP), affects the physiologic responses to a 10-minute total umbilical cord occlusion (damaging insult [DI]) 1 hour later and provides cardio- and
Impact of remote ischemic preconditioning on wound healing in small bowel anastomoses
Holzner, Philipp Anton; Kulemann, Birte; Kuesters, Simon; Timme, Sylvia; Hoeppner, Jens; Hopt, Ulrich Theodor; Marjanovic, Goran
2011-01-01
AIM: To investigate the influence of remote ischemic preconditioning (RIPC) on anastomotic integrity. METHODS: Sixty male Wistar rats were randomized to six groups. The control group (n = 10) had an end-to-end ileal anastomosis without RIPC. The preconditioned groups (n = 34) varied in time of ischemia and time of reperfusion. One group received the amino acid L-arginine before constructing the anastomosis (n = 9). On postoperative day 4, the rats were re-laparotomized, and bursting pressure, hydroxyproline concentration, intra-abdominal adhesions, and a histological score concerning the mucosal ischemic injury were collected. The data are given as median (range). RESULTS: On postoperative day 4, median bursting pressure was 124 mmHg (60-146 mmHg) in the control group. The experimental groups did not show a statistically significant difference (P > 0.05). Regarding the hydroxyproline concentration, we did not find any significant variation in the experimental groups. We detected significantly less mucosal injury in the RIPC groups. Furthermore, we assessed more extensive intra-abdominal adhesions in the preconditioned groups than in the control group. CONCLUSION: RIPC directly before performing small bowel anastomosis does not affect anastomotic stability in the early period, as seen in ischemic preconditioning. PMID:21455330
The effect of preconditioning cells under osmotic stress on high alcohol production
Directory of Open Access Journals (Sweden)
Logotetis Stilijanos
2013-01-01
Full Text Available This paper focuses on the research into the influence of salt on physiology of the yeast, Saccharomyces cerevisiae. Specifically, the work focused on how NaCl affected the growth, viability and fermentation performance of this yeast in laboratory-scale experiments. One of the main findings of the research presented involved the influence of salt “preconditioning” of yeasts which represents a method of pre-culturing of cells in the presence of salt in an attempt to improve subsequent fermentation performance. Such an approach resulted in preconditioned yeasts having an improved capability to ferment high-sugar containing media (up to 60% w/v of glucose with increased cell viability and with increased levels of produced ethanol (higher than 20% in vol.. Salt-preconditioning was most likely influencing the stress-tolerance of yeasts by inducing the synthesis of key metabolites such as trehalose and glycerol which act to improve cells’ ability to withstand osmostress and ethanol toxicity. The industrial-scale trials using salt-preconditioned yeasts verified the benefit of the physiological engineering approach to practical fermentations. Overall, this research has demonstrated that a relatively simple method designed to adapt yeast cells physiologically - by salt-preconditioning - can have distinct advantages for alcohol fermentation processes.
Impact of ischemic preconditioning on functional sympatholysis during handgrip exercise in humans.
Horiuchi, M.; Endo, J.; Thijssen, D.H.J.
2015-01-01
Repeated bouts of ischemia followed by reperfusion, known as ischemic preconditioning (IPC), is found to improve exercise performance. As redistribution of blood from the inactive areas to active skeletal muscles during exercise (i.e., functional sympatholysis) is important for exercise performance,
Kast, Brigitte; Schori, Christian; Grimm, Christian
2016-05-01
Hypoxic preconditioning protects photoreceptors against light-induced degeneration preserving retinal morphology and function. Although hypoxia inducible transcription factors 1 and 2 (HIF1, HIF2) are the main regulators of the hypoxic response, photoreceptor protection does not depend on HIF1 in rods. Here we used rod-specific Hif2a single and Hif1a;Hif2a double knockout mice to investigate the potential involvement of HIF2 in rods for protection after hypoxic preconditioning. To identify potential HIF2 target genes in rods we determined the retinal transcriptome of hypoxic control and rod-specific Hif2a knockouts by RNA sequencing. We show that rods do not need HIF2 for hypoxia-induced increased survival after light exposure. The transcriptomic analysis revealed a number of genes that are potentially regulated by HIF2 in rods; among those were Htra1, Timp3 and Hmox1, candidates that are interesting due to their connection to human degenerative diseases of the retina. We conclude that neither HIF1 nor HIF2 are required in photoreceptors for protection by hypoxic preconditioning. We hypothesize that HIF transcription factors may be needed in other cells to produce protective factors acting in a paracrine fashion on photoreceptor cells. Alternatively, hypoxic preconditioning induces a rod-intrinsic response that is independent of HIF transcription factors. Copyright © 2015 Elsevier Ltd. All rights reserved.
On the use of rigid body modes in the deflated preconditioned conjugate gradient method
Jönsthövel, T.B.; Van Gijzen, M.B.; Vuik, C.; Scarpas, A.
2011-01-01
Large discontinuities in material properties, such as encountered in composite materials, lead to ill-conditioned systems of linear equations. These discontinuities give rise to small eigenvalues that may negatively affect the convergence of iterative solution methods such as the Preconditioned
Hosseini, S.M.; Wilson, W.; Ito, K.; Donkelaar, van C.C.
2014-01-01
It is known that initial loading curves of soft biological tissues are substantially different from subsequent loadings. The later loading curves are generally used for assessing the mechanical properties of a tissue, and the first loading cycles, referred to as preconditioning, are omitted.
Verkade, P.J.; Meijel, B. van; Brink, C.; Os-Medendorp, H. van; Koekkoek, B.; Francke, A.L.
2010-01-01
Background: Case management programmes for home-dwelling people with dementia and their informal carers exist in multiple forms and shapes. The aim of this research was to identify the essential components of case management for people with dementia as well as the preconditions for an effective
Czech Academy of Sciences Publication Activity Database
Kouhia, R.; Tůma, Miroslav; Mäkinen, J.; Fedoroff, A.; Marjamäki, H.
108-109, October (2012), s. 110-117 ISSN 0045-7949 R&D Projects: GA ČR(CZ) GAP108/11/0853 Institutional research plan: CEZ:AV0Z10300504 Keywords : non-linear eigenvalue problem * equilibrium equations * critical points * preconditioned iterations Subject RIV: BA - General Mathematics Impact factor: 1.509, year: 2012
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe; Karátson, J.
2017-01-01
Roč. 210, January 2017 (2017), s. 155-164 ISSN 0377-0427 Institutional support: RVO:68145535 Keywords : finite difference method * error estimates * matrix splitting * preconditioning Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 1.357, year: 2016 http://www.sciencedirect.com/science/article/pii/S0377042716301492?via%3Dihub
Advances in randomized parallel computing
Rajasekaran, Sanguthevar
1999-01-01
The technique of randomization has been employed to solve numerous prob lems of computing both sequentially and in parallel. Examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. Randomized algorithms have the advantages of simplicity and better performance both in theory and often in practice. This book is a collection of articles written by renowned experts in the area of randomized parallel computing. A brief introduction to randomized algorithms In the aflalysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. Often, the average case run time of an algorithm is much smaller than the worst case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O( n log n). The average case analysis is conducted with an assumption on the input space. The assumption made to arrive at t...
Wald, Ingo; Ize, Santiago
2015-07-28
Parallel population of a grid with a plurality of objects using a plurality of processors. One example embodiment is a method for parallel population of a grid with a plurality of objects using a plurality of processors. The method includes a first act of dividing a grid into n distinct grid portions, where n is the number of processors available for populating the grid. The method also includes acts of dividing a plurality of objects into n distinct sets of objects, assigning a distinct set of objects to each processor such that each processor determines by which distinct grid portion(s) each object in its distinct set of objects is at least partially bounded, and assigning a distinct grid portion to each processor such that each processor populates its distinct grid portion with any objects that were previously determined to be at least partially bounded by its distinct grid portion.
Ultrascalable petaflop parallel supercomputer
Blumrich, Matthias A [Ridgefield, CT; Chen, Dong [Croton On Hudson, NY; Chiu, George [Cross River, NY; Cipolla, Thomas M [Katonah, NY; Coteus, Paul W [Yorktown Heights, NY; Gara, Alan G [Mount Kisco, NY; Giampapa, Mark E [Irvington, NY; Hall, Shawn [Pleasantville, NY; Haring, Rudolf A [Cortlandt Manor, NY; Heidelberger, Philip [Cortlandt Manor, NY; Kopcsay, Gerard V [Yorktown Heights, NY; Ohmacht, Martin [Yorktown Heights, NY; Salapura, Valentina [Chappaqua, NY; Sugavanam, Krishnan [Mahopac, NY; Takken, Todd [Brewster, NY
2010-07-20
A massively parallel supercomputer of petaOPS-scale includes node architectures based upon System-On-a-Chip technology, where each processing node comprises a single Application Specific Integrated Circuit (ASIC) having up to four processing elements. The ASIC nodes are interconnected by multiple independent networks that optimally maximize the throughput of packet communications between nodes with minimal latency. The multiple networks may include three high-speed networks for parallel algorithm message passing including a Torus, collective network, and a Global Asynchronous network that provides global barrier and notification functions. These multiple independent networks may be collaboratively or independently utilized according to the needs or phases of an algorithm for optimizing algorithm processing performance. The use of a DMA engine is provided to facilitate message passing among the nodes without the expenditure of processing resources at the node.
DEFF Research Database (Denmark)
Gregersen, Frans; Josephson, Olle; Kristoffersen, Gjert
of departure that English may be used in parallel with the various local, in this case Nordic, languages. As such, the book integrates the challenge of internationalization faced by any university with the wish to improve quality in research, education and administration based on the local language......Abstract [en] More parallel, please is the result of the work of an Inter-Nordic group of experts on language policy financed by the Nordic Council of Ministers 2014-17. The book presents all that is needed to plan, practice and revise a university language policy which takes as its point......(s). There are three layers in the text: First, you may read the extremely brief version of the in total 11 recommendations for best practice. Second, you may acquaint yourself with the extended version of the recommendations and finally, you may study the reasoning behind each of them. At the end of the text, we give...
PARALLEL MOVING MECHANICAL SYSTEMS
Directory of Open Access Journals (Sweden)
Florian Ion Tiberius Petrescu
2014-09-01
Full Text Available Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4 Moving mechanical systems parallel structures are solid, fast, and accurate. Between parallel systems it is to be noticed Stewart platforms, as the oldest systems, fast, solid and precise. The work outlines a few main elements of Stewart platforms. Begin with the geometry platform, kinematic elements of it, and presented then and a few items of dynamics. Dynamic primary element on it means the determination mechanism kinetic energy of the entire Stewart platforms. It is then in a record tail cinematic mobile by a method dot matrix of rotation. If a structural mottoelement consists of two moving elements which translates relative, drive train and especially dynamic it is more convenient to represent the mottoelement as a single moving components. We have thus seven moving parts (the six motoelements or feet to which is added mobile platform 7 and one fixed.
An environment for parallel structuring of Fortran programs
International Nuclear Information System (INIS)
Sridharan, K.; McShea, M.; Denton, C.; Eventoff, B.; Browne, J.C.; Newton, P.; Ellis, M.; Grossbard, D.; Wise, T.; Clemmer, D.
1990-01-01
The paper describes and illustrates an environment for interactive support of the detection and implementation of macro-level parallelism in Fortran programs. The approach couples algorithms for dependence analysis with both innovative techniques for complexity management and capabilities for the measurement and analysis of the parallel computation structures generated through use of the environment. The resulting environment is complementary to the more common approach of seeking local parallelism by loop unrolling, either by an automatic compiler or manually. (orig.)
Xyce parallel electronic simulator.
Energy Technology Data Exchange (ETDEWEB)
Keiter, Eric R; Mei, Ting; Russo, Thomas V.; Rankin, Eric Lamont; Schiek, Richard Louis; Thornquist, Heidi K.; Fixel, Deborah A.; Coffey, Todd S; Pawlowski, Roger P; Santarelli, Keith R.
2010-05-01
This document is a reference guide to the Xyce Parallel Electronic Simulator, and is a companion document to the Xyce Users Guide. The focus of this document is (to the extent possible) exhaustively list device parameters, solver options, parser options, and other usage details of Xyce. This document is not intended to be a tutorial. Users who are new to circuit simulation are better served by the Xyce Users Guide.
Betchov, R
2012-01-01
Stability of Parallel Flows provides information pertinent to hydrodynamical stability. This book explores the stability problems that occur in various fields, including electronics, mechanics, oceanography, administration, economics, as well as naval and aeronautical engineering. Organized into two parts encompassing 10 chapters, this book starts with an overview of the general equations of a two-dimensional incompressible flow. This text then explores the stability of a laminar boundary layer and presents the equation of the inviscid approximation. Other chapters present the general equation
Algorithmically specialized parallel computers
Snyder, Lawrence; Gannon, Dennis B
1985-01-01
Algorithmically Specialized Parallel Computers focuses on the concept and characteristics of an algorithmically specialized computer.This book discusses the algorithmically specialized computers, algorithmic specialization using VLSI, and innovative architectures. The architectures and algorithms for digital signal, speech, and image processing and specialized architectures for numerical computations are also elaborated. Other topics include the model for analyzing generalized inter-processor, pipelined architecture for search tree maintenance, and specialized computer organization for raster
Joo, Jin Deok; Kim, Mihwa; D'Agati, Vivette D; Lee, H Thomas
2006-11-01
Acute as well as delayed ischemic preconditioning (IPC) provides protection against cardiac and neuronal ischemia reperfusion (IR) injury. This study determined whether delayed preconditioning occurs in the kidney and further elucidated the mechanisms of renal IPC in mice. Mice were subjected to IPC (four cycles of 5 min of ischemia and reperfusion) and then to 30 min of renal ischemia either 15 min (acute IPC) or 24 h (delayed IPC) later. Both acute and delayed renal IPC provided powerful protection against renal IR injury. Inhibition of Akt but not extracellular signal-regulated kinase phosphorylation prevented the protection that was afforded by acute IPC. Neither extracellular signal-regulated kinase nor Akt inhibition prevented protection that was afforded by delayed renal IPC. Pretreatment with an antioxidant, N-(2-mercaptopropionyl)-glycine, to scavenge free radicals prevented the protection that was provided by acute but not delayed renal IPC. Inhibition of protein kinase C or pertussis toxin-sensitive G-proteins attenuated protection from both acute and delayed renal IPC. Delayed renal IPC increased inducible nitric oxide synthase (iNOS) as well as heat-shock protein 27 synthesis, and the renal protective effects of delayed preconditioning were attenuated by a selective inhibitor of iNOS (l-N(6)[1-iminoethyl]lysine). Moreover, delayed IPC was not observed in iNOS knockout mice. Both acute and delayed IPC were independent of A(1) adenosine receptors (AR) as a selective A(1)AR antagonist failed to block preconditioning and acute and delayed preconditioning occurred in mice that lacked A(1)AR. Therefore, this study demonstrated that acute or delayed IPC provides renal protection against IR injury in mice but involves distinct signaling pathways.
Keldysh formalism for multiple parallel worlds
International Nuclear Information System (INIS)
Ansari, M.; Nazarov, Y. V.
2016-01-01
We present a compact and self-contained review of the recently developed Keldysh formalism for multiple parallel worlds. The formalism has been applied to consistent quantum evaluation of the flows of informational quantities, in particular, to the evaluation of Renyi and Shannon entropy flows. We start with the formulation of the standard and extended Keldysh techniques in a single world in a form convenient for our presentation. We explain the use of Keldysh contours encompassing multiple parallel worlds. In the end, we briefly summarize the concrete results obtained with the method.
Keldysh formalism for multiple parallel worlds
Ansari, M.; Nazarov, Y. V.
2016-03-01
We present a compact and self-contained review of the recently developed Keldysh formalism for multiple parallel worlds. The formalism has been applied to consistent quantum evaluation of the flows of informational quantities, in particular, to the evaluation of Renyi and Shannon entropy flows. We start with the formulation of the standard and extended Keldysh techniques in a single world in a form convenient for our presentation. We explain the use of Keldysh contours encompassing multiple parallel worlds. In the end, we briefly summarize the concrete results obtained with the method.
Keldysh formalism for multiple parallel worlds
Energy Technology Data Exchange (ETDEWEB)
Ansari, M.; Nazarov, Y. V., E-mail: y.v.nazarov@tudelft.nl [Delft University of Technology, Kavli Institute of Nanoscience (Netherlands)
2016-03-15
We present a compact and self-contained review of the recently developed Keldysh formalism for multiple parallel worlds. The formalism has been applied to consistent quantum evaluation of the flows of informational quantities, in particular, to the evaluation of Renyi and Shannon entropy flows. We start with the formulation of the standard and extended Keldysh techniques in a single world in a form convenient for our presentation. We explain the use of Keldysh contours encompassing multiple parallel worlds. In the end, we briefly summarize the concrete results obtained with the method.
Structured building model reduction toward parallel simulation
Energy Technology Data Exchange (ETDEWEB)
Dobbs, Justin R. [Cornell University; Hencey, Brondon M. [Cornell University
2013-08-26
Building energy model reduction exchanges accuracy for improved simulation speed by reducing the number of dynamical equations. Parallel computing aims to improve simulation times without loss of accuracy but is poorly utilized by contemporary simulators and is inherently limited by inter-processor communication. This paper bridges these disparate techniques to implement efficient parallel building thermal simulation. We begin with a survey of three structured reduction approaches that compares their performance to a leading unstructured method. We then use structured model reduction to find thermal clusters in the building energy model and allocate processing resources. Experimental results demonstrate faster simulation and low error without any interprocessor communication.
International Nuclear Information System (INIS)
Rosa, M.; Warsa, J. S.; Chang, J. H.
2007-01-01
A Fourier analysis is conducted in two-dimensional (2D) Cartesian geometry for the discrete-ordinates (SN) approximation of the neutron transport problem solved with Richardson iteration (Source Iteration) and Richardson iteration preconditioned with Transport Synthetic Acceleration (TSA), using the Parallel Block-Jacobi (PBJ) algorithm. The results for the un-accelerated algorithm show that convergence of PBJ can degrade, leading in particular to stagnation of GMRES(m) in problems containing optically thin sub-domains. The results for the accelerated algorithm indicate that TSA can be used to efficiently precondition an iterative method in the optically thin case when implemented in the 'modified' version MTSA, in which only the scattering in the low order equations is reduced by some non-negative factor β<1. (authors)
Tsuruta, S; Misztal, I; Strandén, I
2001-05-01
Utility of the preconditioned conjugate gradient algorithm with a diagonal preconditioner for solving mixed-model equations in animal breeding applications was evaluated with 16 test problems. The problems included single- and multiple-trait analyses, with data on beef, dairy, and swine ranging from small examples to national data sets. Multiple-trait models considered low and high genetic correlations. Convergence was based on relative differences between left- and right-hand sides. The ordering of equations was fixed effects followed by random effects, with no special ordering within random effects. The preconditioned conjugate gradient program implemented with double precision converged for all models. However, when implemented in single precision, the preconditioned conjugate gradient algorithm did not converge for seven large models. The preconditioned conjugate gradient and successive overrelaxation algorithms were subsequently compared for 13 of the test problems. The preconditioned conjugate gradient algorithm was easy to implement with the iteration on data for general models. However, successive overrelaxation requires specific programming for each set of models. On average, the preconditioned conjugate gradient algorithm converged in three times fewer rounds of iteration than successive overrelaxation. With straightforward implementations, programs using the preconditioned conjugate gradient algorithm may be two or more times faster than those using successive overrelaxation. However, programs using the preconditioned conjugate gradient algorithm would use more memory than would comparable implementations using successive overrelaxation. Extensive optimization of either algorithm can influence rankings. The preconditioned conjugate gradient implemented with iteration on data, a diagonal preconditioner, and in double precision may be the algorithm of choice for solving mixed-model equations when sufficient memory is available and ease of implementation is
Sod, Gary A; Riggs, Laura M; Mitchell, Colin F; Hubert, Jeremy D; Martin, George S
2010-01-01
To compare in vitro monotonic biomechanical properties of an axial 3-hole, 4.5 mm narrow dynamic compression plate (DCP) using 5.5 mm cortical screws in conjunction with 2 abaxial transarticular 5.5 mm cortical screws inserted in lag fashion (DCP-TLS) with 3 parallel transarticular 5.5 mm cortical screws inserted in lag fashion (3-TLS) for the equine proximal interphalangeal (PIP) joint arthrodesis. Paired in vitro biomechanical testing of 2 methods of stabilizing cadaveric adult equine forelimb PIP joints. Cadaveric adult equine forelimbs (n=15 pairs). For each forelimb pair, 1 PIP joint was stabilized with an axial 3-hole narrow DCP (4.5 mm) using 5.5 mm cortical screws in conjunction with 2 abaxial transarticular 5.5 mm cortical screws inserted in lag fashion and 1 with 3 parallel transarticular 5.5 mm cortical screws inserted in lag fashion. Five matching pairs of constructs were tested in single cycle to failure under axial compression, 5 construct pairs were tested for cyclic fatigue under axial compression, and 5 construct pairs were tested in single cycle to failure under torsional loading. Mean values for each fixation method were compared using a paired t-test within each group with statistical significance set at Pcycle to failure, of the DCP-TLS fixation were significantly greater than those of the 3-TLS fixation. Mean cycles to failure in axial compression of the DCP-TLS fixation was significantly greater than that of the 3-TLS fixation. The DCP-TLS was superior to the 3-TLS in resisting the static overload forces and in resisting cyclic fatigue. The results of this in vitro study may provide information to aid in the selection of a treatment modality for arthrodesis of the equine PIP joint.
Parallel visualization on leadership computing resources
Energy Technology Data Exchange (ETDEWEB)
Peterka, T; Ross, R B [Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL 60439 (United States); Shen, H-W [Department of Computer Science and Engineering, Ohio State University, Columbus, OH 43210 (United States); Ma, K-L [Department of Computer Science, University of California at Davis, Davis, CA 95616 (United States); Kendall, W [Department of Electrical Engineering and Computer Science, University of Tennessee at Knoxville, Knoxville, TN 37996 (United States); Yu, H, E-mail: tpeterka@mcs.anl.go [Sandia National Laboratories, California, Livermore, CA 94551 (United States)
2009-07-01
Changes are needed in the way that visualization is performed, if we expect the analysis of scientific data to be effective at the petascale and beyond. By using similar techniques as those used to parallelize simulations, such as parallel I/O, load balancing, and effective use of interprocess communication, the supercomputers that compute these datasets can also serve as analysis and visualization engines for them. Our team is assessing the feasibility of performing parallel scientific visualization on some of the most powerful computational resources of the U.S. Department of Energy's National Laboratories in order to pave the way for analyzing the next generation of computational results. This paper highlights some of the conclusions of that research.
Parallel optoelectronic trinary signed-digit division
Alam, Mohammad S.
1999-03-01
The trinary signed-digit (TSD) number system has been found to be very useful for parallel addition and subtraction of any arbitrary length operands in constant time. Using the TSD addition and multiplication modules as the basic building blocks, we develop an efficient algorithm for performing parallel TSD division in constant time. The proposed division technique uses one TSD subtraction and two TSD multiplication steps. An optoelectronic correlator based architecture is suggested for implementation of the proposed TSD division algorithm, which fully exploits the parallelism and high processing speed of optics. An efficient spatial encoding scheme is used to ensure better utilization of space bandwidth product of the spatial light modulators used in the optoelectronic implementation.
Parallel visualization on leadership computing resources
International Nuclear Information System (INIS)
Peterka, T; Ross, R B; Shen, H-W; Ma, K-L; Kendall, W; Yu, H
2009-01-01
Changes are needed in the way that visualization is performed, if we expect the analysis of scientific data to be effective at the petascale and beyond. By using similar techniques as those used to parallelize simulations, such as parallel I/O, load balancing, and effective use of interprocess communication, the supercomputers that compute these datasets can also serve as analysis and visualization engines for them. Our team is assessing the feasibility of performing parallel scientific visualization on some of the most powerful computational resources of the U.S. Department of Energy's National Laboratories in order to pave the way for analyzing the next generation of computational results. This paper highlights some of the conclusions of that research.
Bylaska, Eric J; Weare, Jonathan Q; Weare, John H
2013-08-21
Parallel in time simulation algorithms are presented and applied to conventional molecular dynamics (MD) and ab initio molecular dynamics (AIMD) models of realistic complexity. Assuming that a forward time integrator, f (e.g., Verlet algorithm), is available to propagate the system from time ti (trajectory positions and velocities xi = (ri, vi)) to time ti + 1 (xi + 1) by xi + 1 = fi(xi), the dynamics problem spanning an interval from t0[ellipsis (horizontal)]tM can be transformed into a root finding problem, F(X) = [xi - f(x(i - 1)]i = 1, M = 0, for the trajectory variables. The root finding problem is solved using a variety of root finding techniques, including quasi-Newton and preconditioned quasi-Newton schemes that are all unconditionally convergent. The algorithms are parallelized by assigning a processor to each time-step entry in the columns of F(X). The relation of this approach to other recently proposed parallel in time methods is discussed, and the effectiveness of various approaches to solving the root finding problem is tested. We demonstrate that more efficient dynamical models based on simplified interactions or coarsening time-steps provide preconditioners for the root finding problem. However, for MD and AIMD simulations, such preconditioners are not required to obtain reasonable convergence and their cost must be considered in the performance of the algorithm. The parallel in time algorithms developed are tested by applying them to MD and AIMD simulations of size and complexity similar to those encountered in present day applications. These include a 1000 Si atom MD simulation using Stillinger-Weber potentials, and a HCl + 4H2O AIMD simulation at the MP2 level. The maximum speedup (serial execution/timeparallel execution time) obtained by parallelizing the Stillinger-Weber MD simulation was nearly 3.0. For the AIMD MP2 simulations, the algorithms achieved speedups of up to 14.3. The parallel in time algorithms can be implemented in a
Resistor Combinations for Parallel Circuits.
McTernan, James P.
1978-01-01
To help simplify both teaching and learning of parallel circuits, a high school electricity/electronics teacher presents and illustrates the use of tables of values for parallel resistive circuits in which total resistances are whole numbers. (MF)
SOFTWARE FOR DESIGNING PARALLEL APPLICATIONS
Directory of Open Access Journals (Sweden)
M. K. Bouza
2017-01-01
Full Text Available The object of research is the tools to support the development of parallel programs in C/C ++. The methods and software which automates the process of designing parallel applications are proposed.
Optimal algebraic multilevel preconditioning for local refinement along a line
Margenov, S.D.; Maubach, J.M.L.
1995-01-01
The application of some recently proposed algebraic multilevel methods for the solution of two-dimensional finite element problems on nonuniform meshes is studied. The locally refined meshes are created by the newest vertex mesh refinement method. After the introduction of this refinement technique
Parallel External Memory Graph Algorithms
DEFF Research Database (Denmark)
Arge, Lars Allan; Goodrich, Michael T.; Sitchinava, Nodari
2010-01-01
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one o f the private-cache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to efficient solutions to problems on trees, such as computing lowest...... an optimal speedup of Â¿(P) in parallel I/O complexity and parallel computation time, compared to the single-processor external memory counterparts....
Sbarouni, Eftihia; Iliodromitis, Efstathios K; Zoga, Anastasia; Vlachou, Georgia; Andreadou, Ioanna; Kremastinos, Dimitrios Th
2006-08-01
We have previously shown that estrogen administered in ovariectomized female rabbits significantly reduce myocardial infarct size. We now investigated whether the phytoestrogen genistein similarly protects ischemic myocardium and whether this is associated with its antioxidant properties. In addition, we examined whether genistein abolishes preconditioning, since at high doses, it inhibits tyrosine kinase. We studied five groups of New Zealand white female rabbits. Group A (n = 12) were normal controls, group B (n = 14) were ovariectomized 4 weeks prior to the experiment, group C (n = 10) were ovariectomized and treated with genistein (0.2 mg kg(-1) day(-1) subcutaneously) for 4 weeks before the experiment, group D (n = 12) had intact gonads and were treated with genistein (0.2 mg kg(-1) day(-1) subcutaneously) for 4 weeks before the experiment and group E (n = 8) were ovariectomized 4 weeks prior to the experiment and treated with a single dose of genistein (0.2 mg kg(-1) day(-1) subcutaneously) just prior to the experiment. All animals underwent 30 min of heart ischemia and 120 min of reperfusion, with (subgroup I) or without (subgroup II) preconditioning. Malondialdehyde (MDA) concentration just before the experiment was determined. We found significant differences between the groups-p protect ischemic myocardium in either ovariectomized or non-ovariectomized animals-BII vs CII and AII vs DII, p = NS. There was no significant difference between the preconditioned animals, with intact gonads or ovariectomized (AI vs BI, p = NS), ovariectomized with or without genistein (BI vs CI, p = NS) and non-ovariectomized whether treated with genistein or not (AI vs DI, p = NS). A single dose of genistein did not offer any protection (EII vs BII, p = NS), nor did it modify the preconditioning effect (EI vs BI, p = NS). We found no significant difference in MDA plasma levels between the groups. Genistein, at this dose, does not reduce infarct size per se nor abolishes the
Parallel inter channel interaction mechanisms
International Nuclear Information System (INIS)
Jovic, V.; Afgan, N.; Jovic, L.
1995-01-01
Parallel channels interactions are examined. For experimental researches of nonstationary regimes flow in three parallel vertical channels results of phenomenon analysis and mechanisms of parallel channel interaction for adiabatic condition of one-phase fluid and two-phase mixture flow are shown. (author)
Mitigating nonlinearity in full waveform inversion using scaled-Sobolev pre-conditioning
Zuberi, M. AH; Pratt, R. G.
2018-04-01
The Born approximation successfully linearizes seismic full waveform inversion if the background velocity is sufficiently accurate. When the background velocity is not known it can be estimated by using model scale separation methods. A frequently used technique is to separate the spatial scales of the model according to the scattering angles present in the data, by using either first- or second-order terms in the Born series. For example, the well-known `banana-donut' and the `rabbit ear' shaped kernels are, respectively, the first- and second-order Born terms in which at least one of the scattering events is associated with a large angle. Whichever term of the Born series is used, all such methods suffer from errors in the starting velocity model because all terms in the Born series assume that the background Green's function is known. An alternative approach to Born-based scale separation is to work in the model domain, for example, by Gaussian smoothing of the update vectors, or some other approach for separation by model wavenumbers. However such model domain methods are usually based on a strict separation in which only the low-wavenumber updates are retained. This implies that the scattered information in the data is not taken into account. This can lead to the inversion being trapped in a false (local) minimum when sharp features are updated incorrectly. In this study we propose a scaled-Sobolev pre-conditioning (SSP) of the updates to achieve a constrained scale separation in the model domain. The SSP is obtained by introducing a scaled Sobolev inner product (SSIP) into the measure of the gradient of the objective function with respect to the model parameters. This modified measure seeks reductions in the L2 norm of the spatial derivatives of the gradient without changing the objective function. The SSP does not rely on the Born prediction of scale based on scattering angles, and requires negligible extra computational cost per iteration. Synthetic
International Nuclear Information System (INIS)
Soltz, R; Vranas, P; Blumrich, M; Chen, D; Gara, A; Giampap, M; Heidelberger, P; Salapura, V; Sexton, J; Bhanot, G
2007-01-01
The theory of the strong nuclear force, Quantum Chromodynamics (QCD), can be numerically simulated from first principles on massively-parallel supercomputers using the method of Lattice Gauge Theory. We describe the special programming requirements of lattice QCD (LQCD) as well as the optimal supercomputer hardware architectures that it suggests. We demonstrate these methods on the BlueGene massively-parallel supercomputer and argue that LQCD and the BlueGene architecture are a natural match. This can be traced to the simple fact that LQCD is a regular lattice discretization of space into lattice sites while the BlueGene supercomputer is a discretization of space into compute nodes, and that both are constrained by requirements of locality. This simple relation is both technologically important and theoretically intriguing. The main result of this paper is the speedup of LQCD using up to 131,072 CPUs on the largest BlueGene/L supercomputer. The speedup is perfect with sustained performance of about 20% of peak. This corresponds to a maximum of 70.5 sustained TFlop/s. At these speeds LQCD and BlueGene are poised to produce the next generation of strong interaction physics theoretical results
A Parallel Butterfly Algorithm
Poulson, Jack; Demanet, Laurent; Maxwell, Nicholas; Ying, Lexing
2014-01-01
The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.
A Parallel Butterfly Algorithm
Poulson, Jack
2014-02-04
The butterfly algorithm is a fast algorithm which approximately evaluates a discrete analogue of the integral transform (Equation Presented.) at large numbers of target points when the kernel, K(x, y), is approximately low-rank when restricted to subdomains satisfying a certain simple geometric condition. In d dimensions with O(Nd) quasi-uniformly distributed source and target points, when each appropriate submatrix of K is approximately rank-r, the running time of the algorithm is at most O(r2Nd logN). A parallelization of the butterfly algorithm is introduced which, assuming a message latency of α and per-process inverse bandwidth of β, executes in at most (Equation Presented.) time using p processes. This parallel algorithm was then instantiated in the form of the open-source DistButterfly library for the special case where K(x, y) = exp(iΦ(x, y)), where Φ(x, y) is a black-box, sufficiently smooth, real-valued phase function. Experiments on Blue Gene/Q demonstrate impressive strong-scaling results for important classes of phase functions. Using quasi-uniform sources, hyperbolic Radon transforms, and an analogue of a three-dimensional generalized Radon transform were, respectively, observed to strong-scale from 1-node/16-cores up to 1024-nodes/16,384-cores with greater than 90% and 82% efficiency, respectively. © 2014 Society for Industrial and Applied Mathematics.
Fast parallel event reconstruction
CERN. Geneva
2010-01-01
On-line processing of large data volumes produced in modern HEP experiments requires using maximum capabilities of modern and future many-core CPU and GPU architectures.One of such powerful feature is a SIMD instruction set, which allows packing several data items in one register and to operate on all of them, thus achievingmore operations per clock cycle. Motivated by the idea of using the SIMD unit ofmodern processors, the KF based track fit has been adapted for parallelism, including memory optimization, numerical analysis, vectorization with inline operator overloading, and optimization using SDKs. The speed of the algorithm has been increased in 120000 times with 0.1 ms/track, running in parallel on 16 SPEs of a Cell Blade computer. Running on a Nehalem CPU with 8 cores it shows the processing speed of 52 ns/track using the Intel Threading Building Blocks. The same KF algorithm running on an Nvidia GTX 280 in the CUDA frameworkprovi...
Integrative Dynamic Reconfiguration in a Parallel Stream Processing Engine
DEFF Research Database (Denmark)
Madsen, Kasper Grud Skat; Zhou, Yongluan; Cao, Jianneng
2017-01-01
Load balancing, operator instance collocations and horizontal scaling are critical issues in Parallel Stream Processing Engines to achieve low data processing latency, optimized cluster utilization and minimized communication cost respectively. In previous work, these issues are typically tackled...... solution called ALBIC, which support general jobs. We implement the proposed techniques on top of Apache Storm, an open-source Parallel Stream Processing Engine. The extensive experimental results over both synthetic and real datasets show that our techniques clearly outperform existing approaches....
Gilles, Luc; Massioni, Paolo; Kulcsár, Caroline; Raynaud, Henri-François; Ellerbroek, Brent
2013-05-01
This paper discusses the performance and cost of two computationally efficient Fourier-based tomographic wavefront reconstruction algorithms for wide-field laser guide star (LGS) adaptive optics (AO). The first algorithm is the iterative Fourier domain preconditioned conjugate gradient (FDPCG) algorithm developed by Yang et al. [Appl. Opt.45, 5281 (2006)], combined with pseudo-open-loop control (POLC). FDPCG's computational cost is proportional to N log(N), where N denotes the dimensionality of the tomography problem. The second algorithm is the distributed Kalman filter (DKF) developed by Massioni et al. [J. Opt. Soc. Am. A28, 2298 (2011)], which is a noniterative spatially invariant controller. When implemented in the Fourier domain, DKF's cost is also proportional to N log(N). Both algorithms are capable of estimating spatial frequency components of the residual phase beyond the wavefront sensor (WFS) cutoff frequency thanks to regularization, thereby reducing WFS spatial aliasing at the expense of more computations. We present performance and cost analyses for the LGS multiconjugate AO system under design for the Thirty Meter Telescope, as well as DKF's sensitivity to uncertainties in wind profile prior information. We found that, provided the wind profile is known to better than 10% wind speed accuracy and 20 deg wind direction accuracy, DKF, despite its spatial invariance assumptions, delivers a significantly reduced wavefront error compared to the static FDPCG minimum variance estimator combined with POLC. Due to its nonsequential nature and high degree of parallelism, DKF is particularly well suited for real-time implementation on inexpensive off-the-shelf graphics processing units.
Koppenhoefer, Kyle C.; Gullerud, Arne S.; Ruggieri, Claudio; Dodds, Robert H., Jr.; Healy, Brian E.
1998-01-01
This report describes theoretical background material and commands necessary to use the WARP3D finite element code. WARP3D is under continuing development as a research code for the solution of very large-scale, 3-D solid models subjected to static and dynamic loads. Specific features in the code oriented toward the investigation of ductile fracture in metals include a robust finite strain formulation, a general J-integral computation facility (with inertia, face loading), an element extinction facility to model crack growth, nonlinear material models including viscoplastic effects, and the Gurson-Tver-gaard dilatant plasticity model for void growth. The nonlinear, dynamic equilibrium equations are solved using an incremental-iterative, implicit formulation with full Newton iterations to eliminate residual nodal forces. The history integration of the nonlinear equations of motion is accomplished with Newmarks Beta method. A central feature of WARP3D involves the use of a linear-preconditioned conjugate gradient (LPCG) solver implemented in an element-by-element format to replace a conventional direct linear equation solver. This software architecture dramatically reduces both the memory requirements and CPU time for very large, nonlinear solid models since formation of the assembled (dynamic) stiffness matrix is avoided. Analyses thus exhibit the numerical stability for large time (load) steps provided by the implicit formulation coupled with the low memory requirements characteristic of an explicit code. In addition to the much lower memory requirements of the LPCG solver, the CPU time required for solution of the linear equations during each Newton iteration is generally one-half or less of the CPU time required for a traditional direct solver. All other computational aspects of the code (element stiffnesses, element strains, stress updating, element internal forces) are implemented in the element-by- element, blocked architecture. This greatly improves
Valdé s, Felipe; Andriulli, Francesco P.; Bagci, Hakan; Michielssen, Eric
2011-01-01
A new regularized single source equation for analyzing scattering from homogeneous penetrable objects is presented. The proposed equation is a linear combination of a Calderón-preconditioned single source electric field integral equation and a
Hill, Mary C.
1990-01-01
This report documents PCG2 : a numerical code to be used with the U.S. Geological Survey modular three-dimensional, finite-difference, ground-water flow model . PCG2 uses the preconditioned conjugate-gradient method to solve the equations produced by the model for hydraulic head. Linear or nonlinear flow conditions may be simulated. PCG2 includes two reconditioning options : modified incomplete Cholesky preconditioning, which is efficient on scalar computers; and polynomial preconditioning, which requires less computer storage and, with modifications that depend on the computer used, is most efficient on vector computers . Convergence of the solver is determined using both head-change and residual criteria. Nonlinear problems are solved using Picard iterations. This documentation provides a description of the preconditioned conjugate gradient method and the two preconditioners, detailed instructions for linking PCG2 to the modular model, sample data inputs, a brief description of PCG2, and a FORTRAN listing.
On the Automatic Parallelization of Sparse and Irregular Fortran Programs
Directory of Open Access Journals (Sweden)
Yuan Lin
1999-01-01
Full Text Available Automatic parallelization is usually believed to be less effective at exploiting implicit parallelism in sparse/irregular programs than in their dense/regular counterparts. However, not much is really known because there have been few research reports on this topic. In this work, we have studied the possibility of using an automatic parallelizing compiler to detect the parallelism in sparse/irregular programs. The study with a collection of sparse/irregular programs led us to some common loop patterns. Based on these patterns new techniques were derived that produced good speedups when manually applied to our benchmark codes. More importantly, these parallelization methods can be implemented in a parallelizing compiler and can be applied automatically.
Deja, Marek A; Wiaderkiewicz, Ryszard; Czekaj, Piotr; Czech, Ewa; Malinowski, Marcin; Machej, Leszek; Węglarzy, Andrzej; Kowalówka, Adam; Piekarska, Magda; Szurlej, Bartosz; Latusek, Tomasz
2018-01-01
Remote preconditioning has been shown to be a potent protective phenomenon in many animals. Several studies aimed to demonstrate it was feasible in humans by trying to show its protective effect during cardiac surgery. Of these, some small studies and one larger trial were positive while two other bigger studies showed no effectiveness of remote preconditioning as assessed by levels of postoperatively released cardiac markers. Recently, two large clinical trials also failed to prove the benefit of remote preconditioning in cardiac surgery. No study showed that remote preconditioning actually increases resistance of human myocardium to standardised ischaemic and reperfusion stimulus in experimental settings. In animal studies, remote preconditioning was shown to improve mitochondrial function and structure, but such data on human myocardium are scarce. The aim of the study is to determine whether remote preconditioning protects human myocardium against ischaemia-reperfusion injury in both in vivo and in vitro conditions. The trial is designed as a single-centre, double-blinded, sham-controlled trial of 120 patients. We randomise (1:1) patients referred for coronary artery bypass grafting for stable coronary artery disease to remote preconditioning or "sham" intervention. The remote preconditioning is obtained by three cycles of 5 min inflation and 5 min deflation of a blood pressure cuff on the right arm. Postoperative course including myocardial enzymes profile will be analysed. Moreover, in the in-vitro arm the clinically preconditioned myocardium will be assessed for function, mitochondria structure, and mitochondria-dependent apoptosis. The informed consent of all patients is obtained before enrolment into the study by the investigator. The study conforms to the spirit and the letter of the declaration of Helsinki. In case the effect of remote preconditioning is not measurable in ex-vivo assessment, any future attempt at implementing this phenomenon in clinical
International Nuclear Information System (INIS)
DeHart, Mark D.; Williams, Mark L.; Bowman, Stephen M.
2010-01-01
The SCALE computational architecture has remained basically the same since its inception 30 years ago, although constituent modules and capabilities have changed significantly. This SCALE concept was intended to provide a framework whereby independent codes can be linked to provide a more comprehensive capability than possible with the individual programs - allowing flexibility to address a wide variety of applications. However, the current system was designed originally for mainframe computers with a single CPU and with significantly less memory than today's personal computers. It has been recognized that the present SCALE computation system could be restructured to take advantage of modern hardware and software capabilities, while retaining many of the modular features of the present system. Preliminary work is being done to define specifications and capabilities for a more advanced computational architecture. This paper describes the state of current SCALE development activities and plans for future development. With the release of SCALE 6.1 in 2010, a new phase of evolutionary development will be available to SCALE users within the TRITON and NEWT modules. The SCALE (Standardized Computer Analyses for Licensing Evaluation) code system developed by Oak Ridge National Laboratory (ORNL) provides a comprehensive and integrated package of codes and nuclear data for a wide range of applications in criticality safety, reactor physics, shielding, isotopic depletion and decay, and sensitivity/uncertainty (S/U) analysis. Over the last three years, since the release of version 5.1 in 2006, several important new codes have been introduced within SCALE, and significant advances applied to existing codes. Many of these new features became available with the release of SCALE 6.0 in early 2009. However, beginning with SCALE 6.1, a first generation of parallel computing is being introduced. In addition to near-term improvements, a plan for longer term SCALE enhancement
Convergence Analysis of the Preconditioned Group Splitting Methods in Boundary Value Problems
Directory of Open Access Journals (Sweden)
Norhashidah Hj. Mohd Ali
2012-01-01
Full Text Available The construction of a specific splitting-type preconditioner in block formulation applied to a class of group relaxation iterative methods derived from the centred and rotated (skewed finite difference approximations has been shown to improve the convergence rates of these methods. In this paper, we present some theoretical convergence analysis on this preconditioner specifically applied to the linear systems resulted from these group iterative schemes in solving an elliptic boundary value problem. We will theoretically show the relationship between the spectral radiuses of the iteration matrices of the preconditioned methods which affects the rate of convergence of these methods. We will also show that the spectral radius of the preconditioned matrices is smaller than that of their unpreconditioned counterparts if the relaxation parameter is in a certain optimum range. Numerical experiments will also be presented to confirm the agreement between the theoretical and the experimental results.
Luo, Yukun; Fang, Jun; Fan, Lin; Lin, Chaogui; Chen, Zhaoyang; Chen, Lianglong
2012-10-01
To investigate the role of connexin 43-formed hemichannels in cell volume regulation induced by simulated ischemia/reperfusion (SI/R). Mouse cardiomyocytes isolated on a Langendorff apparatus with enzyme solution were aliquoted into control, SI/R and SI/R +octanol groups. Calcein-AM was used to stain the cells and the cell volume was measured with confocal microscope by stack scanning. Trypan blue was used to measure the cell viability after the treatments. Calcein-AM staining and cofocal microscopy yielded stable and reproducible results for cell volume measurement. Mouse cardiomyocytes subjected to simulated SI/R showed obvious cell swelling as compared with the control cells [(126∓6)% vs 100%, Poctanol preconditioning significantly attenuated the cell swelling [(113∓6)%, Poctanol preconditioning obviously reduced the viability of the cells with SI/R challenge [(31∓2)%, Poctanol can alleviate the cell swelling to enhance the viability of the cardiomyocytes following SI/R.
Energy Technology Data Exchange (ETDEWEB)
Mirrione, M.M.; Mirrione, M.M.; Konomosa, D.K.; Ioradanis, G.; Dewey, S.L.; Agzzid, A.; Heppnerd, F.L.; Tsirka, St.E.
2010-04-01
Activated microglia have been associated with neurodegeneration in patients and in animal models of Temporal Lobe Epilepsy (TLE), however their precise functions as neurotoxic or neuroprotective is a topic of significant investigation. To explore this, we examined the effects of pilocarpine-induced seizures in transgenic mice where microglia/macrophages were conditionally ablated. We found that unilateral ablation of microglia from the dorsal hippocampus did not alter acute seizure sensitivity. However, when this procedure was coupled with lipopolysaccharide (LPS) preconditioning (1 mg/kg given 24 h prior to acute seizure), we observed a significant pro-convulsant phenomenon. This effect was associated with lower metabolic activation in the ipsilateral hippocampus during acute seizures, and could be attributed to activity in the mossy fiber pathway. These findings reveal that preconditioning with LPS 24 h prior to seizure induction may have a protective effect which is abolished by unilateral hippocampal microglia/macrophage ablation.
International Nuclear Information System (INIS)
Chen, G.S.
1997-01-01
We apply and compare the preconditioned generalized conjugate gradient methods to solve the linear system equation that arises in the two-dimensional neutron and photon transport equation in this paper. Several subroutines are developed on the basis of preconditioned generalized conjugate gradient methods for time-independent, two-dimensional neutron and photon transport equation in the transport theory. These generalized conjugate gradient methods are used. TFQMR (transpose free quasi-minimal residual algorithm), CGS (conjuage gradient square algorithm), Bi-CGSTAB (bi-conjugate gradient stabilized algorithm) and QMRCGSTAB (quasi-minimal residual variant of bi-conjugate gradient stabilized algorithm). These sub-routines are connected to computer program DORT. Several problems are tested on a personal computer with Intel Pentium CPU. (author)
Directory of Open Access Journals (Sweden)
Yi ZHANG
2014-12-01
Full Text Available Objective To evaluate the protective effects of endoplasmic reticulum stress preconditioning induced by 2-deoxyglucose (2-DG on hippocampal neurons of rats with status epilepticus (SE and the possible mechanism. Methods Ninety Sprague-Dawley (SD rats were randomly enrolled into preconditioning group (N = 30, SE group (N = 30 and control group (N = 30. Each group was divided into 6 subsets (N = 5 according to six time points (before seizure, 6 h, 12 h, 1 d, 2 d and 7 d after seizure. The preconditioning group was administered 2-DG intraperitoneally with a dose of 150 mg/kg for 7 days, and the lithium-pilocarpine induced SE rat model was established on both preconditioning group and SE group. The rats were sacrificed at the above six time points, and the brains were removed to make paraffin sections. Nissl staining was performed by toluidine blue to evaluate the hippocampal neuronal damage after seizure, and the number of survival neurons in hippocampal CA1 and CA3 regions of the rats were counted. Immunohistochemical staining was performed to detect the expressions of glucose regulated protein 78 (GRP78 and X-box binding protein 1 (XBP-1 in hippocampal CA3 region of the rats. Results The number of survival neurons in preconditioning group was much more than that in SE group at 7 d after seizure (t = 5.353, P = 0.000, and was more obvious in CA1 region. There was no significant hippocampal neuronal damage in control group. The expressions of GRP78 and XBP-1 in CA3 region of hippocampus in SE group at 6 h after seizure were significantly higher than that in control group (P = 0.000, and then kept increasing until reaching the peak at 2 d (P = 0.000, for all. The expressions of GRP78 and XBP-1 in hippocampal CA3 region in preconditioning group were significantly higher than that in control group before seizure (P = 0.000, for all. The level of GRP78 maintained the highest at 24 h and 2 d after seizure (P = 0.000, for all, while the XBP-1 level
Tissier, Renaud; Souktani, Rachid; Parent de Curzon, Olivier; Lellouche, Nicolas; Henry, Patrick; Giudicelli, Jean-François; Berdeaux, Alain; Ghaleh, Bijan
2001-01-01
The goal of this study was to investigate the effects of the delayed pharmacological preconditioning produced by an adenosine A1-receptor agonist (A1-DPC) against ventricular arrhythmias induced by ischaemia and reperfusion, compared to those of ischaemia-induced delayed preconditioning (I-DPC).Eighty-nine instrumented conscious rabbits underwent a 2 consecutive days protocol. On day 1, rabbits were randomly divided into four groups: ‘Control' (saline, i.v.), ‘I-DPC' (six 4-min coronary arter...
HATAZAKI, S.; BELLVER-ESTELLES, C.; JIMENEZ-MATEOS, E. M.; MELLER, R.; BONNER, C.; MURPHY, N.; MATSUSHIMA, S.; TAKI, W.; PREHN, J. H. M.; SIMON, R. P.; HENSHALL, D. C.
2007-01-01
A neuroprotected state can be acquired by preconditioning brain with a stimulus that is subthreshold for damage (tolerance). Acquisition of tolerance involves coordinate, bi-directional changes to gene expression levels and the re-programmed phenotype is determined by the preconditioning stimulus. While best studied in ischemic brain there is evidence brief seizures can confer tolerance against prolonged seizures (status epilepticus). Presently, we developed a model of epileptic preconditioni...
Step by step parallel programming method for molecular dynamics code
International Nuclear Information System (INIS)
Orii, Shigeo; Ohta, Toshio
1996-07-01
Parallel programming for a numerical simulation program of molecular dynamics is carried out with a step-by-step programming technique using the two phase method. As a result, within the range of a certain computing parameters, it is found to obtain parallel performance by using the level of parallel programming which decomposes the calculation according to indices of do-loops into each processor on the vector parallel computer VPP500 and the scalar parallel computer Paragon. It is also found that VPP500 shows parallel performance in wider range computing parameters. The reason is that the time cost of the program parts, which can not be reduced by the do-loop level of the parallel programming, can be reduced to the negligible level by the vectorization. After that, the time consuming parts of the program are concentrated on less parts that can be accelerated by the do-loop level of the parallel programming. This report shows the step-by-step parallel programming method and the parallel performance of the molecular dynamics code on VPP500 and Paragon. (author)
Research in Parallel Algorithms and Software for Computational Aerosciences
Domel, Neal D.
1996-01-01
Phase 1 is complete for the development of a computational fluid dynamics CFD) parallel code with automatic grid generation and adaptation for the Euler analysis of flow over complex geometries. SPLITFLOW, an unstructured Cartesian grid code developed at Lockheed Martin Tactical Aircraft Systems, has been modified for a distributed memory/massively parallel computing environment. The parallel code is operational on an SGI network, Cray J90 and C90 vector machines, SGI Power Challenge, and Cray T3D and IBM SP2 massively parallel machines. Parallel Virtual Machine (PVM) is the message passing protocol for portability to various architectures. A domain decomposition technique was developed which enforces dynamic load balancing to improve solution speed and memory requirements. A host/node algorithm distributes the tasks. The solver parallelizes very well, and scales with the number of processors. Partially parallelized and non-parallelized tasks consume most of the wall clock time in a very fine grain environment. Timing comparisons on a Cray C90 demonstrate that Parallel SPLITFLOW runs 2.4 times faster on 8 processors than its non-parallel counterpart autotasked over 8 processors.
Preconditions of commercial use in tourism of individual´s death
TŮMOVÁ, Blanka
2008-01-01
This bachelor thesis deals with the processing the theme Dark Tourism introducing an unusual and so far not very well-known type of tourism in the Czech Republic. The concept Dark Tourism (also known as Thanatourism) refers to visiting sites which offer a presentation of death or suffering and it is identified with visitations to places where tragedies or historically noteworthy death has occurred and that continue to impact our lives. This thesis researches preconditions of commercial use in...
Nehra, Sarita; Bhardwaj, Varun; Bansal, Anju; Saraswat, Deepika
2017-09-26
Chronic hypobaric hypoxia (cHH) mediated cardiac insufficiencies are associated with pathological damage. Sustained redox stress and work load are major causative agents of cardiac insufficiencies under cHH. Despite the advancements made in pharmacological (anti-oxidants, vasodilators) and non-pharmacological therapeutics (acclimatization strategies and schedules), only partial success has been achieved in improving cardiac acclimatization to cHH. This necessitates the need for potent combinatorial therapies to improve cardiac acclimatization at high altitudes. We hypothesize that a combinatorial therapy comprising preconditioning to mild aerobic treadmill exercise and supplementation with nanocurcumin formulation (NCF) consisting of nanocurcumin (NC) and pyrroloquinoline quinone (PQQ) might improve cardiac adaptation at high altitudes. Adult Sprague-Dawley rats pre-conditioned to treadmill exercise and supplemented with NCF were exposed to cHH (7620 m altitude corresponding to pO2~8% at 28±2°C, relative humidity 55%±1%) for 3 weeks. The rat hearts were analyzed for changes in markers of oxidative stress (free radical leakage, lipid peroxidation, manganese-superoxide dismutase [MnSOD] activity), cardiac injury (circulating cardiac troponin I [TnI] and T [cTnT], myocardial creatine kinase [CK-MB]), metabolic damage (lactate dehydrogenase [LDH] and acetyl-coenzyme A levels, lactate and pyruvate levels) and bio-energetic insufficiency (ATP, p-AMPKα). Significant modulations (p≤0.05) in cardiac redox status, metabolic damage, cardiac injury and bio-energetics were observed in rats receiving both NCF supplementation and treadmill exercise-preconditioning compared with rats receiving only one of the treatments. The combinatorial therapeutic strategy showed a tremendous improvement in cardiac acclimatization to cHH compared to either exercise-preconditioning or NCF supplementation alone which was evident from the effective modulation in redox, metabolic, contractile
2014-01-07
this can have a disastrous effect on convergence rate. Even if steady state is obtained for low Mach number flows (after many iterations ), the results...rally lead do a diagonally dominant left-hand-side matrix, which causes stability problems for implicit Gauss - Seidel schemes. For this reason, matrix... convergence at the stagnation point. The iterations for each airfoil is also reported in Fig. 2. Without preconditioning, dramatic efficiency problems are seen
Czech Academy of Sciences Publication Activity Database
Vejchodský, Tomáš; Šolín, Pavel
2008-01-01
Roč. 218, č. 1 (2008), s. 192-200 ISSN 0377-0427 R&D Projects: GA AV ČR IAA100760702; GA ČR GA102/05/0629; GA ČR(CZ) GA102/07/0496 Institutional research plan: CEZ:AV0Z10190503; CEZ:AV0Z20570509 Keywords : static condensation of internal degrees of freedom * orthogonalization * ILU preconditioning Subject RIV: BA - General Mathematics Impact factor: 1.048, year: 2008
Directory of Open Access Journals (Sweden)
A K Voronkov
2012-06-01
Full Text Available The article focuses on analyses of preconditions for development of international relations between UAE and African countries including geographical location of the UAE, naval and ship building skills of the Persian gulf Arabs, participation of both Eastern Africa and Persian Gulf in the Indian ocean trade as well as influence on its development of external factors such as Islamic expansion and colonial policies of Britain and Portugal.
Kostyuchenko V.; Malinovskaya A.; Mamonova A.
2018-01-01
Introduction. The worldwide expansion of digital technologies and the development of the cyber economy led to emergence of a new digital assets – the cryptographic currency that rapidly growing popularity. The phenomenon of cryptocurrency is relatively new and little investigated. Purpose. The purpose of the article is to substantiate the preconditions for the introduction of accounting and taxation of transactions with cryptic currencies in Ukraine. Results. The article considers the...
Xue, Yuquan; Xu, Zhibin; Chen, Haiwen; Gan, Weimin; Chong, Tie
2017-07-01
To evaluate whether low energy shock wave preconditioning could reduce renal ischemic reperfusion injury caused by renal artery occlusion. The right kidneys of 64 male Sprague Dawley rats were removed to establish an isolated kidney model. The rats were then divided into four treatment groups: Group 1 was the sham treatment group; Group 2, received only low-energy (12 kv, 1 Hz, 200 times) shock wave preconditioning; Group 3 received the same low-energy shock wave preconditioning as Group 2, and then the left renal artery was occluded for 45 minutes; and Group 4 had the left renal artery occluded for 45 minutes. At 24 hours and one-week time points after reperfusion, serum inducible nitric oxide synthase (iNOS), neutrophil gelatinase-associated lipocalin (NGAL), kidney injury molecule-1 (KIM-1), creatinine (Cr), and cystatin C (Cys C) levels were measured, malondialdehyde (MDA) in kidney tissue was detected, and changes in nephric morphology were evaluated by light and electron microscopy. Twenty-four hours after reperfusion, serum iNOS, NGAL, Cr, Cys C, and MDA levels in Group 3 were significantly lower than those in Group 4; light and electron microscopy showed that the renal tissue injury in Group 3 was significantly lighter than that in Group 4. One week after reperfusion, serum NGAL, KIM-1, and Cys C levels in Group 3 were significantly lower than those in Group 4. Low-energy shock wave preconditioning can reduce renal ischemic reperfusion injury caused by renal artery occlusion in an isolated kidney rat model.
Hladkykh Dmytro M.
2017-01-01
The article is aimed at studying the preconditions for introduction, the main problems and prospects for implementation of the inflation targeting regime in Ukraine. In 2014, the country got into a crisis that affected at once the currency market, the banking system and the real sector, resulting in devaluations, bank failures, decreasing GDP, growing prices. One of the responses to the financial challenges was the transition to inflationary targeting, which led to a slowdown in inflation in ...
Zhu, Xiaoling; Yin, Jinbo; Li, Liaoliao; Ma, Lei; Tan, Hongying; Deng, Jiao; Chen, Shaoyang; Zuo, Zhiyi
2013-01-01
Electroacupuncture has been shown to induce a preconditioning effect in the brain. The mechanisms for this protection are not fully elucidated. We hypothesize that this protection is mediated by excitatory amino acid transporters (EAATs) that have been shown to be neuroprotective. To test this hypothesis, two-month old male Sprague-Dawley rats and EAAT type 3 (EAAT3) knockout mice received or did not receive 30-min electroacupuncture once a day for 5 consecutive days. They were subjected to a...
Directory of Open Access Journals (Sweden)
Kraemer Robert
2011-11-01
Full Text Available Abstract Background Therapeutic strategies aiming to reduce ischemia/reperfusion injury by conditioning tissue tolerance against ischemia appear attractive not only from a scientific perspective, but also in clinics. Although previous studies indicate that remote ischemic intermittent preconditioning (RIPC is a systemic phenomenon, only a few studies have focused on the elucidation of its mechanisms of action especially in the clinical setting. Therefore, the aim of this study is to evaluate the acute microcirculatory effects of remote ischemic preconditioning on a distinct cutaneous location at the lower extremity which is typically used as a harvesting site for free flap reconstructive surgery in a human in-vivo setting. Methods Microcirculatory data of 27 healthy subjects (25 males, age 24 ± 4 years, BMI 23.3 were evaluated continuously at the anterolateral aspect of the left thigh during RIPC using combined Laser-Doppler and photospectrometry (Oxygen-to-see, Lea Medizintechnik, Germany. After baseline microcirculatory measurement, remote ischemia was induced using a tourniquet on the contralateral upper arm for three cycles of 5 min. Results After RIPC, tissue oxygen saturation and capillary blood flow increased up to 29% and 35% during the third reperfusion phase versus baseline measurement, respectively (both p = 0.001. Postcapillary venous filling pressure decreased statistically significant by 16% during second reperfusion phase (p = 0.028. Conclusion Remote intermittent ischemic preconditioning affects cutaneous tissue oxygen saturation, arterial capillary blood flow and postcapillary venous filling pressure at a remote cutaneous location of the lower extremity. To what extent remote preconditioning might ameliorate reperfusion injury in soft tissue trauma or free flap transplantation further clinical trials have to evaluate. Trial registration ClinicalTrials.gov: NCT01235286
The precondition of social mobility in Ignalina NPP and its area
International Nuclear Information System (INIS)
Mikshys, A.
1998-01-01
In the paper some preconditions of social mobility in the northern Lithuania (Ignalina nuclear power plant) and in its area are analyzed. The results of the sociological research reveal the desire of some part of the inhabitants of the nuclear power plant area to change their social status and the place of residence. The difficult social and demographically situation in this region as significant is noted. The author proposes some mean for the normalization of this situation. (author)
Preconditioning of two-by-two block matrix systems with square matrix blocks, with applications
Czech Academy of Sciences Publication Activity Database
Axelsson, Owe
2017-01-01
Roč. 62, č. 6 (2017), s. 537-559 ISSN 0862-7940. [SNA´17 - Seminar on numerical analysis. Ostrava, 30.01.2017-03.02.2017] Institutional support: RVO:68145535 Keywords : preconditioning * Schur complement * transformation * optimal control * implicit time integration Subject RIV: BA - General Mathematics OBOR OECD: Applied mathematics Impact factor: 0.618, year: 2016 http://articles.math.cas.cz/10.21136/AM.2017.0222-17/?type=F
Parallel Polarization State Generation.
She, Alan; Capasso, Federico
2016-05-17
The control of polarization, an essential property of light, is of wide scientific and technological interest. The general problem of generating arbitrary time-varying states of polarization (SOP) has always been mathematically formulated by a series of linear transformations, i.e. a product of matrices, imposing a serial architecture. Here we show a parallel architecture described by a sum of matrices. The theory is experimentally demonstrated by modulating spatially-separated polarization components of a laser using a digital micromirror device that are subsequently beam combined. This method greatly expands the parameter space for engineering devices that control polarization. Consequently, performance characteristics, such as speed, stability, and spectral range, are entirely dictated by the technologies of optical intensity modulation, including absorption, reflection, emission, and scattering. This opens up important prospects for polarization state generation (PSG) with unique performance characteristics with applications in spectroscopic ellipsometry, spectropolarimetry, communications, imaging, and security.
Parallel imaging microfluidic cytometer.
Ehrlich, Daniel J; McKenna, Brian K; Evans, James G; Belkina, Anna C; Denis, Gerald V; Sherr, David H; Cheung, Man Ching
2011-01-01
By adding an additional degree of freedom from multichannel flow, the parallel microfluidic cytometer (PMC) combines some of the best features of fluorescence-activated flow cytometry (FCM) and microscope-based high-content screening (HCS). The PMC (i) lends itself to fast processing of large numbers of samples, (ii) adds a 1D imaging capability for intracellular localization assays (HCS), (iii) has a high rare-cell sensitivity, and (iv) has an unusual capability for time-synchronized sampling. An inability to practically handle large sample numbers has restricted applications of conventional flow cytometers and microscopes in combinatorial cell assays, network biology, and drug discovery. The PMC promises to relieve a bottleneck in these previously constrained applications. The PMC may also be a powerful tool for finding rare primary cells in the clinic. The multichannel architecture of current PMC prototypes allows 384 unique samples for a cell-based screen to be read out in ∼6-10 min, about 30 times the speed of most current FCM systems. In 1D intracellular imaging, the PMC can obtain protein localization using HCS marker strategies at many times for the sample throughput of charge-coupled device (CCD)-based microscopes or CCD-based single-channel flow cytometers. The PMC also permits the signal integration time to be varied over a larger range than is practical in conventional flow cytometers. The signal-to-noise advantages are useful, for example, in counting rare positive cells in the most difficult early stages of genome-wide screening. We review the status of parallel microfluidic cytometry and discuss some of the directions the new technology may take. Copyright © 2011 Elsevier Inc. All rights reserved.
Saklani, Reetu; Jaggi, Amteshwar; Singh, Nirmal
2010-07-01
We tested the neuroprotective effect of milrinone, a phosphodiesterase III inhibitor, in pharmacological preconditioning. Bilateral carotid artery occlusion for 12 min followed by reperfusion for 24 h produced ischemia-reperfusion (I/R) cerebral injury in male Swiss albino mice. Cerebral infarct size was measured using triphenyltetrazolium chloride staining. Memory was assessed using the Morris water maze test, and motor coordination was evaluated using the inclined beam walking test, rota-rod test, and lateral push test. Milrinone (50 microg/kg & 100 microg/kg i.v.) was administered 24 h before surgery in a separate group of animals to induce pharmacological preconditioning. I/R increased cerebral infarct size and impaired memory and motor coordination. Milrinone treatment significantly decreased cerebral infarct size and reversed I/R-induced impairments in memory and motor coordination. This neuroprotective effect was blocked by ruthenium red (3 mg/kg, s.c.), an intracellular ryanodine receptor blocker. These findings indicate that milrinone preconditioning exerts a marked neuroprotective effect on the ischemic brain, putatively due to increased intracellular calcium levels activating calcium-sensitive signal transduction cascades.
Functional recovery in rat spinal cord injury induced by hyperbaric oxygen preconditioning.
Lu, Pei-Gang; Hu, Sheng-Li; Hu, Rong; Wu, Nan; Chen, Zhi; Meng, Hui; Lin, Jiang-Kai; Feng, Hua
2012-12-01
It is a common belief that neurosurgical interventions can cause inevitable damage resulting from the procedure itself in surgery especially for intramedullary spinal cord tumors. The present study was designed to examine if hyperbaric oxygen preconditioning (HBO-PC) was neuroprotective against surgical injuries using a rat model of spinal cord injury (SCI). Sprague-Dawley rats were randomly divided into three groups: HBO-PC group, hypobaric hypoxic preconditioning (HH-PC) control group, and normobaric control group. All groups were subjected to SCI by weight drop device. Rats from each group were examined for neurological behavior and electrophysiological function. Tissue sections were analyzed by using immunohistochemistry, TdT-mediated dUTP-biotin nick end labeling, and axonal tract tracing. Significant neurological deficits were observed after SCI and HBO-PC and HH-PC improved neurological deficits 1 week post-injury. The latencies of motor-evoked potential and somatosensory-evoked potential were significantly delayed after SCI, which was attenuated by HBO-PC and HH-PC. Compared with normobaric control group, pretreatment with HBO and hypobaric hypoxia significantly reduced the number of TdT-mediated dUTP-biotin nick end labeling-positive cells, and increased nestin-positive cells. HBO-PC and HH-PC enhanced axonal growth after SCI. In conclusion, preconditioning with HBO and hypobaric hypoxia can facilitate functional recovery and suppress cell apoptosis after SCI and may prove to be a useful preventive strategy to neurosurgical SCI.
Arctic atmospheric preconditioning: do not rule out shortwave radiation just yet
Sedlar, J.
2017-12-01
Springtime atmospheric preconditioning of Arctic sea ice for enhanced or buffered sea ice melt during the subsequent melt year has received considerable research focus in recent years. A general consensus points to enhanced poleward atmospheric transport of moisture and heat during spring, effectively increasing the emission of longwave radiation to the surface. Studies have essentially ruled out the role of shortwave radiation as an effective preconditioning mechanism because of the relatively weak incident solar radiation and high surface albedo from sea ice and snow during spring. These conclusions, however, are derived primarily from atmospheric reanalysis data, which may not always represent an accurate depiction of the Arctic climate system. Here, observations of top of atmosphere radiation from state of the art satellite sensors are examined and compared with reanalysis and climate model data to examine the differences in the spring radiative budget over the Arctic Ocean for years with extreme low/high ice extent at the end of the ice melt season (September). Distinct biases are observed between satellite-based measurements and reanalysis/models, particularly for the amount of shortwave radiation trapped (warming effect) within the Arctic climate system during spring months. A connection between the differences in reanalysis/model surface albedo representation and the albedo observed by satellite is discussed. These results suggest that shortwave radiation should not be overlooked as a significant contributing mechanism to springtime Arctic atmospheric preconditioning.
Directory of Open Access Journals (Sweden)
Meisam Shahhoseini
2017-01-01
Full Text Available Objective(s:Every year, a large number of people lose their lives due to stroke. Stroke is the second leading cause of death worldwide. Surprisingly, recent studies have shown that preconditioning with hyperoxia (HO increases tissue tolerance to ischemia, ultimately reducing damages caused by stroke. Addressed in this study are beneficial contributions from HO preconditioning into reduced harm to be incurred by the attack, as well as its effect on the expression levels of vascular endothelial growth factor (VEGF and endostatin. Materials and Methods: A set of experiments was conducted where a number of rats were divided into three groups. The animals in the first group received 90% oxygen for 4 hr a day, for 6 days. The second group was housed in room air and the third group was a sham (surgical stress. After 60 min of ischemia, 24 hr blood flow, neurological deficit score (NDS and infarct volume (IV in the group MCAO (Middle Cerebral Artery Occlusion were investigated. Immediately following a 48 hr HO pre-treatment, sampling was performed to measure the expression levels of VEGF and endostatin. Results: Preconditioning with alternating HO led to reduced infarct volume and NDS. Moreover, pre-treatment with HO resulted in increased VEGF expression while decreasing endostatin. Conclusion: Although further studies are deemed necessary to clarify the mechanisms of ischemic tolerance, apparently, somewhat intermittent hyperoxia can be associated with positive impacts by increasing VEGF and decreasing expression of endostatin.
Material pre-conditioning effects on the creep behaviour of 316H stainless steel
International Nuclear Information System (INIS)
Mehmanparast, A.; Davies, C.M.; Dean, D.W.; Nikbin, K.
2013-01-01
Material pre-conditioning by, for example, pre-strain through component bending and welding is known to alter the creep deformation and creep crack growth (CCG) behaviour of 316H stainless steel. Experimental test data on the creep deformation and crack growth behaviour of 316H weldment compact tension specimens at 550 °C, where the starter defect was introduced into the heat affected zone (HAZ), have been compared to those of obtained from similar specimens manufactured from parent material, which had been subjected to 8% compressive plastic pre-strain at room temperature. Similar degrees of accelerated cracking behaviour compared to parent material, for given values of C*, were exhibited in both 316H HAZ and pre-compressed parent materials. This acceleration has been attributed to the influence of material hardening effects and the reduction of creep ductility in the pre-conditioned materials. These results are discussed in terms of the potential for using material pre-conditioning to assist in predicting the long term cracking behaviour of high temperature 316H stainless steel plant components from shorter term laboratory CCG tests
Butt, Hira; Mehmood, Azra; Ali, Muhammad; Tasneem, Saba; Anjum, Muhammad Sohail; Tarar, Moazzam N; Khan, Shaheen N; Riazuddin, Sheikh
2017-09-01
Oxidative microenvironment of burnt skin restricts the outcome of cell based therapies of thermal skin injuries. The aim of this study was to precondition human dermal fibroblasts with an antioxidant such as vitamin E to improve their survival and therapeutic abilities in heat induced oxidative in vitro environment. Fibroblasts were treated with 100μM vitamin E for 24h at 37°C followed by heat shock for 10min at 51°C in fresh serum free medium. Preconditioning with vitamin E reduced cell injury as demonstrated by decreased expression of annexin-V, cytochrome p450 (CYP450) mediated oxidative reactions, senescence and release of lactate dehydrogenase (LDH) accomplished by down-regulated expression of pro-apoptotic BAX gene. Vitamin E preconditioned cells exhibited remarkable improvement in cell viability, release of paracrine factors such as epidermal growth factor (EGF), basic fibroblast growth factor (bFGF), vascular endothelial growth factor (VEGF), stromal derived factor-1alpha (SDF-1α) and also showed significantly up-regulated levels of PCNA, VEGF, BCL-XL, FGF7, FGF23, FLNβ and Col7α genes presumably through activation of phosphatidylinositol 3-kinase (PI3-K)/Akt pathway. The results suggest that pretreatment of fibroblasts with vitamin E prior to transplantation in burnt skin speeds up the wound healing process by improving the antioxidant scavenging responses in oxidative environment of transplanted burn wounds. Copyright © 2017 Elsevier Inc. All rights reserved.
Directory of Open Access Journals (Sweden)
Jianfei Zhang
2013-01-01
Full Text Available Graphics processing unit (GPU has obtained great success in scientific computations for its tremendous computational horsepower and very high memory bandwidth. This paper discusses the efficient way to implement polynomial preconditioned conjugate gradient solver for the finite element computation of elasticity on NVIDIA GPUs using compute unified device architecture (CUDA. Sliced block ELLPACK (SBELL format is introduced to store sparse matrix arising from finite element discretization of elasticity with fewer padding zeros than traditional ELLPACK-based formats. Polynomial preconditioning methods have been investigated both in convergence and running time. From the overall performance, the least-squares (L-S polynomial method is chosen as a preconditioner in PCG solver to finite element equations derived from elasticity for its best results on different example meshes. In the PCG solver, mixed precision algorithm is used not only to reduce the overall computational, storage requirements and bandwidth but to make full use of the capacity of the GPU devices. With SBELL format and mixed precision algorithm, the GPU-based L-S preconditioned CG can get a speedup of about 7–9 to CPU-implementation.
Matsuzaki, Satoshi; Szweda, Pamela A; Szweda, Luke I; Humphries, Kenneth M
2009-11-30
Excessive production of free radicals by mitochondria is associated with, and likely contributes to, the progression of numerous pathological conditions. Nevertheless, the production of free radicals by the mitochondria may have important biological functions under normal or stressed conditions by activating or modulating redox-sensitive cellular signaling pathways. This raises the intriguing possibility that regulated mitochondrial free radical production occurs via mechanisms that are distinct from pathologies associated with oxidative damage. Indeed, the capacity of mitochondria to produce free radicals in a limited manner may play a role in ischemic preconditioning, the phenomenon whereby short bouts of ischemia protect from subsequent prolonged ischemia and reperfusion. Ischemic preconditioning can thus serve as an important model system for defining regulatory mechanisms that allow for transient, signal-inducing, production of free radicals by mitochondria. Defining how these mechanism(s) occur will provide insight into therapeutic approaches that minimize oxidative damage without altering normal cellular redox biology. The aim of this review is to present and discuss evidence for the regulated production of superoxide by the electron transport chain within the ischemic preconditioning paradigm of redox regulation.
Collins, Anne M; Quinlan, Christine S; Dolan, Roisin T; O'Neill, Shane P; Tierney, Paul; Cronin, Kevin J; Ridgway, Paul F
2015-07-01
The benefits of incorporating audiovisual materials into learning are well recognised. The outcome of integrating such a modality in to anatomical education has not been reported previously. The aim of this randomised study was to determine whether audiovisual preconditioning is a useful adjunct to learning at an upper limb dissection course. Prior to instruction participants completed a standardised pre course multiple-choice questionnaire (MCQ). The intervention group was subsequently shown a video with a pre-recorded commentary. Following initial dissection, both groups completed a second MCQ. The final MCQ was completed at the conclusion of the course. Statistical analysis confirmed a significant improvement in the performance in both groups over the duration of the three MCQs. The intervention group significantly outperformed their control group counterparts immediately following audiovisual preconditioning and in the post course MCQ. Audiovisual preconditioning is a practical and effective tool that should be incorporated in to future course curricula to optimise learning. Level of evidence This study appraises an intervention in medical education. Kirkpatrick Level 2b (modification of knowledge). Copyright © 2015 British Association of Plastic, Reconstructive and Aesthetic Surgeons. Published by Elsevier Ltd. All rights reserved.
Preconditioning for partial differential equation constrained optimization with control constraints
Stoll, Martin; Wathen, Andy
2011-01-01
Optimal control problems with partial differential equations play an important role in many applications. The inclusion of bound constraints for the control poses a significant additional challenge for optimization methods. In this paper, we propose preconditioners for the saddle point problems that arise when a primal-dual active set method is used. We also show for this method that the same saddle point system can be derived when the method is considered as a semismooth Newton method. In addition, the projected gradient method can be employed to solve optimization problems with simple bounds, and we discuss the efficient solution of the linear systems in question. In the case when an acceleration technique is employed for the projected gradient method, this again yields a semismooth Newton method that is equivalent to the primal-dual active set method. We also consider the Moreau-Yosida regularization method for control constraints and efficient preconditioners for this technique. Numerical results illustrate the competitiveness of these approaches. © 2011 John Wiley & Sons, Ltd.
Preconditioning for partial differential equation constrained optimization with control constraints
Stoll, Martin
2011-10-18
Optimal control problems with partial differential equations play an important role in many applications. The inclusion of bound constraints for the control poses a significant additional challenge for optimization methods. In this paper, we propose preconditioners for the saddle point problems that arise when a primal-dual active set method is used. We also show for this method that the same saddle point system can be derived when the method is considered as a semismooth Newton method. In addition, the projected gradient method can be employed to solve optimization problems with simple bounds, and we discuss the efficient solution of the linear systems in question. In the case when an acceleration technique is employed for the projected gradient method, this again yields a semismooth Newton method that is equivalent to the primal-dual active set method. We also consider the Moreau-Yosida regularization method for control constraints and efficient preconditioners for this technique. Numerical results illustrate the competitiveness of these approaches. © 2011 John Wiley & Sons, Ltd.
Energy Technology Data Exchange (ETDEWEB)
Yoon, Jeong Hee [Department of Radiology, Seoul National University Hospital, Seoul 03080 (Korea, Republic of); Department of Radiology, Seoul National University College of Medicine, Seoul 03087 (Korea, Republic of); Lee, Jeong Min [Department of Radiology, Seoul National University Hospital, Seoul 03080 (Korea, Republic of); Department of Radiology, Seoul National University College of Medicine, Seoul 03087 (Korea, Republic of); Institute of Radiation Medicine, Seoul National University Medical Research Center, Seoul 03087 (Korea, Republic of); Yu, Mi Hye [Department of Radiology, Konkuk University Medical Center, Seoul 05030 (Korea, Republic of); Kim, Eun Ju [Philips Healthcare Korea, Seoul 04342 (Korea, Republic of); Han, Joon Koo [Department of Radiology, Seoul National University Hospital, Seoul 03080 (Korea, Republic of); Department of Radiology, Seoul National University College of Medicine, Seoul 03087 (Korea, Republic of); Institute of Radiation Medicine, Seoul National University Medical Research Center, Seoul 03087 (Korea, Republic of)
2016-11-01
To determine whether triple arterial phase acquisition via a combination of Contrast Enhanced Time Robust Angiography, keyhole, temporal viewsharing and parallel imaging can improve arterial phase acquisition with higher spatial resolution than single arterial phase gadoxetic-acid enhanced magnetic resonance imaging (MRI). Informed consent was waived for this retrospective study by our Institutional Review Board. In 752 consecutive patients who underwent gadoxetic acid-enhanced liver MRI, either single (n = 587) or triple (n = 165) arterial phases was obtained in a single breath-hold under MR fluoroscopy guidance. Arterial phase timing was assessed, and the degree of motion was rated on a four-point scale. The percentage of patients achieving the late arterial phase without significant motion was compared between the two methods using the χ{sup 2} test. The late arterial phase was captured at least once in 96.4% (159/165) of the triple arterial phase group and in 84.2% (494/587) of the single arterial phase group (p < 0.001). Significant motion artifacts (score ≤ 2) were observed in 13.3% (22/165), 1.2% (2/165), 4.8% (8/165) on 1st, 2nd, and 3rd scans of triple arterial phase acquisitions and 6.0% (35/587) of single phase acquisitions. Thus, the late arterial phase without significant motion artifacts was captured in 96.4% (159/165) of the triple arterial phase group and in 79.9% (469/587) of the single arterial phase group (p < 0.001). Triple arterial phase imaging may reliably provide adequate arterial phase imaging for gadoxetic acid-enhanced liver MRI.
Energy Technology Data Exchange (ETDEWEB)
Yoon, Jeong Hee; Lee, Jeong Min; Han, Joon Koo [Dept. of Radiology, Seoul National University Hospital, Seoul (Korea, Republic of); Yu, Mi Hye [Dept. of Radiology, Konkuk University Medical Center, Seoul (Korea, Republic of); Kim, Eun Ju [Philips Healthcare Korea, Seoul (Korea, Republic of)
2016-07-15
To determine whether triple arterial phase acquisition via a combination of Contrast Enhanced Time Robust Angiography, keyhole, temporal viewsharing and parallel imaging can improve arterial phase acquisition with higher spatial resolution than single arterial phase gadoxetic-acid enhanced magnetic resonance imaging (MRI). Informed consent was waived for this retrospective study by our Institutional Review Board. In 752 consecutive patients who underwent gadoxetic acid-enhanced liver MRI, either single (n = 587) or triple (n = 165) arterial phases was obtained in a single breath-hold under MR fluoroscopy guidance. Arterial phase timing was assessed, and the degree of motion was rated on a four-point scale. The percentage of patients achieving the late arterial phase without significant motion was compared between the two methods using the χ2 test. The late arterial phase was captured at least once in 96.4% (159/165) of the triple arterial phase group and in 84.2% (494/587) of the single arterial phase group (p < 0.001). Significant motion artifacts (score ≤ 2) were observed in 13.3% (22/165), 1.2% (2/165), 4.8% (8/165) on 1st, 2nd, and 3rd scans of triple arterial phase acquisitions and 6.0% (35/587) of single phase acquisitions. Thus, the late arterial phase without significant motion artifacts was captured in 96.4% (159/165) of the triple arterial phase group and in 79.9% (469/587) of the single arterial phase group (p < 0.001). Triple arterial phase imaging may reliably provide adequate arterial phase imaging for gadoxetic acid-enhanced liver MRI.
Zhang, Chuanqing; Feng, Xiating; Zhou, Hui; Qiu, Shili; Wu, Wenping
2012-05-01
The headrace tunnels at the Jinping II Hydropower Station cross the Jinping Mountain with a maximum overburden depth of 2,525 m, where 80% of the strata along the tunnels consist of marble. A number of extremely intense rockbursts occurred during the excavation of the auxiliary tunnels and the drainage tunnel. In particular, a tunnel boring machine (TBM) was destroyed by an extremely intense rockburst in a 7.2-m-diameter drainage tunnel. Two of the four subsequent 12.4-m-diameter headrace tunnels will be excavated with larger size TBMs, where a high risk of extremely intense rockbursts exists. Herein, a top pilot tunnel preconditioning method is proposed to minimize this risk, in which a drilling and blasting method is first recommended for the top pilot tunnel excavation and support, and then the TBM excavation of the main tunnel is conducted. In order to evaluate the mechanical effectiveness of this method, numerical simulation analyses using the failure approaching index, energy release rate, and excess shear stress indices are carried out. Its construction feasibility is discussed as well. Moreover, a microseismic monitoring technique is used in the experimental tunnel section for the real-time monitoring of the microseismic activities of the rock mass in TBM excavation and for assessing the effect of the top pilot tunnel excavation in reducing the risk of rockbursts. This method is applied to two tunnel sections prone to extremely intense rockbursts and leads to a reduction in the risk of rockbursts in TBM excavation.
About Parallel Programming: Paradigms, Parallel Execution and Collaborative Systems
Directory of Open Access Journals (Sweden)
Loredana MOCEAN
2009-01-01
Full Text Available In the last years, there were made efforts for delineation of a stabile and unitary frame, where the problems of logical parallel processing must find solutions at least at the level of imperative languages. The results obtained by now are not at the level of the made efforts. This paper wants to be a little contribution at these efforts. We propose an overview in parallel programming, parallel execution and collaborative systems.
Parallel Framework for Cooperative Processes
Directory of Open Access Journals (Sweden)
Mitică Craus
2005-01-01
Full Text Available This paper describes the work of an object oriented framework designed to be used in the parallelization of a set of related algorithms. The idea behind the system we are describing is to have a re-usable framework for running several sequential algorithms in a parallel environment. The algorithms that the framework can be used with have several things in common: they have to run in cycles and the work should be possible to be split between several "processing units". The parallel framework uses the message-passing communication paradigm and is organized as a master-slave system. Two applications are presented: an Ant Colony Optimization (ACO parallel algorithm for the Travelling Salesman Problem (TSP and an Image Processing (IP parallel algorithm for the Symmetrical Neighborhood Filter (SNF. The implementations of these applications by means of the parallel framework prove to have good performances: approximatively linear speedup and low communication cost.
Hajabdollahi, Farzaneh; Premnath, Kannan N.
2018-05-01
Lattice Boltzmann (LB) models used for the computation of fluid flows represented by the Navier-Stokes (NS) equations on standard lattices can lead to non-Galilean-invariant (GI) viscous stress involving cubic velocity errors. This arises from the dependence of their third-order diagonal moments on the first-order moments for standard lattices, and strategies have recently been introduced to restore Galilean invariance without such errors using a modified collision operator involving corrections to either the relaxation times or the moment equilibria. Convergence acceleration in the simulation of steady flows can be achieved by solving the preconditioned NS equations, which contain a preconditioning parameter that can be used to tune the effective sound speed, and thereby alleviating the numerical stiffness. In the present paper, we present a GI formulation of the preconditioned cascaded central-moment LB method used to solve the preconditioned NS equations, which is free of cubic velocity errors on a standard lattice, for steady flows. A Chapman-Enskog analysis reveals the structure of the spurious non-GI defect terms and it is demonstrated that the anisotropy of the resulting viscous stress is dependent on the preconditioning parameter, in addition to the fluid velocity. It is shown that partial correction to eliminate the cubic velocity defects is achieved by scaling the cubic velocity terms in the off-diagonal third-order moment equilibria with the square of the preconditioning parameter. Furthermore, we develop additional corrections based on the extended moment equilibria involving gradient terms with coefficients dependent locally on the fluid velocity and the preconditioning parameter. Such parameter dependent corrections eliminate the remaining truncation errors arising from the degeneracy of the diagonal third-order moments and fully restore Galilean invariance without cubic defects for the preconditioned LB scheme on a standard lattice. Several
Parallel 3-D method of characteristics in MPACT
International Nuclear Information System (INIS)
Kochunas, B.; Dovvnar, T. J.; Liu, Z.
2013-01-01
A new parallel 3-D MOC kernel has been developed and implemented in MPACT which makes use of the modular ray tracing technique to reduce computational requirements and to facilitate parallel decomposition. The parallel model makes use of both distributed and shared memory parallelism which are implemented with the MPI and OpenMP standards, respectively. The kernel is capable of parallel decomposition of problems in space, angle, and by characteristic rays up to 0(104) processors. Initial verification of the parallel 3-D MOC kernel was performed using the Takeda 3-D transport benchmark problems. The eigenvalues computed by MPACT are within the statistical uncertainty of the benchmark reference and agree well with the averages of other participants. The MPACT k eff differs from the benchmark results for rodded and un-rodded cases by 11 and -40 pcm, respectively. The calculations were performed for various numbers of processors and parallel decompositions up to 15625 processors; all producing the same result at convergence. The parallel efficiency of the worst case was 60%, while very good efficiency (>95%) was observed for cases using 500 processors. The overall run time for the 500 processor case was 231 seconds and 19 seconds for the case with 15625 processors. Ongoing work is focused on developing theoretical performance models and the implementation of acceleration techniques to minimize the number of iterations to converge. (authors)
PIXIE3D: An efficient, fully implicit, parallel, 3D extended MHD code for fusion plasma modeling
International Nuclear Information System (INIS)
Chacon, L.
2007-01-01
PIXIE3D is a modern, parallel, state-of-the-art extended MHD code that employs fully implicit methods for efficiency and accuracy. It features a general geometry formulation, and is therefore suitable for the study of many magnetic fusion configurations of interest. PIXIE3D advances the state of the art in extended MHD modeling in two fundamental ways. Firstly, it employs a novel conservative finite volume scheme which is remarkably robust and stable, and demands very small physical and/or numerical dissipation. This is a fundamental requirement when one wants to study fusion plasmas with realistic conductivities. Secondly, PIXIE3D features fully-implicit time stepping, employing Newton-Krylov methods for inverting the associated nonlinear systems. These methods have been shown to be scalable and efficient when preconditioned properly. Novel preconditioned ideas (so-called physics based), which were prototypes in the context of reduced MHD, have been adapted for 3D primitive-variable resistive MHD in PIXIE3D, and are currently being extended to Hall MHD. PIXIE3D is fully parallel, employing PETSc for parallelism. PIXIE3D has been thoroughly benchmarked against linear theory and against other available extended MHD codes on nonlinear test problems (such as the GEM reconnection challenge). We are currently in the process of extending such comparisons to fusion-relevant problems in realistic geometries. In this talk, we will describe both the spatial discretization approach and the preconditioning strategy employed for extended MHD in PIXIE3D. We will report on recent benchmarking studies between PIXIE3D and other 3D extended MHD codes, and will demonstrate its usefulness in a variety of fusion-relevant configurations such as Tokamaks and Reversed Field Pinches. (Author)
Professional Parallel Programming with C# Master Parallel Extensions with NET 4
Hillar, Gastón
2010-01-01
Expert guidance for those programming today's dual-core processors PCs As PC processors explode from one or two to now eight processors, there is an urgent need for programmers to master concurrent programming. This book dives deep into the latest technologies available to programmers for creating professional parallel applications using C#, .NET 4, and Visual Studio 2010. The book covers task-based programming, coordination data structures, PLINQ, thread pools, asynchronous programming model, and more. It also teaches other parallel programming techniques, such as SIMD and vectorization.Teach
DEFF Research Database (Denmark)
Kosbar, Tamer R.; Sofan, Mamdouh A.; Waly, Mohamed A.
2015-01-01
about 6.1 °C when the TFO strand was modified with Z and the Watson-Crick strand with adenine-LNA (AL). The molecular modeling results showed that, in case of nucleobases Y and Z a hydrogen bond (1.69 and 1.72 Å, respectively) was formed between the protonated 3-aminopropyn-1-yl chain and one...... of the phosphate groups in Watson-Crick strand. Also, it was shown that the nucleobase Y made a good stacking and binding with the other nucleobases in the TFO and Watson-Crick duplex, respectively. In contrast, the nucleobase Z with LNA moiety was forced to twist out of plane of Watson-Crick base pair which......The phosphoramidites of DNA monomers of 7-(3-aminopropyn-1-yl)-8-aza-7-deazaadenine (Y) and 7-(3-aminopropyn-1-yl)-8-aza-7-deazaadenine LNA (Z) are synthesized, and the thermal stability at pH 7.2 and 8.2 of anti-parallel triplexes modified with these two monomers is determined. When, the anti...
Parallel consensual neural networks.
Benediktsson, J A; Sveinsson, J R; Ersoy, O K; Swain, P H
1997-01-01
A new type of a neural-network architecture, the parallel consensual neural network (PCNN), is introduced and applied in classification/data fusion of multisource remote sensing and geographic data. The PCNN architecture is based on statistical consensus theory and involves using stage neural networks with transformed input data. The input data are transformed several times and the different transformed data are used as if they were independent inputs. The independent inputs are first classified using the stage neural networks. The output responses from the stage networks are then weighted and combined to make a consensual decision. In this paper, optimization methods are used in order to weight the outputs from the stage networks. Two approaches are proposed to compute the data transforms for the PCNN, one for binary data and another for analog data. The analog approach uses wavelet packets. The experimental results obtained with the proposed approach show that the PCNN outperforms both a conjugate-gradient backpropagation neural network and conventional statistical methods in terms of overall classification accuracy of test data.
A Parallel Particle Swarm Optimizer
National Research Council Canada - National Science Library
Schutte, J. F; Fregly, B .J; Haftka, R. T; George, A. D
2003-01-01
.... Motivated by a computationally demanding biomechanical system identification problem, we introduce a parallel implementation of a stochastic population based global optimizer, the Particle Swarm...