Parallel conjugate gradient algorithms for manipulator dynamic simulation

Science.gov (United States)

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).

Orderings for conjugate gradient preconditionings

Science.gov (United States)

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.

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

Several Guaranteed Descent Conjugate Gradient Methods for Unconstrained Optimization

Directory of Open Access Journals (Sweden)

San-Yang Liu

2014-01-01

Full Text Available This paper investigates a general form of guaranteed descent conjugate gradient methods which satisfies the descent condition gkTdk≤-1-1/4θkgk2  θk>1/4 and which is strongly convergent whenever the weak Wolfe line search is fulfilled. Moreover, we present several specific guaranteed descent conjugate gradient methods and give their numerical results for large-scale unconstrained optimization.

Comparison of preconditioned generalized conjugate gradient methods to two-dimensional neutron and photon transport equation

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)

New Conjugacy Conditions and Related Nonlinear Conjugate Gradient Methods

International Nuclear Information System (INIS)

Dai, Y.-H.; Liao, L.-Z.

2001-01-01

Conjugate gradient methods are a class of important methods for unconstrained optimization, especially when the dimension is large. This paper proposes a new conjugacy condition, which considers an inexact line search scheme but reduces to the old one if the line search is exact. Based on the new conjugacy condition, two nonlinear conjugate gradient methods are constructed. Convergence analysis for the two methods is provided. Our numerical results show that one of the methods is very efficient for the given test problems

Experiments with conjugate gradient algorithms for homotopy curve tracking

Science.gov (United States)

Irani, Kashmira M.; Ribbens, Calvin J.; Watson, Layne T.; Kamat, Manohar P.; Walker, Homer F.

1991-01-01

There are algorithms for finding zeros or fixed points of nonlinear systems of equations that are globally convergent for almost all starting points, i.e., with probability one. The essence of all such algorithms is the construction of an appropriate homotopy map and then tracking some smooth curve in the zero set of this homotopy map. HOMPACK is a mathematical software package implementing globally convergent homotopy algorithms with three different techniques for tracking a homotopy zero curve, and has separate routines for dense and sparse Jacobian matrices. The HOMPACK algorithms for sparse Jacobian matrices use a preconditioned conjugate gradient algorithm for the computation of the kernel of the homotopy Jacobian matrix, a required linear algebra step for homotopy curve tracking. Here, variants of the conjugate gradient algorithm are implemented in the context of homotopy curve tracking and compared with Craig's preconditioned conjugate gradient method used in HOMPACK. The test problems used include actual large scale, sparse structural mechanics problems.

MODIFIED ARMIJO RULE ON GRADIENT DESCENT AND CONJUGATE GRADIENT

Directory of Open Access Journals (Sweden)

ZURAIDAH FITRIAH

2017-10-01

Full Text Available Armijo rule is an inexact line search method to determine step size in some descent method to solve unconstrained local optimization. Modified Armijo was introduced to increase the numerical performance of several descent algorithms that applying this method. The basic difference of Armijo and its modified are in existence of a parameter and estimating the parameter that is updated in every iteration. This article is comparing numerical solution and time of computation of gradient descent and conjugate gradient hybrid Gilbert-Nocedal (CGHGN that applying modified Armijo rule. From program implementation in Matlab 6, it's known that gradient descent was applying modified Armijo more effectively than CGHGN from one side: iteration needed to reach some norm of the gradient  (input by the user. The amount of iteration was representing how long the step size of each algorithm in each iteration. In another side, time of computation has the same conclusion.

A penalized linear and nonlinear combined conjugate gradient method for the reconstruction of fluorescence molecular tomography.

Science.gov (United States)

Shang, Shang; Bai, Jing; Song, Xiaolei; Wang, Hongkai; Lau, Jaclyn

2007-01-01

Conjugate gradient method is verified to be efficient for nonlinear optimization problems of large-dimension data. In this paper, a penalized linear and nonlinear combined conjugate gradient method for the reconstruction of fluorescence molecular tomography (FMT) is presented. The algorithm combines the linear conjugate gradient method and the nonlinear conjugate gradient method together based on a restart strategy, in order to take advantage of the two kinds of conjugate gradient methods and compensate for the disadvantages. A quadratic penalty method is adopted to gain a nonnegative constraint and reduce the illposedness of the problem. Simulation studies show that the presented algorithm is accurate, stable, and fast. It has a better performance than the conventional conjugate gradient-based reconstruction algorithms. It offers an effective approach to reconstruct fluorochrome information for FMT.

Comparison of genetic algorithms with conjugate gradient methods

Science.gov (United States)

Bosworth, J. L.; Foo, N. Y.; Zeigler, B. P.

1972-01-01

Genetic algorithms for mathematical function optimization are modeled on search strategies employed in natural adaptation. Comparisons of genetic algorithms with conjugate gradient methods, which were made on an IBM 1800 digital computer, show that genetic algorithms display superior performance over gradient methods for functions which are poorly behaved mathematically, for multimodal functions, and for functions obscured by additive random noise. Genetic methods offer performance comparable to gradient methods for many of the standard functions.

Adaptive Regularization of Neural Networks Using Conjugate Gradient

DEFF Research Database (Denmark)

Goutte, Cyril; Larsen, Jan

1998-01-01

Andersen et al. (1997) and Larsen et al. (1996, 1997) suggested a regularization scheme which iteratively adapts regularization parameters by minimizing validation error using simple gradient descent. In this contribution we present an improved algorithm based on the conjugate gradient technique........ Numerical experiments with feedforward neural networks successfully demonstrate improved generalization ability and lower computational cost...

Conjugate Gradient Algorithms For Manipulator Simulation

Science.gov (United States)

Fijany, Amir; Scheid, Robert E.

1991-01-01

Report discusses applicability of conjugate-gradient algorithms to computation of forward dynamics of robotic manipulators. Rapid computation of forward dynamics essential to teleoperation and other advanced robotic applications. Part of continuing effort to find algorithms meeting requirements for increased computational efficiency and speed. Method used for iterative solution of systems of linear equations.

The multigrid preconditioned conjugate gradient method

Science.gov (United States)

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.

Fourier domain preconditioned conjugate gradient algorithm for atmospheric tomography.

Science.gov (United States)

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.

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)

A Modified Conjugacy Condition and Related Nonlinear Conjugate Gradient Method

Directory of Open Access Journals (Sweden)

Shengwei Yao

2014-01-01

Full Text Available The conjugate gradient (CG method has played a special role in solving large-scale nonlinear optimization problems due to the simplicity of their very low memory requirements. In this paper, we propose a new conjugacy condition which is similar to Dai-Liao (2001. Based on this condition, the related nonlinear conjugate gradient method is given. With some mild conditions, the given method is globally convergent under the strong Wolfe-Powell line search for general functions. The numerical experiments show that the proposed method is very robust and efficient.

Conjugate Gradient like methods and their application to fixed source neutron diffusion problems

International Nuclear Information System (INIS)

Suetomi, Eiichi; Sekimoto, Hiroshi

1989-01-01

This paper presents a number of fast iterative methods for solving systems of linear equations appearing in fixed source problems for neutron diffusion. We employed the conjugate gradient and conjugate residual methods. In order to accelerate the conjugate residual method, we proposed the conjugate residual squared method by transforming the residual polynomial of the conjugate residual method. Since the convergence of these methods depends on the spectrum of coefficient matrix, we employed the incomplete Choleski (IC) factorization and the modified IC (MIC) factorization as preconditioners. These methods were applied to some neutron diffusion problems and compared with the successive overrelaxation (SOR) method. The results of these numerical experiments showed superior convergence characteristics of the conjugate gradient like method with MIC factorization to the SOR method, especially for a problem involving void region. The CPU time of the MICCG, MICCR and MICCRS methods showed no great difference. In order to vectorize the conjugate gradient like methods based on (M)IC factorization, the hyperplane method was used and implemented on the vector computers, the HITAC S-820/80 and ETA10-E (one processor mode). Significant decrease of the CPU times was observed on the S-820/80. Since the scaled conjugate gradient (SCG) method can be vectorized with no manipulation, it was also compared with the above methods. It turned out the SCG method was the fastest with respect to the CPU times on the ETA10-E. These results suggest that one should implement suitable algorithm for different vector computers. (author)

Comparison of preconditioned generalized conjugate gradient methods to two-dimensional neutron and photon transport equation

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

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

Science.gov (United States)

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.

Application of Conjugate Gradient methods to tidal simulation

Science.gov (United States)

Barragy, E.; Carey, G.F.; Walters, R.A.

1993-01-01

A harmonic decomposition technique is applied to the shallow water equations to yield a complex, nonsymmetric, nonlinear, Helmholtz type problem for the sea surface and an accompanying complex, nonlinear diagonal problem for the velocities. The equation for the sea surface is linearized using successive approximation and then discretized with linear, triangular finite elements. The study focuses on applying iterative methods to solve the resulting complex linear systems. The comparative evaluation includes both standard iterative methods for the real subsystems and complex versions of the well known Bi-Conjugate Gradient and Bi-Conjugate Gradient Squared methods. Several Incomplete LU type preconditioners are discussed, and the effects of node ordering, rejection strategy, domain geometry and Coriolis parameter (affecting asymmetry) are investigated. Implementation details for the complex case are discussed. Performance studies are presented and comparisons made with a frontal solver. ?? 1993.

A Spectral Conjugate Gradient Method for Unconstrained Optimization

International Nuclear Information System (INIS)

Birgin, E. G.; Martinez, J. M.

2001-01-01

A family of scaled conjugate gradient algorithms for large-scale unconstrained minimization is defined. The Perry, the Polak-Ribiere and the Fletcher-Reeves formulae are compared using a spectral scaling derived from Raydan's spectral gradient optimization method. The best combination of formula, scaling and initial choice of step-length is compared against well known algorithms using a classical set of problems. An additional comparison involving an ill-conditioned estimation problem in Optics is presented

Problem of unstable pivots in the incomplete LU-conjugate gradient method

International Nuclear Information System (INIS)

Kershaw, D.S.

1978-01-01

Incomplete LU and incomplete-Cholesky conjugate gradient methods are becoming widely used in both laser and magnetic fusion research. In my original presentation of these methods, the problem of what to do if a pivot [L/sub ii/U/sub ii/) becomes very small or zero was raised and only partially answered by the suggestion that it be arbitrarily set to some non-zero value. In what follows it will be shown precisely how small the pivot can become before it must be fixed and precisely what value it should be set to in order to minimize the error in LU. Numerical examples will be given to show that not only does this prescription improve incomplete LU-conjugate gradient methods , but exact LU decomposition carried out with this prescription for handling small pivots and followed by a few linear or conjugate gradient iterations can be much faster than the permutations of rows and columns usually employed to circumvent small pivot problems

Ultrasonic wave propagation through aberrating layers: experimental verification of the conjugate gradient Rayleigh method

NARCIS (Netherlands)

Ledoux, L.A.F.; Berkhoff, Arthur P.; Thijssen, J.M.

The Conjugate Gradient Rayleigh method for the calculation of acoustic reflection and transmission at a rough interface between two media was experimentally verified. The method is based on a continuous version of the conjugate gradient technique and plane-wave expansions. We measured the beam

A three-term conjugate gradient method under the strong-Wolfe line search

Science.gov (United States)

Khadijah, Wan; Rivaie, Mohd; Mamat, Mustafa

2017-08-01

Recently, numerous studies have been concerned in conjugate gradient methods for solving large-scale unconstrained optimization method. In this paper, a three-term conjugate gradient method is proposed for unconstrained optimization which always satisfies sufficient descent direction and namely as Three-Term Rivaie-Mustafa-Ismail-Leong (TTRMIL). Under standard conditions, TTRMIL method is proved to be globally convergent under strong-Wolfe line search. Finally, numerical results are provided for the purpose of comparison.

Conjugate-Gradient Algorithms For Dynamics Of Manipulators

Science.gov (United States)

Fijany, Amir; Scheid, Robert E.

1993-01-01

Algorithms for serial and parallel computation of forward dynamics of multiple-link robotic manipulators by conjugate-gradient method developed. Parallel algorithms have potential for speedup of computations on multiple linked, specialized processors implemented in very-large-scale integrated circuits. Such processors used to stimulate dynamics, possibly faster than in real time, for purposes of planning and control.

Conjugate gradient heat bath for ill-conditioned actions.

Science.gov (United States)

Ceriotti, Michele; Bussi, Giovanni; Parrinello, Michele

2007-08-01

We present a method for performing sampling from a Boltzmann distribution of an ill-conditioned quadratic action. This method is based on heat-bath thermalization along a set of conjugate directions, generated via a conjugate-gradient procedure. The resulting scheme outperforms local updates for matrices with very high condition number, since it avoids the slowing down of modes with lower eigenvalue, and has some advantages over the global heat-bath approach, compared to which it is more stable and allows for more freedom in devising case-specific optimizations.

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.

Necessary and sufficient conditions for the existence of a conjugate gradient method

International Nuclear Information System (INIS)

Faber, V.; Manteuffel, T.

1984-01-01

The authors characterize the class CG(s) of matrices A for which the linear system Ax = b can be solved by an s-term conjugate gradient method. The authors show that, except for a few anomalies, the class CG(s) consists of matrices A for which conjugate gradient methods are already known. These matrices are the Hermitian matrices, A* = A, and the matrices of the form A = e/sup i theta/(dI + B), with B* = -B. 7 references

A new smoothing modified three-term conjugate gradient method for [Formula: see text]-norm minimization problem.

Science.gov (United States)

Du, Shouqiang; Chen, Miao

2018-01-01

We consider a kind of nonsmooth optimization problems with [Formula: see text]-norm minimization, which has many applications in compressed sensing, signal reconstruction, and the related engineering problems. Using smoothing approximate techniques, this kind of nonsmooth optimization problem can be transformed into a general unconstrained optimization problem, which can be solved by the proposed smoothing modified three-term conjugate gradient method. The smoothing modified three-term conjugate gradient method is based on Polak-Ribière-Polyak conjugate gradient method. For the Polak-Ribière-Polyak conjugate gradient method has good numerical properties, the proposed method possesses the sufficient descent property without any line searches, and it is also proved to be globally convergent. Finally, the numerical experiments show the efficiency of the proposed method.

Conjugate gradient minimisation approach to generating holographic traps for ultracold atoms.

Science.gov (United States)

Harte, Tiffany; Bruce, Graham D; Keeling, Jonathan; Cassettari, Donatella

2014-11-03

Direct minimisation of a cost function can in principle provide a versatile and highly controllable route to computational hologram generation. Here we show that the careful design of cost functions, combined with numerically efficient conjugate gradient minimisation, establishes a practical method for the generation of holograms for a wide range of target light distributions. This results in a guided optimisation process, with a crucial advantage illustrated by the ability to circumvent optical vortex formation during hologram calculation. We demonstrate the implementation of the conjugate gradient method for both discrete and continuous intensity distributions and discuss its applicability to optical trapping of ultracold atoms.

Moving force identification based on modified preconditioned conjugate gradient method

Science.gov (United States)

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.

Use of the preconditioned conjugate gradient algorithm as a generic solver for mixed-model equations in animal breeding applications.

Science.gov (United States)

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

A complete implementation of the conjugate gradient algorithm on a reconfigurable supercomputer

International Nuclear Information System (INIS)

Dubois, David H.; Dubois, Andrew J.; Connor, Carolyn M.; Boorman, Thomas M.; Poole, Stephen W.

2008-01-01

The conjugate gradient is a prominent iterative method for solving systems of sparse linear equations. Large-scale scientific applications often utilize a conjugate gradient solver at their computational core. In this paper we present a field programmable gate array (FPGA) based implementation of a double precision, non-preconditioned, conjugate gradient solver for fmite-element or finite-difference methods. OUf work utilizes the SRC Computers, Inc. MAPStation hardware platform along with the 'Carte' software programming environment to ease the programming workload when working with the hybrid (CPUIFPGA) environment. The implementation is designed to handle large sparse matrices of up to order N x N where N <= 116,394, with up to 7 non-zero, 64-bit elements per sparse row. This implementation utilizes an optimized sparse matrix-vector multiply operation which is critical for obtaining high performance. Direct parallel implementations of loop unrolling and loop fusion are utilized to extract performance from the various vector/matrix operations. Rather than utilize the FPGA devices as function off-load accelerators, our implementation uses the FPGAs to implement the core conjugate gradient algorithm. Measured run-time performance data is presented comparing the FPGA implementation to a software-only version showing that the FPGA can outperform processors running up to 30x the clock rate. In conclusion we take a look at the new SRC-7 system and estimate the performance of this algorithm on that architecture.

HIRFL-SSC trim coil currents calculation by conjugate gradients method

International Nuclear Information System (INIS)

Liu, W.

2005-01-01

For accelerating different kinds of ions to various energies, the HIRFL-SSC should form the corresponding isochronous magnetic field by its main coil and trim coils. Previously, there were errors in fitting the theoretical isochronous magnetic field in the small radius region, which led to some operation difficulties for ion acceleration in the inject region. After further investigation of the restrictive condition of the maximum current limitation, the trim coil currents for fitting the theoretical isochronous magnetic field were recalculated by the conjugate gradients method. Better results were obtained in the operation of HIRFL-SSC. This article introduces the procedure to calculate the trim coil currents. The calculation method of conjugate gradients is introduced and the fitting error is analysed. (author)

Application of conjugate gradient method to Commix-1B three-dimensional momentum equation

International Nuclear Information System (INIS)

King, J.B.; Domanus, H.

1987-01-01

Conjugate gradient method which is a special case of the variational method was implemented in the momentum section of the COMMIX-1B thermal hydraulics code. The comparisons between this method and the conventional iterative method of Successive Over Relation (S.O.R.) were made. Using COMMIX-1B, three steady state problems were analyzed. These problems were flow distribution in a scaled model of the Clinch River Fast Breeder Reactor outlet plenum, flow of coolant in the cold leg and downcomer of a PWR and isothermal air flow through a partially blocked pipe. It was found that if the conjugate gradient method is used, the execution time required to solve the resulting COMMIX-1B system of equations can be reduced by a factor of about 2 for the first two problems. For the isothermal air flow problem, the conjugate gradient method did not improve the execution time

Accurate conjugate gradient methods for families of shifted systems

NARCIS (Netherlands)

Eshof, J. van den; Sleijpen, G.L.G.

We present an efficient and accurate variant of the conjugate gradient method for solving families of shifted systems. In particular we are interested in shifted systems that occur in Tikhonov regularization for inverse problems since these problems can be sensitive to roundoff errors. The

Subspace Barzilai-Borwein Gradient Method for Large-Scale Bound Constrained Optimization

International Nuclear Information System (INIS)

Xiao Yunhai; Hu Qingjie

2008-01-01

An active set subspace Barzilai-Borwein gradient algorithm for large-scale bound constrained optimization is proposed. The active sets are estimated by an identification technique. The search direction consists of two parts: some of the components are simply defined; the other components are determined by the Barzilai-Borwein gradient method. In this work, a nonmonotone line search strategy that guarantees global convergence is used. Preliminary numerical results show that the proposed method is promising, and competitive with the well-known method SPG on a subset of bound constrained problems from CUTEr collection

Implementing the conjugate gradient algorithm on multi-core systems

NARCIS (Netherlands)

Wiggers, W.A.; Bakker, Vincent; Kokkeler, Andre B.J.; Smit, Gerardus Johannes Maria; Nurmi, J.; Takala, J.; Vainio, O.

2007-01-01

In linear solvers, like the conjugate gradient algorithm, sparse-matrix vector multiplication is an important kernel. Due to the sparseness of the matrices, the solver runs relatively slow. For digital optical tomography (DOT), a large set of linear equations have to be solved which currently takes

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

Fast optimal wavefront reconstruction for multi-conjugate adaptive optics using the Fourier domain preconditioned conjugate gradient algorithm.

Science.gov (United States)

Vogel, Curtis R; Yang, Qiang

2006-08-21

We present two different implementations of the Fourier domain preconditioned conjugate gradient algorithm (FD-PCG) to efficiently solve the large structured linear systems that arise in optimal volume turbulence estimation, or tomography, for multi-conjugate adaptive optics (MCAO). We describe how to deal with several critical technical issues, including the cone coordinate transformation problem and sensor subaperture grid spacing. We also extend the FD-PCG approach to handle the deformable mirror fitting problem for MCAO.

Conjugate gradient determination of optimal plane changes for a class of three-impulse transfers between noncoplanar circular orbits

Science.gov (United States)

Burrows, R. R.

1972-01-01

A particular type of three-impulse transfer between two circular orbits is analyzed. The possibility of three plane changes is recognized, and the problem is to optimally distribute these plane changes to minimize the sum of the individual impulses. Numerical difficulties and their solution are discussed. Numerical results obtained from a conjugate gradient technique are presented for both the case where the individual plane changes are unconstrained and for the case where they are constrained. Possibly not unexpectedly, multiple minima are found. The techniques presented could be extended to the finite burn case, but primarily the contents are addressed to preliminary mission design and vehicle sizing.

Conjugate gradient optimization programs for shuttle reentry

Science.gov (United States)

Powers, W. F.; Jacobson, R. A.; Leonard, D. A.

1972-01-01

Two computer programs for shuttle reentry trajectory optimization are listed and described. Both programs use the conjugate gradient method as the optimization procedure. The Phase 1 Program is developed in cartesian coordinates for a rotating spherical earth, and crossrange, downrange, maximum deceleration, total heating, and terminal speed, altitude, and flight path angle are included in the performance index. The programs make extensive use of subroutines so that they may be easily adapted to other atmospheric trajectory optimization problems.

Solving large test-day models by iteration on data and preconditioned conjugate gradient.

Science.gov (United States)

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.

Efficient two-level preconditionined conjugate gradient method on the GPU

NARCIS (Netherlands)

Gupta, R.; Van Gijzen, M.B.; Vuik, K.

2011-01-01

We present an implementation of Two-Level Preconditioned Conjugate Gradient Method for the GPU. We investigate a Truncated Neumann Series based preconditioner in combination with deflation and compare it with Block Incomplete Cholesky schemes. This combination exhibits fine-grain parallelism and

PET regularization by envelope guided conjugate gradients

International Nuclear Information System (INIS)

Kaufman, L.; Neumaier, A.

1996-01-01

The authors propose a new way to iteratively solve large scale ill-posed problems and in particular the image reconstruction problem in positron emission tomography by exploiting the relation between Tikhonov regularization and multiobjective optimization to obtain iteratively approximations to the Tikhonov L-curve and its corner. Monitoring the change of the approximate L-curves allows us to adjust the regularization parameter adaptively during a preconditioned conjugate gradient iteration, so that the desired solution can be reconstructed with a small number of iterations

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models.

Science.gov (United States)

Yuan, Gonglin; Duan, Xiabin; Liu, Wenjie; Wang, Xiaoliang; Cui, Zengru; Sheng, Zhou

2015-01-01

Two new PRP conjugate Algorithms are proposed in this paper based on two modified PRP conjugate gradient methods: the first algorithm is proposed for solving unconstrained optimization problems, and the second algorithm is proposed for solving nonlinear equations. The first method contains two aspects of information: function value and gradient value. The two methods both possess some good properties, as follows: 1) βk ≥ 0 2) the search direction has the trust region property without the use of any line search method 3) the search direction has sufficient descent property without the use of any line search method. Under some suitable conditions, we establish the global convergence of the two algorithms. We conduct numerical experiments to evaluate our algorithms. The numerical results indicate that the first algorithm is effective and competitive for solving unconstrained optimization problems and that the second algorithm is effective for solving large-scale nonlinear equations.

Solving large mixed linear models using preconditioned conjugate gradient iteration.

Science.gov (United States)

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.

Conjugate gradient based projection - A new explicit methodology for frictional contact

Science.gov (United States)

Tamma, Kumar K.; Li, Maocheng; Sha, Desong

1993-01-01

With special attention towards the applicability to parallel computation or vectorization, a new and effective explicit approach for linear complementary formulations involving a conjugate gradient based projection methodology is proposed in this study for contact problems with Coulomb friction. The overall objectives are focussed towards providing an explicit methodology of computation for the complete contact problem with friction. In this regard, the primary idea for solving the linear complementary formulations stems from an established search direction which is projected to a feasible region determined by the non-negative constraint condition; this direction is then applied to the Fletcher-Reeves conjugate gradient method resulting in a powerful explicit methodology which possesses high accuracy, excellent convergence characteristics, fast computational speed and is relatively simple to implement for contact problems involving Coulomb friction.

Conjugate gradient type methods for linear systems with complex symmetric coefficient matrices

Science.gov (United States)

Freund, Roland

1989-01-01

We consider conjugate gradient type methods for the solution of large sparse linear system Ax equals b with complex symmetric coefficient matrices A equals A(T). Such linear systems arise in important applications, such as the numerical solution of the complex Helmholtz equation. Furthermore, most complex non-Hermitian linear systems which occur in practice are actually complex symmetric. We investigate conjugate gradient type iterations which are based on a variant of the nonsymmetric Lanczos algorithm for complex symmetric matrices. We propose a new approach with iterates defined by a quasi-minimal residual property. The resulting algorithm presents several advantages over the standard biconjugate gradient method. We also include some remarks on the obvious approach to general complex linear systems by solving equivalent real linear systems for the real and imaginary parts of x. Finally, numerical experiments for linear systems arising from the complex Helmholtz equation are reported.

SAGRAD: A Program for Neural Network Training with Simulated Annealing and the Conjugate Gradient Method.

Science.gov (United States)

Bernal, Javier; Torres-Jimenez, Jose

2015-01-01

SAGRAD (Simulated Annealing GRADient), a Fortran 77 program for computing neural networks for classification using batch learning, is discussed. Neural network training in SAGRAD is based on a combination of simulated annealing and Møller's scaled conjugate gradient algorithm, the latter a variation of the traditional conjugate gradient method, better suited for the nonquadratic nature of neural networks. Different aspects of the implementation of the training process in SAGRAD are discussed, such as the efficient computation of gradients and multiplication of vectors by Hessian matrices that are required by Møller's algorithm; the (re)initialization of weights with simulated annealing required to (re)start Møller's algorithm the first time and each time thereafter that it shows insufficient progress in reaching a possibly local minimum; and the use of simulated annealing when Møller's algorithm, after possibly making considerable progress, becomes stuck at a local minimum or flat area of weight space. Outlines of the scaled conjugate gradient algorithm, the simulated annealing procedure and the training process used in SAGRAD are presented together with results from running SAGRAD on two examples of training data.

Myocardial perfusion magnetic resonance imaging using sliding-window conjugate-gradient highly constrained back-projection reconstruction for detection of coronary artery disease.

Science.gov (United States)

Ma, Heng; Yang, Jun; Liu, Jing; Ge, Lan; An, Jing; Tang, Qing; Li, Han; Zhang, Yu; Chen, David; Wang, Yong; Liu, Jiabin; Liang, Zhigang; Lin, Kai; Jin, Lixin; Bi, Xiaoming; Li, Kuncheng; Li, Debiao

2012-04-15

Myocardial perfusion magnetic resonance imaging (MRI) with sliding-window conjugate-gradient highly constrained back-projection reconstruction (SW-CG-HYPR) allows whole left ventricular coverage, improved temporal and spatial resolution and signal/noise ratio, and reduced cardiac motion-related image artifacts. The accuracy of this technique for detecting coronary artery disease (CAD) has not been determined in a large number of patients. We prospectively evaluated the diagnostic performance of myocardial perfusion MRI with SW-CG-HYPR in patients with suspected CAD. A total of 50 consecutive patients who were scheduled for coronary angiography with suspected CAD underwent myocardial perfusion MRI with SW-CG-HYPR at 3.0 T. The perfusion defects were interpreted qualitatively by 2 blinded observers and were correlated with x-ray angiographic stenoses ≥50%. The prevalence of CAD was 56%. In the per-patient analysis, the sensitivity, specificity, positive predictive value, negative predictive value, and accuracy of SW-CG-HYPR was 96% (95% confidence interval 82% to 100%), 82% (95% confidence interval 60% to 95%), 87% (95% confidence interval 70% to 96%), 95% (95% confidence interval 74% to100%), and 90% (95% confidence interval 82% to 98%), respectively. In the per-vessel analysis, the corresponding values were 98% (95% confidence interval 91% to 100%), 89% (95% confidence interval 80% to 94%), 86% (95% confidence interval 76% to 93%), 99% (95% confidence interval 93% to 100%), and 93% (95% confidence interval 89% to 97%), respectively. In conclusion, myocardial perfusion MRI using SW-CG-HYPR allows whole left ventricular coverage and high resolution and has high diagnostic accuracy in patients with suspected CAD. Copyright © 2012 Elsevier Inc. All rights reserved.

Deflation in preconditioned conjugate gradient methods for Finite Element Problems

NARCIS (Netherlands)

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

The Lanczos and Conjugate Gradient Algorithms in Finite Precision Arithmetic

Czech Academy of Sciences Publication Activity Database

Meurant, G.; Strakoš, Zdeněk

2006-01-01

Roč. 15, - (2006), s. 471-542 ISSN 0962-4929 R&D Projects: GA AV ČR 1ET400300415 Institutional research plan: CEZ:AV0Z10300504 Keywords : Lanczos method * conjugate gradient method * finite precision arithmetic * numerical stability * iterative methods Subject RIV: BA - General Mathematics

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models.

Directory of Open Access Journals (Sweden)

Gonglin Yuan

Full Text Available Two new PRP conjugate Algorithms are proposed in this paper based on two modified PRP conjugate gradient methods: the first algorithm is proposed for solving unconstrained optimization problems, and the second algorithm is proposed for solving nonlinear equations. The first method contains two aspects of information: function value and gradient value. The two methods both possess some good properties, as follows: 1 βk ≥ 0 2 the search direction has the trust region property without the use of any line search method 3 the search direction has sufficient descent property without the use of any line search method. Under some suitable conditions, we establish the global convergence of the two algorithms. We conduct numerical experiments to evaluate our algorithms. The numerical results indicate that the first algorithm is effective and competitive for solving unconstrained optimization problems and that the second algorithm is effective for solving large-scale nonlinear equations.

A partitioned conjugate gradient algorithm for lattice Green functions

International Nuclear Information System (INIS)

Bowler, K.C.; Kenway, R.D.; Pawley, G.S.; Wallace, D.J.

1984-01-01

Partitioning reduces by one the dimensionality of the lattice on which a propagator need be calculated using, for example, the conjugate gradient algorithm. Thus the quark propagator in lattice QCD may be determined by a computation on a single spatial hyperplane. For free fermions on a 16 3 x N lattice 2N-bit accuracy in the propagator is required to avoid rounding errors. (orig.)

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

New generalized conjugate gradient methods for the non-quadratic model in unconstrained optimization

International Nuclear Information System (INIS)

Al-Bayati, A.

2001-01-01

This paper present two new conjugate gradient algorithms which use the non-quadratic model in unconstrained optimization. The first is a new generalized self-scaling variable metric algorithm based on the sloboda generalized conjugate gradient method which is invariant to a nonlinear scaling of a stricity convex quadratic function; the second is an interleaving between the generalized sloboda method and the first algorithm; all these algorithm use exact line searches. Numerical comparisons over twenty test functions show that the interleaving algorithm is best overall and requires only about half the function evaluations of the Sloboda method: interleaving algorithms are likely to be preferred when the dimensionality of the problem is increased. (author). 29 refs., 1 tab

MILC staggered conjugate gradient performance on Intel KNL

OpenAIRE

DeTar, Carleton; Doerfler, Douglas; Gottlieb, Steven; Jha, Ashish; Kalamkar, Dhiraj; Li, Ruizi; Toussaint, Doug

2016-01-01

We review our work done to optimize the staggered conjugate gradient (CG) algorithm in the MILC code for use with the Intel Knights Landing (KNL) architecture. KNL is the second gener- ation Intel Xeon Phi processor. It is capable of massive thread parallelism, data parallelism, and high on-board memory bandwidth and is being adopted in supercomputing centers for scientific research. The CG solver consumes the majority of time in production running, so we have spent most of our effort on it. ...

Computing several eigenpairs of Hermitian problems by conjugate gradient iterations

International Nuclear Information System (INIS)

Ovtchinnikov, E.E.

2008-01-01

The paper is concerned with algorithms for computing several extreme eigenpairs of Hermitian problems based on the conjugate gradient method. We analyse computational strategies employed by various algorithms of this kind reported in the literature and identify their limitations. Our criticism is illustrated by numerical tests on a set of problems from electronic structure calculations and acoustics

An M-step preconditioned conjugate gradient method for parallel computation

Science.gov (United States)

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.

Conjugate-Gradient Neural Networks in Classification of Multisource and Very-High-Dimensional Remote Sensing Data

Science.gov (United States)

Benediktsson, J. A.; Swain, P. H.; Ersoy, O. K.

1993-01-01

Application of neural networks to classification of remote sensing data is discussed. Conventional two-layer backpropagation is found to give good results in classification of remote sensing data but is not efficient in training. A more efficient variant, based on conjugate-gradient optimization, is used for classification of multisource remote sensing and geographic data and very-high-dimensional data. The conjugate-gradient neural networks give excellent performance in classification of multisource data, but do not compare as well with statistical methods in classification of very-high-dimentional data.

Global Convergence of a Spectral Conjugate Gradient Method for Unconstrained Optimization

Directory of Open Access Journals (Sweden)

Jinkui Liu

2012-01-01

Full Text Available A new nonlinear spectral conjugate descent method for solving unconstrained optimization problems is proposed on the basis of the CD method and the spectral conjugate gradient method. For any line search, the new method satisfies the sufficient descent condition gkTdk<−∥gk∥2. Moreover, we prove that the new method is globally convergent under the strong Wolfe line search. The numerical results show that the new method is more effective for the given test problems from the CUTE test problem library (Bongartz et al., 1995 in contrast to the famous CD method, FR method, and PRP method.

Two-level preconditioned conjugate gradient methods with applications to bubbly flow problems

NARCIS (Netherlands)

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

Realization of preconditioned Lanczos and conjugate gradient algorithms on optical linear algebra processors.

Science.gov (United States)

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.

Gadolinium burnable absorber optimization by the method of conjugate gradients

International Nuclear Information System (INIS)

Drumm, C.R.; Lee, J.C.

1987-01-01

The optimal axial distribution of gadolinium burnable poison in a pressurized water reactor is determined to yield an improved power distribution. The optimization scheme is based on Pontryagin's maximum principle, with the objective function accounting for a target power distribution. The conjugate gradients optimization method is used to solve the resulting Euler-Lagrange equations iteratively, efficiently handling the high degree of nonlinearity of the problem

Iterative solution of the inverse Cauchy problem for an elliptic equation by the conjugate gradient method

Science.gov (United States)

Vasil'ev, V. I.; Kardashevsky, A. M.; Popov, V. V.; Prokopev, G. A.

2017-10-01

This article presents results of computational experiment carried out using a finite-difference method for solving the inverse Cauchy problem for a two-dimensional elliptic equation. The computational algorithm involves an iterative determination of the missing boundary condition from the override condition using the conjugate gradient method. The results of calculations are carried out on the examples with exact solutions as well as at specifying an additional condition with random errors are presented. Results showed a high efficiency of the iterative method of conjugate gradients for numerical solution

Extension of Modified Polak-Ribière-Polyak Conjugate Gradient Method to Linear Equality Constraints Minimization Problems

Directory of Open Access Journals (Sweden)

Zhifeng Dai

2014-01-01

Full Text Available Combining the Rosen gradient projection method with the two-term Polak-Ribière-Polyak (PRP conjugate gradient method, we propose a two-term Polak-Ribière-Polyak (PRP conjugate gradient projection method for solving linear equality constraints optimization problems. The proposed method possesses some attractive properties: (1 search direction generated by the proposed method is a feasible descent direction; consequently the generated iterates are feasible points; (2 the sequences of function are decreasing. Under some mild conditions, we show that it is globally convergent with Armijio-type line search. Preliminary numerical results show that the proposed method is promising.

Numerical Simulation of Solid Combustion with a Robust Conjugate-Gradient Solution for Pressure

National Research Council Canada - National Science Library

Wang, Yi-Zun

2002-01-01

A Bi-Conjugate Gradient method (Bi-CGSTAB) is studied and tested for solid combustion in which the gas and solid phases are coupled by a set of conditions describing mass, momentum and heat transport across the interface...

Efficient method to design RF pulses for parallel excitation MRI using gridding and conjugate gradient.

Science.gov (United States)

Feng, Shuo; Ji, Jim

2014-04-01

Parallel excitation (pTx) techniques with multiple transmit channels have been widely used in high field MRI imaging to shorten the RF pulse duration and/or reduce the specific absorption rate (SAR). However, the efficiency of pulse design still needs substantial improvement for practical real-time applications. In this paper, we present a detailed description of a fast pulse design method with Fourier domain gridding and a conjugate gradient method. Simulation results of the proposed method show that the proposed method can design pTx pulses at an efficiency 10 times higher than that of the conventional conjugate-gradient based method, without reducing the accuracy of the desirable excitation patterns.

Performance comparison of a new hybrid conjugate gradient method under exact and inexact line searches

Science.gov (United States)

Ghani, N. H. A.; Mohamed, N. S.; Zull, N.; Shoid, S.; Rivaie, M.; Mamat, M.

2017-09-01

Conjugate gradient (CG) method is one of iterative techniques prominently used in solving unconstrained optimization problems due to its simplicity, low memory storage, and good convergence analysis. This paper presents a new hybrid conjugate gradient method, named NRM1 method. The method is analyzed under the exact and inexact line searches in given conditions. Theoretically, proofs show that the NRM1 method satisfies the sufficient descent condition with both line searches. The computational result indicates that NRM1 method is capable in solving the standard unconstrained optimization problems used. On the other hand, the NRM1 method performs better under inexact line search compared with exact line search.

Analysis and performance estimation of the Conjugate Gradient method on multiple GPUs

NARCIS (Netherlands)

Verschoor, M.; Jalba, A.C.

2012-01-01

The Conjugate Gradient (CG) method is a widely-used iterative method for solving linear systems described by a (sparse) matrix. The method requires a large amount of Sparse-Matrix Vector (SpMV) multiplications, vector reductions and other vector operations to be performed. We present a number of

A Globally Convergent Matrix-Free Method for Constrained Equations and Its Linear Convergence Rate

Directory of Open Access Journals (Sweden)

Min Sun

2014-01-01

Full Text Available A matrix-free method for constrained equations is proposed, which is a combination of the well-known PRP (Polak-Ribière-Polyak conjugate gradient method and the famous hyperplane projection method. The new method is not only derivative-free, but also completely matrix-free, and consequently, it can be applied to solve large-scale constrained equations. We obtain global convergence of the new method without any differentiability requirement on the constrained equations. Compared with the existing gradient methods for solving such problem, the new method possesses linear convergence rate under standard conditions, and a relax factor γ is attached in the update step to accelerate convergence. Preliminary numerical results show that it is promising in practice.

Conjugate gradient filtering of instantaneous normal modes, saddles on the energy landscape, and diffusion in liquids.

Science.gov (United States)

Chowdhary, J; Keyes, T

2002-02-01

Instantaneous normal modes (INM's) are calculated during a conjugate-gradient (CG) descent of the potential energy landscape, starting from an equilibrium configuration of a liquid or crystal. A small number (approximately equal to 4) of CG steps removes all the Im-omega modes in the crystal and leaves the liquid with diffusive Im-omega which accurately represent the self-diffusion constant D. Conjugate gradient filtering appears to be a promising method, applicable to any system, of obtaining diffusive modes and facilitating INM theory of D. The relation of the CG-step dependent INM quantities to the landscape and its saddles is discussed.

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

Mini-batch optimized full waveform inversion with geological constrained gradient filtering

Science.gov (United States)

Yang, Hui; Jia, Junxiong; Wu, Bangyu; Gao, Jinghuai

2018-05-01

High computation cost and generating solutions without geological sense have hindered the wide application of Full Waveform Inversion (FWI). Source encoding technique is a way to dramatically reduce the cost of FWI but subject to fix-spread acquisition setup requirement and slow convergence for the suppression of cross-talk. Traditionally, gradient regularization or preconditioning is applied to mitigate the ill-posedness. An isotropic smoothing filter applied on gradients generally gives non-geological inversion results, and could also introduce artifacts. In this work, we propose to address both the efficiency and ill-posedness of FWI by a geological constrained mini-batch gradient optimization method. The mini-batch gradient descent optimization is adopted to reduce the computation time by choosing a subset of entire shots for each iteration. By jointly applying the structure-oriented smoothing to the mini-batch gradient, the inversion converges faster and gives results with more geological meaning. Stylized Marmousi model is used to show the performance of the proposed method on realistic synthetic model.

Three-Dimensional Induced Polarization Parallel Inversion Using Nonlinear Conjugate Gradients Method

Directory of Open Access Journals (Sweden)

Huan Ma

2015-01-01

Full Text Available Four kinds of array of induced polarization (IP methods (surface, borehole-surface, surface-borehole, and borehole-borehole are widely used in resource exploration. However, due to the presence of large amounts of the sources, it will take much time to complete the inversion. In the paper, a new parallel algorithm is described which uses message passing interface (MPI and graphics processing unit (GPU to accelerate 3D inversion of these four methods. The forward finite differential equation is solved by ILU0 preconditioner and the conjugate gradient (CG solver. The inverse problem is solved by nonlinear conjugate gradients (NLCG iteration which is used to calculate one forward and two “pseudo-forward” modelings and update the direction, space, and model in turn. Because each source is independent in forward and “pseudo-forward” modelings, multiprocess modes are opened by calling MPI library. The iterative matrix solver within CULA is called in each process. Some tables and synthetic data examples illustrate that this parallel inversion algorithm is effective. Furthermore, we demonstrate that the joint inversion of surface and borehole data produces resistivity and chargeability results are superior to those obtained from inversions of individual surface data.

Conjugate gradient coupled with multigrid for an indefinite problem

Science.gov (United States)

Gozani, J.; Nachshon, A.; Turkel, E.

1984-01-01

An iterative algorithm for the Helmholtz equation is presented. This scheme was based on the preconditioned conjugate gradient method for the normal equations. The preconditioning is one cycle of a multigrid method for the discrete Laplacian. The smoothing algorithm is red-black Gauss-Seidel and is constructed so it is a symmetric operator. The total number of iterations needed by the algorithm is independent of h. By varying the number of grids, the number of iterations depends only weakly on k when k(3)h(2) is constant. Comparisons with a SSOR preconditioner are presented.

On the solution of the Hartree-Fock-Bogoliubov equations by the conjugate gradient method

International Nuclear Information System (INIS)

Egido, J.L.; Robledo, L.M.

1995-01-01

The conjugate gradient method is formulated in the Hilbert space for density and non-density dependent Hamiltonians. We apply it to the solution of the Hartree-Fock-Bogoliubov equations with constraints. As a numerical application we show calculations with the finite range density dependent Gogny force. The number of iterations required to reach convergence is reduced by a factor of three to four as compared with the standard gradient method. (orig.)

Compensation of spatial system response in SPECT with conjugate gradient reconstruction technique

International Nuclear Information System (INIS)

Formiconi, A.R.; Pupi, A.; Passeri, A.

1989-01-01

A procedure for determination of the system matrix in single photon emission tomography (SPECT) is described which use a conjugate gradient reconstruction technique to take into account the variable system resolution of a camera equipped with parallel-hole collimators. The procedure involves acquisition of system line spread functions (LSF) in the region occupied by the object studied. Those data are used to generate a set of weighting factors based on the assumption that the LSFs of the collimated camera are of Gaussian shape with full width at half maximum (FWHM) linearly dependent on source depth in the span of image space. Factors are stored on a disc file for subsequent use in reconstruction. Afterwards reconstruction is performed using the conjugate gradient method with the system matrix modified by incorporation of these precalculated factors to take into account variable geometrical system response. The set of weighting factors is regenerated whenever acquisition conditions are changed (collimator, radius of rotation) with an ultra high resolution (UHR) collimator 2000 weighting factors need to be calculated. (author)

The influence of deflation vectors at interfaces on the deflated conjugate gradient method

NARCIS (Netherlands)

Vermolen, F.J.; Vuik, C.

2001-01-01

We investigate the influence of the value of deflation vectors at interfaces on the rate of convergence of preconditioned conjugate gradient methods. Our set-up is a Laplace problem in two dimensions with continuous or discontinuous coeffcients that vary in several orders of magnitude. In the

Weighted graph based ordering techniques for preconditioned conjugate gradient methods

Science.gov (United States)

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.

The Modified HZ Conjugate Gradient Algorithm for Large-Scale Nonsmooth Optimization.

Science.gov (United States)

Yuan, Gonglin; Sheng, Zhou; Liu, Wenjie

2016-01-01

In this paper, the Hager and Zhang (HZ) conjugate gradient (CG) method and the modified HZ (MHZ) CG method are presented for large-scale nonsmooth convex minimization. Under some mild conditions, convergent results of the proposed methods are established. Numerical results show that the presented methods can be better efficiency for large-scale nonsmooth problems, and several problems are tested (with the maximum dimensions to 100,000 variables).

The Modified HZ Conjugate Gradient Algorithm for Large-Scale Nonsmooth Optimization.

Directory of Open Access Journals (Sweden)

Gonglin Yuan

Full Text Available In this paper, the Hager and Zhang (HZ conjugate gradient (CG method and the modified HZ (MHZ CG method are presented for large-scale nonsmooth convex minimization. Under some mild conditions, convergent results of the proposed methods are established. Numerical results show that the presented methods can be better efficiency for large-scale nonsmooth problems, and several problems are tested (with the maximum dimensions to 100,000 variables.

A family of conjugate gradient methods for large-scale nonlinear equations.

Science.gov (United States)

Feng, Dexiang; Sun, Min; Wang, Xueyong

2017-01-01

In this paper, we present a family of conjugate gradient projection methods for solving large-scale nonlinear equations. At each iteration, it needs low storage and the subproblem can be easily solved. Compared with the existing solution methods for solving the problem, its global convergence is established without the restriction of the Lipschitz continuity on the underlying mapping. Preliminary numerical results are reported to show the efficiency of the proposed method.

MILC staggered conjugate gradient performance on Intel KNL

Energy Technology Data Exchange (ETDEWEB)

Li, Ruiz [Indiana Univ., Bloomington, IN (United States). Dept. of Physics; Detar, Carleton [Univ. of Utah, Salt Lake City, UT (United States). Dept. of Physics and Astronomy; Doerfler, Douglas W. [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). National Energy Research Scientific Computing Center (NERSC); Gottlieb, Steven [Indiana Univ., Bloomington, IN (United States). Dept. of Physics; Jha, Asish [Intel Corp., Hillsboro, OR (United States). Sofware and Services Group; Kalamkar, Dhiraj [Intel Labs., Bangalore (India). Parallel Computing Lab.; Toussaint, Doug [Univ. of Arizona, Tucson, AZ (United States). Physics Dept.

2016-11-03

We review our work done to optimize the staggered conjugate gradient (CG) algorithm in the MILC code for use with the Intel Knights Landing (KNL) architecture. KNL is the second gener- ation Intel Xeon Phi processor. It is capable of massive thread parallelism, data parallelism, and high on-board memory bandwidth and is being adopted in supercomputing centers for scientific research. The CG solver consumes the majority of time in production running, so we have spent most of our effort on it. We compare performance of an MPI+OpenMP baseline version of the MILC code with a version incorporating the QPhiX staggered CG solver, for both one-node and multi-node runs.

Microbial decomposers not constrained by climate history along a Mediterranean climate gradient in southern California.

Science.gov (United States)

Baker, Nameer R; Khalili, Banafshe; Martiny, Jennifer B H; Allison, Steven D

2018-06-01

Microbial decomposers mediate the return of CO 2 to the atmosphere by producing extracellular enzymes to degrade complex plant polymers, making plant carbon available for metabolism. Determining if and how these decomposer communities are constrained in their ability to degrade plant litter is necessary for predicting how carbon cycling will be affected by future climate change. We analyzed mass loss, litter chemistry, microbial biomass, extracellular enzyme activities, and enzyme temperature sensitivities in grassland litter transplanted along a Mediterranean climate gradient in southern California. Microbial community composition was manipulated by caging litter within bags made of nylon membrane that prevent microbial immigration. To test whether grassland microbes were constrained by climate history, half of the bags were inoculated with local microbial communities native to each gradient site. We determined that temperature and precipitation likely interact to limit microbial decomposition in the extreme sites along our gradient. Despite their unique climate history, grassland microbial communities were not restricted in their ability to decompose litter under different climate conditions across the gradient, although microbial communities across our gradient may be restricted in their ability to degrade different types of litter. We did find some evidence that local microbial communities were optimized based on climate, but local microbial taxa that proliferated after inoculation into litterbags did not enhance litter decomposition. Our results suggest that microbial community composition does not constrain C-cycling rates under climate change in our system, but optimization to particular resource environments may act as more general constraints on microbial communities. © 2018 by the Ecological Society of America.

A family of conjugate gradient methods for large-scale nonlinear equations

Directory of Open Access Journals (Sweden)

Dexiang Feng

2017-09-01

Full Text Available Abstract In this paper, we present a family of conjugate gradient projection methods for solving large-scale nonlinear equations. At each iteration, it needs low storage and the subproblem can be easily solved. Compared with the existing solution methods for solving the problem, its global convergence is established without the restriction of the Lipschitz continuity on the underlying mapping. Preliminary numerical results are reported to show the efficiency of the proposed 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

Two Modified Three-Term Type Conjugate Gradient Methods and Their Global Convergence for Unconstrained Optimization

Directory of Open Access Journals (Sweden)

Zhongbo Sun

2014-01-01

Full Text Available Two modified three-term type conjugate gradient algorithms which satisfy both the descent condition and the Dai-Liao type conjugacy condition are presented for unconstrained optimization. The first algorithm is a modification of the Hager and Zhang type algorithm in such a way that the search direction is descent and satisfies Dai-Liao’s type conjugacy condition. The second simple three-term type conjugate gradient method can generate sufficient decent directions at every iteration; moreover, this property is independent of the steplength line search. Also, the algorithms could be considered as a modification of the MBFGS method, but with different zk. Under some mild conditions, the given methods are global convergence, which is independent of the Wolfe line search for general functions. The numerical experiments show that the proposed methods are very robust and efficient.

A fast, preconditioned conjugate gradient Toeplitz solver

Science.gov (United States)

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.

A nonsmooth nonlinear conjugate gradient method for interactive contact force problems

DEFF Research Database (Denmark)

Silcowitz, Morten; Abel, Sarah Maria Niebe; Erleben, Kenny

2010-01-01

of a nonlinear complementarity problem (NCP), which can be solved using an iterative splitting method, such as the projected Gauss–Seidel (PGS) method. We present a novel method for solving the NCP problem by applying a Fletcher–Reeves type nonlinear nonsmooth conjugate gradient (NNCG) type method. We analyze...... and present experimental convergence behavior and properties of the new method. Our results show that the NNCG method has at least the same convergence rate as PGS, and in many cases better....

Conjugate gradient method for phase retrieval based on the Wirtinger derivative.

Science.gov (United States)

Wei, Zhun; Chen, Wen; Qiu, Cheng-Wei; Chen, Xudong

2017-05-01

A conjugate gradient Wirtinger flow (CG-WF) algorithm for phase retrieval is proposed in this paper. It is shown that, compared with recently reported Wirtinger flow and its modified methods, the proposed CG-WF algorithm is able to dramatically accelerate the convergence rate while keeping the dominant computational cost of each iteration unchanged. We numerically illustrate the effectiveness of our method in recovering 1D Gaussian signals and 2D natural color images under both Gaussian and coded diffraction pattern models.

PRECONDITIONED CONJUGATE-GRADIENT 2 (PCG2), a computer program for solving ground-water flow equations

Science.gov (United States)

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.

Accelerating learning of neural networks with conjugate gradients for nuclear power plant applications

International Nuclear Information System (INIS)

Reifman, J.; Vitela, J.E.

1994-01-01

The method of conjugate gradients is used to expedite the learning process of feedforward multilayer artificial neural networks and to systematically update both the learning parameter and the momentum parameter at each training cycle. The mechanism for the occurrence of premature saturation of the network nodes observed with the back propagation algorithm is described, suggestions are made to eliminate this undesirable phenomenon, and the reason by which this phenomenon is precluded in the method of conjugate gradients is presented. The proposed method is compared with the standard back propagation algorithm in the training of neural networks to classify transient events in neural power plants simulated by the Midland Nuclear Power Plant Unit 2 simulator. The comparison results indicate that the rate of convergence of the proposed method is much greater than the standard back propagation, that it reduces both the number of training cycles and the CPU time, and that it is less sensitive to the choice of initial weights. The advantages of the method are more noticeable and important for problems where the network architecture consists of a large number of nodes, the training database is large, and a tight convergence criterion is desired

On conjugate gradient type methods and polynomial preconditioners for a class of complex non-Hermitian matrices

Science.gov (United States)

Freund, Roland

1988-01-01

Conjugate gradient type methods are considered for the solution of large linear systems Ax = b with complex coefficient matrices of the type A = T + i(sigma)I where T is Hermitian and sigma, a real scalar. Three different conjugate gradient type approaches with iterates defined by a minimal residual property, a Galerkin type condition, and an Euclidian error minimization, respectively, are investigated. In particular, numerically stable implementations based on the ideas behind Paige and Saunder's SYMMLQ and MINRES for real symmetric matrices are proposed. Error bounds for all three methods are derived. It is shown how the special shift structure of A can be preserved by using polynomial preconditioning. Results on the optimal choice of the polynomial preconditioner are given. Also, some numerical experiments for matrices arising from finite difference approximations to the complex Helmholtz equation are reported.

Multigrid preconditioned conjugate-gradient method for large-scale wave-front reconstruction.

Science.gov (United States)

Gilles, Luc; Vogel, Curtis R; Ellerbroek, Brent L

2002-09-01

We introduce a multigrid preconditioned conjugate-gradient (MGCG) iterative scheme for computing open-loop wave-front reconstructors for extreme adaptive optics systems. We present numerical simulations for a 17-m class telescope with n = 48756 sensor measurement grid points within the aperture, which indicate that our MGCG method has a rapid convergence rate for a wide range of subaperture average slope measurement signal-to-noise ratios. The total computational cost is of order n log n. Hence our scheme provides for fast wave-front simulation and control in large-scale adaptive optics systems.

Microbial Decomposers Not Constrained by Climate History Along a Mediterranean Climate Gradient

Science.gov (United States)

Baker, N. R.; Khalili, B.; Martiny, J. B. H.; Allison, S. D.

2017-12-01

The return of organic carbon to the atmosphere through terrestrial decomposition is mediated through the breakdown of complex organic polymers by extracellular enzymes produced by microbial decomposer communities. Determining if and how these decomposer communities are constrained in their ability to degrade plant litter is necessary for predicting how carbon cycling will be affected by future climate change. To address this question, we deployed fine-pore nylon mesh "microbial cage" litterbags containing grassland litter with and without local inoculum across five sites in southern California, spanning a gradient of 10.3-22.8° C in mean annual temperature and 100-400+ mm mean annual precipitation. Litterbags were deployed in October 2014 and collected four times over the course of 14 months. Recovered litter was assayed for mass loss, litter chemistry, microbial biomass, extracellular enzymes (Vmax and Km­), and enzyme temperature sensitivities. We hypothesized that grassland litter would decompose most rapidly in the grassland site, and that access to local microbial communities would enhance litter decomposition rates and microbial activity in the other sites along the gradient. We determined that temperature and precipitation likely interact to limit microbial decomposition in the extreme sites along our gradient. Despite their unique climate history, grassland microbes were not restricted in their ability to decompose litter under different climate conditions. Although we observed a strong correlation between bacterial biomass and mass loss across the gradient, litter that was inoculated with local microbial communities lost less mass despite having greater bacterial biomass and potentially accumulating more microbial residues. Our results suggest that microbial community composition may not constrain C-cycling rates under climate change in our system. However, there may be community constraints on decomposition if climate change alters litter chemistry, a

Program generator for the Incomplete Cholesky Conjugate Gradient (ICCG) method

International Nuclear Information System (INIS)

Kuo-Petravic, G.; Petravic, M.

1978-04-01

The Incomplete Cholesky Conjugate Gradient (ICCG) method has been found very effective for the solution of sparse systems of linear equations. Its implementation on a computer, however, requires a considerable amount of careful coding to achieve good machine efficiency. Furthermore, the resulting code is necessarily inflexible and cannot be easily adapted to different problems. We present in this paper a code generator GENIC which, given a small amount of information concerning the sparsity pattern and size of the system of equations, generates a solver package. This package, called SOLIC, is tailor made for a particular problem and can be easily incorporated into any user program

On computing quadrature-based bounds for the A-norm of the error in conjugate gradients

Czech Academy of Sciences Publication Activity Database

Meurant, G.; Tichý, Petr

2013-01-01

Roč. 62, č. 2 (2013), s. 163-191 ISSN 1017-1398 R&D Projects: GA AV ČR IAA100300802 Institutional research plan: CEZ:AV0Z10300504 Keywords : conjugate gradients * norm of the error * bounds for the error norm Subject RIV: BA - General Mathematics Impact factor: 1.005, year: 2013

On computing quadrature-based bounds for the A-norm of the error in conjugate gradients

Czech Academy of Sciences Publication Activity Database

Meurant, G.; Tichý, Petr

2013-01-01

Roč. 62, č. 2 (2013), s. 163-191 ISSN 1017-1398 R&D Projects: GA AV ČR IAA100300802 Institutional research plan: CEZ:AV0Z10300504 Keywords : conjugate gradient s * norm of the error * bounds for the error norm Subject RIV: BA - General Mathematics Impact factor: 1.005, year: 2013

A forward model and conjugate gradient inversion technique for low-frequency ultrasonic imaging.

Science.gov (United States)

van Dongen, Koen W A; Wright, William M D

2006-10-01

Emerging methods of hyperthermia cancer treatment require noninvasive temperature monitoring, and ultrasonic techniques show promise in this regard. Various tomographic algorithms are available that reconstruct sound speed or contrast profiles, which can be related to temperature distribution. The requirement of a high enough frequency for adequate spatial resolution and a low enough frequency for adequate tissue penetration is a difficult compromise. In this study, the feasibility of using low frequency ultrasound for imaging and temperature monitoring was investigated. The transient probing wave field had a bandwidth spanning the frequency range 2.5-320.5 kHz. The results from a forward model which computed the propagation and scattering of low-frequency acoustic pressure and velocity wave fields were used to compare three imaging methods formulated within the Born approximation, representing two main types of reconstruction. The first uses Fourier techniques to reconstruct sound-speed profiles from projection or Radon data based on optical ray theory, seen as an asymptotical limit for comparison. The second uses backpropagation and conjugate gradient inversion methods based on acoustical wave theory. The results show that the accuracy in localization was 2.5 mm or better when using low frequencies and the conjugate gradient inversion scheme, which could be used for temperature monitoring.

Method of T2 spectrum inversion with conjugate gradient algorithm from NMR data

International Nuclear Information System (INIS)

Li Pengju; Shi Shangming; Song Yanjie

2010-01-01

Based on the optimization techniques, the T 2 spectrum inversion method of conjugate gradient that is easy to realize non-negativity constraint of T2 spectrum is proposed. The method transforms the linear mixed-determined problem of T2 spectrum inversion into the typical optimization problem of searching the minimum of objective function by building up the objective function according to the basic idea of geophysics modeling. The optimization problem above is solved with the conjugate gradient algorithm that has quick convergence rate and quadratic termination. The method has been applied to the inversion of noise free echo train generated from artificial spectrum, artificial echo train with signal-to-noise ratio (SNR)=25 and NMR experimental data of drilling core. The comparison between the inversion results of this paper and artificial spectrum or the result of software imported in NMR laboratory shows that the method can correctly invert T 2 spectrum from artificial NMR relaxation data even though SNR=25 and that inversion T 2 spectrum with good continuity and smoothness from core NMR experimental data accords perfectly with that of laboratory software imported, and moreover,the absolute error between the NMR porosity computed from T 2 spectrum and helium (He) porosity in laboratory is 0.65%. (authors)

Aerodynamic shape optimization using preconditioned conjugate gradient methods

Science.gov (United States)

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.

Total variation superiorized conjugate gradient method for image reconstruction

Science.gov (United States)

Zibetti, Marcelo V. W.; Lin, Chuan; Herman, Gabor T.

2018-03-01

The conjugate gradient (CG) method is commonly used for the relatively-rapid solution of least squares problems. In image reconstruction, the problem can be ill-posed and also contaminated by noise; due to this, approaches such as regularization should be utilized. Total variation (TV) is a useful regularization penalty, frequently utilized in image reconstruction for generating images with sharp edges. When a non-quadratic norm is selected for regularization, as is the case for TV, then it is no longer possible to use CG. Non-linear CG is an alternative, but it does not share the efficiency that CG shows with least squares and methods such as fast iterative shrinkage-thresholding algorithms (FISTA) are preferred for problems with TV norm. A different approach to including prior information is superiorization. In this paper it is shown that the conjugate gradient method can be superiorized. Five different CG variants are proposed, including preconditioned CG. The CG methods superiorized by the total variation norm are presented and their performance in image reconstruction is demonstrated. It is illustrated that some of the proposed variants of the superiorized CG method can produce reconstructions of superior quality to those produced by FISTA and in less computational time, due to the speed of the original CG for least squares problems. In the Appendix we examine the behavior of one of the superiorized CG methods (we call it S-CG); one of its input parameters is a positive number ɛ. It is proved that, for any given ɛ that is greater than the half-squared-residual for the least squares solution, S-CG terminates in a finite number of steps with an output for which the half-squared-residual is less than or equal to ɛ. Importantly, it is also the case that the output will have a lower value of TV than what would be provided by unsuperiorized CG for the same value ɛ of the half-squared residual.

A fast pulse design for parallel excitation with gridding conjugate gradient.

Science.gov (United States)

Feng, Shuo; Ji, Jim

2013-01-01

Parallel excitation (pTx) is recognized as a crucial technique in high field MRI to address the transmit field inhomogeneity problem. However, it can be time consuming to design pTx pulses which is not desirable. In this work, we propose a pulse design with gridding conjugate gradient (CG) based on the small-tip-angle approximation. The two major time consuming matrix-vector multiplications are substituted by two operators which involves with FFT and gridding only. Simulation results have shown that the proposed method is 3 times faster than conventional method and the memory cost is reduced by 1000 times.

Penalty Algorithm Based on Conjugate Gradient Method for Solving Portfolio Management Problem

Directory of Open Access Journals (Sweden)

Wang YaLin

2009-01-01

Full Text Available A new approach was proposed to reformulate the biobjectives optimization model of portfolio management into an unconstrained minimization problem, where the objective function is a piecewise quadratic polynomial. We presented some properties of such an objective function. Then, a class of penalty algorithms based on the well-known conjugate gradient methods was developed to find the solution of portfolio management problem. By implementing the proposed algorithm to solve the real problems from the stock market in China, it was shown that this algorithm is promising.

Frequency domain optical tomography using a conjugate gradient method without line search

International Nuclear Information System (INIS)

Kim, Hyun Keol; Charette, Andre

2007-01-01

A conjugate gradient method without line search (CGMWLS) is presented. This method is used to retrieve the local maps of absorption and scattering coefficients inside the tissue-like test medium, with the synthetic data. The forward problem is solved with a discrete-ordinates finite-difference method based on the frequency domain formulation of radiative transfer equation. The inversion results demonstrate that the CGMWLS can retrieve simultaneously the spatial distributions of optical properties inside the medium within a reasonable accuracy, by reducing cross-talk between absorption and scattering coefficients

New hybrid conjugate gradient methods with the generalized Wolfe line search.

Science.gov (United States)

Xu, Xiao; Kong, Fan-Yu

2016-01-01

The conjugate gradient method was an efficient technique for solving the unconstrained optimization problem. In this paper, we made a linear combination with parameters β k of the DY method and the HS method, and putted forward the hybrid method of DY and HS. We also proposed the hybrid of FR and PRP by the same mean. Additionally, to present the two hybrid methods, we promoted the Wolfe line search respectively to compute the step size α k of the two hybrid methods. With the new Wolfe line search, the two hybrid methods had descent property and global convergence property of the two hybrid methods that can also be proved.

Conjugate-gradient preconditioning methods for shift-variant PET image reconstruction.

Science.gov (United States)

Fessler, J A; Booth, S D

1999-01-01

Gradient-based iterative methods often converge slowly for tomographic image reconstruction and image restoration problems, but can be accelerated by suitable preconditioners. Diagonal preconditioners offer some improvement in convergence rate, but do not incorporate the structure of the Hessian matrices in imaging problems. Circulant preconditioners can provide remarkable acceleration for inverse problems that are approximately shift-invariant, i.e., for those with approximately block-Toeplitz or block-circulant Hessians. However, in applications with nonuniform noise variance, such as arises from Poisson statistics in emission tomography and in quantum-limited optical imaging, the Hessian of the weighted least-squares objective function is quite shift-variant, and circulant preconditioners perform poorly. Additional shift-variance is caused by edge-preserving regularization methods based on nonquadratic penalty functions. This paper describes new preconditioners that approximate more accurately the Hessian matrices of shift-variant imaging problems. Compared to diagonal or circulant preconditioning, the new preconditioners lead to significantly faster convergence rates for the unconstrained conjugate-gradient (CG) iteration. We also propose a new efficient method for the line-search step required by CG methods. Applications to positron emission tomography (PET) illustrate the method.

Analysis of Artificial Neural Network Backpropagation Using Conjugate Gradient Fletcher Reeves In The Predicting Process

Science.gov (United States)

Wanto, Anjar; Zarlis, Muhammad; Sawaluddin; Hartama, Dedy

2017-12-01

Backpropagation is a good artificial neural network algorithm used to predict, one of which is to predict the rate of Consumer Price Index (CPI) based on the foodstuff sector. While conjugate gradient fletcher reeves is a suitable optimization method when juxtaposed with backpropagation method, because this method can shorten iteration without reducing the quality of training and testing result. Consumer Price Index (CPI) data that will be predicted to come from the Central Statistics Agency (BPS) Pematangsiantar. The results of this study will be expected to contribute to the government in making policies to improve economic growth. In this study, the data obtained will be processed by conducting training and testing with artificial neural network backpropagation by using parameter learning rate 0,01 and target error minimum that is 0.001-0,09. The training network is built with binary and bipolar sigmoid activation functions. After the results with backpropagation are obtained, it will then be optimized using the conjugate gradient fletcher reeves method by conducting the same training and testing based on 5 predefined network architectures. The result, the method used can increase the speed and accuracy result.

Modifications of Steepest Descent Method and Conjugate Gradient Method Against Noise for Ill-posed Linear Systems

Directory of Open Access Journals (Sweden)

Chein-Shan Liu

2012-04-01

Full Text Available It is well known that the numerical algorithms of the steepest descent method (SDM, and the conjugate gradient method (CGM are effective for solving well-posed linear systems. However, they are vulnerable to noisy disturbance for solving ill-posed linear systems. We propose the modifications of SDM and CGM, namely the modified steepest descent method (MSDM, and the modified conjugate gradient method (MCGM. The starting point is an invariant manifold defined in terms of a minimum functional and a fictitious time-like variable; however, in the final stage we can derive a purely iterative algorithm including an acceleration parameter. Through the Hopf bifurcation, this parameter indeed plays a major role to switch the situation of slow convergence to a new situation that the functional is stepwisely decreased very fast. Several numerical examples are examined and compared with exact solutions, revealing that the new algorithms of MSDM and MCGM have good computational efficiency and accuracy, even for the highly ill-conditioned linear equations system with a large noise being imposed on the given data.

Efficient spectral computation of the stationary states of rotating Bose-Einstein condensates by preconditioned nonlinear conjugate gradient methods

Science.gov (United States)

Antoine, Xavier; Levitt, Antoine; Tang, Qinglin

2017-08-01

We propose a preconditioned nonlinear conjugate gradient method coupled with a spectral spatial discretization scheme for computing the ground states (GS) of rotating Bose-Einstein condensates (BEC), modeled by the Gross-Pitaevskii Equation (GPE). We first start by reviewing the classical gradient flow (also known as imaginary time (IMT)) method which considers the problem from the PDE standpoint, leading to numerically solve a dissipative equation. Based on this IMT equation, we analyze the forward Euler (FE), Crank-Nicolson (CN) and the classical backward Euler (BE) schemes for linear problems and recognize classical power iterations, allowing us to derive convergence rates. By considering the alternative point of view of minimization problems, we propose the preconditioned steepest descent (PSD) and conjugate gradient (PCG) methods for the GS computation of the GPE. We investigate the choice of the preconditioner, which plays a key role in the acceleration of the convergence process. The performance of the new algorithms is tested in 1D, 2D and 3D. We conclude that the PCG method outperforms all the previous methods, most particularly for 2D and 3D fast rotating BECs, while being simple to implement.

Multi-color incomplete Cholesky conjugate gradient methods for vector computers. Ph.D. Thesis

Science.gov (United States)

Poole, E. L.

1986-01-01

In this research, we are concerned with the solution on vector computers of linear systems of equations, Ax = b, where A is a larger, sparse symmetric positive definite matrix. We solve the system using an iterative method, the incomplete Cholesky conjugate gradient method (ICCG). We apply a multi-color strategy to obtain p-color matrices for which a block-oriented ICCG method is implemented on the CYBER 205. (A p-colored matrix is a matrix which can be partitioned into a pXp block matrix where the diagonal blocks are diagonal matrices). This algorithm, which is based on a no-fill strategy, achieves O(N/p) length vector operations in both the decomposition of A and in the forward and back solves necessary at each iteration of the method. We discuss the natural ordering of the unknowns as an ordering that minimizes the number of diagonals in the matrix and define multi-color orderings in terms of disjoint sets of the unknowns. We give necessary and sufficient conditions to determine which multi-color orderings of the unknowns correpond to p-color matrices. A performance model is given which is used both to predict execution time for ICCG methods and also to compare an ICCG method to conjugate gradient without preconditioning or another ICCG method. Results are given from runs on the CYBER 205 at NASA's Langley Research Center for four model problems.

Conjugate-gradient optimization method for orbital-free density functional calculations.

Science.gov (United States)

Jiang, Hong; Yang, Weitao

2004-08-01

Orbital-free density functional theory as an extension of traditional Thomas-Fermi theory has attracted a lot of interest in the past decade because of developments in both more accurate kinetic energy functionals and highly efficient numerical methodology. In this paper, we developed a conjugate-gradient method for the numerical solution of spin-dependent extended Thomas-Fermi equation by incorporating techniques previously used in Kohn-Sham calculations. The key ingredient of the method is an approximate line-search scheme and a collective treatment of two spin densities in the case of spin-dependent extended Thomas-Fermi problem. Test calculations for a quartic two-dimensional quantum dot system and a three-dimensional sodium cluster Na216 with a local pseudopotential demonstrate that the method is accurate and efficient. (c) 2004 American Institute of Physics.

Microwave imaging of dielectric cylinder using level set method and conjugate gradient algorithm

International Nuclear Information System (INIS)

Grayaa, K.; Bouzidi, A.; Aguili, T.

2011-01-01

In this paper, we propose a computational method for microwave imaging cylinder and dielectric object, based on combining level set technique and the conjugate gradient algorithm. By measuring the scattered field, we tried to retrieve the shape, localisation and the permittivity of the object. The forward problem is solved by the moment method, while the inverse problem is reformulate in an optimization one and is solved by the proposed scheme. It found that the proposed method is able to give good reconstruction quality in terms of the reconstructed shape and permittivity.

Generalized conjugate-gradient methods for the Navier-Stokes equations

Science.gov (United States)

Ajmani, Kumud; Ng, Wing-Fai; Liou, Meng-Sing

1991-01-01

A generalized conjugate-gradient method is used to solve the two-dimensional, compressible Navier-Stokes equations of fluid flow. The equations are discretized with an implicit, upwind finite-volume formulation. Preconditioning techniques are incorporated into the new solver to accelerate convergence of the overall iterative method. The superiority of the new solver is demonstrated by comparisons with a conventional line Gauss-Siedel Relaxation solver. Computational test results for transonic flow (trailing edge flow in a transonic turbine cascade) and hypersonic flow (M = 6.0 shock-on-shock phenoena on a cylindrical leading edge) are presented. When applied to the transonic cascade case, the new solver is 4.4 times faster in terms of number of iterations and 3.1 times faster in terms of CPU time than the Relaxation solver. For the hypersonic shock case, the new solver is 3.0 times faster in terms of number of iterations and 2.2 times faster in terms of CPU time than the Relaxation solver.

A new nonlinear conjugate gradient coefficient under strong Wolfe-Powell line search

Science.gov (United States)

Mohamed, Nur Syarafina; Mamat, Mustafa; Rivaie, Mohd

2017-08-01

A nonlinear conjugate gradient method (CG) plays an important role in solving a large-scale unconstrained optimization problem. This method is widely used due to its simplicity. The method is known to possess sufficient descend condition and global convergence properties. In this paper, a new nonlinear of CG coefficient βk is presented by employing the Strong Wolfe-Powell inexact line search. The new βk performance is tested based on number of iterations and central processing unit (CPU) time by using MATLAB software with Intel Core i7-3470 CPU processor. Numerical experimental results show that the new βk converge rapidly compared to other classical CG method.

Steepest descent with momentum for quadratic functions is a version of the conjugate gradient method.

Science.gov (United States)

Bhaya, Amit; Kaszkurewicz, Eugenius

2004-01-01

It is pointed out that the so called momentum method, much used in the neural network literature as an acceleration of the backpropagation method, is a stationary version of the conjugate gradient method. Connections with the continuous optimization method known as heavy ball with friction are also made. In both cases, adaptive (dynamic) choices of the so called learning rate and momentum parameters are obtained using a control Liapunov function analysis of the system.

Experimental study of stochastic noise propagation in SPECT images reconstructed using the conjugate gradient algorithm.

Science.gov (United States)

Mariano-Goulart, D; Fourcade, M; Bernon, J L; Rossi, M; Zanca, M

2003-01-01

Thanks to an experimental study based on simulated and physical phantoms, the propagation of the stochastic noise in slices reconstructed using the conjugate gradient algorithm has been analysed versus iterations. After a first increase corresponding to the reconstruction of the signal, the noise stabilises before increasing linearly with iterations. The level of the plateau as well as the slope of the subsequent linear increase depends on the noise in the projection data.

Improved Conjugate Gradient Bundle Adjustment of Dunhuang Wall Painting Images

Science.gov (United States)

Hu, K.; Huang, X.; You, H.

2017-09-01

Bundle adjustment with additional parameters is identified as a critical step for precise orthoimage generation and 3D reconstruction of Dunhuang wall paintings. Due to the introduction of self-calibration parameters and quasi-planar constraints, the structure of coefficient matrix of the reduced normal equation is banded-bordered, making the solving process of bundle adjustment complex. In this paper, Conjugate Gradient Bundle Adjustment (CGBA) method is deduced by calculus of variations. A preconditioning method based on improved incomplete Cholesky factorization is adopt to reduce the condition number of coefficient matrix, as well as to accelerate the iteration rate of CGBA. Both theoretical analysis and experimental results comparison with conventional method indicate that, the proposed method can effectively conquer the ill-conditioned problem of normal equation and improve the calculation efficiency of bundle adjustment with additional parameters considerably, while maintaining the actual accuracy.

Large Airborne Full Tensor Gradient Data Inversion Based on a Non-Monotone Gradient Method

Science.gov (United States)

Sun, Yong; Meng, Zhaohai; Li, Fengting

2018-03-01

Following the development of gravity gradiometer instrument technology, the full tensor gravity (FTG) data can be acquired on airborne and marine platforms. Large-scale geophysical data can be obtained using these methods, making such data sets a number of the "big data" category. Therefore, a fast and effective inversion method is developed to solve the large-scale FTG data inversion problem. Many algorithms are available to accelerate the FTG data inversion, such as conjugate gradient method. However, the conventional conjugate gradient method takes a long time to complete data processing. Thus, a fast and effective iterative algorithm is necessary to improve the utilization of FTG data. Generally, inversion processing is formulated by incorporating regularizing constraints, followed by the introduction of a non-monotone gradient-descent method to accelerate the convergence rate of FTG data inversion. Compared with the conventional gradient method, the steepest descent gradient algorithm, and the conjugate gradient algorithm, there are clear advantages of the non-monotone iterative gradient-descent algorithm. Simulated and field FTG data were applied to show the application value of this new fast inversion method.

Identification techniques for phenomenological models of hysteresis based on the conjugate gradient method

International Nuclear Information System (INIS)

Andrei, Petru; Oniciuc, Liviu; Stancu, Alexandru; Stoleriu, Laurentiu

2007-01-01

An identification technique for the parameters of phenomenological models of hysteresis is presented. The basic idea of our technique is to set up a system of equations for the parameters of the model as a function of known quantities on the major or minor hysteresis loops (e.g. coercive force, susceptibilities at various points, remanence), or other magnetization curves. This system of equations can be either over or underspecified and is solved by using the conjugate gradient method. Numerical results related to the identification of parameters in the Energetic, Jiles-Atherton, and Preisach models are presented

TV-based conjugate gradient method and discrete L-curve for few-view CT reconstruction of X-ray in vivo data.

Science.gov (United States)

Yang, Xiaoli; Hofmann, Ralf; Dapp, Robin; van de Kamp, Thomas; dos Santos Rolo, Tomy; Xiao, Xianghui; Moosmann, Julian; Kashef, Jubin; Stotzka, Rainer

2015-03-09

High-resolution, three-dimensional (3D) imaging of soft tissues requires the solution of two inverse problems: phase retrieval and the reconstruction of the 3D image from a tomographic stack of two-dimensional (2D) projections. The number of projections per stack should be small to accommodate fast tomography of rapid processes and to constrain X-ray radiation dose to optimal levels to either increase the duration of in vivo time-lapse series at a given goal for spatial resolution and/or the conservation of structure under X-ray irradiation. In pursuing the 3D reconstruction problem in the sense of compressive sampling theory, we propose to reduce the number of projections by applying an advanced algebraic technique subject to the minimisation of the total variation (TV) in the reconstructed slice. This problem is formulated in a Lagrangian multiplier fashion with the parameter value determined by appealing to a discrete L-curve in conjunction with a conjugate gradient method. The usefulness of this reconstruction modality is demonstrated for simulated and in vivo data, the latter acquired in parallel-beam imaging experiments using synchrotron radiation.

Quality of Gaussian basis sets: direct optimization of orbital exponents by the method of conjugate gradients

International Nuclear Information System (INIS)

Kari, R.E.; Mezey, P.G.; Csizmadia, I.G.

1975-01-01

Expressions are given for calculating the energy gradient vector in the exponent space of Gaussian basis sets and a technique to optimize orbital exponents using the method of conjugate gradients is described. The method is tested on the (9/sups/5/supp/) Gaussian basis space and optimum exponents are determined for the carbon atom. The analysis of the results shows that the calculated one-electron properties converge more slowly to their optimum values than the total energy converges to its optimum value. In addition, basis sets approximating the optimum total energy very well can still be markedly improved for the prediction of one-electron properties. For smaller basis sets, this improvement does not warrant the necessary expense

A Framework for Generalized Conjugate Gradient Methods - with Special Emphasis on Contributions by Rüdiger Weiss

Czech Academy of Sciences Publication Activity Database

Gutknecht, M. H.; Rozložník, Miroslav

2002-01-01

Roč. 41, - (2002), s. 7-22 ISSN 0168-9274 R&D Projects: GA AV ČR IAA1030103; GA ČR GA101/00/1035 Institutional research plan: AV0Z1030915 Keywords : sparse linear systems * Krylov space method * orthogonal residual method * minimal residual method * conjugate gradient method * residual smoothing * CG * CGNE * CGNR * CR * FOM * GMRES * PRES Subject RIV: BA - General Mathematics Impact factor: 0.504, year: 2002

A new family of Polak-Ribiere-Polyak conjugate gradient method with the strong-Wolfe line search

Science.gov (United States)

Ghani, Nur Hamizah Abdul; Mamat, Mustafa; Rivaie, Mohd

2017-08-01

Conjugate gradient (CG) method is an important technique in unconstrained optimization, due to its effectiveness and low memory requirements. The focus of this paper is to introduce a new CG method for solving large scale unconstrained optimization. Theoretical proofs show that the new method fulfills sufficient descent condition if strong Wolfe-Powell inexact line search is used. Besides, computational results show that our proposed method outperforms to other existing CG methods.

A conjugate gradient method with descent properties under strong Wolfe line search

Science.gov (United States)

Zull, N.; ‘Aini, N.; Shoid, S.; Ghani, N. H. A.; Mohamed, N. S.; Rivaie, M.; Mamat, M.

2017-09-01

The conjugate gradient (CG) method is one of the optimization methods that are often used in practical applications. The continuous and numerous studies conducted on the CG method have led to vast improvements in its convergence properties and efficiency. In this paper, a new CG method possessing the sufficient descent and global convergence properties is proposed. The efficiency of the new CG algorithm relative to the existing CG methods is evaluated by testing them all on a set of test functions using MATLAB. The tests are measured in terms of iteration numbers and CPU time under strong Wolfe line search. Overall, this new method performs efficiently and comparable to the other famous methods.

IMPROVED CONJUGATE GRADIENT BUNDLE ADJUSTMENT OF DUNHUANG WALL PAINTING IMAGES

Directory of Open Access Journals (Sweden)

K. Hu

2017-09-01

Full Text Available Bundle adjustment with additional parameters is identified as a critical step for precise orthoimage generation and 3D reconstruction of Dunhuang wall paintings. Due to the introduction of self-calibration parameters and quasi-planar constraints, the structure of coefficient matrix of the reduced normal equation is banded-bordered, making the solving process of bundle adjustment complex. In this paper, Conjugate Gradient Bundle Adjustment (CGBA method is deduced by calculus of variations. A preconditioning method based on improved incomplete Cholesky factorization is adopt to reduce the condition number of coefficient matrix, as well as to accelerate the iteration rate of CGBA. Both theoretical analysis and experimental results comparison with conventional method indicate that, the proposed method can effectively conquer the ill-conditioned problem of normal equation and improve the calculation efficiency of bundle adjustment with additional parameters considerably, while maintaining the actual accuracy.

Reconstruction for limited-projection fluorescence molecular tomography based on projected restarted conjugate gradient normal residual.

Science.gov (United States)

Cao, Xu; Zhang, Bin; Liu, Fei; Wang, Xin; Bai, Jing

2011-12-01

Limited-projection fluorescence molecular tomography (FMT) can greatly reduce the acquisition time, which is suitable for resolving fast biology processes in vivo but suffers from severe ill-posedness because of the reconstruction using only limited projections. To overcome the severe ill-posedness, we report a reconstruction method based on the projected restarted conjugate gradient normal residual. The reconstruction results of two phantom experiments demonstrate that the proposed method is feasible for limited-projection FMT. © 2011 Optical Society of America

On Error Estimation in the Conjugate Gradient Method and why it Works in Finite Precision Computations

Czech Academy of Sciences Publication Activity Database

Strakoš, Zdeněk; Tichý, Petr

2002-01-01

Roč. 13, - (2002), s. 56-80 ISSN 1068-9613 R&D Projects: GA ČR GA201/02/0595 Institutional research plan: AV0Z1030915 Keywords : conjugate gradient method * Gauss kvadrature * evaluation of convergence * error bounds * finite precision arithmetic * rounding errors * loss of orthogonality Subject RIV: BA - General Mathematics Impact factor: 0.565, year: 2002 http://etna.mcs.kent.edu/volumes/2001-2010/vol13/abstract.php?vol=13&pages=56-80

A Conjugate Gradient Algorithm with Function Value Information and N-Step Quadratic Convergence for Unconstrained Optimization.

Directory of Open Access Journals (Sweden)

Xiangrong Li

Full Text Available It is generally acknowledged that the conjugate gradient (CG method achieves global convergence--with at most a linear convergence rate--because CG formulas are generated by linear approximations of the objective functions. The quadratically convergent results are very limited. We introduce a new PRP method in which the restart strategy is also used. Moreover, the method we developed includes not only n-step quadratic convergence but also both the function value information and gradient value information. In this paper, we will show that the new PRP method (with either the Armijo line search or the Wolfe line search is both linearly and quadratically convergent. The numerical experiments demonstrate that the new PRP algorithm is competitive with the normal CG method.

A Conjugate Gradient Algorithm with Function Value Information and N-Step Quadratic Convergence for Unconstrained Optimization.

Science.gov (United States)

Li, Xiangrong; Zhao, Xupei; Duan, Xiabin; Wang, Xiaoliang

2015-01-01

It is generally acknowledged that the conjugate gradient (CG) method achieves global convergence--with at most a linear convergence rate--because CG formulas are generated by linear approximations of the objective functions. The quadratically convergent results are very limited. We introduce a new PRP method in which the restart strategy is also used. Moreover, the method we developed includes not only n-step quadratic convergence but also both the function value information and gradient value information. In this paper, we will show that the new PRP method (with either the Armijo line search or the Wolfe line search) is both linearly and quadratically convergent. The numerical experiments demonstrate that the new PRP algorithm is competitive with the normal CG method.

Preconditioned conjugate gradient technique for the analysis of symmetric anisotropic structures

Science.gov (United States)

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.

Block-triangular preconditioners for PDE-constrained optimization

KAUST Repository

Rees, Tyrone

2010-11-26

In this paper we investigate the possibility of using a block-triangular preconditioner for saddle point problems arising in PDE-constrained optimization. In particular, we focus on a conjugate gradient-type method introduced by Bramble and Pasciak that uses self-adjointness of the preconditioned system in a non-standard inner product. We show when the Chebyshev semi-iteration is used as a preconditioner for the relevant matrix blocks involving the finite element mass matrix that the main drawback of the Bramble-Pasciak method-the appropriate scaling of the preconditioners-is easily overcome. We present an eigenvalue analysis for the block-triangular preconditioners that gives convergence bounds in the non-standard inner product and illustrates their competitiveness on a number of computed examples. Copyright © 2010 John Wiley & Sons, Ltd.

Block-triangular preconditioners for PDE-constrained optimization

KAUST Repository

Rees, Tyrone; Stoll, Martin

2010-01-01

In this paper we investigate the possibility of using a block-triangular preconditioner for saddle point problems arising in PDE-constrained optimization. In particular, we focus on a conjugate gradient-type method introduced by Bramble and Pasciak that uses self-adjointness of the preconditioned system in a non-standard inner product. We show when the Chebyshev semi-iteration is used as a preconditioner for the relevant matrix blocks involving the finite element mass matrix that the main drawback of the Bramble-Pasciak method-the appropriate scaling of the preconditioners-is easily overcome. We present an eigenvalue analysis for the block-triangular preconditioners that gives convergence bounds in the non-standard inner product and illustrates their competitiveness on a number of computed examples. Copyright © 2010 John Wiley & Sons, Ltd.

A conjugate gradients/trust regions algorithms for training multilayer perceptrons for nonlinear mapping

Science.gov (United States)

Madyastha, Raghavendra K.; Aazhang, Behnaam; Henson, Troy F.; Huxhold, Wendy L.

1992-01-01

This paper addresses the issue of applying a globally convergent optimization algorithm to the training of multilayer perceptrons, a class of Artificial Neural Networks. The multilayer perceptrons are trained towards the solution of two highly nonlinear problems: (1) signal detection in a multi-user communication network, and (2) solving the inverse kinematics for a robotic manipulator. The research is motivated by the fact that a multilayer perceptron is theoretically capable of approximating any nonlinear function to within a specified accuracy. The algorithm that has been employed in this study combines the merits of two well known optimization algorithms, the Conjugate Gradients and the Trust Regions Algorithms. The performance is compared to a widely used algorithm, the Backpropagation Algorithm, that is basically a gradient-based algorithm, and hence, slow in converging. The performances of the two algorithms are compared with the convergence rate. Furthermore, in the case of the signal detection problem, performances are also benchmarked by the decision boundaries drawn as well as the probability of error obtained in either case.

Identity of the conjugate gradient and Lanczos algorithms for matrix inversion in lattice fermion calculations

International Nuclear Information System (INIS)

Burkitt, A.N.; Irving, A.C.

1988-01-01

Two of the methods that are widely used in lattice gauge theory calculations requiring inversion of the fermion matrix are the Lanczos and the conjugate gradient algorithms. Those algorithms are already known to be closely related. In fact for matrix inversion, in exact arithmetic, they give identical results at each iteration and are just alternative formulations of a single algorithm. This equivalence survives rounding errors. We give the identities between the coefficients of the two formulations, enabling many of the best features of them to be combined. (orig.)

Inversion of the fermion matrix and the equivalence of the conjugate gradient and Lanczos algorithms

International Nuclear Information System (INIS)

Burkitt, A.N.; Irving, A.C.

1990-01-01

The Lanczos and conjugate gradient algorithms are widely used in lattice QCD calculations. The previously known close relationship between the two methods is explored and two commonly used implementations are shown to give identically the same results at each iteration, in exact arithmetic, for matrix inversion. The identities between the coefficients of the two algorithms are given, and many of the features of the two algorithms can now be combined. The effects of finite arithmetic are investigated and the particular Lanczos formulation is found to be most stable with respect to rounding errors. (orig.)

A conjugate gradient method for solving the non-LTE line radiation transfer problem

Science.gov (United States)

Paletou, F.; Anterrieu, E.

2009-12-01

This study concerns the fast and accurate solution of the line radiation transfer problem, under non-LTE conditions. We propose and evaluate an alternative iterative scheme to the classical ALI-Jacobi method, and to the more recently proposed Gauss-Seidel and successive over-relaxation (GS/SOR) schemes. Our study is indeed based on applying a preconditioned bi-conjugate gradient method (BiCG-P). Standard tests, in 1D plane parallel geometry and in the frame of the two-level atom model with monochromatic scattering are discussed. Rates of convergence between the previously mentioned iterative schemes are compared, as are their respective timing properties. The smoothing capability of the BiCG-P method is also demonstrated.

TV-based conjugate gradient method and discrete L-curve for few-view CT reconstruction of X-ray in vivo data

International Nuclear Information System (INIS)

Yang, Xiaoli; Hofmann, Ralf; Dapp, Robin; Van de Kamp, Thomas; Rolo, Tomy dos Santos; Xiao, Xianghui; Moosmann, Julian; Kashef, Jubin; Stotzka, Rainer

2015-01-01

High-resolution, three-dimensional (3D) imaging of soft tissues requires the solution of two inverse problems: phase retrieval and the reconstruction of the 3D image from a tomographic stack of two-dimensional (2D) projections. The number of projections per stack should be small to accommodate fast tomography of rapid processes and to constrain X-ray radiation dose to optimal levels to either increase the duration o fin vivo time-lapse series at a given goal for spatial resolution and/or the conservation of structure under X-ray irradiation. In pursuing the 3D reconstruction problem in the sense of compressive sampling theory, we propose to reduce the number of projections by applying an advanced algebraic technique subject to the minimisation of the total variation (TV) in the reconstructed slice. This problem is formulated in a Lagrangian multiplier fashion with the parameter value determined by appealing to a discrete L-curve in conjunction with a conjugate gradient method. The usefulness of this reconstruction modality is demonstrated for simulated and in vivo data, the latter acquired in parallel-beam imaging experiments using synchrotron radiation

Pixel-based OPC optimization based on conjugate gradients.

Science.gov (United States)

Ma, Xu; Arce, Gonzalo R

2011-01-31

Optical proximity correction (OPC) methods are resolution enhancement techniques (RET) used extensively in the semiconductor industry to improve the resolution and pattern fidelity of optical lithography. In pixel-based OPC (PBOPC), the mask is divided into small pixels, each of which is modified during the optimization process. Two critical issues in PBOPC are the required computational complexity of the optimization process, and the manufacturability of the optimized mask. Most current OPC optimization methods apply the steepest descent (SD) algorithm to improve image fidelity augmented by regularization penalties to reduce the complexity of the mask. Although simple to implement, the SD algorithm converges slowly. The existing regularization penalties, however, fall short in meeting the mask rule check (MRC) requirements often used in semiconductor manufacturing. This paper focuses on developing OPC optimization algorithms based on the conjugate gradient (CG) method which exhibits much faster convergence than the SD algorithm. The imaging formation process is represented by the Fourier series expansion model which approximates the partially coherent system as a sum of coherent systems. In order to obtain more desirable manufacturability properties of the mask pattern, a MRC penalty is proposed to enlarge the linear size of the sub-resolution assistant features (SRAFs), as well as the distances between the SRAFs and the main body of the mask. Finally, a projection method is developed to further reduce the complexity of the optimized mask pattern.

The application of projected conjugate gradient solvers on graphical processing units

International Nuclear Information System (INIS)

Lin, Youzuo; Renaut, Rosemary

2011-01-01

Graphical processing units introduce the capability for large scale computation at the desktop. Presented numerical results verify that efficiencies and accuracies of basic linear algebra subroutines of all levels when implemented in CUDA and Jacket are comparable. But experimental results demonstrate that the basic linear algebra subroutines of level three offer the greatest potential for improving efficiency of basic numerical algorithms. We consider the solution of the multiple right hand side set of linear equations using Krylov subspace-based solvers. Thus, for the multiple right hand side case, it is more efficient to make use of a block implementation of the conjugate gradient algorithm, rather than to solve each system independently. Jacket is used for the implementation. Furthermore, including projection from one system to another improves efficiency. A relevant example, for which simulated results are provided, is the reconstruction of a three dimensional medical image volume acquired from a positron emission tomography scanner. Efficiency of the reconstruction is improved by using projection across nearby slices.

The application of projected conjugate gradient solvers on graphical processing units

Energy Technology Data Exchange (ETDEWEB)

Lin, Youzuo [Los Alamos National Laboratory; Renaut, Rosemary [ARIZONA STATE UNIV.

2011-01-26

Graphical processing units introduce the capability for large scale computation at the desktop. Presented numerical results verify that efficiencies and accuracies of basic linear algebra subroutines of all levels when implemented in CUDA and Jacket are comparable. But experimental results demonstrate that the basic linear algebra subroutines of level three offer the greatest potential for improving efficiency of basic numerical algorithms. We consider the solution of the multiple right hand side set of linear equations using Krylov subspace-based solvers. Thus, for the multiple right hand side case, it is more efficient to make use of a block implementation of the conjugate gradient algorithm, rather than to solve each system independently. Jacket is used for the implementation. Furthermore, including projection from one system to another improves efficiency. A relevant example, for which simulated results are provided, is the reconstruction of a three dimensional medical image volume acquired from a positron emission tomography scanner. Efficiency of the reconstruction is improved by using projection across nearby slices.

Adjustment technique without explicit formation of normal equations /conjugate gradient method/

Science.gov (United States)

Saxena, N. K.

1974-01-01

For a simultaneous adjustment of a large geodetic triangulation system, a semiiterative technique is modified and used successfully. In this semiiterative technique, known as the conjugate gradient (CG) method, original observation equations are used, and thus the explicit formation of normal equations is avoided, 'huge' computer storage space being saved in the case of triangulation systems. This method is suitable even for very poorly conditioned systems where solution is obtained only after more iterations. A detailed study of the CG method for its application to large geodetic triangulation systems was done that also considered constraint equations with observation equations. It was programmed and tested on systems as small as two unknowns and three equations up to those as large as 804 unknowns and 1397 equations. When real data (573 unknowns, 965 equations) from a 1858-km-long triangulation system were used, a solution vector accurate to four decimal places was obtained in 2.96 min after 1171 iterations (i.e., 2.0 times the number of unknowns).

Parallel Conjugate Gradient: Effects of Ordering Strategies, Programming Paradigms, and Architectural Platforms

Science.gov (United States)

Oliker, Leonid; Heber, Gerd; Biswas, Rupak

2000-01-01

The Conjugate Gradient (CG) algorithm is perhaps the best-known iterative technique to solve sparse linear systems that are symmetric and positive definite. A sparse matrix-vector multiply (SPMV) usually accounts for most of the floating-point operations within a CG iteration. In this paper, we investigate the effects of various ordering and partitioning strategies on the performance of parallel CG and SPMV using different programming paradigms and architectures. Results show that for this class of applications, ordering significantly improves overall performance, that cache reuse may be more important than reducing communication, and that it is possible to achieve message passing performance using shared memory constructs through careful data ordering and distribution. However, a multi-threaded implementation of CG on the Tera MTA does not require special ordering or partitioning to obtain high efficiency and scalability.

Acceleration of monte Carlo solution by conjugate gradient method

International Nuclear Information System (INIS)

Toshihisa, Yamamoto

2005-01-01

The conjugate gradient method (CG) was applied to accelerate Monte Carlo solutions in fixed source problems. The equilibrium model based formulation enables to use CG scheme as well as initial guess to maximize computational performance. This method is available to arbitrary geometry provided that the neutron source distribution in each subregion can be regarded as flat. Even if it is not the case, the method can still be used as a powerful tool to provide an initial guess very close to the converged solution. The major difference of Monte Carlo CG to deterministic CG is that residual error is estimated using Monte Carlo sampling, thus statistical error exists in the residual. This leads to a flow diagram specific to Monte Carlo-CG. Three pre-conditioners were proposed for CG scheme and the performance was compared with a simple 1-D slab heterogeneous test problem. One of them, Sparse-M option, showed an excellent performance in convergence. The performance per unit cost was improved by four times in the test problem. Although direct estimation of efficiency of the method is impossible mainly because of the strong problem-dependence of the optimized pre-conditioner in CG, the method seems to have efficient potential as a fast solution algorithm for Monte Carlo calculations. (author)

An Efficient Hybrid Conjugate Gradient Method with the Strong Wolfe-Powell Line Search

Directory of Open Access Journals (Sweden)

Ahmad Alhawarat

2015-01-01

Full Text Available Conjugate gradient (CG method is an interesting tool to solve optimization problems in many fields, such as design, economics, physics, and engineering. In this paper, we depict a new hybrid of CG method which relates to the famous Polak-Ribière-Polyak (PRP formula. It reveals a solution for the PRP case which is not globally convergent with the strong Wolfe-Powell (SWP line search. The new formula possesses the sufficient descent condition and the global convergent properties. In addition, we further explained about the cases where PRP method failed with SWP line search. Furthermore, we provide numerical computations for the new hybrid CG method which is almost better than other related PRP formulas in both the number of iterations and the CPU time under some standard test functions.

Fully 3D PET image reconstruction using a fourier preconditioned conjugate-gradient algorithm

International Nuclear Information System (INIS)

Fessler, J.A.; Ficaro, E.P.

1996-01-01

Since the data sizes in fully 3D PET imaging are very large, iterative image reconstruction algorithms must converge in very few iterations to be useful. One can improve the convergence rate of the conjugate-gradient (CG) algorithm by incorporating preconditioning operators that approximate the inverse of the Hessian of the objective function. If the 3D cylindrical PET geometry were not truncated at the ends, then the Hessian of the penalized least-squares objective function would be approximately shift-invariant, i.e. G'G would be nearly block-circulant, where G is the system matrix. We propose a Fourier preconditioner based on this shift-invariant approximation to the Hessian. Results show that this preconditioner significantly accelerates the convergence of the CG algorithm with only a small increase in computation

Geometrical optics analysis of the structural imperfection of retroreflection corner cubes with a nonlinear conjugate gradient method.

Science.gov (United States)

Kim, Hwi; Min, Sung-Wook; Lee, Byoungho

2008-12-01

Geometrical optics analysis of the structural imperfection of retroreflection corner cubes is described. In the analysis, a geometrical optics model of six-beam reflection patterns generated by an imperfect retroreflection corner cube is developed, and its structural error extraction is formulated as a nonlinear optimization problem. The nonlinear conjugate gradient method is employed for solving the nonlinear optimization problem, and its detailed implementation is described. The proposed method of analysis is a mathematical basis for the nondestructive optical inspection of imperfectly fabricated retroreflection corner cubes.

Efficient L1 regularization-based reconstruction for fluorescent molecular tomography using restarted nonlinear conjugate gradient.

Science.gov (United States)

Shi, Junwei; Zhang, Bin; Liu, Fei; Luo, Jianwen; Bai, Jing

2013-09-15

For the ill-posed fluorescent molecular tomography (FMT) inverse problem, the L1 regularization can protect the high-frequency information like edges while effectively reduce the image noise. However, the state-of-the-art L1 regularization-based algorithms for FMT reconstruction are expensive in memory, especially for large-scale problems. An efficient L1 regularization-based reconstruction algorithm based on nonlinear conjugate gradient with restarted strategy is proposed to increase the computational speed with low memory consumption. The reconstruction results from phantom experiments demonstrate that the proposed algorithm can obtain high spatial resolution and high signal-to-noise ratio, as well as high localization accuracy for fluorescence targets.

The truncated conjugate gradient (TCG), a non-iterative/fixed-cost strategy for computing polarization in molecular dynamics: Fast evaluation of analytical forces

Science.gov (United States)

Aviat, Félix; Lagardère, Louis; Piquemal, Jean-Philip

2017-10-01

In a recent paper [F. Aviat et al., J. Chem. Theory Comput. 13, 180-190 (2017)], we proposed the Truncated Conjugate Gradient (TCG) approach to compute the polarization energy and forces in polarizable molecular simulations. The method consists in truncating the conjugate gradient algorithm at a fixed predetermined order leading to a fixed computational cost and can thus be considered "non-iterative." This gives the possibility to derive analytical forces avoiding the usual energy conservation (i.e., drifts) issues occurring with iterative approaches. A key point concerns the evaluation of the analytical gradients, which is more complex than that with a usual solver. In this paper, after reviewing the present state of the art of polarization solvers, we detail a viable strategy for the efficient implementation of the TCG calculation. The complete cost of the approach is then measured as it is tested using a multi-time step scheme and compared to timings using usual iterative approaches. We show that the TCG methods are more efficient than traditional techniques, making it a method of choice for future long molecular dynamics simulations using polarizable force fields where energy conservation matters. We detail the various steps required for the implementation of the complete method by software developers.

JAC, 2-D Finite Element Method Program for Quasi Static Mechanics Problems by Nonlinear Conjugate Gradient (CG) Method

International Nuclear Information System (INIS)

Biffle, J.H.

1991-01-01

1 - Description of program or function: JAC is a two-dimensional finite element program for solving large deformation, temperature dependent, quasi-static mechanics problems with the nonlinear conjugate gradient (CG) technique. Either plane strain or axisymmetric geometry may be used with material descriptions which include temperature dependent elastic-plastic, temperature dependent secondary creep, and isothermal soil models. The nonlinear effects examined include material and geometric nonlinearities due to large rotations, large strains, and surface which slide relative to one another. JAC is vectorized to perform efficiently on the Cray1 computer. A restart capability is included. 2 - Method of solution: The nonlinear conjugate gradient method is employed in a two-dimensional plane strain or axisymmetric setting with various techniques for accelerating convergence. Sliding interface conditions are also implemented. A four-node Lagrangian uniform strain element is used with orthogonal hourglass viscosity to control the zero energy modes. Three sets of continuum equations are needed - kinematic statements, constitutive equations, and equations of equilibrium - to describe the deformed configuration of the body. 3 - Restrictions on the complexity of the problem - Maxima of: 10 load and solution control functions, 4 materials. The strain rate is assumed constant over a time interval. Current large rotation theory is applicable to a maximum shear strain of 1.0. JAC should be used with caution for large shear strains. Problem size is limited only by available memory

Conjugate gradient and cross-correlation based least-square reverse time migration and its application

Science.gov (United States)

Sun, Xiao-Dong; Ge, Zhong-Hui; Li, Zhen-Chun

2017-09-01

Although conventional reverse time migration can be perfectly applied to structural imaging it lacks the capability of enabling detailed delineation of a lithological reservoir due to irregular illumination. To obtain reliable reflectivity of the subsurface it is necessary to solve the imaging problem using inversion. The least-square reverse time migration (LSRTM) (also known as linearized reflectivity inversion) aims to obtain relatively high-resolution amplitude preserving imaging by including the inverse of the Hessian matrix. In practice, the conjugate gradient algorithm is proven to be an efficient iterative method for enabling use of LSRTM. The velocity gradient can be derived from a cross-correlation between observed data and simulated data, making LSRTM independent of wavelet signature and thus more robust in practice. Tests on synthetic and marine data show that LSRTM has good potential for use in reservoir description and four-dimensional (4D) seismic images compared to traditional RTM and Fourier finite difference (FFD) migration. This paper investigates the first order approximation of LSRTM, which is also known as the linear Born approximation. However, for more complex geological structures a higher order approximation should be considered to improve imaging quality.

A modified three-term PRP conjugate gradient algorithm for optimization models.

Science.gov (United States)

Wu, Yanlin

2017-01-01

The nonlinear conjugate gradient (CG) algorithm is a very effective method for optimization, especially for large-scale problems, because of its low memory requirement and simplicity. Zhang et al. (IMA J. Numer. Anal. 26:629-649, 2006) firstly propose a three-term CG algorithm based on the well known Polak-Ribière-Polyak (PRP) formula for unconstrained optimization, where their method has the sufficient descent property without any line search technique. They proved the global convergence of the Armijo line search but this fails for the Wolfe line search technique. Inspired by their method, we will make a further study and give a modified three-term PRP CG algorithm. The presented method possesses the following features: (1) The sufficient descent property also holds without any line search technique; (2) the trust region property of the search direction is automatically satisfied; (3) the steplengh is bounded from below; (4) the global convergence will be established under the Wolfe line search. Numerical results show that the new algorithm is more effective than that of the normal method.

Missing value imputation in DNA microarrays based on conjugate gradient method.

Science.gov (United States)

Dorri, Fatemeh; Azmi, Paeiz; Dorri, Faezeh

2012-02-01

Analysis of gene expression profiles needs a complete matrix of gene array values; consequently, imputation methods have been suggested. In this paper, an algorithm that is based on conjugate gradient (CG) method is proposed to estimate missing values. k-nearest neighbors of the missed entry are first selected based on absolute values of their Pearson correlation coefficient. Then a subset of genes among the k-nearest neighbors is labeled as the best similar ones. CG algorithm with this subset as its input is then used to estimate the missing values. Our proposed CG based algorithm (CGimpute) is evaluated on different data sets. The results are compared with sequential local least squares (SLLSimpute), Bayesian principle component analysis (BPCAimpute), local least squares imputation (LLSimpute), iterated local least squares imputation (ILLSimpute) and adaptive k-nearest neighbors imputation (KNNKimpute) methods. The average of normalized root mean squares error (NRMSE) and relative NRMSE in different data sets with various missing rates shows CGimpute outperforms other methods. Copyright © 2011 Elsevier Ltd. All rights reserved.

Truncated Conjugate Gradient: An Optimal Strategy for the Analytical Evaluation of the Many-Body Polarization Energy and Forces in Molecular Simulations.

Science.gov (United States)

Aviat, Félix; Levitt, Antoine; Stamm, Benjamin; Maday, Yvon; Ren, Pengyu; Ponder, Jay W; Lagardère, Louis; Piquemal, Jean-Philip

2017-01-10

We introduce a new class of methods, denoted as Truncated Conjugate Gradient(TCG), to solve the many-body polarization energy and its associated forces in molecular simulations (i.e. molecular dynamics (MD) and Monte Carlo). The method consists in a fixed number of Conjugate Gradient (CG) iterations. TCG approaches provide a scalable solution to the polarization problem at a user-chosen cost and a corresponding optimal accuracy. The optimality of the CG-method guarantees that the number of the required matrix-vector products are reduced to a minimum compared to other iterative methods. This family of methods is non-empirical, fully adaptive, and provides analytical gradients, avoiding therefore any energy drift in MD as compared to popular iterative solvers. Besides speed, one great advantage of this class of approximate methods is that their accuracy is systematically improvable. Indeed, as the CG-method is a Krylov subspace method, the associated error is monotonically reduced at each iteration. On top of that, two improvements can be proposed at virtually no cost: (i) the use of preconditioners can be employed, which leads to the Truncated Preconditioned Conjugate Gradient (TPCG); (ii) since the residual of the final step of the CG-method is available, one additional Picard fixed point iteration ("peek"), equivalent to one step of Jacobi Over Relaxation (JOR) with relaxation parameter ω, can be made at almost no cost. This method is denoted by TCG-n(ω). Black-box adaptive methods to find good choices of ω are provided and discussed. Results show that TPCG-3(ω) is converged to high accuracy (a few kcal/mol) for various types of systems including proteins and highly charged systems at the fixed cost of four matrix-vector products: three CG iterations plus the initial CG descent direction. Alternatively, T(P)CG-2(ω) provides robust results at a reduced cost (three matrix-vector products) and offers new perspectives for long polarizable MD as a production

A new modified conjugate gradient coefficient for solving system of linear equations

Science.gov (United States)

Hajar, N.; ‘Aini, N.; Shapiee, N.; Abidin, Z. Z.; Khadijah, W.; Rivaie, M.; Mamat, M.

2017-09-01

Conjugate gradient (CG) method is an evolution of computational method in solving unconstrained optimization problems. This approach is easy to implement due to its simplicity and has been proven to be effective in solving real-life application. Although this field has received copious amount of attentions in recent years, some of the new approaches of CG algorithm cannot surpass the efficiency of the previous versions. Therefore, in this paper, a new CG coefficient which retains the sufficient descent and global convergence properties of the original CG methods is proposed. This new CG is tested on a set of test functions under exact line search. Its performance is then compared to that of some of the well-known previous CG methods based on number of iterations and CPU time. The results show that the new CG algorithm has the best efficiency amongst all the methods tested. This paper also includes an application of the new CG algorithm for solving large system of linear equations

Numerical solution to a multi-dimensional linear inverse heat conduction problem by a splitting-based conjugate gradient method

International Nuclear Information System (INIS)

Dinh Nho Hao; Nguyen Trung Thanh; Sahli, Hichem

2008-01-01

In this paper we consider a multi-dimensional inverse heat conduction problem with time-dependent coefficients in a box, which is well-known to be severely ill-posed, by a variational method. The gradient of the functional to be minimized is obtained by aids of an adjoint problem and the conjugate gradient method with a stopping rule is then applied to this ill-posed optimization problem. To enhance the stability and the accuracy of the numerical solution to the problem we apply this scheme to the discretized inverse problem rather than to the continuous one. The difficulties with large dimensions of discretized problems are overcome by a splitting method which only requires the solution of easy-to-solve one-dimensional problems. The numerical results provided by our method are very good and the techniques seem to be very promising.

Preconditioned conjugate-gradient methods for low-speed flow calculations

Science.gov (United States)

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.

Preconditioned Conjugate Gradient methods for low speed flow calculations

Science.gov (United States)

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.

Sparse reconstruction for quantitative bioluminescence tomography based on the incomplete variables truncated conjugate gradient method.

Science.gov (United States)

He, Xiaowei; Liang, Jimin; Wang, Xiaorui; Yu, Jingjing; Qu, Xiaochao; Wang, Xiaodong; Hou, Yanbin; Chen, Duofang; Liu, Fang; Tian, Jie

2010-11-22

In this paper, we present an incomplete variables truncated conjugate gradient (IVTCG) method for bioluminescence tomography (BLT). Considering the sparse characteristic of the light source and insufficient surface measurement in the BLT scenarios, we combine a sparseness-inducing (ℓ1 norm) regularization term with a quadratic error term in the IVTCG-based framework for solving the inverse problem. By limiting the number of variables updated at each iterative and combining a variable splitting strategy to find the search direction more efficiently, it obtains fast and stable source reconstruction, even without a priori information of the permissible source region and multispectral measurements. Numerical experiments on a mouse atlas validate the effectiveness of the method. In vivo mouse experimental results further indicate its potential for a practical BLT system.

A computationally efficient P_1 radiation model for modern combustion systems utilizing pre-conditioned conjugate gradient methods

International Nuclear Information System (INIS)

Krishnamoorthy, Gautham

2017-01-01

Highlights: • The P_1 radiation model was interfaced with high performance linear solvers. • Pre-conditioned conjugate gradient (PC CG) method improved convergence by 50% • PC CG was more than 30 times faster than classical iterative methods. • The time to solution scaled linearly with increase in problem size employing PC CG. • Employing WSGGM with P_1 model compared reasonably well against benchmark data. - Abstract: The iterative convergence of the P_1 radiation model can be slow in optically thin scenarios when employing classical iterative methods. In order to remedy this shortcoming, an in-house P_1 radiation model was interfaced with high performance, scalable, linear solver libraries. Next, the accuracies of P_1 radiation model calculations was assessed by comparing its predictions against discrete ordinates (DO) model calculations for prototypical problems representative of modern combustion systems. Corresponding benchmark results were also included for comparison. Utilizing Pre-Conditioners (PC) to the Conjugate Gradients (CG) method, the convergence time of the P_1 radiation model reduced by a factor of 30 for modest problem sizes and a factor of 70 for larger sized problems when compared against classical Gauss Seidel sweeps. Further, PC provided 50% computational savings compared to employing CG in a standalone mode. The P_1 model calculation times were about 25–30% of the DO model calculation time. The time to solution also scaled linearly with an increase in problem size. The weighted sum of gray gases model employed in this study in conjunction with the P_1 model provided good agreement against benchmark data with L_2 error norms (defined relative to corresponding DO calculations) improving when isotropic intensities were prevalent.

Noise effect in an improved conjugate gradient algorithm to invert particle size distribution and the algorithm amendment.

Science.gov (United States)

Wei, Yongjie; Ge, Baozhen; Wei, Yaolin

2009-03-20

In general, model-independent algorithms are sensitive to noise during laser particle size measurement. An improved conjugate gradient algorithm (ICGA) that can be used to invert particle size distribution (PSD) from diffraction data is presented. By use of the ICGA to invert simulated data with multiplicative or additive noise, we determined that additive noise is the main factor that induces distorted results. Thus the ICGA is amended by introduction of an iteration step-adjusting parameter and is used experimentally on simulated data and some samples. The experimental results show that the sensitivity of the ICGA to noise is reduced and the inverted results are in accord with the real PSD.

Conjugation of gold nanoparticles and recombinant human endostatin modulates vascular normalization via interruption of anterior gradient 2-mediated angiogenesis.

Science.gov (United States)

Pan, Fan; Yang, Wende; Li, Wei; Yang, Xiao-Yan; Liu, Shuhao; Li, Xin; Zhao, Xiaoxu; Ding, Hui; Qin, Li; Pan, Yunlong

2017-07-01

Several studies have revealed the potential of normalizing tumor vessels in anti-angiogenic treatment. Recombinant human endostatin is an anti-angiogenic agent which has been applied in clinical tumor treatment. Our previous research indicated that gold nanoparticles could be a nanoparticle carrier for recombinant human endostatin delivery. The recombinant human endostatin-gold nanoparticle conjugates normalized vessels, which improved chemotherapy. However, the mechanism of recombinant human endostatin-gold nanoparticle-induced vascular normalization has not been explored. Anterior gradient 2 has been reported to be over-expressed in many malignant tumors and involved in tumor angiogenesis. To date, the precise efficacy of recombinant human endostatin-gold nanoparticles on anterior gradient 2-mediated angiogenesis or anterior gradient 2-related signaling cohort remained unknown. In this study, we aimed to explore whether recombinant human endostatin-gold nanoparticles could normalize vessels in metastatic colorectal cancer xenografts, and we further elucidated whether recombinant human endostatin-gold nanoparticles could interrupt anterior gradient 2-induced angiogenesis. In vivo, it was indicated that recombinant human endostatin-gold nanoparticles increased pericyte expression while inhibit vascular endothelial growth factor receptor 2 and anterior gradient 2 expression in metastatic colorectal cancer xenografts. In vitro, we uncovered that recombinant human endostatin-gold nanoparticles reduced cell migration and tube formation induced by anterior gradient 2 in human umbilical vein endothelial cells. Treatment with recombinant human endostatin-gold nanoparticles attenuated anterior gradient 2-mediated activation of MMP2, cMyc, VE-cadherin, phosphorylation of p38, and extracellular signal-regulated protein kinases 1 and 2 (ERK1/2) in human umbilical vein endothelial cells. Our findings demonstrated recombinant human endostatin-gold nanoparticles might normalize

Rationally Engineering Phototherapy Modules of Eosin-Conjugated Responsive Polymeric Nanocarriers via Intracellular Endocytic pH Gradients.

Science.gov (United States)

Liu, Guhuan; Hu, Jinming; Zhang, Guoying; Liu, Shiyong

2015-07-15

Spatiotemporal switching of respective phototherapy modes at the cellular level with minimum side effects and high therapeutic efficacy is a major challenge for cancer phototherapy. Herein we demonstrate how to address this issue by employing photosensitizer-conjugated pH-responsive block copolymers in combination with intracellular endocytic pH gradients. At neutral pH corresponding to extracellular and cytosol milieu, the copolymers self-assemble into micelles with prominently quenched fluorescence emission and low (1)O2 generation capability, favoring a highly efficient photothermal module. Under mildly acidic pH associated with endolysosomes, protonation-triggered micelle-to-unimer transition results in recovered emission and enhanced photodynamic (1)O2 efficiency, which synergistically actuates release of encapsulated drugs, endosomal escape, and photochemical internalization processes.

High-fidelity phase and amplitude control of phase-only computer generated holograms using conjugate gradient minimisation.

Science.gov (United States)

Bowman, D; Harte, T L; Chardonnet, V; De Groot, C; Denny, S J; Le Goc, G; Anderson, M; Ireland, P; Cassettari, D; Bruce, G D

2017-05-15

We demonstrate simultaneous control of both the phase and amplitude of light using a conjugate gradient minimisation-based hologram calculation technique and a single phase-only spatial light modulator (SLM). A cost function, which incorporates the inner product of the light field with a chosen target field within a defined measure region, is efficiently minimised to create high fidelity patterns in the Fourier plane of the SLM. A fidelity of F = 0.999997 is achieved for a pattern resembling an LG10 mode with a calculated light-usage efficiency of 41.5%. Possible applications of our method in optical trapping and ultracold atoms are presented and we show uncorrected experimental realisation of our patterns with F = 0.97 and 7.8% light efficiency.

An efficient impedance method for induced field evaluation based on a stabilized Bi-conjugate gradient algorithm

International Nuclear Information System (INIS)

Wang Hua; Liu Feng; Crozier, Stuart; Xia Ling

2008-01-01

This paper presents a stabilized Bi-conjugate gradient algorithm (BiCGstab) that can significantly improve the performance of the impedance method, which has been widely applied to model low-frequency field induction phenomena in voxel phantoms. The improved impedance method offers remarkable computational advantages in terms of convergence performance and memory consumption over the conventional, successive over-relaxation (SOR)-based algorithm. The scheme has been validated against other numerical/analytical solutions on a lossy, multilayered sphere phantom excited by an ideal coil loop. To demonstrate the computational performance and application capability of the developed algorithm, the induced fields inside a human phantom due to a low-frequency hyperthermia device is evaluated. The simulation results show the numerical accuracy and superior performance of the method.

An efficient impedance method for induced field evaluation based on a stabilized Bi-conjugate gradient algorithm.

Science.gov (United States)

Wang, Hua; Liu, Feng; Xia, Ling; Crozier, Stuart

2008-11-21

This paper presents a stabilized Bi-conjugate gradient algorithm (BiCGstab) that can significantly improve the performance of the impedance method, which has been widely applied to model low-frequency field induction phenomena in voxel phantoms. The improved impedance method offers remarkable computational advantages in terms of convergence performance and memory consumption over the conventional, successive over-relaxation (SOR)-based algorithm. The scheme has been validated against other numerical/analytical solutions on a lossy, multilayered sphere phantom excited by an ideal coil loop. To demonstrate the computational performance and application capability of the developed algorithm, the induced fields inside a human phantom due to a low-frequency hyperthermia device is evaluated. The simulation results show the numerical accuracy and superior performance of the method.

On the Strong Convergence of a Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Method

Directory of Open Access Journals (Sweden)

Min Sun

2014-01-01

Full Text Available Recently, Zhang et al. proposed a sufficient descent Polak-Ribière-Polyak (SDPRP conjugate gradient method for large-scale unconstrained optimization problems and proved its global convergence in the sense that lim infk→∞∥∇f(xk∥=0 when an Armijo-type line search is used. In this paper, motivated by the line searches proposed by Shi et al. and Zhang et al., we propose two new Armijo-type line searches and show that the SDPRP method has strong convergence in the sense that limk→∞∥∇f(xk∥=0 under the two new line searches. Numerical results are reported to show the efficiency of the SDPRP with the new Armijo-type line searches in practical computation.

Optimization of gadolinium burnable poison loading by the conjugate gradients method

International Nuclear Information System (INIS)

Drumm, C.R.

1984-01-01

Improved use of burnable poison is suggested for pressurized water reactors (PWR's) to insure a sufficiently negative moderator temperature coefficient of reactivity for extended burnup cycles and low leakage refueling patterns. The use of gadolinium as a burnable poison can lead to large axial fluctuations in the power distribution through the cycle. The goal of this work is to determine the optimal axial distribution of gadolinium burnable poison in a PWR to overcome the axial fluctuations, yielding an improved power distribution. The conjugate gradients optimization method is used in this work because of the high degree of nonlinearity of the problem. The neutron diffusion and depletion equations are solved for a one-dimensional one-group core model. The state variables are the flux, the critical soluble boron concentration, and the burnup. The control variables are the number of gadolinium pins per assembly and the beginning-of-cycle gadolinium concentration, which determine the gadolinium cross section. Two separate objectives are considered: 1) to minimize the power peaking factor, which will minimize the capital cost of the plant; and 2) to maximize the cycle length, which will minimize the fuel cost for the plant. It is shown in this work that optimizing the gadolinium distribution can yield an improved power distribution

Fast conjugate phase image reconstruction based on a Chebyshev approximation to correct for B0 field inhomogeneity and concomitant gradients.

Science.gov (United States)

Chen, Weitian; Sica, Christopher T; Meyer, Craig H

2008-11-01

Off-resonance effects can cause image blurring in spiral scanning and various forms of image degradation in other MRI methods. Off-resonance effects can be caused by both B0 inhomogeneity and concomitant gradient fields. Previously developed off-resonance correction methods focus on the correction of a single source of off-resonance. This work introduces a computationally efficient method of correcting for B0 inhomogeneity and concomitant gradients simultaneously. The method is a fast alternative to conjugate phase reconstruction, with the off-resonance phase term approximated by Chebyshev polynomials. The proposed algorithm is well suited for semiautomatic off-resonance correction, which works well even with an inaccurate or low-resolution field map. The proposed algorithm is demonstrated using phantom and in vivo data sets acquired by spiral scanning. Semiautomatic off-resonance correction alone is shown to provide a moderate amount of correction for concomitant gradient field effects, in addition to B0 imhomogeneity effects. However, better correction is provided by the proposed combined method. The best results were produced using the semiautomatic version of the proposed combined method.

Efficient non-negative constrained model-based inversion in optoacoustic tomography

International Nuclear Information System (INIS)

Ding, Lu; Luís Deán-Ben, X; Lutzweiler, Christian; Razansky, Daniel; Ntziachristos, Vasilis

2015-01-01

The inversion accuracy in optoacoustic tomography depends on a number of parameters, including the number of detectors employed, discrete sampling issues or imperfectness of the forward model. These parameters result in ambiguities on the reconstructed image. A common ambiguity is the appearance of negative values, which have no physical meaning since optical absorption can only be higher or equal than zero. We investigate herein algorithms that impose non-negative constraints in model-based optoacoustic inversion. Several state-of-the-art non-negative constrained algorithms are analyzed. Furthermore, an algorithm based on the conjugate gradient method is introduced in this work. We are particularly interested in investigating whether positive restrictions lead to accurate solutions or drive the appearance of errors and artifacts. It is shown that the computational performance of non-negative constrained inversion is higher for the introduced algorithm than for the other algorithms, while yielding equivalent results. The experimental performance of this inversion procedure is then tested in phantoms and small animals, showing an improvement in image quality and quantitativeness with respect to the unconstrained approach. The study performed validates the use of non-negative constraints for improving image accuracy compared to unconstrained methods, while maintaining computational efficiency. (paper)

3D DC Resistivity Inversion with Topography Based on Regularized Conjugate Gradient Method

Directory of Open Access Journals (Sweden)

Jian-ke Qiang

2013-01-01

Full Text Available During the past decades, we observed a strong interest in 3D DC resistivity inversion and imaging with complex topography. In this paper, we implemented 3D DC resistivity inversion based on regularized conjugate gradient method with FEM. The Fréchet derivative is assembled with the electric potential in order to speed up the inversion process based on the reciprocity theorem. In this study, we also analyzed the sensitivity of the electric potential on the earth’s surface to the conductivity in each cell underground and introduced an optimized weighting function to produce new sensitivity matrix. The synthetic model study shows that this optimized weighting function is helpful to improve the resolution of deep anomaly. By incorporating topography into inversion, the artificial anomaly which is actually caused by topography can be eliminated. As a result, this algorithm potentially can be applied to process the DC resistivity data collected in mountain area. Our synthetic model study also shows that the convergence and computation speed are very stable and fast.

Solution to Two-Dimensional Steady Inverse Heat Transfer Problems with Interior Heat Source Based on the Conjugate Gradient Method

Directory of Open Access Journals (Sweden)

Shoubin Wang

2017-01-01

Full Text Available The compound variable inverse problem which comprises boundary temperature distribution and surface convective heat conduction coefficient of two-dimensional steady heat transfer system with inner heat source is studied in this paper applying the conjugate gradient method. The introduction of complex variable to solve the gradient matrix of the objective function obtains more precise inversion results. This paper applies boundary element method to solve the temperature calculation of discrete points in forward problems. The factors of measuring error and the number of measuring points zero error which impact the measurement result are discussed and compared with L-MM method in inverse problems. Instance calculation and analysis prove that the method applied in this paper still has good effectiveness and accuracy even if measurement error exists and the boundary measurement points’ number is reduced. The comparison indicates that the influence of error on the inversion solution can be minimized effectively using this method.

Regularized variable metric method versus the conjugate gradient method in solution of radiative boundary design problem

International Nuclear Information System (INIS)

Kowsary, F.; Pooladvand, K.; Pourshaghaghy, A.

2007-01-01

In this paper, an appropriate distribution of the heating elements' strengths in a radiation furnace is estimated using inverse methods so that a pre-specified temperature and heat flux distribution is attained on the design surface. Minimization of the sum of the squares of the error function is performed using the variable metric method (VMM), and the results are compared with those obtained by the conjugate gradient method (CGM) established previously in the literature. It is shown via test cases and a well-founded validation procedure that the VMM, when using a 'regularized' estimator, is more accurate and is able to reach at a higher quality final solution as compared to the CGM. The test cases used in this study were two-dimensional furnaces filled with an absorbing, emitting, and scattering gas

An inverse hyperbolic heat conduction problem in estimating surface heat flux by the conjugate gradient method

International Nuclear Information System (INIS)

Huang, C.-H.; Wu, H.-H.

2006-01-01

In the present study an inverse hyperbolic heat conduction problem is solved by the conjugate gradient method (CGM) in estimating the unknown boundary heat flux based on the boundary temperature measurements. Results obtained in this inverse problem will be justified based on the numerical experiments where three different heat flux distributions are to be determined. Results show that the inverse solutions can always be obtained with any arbitrary initial guesses of the boundary heat flux. Moreover, the drawbacks of the previous study for this similar inverse problem, such as (1) the inverse solution has phase error and (2) the inverse solution is sensitive to measurement error, can be avoided in the present algorithm. Finally, it is concluded that accurate boundary heat flux can be estimated in this study

Comparison of phase-constrained parallel MRI approaches: Analogies and differences.

Science.gov (United States)

Blaimer, Martin; Heim, Marius; Neumann, Daniel; Jakob, Peter M; Kannengiesser, Stephan; Breuer, Felix A

2016-03-01

Phase-constrained parallel MRI approaches have the potential for significantly improving the image quality of accelerated MRI scans. The purpose of this study was to investigate the properties of two different phase-constrained parallel MRI formulations, namely the standard phase-constrained approach and the virtual conjugate coil (VCC) concept utilizing conjugate k-space symmetry. Both formulations were combined with image-domain algorithms (SENSE) and a mathematical analysis was performed. Furthermore, the VCC concept was combined with k-space algorithms (GRAPPA and ESPIRiT) for image reconstruction. In vivo experiments were conducted to illustrate analogies and differences between the individual methods. Furthermore, a simple method of improving the signal-to-noise ratio by modifying the sampling scheme was implemented. For SENSE, the VCC concept was mathematically equivalent to the standard phase-constrained formulation and therefore yielded identical results. In conjunction with k-space algorithms, the VCC concept provided more robust results when only a limited amount of calibration data were available. Additionally, VCC-GRAPPA reconstructed images provided spatial phase information with full resolution. Although both phase-constrained parallel MRI formulations are very similar conceptually, there exist important differences between image-domain and k-space domain reconstructions regarding the calibration robustness and the availability of high-resolution phase information. © 2015 Wiley Periodicals, Inc.

Using Elman recurrent neural networks with conjugate gradient algorithm in determining the anesthetic the amount of anesthetic medicine to be applied.

Science.gov (United States)

Güntürkün, Rüştü

2010-08-01

In this study, Elman recurrent neural networks have been defined by using conjugate gradient algorithm in order to determine the depth of anesthesia in the continuation stage of the anesthesia and to estimate the amount of medicine to be applied at that moment. The feed forward neural networks are also used for comparison. The conjugate gradient algorithm is compared with back propagation (BP) for training of the neural Networks. The applied artificial neural network is composed of three layers, namely the input layer, the hidden layer and the output layer. The nonlinear activation function sigmoid (sigmoid function) has been used in the hidden layer and the output layer. EEG data has been recorded with Nihon Kohden 9200 brand 22-channel EEG device. The international 8-channel bipolar 10-20 montage system (8 TB-b system) has been used in assembling the recording electrodes. EEG data have been recorded by being sampled once in every 2 milliseconds. The artificial neural network has been designed so as to have 60 neurons in the input layer, 30 neurons in the hidden layer and 1 neuron in the output layer. The values of the power spectral density (PSD) of 10-second EEG segments which correspond to the 1-50 Hz frequency range; the ratio of the total power of PSD values of the EEG segment at that moment in the same range to the total of PSD values of EEG segment taken prior to the anesthesia.

Refined isogeometric analysis for a preconditioned conjugate gradient solver

KAUST Repository

Garcia, Daniel

2018-02-12

Starting from a highly continuous Isogeometric Analysis (IGA) discretization, refined Isogeometric Analysis (rIGA) introduces C0 hyperplanes that act as separators for the direct LU factorization solver. As a result, the total computational cost required to solve the corresponding system of equations using a direct LU factorization solver dramatically reduces (up to a factor of 55) Garcia et al. (2017). At the same time, rIGA enriches the IGA spaces, thus improving the best approximation error. In this work, we extend the complexity analysis of rIGA to the case of iterative solvers. We build an iterative solver as follows: we first construct the Schur complements using a direct solver over small subdomains (macro-elements). We then assemble those Schur complements into a global skeleton system. Subsequently, we solve this system iteratively using Conjugate Gradients (CG) with an incomplete LU (ILU) preconditioner. For a 2D Poisson model problem with a structured mesh and a uniform polynomial degree of approximation, rIGA achieves moderate savings with respect to IGA in terms of the number of Floating Point Operations (FLOPs) and computational time (in seconds) required to solve the resulting system of linear equations. For instance, for a mesh with four million elements and polynomial degree p=3, the iterative solver is approximately 2.6 times faster (in time) when applied to the rIGA system than to the IGA one. These savings occur because the skeleton rIGA system contains fewer non-zero entries than the IGA one. The opposite situation occurs for 3D problems, and as a result, 3D rIGA discretizations provide no gains with respect to their IGA counterparts when considering iterative solvers.

Inelastic scattering with Chebyshev polynomials and preconditioned conjugate gradient minimization.

Science.gov (United States)

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.

Comparison of Conjugate Gradient Density Matrix Search and Chebyshev Expansion Methods for Avoiding Diagonalization in Large-Scale Electronic Structure Calculations

Science.gov (United States)

Bates, Kevin R.; Daniels, Andrew D.; Scuseria, Gustavo E.

1998-01-01

We report a comparison of two linear-scaling methods which avoid the diagonalization bottleneck of traditional electronic structure algorithms. The Chebyshev expansion method (CEM) is implemented for carbon tight-binding calculations of large systems and its memory and timing requirements compared to those of our previously implemented conjugate gradient density matrix search (CG-DMS). Benchmark calculations are carried out on icosahedral fullerenes from C60 to C8640 and the linear scaling memory and CPU requirements of the CEM demonstrated. We show that the CPU requisites of the CEM and CG-DMS are similar for calculations with comparable accuracy.

Embedding SAS approach into conjugate gradient algorithms for asymmetric 3D elasticity problems

Energy Technology Data Exchange (ETDEWEB)

Chen, Hsin-Chu; Warsi, N.A. [Clark Atlanta Univ., GA (United States); Sameh, A. [Univ. of Minnesota, Minneapolis, MN (United States)

1996-12-31

In this paper, we present two strategies to embed the SAS (symmetric-and-antisymmetric) scheme into conjugate gradient (CG) algorithms to make solving 3D elasticity problems, with or without global reflexive symmetry, more efficient. The SAS approach is physically a domain decomposition scheme that takes advantage of reflexive symmetry of discretized physical problems, and algebraically a matrix transformation method that exploits special reflexivity properties of the matrix resulting from discretization. In addition to offering large-grain parallelism, which is valuable in a multiprocessing environment, the SAS scheme also has the potential for reducing arithmetic operations in the numerical solution of a reasonably wide class of scientific and engineering problems. This approach can be applied directly to problems that have global reflexive symmetry, yielding smaller and independent subproblems to solve, or indirectly to problems with partial symmetry, resulting in loosely coupled subproblems. The decomposition is achieved by separating the reflexive subspace from the antireflexive one, possessed by a special class of matrices A, A {element_of} C{sup n x n} that satisfy the relation A = PAP where P is a reflection matrix (symmetric signed permutation matrix).

A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix

International Nuclear Information System (INIS)

Vecharynski, Eugene; Yang, Chao; Pask, John E.

2015-01-01

We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the invariant subspace is large (e.g., over several hundreds or thousands) even though it may still be small relative to the dimension of A. These problems arise from, for example, density functional theory (DFT) based electronic structure calculations for complex materials. The key feature of our algorithm is that it performs fewer Rayleigh–Ritz calculations compared to existing algorithms such as the locally optimal block preconditioned conjugate gradient or the Davidson algorithm. It is a block algorithm, and hence can take advantage of efficient BLAS3 operations and be implemented with multiple levels of concurrency. We discuss a number of practical issues that must be addressed in order to implement the algorithm efficiently on a high performance computer

Computation of fields in an arbitrarily shaped heterogeneous dielectric or biological body by an iterative conjugate gradient method

International Nuclear Information System (INIS)

Wang, J.J.H.; Dubberley, J.R.

1989-01-01

Electromagnetic (EM) fields in a three-dimensional, arbitrarily shaped heterogeneous dielectric or biological body illuminated by a plane wave are computed by an iterative conjugate gradient method. The method is a generalized method of moments applied to the volume integral equation. Because no matrix is explicitly involved or stored, the present iterative method is capable of computing EM fields in objects an order of magnitude larger than those that can be handled by the conventional method of moments. Excellent numerical convergence is achieved. Perfect convergence to the result of the conventional moment method using the same basis and weighted with delta functions is consistently achieved in all the cases computed, indicating that these two algorithms (direct and interactive) are equivalent

Preconditioned conjugate gradient wave-front reconstructors for multiconjugate adaptive optics

Science.gov (United States)

Gilles, Luc; Ellerbroek, Brent L.; Vogel, Curtis R.

2003-09-01

Multiconjugate adaptive optics (MCAO) systems with 104-105 degrees of freedom have been proposed for future giant telescopes. Using standard matrix methods to compute, optimize, and implement wave-front control algorithms for these systems is impractical, since the number of calculations required to compute and apply the reconstruction matrix scales respectively with the cube and the square of the number of adaptive optics degrees of freedom. We develop scalable open-loop iterative sparse matrix implementations of minimum variance wave-front reconstruction for telescope diameters up to 32 m with more than 104 actuators. The basic approach is the preconditioned conjugate gradient method with an efficient preconditioner, whose block structure is defined by the atmospheric turbulent layers very much like the layer-oriented MCAO algorithms of current interest. Two cost-effective preconditioners are investigated: a multigrid solver and a simpler block symmetric Gauss-Seidel (BSGS) sweep. Both options require off-line sparse Cholesky factorizations of the diagonal blocks of the matrix system. The cost to precompute these factors scales approximately as the three-halves power of the number of estimated phase grid points per atmospheric layer, and their average update rate is typically of the order of 10-2 Hz, i.e., 4-5 orders of magnitude lower than the typical 103 Hz temporal sampling rate. All other computations scale almost linearly with the total number of estimated phase grid points. We present numerical simulation results to illustrate algorithm convergence. Convergence rates of both preconditioners are similar, regardless of measurement noise level, indicating that the layer-oriented BSGS sweep is as effective as the more elaborated multiresolution preconditioner.

Preconditioned conjugate gradient wave-front reconstructors for multiconjugate adaptive optics.

Science.gov (United States)

Gilles, Luc; Ellerbroek, Brent L; Vogel, Curtis R

2003-09-10

Multiconjugate adaptive optics (MCAO) systems with 10(4)-10(5) degrees of freedom have been proposed for future giant telescopes. Using standard matrix methods to compute, optimize, and implement wavefront control algorithms for these systems is impractical, since the number of calculations required to compute and apply the reconstruction matrix scales respectively with the cube and the square of the number of adaptive optics degrees of freedom. We develop scalable open-loop iterative sparse matrix implementations of minimum variance wave-front reconstruction for telescope diameters up to 32 m with more than 10(4) actuators. The basic approach is the preconditioned conjugate gradient method with an efficient preconditioner, whose block structure is defined by the atmospheric turbulent layers very much like the layer-oriented MCAO algorithms of current interest. Two cost-effective preconditioners are investigated: a multigrid solver and a simpler block symmetric Gauss-Seidel (BSGS) sweep. Both options require off-line sparse Cholesky factorizations of the diagonal blocks of the matrix system. The cost to precompute these factors scales approximately as the three-halves power of the number of estimated phase grid points per atmospheric layer, and their average update rate is typically of the order of 10(-2) Hz, i.e., 4-5 orders of magnitude lower than the typical 10(3) Hz temporal sampling rate. All other computations scale almost linearly with the total number of estimated phase grid points. We present numerical simulation results to illustrate algorithm convergence. Convergence rates of both preconditioners are similar, regardless of measurement noise level, indicating that the layer-oriented BSGS sweep is as effective as the more elaborated multiresolution preconditioner.

Blockwise conjugate gradient methods for image reconstruction in volumetric CT.

Science.gov (United States)

Qiu, W; Titley-Peloquin, D; Soleimani, M

2012-11-01

Cone beam computed tomography (CBCT) enables volumetric image reconstruction from 2D projection data and plays an important role in image guided radiation therapy (IGRT). Filtered back projection is still the most frequently used algorithm in applications. The algorithm discretizes the scanning process (forward projection) into a system of linear equations, which must then be solved to recover images from measured projection data. The conjugate gradients (CG) algorithm and its variants can be used to solve (possibly regularized) linear systems of equations Ax=b and linear least squares problems minx∥b-Ax∥2, especially when the matrix A is very large and sparse. Their applications can be found in a general CT context, but in tomography problems (e.g. CBCT reconstruction) they have not widely been used. Hence, CBCT reconstruction using the CG-type algorithm LSQR was implemented and studied in this paper. In CBCT reconstruction, the main computational challenge is that the matrix A usually is very large, and storing it in full requires an amount of memory well beyond the reach of commodity computers. Because of these memory capacity constraints, only a small fraction of the weighting matrix A is typically used, leading to a poor reconstruction. In this paper, to overcome this difficulty, the matrix A is partitioned and stored blockwise, and blockwise matrix-vector multiplications are implemented within LSQR. This implementation allows us to use the full weighting matrix A for CBCT reconstruction without further enhancing computer standards. Tikhonov regularization can also be implemented in this fashion, and can produce significant improvement in the reconstructed images. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

Accurate conjugate gradient methods for families of shifted systems

NARCIS (Netherlands)

Eshof, J. van den; Sleijpen, G.L.G.

2003-01-01

We consider the solution of the linear system (ATA + σI)xσ = ATb, for various real values of σ. This family of shifted systems arises, for example, in Tikhonov regularization and computations in lattice quantum chromodynamics. For each single shift σ this system can be solved using the conjugate

An accelerated conjugate gradient algorithm to compute low-lying eigenvalues - a study for the Dirac operator in SU(2) lattice QCD

International Nuclear Information System (INIS)

Kalkreuter, T.; Simma, H.

1995-07-01

The low-lying eigenvalues of a (sparse) hermitian matrix can be computed with controlled numerical errors by a conjugate gradient (CG) method. This CG algorithm is accelerated by alternating it with exact diagonalizations in the subspace spanned by the numerically computed eigenvectors. We study this combined algorithm in case of the Dirac operator with (dynamical) Wilson fermions in four-dimensional SU(2) gauge fields. The algorithm is numerically very stable and can be parallelized in an efficient way. On lattices of sizes 4 4 - 16 4 an acceleration of the pure CG method by a factor of 4 - 8 is found. (orig.)

CPDES2: A preconditioned conjugate gradient solver for linear asymmetric matrix equations arising from coupled partial differential equations in two dimensions

Science.gov (United States)

Anderson, D. V.; Koniges, A. E.; Shumaker, D. E.

1988-11-01

Many physical problems require the solution of coupled partial differential equations on two-dimensional domains. When the time scales of interest dictate an implicit discretization of the equations a rather complicated global matrix system needs solution. The exact form of the matrix depends on the choice of spatial grids and on the finite element or finite difference approximations employed. CPDES2 allows each spatial operator to have 5 or 9 point stencils and allows for general couplings between all of the component PDE's and it automatically generates the matrix structures needed to perform the algorithm. The resulting sparse matrix equation is solved by either the preconditioned conjugate gradient (CG) method or by the preconditioned biconjugate gradient (BCG) algorithm. An arbitrary number of component equations are permitted only limited by available memory. In the sub-band representation used, we generate an algorithm that is written compactly in terms of indirect indices which is vectorizable on some of the newer scientific computers.

CPDES3: A preconditioned conjugate gradient solver for linear asymmetric matrix equations arising from coupled partial differential equations in three dimensions

Science.gov (United States)

Anderson, D. V.; Koniges, A. E.; Shumaker, D. E.

1988-11-01

Many physical problems require the solution of coupled partial differential equations on three-dimensional domains. When the time scales of interest dictate an implicit discretization of the equations a rather complicated global matrix system needs solution. The exact form of the matrix depends on the choice of spatial grids and on the finite element or finite difference approximations employed. CPDES3 allows each spatial operator to have 7, 15, 19, or 27 point stencils and allows for general couplings between all of the component PDE's and it automatically generates the matrix structures needed to perform the algorithm. The resulting sparse matrix equation is solved by either the preconditioned conjugate gradient (CG) method or by the preconditioned biconjugate gradient (BCG) algorithm. An arbitrary number of component equations are permitted only limited by available memory. In the sub-band representation used, we generate an algorithm that is written compactly in terms of indirect induces which is vectorizable on some of the newer scientific computers.

In vitro transcription of a torsionally constrained template

DEFF Research Database (Denmark)

Bentin, Thomas; Nielsen, Peter E

2002-01-01

of torsionally constrained DNA by free RNAP. We asked whether or not a newly synthesized RNA chain would limit transcription elongation. For this purpose we developed a method to immobilize covalently closed circular DNA to streptavidin-coated beads via a peptide nucleic acid (PNA)-biotin conjugate in principle...

Myocardial perfusion magnetic resonance imaging using sliding-window conjugate-gradient HYPR methods in canine with stenotic coronary arteries.

Science.gov (United States)

Ge, Lan; Kino, Aya; Lee, Daniel; Dharmakumar, Rohan; Carr, James C; Li, Debiao

2010-01-01

First-pass perfusion magnetic resonance imaging (MRI) is a promising technique for detecting ischemic heart disease. However, the diagnostic value of the method is limited by the low spatial coverage, resolution, signal-to-noise ratio (SNR), and cardiac motion-related image artifacts. A combination of sliding window and conjugate-gradient HighlY constrained back-PRojection reconstruction (SW-CG-HYPR) method has been proposed in healthy volunteer studies to reduce the acquisition window for each slice while maintaining the temporal resolution of 1 frame per heartbeat in myocardial perfusion MRI. This method allows for improved spatial coverage, resolution, and SNR. In this study, we use a controlled animal model to test whether the myocardial territory supplied by a stenotic coronary artery can be detected accurately by SW-CG-HYPR perfusion method under pharmacological stress. Results from 6 mongrel dogs (15-25 kg) studies demonstrate the feasibility of SW-CG-HYPR to detect regional perfusion defects. Using this method, the acquisition time per cardiac cycle was reduced by a factor of 4, and the spatial coverage was increased from 2 to 3 slices to 6 slices as compared with the conventional techniques including both turbo-Fast Low Angle Short (FLASH) and echoplanar imaging (EPI). The SNR of the healthy myocardium at peak enhancement with SW-CG-HYPR (12.68 ± 2.46) is significantly higher (P < 0.01) than the turbo-FLASH (8.65 ± 1.93) and EPI (5.48 ± 1.24). The spatial resolution of SW-CG-HYPR images is 1.2 × 1.2 × 8.0 mm, which is better than the turbo-FLASH (1.8 × 1.8 × 8.0 mm) and EPI (2.0 × 1.8 × 8.0 mm). Sliding-window CG-HYPR is a promising technique for myocardial perfusion MRI. This technique provides higher image quality with respect to significantly improved SNR and spatial resolution of the myocardial perfusion images, which might improve myocardial perfusion imaging in a clinical setting.

Conjugate descent formulation of backpropagation error in ...

African Journals Online (AJOL)

nique of backpropagation was popularized in a paper by Rumelhart, et al. ... the training of a multilayer neural network using a gradient descent approach applied to a .... superior convergence of the conjugate descent method over a standard ...

Use of the preconditioned conjugate gradient method to accelerate S/sub n/ iterations

International Nuclear Information System (INIS)

Derstine, K.L.; Gelbard, E.M.

1985-01-01

It is well known that specially tailored diffusion difference equations are required in the synthetic method. The tailoring process is not trivial, and for some S/sub n/ schemes (e.g., in hexagonal geometry) tailored diffusion operators are not available. The need for alternative acceleration methods has been noted by Larsen who has, in fact, proposed two alternatives. The proposed methods, however, do not converge to the S/sub n/ solution, and their accuracy is still largely unknown. Los Alamos acceleration methods are required to converge for any mesh, no matter how coarse. Since negative flux-fix ups (normally involved when mesh widths are large) may impede convergence, it is not clear that such a strict condition is really practical. Here a lesser objective is chosen. The authors wish to develop an acceleration method useful for a wide (though finite) range of mesh widths, but to avoid the use of special diffusion difference equations. It is shown that the conjugate gradient (CG) method, with the standard box-centered (BC) diffusion equation as a preconditioner, yields an algorithm that, for fixed-source problems with isotropic scattering, is mechanically very similar to the synthetic method; but, in two-dimensional test problems in various geometries, the CG method is substantially more stable

Solving groundwater flow problems by conjugate-gradient methods and the strongly implicit procedure

Science.gov (United States)

Hill, Mary C.

1990-01-01

The performance of the preconditioned conjugate-gradient method with three preconditioners is compared with the strongly implicit procedure (SIP) using a scalar computer. The preconditioners considered are the incomplete Cholesky (ICCG) and the modified incomplete Cholesky (MICCG), which require the same computer storage as SIP as programmed for a problem with a symmetric matrix, and a polynomial preconditioner (POLCG), which requires less computer storage than SIP. Although POLCG is usually used on vector computers, it is included here because of its small storage requirements. In this paper, published comparisons of the solvers are evaluated, all four solvers are compared for the first time, and new test cases are presented to provide a more complete basis by which the solvers can be judged for typical groundwater flow problems. Based on nine test cases, the following conclusions are reached: (1) SIP is actually as efficient as ICCG for some of the published, linear, two-dimensional test cases that were reportedly solved much more efficiently by ICCG; (2) SIP is more efficient than other published comparisons would indicate when common convergence criteria are used; and (3) for problems that are three-dimensional, nonlinear, or both, and for which common convergence criteria are used, SIP is often more efficient than ICCG, and is sometimes more efficient than MICCG.

Penyelesaian Persamaan Poisson 2D dengan Menggunakan Metode Gauss-Seidel dan Conjugate Gradien

OpenAIRE

Mahmudah, Dewi Erla; Naf'an, Muhammad Zidny

2017-01-01

In this paper we focus on solution of 2D Poisson equation numerically. 2D Poisson equation is a partial differential equation of second order elliptical type. This equation is a particular form or non-homogeneous form of the Laplace equation. The solution of 2D Poisson equation is performed numerically using Gauss Seidel method and Conjugate Gradient method. The result is the value using Gauss Seidel method and Conjugate Gradient method is same. But, consider the iteration process, the conver...

A New Modified Three-Term Conjugate Gradient Method with Sufficient Descent Property and Its Global Convergence

Directory of Open Access Journals (Sweden)

Bakhtawar Baluch

2017-01-01

Full Text Available A new modified three-term conjugate gradient (CG method is shown for solving the large scale optimization problems. The idea relates to the famous Polak-Ribière-Polyak (PRP formula. As the numerator of PRP plays a vital role in numerical result and not having the jamming issue, PRP method is not globally convergent. So, for the new three-term CG method, the idea is to use the PRP numerator and combine it with any good CG formula’s denominator that performs well. The new modification of three-term CG method possesses the sufficient descent condition independent of any line search. The novelty is that by using the Wolfe Powell line search the new modification possesses global convergence properties with convex and nonconvex functions. Numerical computation with the Wolfe Powell line search by using the standard test function of optimization shows the efficiency and robustness of the new modification.

Efficient CUDA Polynomial Preconditioned Conjugate Gradient Solver for Finite Element Computation of Elasticity Problems

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.

Using Chebyshev polynomials and approximate inverse triangular factorizations for preconditioning the conjugate gradient method

Science.gov (United States)

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.

Self-calibrated multiple-echo acquisition with radial trajectories using the conjugate gradient method (SMART-CG).

Science.gov (United States)

Jung, Youngkyoo; Samsonov, Alexey A; Bydder, Mark; Block, Walter F

2011-04-01

To remove phase inconsistencies between multiple echoes, an algorithm using a radial acquisition to provide inherent phase and magnitude information for self correction was developed. The information also allows simultaneous support for parallel imaging for multiple coil acquisitions. Without a separate field map acquisition, a phase estimate from each echo in multiple echo train was generated. When using a multiple channel coil, magnitude and phase estimates from each echo provide in vivo coil sensitivities. An algorithm based on the conjugate gradient method uses these estimates to simultaneously remove phase inconsistencies between echoes, and in the case of multiple coil acquisition, simultaneously provides parallel imaging benefits. The algorithm is demonstrated on single channel, multiple channel, and undersampled data. Substantial image quality improvements were demonstrated. Signal dropouts were completely removed and undersampling artifacts were well suppressed. The suggested algorithm is able to remove phase cancellation and undersampling artifacts simultaneously and to improve image quality of multiecho radial imaging, the important technique for fast three-dimensional MRI data acquisition. Copyright © 2011 Wiley-Liss, Inc.

Pyrrolidine constrained bipyridyl-dansyl click fluoroionophore as selective Al(3+)sensor.

Science.gov (United States)

Maity, Debabrata; Govindaraju, T

2010-07-07

A pyrrolidine constrained bipyridyl-dansyl (ionophore-fluorophore) conjugate with triazole linker was synthesised through click chemistry. The fluoroionophore serves as a selective ratiometric and colorimetric chemosensor for Al(3+) based on internal charge transfer (ICT).

Quarter-Sweep Iteration Concept on Conjugate Gradient Normal Residual Method via Second Order Quadrature - Finite Difference Schemes for Solving Fredholm Integro-Differential Equations

International Nuclear Information System (INIS)

Aruchunan, E.

2015-01-01

In this paper, we have examined the effectiveness of the quarter-sweep iteration concept on conjugate gradient normal residual (CGNR) iterative method by using composite Simpson's (CS) and finite difference (FD) discretization schemes in solving Fredholm integro-differential equations. For comparison purposes, Gauss- Seidel (GS) and the standard or full- and half-sweep CGNR methods namely FSCGNR and HSCGNR are also presented. To validate the efficacy of the proposed method, several analyses were carried out such as computational complexity and percentage reduction on the proposed and existing methods. (author)

Three-dimensional Gravity Inversion with a New Gradient Scheme on Unstructured Grids

Science.gov (United States)

Sun, S.; Yin, C.; Gao, X.; Liu, Y.; Zhang, B.

2017-12-01

Stabilized gradient-based methods have been proved to be efficient for inverse problems. Based on these methods, setting gradient close to zero can effectively minimize the objective function. Thus the gradient of objective function determines the inversion results. By analyzing the cause of poor resolution on depth in gradient-based gravity inversion methods, we find that imposing depth weighting functional in conventional gradient can improve the depth resolution to some extent. However, the improvement is affected by the regularization parameter and the effect of the regularization term becomes smaller with increasing depth (shown as Figure 1 (a)). In this paper, we propose a new gradient scheme for gravity inversion by introducing a weighted model vector. The new gradient can improve the depth resolution more efficiently, which is independent of the regularization parameter, and the effect of regularization term will not be weakened when depth increases. Besides, fuzzy c-means clustering method and smooth operator are both used as regularization terms to yield an internal consecutive inverse model with sharp boundaries (Sun and Li, 2015). We have tested our new gradient scheme with unstructured grids on synthetic data to illustrate the effectiveness of the algorithm. Gravity forward modeling with unstructured grids is based on the algorithm proposed by Okbe (1979). We use a linear conjugate gradient inversion scheme to solve the inversion problem. The numerical experiments show a great improvement in depth resolution compared with regular gradient scheme, and the inverse model is compact at all depths (shown as Figure 1 (b)). AcknowledgeThis research is supported by Key Program of National Natural Science Foundation of China (41530320), China Natural Science Foundation for Young Scientists (41404093), and Key National Research Project of China (2016YFC0303100, 2017YFC0601900). ReferencesSun J, Li Y. 2015. Multidomain petrophysically constrained inversion and

Acceptable solutions obtained by unfolding noisy data with a conjugate gradient technique

International Nuclear Information System (INIS)

Lang, D.W.

1976-01-01

A linear resolution function in a physical measurement leads to data values and standard deviations at, say, N points. It is noted that the associated resolution functions may require that a number n of particular linear combinations of the data values be each not significantly different from zero. One is left with at most N-n parameters to evaluate. If the resolution functions are reasonably behaved, one can show that one sensible way to describe the underlying spectrum treats it as a linear combination of the given resolution functions and includes all the significant information from the data. An iterative search for the best component available to minimize the chi-square of the next fit to the data leads to a conjugate gradient technique. Programs based on the technique have been successfully used to obtain neutron spectra as a function of energy; in raw data from a pulse height analysis of proton recoils in a proportional counter, and where the raw data are time of flight spectra from a time dependent pulse of known form. It is planned to incorporate these, together with working programs respectively for photonuclear analysis and to explore the impurity concentration profile in a surface, into a single ''work-bench'' type program. A suitably difficult model unfolding problem has been developed and used to show the strengths and weaknesses of a number of other methods that have been used for unfolding

Gradient-type methods in inverse parabolic problems

International Nuclear Information System (INIS)

Kabanikhin, Sergey; Penenko, Aleksey

2008-01-01

This article is devoted to gradient-based methods for inverse parabolic problems. In the first part, we present a priori convergence theorems based on the conditional stability estimates for linear inverse problems. These theorems are applied to backwards parabolic problem and sideways parabolic problem. The convergence conditions obtained coincide with sourcewise representability in the self-adjoint backwards parabolic case but they differ in the sideways case. In the second part, a variational approach is formulated for a coefficient identification problem. Using adjoint equations, a formal gradient of an objective functional is constructed. A numerical test illustrates the performance of conjugate gradient algorithm with the formal gradient.

In vitro transcription of a torsionally constrained template

DEFF Research Database (Denmark)

Bentin, Thomas; Nielsen, Peter E

2002-01-01

RNA polymerase (RNAP) and the DNA template must rotate relative to each other during transcription elongation. In the cell, however, the components of the transcription apparatus may be subject to rotary constraints. For instance, the DNA is divided into topological domains that are delineated...... of torsionally constrained DNA by free RNAP. We asked whether or not a newly synthesized RNA chain would limit transcription elongation. For this purpose we developed a method to immobilize covalently closed circular DNA to streptavidin-coated beads via a peptide nucleic acid (PNA)-biotin conjugate in principle...... constrained. We conclude that transcription of a natural bacterial gene may proceed with high efficiency despite the fact that newly synthesized RNA is entangled around the template in the narrow confines of torsionally constrained supercoiled DNA....

ILUBCG2-11: Solution of 11-banded nonsymmetric linear equation systems by a preconditioned biconjugate gradient routine

Science.gov (United States)

Chen, Y.-M.; Koniges, A. E.; Anderson, D. V.

1989-10-01

The biconjugate gradient method (BCG) provides an attractive alternative to the usual conjugate gradient algorithms for the solution of sparse systems of linear equations with nonsymmetric and indefinite matrix operators. A preconditioned algorithm is given, whose form resembles the incomplete L-U conjugate gradient scheme (ILUCG2) previously presented. Although the BCG scheme requires the storage of two additional vectors, it converges in a significantly lesser number of iterations (often half), while the number of calculations per iteration remains essentially the same.

A modified conjugate gradient method based on the Tikhonov system for computerized tomography (CT).

Science.gov (United States)

Wang, Qi; Wang, Huaxiang

2011-04-01

During the past few decades, computerized tomography (CT) was widely used for non-destructive testing (NDT) and non-destructive examination (NDE) in the industrial area because of its characteristics of non-invasiveness and visibility. Recently, CT technology has been applied to multi-phase flow measurement. Using the principle of radiation attenuation measurements along different directions through the investigated object with a special reconstruction algorithm, cross-sectional information of the scanned object can be worked out. It is a typical inverse problem and has always been a challenge for its nonlinearity and ill-conditions. The Tikhonov regulation method is widely used for similar ill-posed problems. However, the conventional Tikhonov method does not provide reconstructions with qualities good enough, the relative errors between the reconstructed images and the real distribution should be further reduced. In this paper, a modified conjugate gradient (CG) method is applied to a Tikhonov system (MCGT method) for reconstructing CT images. The computational load is dominated by the number of independent measurements m, and a preconditioner is imported to lower the condition number of the Tikhonov system. Both simulation and experiment results indicate that the proposed method can reduce the computational time and improve the quality of image reconstruction. Copyright © 2010 ISA. Published by Elsevier Ltd. All rights reserved.

Two-step reconstruction method using global optimization and conjugate gradient for ultrasound-guided diffuse optical tomography.

Science.gov (United States)

Tavakoli, Behnoosh; Zhu, Quing

2013-01-01

Ultrasound-guided diffuse optical tomography (DOT) is a promising method for characterizing malignant and benign lesions in the female breast. We introduce a new two-step algorithm for DOT inversion in which the optical parameters are estimated with the global optimization method, genetic algorithm. The estimation result is applied as an initial guess to the conjugate gradient (CG) optimization method to obtain the absorption and scattering distributions simultaneously. Simulations and phantom experiments have shown that the maximum absorption and reduced scattering coefficients are reconstructed with less than 10% and 25% errors, respectively. This is in contrast with the CG method alone, which generates about 20% error for the absorption coefficient and does not accurately recover the scattering distribution. A new measure of scattering contrast has been introduced to characterize benign and malignant breast lesions. The results of 16 clinical cases reconstructed with the two-step method demonstrates that, on average, the absorption coefficient and scattering contrast of malignant lesions are about 1.8 and 3.32 times higher than the benign cases, respectively.

Implementation of a conjugate gradient algorithm for thermal diffusivity identification in a moving boundaries system

International Nuclear Information System (INIS)

Perez, L; Autrique, L; Gillet, M

2008-01-01

The aim of this paper is to investigate the thermal diffusivity identification of a multilayered material dedicated to fire protection. In a military framework, fire protection needs to meet specific requirements, and operational protective systems must be constantly improved in order to keep up with the development of new weapons. In the specific domain of passive fire protections, intumescent coatings can be an effective solution on the battlefield. Intumescent materials have the ability to swell up when they are heated, building a thick multi-layered coating which provides efficient thermal insulation to the underlying material. Due to the heat aggressions (fire or explosion) leading to the intumescent phenomena, high temperatures are considered and prevent from linearization of the mathematical model describing the system state evolution. Previous sensitivity analysis has shown that the thermal diffusivity of the multilayered intumescent coating is a key parameter in order to validate the predictive numerical tool and therefore for thermal protection optimisation. A conjugate gradient method is implemented in order to minimise the quadratic cost function related to the error between predicted temperature and measured temperature. This regularisation algorithm is well adapted for a large number of unknown parameters.

Constraining fault interpretation through tomographic velocity gradients: application to northern Cascadia

Directory of Open Access Journals (Sweden)

K. Ramachandran

2012-02-01

Full Text Available Spatial gradients of tomographic velocities are seldom used in interpretation of subsurface fault structures. This study shows that spatial velocity gradients can be used effectively in identifying subsurface discontinuities in the horizontal and vertical directions. Three-dimensional velocity models constructed through tomographic inversion of active source and/or earthquake traveltime data are generally built from an initial 1-D velocity model that varies only with depth. Regularized tomographic inversion algorithms impose constraints on the roughness of the model that help to stabilize the inversion process. Final velocity models obtained from regularized tomographic inversions have smooth three-dimensional structures that are required by the data. Final velocity models are usually analyzed and interpreted either as a perturbation velocity model or as an absolute velocity model. Compared to perturbation velocity model, absolute velocity models have an advantage of providing constraints on lithology. Both velocity models lack the ability to provide sharp constraints on subsurface faults. An interpretational approach utilizing spatial velocity gradients applied to northern Cascadia shows that subsurface faults that are not clearly interpretable from velocity model plots can be identified by sharp contrasts in velocity gradient plots. This interpretation resulted in inferring the locations of the Tacoma, Seattle, Southern Whidbey Island, and Darrington Devil's Mountain faults much more clearly. The Coast Range Boundary fault, previously hypothesized on the basis of sedimentological and tectonic observations, is inferred clearly from the gradient plots. Many of the fault locations imaged from gradient data correlate with earthquake hypocenters, indicating their seismogenic nature.

Regularized image denoising based on spectral gradient optimization

International Nuclear Information System (INIS)

Lukić, Tibor; Lindblad, Joakim; Sladoje, Nataša

2011-01-01

Image restoration methods, such as denoising, deblurring, inpainting, etc, are often based on the minimization of an appropriately defined energy function. We consider energy functions for image denoising which combine a quadratic data-fidelity term and a regularization term, where the properties of the latter are determined by a used potential function. Many potential functions are suggested for different purposes in the literature. We compare the denoising performance achieved by ten different potential functions. Several methods for efficient minimization of regularized energy functions exist. Most are only applicable to particular choices of potential functions, however. To enable a comparison of all the observed potential functions, we propose to minimize the objective function using a spectral gradient approach; spectral gradient methods put very weak restrictions on the used potential function. We present and evaluate the performance of one spectral conjugate gradient and one cyclic spectral gradient algorithm, and conclude from experiments that both are well suited for the task. We compare the performance with three total variation-based state-of-the-art methods for image denoising. From the empirical evaluation, we conclude that denoising using the Huber potential (for images degraded by higher levels of noise; signal-to-noise ratio below 10 dB) and the Geman and McClure potential (for less noisy images), in combination with the spectral conjugate gradient minimization algorithm, shows the overall best performance

Optimising a parallel conjugate gradient solver

Energy Technology Data Exchange (ETDEWEB)

Field, M.R. [O`Reilly Institute, Dublin (Ireland)

1996-12-31

This work arises from the introduction of a parallel iterative solver to a large structural analysis finite element code. The code is called FEX and it was developed at Hitachi`s Mechanical Engineering Laboratory. The FEX package can deal with a large range of structural analysis problems using a large number of finite element techniques. FEX can solve either stress or thermal analysis problems of a range of different types from plane stress to a full three-dimensional model. These problems can consist of a number of different materials which can be modelled by a range of material models. The structure being modelled can have the load applied at either a point or a surface, or by a pressure, a centrifugal force or just gravity. Alternatively a thermal load can be applied with a given initial temperature. The displacement of the structure can be constrained by having a fixed boundary or by prescribing the displacement at a boundary.

Scintillation Reduction using Conjugate-Plane Imaging (Abstract)

Science.gov (United States)

Vander Haagen, G. A.

2017-12-01

(Abstract only) All observatories are plagued by atmospheric turbulence exhibited as star scintillation or "twinkle" whether a high altitude adaptive optics research or a 30-cm amateur telescope. It is well known that these disturbances are caused by wind and temperature-driven refractive gradients in the atmosphere and limit the ultimate photometric resolution of land-based facilities. One approach identified by Fuchs (1998) for scintillation noise reduction was to create a conjugate image space at the telescope and focus on the dominant conjugate turbulent layer within that space. When focused on the turbulent layer little or no scintillation exists. This technique is described whereby noise reductions of 6 to 11/1 have been experienced with mathematical and optical bench simulations. Discussed is a proof-of-principle conjugate optical train design for an 80-mm, f7 telescope.

Experience with the Incomplete Cholesky Conjugate Gradient method in a diffusion code

International Nuclear Information System (INIS)

Hoebel, W.

1985-01-01

For the numerical solution of sparse systems of linear equations arising from finite difference approximation of the multidimensional neutron diffusion equation fast methods are needed. Effective algorithms for scalar computers may not be likewise suitable on vector computers. In the improved version DIXY2 of the Karlsruhe two-dimensional neutron diffusion code for rectangular geometries an Incomplete Cholesky Conjugate Gradient (ICCG) algorithm has been combined with the originally implemented Cyclically Reduced 4-Lines SOR (CR4LSOR) inner iteration method. The combined procedure is automatically activated for slowly converging applications, thus leading to a drastic reduction of iterations as well as CPU-times on a scalar computer. In a follow-up benchmark study necessary modifications to ICCG and CR4LSOR for their use on a vector computer were investigated. It was found that a modified preconditioning for the ICCG algorithm restricted to the block diagonal matrix is an effective method both on scalar and vector computers. With a splitting of the 9-band-matrix in two triangular Cholesky matrices necessary inversions are performed on a scalar machine by recursive forward and backward substitutions. On vector computers an additional factorization of the triangular matrices into four bidiagonal matrices enables Buneman reduction and the recursive inversion is restricted to a small system. A similar strategy can be realized with CR4LSOR if the unvectorizable Gauss-Seidel iteration is replaced by Double Jacobi and Buneman technique for a vector computer. Compared to single line blocking over the original mesh the cyclical 4-lines reduction of the DIXY inner iteration scheme reduces numbers of iterations and CPU-times considerably

Experience with the incomplete Cholesky conjugate gradient method in a diffusion code

International Nuclear Information System (INIS)

Hoebel, W.

1986-01-01

For the numerical solution of sparse systems of linear equations arising from the finite difference approximation of the multidimensional neutron diffusion equation, fast methods are needed. Effective algorithms for scalar computers may not be likewise suitable on vector computers. In the improved version (DIXY2) of the Karlsruhe two-dimensional neutron diffusion code for rectangular geometries, an incomplete Cholesky conjugate gradient (ICCG) algorithm has been combined with the originally implemented cyclically reduced four-line successive overrelaxation (CR4LSOR) inner iteration method. The combined procedure is automatically activated for slowly converging applications, thus leading to a drastic reduction of iterations as well as CPU times on a scalar computer. In a follow-up benchmark study, necessary modifications to ICCG and CR4LSOR for use on a vector computer were investigated. It was found that a modified preconditioning for the ICCG algorithm restricted to the block diagonal matrix is an effective method both on scalar and vector computers. With a splitting of the nine-band matrix in two triangular Cholesky matrices, necessary inversions are performed on a scalar machine by recursive forward and backward substitutions. On vector computers an additional factorization of the triangular matrices into four bidiagonal matrices enables Buneman reduction, and the recursive inversion is restricted to a small system. A similar strategy can be realized with CR4LSOR if the unvectorizable Gauss-eidel iteration is replaced by Double Jacobi and Buneman techniques for a vector computer. Compared to single-line blocking over the original mesh, the cyclical four-line reduction of the DIXY inner iteration scheme reduces numbers of iterations and CPU times considerably

Identification of Random Dynamic Force Using an Improved Maximum Entropy Regularization Combined with a Novel Conjugate Gradient

Directory of Open Access Journals (Sweden)

ChunPing Ren

2017-01-01

Full Text Available We propose a novel mathematical algorithm to offer a solution for the inverse random dynamic force identification in practical engineering. Dealing with the random dynamic force identification problem using the proposed algorithm, an improved maximum entropy (IME regularization technique is transformed into an unconstrained optimization problem, and a novel conjugate gradient (NCG method was applied to solve the objective function, which was abbreviated as IME-NCG algorithm. The result of IME-NCG algorithm is compared with that of ME, ME-CG, ME-NCG, and IME-CG algorithm; it is found that IME-NCG algorithm is available for identifying the random dynamic force due to smaller root mean-square-error (RMSE, lower restoration time, and fewer iterative steps. Example of engineering application shows that L-curve method is introduced which is better than Generalized Cross Validation (GCV method and is applied to select regularization parameter; thus the proposed algorithm can be helpful to alleviate the ill-conditioned problem in identification of dynamic force and to acquire an optimal solution of inverse problem in practical engineering.

Ptychographic overlap constraint errors and the limits of their numerical recovery using conjugate gradient descent methods.

Science.gov (United States)

Tripathi, Ashish; McNulty, Ian; Shpyrko, Oleg G

2014-01-27

Ptychographic coherent x-ray diffractive imaging is a form of scanning microscopy that does not require optics to image a sample. A series of scanned coherent diffraction patterns recorded from multiple overlapping illuminated regions on the sample are inverted numerically to retrieve its image. The technique recovers the phase lost by detecting the diffraction patterns by using experimentally known constraints, in this case the measured diffraction intensities and the assumed scan positions on the sample. The spatial resolution of the recovered image of the sample is limited by the angular extent over which the diffraction patterns are recorded and how well these constraints are known. Here, we explore how reconstruction quality degrades with uncertainties in the scan positions. We show experimentally that large errors in the assumed scan positions on the sample can be numerically determined and corrected using conjugate gradient descent methods. We also explore in simulations the limits, based on the signal to noise of the diffraction patterns and amount of overlap between adjacent scan positions, of just how large these errors can be and still be rendered tractable by this method.

Comparative performance of the conjugate gradient and SOR [Successive Over Relaxation] methods for computational thermal hydraulics

International Nuclear Information System (INIS)

King, J.B.; Anghaie, S.; Domanus, H.M.

1987-01-01

Finite difference approximations to the continuity, momentum, and energy equations in thermal hydraulics codes result in a system of N by N equations for a problem having N field points. In a three dimensional problem, N increases as the problem becomes larger or more complex, and more rapidly as the computational mesh size is reduced. As a consequence, the execution time required to solve the problem increases, which may lead to placing limits on the problem resolution or accuracy. A conventinal method of solution of these systems of equations is the Successive Over Relaxation (SOR) technique. However, for a wide range of problems the execution time may be reduced by using a more efficient linear equation solver. One such method is the conjugate gradient method which was implemented in COMMIX-1B thermal hydraulics code. It was found that the execution time required to solve the resulting system of equations was reduced by a factor of about 2 for some problems. This paper summarizes the characteristics of these iterative solution procedures and compares their performance in modeling of a variety of reactor thermal hydraulic problems, using the COMMIX-1B computer code

Enhanced spatial resolution in fluorescence molecular tomography using restarted L1-regularized nonlinear conjugate gradient algorithm.

Science.gov (United States)

Shi, Junwei; Liu, Fei; Zhang, Guanglei; Luo, Jianwen; Bai, Jing

2014-04-01

Owing to the high degree of scattering of light through tissues, the ill-posedness of fluorescence molecular tomography (FMT) inverse problem causes relatively low spatial resolution in the reconstruction results. Unlike L2 regularization, L1 regularization can preserve the details and reduce the noise effectively. Reconstruction is obtained through a restarted L1 regularization-based nonlinear conjugate gradient (re-L1-NCG) algorithm, which has been proven to be able to increase the computational speed with low memory consumption. The algorithm consists of inner and outer iterations. In the inner iteration, L1-NCG is used to obtain the L1-regularized results. In the outer iteration, the restarted strategy is used to increase the convergence speed of L1-NCG. To demonstrate the performance of re-L1-NCG in terms of spatial resolution, simulation and physical phantom studies with fluorescent targets located with different edge-to-edge distances were carried out. The reconstruction results show that the re-L1-NCG algorithm has the ability to resolve targets with an edge-to-edge distance of 0.1 cm at a depth of 1.5 cm, which is a significant improvement for FMT.

A theory of gradient analysis

NARCIS (Netherlands)

Braak, ter C.J.F.

1988-01-01

The theory of gradient analysis is presented in this chapter, in which the heuristic techniques are integrated with regression, calibration, ordination and constrained ordination as distinct, well-defined statistical problems. The various techniques used for each type of problem are classified into

Fire Regime Characteristics along Environmental Gradients in Spain

Directory of Open Access Journals (Sweden)

María Vanesa Moreno

2016-11-01

Full Text Available Concern regarding global change has increased the need to understand the relationship between fire regime characteristics and the environment. Pyrogeographical theory suggests that fire regimes are constrained by climate, vegetation and fire ignition processes, but it is not obvious how fire regime characteristics are related to those factors. We used a three-matrix approach with a multivariate statistical methodology that combined an ordination method and fourth-corner analysis for hypothesis testing to investigate the relationship between fire regime characteristics and environmental gradients across Spain. Our results suggest that fire regime characteristics (i.e., density and seasonality of fire activity are constrained primarily by direct gradients based on climate, population, and resource gradients based on forest potential productivity. Our results can be used to establish a predictive model for how fire regimes emerge in order to support fire management, particularly as global environmental changes impact fire regime characteristics.

Constrained Optimization via Stochastic approximation with a simultaneous perturbation gradient approximation

DEFF Research Database (Denmark)

Sadegh, Payman

1997-01-01

This paper deals with a projection algorithm for stochastic approximation using simultaneous perturbation gradient approximation for optimization under inequality constraints where no direct gradient of the loss function is available and the inequality constraints are given as explicit functions...... of the optimization parameters. It is shown that, under application of the projection algorithm, the parameter iterate converges almost surely to a Kuhn-Tucker point, The procedure is illustrated by a numerical example, (C) 1997 Elsevier Science Ltd....

Accelerated gradient methods for constrained image deblurring

International Nuclear Information System (INIS)

Bonettini, S; Zanella, R; Zanni, L; Bertero, M

2008-01-01

In this paper we propose a special gradient projection method for the image deblurring problem, in the framework of the maximum likelihood approach. We present the method in a very general form and we give convergence results under standard assumptions. Then we consider the deblurring problem and the generality of the proposed algorithm allows us to add a energy conservation constraint to the maximum likelihood problem. In order to improve the convergence rate, we devise appropriate scaling strategies and steplength updating rules, especially designed for this application. The effectiveness of the method is evaluated by means of a computational study on astronomical images corrupted by Poisson noise. Comparisons with standard methods for image restoration, such as the expectation maximization algorithm, are also reported.

A finite element conjugate gradient FFT method for scattering

Science.gov (United States)

Collins, Jeffery D.; Ross, Dan; Jin, J.-M.; Chatterjee, A.; Volakis, John L.

1991-01-01

Validated results are presented for the new 3D body of revolution finite element boundary integral code. A Fourier series expansion of the vector electric and mangnetic fields is employed to reduce the dimensionality of the system, and the exact boundary condition is employed to terminate the finite element mesh. The mesh termination boundary is chosen such that is leads to convolutional boundary operatores of low O(n) memory demand. Improvements of this code are discussed along with the proposed formulation for a full 3D implementation of the finite element boundary integral method in conjunction with a conjugate gradiant fast Fourier transformation (CGFFT) solution.

A sensitivity function-based conjugate gradient method for optical tomography with the frequency-domain equation of radiative transfer

International Nuclear Information System (INIS)

Kim, Hyun Keol; Charette, Andre

2007-01-01

The Sensitivity Function-based Conjugate Gradient Method (SFCGM) is described. This method is used to solve the inverse problems of function estimation, such as the local maps of absorption and scattering coefficients, as applied to optical tomography for biomedical imaging. A highly scattering, absorbing, non-reflecting, non-emitting medium is considered here and simultaneous reconstructions of absorption and scattering coefficients inside the test medium are achieved with the proposed optimization technique, by using the exit intensity measured at boundary surfaces. The forward problem is solved with a discrete-ordinates finite-difference method on the framework of the frequency-domain full equation of radiative transfer. The modulation frequency is set to 600 MHz and the frequency data, obtained with the source modulation, is used as the input data. The inversion results demonstrate that the SFCGM can retrieve simultaneously the spatial distributions of optical properties inside the medium within a reasonable accuracy, by significantly reducing a cross-talk between inter-parameters. It is also observed that the closer-to-detector objects are better retrieved

Conjugated heat transfer in laminar flow between parallel-plates channel

International Nuclear Information System (INIS)

Guedes, R.O.C.; Cotta, R.M.; Brum, N.C.L.

1989-01-01

An analysis is made of conjugated convective-conductive heat transfer in laminar flow of a newtonian fluid between parallel-plates channel, taking into account the longitudinal conduction along the duct walls only, by neglecting the transversal temperature gradients in the solid. This extended Graetz-type problem is then analytically handled through the generalized integral transform technique, providing accurate numerical results for quantities of practical interest sucyh as bulk and wall temperatures, and Nusselt numbers. The effects of a conjugation parameter and Biot number on heat transfer behavior are then investigated. (author)

Applications of the conjugate gradient FFT method in scattering and radiation including simulations with impedance boundary conditions

Science.gov (United States)

Barkeshli, Kasra; Volakis, John L.

1991-01-01

The theoretical and computational aspects related to the application of the Conjugate Gradient FFT (CGFFT) method in computational electromagnetics are examined. The advantages of applying the CGFFT method to a class of large scale scattering and radiation problems are outlined. The main advantages of the method stem from its iterative nature which eliminates a need to form the system matrix (thus reducing the computer memory allocation requirements) and guarantees convergence to the true solution in a finite number of steps. Results are presented for various radiators and scatterers including thin cylindrical dipole antennas, thin conductive and resistive strips and plates, as well as dielectric cylinders. Solutions of integral equations derived on the basis of generalized impedance boundary conditions (GIBC) are also examined. The boundary conditions can be used to replace the profile of a material coating by an impedance sheet or insert, thus, eliminating the need to introduce unknown polarization currents within the volume of the layer. A general full wave analysis of 2-D and 3-D rectangular grooves and cavities is presented which will also serve as a reference for future work.

A nonrecursive order N preconditioned conjugate gradient: Range space formulation of MDOF dynamics

Science.gov (United States)

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.

Antibody-radioisotope conjugates for tumor localization and treatment

International Nuclear Information System (INIS)

Larson, S.M.; Carrasquillo, J.A.

1985-01-01

In principle, anti-tumor antibodies can be used to carry radioactivity to tumors for in-vivo diagnosis and treatment of cancer. First, for diagnostic purposes, an antibody that targets a specific antigen (for example, the p97 antigen of human melanoma tumor), is labeled with a tracer amount of radioactivity. When this antibody-radioisotope conjugate is injected into the blood stream, the antibody carries the radioactivity throughout the body and in time, percolates through all the tissues of the body. Because the tumor has specific antigens to which the antibody can bind, the antibody conjugate progressively accumulates in the tumor. Using conventional nuclear medicine imaging equipment, the body of the patient is scanned for radioactivity content, and a map of the distribution of the radioactivity is displayed on photographic film. The tumor shows up as a dense area of radio-activity. These same antibody-radioisotope conjugates may be used for therapy of tumors, except that in this case large amounts of radioactivity are loaded on the antibody. After localization of the conjugate there is sufficient radiation deposited in the tumor of radiotherapy. The success of this approach in the clinic is determined in large measure by the concentration gradient that can be achieved between tissue antibody conjugate in tumor versus normal tissue

Purification Efficacy of Synthetic Cannabinoid Conjugates Using High-Pressure Liquid Chromatography

Science.gov (United States)

conducted using high-pressure liquid chromatography and gradient screens to determine the most effective means of purifying the SC:dark quencher conjugates...to obtain the highest yields and purity. The purity was verified using liquid chromatographycoupled mass spectroscopy and nuclear magnetic resonance.

A Study on GPU Computing of Bi-conjugate Gradient Method for Finite Element Analysis of the Incompressible Navier-Stokes Equations

International Nuclear Information System (INIS)

Yoon, Jong Seon; Choi, Hyoung Gwon; Jeon, Byoung Jin; Jung, Hye Dong

2016-01-01

A parallel algorithm of bi-conjugate gradient method was developed based on CUDA for parallel computation of the incompressible Navier-Stokes equations. The governing equations were discretized using splitting P2P1 finite element method. Asymmetric stenotic flow problem was solved to validate the proposed algorithm, and then the parallel performance of the GPU was examined by measuring the elapsed times. Further, the GPU performance for sparse matrix-vector multiplication was also investigated with a matrix of fluid-structure interaction problem. A kernel was generated to simultaneously compute the inner product of each row of sparse matrix and a vector. In addition, the kernel was optimized to improve the performance by using both parallel reduction and memory coalescing. In the kernel construction, the effect of warp on the parallel performance of the present CUDA was also examined. The present GPU computation was more than 7 times faster than the single CPU by double precision.

A Study on GPU Computing of Bi-conjugate Gradient Method for Finite Element Analysis of the Incompressible Navier-Stokes Equations

Energy Technology Data Exchange (ETDEWEB)

Yoon, Jong Seon; Choi, Hyoung Gwon [Seoul Nat’l Univ. of Science and Technology, Seoul (Korea, Republic of); Jeon, Byoung Jin [Yonsei Univ., Seoul (Korea, Republic of); Jung, Hye Dong [Korea Electronics Technology Institute, Seongnam (Korea, Republic of)

2016-09-15

A parallel algorithm of bi-conjugate gradient method was developed based on CUDA for parallel computation of the incompressible Navier-Stokes equations. The governing equations were discretized using splitting P2P1 finite element method. Asymmetric stenotic flow problem was solved to validate the proposed algorithm, and then the parallel performance of the GPU was examined by measuring the elapsed times. Further, the GPU performance for sparse matrix-vector multiplication was also investigated with a matrix of fluid-structure interaction problem. A kernel was generated to simultaneously compute the inner product of each row of sparse matrix and a vector. In addition, the kernel was optimized to improve the performance by using both parallel reduction and memory coalescing. In the kernel construction, the effect of warp on the parallel performance of the present CUDA was also examined. The present GPU computation was more than 7 times faster than the single CPU by double precision.

Distributions of ectomycorrhizal and foliar endophytic fungal communities associated with Pinus ponderosa along a spatially constrained elevation gradient.

Science.gov (United States)

Bowman, Elizabeth A; Arnold, A Elizabeth

2018-05-13

Understanding distributions of plant-symbiotic fungi is important for projecting responses to environmental change. Many coniferous trees host ectomycorrhizal fungi (EM) in association with roots and foliar endophytic fungi (FE) in leaves. We examined how EM and FE associated with Pinus ponderosa each vary in abundance, diversity, and community structure over a spatially constrained elevation gradient that traverses four plant communities, 4°C in mean annual temperature, and 15 cm in mean annual precipitation. We sampled 63 individuals of Pinus ponderosa in 10 sites along a 635 m elevation gradient that encompassed a geographic distance of 9.8 km. We used standard methods to characterize each fungal group (amplified and sequenced EM from root tips; isolated and sequenced FE from leaves). Abundance and diversity of EM were similar across sites, but community composition and distributions of the most common EM differed with elevation (i.e., with climate, soil chemistry, and plant communities). Abundance and composition of FE did not differ with elevation, but diversity peaked in mid-to-high elevations. Our results suggest relatively tight linkages between EM and climate, soil chemistry, and plant communities. That FE appear less linked with these factors may speak to limitations of a culture-based approach, but more likely reflects the small spatial scale encompassed by our study. Future work should consider comparable methods for characterizing these functional groups, and additional transects to understand relationships of EM and FE to environmental factors that are likely to shift as a function of climate change. © 2018 Botanical Society of America.

Spectral edge: gradient-preserving spectral mapping for image fusion.

Science.gov (United States)

Connah, David; Drew, Mark S; Finlayson, Graham D

2015-12-01

This paper describes a novel approach to image fusion for color display. Our goal is to generate an output image whose gradient matches that of the input as closely as possible. We achieve this using a constrained contrast mapping paradigm in the gradient domain, where the structure tensor of a high-dimensional gradient representation is mapped exactly to that of a low-dimensional gradient field which is then reintegrated to form an output. Constraints on output colors are provided by an initial RGB rendering. Initially, we motivate our solution with a simple "ansatz" (educated guess) for projecting higher-D contrast onto color gradients, which we expand to a more rigorous theorem to incorporate color constraints. The solution to these constrained optimizations is closed-form, allowing for simple and hence fast and efficient algorithms. The approach can map any N-D image data to any M-D output and can be used in a variety of applications using the same basic algorithm. In this paper, we focus on the problem of mapping N-D inputs to 3D color outputs. We present results in five applications: hyperspectral remote sensing, fusion of color and near-infrared or clear-filter images, multilighting imaging, dark flash, and color visualization of magnetic resonance imaging diffusion-tensor imaging.

Optimal Allocation of Thermal-Electric Decoupling Systems Based on the National Economy by an Improved Conjugate Gradient Method

Directory of Open Access Journals (Sweden)

Shuang Rong

2015-12-01

Full Text Available Aiming to relieve the large amount of wind power curtailment during the heating period in the North China region, a thermal-electric decoupling (TED approach is proposed to both bring down the constraint of forced power output of combined heat and power plants and increase the electric load level during valley load times that assist the power grid in consuming more wind power. The operating principles of the thermal-electric decoupling approach is described, the mathematical model of its profits is developed, the constraint conditions of its operation are listed, also, an improved parallel conjugate gradient is utilized to bypass the saddle problem and accelerate the optimal speed. Numerical simulations are implemented and reveal an optimal allocation of TED which with a rated power of 280 MW and 185 MWh heat storage capacity are possible. This allocation of TED could bring approximately 16.9 billion Yuan of economic profit and consume more than 80% of the surplus wind energy which would be curtailed without the participation of TED. The results in this article verify the effectiveness of this method that could provide a referential guidance for thermal-electric decoupling system allocation in practice.

Depth profiling of laser-heated chromophores in biological tissues by pulsed photothermal radiometry

International Nuclear Information System (INIS)

Milner, T.E.; Goodman, D.M.; Tanenbaum, B.S.; Nelson, J.S.

1995-01-01

A solution method is proposed to the inverse problem of determining the unknown initial temperature distribution in a laser-exposed test material from measurements provided by infrared radiometry. A Fredholm integral equation of the first kind is derived that relates the temporal evolution of the infrared signal amplitude to the unknown initial temperature distribution in the exposed test material. The singular-value decomposition is used to demonstrate the severely ill-posed nature of the derived inverse problem. Three inversion methods are used to estimate solutions for the initial temperature distribution. A nonnegatively constrained conjugate-gradient algorithm using early termination is found superior to unconstrained inversion methods and is applied to image the depth of laser-heated chromophores in human skin. Key words: constrained conjugate gradients, ill-posed problem, infrared radiometry, laser surgery, nonnegative, singular-value decomposition

Solar multi-conjugate adaptive optics performance improvement

Science.gov (United States)

Zhang, Zhicheng; Zhang, Xiaofang; Song, Jie

2015-08-01

In order to overcome the effect of the atmospheric anisoplanatism, Multi-Conjugate Adaptive Optics (MCAO), which was developed based on turbulence correction by means of several deformable mirrors (DMs) conjugated to different altitude and by which the limit of a small corrected FOV that is achievable with AO is overcome and a wider FOV is able to be corrected, has been widely used to widen the field-of-view (FOV) of a solar telescope. With the assistance of the multi-threaded Adaptive Optics Simulator (MAOS), we can make a 3D reconstruction of the distorted wavefront. The correction is applied by one or more DMs. This technique benefits from information about atmospheric turbulence at different layers, which can be used to reconstruct the wavefront extremely well. In MAOS, the sensors are either simulated as idealized wavefront gradient sensors, tip-tilt sensors based on the best Zernike fit, or a WFS using physical optics and incorporating user specified pixel characteristics and a matched filter pixel processing algorithm. Only considering the atmospheric anisoplanatism, we focus on how the performance of a solar MCAO system is related to the numbers of DMs and their conjugate heights. We theoretically quantify the performance of the tomographic solar MCAO system. The results indicate that the tomographic AO system can improve the average Strehl ratio of a solar telescope by only employing one or two DMs conjugated to the optimum altitude. And the S.R. has a significant increase when more deformable mirrors are used. Furthermore, we discuss the effects of DM conjugate altitude on the correction achievable by the MCAO system, and present the optimum DM conjugate altitudes.

A combined finite element-boundary integral formulation for solution of two-dimensional scattering problems via CGFFT. [Conjugate Gradient Fast Fourier Transformation

Science.gov (United States)

Collins, Jeffery D.; Volakis, John L.; Jin, Jian-Ming

1990-01-01

A new technique is presented for computing the scattering by 2-D structures of arbitrary composition. The proposed solution approach combines the usual finite element method with the boundary-integral equation to formulate a discrete system. This is subsequently solved via the conjugate gradient (CG) algorithm. A particular characteristic of the method is the use of rectangular boundaries to enclose the scatterer. Several of the resulting boundary integrals are therefore convolutions and may be evaluated via the fast Fourier transform (FFT) in the implementation of the CG algorithm. The solution approach offers the principal advantage of having O(N) memory demand and employs a 1-D FFT versus a 2-D FFT as required with a traditional implementation of the CGFFT algorithm. The speed of the proposed solution method is compared with that of the traditional CGFFT algorithm, and results for rectangular bodies are given and shown to be in excellent agreement with the moment method.

Direct reconstruction of cardiac PET kinetic parametric images using a preconditioned conjugate gradient approach.

Science.gov (United States)

Rakvongthai, Yothin; Ouyang, Jinsong; Guerin, Bastien; Li, Quanzheng; Alpert, Nathaniel M; El Fakhri, Georges

2013-10-01

Our research goal is to develop an algorithm to reconstruct cardiac positron emission tomography (PET) kinetic parametric images directly from sinograms and compare its performance with the conventional indirect approach. Time activity curves of a NCAT phantom were computed according to a one-tissue compartmental kinetic model with realistic kinetic parameters. The sinograms at each time frame were simulated using the activity distribution for the time frame. The authors reconstructed the parametric images directly from the sinograms by optimizing a cost function, which included the Poisson log-likelihood and a spatial regularization terms, using the preconditioned conjugate gradient (PCG) algorithm with the proposed preconditioner. The proposed preconditioner is a diagonal matrix whose diagonal entries are the ratio of the parameter and the sensitivity of the radioactivity associated with parameter. The authors compared the reconstructed parametric images using the direct approach with those reconstructed using the conventional indirect approach. At the same bias, the direct approach yielded significant relative reduction in standard deviation by 12%-29% and 32%-70% for 50 × 10(6) and 10 × 10(6) detected coincidences counts, respectively. Also, the PCG method effectively reached a constant value after only 10 iterations (with numerical convergence achieved after 40-50 iterations), while more than 500 iterations were needed for CG. The authors have developed a novel approach based on the PCG algorithm to directly reconstruct cardiac PET parametric images from sinograms, and yield better estimation of kinetic parameters than the conventional indirect approach, i.e., curve fitting of reconstructed images. The PCG method increases the convergence rate of reconstruction significantly as compared to the conventional CG method.

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

JAC2D: A two-dimensional finite element computer program for the nonlinear quasi-static response of solids with the conjugate gradient method

International Nuclear Information System (INIS)

Biffle, J.H.; Blanford, M.L.

1994-05-01

JAC2D is a two-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equations. The method is implemented in a two-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. A four-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic/plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere

JAC3D -- A three-dimensional finite element computer program for the nonlinear quasi-static response of solids with the conjugate gradient method

International Nuclear Information System (INIS)

Biffle, J.H.

1993-02-01

JAC3D is a three-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equation. The method is implemented in a three-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. An eight-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic-plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere

Basic Strain Gradient Plasticity Theories with Application to Constrained Film Deformation

DEFF Research Database (Denmark)

Niordson, Christian Frithiof; Hutchinson, John W.

2011-01-01

films: the compression or extension of a finite layer joining rigid platens. Full elastic-plastic solutions are obtained for the same problem based on a finite element method devised for the new class of flow theories. Potential difficulties and open issues associated with the new class of flow theories......A family of basic rate-independent strain gradient plasticity theories is considered that generalize conventional J(2) deformation and flow theories of plasticity to include a dependence on strain gradients in a simple way. The theory builds on three recent developments: the work of Gudmundson (J....... Mech. Phys. Solids 52 (2004), 1379-1406) and Gurtin and Anand (J. Mech. Phys. Solids 57 (2009), 405-421), proposing constitutive relations for flow theories consistent with requirements of positive plastic dissipation; the work of Fleck and Willis (J. Mech. Phys. Solids 57 (2009), 161-177 and 1045...

Journal of Chemical Sciences | Indian Academy of Sciences

Indian Academy of Sciences (India)

We have applied the conjugate gradient method for the constrained optimization of a suitably designed functional incorporating the desired objectives and constraints. Laser pulses designed for several excitation processes of the molecule were able to achieve predefined dynamical goals with almost 100% yield.

Conjugate heat transfer effects on wall bubble nucleation in subcooled flashing flows

International Nuclear Information System (INIS)

Peterson, P.F.; Hijikata, K.

1990-01-01

A variety of models have been proposed to explain observations that large liquid superheat is required to initiate nucleation in flashing flows of subcooled liquids in nozzles, cracks and pipes. In such flows an abrupt change in the fluid temperature occurs downstream of the nucleating cavities. This paper examines the subcooling of the nucleating cavities due to conjugate heat transfer to the cold downstream fluid. This examination suggests a mechanism limiting the maximum active cavity size. Simple analysis shows that, of the total superheat required to initiate flashing, a substantial portion results from conjugate wall subcooling, which decreases the cavity vapor pressure. The specific case of flashing critical nozzle flow is examined in detail. Here boundary-layer laminarization due to the strong favorable pressure gradient aids the analysis of conjugate heat transfer

Numerical Methods for Constrained Optimization in 2D and 3D Biomechanics

Czech Academy of Sciences Publication Activity Database

Nedoma, Jiří; Bartoš, M.; Kestřánek sen., Z.; Kestřánek, Zdeněk; Stehlík, J.

1999-01-01

Roč. 6, č. 7 (1999), s. 557-586 ISSN 1070-5325. [IMBB'98, 27.09.1998-30.09.1998] Grant - others:MŠMT ČR(CZ) OK 158 Institutional research plan: AV0Z1030915 Keywords : variational inequalities * FEM * conjugate gradient method * preconditioning * quadratic programming * biomechanics Subject RIV: BA - General Mathematics Impact factor: 1.083, year: 1999

On the Solution of the Eigenvalue Assignment Problem for Discrete-Time Systems

Directory of Open Access Journals (Sweden)

El-Sayed M. E. Mostafa

2017-01-01

Full Text Available The output feedback eigenvalue assignment problem for discrete-time systems is considered. The problem is formulated first as an unconstrained minimization problem, where a three-term nonlinear conjugate gradient method is proposed to find a local solution. In addition, a cut to the objective function is included, yielding an inequality constrained minimization problem, where a logarithmic barrier method is proposed for finding the local solution. The conjugate gradient method is further extended to tackle the eigenvalue assignment problem for the two cases of decentralized control systems and control systems with time delay. The performance of the methods is illustrated through various test examples.

Sharp spatially constrained inversion

DEFF Research Database (Denmark)

Vignoli, Giulio G.; Fiandaca, Gianluca G.; Christiansen, Anders Vest C A.V.C.

2013-01-01

We present sharp reconstruction of multi-layer models using a spatially constrained inversion with minimum gradient support regularization. In particular, its application to airborne electromagnetic data is discussed. Airborne surveys produce extremely large datasets, traditionally inverted...... by using smoothly varying 1D models. Smoothness is a result of the regularization constraints applied to address the inversion ill-posedness. The standard Occam-type regularized multi-layer inversion produces results where boundaries between layers are smeared. The sharp regularization overcomes...... inversions are compared against classical smooth results and available boreholes. With the focusing approach, the obtained blocky results agree with the underlying geology and allow for easier interpretation by the end-user....

A SEMI-LAGRANGIAN TWO-LEVEL PRECONDITIONED NEWTON-KRYLOV SOLVER FOR CONSTRAINED DIFFEOMORPHIC IMAGE REGISTRATION.

Science.gov (United States)

Mang, Andreas; Biros, George

2017-01-01

We propose an efficient numerical algorithm for the solution of diffeomorphic image registration problems. We use a variational formulation constrained by a partial differential equation (PDE), where the constraints are a scalar transport equation. We use a pseudospectral discretization in space and second-order accurate semi-Lagrangian time stepping scheme for the transport equations. We solve for a stationary velocity field using a preconditioned, globalized, matrix-free Newton-Krylov scheme. We propose and test a two-level Hessian preconditioner. We consider two strategies for inverting the preconditioner on the coarse grid: a nested preconditioned conjugate gradient method (exact solve) and a nested Chebyshev iterative method (inexact solve) with a fixed number of iterations. We test the performance of our solver in different synthetic and real-world two-dimensional application scenarios. We study grid convergence and computational efficiency of our new scheme. We compare the performance of our solver against our initial implementation that uses the same spatial discretization but a standard, explicit, second-order Runge-Kutta scheme for the numerical time integration of the transport equations and a single-level preconditioner. Our improved scheme delivers significant speedups over our original implementation. As a highlight, we observe a 20 × speedup for a two dimensional, real world multi-subject medical image registration problem.

Wavelet methods in multi-conjugate adaptive optics

International Nuclear Information System (INIS)

Helin, T; Yudytskiy, M

2013-01-01

The next generation ground-based telescopes rely heavily on adaptive optics for overcoming the limitation of atmospheric turbulence. In the future adaptive optics modalities, like multi-conjugate adaptive optics (MCAO), atmospheric tomography is the major mathematical and computational challenge. In this severely ill-posed problem, a fast and stable reconstruction algorithm is needed that can take into account many real-life phenomena of telescope imaging. We introduce a novel reconstruction method for the atmospheric tomography problem and demonstrate its performance and flexibility in the context of MCAO. Our method is based on using locality properties of compactly supported wavelets, both in the spatial and frequency domains. The reconstruction in the atmospheric tomography problem is obtained by solving the Bayesian MAP estimator with a conjugate-gradient-based algorithm. An accelerated algorithm with preconditioning is also introduced. Numerical performance is demonstrated on the official end-to-end simulation tool OCTOPUS of European Southern Observatory. (paper)

Optimization algorithms and applications

CERN Document Server

Arora, Rajesh Kumar

2015-01-01

Choose the Correct Solution Method for Your Optimization ProblemOptimization: Algorithms and Applications presents a variety of solution techniques for optimization problems, emphasizing concepts rather than rigorous mathematical details and proofs. The book covers both gradient and stochastic methods as solution techniques for unconstrained and constrained optimization problems. It discusses the conjugate gradient method, Broyden-Fletcher-Goldfarb-Shanno algorithm, Powell method, penalty function, augmented Lagrange multiplier method, sequential quadratic programming, method of feasible direc

Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems

Czech Academy of Sciences Publication Activity Database

Lukšan, Ladislav; Vlček, Jan

1998-01-01

Roč. 5, č. 3 (1998), s. 219-247 ISSN 1070-5325 R&D Projects: GA ČR GA201/96/0918 Keywords : nonlinear programming * sparse problems * equality constraints * truncated Newton method * augmented Lagrangian function * indefinite systems * indefinite preconditioners * conjugate gradient method * residual smoothing Subject RIV: BA - General Mathematics Impact factor: 0.741, year: 1998

An historical survey of computational methods in optimal control.

Science.gov (United States)

Polak, E.

1973-01-01

Review of some of the salient theoretical developments in the specific area of optimal control algorithms. The first algorithms for optimal control were aimed at unconstrained problems and were derived by using first- and second-variation methods of the calculus of variations. These methods have subsequently been recognized as gradient, Newton-Raphson, or Gauss-Newton methods in function space. A much more recent addition to the arsenal of unconstrained optimal control algorithms are several variations of conjugate-gradient methods. At first, constrained optimal control problems could only be solved by exterior penalty function methods. Later algorithms specifically designed for constrained problems have appeared. Among these are methods for solving the unconstrained linear quadratic regulator problem, as well as certain constrained minimum-time and minimum-energy problems. Differential-dynamic programming was developed from dynamic programming considerations. The conditional-gradient method, the gradient-projection method, and a couple of feasible directions methods were obtained as extensions or adaptations of related algorithms for finite-dimensional problems. Finally, the so-called epsilon-methods combine the Ritz method with penalty function techniques.

Fast gradient-based methods for Bayesian reconstruction of transmission and emission PET images

International Nuclear Information System (INIS)

Mumcuglu, E.U.; Leahy, R.; Zhou, Z.; Cherry, S.R.

1994-01-01

The authors describe conjugate gradient algorithms for reconstruction of transmission and emission PET images. The reconstructions are based on a Bayesian formulation, where the data are modeled as a collection of independent Poisson random variables and the image is modeled using a Markov random field. A conjugate gradient algorithm is used to compute a maximum a posteriori (MAP) estimate of the image by maximizing over the posterior density. To ensure nonnegativity of the solution, a penalty function is used to convert the problem to one of unconstrained optimization. Preconditioners are used to enhance convergence rates. These methods generally achieve effective convergence in 15--25 iterations. Reconstructions are presented of an 18 FDG whole body scan from data collected using a Siemens/CTI ECAT931 whole body system. These results indicate significant improvements in emission image quality using the Bayesian approach, in comparison to filtered backprojection, particularly when reprojections of the MAP transmission image are used in place of the standard attenuation correction factors

Layer-oriented multigrid wavefront reconstruction algorithms for multi-conjugate adaptive optics

Science.gov (United States)

Gilles, Luc; Ellerbroek, Brent L.; Vogel, Curtis R.

2003-02-01

Multi-conjugate adaptive optics (MCAO) systems with 104-105 degrees of freedom have been proposed for future giant telescopes. Using standard matrix methods to compute, optimize, and implement wavefront control algorithms for these systems is impractical, since the number of calculations required to compute and apply the reconstruction matrix scales respectively with the cube and the square of the number of AO degrees of freedom. In this paper, we develop an iterative sparse matrix implementation of minimum variance wavefront reconstruction for telescope diameters up to 32m with more than 104 actuators. The basic approach is the preconditioned conjugate gradient method, using a multigrid preconditioner incorporating a layer-oriented (block) symmetric Gauss-Seidel iterative smoothing operator. We present open-loop numerical simulation results to illustrate algorithm convergence.

Motion-compensated cone beam computed tomography using a conjugate gradient least-squares algorithm and electrical impedance tomography imaging motion data.

Science.gov (United States)

Pengpen, T; Soleimani, M

2015-06-13

Cone beam computed tomography (CBCT) is an imaging modality that has been used in image-guided radiation therapy (IGRT). For applications such as lung radiation therapy, CBCT images are greatly affected by the motion artefacts. This is mainly due to low temporal resolution of CBCT. Recently, a dual modality of electrical impedance tomography (EIT) and CBCT has been proposed, in which the high temporal resolution EIT imaging system provides motion data to a motion-compensated algebraic reconstruction technique (ART)-based CBCT reconstruction software. High computational time associated with ART and indeed other variations of ART make it less practical for real applications. This paper develops a motion-compensated conjugate gradient least-squares (CGLS) algorithm for CBCT. A motion-compensated CGLS offers several advantages over ART-based methods, including possibilities for explicit regularization, rapid convergence and parallel computations. This paper for the first time demonstrates motion-compensated CBCT reconstruction using CGLS and reconstruction results are shown in limited data CBCT considering only a quarter of the full dataset. The proposed algorithm is tested using simulated motion data in generic motion-compensated CBCT as well as measured EIT data in dual EIT-CBCT imaging. © 2015 The Author(s) Published by the Royal Society. All rights reserved.

An alternative treatment of phenomenological higher-order strain-gradient plasticity theory

DEFF Research Database (Denmark)

Kuroda, Mitsutoshi; Tvergaard, Viggo

2010-01-01

strain is discussed, applying a dislocation theory-based consideration. Then, a differential equation for the equivalent plastic strain-gradient is introduced as an additional governing equation. Its weak form makes it possible to deduce and impose extra boundary conditions for the equivalent plastic...... strain. A connection between the present treatment and strain-gradient theories based on an extended virtual work principle is discussed. Furthermore, a numerical implementation and analysis of constrained simple shear of a thin strip are presented....

Non-linear extension of FFT-based methods accelerated by conjugate gradients to evaluate the mechanical behavior of composite materials

International Nuclear Information System (INIS)

Gelebart, Lionel; Mondon-Cancel, Romain

2013-01-01

FFT-based methods are used to solve the problem of a heterogeneous unit-cell submitted to periodic boundary conditions, which is of a great interest in the context of numerical homogenization. Recently (in 2010), Brisard and Zeman proposed simultaneously to use Conjugate Gradient based solvers in order to improve the convergence properties (when compared to the basic scheme, proposed initially in 1994). The purpose of the paper is to extend this idea to the case of non-linear behaviors. The proposed method is based on a Newton-Raphson algorithm and can be applied to various kinds of behaviors (time dependant or independent, with or without internal variables) through a conventional integration procedure as used in finite element codes. It must be pointed out that this approach is fundamentally different from the traditional FFT-based approaches which rely on a fixed-point algorithm (e.g. basic scheme, Eyre and Milton accelerated scheme, Augmented Lagrangian scheme, etc.). The method is compared to the basic scheme on the basis of a simple application (a linear elastic spherical inclusion within a non-linear elastic matrix): a low sensitivity to the reference material and an improved efficiency, for a soft or a stiff inclusion, are observed. At first proposed for a prescribed macroscopic strain, the method is then extended to mixed loadings. (authors)

Purification of SUMO conjugating enzymes and kinetic analysis of substrate conjugation

Science.gov (United States)

Yunus, Ali A.; Lima, Christopher D.

2009-01-01

SUMO conjugation to protein substrates requires the concerted action of a dedicated E2 ubiquitin conjugation enzyme (Ubc9) and associated E3 ligases. Although Ubc9 can directly recognize and modify substrate lysine residues that occur within a consensus site for SUMO modification, E3 ligases can redirect specificity and enhance conjugation rates during SUMO conjugation in vitro and in vivo. In this chapter, we will describe methods utilized to purify SUMO conjugating enzymes and model substrates which can be used for analysis of SUMO conjugation in vitro. We will also describe methods to extract kinetic parameters during E3-dependent or E3-independent substrate conjugation. PMID:19107417

Bulk diffusion in a kinetically constrained lattice gas

Science.gov (United States)

Arita, Chikashi; Krapivsky, P. L.; Mallick, Kirone

2018-03-01

In the hydrodynamic regime, the evolution of a stochastic lattice gas with symmetric hopping rules is described by a diffusion equation with density-dependent diffusion coefficient encapsulating all microscopic details of the dynamics. This diffusion coefficient is, in principle, determined by a Green-Kubo formula. In practice, even when the equilibrium properties of a lattice gas are analytically known, the diffusion coefficient cannot be computed except when a lattice gas additionally satisfies the gradient condition. We develop a procedure to systematically obtain analytical approximations for the diffusion coefficient for non-gradient lattice gases with known equilibrium. The method relies on a variational formula found by Varadhan and Spohn which is a version of the Green-Kubo formula particularly suitable for diffusive lattice gases. Restricting the variational formula to finite-dimensional sub-spaces allows one to perform the minimization and gives upper bounds for the diffusion coefficient. We apply this approach to a kinetically constrained non-gradient lattice gas in two dimensions, viz. to the Kob-Andersen model on the square lattice.

Role of polarized G protein signaling in tracking pheromone gradients

Science.gov (United States)

McClure, Allison W.; Minakova, Maria; Dyer, Jayme M.; Zyla, Trevin R.; Elston, Timothy C.; Lew, Daniel J.

2015-01-01

Summary Yeast cells track gradients of pheromones to locate mating partners. Intuition suggests that uniform distribution of pheromone receptors over the cell surface would yield optimal gradient sensing. However, yeast cells display polarized receptors. The benefit of such polarization was unknown. During gradient tracking, cell growth is directed by a patch of polarity regulators that wanders around the cortex. Patch movement is sensitive to pheromone dose, with wandering reduced on the up-gradient side of the cell, resulting in net growth in that direction. Mathematical modeling suggests that active receptors and associated G proteins lag behind the polarity patch and act as an effective drag on patch movement. In vivo, the polarity patch is trailed by a G protein-rich domain, and this polarized distribution of G proteins is required to constrain patch wandering. Our findings explain why G protein polarization is beneficial, and illuminate a novel mechanism for gradient tracking. PMID:26609960

Generating multiplex gradients of biomolecules for controlling cellular adhesion in parallel microfluidic channels.

Science.gov (United States)

Didar, Tohid Fatanat; Tabrizian, Maryam

2012-11-07

Here we present a microfluidic platform to generate multiplex gradients of biomolecules within parallel microfluidic channels, in which a range of multiplex concentration gradients with different profile shapes are simultaneously produced. Nonlinear polynomial gradients were also generated using this device. The gradient generation principle is based on implementing parrallel channels with each providing a different hydrodynamic resistance. The generated biomolecule gradients were then covalently functionalized onto the microchannel surfaces. Surface gradients along the channel width were a result of covalent attachments of biomolecules to the surface, which remained functional under high shear stresses (50 dyn/cm(2)). An IgG antibody conjugated to three different fluorescence dyes (FITC, Cy5 and Cy3) was used to demonstrate the resulting multiplex concentration gradients of biomolecules. The device enabled generation of gradients with up to three different biomolecules in each channel with varying concentration profiles. We were also able to produce 2-dimensional gradients in which biomolecules were distributed along the length and width of the channel. To demonstrate the applicability of the developed design, three different multiplex concentration gradients of REDV and KRSR peptides were patterned along the width of three parallel channels and adhesion of primary human umbilical vein endothelial cell (HUVEC) in each channel was subsequently investigated using a single chip.

User intent prediction with a scaled conjugate gradient trained artificial neural network for lower limb amputees using a powered prosthesis.

Science.gov (United States)

Woodward, Richard B; Spanias, John A; Hargrove, Levi J

2016-08-01

Powered lower limb prostheses have the ability to provide greater mobility for amputee patients. Such prostheses often have pre-programmed modes which can allow activities such as climbing stairs and descending ramps, something which many amputees struggle with when using non-powered limbs. Previous literature has shown how pattern classification can allow seamless transitions between modes with a high accuracy and without any user interaction. Although accurate, training and testing each subject with their own dependent data is time consuming. By using subject independent datasets, whereby a unique subject is tested against a pooled dataset of other subjects, we believe subject training time can be reduced while still achieving an accurate classification. We present here an intent recognition system using an artificial neural network (ANN) with a scaled conjugate gradient learning algorithm to classify gait intention with user-dependent and independent datasets for six unilateral lower limb amputees. We compare these results against a linear discriminant analysis (LDA) classifier. The ANN was found to have significantly lower classification error (P<;0.05) than LDA with all user-dependent step-types, as well as transitional steps for user-independent datasets. Both types of classifiers are capable of making fast decisions; 1.29 and 2.83 ms for the LDA and ANN respectively. These results suggest that ANNs can provide suitable and accurate offline classification in prosthesis gait prediction.

JAC3D -- A three-dimensional finite element computer program for the nonlinear quasi-static response of solids with the conjugate gradient method; Yucca Mountain Site Characterization Project

Energy Technology Data Exchange (ETDEWEB)

Biffle, J.H.

1993-02-01

JAC3D is a three-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equation. The method is implemented in a three-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. An eight-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic-plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere.

JAC2D: A two-dimensional finite element computer program for the nonlinear quasi-static response of solids with the conjugate gradient method; Yucca Mountain Site Characterization Project

Energy Technology Data Exchange (ETDEWEB)

Biffle, J.H.; Blanford, M.L.

1994-05-01

JAC2D is a two-dimensional finite element program designed to solve quasi-static nonlinear mechanics problems. A set of continuum equations describes the nonlinear mechanics involving large rotation and strain. A nonlinear conjugate gradient method is used to solve the equations. The method is implemented in a two-dimensional setting with various methods for accelerating convergence. Sliding interface logic is also implemented. A four-node Lagrangian uniform strain element is used with hourglass stiffness to control the zero-energy modes. This report documents the elastic and isothermal elastic/plastic material model. Other material models, documented elsewhere, are also available. The program is vectorized for efficient performance on Cray computers. Sample problems described are the bending of a thin beam, the rotation of a unit cube, and the pressurization and thermal loading of a hollow sphere.

Conformationally constrained dipeptide surrogates with aromatic side-chains: synthesis of 4-aryl indolizidin-9-one amino acids by conjugate addition to a common alpha,omega-diaminoazelate enone intermediate.

Science.gov (United States)

Cluzeau, Jérôme; Lubell, William D

2004-03-05

Four methyl 9-oxo-8-(N-(Boc)-amino)-4-phenyl-1-azabicyclo[4.3.0]nonane carboxylates (11, 4-Ph-I(9)aa-OMe) were synthesized from (2S,8S,5E)-di-tert-butyl-4-oxo-5-ene-2,8-bis[N-(PhF)amino]azelate [(5E)-7, PhF = 9-(9-phenylfluorenyl)] via a seven-step process featuring a conjugate addition/reductive amination/lactam cyclization sequence. Various nucleophiles were used in the conjugate addition reactions on enone (5E)-7 as a general route for making alpha,omega-diaminoazelates possessing different substituents in good yield albeit low diastereoselectivity except in the case of aryl Grignard reagents (9/1 to 15/1 drs). 6-Phenylazelates (6S)-8d and (6R)-8d were separated by chromatography and diastereoselective precipitation and independently transformed into 4-Ph-I(9)aa-OMe. From (6S)-8d, (2S,4R,6R,8S)-4-Ph-I(9)aa-OMe 11 was prepared selectively in 51% yield. Reductive amination of (6R)-8d provided the desired pipecolates 9 along with desamino compound 10, which was minimized by performing the hydrogenation in the presence of ammonium acetate. Subsequent ester exchange, lactam cyclization, and amine protection provided three products (2R,4S,6S,8R)-, (2R,4S,6S,8S)-, and (2S,4S,6R,8S)-4-Ph-I(9)aa-OMe 11 in 10, 6, and 6% yields, respectively, from (6R)-8d. Ester hydrolysis of (2S,4R,6R,8S)-11 furnished 4-phenyl indolizidin-9-one N-(Boc)amino acid 3 as a novel constrained Ala-Phe dipeptide surrogate for studying conformation-activity relationships of biologically active peptides.

Distributed Kalman filtering compared to Fourier domain preconditioned conjugate gradient for laser guide star tomography on extremely large telescopes.

Science.gov (United States)

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.

Quantitative Experimental Determination of Primer-Dimer Formation Risk by Free-Solution Conjugate Electrophoresis

Science.gov (United States)

Desmarais, Samantha M.; Leitner, Thomas; Barron, Annelise E.

2012-01-01

DNA barcodes are short, unique ssDNA primers that “mark” individual biomolecules. To gain better understanding of biophysical parameters constraining primer-dimer formation between primers that incorporate barcode sequences, we have developed a capillary electrophoresis method that utilizes drag-tag-DNA conjugates to quantify dimerization risk between primer-barcode pairs. Results obtained with this unique free-solution conjugate electrophoresis (FSCE) approach are useful as quantitatively precise input data to parameterize computation models of dimerization risk. A set of fluorescently labeled, model primer-barcode conjugates were designed with complementary regions of differing lengths to quantify heterodimerization as a function of temperature. Primer-dimer cases comprised two 30-mer primers, one of which was covalently conjugated to a lab-made, chemically synthesized poly-N-methoxyethylglycine drag-tag, which reduced electrophoretic mobility of ssDNA to distinguish it from ds primer-dimers. The drag-tags also provided a shift in mobility for the dsDNA species, which allowed us to quantitate primer-dimer formation. In the experimental studies, pairs of oligonucleotide primer-barcodes with fully or partially complementary sequences were annealed, and then separated by free-solution conjugate CE at different temperatures, to assess effects on primer-dimer formation. When less than 30 out of 30 basepairs were bonded, dimerization was inversely correlated to temperature. Dimerization occurred when more than 15 consecutive basepairs formed, yet non-consecutive basepairs did not create stable dimers even when 20 out of 30 possible basepairs bonded. The use of free-solution electrophoresis in combination with a peptoid drag-tag and different fluorophores enabled precise separation of short DNA fragments to establish a new mobility shift assay for detection of primer-dimer formation. PMID:22331820

Conjugated heat transfer and temperature distributions in a gas turbine combustion liner under base-load operation

International Nuclear Information System (INIS)

Kim, Kyung Min; Yun, Nam Geon; Jeon, Yun Heung; Lee, Dong Hyun; Cho, Yung Hee

2010-01-01

Prediction of temperature distributions on hot components is important in development of a gas turbine combustion liner. The present study investigated conjugated heat transfer to obtain temperature distributions in a combustion liner with six combustion nozzles. 3D numerical simulations using FVM commercial codes, Fluent and CFX were performed to calculate combustion and heat transfer distributions. The temperature distributions in the combustor liner were calculated by conjugation of conduction and convection (heat transfer coefficients) obtained by combustion and cooling flow analysis. The wall temperature was the highest on the attachment points of the combustion gas from combustion nozzles, but the temperature gradient was high at the after shell section with low wall temperature

Slab Geometry and Segmentation on Seismogenic Subduction Zone; Insight from gravity gradients

Science.gov (United States)

Saraswati, A. T.; Mazzotti, S.; Cattin, R.; Cadio, C.

2017-12-01

Slab geometry is a key parameter to improve seismic hazard assessment in subduction zones. In many cases, information about structures beneath subduction are obtained from geophysical dedicated studies, including geodetic and seismic measurements. However, due to the lack of global information, both geometry and segmentation in seismogenic zone of many subductions remain badly-constrained. Here we propose an alternative approach based on satellite gravity observations. The GOCE (Gravity field and steady-state Ocean Circulation Explorer) mission enables to probe Earth deep mass structures from gravity gradients, which are more sensitive to spatial structure geometry and directional properties than classical gravitational data. Gravity gradients forward modeling of modeled slab is performed by using horizontal and vertical gravity gradient components to better determine slab geophysical model rather than vertical gradient only. Using polyhedron method, topography correction on gravity gradient signal is undertaken to enhance the anomaly signal of lithospheric structures. Afterward, we compare residual gravity gradients with the calculated signals associated with slab geometry. In this preliminary study, straightforward models are used to better understand the characteristic of gravity gradient signals due to deep mass sources. We pay a special attention to the delineation of slab borders and dip angle variations.

Double diffusive conjugate heat transfer: Part I

Science.gov (United States)

Azeem, Soudagar, Manzoor Elahi M.

2018-05-01

The present work is undertaken to investigate the effect of solid wall being placed at left of square cavity filled with porous medium. The presence of a solid wall in the porous medium turns the situation into a conjugate heat transfer problem. The boundary conditions are such that the left vertical surface is maintained at highest temperature and concentration whereas right vertical surface at lowest temperature and concentration in the medium. The top and bottom surfaces are adiabatic. The additional conduction equation along with the regular momentum and energy equations of porous medium are solved in an iterative manner with the help of finite element method. It is seen that the heat and mass transfer rate is lesser due to smaller thermal and concentration gradients.

Asynchronous Gossip-Based Gradient-Free Method for Multiagent Optimization

OpenAIRE

Deming Yuan

2014-01-01

This paper considers the constrained multiagent optimization problem. The objective function of the problem is a sum of convex functions, each of which is known by a specific agent only. For solving this problem, we propose an asynchronous distributed method that is based on gradient-free oracles and gossip algorithm. In contrast to the existing work, we do not require that agents be capable of computing the subgradients of their objective functions and coordinating their...

Evaluation of iodovinyl antibody conjugates: Comparison with a p-iodobenzoyl conjugate and direct radioiodination

International Nuclear Information System (INIS)

Hadley, S.W.; Wilbur, D.S.

1990-01-01

The preparations and conjugations of 2,3,5,6-tetrafluorophenyl 5-[125I/131I]iodo-4-pentenoate (7a) and 2,3,5,6-tetrafluorophenyl 3,3-dimethyl-5-[125I/131I]iodo-4-pentenoate (7b) to monoclonal antibodies are reported. Reagents 7a and 7b were prepared in high radiochemical yield by iododestannylation of their corresponding 5-tri-n-butylstannyl precursors. Radioiodinated antibody conjugates were prepared by reaction of 7a or 7b with the protein at basic pH. Evaluation of these conjugates by several in vitro procedures demonstrated that the radiolabel was attached to the antibody in a stable manner and that the conjugates maintained immunoreactivity. Comparative dual-isotope biodistribution studies of a monoclonal antibody Fab fragment conjugate of 7a and 7b with the same Fab fragment labeled with N-succinimidyl p-[131I]iodobenzoate (PIB, p-iodobenzoate, 2) or directly radioiodinated have been carried out in tumor-bearing nude mice. Coinjection of the Fab conjugate of 7a with the Fab conjugate of 2 demonstrated that the biodistributions were similar in most organs, except the neck tissue (thyroid-containing) and the stomach, which contained substantially increased levels of the 7a label. Coinjection of the Fab conjugate of 7a with the Fab fragment radioiodinated by using the chloramine-T method demonstrated that the biodistributions were remarkably similar, suggesting roughly equivalent in vivo deiodination of these labeled antibody fragments. Coinjection of the Fab conjugate of 7a with the Fab conjugate of 7b indicated that there was ∼ a 2-fold reduction in the amount of in vivo deiodination of the 7b conjugate as compared to the 7a conjugate

Development of {sup 177}Lu-DTPA-SPIO conjugates for potential use as a dual contrast SPECT/MRI imaging agent

Energy Technology Data Exchange (ETDEWEB)

Shanehsazzadeh, Saeed; Yousefnia, Hassan [Nuclear Science and Technology Research Institute (NSTRI), Tehran (Iran, Islamic Republic of); Gruettner, Cordula [Micromod Partikeltechnologie GmbH, Rostock (Germany); and others

2016-08-01

This study describes the preparation, biodistribution of {sup 177}Lu-DTPA-SPIO after intravenous injection in rats. The chelator DTPA dianhydride was conjugated to SPIO NPs using a small modification of the well-known cyclic anhydride method. Conjugation was done at a 1:2 (SPIO:ccDTPA) molar ratio. Conjugation reaction was purified with Magnetic assorting column (MACs) using high gradient magnetic field following incubation, the radio labeled conjugate was checked using RTLC method for labeling and purity checked. The RTLC showed that labeling yield was above 99% after purification and the compound have good in-vitro stabilities until 48 h post injection in the presence of human serum. The biodistribution of {sup 177}Lu-DTPA-SPIO in rats showed dramatic uptake in the reticuloendothelial system (RES) and their clearance is so fast in other organs especially in the blood. In conclusion, due to high uptakes of this radiotracer in the liver and spleen and their fast clearance from other tissues, especially in blood, it is suggested that this radiotracer would be suitable for RES studies.

Gradient-based estimation of Manning's friction coefficient from noisy data

KAUST Repository

Calo, Victor M.

2013-01-01

We study the numerical recovery of Manning\\'s roughness coefficient for the diffusive wave approximation of the shallow water equation. We describe a conjugate gradient method for the numerical inversion. Numerical results for one-dimensional models are presented to illustrate the feasibility of the approach. Also we provide a proof of the differentiability of the weak form with respect to the coefficient as well as the continuity and boundedness of the linearized operator under reasonable assumptions using the maximal parabolic regularity theory. © 2012 Elsevier B.V. All rights reserved.

Gradient-based estimation of Manning's friction coefficient from noisy data

KAUST Repository

Calo, Victor M.; Collier, Nathan; Gehre, Matthias; Jin, Bangti; Radwan, Hany G.; Santillana, Mauricio

2013-01-01

We study the numerical recovery of Manning's roughness coefficient for the diffusive wave approximation of the shallow water equation. We describe a conjugate gradient method for the numerical inversion. Numerical results for one-dimensional models are presented to illustrate the feasibility of the approach. Also we provide a proof of the differentiability of the weak form with respect to the coefficient as well as the continuity and boundedness of the linearized operator under reasonable assumptions using the maximal parabolic regularity theory. © 2012 Elsevier B.V. All rights reserved.

The retrieval of a buried cylindrical obstacle by a constrained modified gradient method in the H-polarization case and for Maxwellian materials

Science.gov (United States)

Lambert, M.; Lesselier, D.; Kooij, B. J.

1998-10-01

The retrieval of an unknown, possibly inhomogeneous, penetrable cylindrical obstacle buried entirely in a known homogeneous half-space - the constitutive material parameters of the obstacle and of its embedding obey a Maxwell model - is considered from single- or multiple-frequency aspect-limited data collected by ideal sensors located in air above the embedding half-space, when a small number of time-harmonic transverse electric (TE)-polarized line sources - the magnetic field H is directed along the axis of the cylinder - is also placed in air. The wavefield is modelled from a rigorous H-field domain integral-differential formulation which involves the dot product of the gradients of the single component of H and of the Green function of the stratified environment times a scalar-valued contrast function which contains the obstacle parameters (the frequency-independent, position-dependent relative permittivity and conductivity). A modified gradient method is developed in order to reconstruct the maps of such parameters within a prescribed search domain from the iterative minimization of a cost functional which incorporates both the error in reproducing the data and the error on the field built inside this domain. Non-physical values are excluded and convergence reached by incorporating in the solution algorithm, from a proper choice of unknowns, the condition that the relative permittivity be larger than or equal to 1, and the conductivity be non-negative. The efficiency of the constrained method is illustrated from noiseless and noisy synthetic data acquired independently. The importance of the choice of the initial values of the sought quantities, the need for a periodic refreshment of the constitutive parameters to avoid the algorithm providing inconsistent results, and the interest of a frequency-hopping strategy to obtain finer and finer features of the obstacle when the frequency is raised, are underlined. It is also shown that though either the permittivity

Co-conjugation vis-à-vis individual conjugation of α-amylase and glucoamylase for hydrolysis of starch.

Science.gov (United States)

Jadhav, Swati B; Singhal, Rekha S

2013-10-15

Two enzymes, α-amylase and glucoamylase have been individually and co-conjugated to pectin by covalent binding. Both the enzyme systems showed better thermal and pH stability over the free enzyme system with the complete retention of original activities. Mixture of individually conjugated enzymes showed lower inactivation rate constant with longer half life than the co-conjugated enzyme system. Individually conjugated enzymes showed an increase of 56.48 kJ/mole and 38.22 kJ/mole in activation energy for denaturation than the free enzymes and co-conjugated enzymes, respectively. Km as well as Vmax of individually and co-conjugated enzymes was found to be higher than the free enzymes. SDS-polyacrylamide gel electrophoresis confirmed the formation of conjugate and co-conjugate as evident by increased molecular weight. Both the enzyme systems were used for starch hydrolysis where individually conjugated enzymes showed highest release of glucose at 60 °C and pH 5.0 as compared to free and co-conjugated enzyme. Copyright © 2013 Elsevier Ltd. All rights reserved.

A New Continuous-Time Equality-Constrained Optimization to Avoid Singularity.

Science.gov (United States)

Quan, Quan; Cai, Kai-Yuan

2016-02-01

In equality-constrained optimization, a standard regularity assumption is often associated with feasible point methods, namely, that the gradients of constraints are linearly independent. In practice, the regularity assumption may be violated. In order to avoid such a singularity, a new projection matrix is proposed based on which a feasible point method to continuous-time, equality-constrained optimization is developed. First, the equality constraint is transformed into a continuous-time dynamical system with solutions that always satisfy the equality constraint. Second, a new projection matrix without singularity is proposed to realize the transformation. An update (or say a controller) is subsequently designed to decrease the objective function along the solutions of the transformed continuous-time dynamical system. The invariance principle is then applied to analyze the behavior of the solution. Furthermore, the proposed method is modified to address cases in which solutions do not satisfy the equality constraint. Finally, the proposed optimization approach is applied to three examples to demonstrate its effectiveness.

Constraining the carbon tetrachloride (CCl4) budget using its global trend and inter-hemispheric gradient

Science.gov (United States)

Liang, Qing; Newman, Paul A.; Daniel, John S.; Reimann, Stefan; Hall, Bradley D.; Dutton, Geoff; Kuijpers, Lambert J. M.

2014-07-01

Carbon tetrachloride (CCl4) is a major anthropogenic ozone-depleting substance and greenhouse gas and has been regulated under the Montreal Protocol. However, the near-zero 2007-2012 emissions estimate based on the UNEP reported production and feedstock usage cannot be reconciled with the observed slow decline of atmospheric concentrations and the inter-hemispheric gradient (IHG) for CCl4. Our 3-D model simulations suggest that the observed IHG (1.5 ± 0.2 ppt for 2000-2012) is primarily caused by ongoing current emissions, while ocean and soil losses and stratosphere-troposphere exchange together contribute a small negative gradient (~0 - -0.3 ppt). Using the observed CCl4 global trend and IHG, we deduce that the mean global emissions for the 2000-2012 period are 393445 Gg/yr (~30% of the peak 1980s emissions) and a corresponding total lifetime of 353732 years.

Metal artifact reduction in x-ray computed tomography (CT) by constrained optimization

International Nuclear Information System (INIS)

Zhang Xiaomeng; Wang Jing; Xing Lei

2011-01-01

Purpose: The streak artifacts caused by metal implants have long been recognized as a problem that limits various applications of CT imaging. In this work, the authors propose an iterative metal artifact reduction algorithm based on constrained optimization. Methods: After the shape and location of metal objects in the image domain is determined automatically by the binary metal identification algorithm and the segmentation of ''metal shadows'' in projection domain is done, constrained optimization is used for image reconstruction. It minimizes a predefined function that reflects a priori knowledge of the image, subject to the constraint that the estimated projection data are within a specified tolerance of the available metal-shadow-excluded projection data, with image non-negativity enforced. The minimization problem is solved through the alternation of projection-onto-convex-sets and the steepest gradient descent of the objective function. The constrained optimization algorithm is evaluated with a penalized smoothness objective. Results: The study shows that the proposed method is capable of significantly reducing metal artifacts, suppressing noise, and improving soft-tissue visibility. It outperforms the FBP-type methods and ART and EM methods and yields artifacts-free images. Conclusions: Constrained optimization is an effective way to deal with CT reconstruction with embedded metal objects. Although the method is presented in the context of metal artifacts, it is applicable to general ''missing data'' image reconstruction problems.

WARP3D-Release 10.8: Dynamic Nonlinear Analysis of Solids using a Preconditioned Conjugate Gradient Software Architecture

Science.gov (United States)

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

A constrained Delaunay discretization method for adaptively meshing highly discontinuous geological media

Science.gov (United States)

Wang, Yang; Ma, Guowei; Ren, Feng; Li, Tuo

2017-12-01

A constrained Delaunay discretization method is developed to generate high-quality doubly adaptive meshes of highly discontinuous geological media. Complex features such as three-dimensional discrete fracture networks (DFNs), tunnels, shafts, slopes, boreholes, water curtains, and drainage systems are taken into account in the mesh generation. The constrained Delaunay triangulation method is used to create adaptive triangular elements on planar fractures. Persson's algorithm (Persson, 2005), based on an analogy between triangular elements and spring networks, is enriched to automatically discretize a planar fracture into mesh points with varying density and smooth-quality gradient. The triangulated planar fractures are treated as planar straight-line graphs (PSLGs) to construct piecewise-linear complex (PLC) for constrained Delaunay tetrahedralization. This guarantees the doubly adaptive characteristic of the resulted mesh: the mesh is adaptive not only along fractures but also in space. The quality of elements is compared with the results from an existing method. It is verified that the present method can generate smoother elements and a better distribution of element aspect ratios. Two numerical simulations are implemented to demonstrate that the present method can be applied to various simulations of complex geological media that contain a large number of discontinuities.

Bacteriophytochromes control conjugation in Agrobacterium fabrum.

Science.gov (United States)

Bai, Yingnan; Rottwinkel, Gregor; Feng, Juan; Liu, Yiyao; Lamparter, Tilman

2016-08-01

Bacterial conjugation, the transfer of single stranded plasmid DNA from donor to recipient cell, is mediated through the type IV secretion system. We performed conjugation assays using a transmissible artificial plasmid as reporter. With this assay, conjugation in Agrobacterium fabrum was modulated by the phytochromes Agp1 and Agp2, photoreceptors that are most sensitive in the red region of visible light. In conjugation studies with wild-type donor cells carrying a pBIN-GUSINT plasmid as reporter that lacked the Ti (tumor inducing) plasmid, no conjugation was observed. When either agp1(-) or agp2(-) knockout donor strains were used, plasmid DNA was delivered to the recipient, indicating that both phytochromes suppress conjugation in the wild type donor. In the recipient strains, the loss of Agp1 or Agp2 led to diminished conjugation. When wild type cells with Ti plasmid and pBIN-GUS reporter plasmid were used as donor, a high rate of conjugation was observed. The DNA transfer was down regulated by red or far-red light by a factor of 3.5. With agp1(-) or agp2(-) knockout donor cells, conjugation in the dark was about 10 times lower than with the wild type donor, and with the double knockout donor no conjugation was observed. These results imply that the phytochrome system has evolved to inhibit conjugation in the light. The decrease of conjugation under different temperature correlated with the decrease of phytochrome autophosphorylation. Copyright © 2015 Elsevier B.V. All rights reserved.

Online Manifold Regularization by Dual Ascending Procedure

OpenAIRE

Sun, Boliang; Li, Guohui; Jia, Li; Zhang, Hui

2013-01-01

We propose a novel online manifold regularization framework based on the notion of duality in constrained optimization. The Fenchel conjugate of hinge functions is a key to transfer manifold regularization from offline to online in this paper. Our algorithms are derived by gradient ascent in the dual function. For practical purpose, we propose two buffering strategies and two sparse approximations to reduce the computational complexity. Detailed experiments verify the utility of our approache...

Polymers for Protein Conjugation

Directory of Open Access Journals (Sweden)

Gianfranco Pasut

2014-01-01

Full Text Available Polyethylene glycol (PEG at the moment is considered the leading polymer for protein conjugation in view of its unique properties, as well as to its low toxicity in humans, qualities which have been confirmed by its extensive use in clinical practice. Other polymers that are safe, biodegradable and custom-designed have, nevertheless, also been investigated as potential candidates for protein conjugation. This review will focus on natural polymers and synthetic linear polymers that have been used for protein delivery and the results associated with their use. Genetic fusion approaches for the preparation of protein-polypeptide conjugates will be also reviewed and compared with the best known chemical conjugation ones.

Antibiotic Conjugated Fluorescent Carbon Dots as a Theranostic Agent for Controlled Drug Release, Bioimaging, and Enhanced Antimicrobial Activity

Directory of Open Access Journals (Sweden)

Mukeshchand Thakur

2014-01-01

Full Text Available A novel report on microwave assisted synthesis of bright carbon dots (C-dots using gum arabic (GA and its use as molecular vehicle to ferry ciprofloxacin hydrochloride, a broad spectrum antibiotic, is reported in the present work. Density gradient centrifugation (DGC was used to separate different types of C-dots. After careful analysis of the fractions obtained after centrifugation, ciprofloxacin was attached to synthesize ciprofloxacin conjugated with C-dots (Cipro@C-dots conjugate. Release of ciprofloxacin was found to be extremely regulated under physiological conditions. Cipro@C-dots were found to be biocompatible on Vero cells as compared to free ciprofloxacin (1.2 mM even at very high concentrations. Bare C-dots (∼13 mg mL−1 were used for microbial imaging of the simplest eukaryotic model—Saccharomyces cerevisiae (yeast. Bright green fluorescent was obtained when live imaging was performed to view yeast cells under fluorescent microscope suggesting C-dots incorporation inside the cells. Cipro@C-dots conjugate also showed enhanced antimicrobial activity against both model gram positive and gram negative microorganisms. Thus, the Cipro@C-dots conjugate paves not only a way for bioimaging but also an efficient new nanocarrier for controlled drug release with high antimicrobial activity, thereby serving potential tool for theranostics.

Robust non-gradient C subroutines for non-linear optimization

DEFF Research Database (Denmark)

Brock, Pernille; Madsen, Kaj; Nielsen, Hans Bruun

2004-01-01

This report presents a package of robust and easy-to-use C subroutines for solving unconstrained and constrained non-linear optimization problems, where gradient information is not required. The intention is that the routines should use the currently best algorithms available. All routines have...... subroutines are obtained by changing 0 to 1. The present report is a new and updated version of a previous report NI-91-04 with the title Non-gradient c Subroutines for Non- Linear Optimization, [16]. Both the previous and the present report describe a collection of subroutines, which have been translated...... from Fortran to C. The reason for writing the present report is that some of the C subroutines have been replaced by more e ective and robust versions translated from the original Fortran subroutines to C by the Bandler Group, see [1]. Also the test examples have been modified to some extent...

Biodiversity patterns along ecological gradients: unifying β-diversity indices.

Science.gov (United States)

Szava-Kovats, Robert C; Pärtel, Meelis

2014-01-01

Ecologists have developed an abundance of conceptions and mathematical expressions to define β-diversity, the link between local (α) and regional-scale (γ) richness, in order to characterize patterns of biodiversity along ecological (i.e., spatial and environmental) gradients. These patterns are often realized by regression of β-diversity indices against one or more ecological gradients. This practice, however, is subject to two shortcomings that can undermine the validity of the biodiversity patterns. First, many β-diversity indices are constrained to range between fixed lower and upper limits. As such, regression analysis of β-diversity indices against ecological gradients can result in regression curves that extend beyond these mathematical constraints, thus creating an interpretational dilemma. Second, despite being a function of the same measured α- and γ-diversity, the resultant biodiversity pattern depends on the choice of β-diversity index. We propose a simple logistic transformation that rids beta-diversity indices of their mathematical constraints, thus eliminating the possibility of an uninterpretable regression curve. Moreover, this transformation results in identical biodiversity patterns for three commonly used classical beta-diversity indices. As a result, this transformation eliminates the difficulties of both shortcomings, while allowing the researcher to use whichever beta-diversity index deemed most appropriate. We believe this method can help unify the study of biodiversity patterns along ecological gradients.

Optical phase conjugation

CERN Document Server

Fisher, Robert A

1983-01-01

This book appears at a time of intense activity in optical phase conjugation. We chose not to await the maturation of the field, but instead to provide this material in time to be useful in its development. We have tried very hard to elucidate and interrelate the various nonlinear phenomena which can be used for optical phase conjugation.

Deformation of conjugate compliant fault zones induced by the 2013 Mw7.7 Baluchistan (Pakistan) earthquake

Science.gov (United States)

Dutta, Rishabh; Wang, Teng; Feng, Guangcai; Harrington, Jonathan; Vasyura-Bathke, Hannes; Jónsson, Sigurjón

2017-04-01

Strain localizations in compliant fault zones (with elastic moduli lower than the surrounding rocks) induced by nearby earthquakes have been detected using geodetic observations in a few cases in the past. Here we observe small-scale changes in interferometric Synthetic Aperture Radar (InSAR) measurements along multiple conjugate faults near the rupture of the 2013 Mw7.7 Baluchistan (Pakistan) earthquake. After removing the main coseismic deformation signal in the interferograms and correcting them for topography-related phase, we observe 2-3 cm signal along several conjugate faults that are 15-30 km from the mainshock fault rupture. These conjugate compliant faults have strikes of N30°E and N45°W. The sense of motion indicates left-lateral deformation across the N30°E faults and right-lateral deformation across the N45°W faults, which suggests the conjugate faults were subjected to extensional coseismic stresses along the WSW-ENE direction. The spacing between the different sets of faults is around 5 to 8 km. We explain the observed strain localizations as an elastic response of the compliant conjugate faults induced by the Baluchistan earthquake. Using 3D Finite Element models (FEM), we impose coseismic static displacements due to the earthquake along the boundaries of the FEM domain to reproduce the coseismic stress changes acting across the compliant faults. The InSAR measurements are used to constrain the geometry and rigidity variations of the compliant faults with respect to the surrounding rocks. The best fitting models show the compliant fault zones to have a width of 0.5 km to 2 km and a reduction of the shear modulus by a factor of 3 to 4. Our study yields similar values as were found for compliant fault zones near the 1992 Landers and the 1999 Hector Mine earthquakes in California, although here the strain localization is occurring on more complex conjugate sets of faults.

A finite deformation theory of higher-order gradient crystal plasticity

DEFF Research Database (Denmark)

Kuroda, Mitsutoshi; Tvergaard, Viggo

2008-01-01

crystal plasticity that is based on an assumption of the existence of higher-order stresses. Furthermore, a boundary-value problem for simple shear of a constrained thin strip is studied numerically, and some characteristic features of finite deformation are demonstrated through a comparison to a solution......For higher-order gradient crystal plasticity, a finite deformation formulation is presented. The theory does not deviate much from the conventional crystal plasticity theory. Only a back stress effect and additional differential equations for evolution of the geometrically necessary dislocation...

Qualidade conjugal: mapeando conceitos

Directory of Open Access Journals (Sweden)

Clarisse Mosmann

2006-12-01

Full Text Available Apesar da ampla utilização do conceito de qualidade conjugal, identifica-se falta de clareza conceitual acerca das variáveis que o compõem. Esse artigo apresenta revisão da literatura na área com o objetivo de mapear o conceito de qualidade conjugal. Foram analisadas sete principais teorias sobre o tema: Troca Social, Comportamental, Apego, Teoria da Crise, Interacionismo Simbólico. Pelos postulados propostos nas diferentes teorias, podem-se identificar três grupos de variáveis fundamentais na definição da qualidade conjugal: recursos pessoais dos cônjuges, contexto de inserção do casal e processos adaptativos. Neste sentido, a qualidade conjugal é resultado do processo dinâmico e interativo do casal, razão deste caráter multidimensional.

Optimization of offshore wind turbine support structures using analytical gradient-based method

OpenAIRE

Chew, Kok Hon; Tai, Kang; Ng, E.Y.K.; Muskulus, Michael

2015-01-01

Design optimization of the offshore wind turbine support structure is an expensive task; due to the highly-constrained, non-convex and non-linear nature of the design problem. This report presents an analytical gradient-based method to solve this problem in an efficient and effective way. The design sensitivities of the objective and constraint functions are evaluated analytically while the optimization of the structure is performed, subject to sizing, eigenfrequency, extreme load an...

Self-Assembly and Crystallization of Conjugated Block Copolymers

Science.gov (United States)

Davidson, Emily Catherine

This dissertation demonstrates the utility of molecular design in conjugated polymers to create diblock copolymers that robustly self-assemble in the melt and confine crystallization upon cooling. This work leverages the model conjugated polymer poly(3-(2'-ethyl)hexylthiophene) (P3EHT), which features a branched side chain, resulting in a dramatically reduced melting temperature (Tm 80°C) relative to the widely-studied poly(3-hexylthiophene) (P3HT) (Tm 200°C). This reduced melting temperature permits an accessible melt phase, without requiring that the segregation strength (chiN) be dramatically increased. Thus, diblock copolymers containing P3EHT demonstrate robust diblock copolymer self-assembly in the melt over a range of compositions and morphologies. Furthermore, confined crystallization in the case of both glassy (polystyrene (PS) matrix block) and soft (polymethylacrylate (PMA) matrix block) confinement is studied, with the finding that even in soft confinement, crystallization is constrained within the diblock microdomains. This success demonstrates the strategy of leveraging molecular design to decrease the driving force for crystallization as a means to achieving robust self-assembly and confined crystallization in conjugated block copolymers. Importantly, despite the relatively flexible nature of P3EHT in the melt, the diblock copolymer phase behavior appears to be significantly impacted by the stiffness (persistence length of 3 nm) of the P3EHT chain compared to the coupled amorphous blocks (persistence length 0.7 nm). In particular, it is shown that the synthesized morphologies are dominated by a very large composition window for lamellar geometries (favored at high P3EHT volume fractions); cylindrical geometries are favored when P3EHT is the minority fraction. This asymmetry of the composition window is attributed to impact of conformational asymmetry (the difference in chain stiffness, as opposed to shape) between conjugated and amorphous blocks

The use of singular value gradients and optimization techniques to design robust controllers for multiloop systems

Science.gov (United States)

Newsom, J. R.; Mukhopadhyay, V.

1983-01-01

A method for designing robust feedback controllers for multiloop systems is presented. Robustness is characterized in terms of the minimum singular value of the system return difference matrix at the plant input. Analytical gradients of the singular values with respect to design variables in the controller are derived. A cumulative measure of the singular values and their gradients with respect to the design variables is used with a numerical optimization technique to increase the system's robustness. Both unconstrained and constrained optimization techniques are evaluated. Numerical results are presented for a two output drone flight control system.

Forest gradient response in Sierran landscapes: the physical template

Science.gov (United States)

Urban, Dean L.; Miller, Carol; Halpin, Patrick N.; Stephenson, Nathan L.

2000-01-01

Vegetation pattern on landscapes is the manifestation of physical gradients, biotic response to these gradients, and disturbances. Here we focus on the physical template as it governs the distribution of mixed-conifer forests in California's Sierra Nevada. We extended a forest simulation model to examine montane environmental gradients, emphasizing factors affecting the water balance in these summer-dry landscapes. The model simulates the soil moisture regime in terms of the interaction of water supply and demand: supply depends on precipitation and water storage, while evapotranspirational demand varies with solar radiation and temperature. The forest cover itself can affect the water balance via canopy interception and evapotranspiration. We simulated Sierran forests as slope facets, defined as gridded stands of homogeneous topographic exposure, and verified simulated gradient response against sample quadrats distributed across Sequoia National Park. We then performed a modified sensitivity analysis of abiotic factors governing the physical gradient. Importantly, the model's sensitivity to temperature, precipitation, and soil depth varies considerably over the physical template, particularly relative to elevation. The physical drivers of the water balance have characteristic spatial scales that differ by orders of magnitude. Across large spatial extents, temperature and precipitation as defined by elevation primarily govern the location of the mixed conifer zone. If the analysis is constrained to elevations within the mixed-conifer zone, local topography comes into play as it influences drainage. Soil depth varies considerably at all measured scales, and is especially dominant at fine (within-stand) scales. Physical site variables can influence soil moisture deficit either by affecting water supply or water demand; these effects have qualitatively different implications for forest response. These results have clear implications about purely inferential approaches

Cross-Conjugated n-Dopable Aromatic Polyketone

NARCIS (Netherlands)

Voortman, Thomas P.; Bartesaghi, Davide; Koster, L. Jan Anton; Chiechi, Ryan C.

2015-01-01

This paper describes the synthesis and characterization of a high molecular weight cross-conjugated polyketone synthesized via scalable Friedel Crafts chemistry. Cross-conjugated polyketones are precursors to conjugated polyions; they become orders of magnitude more conductive after a two-electron

Protein carriers of conjugate vaccines

Science.gov (United States)

Pichichero, Michael E

2013-01-01

The immunogenicity of polysaccharides as human vaccines was enhanced by coupling to protein carriers. Conjugation transformed the T cell-independent polysaccharide vaccines of the past to T cell-dependent antigenic vaccines that were much more immunogenic and launched a renaissance in vaccinology. This review discusses the conjugate vaccines for prevention of infections caused by Hemophilus influenzae type b, Streptococcus pneumoniae, and Neisseria meningitidis. Specifically, the characteristics of the proteins used in the construction of the vaccines including CRM, tetanus toxoid, diphtheria toxoid, Neisseria meningitidis outer membrane complex, and Hemophilus influenzae protein D are discussed. The studies that established differences among and key features of conjugate vaccines including immunologic memory induction, reduction of nasopharyngeal colonization and herd immunity, and antibody avidity and avidity maturation are presented. Studies of dose, schedule, response to boosters, of single protein carriers with single and multiple polysaccharides, of multiple protein carriers with multiple polysaccharides and conjugate vaccines administered concurrently with other vaccines are discussed along with undesirable consequences of conjugate vaccines. The clear benefits of conjugate vaccines in improving the protective responses of the immature immune systems of young infants and the senescent immune systems of the elderly have been made clear and opened the way to development of additional vaccines using this technology for future vaccine products. PMID:23955057

An Improved Phase Gradient Autofocus Algorithm Used in Real-time Processing

Directory of Open Access Journals (Sweden)

Qing Ji-ming

2015-10-01

Full Text Available The Phase Gradient Autofocus (PGA algorithm can remove the high order phase error effectively, which is of great significance to get high resolution images in real-time processing. While PGA usually needs iteration, which necessitates long working hours. In addition, the performances of the algorithm are not stable in different scene applications. This severely constrains the application of PGA in real-time processing. Isolated scatter selection and windowing are two important algorithmic steps of Phase Gradient Autofocus Algorithm. Therefore, this paper presents an isolated scatter selection method based on sample mean and a windowing method based on pulse envelope. These two methods are highly adaptable to data, which would make the algorithm obtain better stability and need less iteration. The adaptability of the improved PGA is demonstrated with the experimental results of real radar data.

Conjugated polymer zwitterions and solar cells comprising conjugated polymer zwitterions

Science.gov (United States)

Emrick, Todd; Russell, Thomas; Page, Zachariah; Liu, Yao

2018-06-05

A conjugated polymer zwitterion includes repeating units having structure (I), (II), or a combination thereof ##STR00001## wherein Ar is independently at each occurrence a divalent substituted or unsubstituted C3-30 arylene or heteroarylene group; L is independently at each occurrence a divalent C1-16 alkylene group, C6-30arylene or heteroarylene group, or alkylene oxide group; and R1 is independently at each occurrence a zwitterion. A polymer solar cell including the conjugated polymer zwitterion is also disclosed.

Research study of conjugate materials; Conjugate material no chosa kenkyu

Energy Technology Data Exchange (ETDEWEB)

NONE

1998-03-01

The paper reported an introductory research on possibilities of new glass `conjugate materials.` The report took up the structure and synthetic process of conjugate materials to be researched/developed, classified them according to structural elements on molecular, nanometer and cluster levels, and introduced the structures and functions. Further, as glasses with new functions to be proposed, the paper introduced transparent and high-strength glass used for houses and vehicles, light modulation glass which realizes energy saving and optical data processing, and environmentally functional glass which realizes environmental cleaning or high performance biosensor. An initial survey was also conducted on rights of intellectual property to be taken notice of in Japan and abroad in the present situation. Reports were summed up and introduced of Osaka National Research Institute, Electrotechnical Laboratory, and National Industrial Research Institute of Nagoya which are all carrying out leading studies of conjugate materials. 235 refs., 135 figs., 6 tabs.

Finding intrinsic rewards by embodied evolution and constrained reinforcement learning.

Science.gov (United States)

Uchibe, Eiji; Doya, Kenji

2008-12-01

Understanding the design principle of reward functions is a substantial challenge both in artificial intelligence and neuroscience. Successful acquisition of a task usually requires not only rewards for goals, but also for intermediate states to promote effective exploration. This paper proposes a method for designing 'intrinsic' rewards of autonomous agents by combining constrained policy gradient reinforcement learning and embodied evolution. To validate the method, we use Cyber Rodent robots, in which collision avoidance, recharging from battery packs, and 'mating' by software reproduction are three major 'extrinsic' rewards. We show in hardware experiments that the robots can find appropriate 'intrinsic' rewards for the vision of battery packs and other robots to promote approach behaviors.

Evolutionary constrained optimization

CERN Document Server

Deb, Kalyanmoy

2015-01-01

This book makes available a self-contained collection of modern research addressing the general constrained optimization problems using evolutionary algorithms. Broadly the topics covered include constraint handling for single and multi-objective optimizations; penalty function based methodology; multi-objective based methodology; new constraint handling mechanism; hybrid methodology; scaling issues in constrained optimization; design of scalable test problems; parameter adaptation in constrained optimization; handling of integer, discrete and mix variables in addition to continuous variables; application of constraint handling techniques to real-world problems; and constrained optimization in dynamic environment. There is also a separate chapter on hybrid optimization, which is gaining lots of popularity nowadays due to its capability of bridging the gap between evolutionary and classical optimization. The material in the book is useful to researchers, novice, and experts alike. The book will also be useful...

Misonidazole-glutathione conjugates in CHO cells

International Nuclear Information System (INIS)

Varghese, A.J.; Whitmore, G.F.

1984-01-01

Misonidazole, after reduction to the hydroxylamine derivative, reacts with glutathione (GSH) under physiological conditions. The reaction product has been identified as a mixture of two isomeric conjugates. When water soluble extracts of CHO cells exposed to misonidazole under hypoxic conditions are subjected to HPLC analysis, misonidazole derivatives, having the same chromatographic properties as the GSH-MISO conjugates, were detected. When CHO cells were incubated with misonidazole in the presence of added GSH, a substantial increase in the amount of the conjugate was detected. When extracts of CHO cells exposed to misonidazole under hypoxia were subsequently exposed to GSH, an increased formation of the conjugate was observed. A rearrangement product of the hydroxylamine derivative of misonidazole is postulated as the reactive intermediate responsible for the formation of the conjugate

Modelling conjugation with stochastic differential equations

DEFF Research Database (Denmark)

Philipsen, Kirsten Riber; Christiansen, Lasse Engbo; Hasman, Henrik

2010-01-01

Enterococcus faecium strains in a rich exhaustible media. The model contains a new expression for a substrate dependent conjugation rate. A maximum likelihood based method is used to estimate the model parameters. Different models including different noise structure for the system and observations are compared......Conjugation is an important mechanism involved in the transfer of resistance between bacteria. In this article a stochastic differential equation based model consisting of a continuous time state equation and a discrete time measurement equation is introduced to model growth and conjugation of two...... using a likelihood-ratio test and Akaike's information criterion. Experiments indicating conjugation on the agar plates selecting for transconjugants motivates the introduction of an extended model, for which conjugation on the agar plate is described in the measurement equation. This model is compared...

Poly(2-oxazoline)-Antibiotic Conjugates with Penicillins.

Science.gov (United States)

Schmidt, Martin; Bast, Livia K; Lanfer, Franziska; Richter, Lena; Hennes, Elisabeth; Seymen, Rana; Krumm, Christian; Tiller, Joerg C

2017-09-20

The conjugation of antibiotics with polymers is rarely done, but it might be a promising alternative to low-molecular-weight derivatization. The two penicillins penicillin G (PenG) and penicillin V (PenV) were attached to the end groups of different water-soluble poly(2-oxazoline)s (POx) via their carboxylic acid function. This ester group was shown to be more stable against hydrolysis than the β-lactam ring of the penicillins. The conjugates are still antimicrobially active and up to 20 times more stable against penicillinase catalyzed hydrolysis. The antibiotic activity of the conjugates against Staphylococcus aureus in the presence of penicillinase is up to 350 times higher compared with the free antibiotics. Conjugates with a second antimicrobial function, a dodecyltrimethylammonium group (DDA-X), at the starting end of the PenG and PenV POx conjugates are more antimicrobially active than the conjugates without DDA-X and show high activity in the presence of penicillinase. For example, the conjugates DDA-X-PEtOx-PenG and DDA-X-PEtOx-PenV are 200 to 350 times more active against S. aureus in the presence of penicillinase and almost as effective as the penicillinase stable cloxacollin (Clox) under these conditions. These conjugates show even greater activity compared to cloxacollin without this enzyme present. Further, both conjugates kill Escherichia coli more effectively than PenG and Clox.

A gradient-based method for segmenting FDG-PET images: methodology and validation

International Nuclear Information System (INIS)

Geets, Xavier; Lee, John A.; Gregoire, Vincent; Bol, Anne; Lonneux, Max

2007-01-01

A new gradient-based method for segmenting FDG-PET images is described and validated. The proposed method relies on the watershed transform and hierarchical cluster analysis. To allow a better estimation of the gradient intensity, iteratively reconstructed images were first denoised and deblurred with an edge-preserving filter and a constrained iterative deconvolution algorithm. Validation was first performed on computer-generated 3D phantoms containing spheres, then on a real cylindrical Lucite phantom containing spheres of different volumes ranging from 2.1 to 92.9 ml. Moreover, laryngeal tumours from seven patients were segmented on PET images acquired before laryngectomy by the gradient-based method and the thresholding method based on the source-to-background ratio developed by Daisne (Radiother Oncol 2003;69:247-50). For the spheres, the calculated volumes and radii were compared with the known values; for laryngeal tumours, the volumes were compared with the macroscopic specimens. Volume mismatches were also analysed. On computer-generated phantoms, the deconvolution algorithm decreased the mis-estimate of volumes and radii. For the Lucite phantom, the gradient-based method led to a slight underestimation of sphere volumes (by 10-20%), corresponding to negligible radius differences (0.5-1.1 mm); for laryngeal tumours, the segmented volumes by the gradient-based method agreed with those delineated on the macroscopic specimens, whereas the threshold-based method overestimated the true volume by 68% (p = 0.014). Lastly, macroscopic laryngeal specimens were totally encompassed by neither the threshold-based nor the gradient-based volumes. The gradient-based segmentation method applied on denoised and deblurred images proved to be more accurate than the source-to-background ratio method. (orig.)

On operators of the ghost number and conjugation in the BRST quantization formalism

International Nuclear Information System (INIS)

Azizov, T.Ya.; Khoruzhij, S.S.

1989-01-01

Detailed and rigorous study is made of operators of the ghost number Q c and ghost conjugation U c which are operators in Krein spaces arising in the BRST quantization formalism for constrained dynamical systems. A number of conditions are obtained which guarantee that Q c is well-defined and J-symmetric. It is shown that properties of Q c are related to the following geometrical problem: to find conditions under which a pair of lineals in the Krein space can be made neutral by the appropriate choice of J-metrics. The complete solution of this problem is given. Whole series of examples is constructed which demonstrate the connections between properties of Q c and geometry of its spectral subspaces

Gradient-based methods for production optimization of oil reservoirs

Energy Technology Data Exchange (ETDEWEB)

Suwartadi, Eka

2012-07-01

Production optimization for water flooding in the secondary phase of oil recovery is the main topic in this thesis. The emphasis has been on numerical optimization algorithms, tested on case examples using simple hypothetical oil reservoirs. Gradientbased optimization, which utilizes adjoint-based gradient computation, is used to solve the optimization problems. The first contribution of this thesis is to address output constraint problems. These kinds of constraints are natural in production optimization. Limiting total water production and water cut at producer wells are examples of such constraints. To maintain the feasibility of an optimization solution, a Lagrangian barrier method is proposed to handle the output constraints. This method incorporates the output constraints into the objective function, thus avoiding additional computations for the constraints gradient (Jacobian) which may be detrimental to the efficiency of the adjoint method. The second contribution is the study of the use of second-order adjoint-gradient information for production optimization. In order to speedup convergence rate in the optimization, one usually uses quasi-Newton approaches such as BFGS and SR1 methods. These methods compute an approximation of the inverse of the Hessian matrix given the first-order gradient from the adjoint method. The methods may not give significant speedup if the Hessian is ill-conditioned. We have developed and implemented the Hessian matrix computation using the adjoint method. Due to high computational cost of the Newton method itself, we instead compute the Hessian-timesvector product which is used in a conjugate gradient algorithm. Finally, the last contribution of this thesis is on surrogate optimization for water flooding in the presence of the output constraints. Two kinds of model order reduction techniques are applied to build surrogate models. These are proper orthogonal decomposition (POD) and the discrete empirical interpolation method (DEIM

Conjugate observations of electromagnetic ion cyclotron waves associated with traveling convection vortex events

Science.gov (United States)

Kim, Hyomin; Clauer, C. Robert; Gerrard, Andrew J.; Engebretson, Mark J.; Hartinger, Michael D.; Lessard, Marc R.; Matzka, Jürgen; Sibeck, David G.; Singer, Howard J.; Stolle, Claudia; Weimer, Daniel R.; Xu, Zhonghua

2017-07-01

We report on simultaneous observations of electromagnetic ion cyclotron (EMIC) waves associated with traveling convection vortex (TCV) events caused by transient solar wind dynamic pressure (Pd) impulse events. The Time History of Events and Macroscale Interactions during Substorms (THEMIS) spacecraft located near the magnetopause observed radial fluctuations of the magnetopause, and the GOES spacecraft measured sudden compressions of the magnetosphere in response to sudden increases in Pd. During the transient events, EMIC waves were observed by interhemispheric conjugate ground-based magnetometer arrays as well as the GOES spacecraft. The spectral structures of the waves appear to be well correlated with the fluctuating motion of the magnetopause, showing compression-associated wave generation. In addition, the wave features are remarkably similar in conjugate hemispheres in terms of bandwidth, quasiperiodic wave power modulation, and polarization. Proton precipitation was also observed by the DMSP spacecraft during the wave events, from which the wave source region is estimated to be 72°-74° in magnetic latitude, consistent with the TCV center. The confluence of space-borne and ground instruments including the interhemispheric, high-latitude, fluxgate/induction coil magnetometer array allows us to constrain the EMIC source region while also confirming the relationship between EMIC waves and the TCV current system.

Preparation, structural analysis and bioactivity of ribonuclease A-albumin conjugate: tetra-conjugation or PEG as the linker.

Science.gov (United States)

Li, Chunju; Lin, Qixun; Wang, Jun; Shen, Lijuan; Ma, Guanghui; Su, Zhiguo; Hu, Tao

2012-12-31

Ribonuclease A (RNase A) is a therapeutic enzyme with cytotoxic action against tumor cells. Its clinical application is limited by the short half-life and insufficient stability. Conjugation of albumin can overcome the limitation, whereas dramatically decrease the enzymatic activity of RNase A. Here, three strategies were proposed to prepare the RNase A-bovine serum albumin (BSA) conjugates. R-SMCC-B (a conjugate of four RNase A attached with one BSA) and R-PEG-B (a mono-conjugate) were prepared using Sulfo-SMCC (a short bifunctional linker) and mal-PEG-NHS (a bifunctional PEG), respectively. Mal-PEG-NHS and hexadecylamine (HDA) were used to prepare the mono-conjugate, R-HDA-B, where HDA was adopted to bind BSA. The PEG linker can elongate the proximity between RNase A and BSA. In contrast, four RNase A were closely located on BSA in R-SMCC-B. R-SMCC-B showed the lowest K(m) and the highest relative enzymatic activity and k(cat)/K(m) in the three conjugates. Presumably, the tetravalent interaction of RNase A in R-SMCC-B can increase the binding affinity to its substrate. In addition, the slow release of BSA from R-HDA-B may increase the enzymatic activity of R-HDA-B. Our study is expected to provide strategies to develop protein-albumin conjugate with high therapeutic potential. Copyright © 2012 Elsevier B.V. All rights reserved.

Chemical de-conjugation for investigating the stability of small molecule drugs in antibody-drug conjugates.

Science.gov (United States)

Chen, Tao; Su, Dian; Gruenhagen, Jason; Gu, Christine; Li, Yi; Yehl, Peter; Chetwyn, Nik P; Medley, Colin D

2016-01-05

Antibody-drug conjugates (ADCs) offer new therapeutic options for advanced cancer patients through precision killing with fewer side effects. The stability and efficacy of ADCs are closely related, emphasizing the urgency and importance of gaining a comprehensive understanding of ADC stability. In this work, a chemical de-conjugation approach was developed to investigate the in-situ stability of the small molecule drug while it is conjugated to the antibody. This method involves chemical-mediated release of the small molecule drug from the ADC and subsequent characterization of the released small molecule drug by HPLC. The feasibility of this technique was demonstrated utilizing a model ADC containing a disulfide linker that is sensitive to the reducing environment within cancer cells. Five reducing agents were screened for use in de-conjugation; tris(2-carboxyethyl) phosphine (TCEP) was selected for further optimization due to its high efficiency and clean impurity profile. The optimized de-conjugation assay was shown to have excellent specificity and precision. More importantly, it was shown to be stability indicating, enabling the identification and quantification of the small molecule drug and its degradation products under different formulation pHs and storage temperatures. In summary, the chemical de-conjugation strategy demonstrated here offers a powerful tool to assess the in-situ stability of small molecule drugs on ADCs and the resulting information will shed light on ADC formulation/process development and storage condition selection. Copyright © 2015 Elsevier B.V. All rights reserved.

Photoluminescence in conjugated polymers

International Nuclear Information System (INIS)

Furst, J.E.; Laugesen, R.; Dastoor, P.; McNeill, C.

2002-01-01

Full text: Conjugated polymers combine the electronic and optical properties of semiconductors with the processability of polymers. They contain a sequence of alternate single and double carbon bonds so that the overlap of unhybridised p z orbitals creates a delocalised ρ system which gives semiconducting properties with p-bonding (valence) and p* -antibonding (conduction) bands. Photoluminesence (PL) in conjugated polymers results from the radiative decay of singlet excitons confined to a single chain. The present work is the first in a series of studies in our laboratory that will characterize the optical properties of conjugated polymers. The experiment involves the illumination of thin films of conjugated polymer with UV light (I=360 nm) and observing the subsequent fluorescence using a custom-built, fluorescence spectrometer. Photoluminesence spectra provide basic information about the structure of the polymer film. A typical spectrum is shown in the accompanying figure. The position of the first peak is related to the polymer chain length and resolved multiple vibronic peaks are an indication of film structure and morphology. We will also present results related to the optical degradation of these materials when exposed to air and UV light

Bio-Conjugates for Nanoscale Applications

DEFF Research Database (Denmark)

Villadsen, Klaus

Bio-conjugates for Nanoscale Applications is the title of this thesis, which covers three different projects in chemical bio-conjugation research, namely synthesis and applications of: Lipidated fluorescent peptides, carbohydrate oxime-azide linkers and N-aryl O-R2 oxyamine derivatives. Lipidated...

Eigen-Gradients for Traffic Sign Recognition

Directory of Open Access Journals (Sweden)

Sheila Esmeralda Gonzalez-Reyna

2013-01-01

Full Text Available Traffic sign detection and recognition systems include a variety of applications like autonomous driving, road sign inventory, and driver support systems. Machine learning algorithms provide useful tools for traffic sign identification tasks. However, classification algorithms depend on the preprocessing stage to obtain high accuracy rates. This paper proposes a road sign characterization method based on oriented gradient maps and the Karhunen-Loeve transform in order to improve classification performance. Dimensionality reduction may be important for portable applications on resource constrained devices like FPGAs; therefore, our approach focuses on achieving a good classification accuracy by using a reduced amount of attributes compared to some state-of-the-art methods. The proposed method was tested using German Traffic Sign Recognition Benchmark, reaching a dimensionality reduction of 99.3% and a classification accuracy of 95.9% with a Multi-Layer Perceptron.

Interplay of alternative conjugated pathways and steric interactions on the electronic and optical properties of donor-acceptor conjugated polymers

KAUST Repository

Lima, Igo T.; Risko, Chad; Aziz, Saadullah Gary; Da Silva Filho, Demé trio A Da Silva; Bredas, Jean-Luc

2014-01-01

Donor-acceptor π-conjugated copolymers are of interest for a wide range of electronic applications, including field-effect transistors and solar cells. Here, we present a density functional theory (DFT) study of the impact of varying the conjugation pathway on the geometric, electronic, and optical properties of donor-acceptor systems. We consider both linear ("in series"), traditional conjugation among the donor-acceptor moieties versus structures where the acceptor units are appended orthogonally to the linear, donor-only conjugated backbone. Long-range-corrected hybrid functionals are used in the investigation with the values of the tuned long-range separation parameters providing an estimate of the extent of conjugation as a function of the oligomer architecture. Considerable differences in the electronic and optical properties are determined as a function of the nature of the conjugation pathway, features that should be taken into account in the design of donor-acceptor copolymers.

Organometallic B12-DNA conjugate

DEFF Research Database (Denmark)

Hunger, Miriam; Mutti, Elena; Rieder, Alexander

2014-01-01

Design, synthesis, and structural characterization of a B12-octadecanucleotide are presented herein, a new organometallic B12-DNA conjugate. In such covalent conjugates, the natural B12 moiety may be a versatile vector for controlled in vivo delivery of oligonucleotides to cellular targets in hum...

The Conjugate Acid-Base Chart.

Science.gov (United States)

Treptow, Richard S.

1986-01-01

Discusses the difficulties that beginning chemistry students have in understanding acid-base chemistry. Describes the use of conjugate acid-base charts in helping students visualize the conjugate relationship. Addresses chart construction, metal ions, buffers and pH titrations, and the organic functional groups and nonaqueous solvents. (TW)

A Constrained Algorithm Based NMFα for Image Representation

Directory of Open Access Journals (Sweden)

Chenxue Yang

2014-01-01

Full Text Available Nonnegative matrix factorization (NMF is a useful tool in learning a basic representation of image data. However, its performance and applicability in real scenarios are limited because of the lack of image information. In this paper, we propose a constrained matrix decomposition algorithm for image representation which contains parameters associated with the characteristics of image data sets. Particularly, we impose label information as additional hard constraints to the α-divergence-NMF unsupervised learning algorithm. The resulted algorithm is derived by using Karush-Kuhn-Tucker (KKT conditions as well as the projected gradient and its monotonic local convergence is proved by using auxiliary functions. In addition, we provide a method to select the parameters to our semisupervised matrix decomposition algorithm in the experiment. Compared with the state-of-the-art approaches, our method with the parameters has the best classification accuracy on three image data sets.

REVIEW ARTICLE Conjugated Hyperbilirubinaemia in Early Infancy ...

African Journals Online (AJOL)

REVIEW ARTICLE Conjugated Hyperbilirubinaemia in Early Infancy. AOK Johnson. Abstract. Conjugated hyperbilirubinaemia exists when the conjugated serum bilirubin level is more than 2 mg/dl or more than 20 per cent of the total serum bilirubin. It is always pathological in early infancy. The causes are many and diverse ...

Application of optical phase conjugation to plasma diagnostics (invited)

International Nuclear Information System (INIS)

Jahoda, F.C.; Anderson, B.T.; Forman, P.R.; Weber, P.G.

1985-01-01

Several possibilities for plasma diagnostics provided by optical phase conjugation and, in particular, self-pumped phase conjugation in barium titanate (BaTiO 3 ) are discussed. These include placing a plasma within a dye laser cavity equipped with a phase conjugate mirror for intracavity absorption measurements, time differential refractometry with high spatial resolution, and simplified real-time holographic interferometry. The principles of phase conjugation with particular reference to photorefractive media and the special advantages of self-pumped phase conjugation are reviewed prior to the discussion of the applications. Distinctions are made in the applications between those for which photorefractive conjugators are essential and those for which they only offer experimental simplification relative to other types of phase conjugators

Self-assembly of pi-conjugated peptides in aqueous environments leading to energy-transporting bioelectronic nanostructures

Energy Technology Data Exchange (ETDEWEB)

Tavor, John [Johns Hopkins Univ., Baltimore, MD (United States)

2016-12-06

The realization of new supramolecular pi-conjugated organic structures inspired and driven by peptide-based self-assembly will offer a new approach to interface with the biotic environment in a way that will help to meet many DOE-recognized grand challenges. Previously, we developed pi-conjugated peptides that undergo supramolecular self-assembly into one-dimensional (1-D) organic electronic nanomaterials under benign aqueous conditions. The intermolecular interactions among the pi-conjugated organic segments within these nanomaterials lead to defined perturbations of their optoelectronic properties and yield nanoscale conduits that support energy transport within individual nanostructures and throughout bulk macroscopic collections of nanomaterials. Our objectives for future research are to construct and study biomimetic electronic materials for energy-related technology optimized for harsher non-biological environments where peptide-driven self-assembly enhances pi-stacking within nanostructured biomaterials, as detailed in the following specific tasks: (1) synthesis and detailed optoelectronic characterization of new pi-electron units to embed within homogeneous self assembling peptides, (2) molecular and data-driven modeling of the nanomaterial aggregates and their higher-order assemblies, and (3) development of new hierarchical assembly paradigms to organize multiple electronic subunits within the nanomaterials leading to heterogeneous electronic properties (i.e. gradients and localized electric fields). These intertwined research tasks will lead to the continued development and fundamental mechanistic understanding of a powerful bioinspired materials set capable of making connections between nanoscale electronic materials and macroscopic bulk interfaces, be they those of a cell, a protein or a device.

Nonnegative least-squares image deblurring: improved gradient projection approaches

Science.gov (United States)

Benvenuto, F.; Zanella, R.; Zanni, L.; Bertero, M.

2010-02-01

The least-squares approach to image deblurring leads to an ill-posed problem. The addition of the nonnegativity constraint, when appropriate, does not provide regularization, even if, as far as we know, a thorough investigation of the ill-posedness of the resulting constrained least-squares problem has still to be done. Iterative methods, converging to nonnegative least-squares solutions, have been proposed. Some of them have the 'semi-convergence' property, i.e. early stopping of the iteration provides 'regularized' solutions. In this paper we consider two of these methods: the projected Landweber (PL) method and the iterative image space reconstruction algorithm (ISRA). Even if they work well in many instances, they are not frequently used in practice because, in general, they require a large number of iterations before providing a sensible solution. Therefore, the main purpose of this paper is to refresh these methods by increasing their efficiency. Starting from the remark that PL and ISRA require only the computation of the gradient of the functional, we propose the application to these algorithms of special acceleration techniques that have been recently developed in the area of the gradient methods. In particular, we propose the application of efficient step-length selection rules and line-search strategies. Moreover, remarking that ISRA is a scaled gradient algorithm, we evaluate its behaviour in comparison with a recent scaled gradient projection (SGP) method for image deblurring. Numerical experiments demonstrate that the accelerated methods still exhibit the semi-convergence property, with a considerable gain both in the number of iterations and in the computational time; in particular, SGP appears definitely the most efficient one.

Tune-stabilized, non-scaling, fixed-field, alternating gradient accelerator

Science.gov (United States)

Johnstone, Carol J [Warrenville, IL

2011-02-01

A FFAG is a particle accelerator having turning magnets with a linear field gradient for confinement and a large edge angle to compensate for acceleration. FODO cells contain focus magnets and defocus magnets that are specified by a number of parameters. A set of seven equations, called the FFAG equations relate the parameters to one another. A set of constraints, call the FFAG constraints, constrain the FFAG equations. Selecting a few parameters, such as injection momentum, extraction momentum, and drift distance reduces the number of unknown parameters to seven. Seven equations with seven unknowns can be solved to yield the values for all the parameters and to thereby fully specify a FFAG.

Methotrexate and epirubicin conjugates as potential antitumor drugs

Directory of Open Access Journals (Sweden)

Szymon Wojciech Kmiecik

2017-07-01

Full Text Available Introduction: The use of hybrid molecules has become one of the most significant approaches in new cytotoxic drug design. This study describes synthesis and characterization of conjugates consisting of two well-known and characterized chemotherapeutic agents: methotrexate (MTX and epirubicin (EPR. The synthesized conjugates combine two significant anticancer strategies: combinatory therapy and targeted therapy. These two drugs were chosen because they have different mechanisms of action, which can increase the anticancer effect of the obtained conjugates. MTX, which is a folic acid analog, has high cytotoxic properties and can serve as a targeting moiety that can reach folate receptors (FRs overexpresing tumor cells. Combination of nonselective drugs such as EPR with MTX can increase the selectivity of the obtained conjugates, while maintaining the high cytotoxic properties.Materials and methods: Conjugates were purified by RP-HPLC and the structure was investigated by MS and MS/MS methods. The effect of the conjugates on proliferation of LoVo, LoVo/Dx, MCF-7 and MV-4-11 human cancer cell lines was determined by SRB or MTT assay.Results: The conjugation reaction results in the formation of monosubstituted (α, γ and disubstituted MTX derivatives. In vitro proliferation data demonstrate that the conjugates synthesized in our study show lower cytotoxic properties than both chemotherapeutics used alone.Discussion: Epirubicin cytotoxicity was not observed in obtained conjugates. Effective drugs release after internalization needs further investigation.

Preparation of nanocrystals and nanocomposites of nanocrystal-conjugated polymer, and their photophysical properties in confined geometries

Energy Technology Data Exchange (ETDEWEB)

Xu, Jun [Iowa State Univ., Ames, IA (United States)

2007-01-01

Semiconductors nanocrystals (NCs), also called quantum dots (QDs), have attracted tremendous interest over the past decade in the fields of physics, chemistry, and engineering. Due to the quantum-confined nature of QDs, the variation of particle size provides continuous and predictable changes in fluorescence emission. On the other hand, conjugated polymers (CPs) have been extensively studied for two decades due to their semiconductor-like optical and electronic properties. The electron and energy transfer between NCs and CPs occur in solar cells and light emitting diodes (LEDs), respectively. Placing CPs in direct contact with a NC (i.e., preparing NC-CP nanocomposites) carries advantage over cases where NC aggregation dominates. Such NC-CP nanocomposites possess a well-defined interface that significantly promotes the charge or energy transfer between these two components. However, very few studies have centered on such direct integration. We prepared NCs and NC-CP nanocomposites based on heck coupling and investigated the energy and charge transfer between semiconductor NCs (i.e., CdSe QDs), CPs (i.e., poly(3-hexyl thiophene) (P3HT)) in the nanocomposites in confined geometries. Two novel strategies were used to confine NC and/or NC-CP nanocomposites: (a) directly immobilizing nanohybrids, QDs and nanorods in nanoscopic porous alumina membrane (PAM) , and (b) confining the QDs and CPs in sphere-on-flat geometry to induce self-assembly. While investigating the confinement effect, gradient concentric ring patterns of high regularity form spontaneously simply by allowing a droplet of solution containing either conjugated polymer or semiconductor nanocrystal in a consecutive stick-slip mothion in a confined geometry. Such constrained evaporation can be utilized as a simple, cheap, and robust strategy for self-assembling various materials with easily tailored optical and electronic properties into spatially ordered, two-dimensional patterns. These self

Effects of Conjugate Gradient Methods and Step-Length Formulas on the Multiscale Full Waveform Inversion in Time Domain: Numerical Experiments

Science.gov (United States)

Liu, Youshan; Teng, Jiwen; Xu, Tao; Badal, José; Liu, Qinya; Zhou, Bing

2017-05-01

We carry out full waveform inversion (FWI) in time domain based on an alternative frequency-band selection strategy that allows us to implement the method with success. This strategy aims at decomposing the seismic data within partially overlapped frequency intervals by carrying out a concatenated treatment of the wavelet to largely avoid redundant frequency information to adapt to wavelength or wavenumber coverage. A pertinent numerical test proves the effectiveness of this strategy. Based on this strategy, we comparatively analyze the effects of update parameters for the nonlinear conjugate gradient (CG) method and step-length formulas on the multiscale FWI through several numerical tests. The investigations of up to eight versions of the nonlinear CG method with and without Gaussian white noise make clear that the HS (Hestenes and Stiefel in J Res Natl Bur Stand Sect 5:409-436, 1952), CD (Fletcher in Practical methods of optimization vol. 1: unconstrained optimization, Wiley, New York, 1987), and PRP (Polak and Ribière in Revue Francaise Informat Recherche Opertionelle, 3e Année 16:35-43, 1969; Polyak in USSR Comput Math Math Phys 9:94-112, 1969) versions are more efficient among the eight versions, while the DY (Dai and Yuan in SIAM J Optim 10:177-182, 1999) version always yields inaccurate result, because it overestimates the deeper parts of the model. The application of FWI algorithms using distinct step-length formulas, such as the direct method ( Direct), the parabolic search method ( Search), and the two-point quadratic interpolation method ( Interp), proves that the Interp is more efficient for noise-free data, while the Direct is more efficient for Gaussian white noise data. In contrast, the Search is less efficient because of its slow convergence. In general, the three step-length formulas are robust or partly insensitive to Gaussian white noise and the complexity of the model. When the initial velocity model deviates far from the real model or the

Non-covalent functionalization of single wall carbon nanotubes and graphene by a conjugated polymer

KAUST Repository

Jiwuer, Jilili

2014-07-07

We report first-principles calculations on the binding of poly[(9,9-bis-(6-bromohexylfluorene-2,7-diyl)-co-(benzene-1,4-diyl)] to a (8,0) single wall carbon nanotube (SWCNT) and to graphene. Considering different relative orientations of the subsystems, we find for the generalized gradient approximation a non-binding state, whereas the local density approximation predicts reasonable binding energies. The results coincide after inclusion of van der Waals corrections, which demonstrates a weak interaction between the polymer and SWCNT/graphene, mostly of van der Waals type. Accordingly, the density of states shows essentially no hybridization. The physisorption mechanism explains recent experimental observations and suggests that the conjugated polymer can be used for non-covalent functionalization.

Non-covalent functionalization of single wall carbon nanotubes and graphene by a conjugated polymer

KAUST Repository

Jiwuer, Jilili; Abdurahman, Ayjamal; Gü lseren, Oğuz; Schwingenschlö gl, Udo

2014-01-01

We report first-principles calculations on the binding of poly[(9,9-bis-(6-bromohexylfluorene-2,7-diyl)-co-(benzene-1,4-diyl)] to a (8,0) single wall carbon nanotube (SWCNT) and to graphene. Considering different relative orientations of the subsystems, we find for the generalized gradient approximation a non-binding state, whereas the local density approximation predicts reasonable binding energies. The results coincide after inclusion of van der Waals corrections, which demonstrates a weak interaction between the polymer and SWCNT/graphene, mostly of van der Waals type. Accordingly, the density of states shows essentially no hybridization. The physisorption mechanism explains recent experimental observations and suggests that the conjugated polymer can be used for non-covalent functionalization.

Adaptive Constrained Optimal Control Design for Data-Based Nonlinear Discrete-Time Systems With Critic-Only Structure.

Science.gov (United States)

Luo, Biao; Liu, Derong; Wu, Huai-Ning

2018-06-01

Reinforcement learning has proved to be a powerful tool to solve optimal control problems over the past few years. However, the data-based constrained optimal control problem of nonaffine nonlinear discrete-time systems has rarely been studied yet. To solve this problem, an adaptive optimal control approach is developed by using the value iteration-based Q-learning (VIQL) with the critic-only structure. Most of the existing constrained control methods require the use of a certain performance index and only suit for linear or affine nonlinear systems, which is unreasonable in practice. To overcome this problem, the system transformation is first introduced with the general performance index. Then, the constrained optimal control problem is converted to an unconstrained optimal control problem. By introducing the action-state value function, i.e., Q-function, the VIQL algorithm is proposed to learn the optimal Q-function of the data-based unconstrained optimal control problem. The convergence results of the VIQL algorithm are established with an easy-to-realize initial condition . To implement the VIQL algorithm, the critic-only structure is developed, where only one neural network is required to approximate the Q-function. The converged Q-function obtained from the critic-only VIQL method is employed to design the adaptive constrained optimal controller based on the gradient descent scheme. Finally, the effectiveness of the developed adaptive control method is tested on three examples with computer simulation.

Multivalent peptidic linker enables identification of preferred sites of conjugation for a potent thialanstatin antibody drug conjugate.

Directory of Open Access Journals (Sweden)

Sujiet Puthenveetil

Full Text Available Antibody drug conjugates (ADCs are no longer an unknown entity in the field of cancer therapy with the success of marketed ADCs like ADCETRIS and KADCYLA and numerous others advancing through clinical trials. The pursuit of novel cytotoxic payloads beyond the mictotubule inhibitors and DNA damaging agents has led us to the recent discovery of an mRNA splicing inhibitor, thailanstatin, as a potent ADC payload. In our previous work, we observed that the potency of this payload was uniquely tied to the method of conjugation, with lysine conjugates showing much superior potency as compared to cysteine conjugates. However, the ADC field is rapidly shifting towards site-specific ADCs due to their advantages in manufacturability, characterization and safety. In this work we report the identification of a highly efficacious site-specific thailanstatin ADC. The site of conjugation played a critical role on both the in vitro and in vivo potency of these ADCs. During the course of this study, we developed a novel methodology of loading a single site with multiple payloads using an in situ generated multi-drug carrying peptidic linker that allowed us to rapidly screen for optimal conjugation sites. Using this methodology, we were able to identify a double-cysteine mutant ADC delivering four-loaded thailanstatin that was very efficacious in a gastric cancer xenograft model at 3mg/kg and was also shown to be efficacious against T-DM1 resistant and MDR1 overexpressing tumor cell lines.

Multivalent peptidic linker enables identification of preferred sites of conjugation for a potent thialanstatin antibody drug conjugate.

Science.gov (United States)

Puthenveetil, Sujiet; He, Haiyin; Loganzo, Frank; Musto, Sylvia; Teske, Jesse; Green, Michael; Tan, Xingzhi; Hosselet, Christine; Lucas, Judy; Tumey, L Nathan; Sapra, Puja; Subramanyam, Chakrapani; O'Donnell, Christopher J; Graziani, Edmund I

2017-01-01

Antibody drug conjugates (ADCs) are no longer an unknown entity in the field of cancer therapy with the success of marketed ADCs like ADCETRIS and KADCYLA and numerous others advancing through clinical trials. The pursuit of novel cytotoxic payloads beyond the mictotubule inhibitors and DNA damaging agents has led us to the recent discovery of an mRNA splicing inhibitor, thailanstatin, as a potent ADC payload. In our previous work, we observed that the potency of this payload was uniquely tied to the method of conjugation, with lysine conjugates showing much superior potency as compared to cysteine conjugates. However, the ADC field is rapidly shifting towards site-specific ADCs due to their advantages in manufacturability, characterization and safety. In this work we report the identification of a highly efficacious site-specific thailanstatin ADC. The site of conjugation played a critical role on both the in vitro and in vivo potency of these ADCs. During the course of this study, we developed a novel methodology of loading a single site with multiple payloads using an in situ generated multi-drug carrying peptidic linker that allowed us to rapidly screen for optimal conjugation sites. Using this methodology, we were able to identify a double-cysteine mutant ADC delivering four-loaded thailanstatin that was very efficacious in a gastric cancer xenograft model at 3mg/kg and was also shown to be efficacious against T-DM1 resistant and MDR1 overexpressing tumor cell lines.

Formulating viscous hydrodynamics for large velocity gradients

International Nuclear Information System (INIS)

Pratt, Scott

2008-01-01

Viscous corrections to relativistic hydrodynamics, which are usually formulated for small velocity gradients, have recently been extended from Navier-Stokes formulations to a class of treatments based on Israel-Stewart equations. Israel-Stewart treatments, which treat the spatial components of the stress-energy tensor τ ij as dynamical objects, introduce new parameters, such as the relaxation times describing nonequilibrium behavior of the elements τ ij . By considering linear response theory and entropy constraints, we show how the additional parameters are related to fluctuations of τ ij . Furthermore, the Israel-Stewart parameters are analyzed for their ability to provide stable and physical solutions for sound waves. Finally, it is shown how these parameters, which are naturally described by correlation functions in real time, might be constrained by lattice calculations, which are based on path-integral formulations in imaginary time

Isovector pairing in self-conjugate nuclei in a formalism of quartets

International Nuclear Information System (INIS)

Sambataro, M; Sandulescu, N

2014-01-01

The isovector proton-neutron pairing in self-conjugate nuclei is treated in a formalism of quartets. Quartets are four-body correlated structures built from two neutrons and two protons coupled to total isospin T = 0. The ground state of the isovector pairing Hamiltonian is described as a product of quartets. We review both the case in which the quartets are constrained to be all identical and the case in which they are allowed to be distinct from one another. The quality of the two approaches is tested by making comparisons with exact shell model calculations for N = Z nuclei with valence nucleons outside the 16 O, 40 Ca, and 100 Sn cores. We consider both spherical and axially deformed mean fields. Both approaches are found to be very accurate. In the applications to a deformed mean field, in particular, the formalism with distinct quartets gives rise to results which are basically exact

Constrained evolution in numerical relativity

Science.gov (United States)

Anderson, Matthew William

The strongest potential source of gravitational radiation for current and future detectors is the merger of binary black holes. Full numerical simulation of such mergers can provide realistic signal predictions and enhance the probability of detection. Numerical simulation of the Einstein equations, however, is fraught with difficulty. Stability even in static test cases of single black holes has proven elusive. Common to unstable simulations is the growth of constraint violations. This work examines the effect of controlling the growth of constraint violations by solving the constraints periodically during a simulation, an approach called constrained evolution. The effects of constrained evolution are contrasted with the results of unconstrained evolution, evolution where the constraints are not solved during the course of a simulation. Two different formulations of the Einstein equations are examined: the standard ADM formulation and the generalized Frittelli-Reula formulation. In most cases constrained evolution vastly improves the stability of a simulation at minimal computational cost when compared with unconstrained evolution. However, in the more demanding test cases examined, constrained evolution fails to produce simulations with long-term stability in spite of producing improvements in simulation lifetime when compared with unconstrained evolution. Constrained evolution is also examined in conjunction with a wide variety of promising numerical techniques, including mesh refinement and overlapping Cartesian and spherical computational grids. Constrained evolution in boosted black hole spacetimes is investigated using overlapping grids. Constrained evolution proves to be central to the host of innovations required in carrying out such intensive simulations.

In Vitro Evaluation of Third Generation PAMAM Dendrimer Conjugates

Directory of Open Access Journals (Sweden)

Mohammad Najlah

2017-10-01

Full Text Available The present study compares the use of high generation G3 and low generation G0 Polyamidoamine (PAMAM dendrimers as drug carriers of naproxen (NAP, a poorly water soluble drug. Naproxen was conjugated to G3 in different ratios and to G0 in a 1:1 ratio via a diethylene glycol linker. A lauroyl chain (L, a lipophilic permeability enhancer, was attached to G3 and G0 prodrugs. The G3 and G0 conjugates were more hydrophilic than naproxen as evaluated by the measurement of partitioning between 1-octanol and a phosphate buffer at pH 7.4 and pH 1.2. The unmodified surface PAMAM-NAP conjugates showed significant solubility enhancements of NAP at pH 1.2; however, with the number of NAP conjugated to G3, this was limited to 10 molecules. The lactate dehydrogenase (LDH assay indicated that the G3 dendrimer conjugates had a concentration dependent toxicity towards Caco-2 cells. Attaching naproxen to the surface of the dendrimer increased the IC50 of the resulting prodrugs towards Caco-2 cells. The lauroyl G3 conjugates showed the highest toxicity amongst the PAMAM dendrimer conjugates investigated and were significantly more toxic than the lauroyl-G0-naproxen conjugates. The permeability of naproxen across monolayers of Caco-2 cells was significantly increased by its conjugation to either G3 or G0 PAMAM dendrimers. Lauroyl-G0 conjugates displayed considerably lower cytotoxicity than G3 conjugates and may be preferable for use as a drug carrier for low soluble drugs such as naproxen.

CONJUGATED BLOCK-COPOLYMERS FOR ELECTROLUMINESCENT DIODES

NARCIS (Netherlands)

Hilberer, A; Gill, R.E; Herrema, J.K; Malliaras, G.G; Wildeman, J.; Hadziioannou, G

In this article we review results obtained in our laboratory on the design and study of new light-emitting polymers. We are interested in the synthesis and characterisation of block copolymers with regularly alternating conjugated and non conjugated sequences. The blocks giving rise to luminescence

Tetrafullerene conjugates for all-organic photovoltaics

NARCIS (Netherlands)

Fernández, G.; Sánchez, L.; Veldman, D.; Wienk, M.M.; Atienza, C.M.; Guldi, D.M.; Janssen, R.A.J.; Martin, N.

2008-01-01

The synthesis of two new tetrafullerene nanoconjugates in which four C60 units are covalently connected through different -conjugated oligomers (oligo(p-phenylene ethynylene) and oligo(p-phenylene vinylene)) is described. The photovoltaic (PV) response of these C60-based conjugates was evaluated by

Novel Aflatoxin Derivatives and Protein Conjugates

Directory of Open Access Journals (Sweden)

Reinhard Niessner

2007-03-01

Full Text Available Aflatoxins, a group of structurally related mycotoxins, are well known for their toxic and carcinogenic effects in humans and animals. Aflatoxin derivatives and protein conjugates are needed for diverse analytical applications. This work describes a reliable and fast synthesis of novel aflatoxin derivatives, purification by preparative HPLC and characterisation by ESI-MS and one- and two-dimensional NMR. Novel aflatoxin bovine serum albumin conjugates were prepared and characterised by UV absorption and MALDI-MS. These aflatoxin protein conjugates are potentially interesting as immunogens for the generation of aflatoxin selective antibodies with novel specificities.

Structure Property Relationships in Organic Conjugated Systems

OpenAIRE

O'Neill, Luke

2008-01-01

A series of pi(п) conjugated oligomers containing 1 to 6 monomer units were studied by absorption and photoluminescence spectroscopies. The results are discussed and examined with regard to the variation of the optical properties with the increase of effective conjugation length. It was found that there was a linear relationship between the positioning of the absorption and photoluminescence maxima plotted against inverse conjugation length. The relationships are in good agreement with the si...

The influence of ALN-Al gradient material gradient index on ballistic performance

International Nuclear Information System (INIS)

Wang Youcong; Liu Qiwen; Li Yao; Shen Qiang

2013-01-01

Ballistic performance of the gradient material is superior to laminated material, and gradient materials have different gradient types. Using ls-dyna to simulate the ballistic performance of ALN-AL gradient target plates which contain three gradient index (b = 1, b = 0.5, b = 2). Through Hopkinson bar numerical simulation to the target plate materials, we obtained the reflection stress wave and transmission stress wave state of gradient material to get the best gradient index. The internal stress state of gradient material is simulated by amplification processing of the target plate model. When the gradient index b is equal to 1, the gradient target plate is best of all.

Sources and Bioactive Properties of Conjugated Dietary Fatty Acids.

Science.gov (United States)

Hennessy, Alan A; Ross, Paul R; Fitzgerald, Gerald F; Stanton, Catherine

2016-04-01

The group of conjugated fatty acids known as conjugated linoleic acid (CLA) isomers have been extensively studied with regard to their bioactive potential in treating some of the most prominent human health malignancies. However, CLA isomers are not the only group of potentially bioactive conjugated fatty acids currently undergoing study. In this regard, isomers of conjugated α-linolenic acid, conjugated nonadecadienoic acid and conjugated eicosapentaenoic acid, to name but a few, have undergone experimental assessment. These studies have indicated many of these conjugated fatty acid isomers commonly possess anti-carcinogenic, anti-adipogenic, anti-inflammatory and immune modulating properties, a number of which will be discussed in this review. The mechanisms through which these bioactivities are mediated have not yet been fully elucidated. However, existing evidence indicates that these fatty acids may play a role in modulating the expression of several oncogenes, cell cycle regulators, and genes associated with energy metabolism. Despite such bioactive potential, interest in these conjugated fatty acids has remained low relative to the CLA isomers. This may be partly attributed to the relatively recent emergence of these fatty acids as bioactives, but also due to a lack of awareness regarding sources from which they can be produced. In this review, we will also highlight the common sources of these conjugated fatty acids, including plants, algae, microbes and chemosynthesis.

Preparation and immunological properties of procaine-protein conjugates

International Nuclear Information System (INIS)

Liakopoulou, A.

1981-01-01

Procaine was conjugated to BSA and rat and rabbit Gf using the carbodiimide method and 14 C-procaine as tracer. The composition of the conjugates could be varied depending on the time of incubation and the concentration of procaine in the reaction mixtures. Procaine-BSA conjugates were soluble in water or saline. However, procaine conjugates to rat or rabbit Gf were not readily soluble in saline. These conjugates were good for immunization purposes, but it was cumbersome to work with them when clear solutions were needed, as in the immunochemical procedures used in this study. The immunological properties of the conjugates were studied in rats and rabbits. Rats responded with production of IgGa and precipitating antibodies to the procaine group, but IgE antibodies to the immunogen could not be detected. Furthermore, precipitating antibodies towards the procaine group were raised in rabbits. When BSA was the protein carrier, antibodies to the carrier molecule were also detected in both rats and rabbits. The conjugates of procaine to rat or rabbit Gf did not elicit antibody response to the carrier molecule when used in the homologous species. Hapten inhibition studies suggested that, in the rabbit, antibodies were also produced with specificity directed towards the molecular configuration of the hapten-carrier bond. (author)

IRDye78 Conjugates for Near-Infrared Fluorescence Imaging

Directory of Open Access Journals (Sweden)

Atif Zaheer

2002-10-01

Full Text Available The detection of human malignancies by near-infrared (NIR fluorescence will require the conjugation of cancer-specific ligands to NIR fluorophores that have optimal photoproperties and pharmacokinetics. IRDye78, a tetra-sulfonated heptamethine indocyanine NIR fluorophore, meets most of the criteria for an in vivo imaging agent, and is available as an N-hydroxysuccinimide ester for conjugation to low-molecular-weight ligands. However, IRDye78 has a high charge-to-mass ratio, complicating purification of conjugates. It also has a potentially labile linkage between fluorophore and ligand. We have developed an ion-pairing purification strategy for IRDye78 that can be performed with a standard C18 column under neutral conditions, thus preserving the stability of fluorophore, ligand, and conjugate. By employing parallel evaporative light scatter and absorbance detectors, all reactants and products are identified, and conjugate purity is maximized. We describe reversible and irreversible conversions of IRDye78 that can occur during sample purification, and describe methods for preserving conjugate stability. Using seven ligands, spanning several classes of small molecules and peptides (neutral, charged, and/or hydrophobic, we illustrate the robustness of these methods, and confirm that IRDye78 conjugates so purified retain bioactivity and permit NIR fluorescence imaging of specific targets.

M*/L gradients driven by IMF variation: large impact on dynamical stellar mass estimates

Science.gov (United States)

Bernardi, M.; Sheth, R. K.; Dominguez-Sanchez, H.; Fischer, J.-L.; Chae, K.-H.; Huertas-Company, M.; Shankar, F.

2018-06-01

Within a galaxy the stellar mass-to-light ratio ϒ* is not constant. Recent studies of spatially resolved kinematics of nearby early-type galaxies suggest that allowing for a variable initial mass function (IMF) returns significantly larger ϒ* gradients than if the IMF is held fixed. We show that ignoring such IMF-driven ϒ* gradients can have dramatic effect on dynamical (M_*^dyn), though stellar population (M_*^SP) based estimates of early-type galaxy stellar masses are also affected. This is because M_*^dyn is usually calibrated using the velocity dispersion measured in the central regions (e.g. Re/8) where stars are expected to dominate the mass (i.e. the dark matter fraction is small). On the other hand, M_*^SP is often computed from larger apertures (e.g. using a mean ϒ* estimated from colours). If ϒ* is greater in the central regions, then ignoring the gradient can overestimate M_*^dyn by as much as a factor of two for the most massive galaxies. Large ϒ*-gradients have four main consequences: First, M_*^dyn cannot be estimated independently of stellar population synthesis models. Secondly, if there is a lower limit to ϒ* and gradients are unknown, then requiring M_*^dyn=M_*^SP constrains them. Thirdly, if gradients are stronger in more massive galaxies, then accounting for this reduces the slope of the correlation between M_*^dyn/M_*^SP of a galaxy with its velocity dispersion. In particular, IMF-driven gradients bring M_*^dyn and M_*^SP into agreement, not by shifting M_*^SP upwards by invoking constant bottom-heavy IMFs, as advocated by a number of recent studies, but by revising M_*^dyn estimates in the literature downwards. Fourthly, accounting for ϒ* gradients changes the high-mass slope of the stellar mass function φ (M_*^dyn), and reduces the associated stellar mass density. These conclusions potentially impact estimates of the need for feedback and adiabatic contraction, so our results highlight the importance of measuring ϒ* gradients in

Application of pattern search method to power system security constrained economic dispatch with non-smooth cost function

International Nuclear Information System (INIS)

Al-Othman, A.K.; El-Naggar, K.M.

2008-01-01

Direct search methods are evolutionary algorithms used to solve optimization problems. (DS) methods do not require any information about the gradient of the objective function at hand while searching for an optimum solution. One of such methods is Pattern Search (PS) algorithm. This paper presents a new approach based on a constrained pattern search algorithm to solve a security constrained power system economic dispatch problem (SCED) with non-smooth cost function. Operation of power systems demands a high degree of security to keep the system satisfactorily operating when subjected to disturbances, while and at the same time it is required to pay attention to the economic aspects. Pattern recognition technique is used first to assess dynamic security. Linear classifiers that determine the stability of electric power system are presented and added to other system stability and operational constraints. The problem is formulated as a constrained optimization problem in a way that insures a secure-economic system operation. Pattern search method is then applied to solve the constrained optimization formulation. In particular, the method is tested using three different test systems. Simulation results of the proposed approach are compared with those reported in literature. The outcome is very encouraging and proves that pattern search (PS) is very applicable for solving security constrained power system economic dispatch problem (SCED). In addition, valve-point effect loading and total system losses are considered to further investigate the potential of the PS technique. Based on the results, it can be concluded that the PS has demonstrated ability in handling highly nonlinear discontinuous non-smooth cost function of the SCED. (author)

Gradient waveform synthesis for magnetic propulsion using MRI gradient coils

International Nuclear Information System (INIS)

Han, B H; Lee, S Y; Park, S

2008-01-01

Navigating an untethered micro device in a living subject is of great interest for both diagnostic and therapeutic applications. Magnetic propulsion of an untethered device carrying a magnetic core in it is one of the promising methods to navigate the device. MRI gradients coils are thought to be suitable for navigating the device since they are capable of magnetic propulsion in any direction while providing magnetic resonance images. For precise navigation of the device, especially in the peripheral region of the gradient coils, the concomitant gradient fields, as well as the linear gradient fields in the main magnetic field direction, should be considered in driving the gradient coils. For simple gradient coil configurations, the Maxwell coil in the z-direction and the Golay coil in the x- and y-directions, we have calculated the magnetic force fields, which are not necessarily the same as the conventional linear gradient fields of MRI. Using the calculated magnetic force fields, we have synthesized gradient waveforms to navigate the device along a desired path

Doxorubicin conjugated to D-alpha-tocopheryl polyethylene glycol 1000 succinate (TPGS): conjugation chemistry, characterization, in vitro and in vivo evaluation.

Science.gov (United States)

Cao, Na; Feng, Si-Shen

2008-10-01

To develop a polymer-anticancer drug conjugate, D-alpha-tocopheryl polyethylene glycol 1000 succinate (TPGS) was employed as a carrier of doxorubicin (DOX) to enhance its therapeutic effects and reduce its side effects. Doxorubicin was chemically conjugated to TPGS. The molecular structure, drug loading efficiency, drug release kinetics and stability of the conjugate were characterized. The cellular uptake, intracellular distribution, and cytotoxicity were accessed by using MCF-7 breast cancer cells and C6 glioma cells as in vitro cell model. The conjugate showed higher cellular uptake efficiency and broader distribution within the cells. Judged by IC(50), the conjugate was found 31.8, 69.6, 84.1% more effective with MCF-7 cells and 43.9, 87.7, 42.2% more effective with C6 cells than the parent drug after 24, 48, 72 h culture, respectively. The in vivo pharmacokinetics and biodistribution were investigated after an i.v. administration at 5 mg DOX/kg body weight in rats. Promisingly, 4.5-fold increase in the half-life and 24-fold increase in the area-under-the-curve (AUC) of DOX were achieved for the TPGS-DOX conjugate compared with the free DOX. The drug level in heart, gastric and intestine was significantly reduced, which is an indication of reduced side effects. Our TPGS-DOX conjugate showed great potential to be a prodrug of higher therapeutic effects and fewer side effects than DOX itself.

Quantitative tomography simulations and reconstruction algorithms

International Nuclear Information System (INIS)

Martz, H.E.; Aufderheide, M.B.; Goodman, D.; Schach von Wittenau, A.; Logan, C.; Hall, J.; Jackson, J.; Slone, D.

2000-01-01

X-ray, neutron and proton transmission radiography and computed tomography (CT) are important diagnostic tools that are at the heart of LLNL's effort to meet the goals of the DOE's Advanced Radiography Campaign. This campaign seeks to improve radiographic simulation and analysis so that radiography can be a useful quantitative diagnostic tool for stockpile stewardship. Current radiographic accuracy does not allow satisfactory separation of experimental effects from the true features of an object's tomographically reconstructed image. This can lead to difficult and sometimes incorrect interpretation of the results. By improving our ability to simulate the whole radiographic and CT system, it will be possible to examine the contribution of system components to various experimental effects, with the goal of removing or reducing them. In this project, we are merging this simulation capability with a maximum-likelihood (constrained-conjugate-gradient-CCG) reconstruction technique yielding a physics-based, forward-model image-reconstruction code. In addition, we seek to improve the accuracy of computed tomography from transmission radiographs by studying what physics is needed in the forward model. During FY 2000, an improved version of the LLNL ray-tracing code called HADES has been coupled with a recently developed LLNL CT algorithm known as CCG. The problem of image reconstruction is expressed as a large matrix equation relating a model for the object being reconstructed to its projections (radiographs). Using a constrained-conjugate-gradient search algorithm, a maximum likelihood solution is sought. This search continues until the difference between the input measured radiographs or projections and the simulated or calculated projections is satisfactorily small

Bis-polymer lipid-peptide conjugates and nanoparticles thereof

Energy Technology Data Exchange (ETDEWEB)

Xu, Ting; Dong, He; Shu, Jessica; Dube, Nikhil

2018-04-24

The present invention provides bis-polymer lipid-peptide conjugates containing a hydrophobic block and headgroup containing a helical peptide and two polymer blocks. The conjugates can self-assemble to form helix bundle subunits, which in turn assemble to provide micellar nanocarriers for drug cargos and other agents. Particles containing the conjugates and methods for forming the particles are also disclosed.

Combining Step Gradients and Linear Gradients in Density.

Science.gov (United States)

Kumar, Ashok A; Walz, Jenna A; Gonidec, Mathieu; Mace, Charles R; Whitesides, George M

2015-06-16

Combining aqueous multiphase systems (AMPS) and magnetic levitation (MagLev) provides a method to produce hybrid gradients in apparent density. AMPS—solutions of different polymers, salts, or surfactants that spontaneously separate into immiscible but predominantly aqueous phases—offer thermodynamically stable steps in density that can be tuned by the concentration of solutes. MagLev—the levitation of diamagnetic objects in a paramagnetic fluid within a magnetic field gradient—can be arranged to provide a near-linear gradient in effective density where the height of a levitating object above the surface of the magnet corresponds to its density; the strength of the gradient in effective density can be tuned by the choice of paramagnetic salt and its concentrations and by the strength and gradient in the magnetic field. Including paramagnetic salts (e.g., MnSO4 or MnCl2) in AMPS, and placing them in a magnetic field gradient, enables their use as media for MagLev. The potential to create large steps in density with AMPS allows separations of objects across a range of densities. The gradients produced by MagLev provide resolution over a continuous range of densities. By combining these approaches, mixtures of objects with large differences in density can be separated and analyzed simultaneously. Using MagLev to add an effective gradient in density also enables tuning the range of densities captured at an interface of an AMPS by simply changing the position of the container in the magnetic field. Further, by creating AMPS in which phases have different concentrations of paramagnetic ions, the phases can provide different resolutions in density. These results suggest that combining steps in density with gradients in density can enable new classes of separations based on density.

A New Interpolation Approach for Linearly Constrained Convex Optimization

KAUST Repository

Espinoza, Francisco

2012-08-01

In this thesis we propose a new class of Linearly Constrained Convex Optimization methods based on the use of a generalization of Shepard\\'s interpolation formula. We prove the properties of the surface such as the interpolation property at the boundary of the feasible region and the convergence of the gradient to the null space of the constraints at the boundary. We explore several descent techniques such as steepest descent, two quasi-Newton methods and the Newton\\'s method. Moreover, we implement in the Matlab language several versions of the method, particularly for the case of Quadratic Programming with bounded variables. Finally, we carry out performance tests against Matab Optimization Toolbox methods for convex optimization and implementations of the standard log-barrier and active-set methods. We conclude that the steepest descent technique seems to be the best choice so far for our method and that it is competitive with other standard methods both in performance and empirical growth order.

SPIDER. IV. OPTICAL AND NEAR-INFRARED COLOR GRADIENTS IN EARLY-TYPE GALAXIES: NEW INSIGHT INTO CORRELATIONS WITH GALAXY PROPERTIES

International Nuclear Information System (INIS)

La Barbera, F.; De Carvalho, R. R.; De La Rosa, I. G.; Gal, R. R.; Swindle, R.; Lopes, P. A. A.

2010-01-01

We present an analysis of stellar population gradients in 4546 early-type galaxies (ETGs) with photometry in grizYHJK along with optical spectroscopy. ETGs were selected as bulge-dominated systems, displaying passive spectra within the SDSS fibers. A new approach is described which utilizes color information to constrain age and metallicity gradients. Defining an effective color gradient, ∇ * , which incorporates all of the available color indices, we investigate how ∇ * varies with galaxy mass proxies, i.e., velocity dispersion, stellar (M * ) and dynamical (M dyn ) masses, as well as age, metallicity, and [α/Fe]. ETGs with M dyn larger than 8.5 x 10 10 M sun have increasing age gradients and decreasing metallicity gradients with respect to mass, metallicity, and enhancement. We find that velocity dispersion and [α/Fe] are the main drivers of these correlations. ETGs with 2.5 x 10 10 M sun ≤ M dyn ≤ 8.5 x 10 10 M sun show no correlation of age, metallicity, and color gradients with respect to mass, although color gradients still correlate with stellar population parameters, and these correlations are independent of each other. In both mass regimes, the striking anti-correlation between color gradient and α-enhancement is significant at ∼5σ and results from the fact that metallicity gradient decreases with [α/Fe]. This anti-correlation may reflect the fact that star formation and metallicity enrichment are regulated by the interplay between the energy input from supernovae, and the temperature and pressure of the hot X-ray gas in ETGs. For all mass ranges, positive age gradients are associated with old galaxies (>5-7 Gyr). For galaxies younger than ∼5 Gyr, mostly at low mass, the age gradient tends to be anti-correlated with the Age parameter, with more positive gradients at younger ages.

Conjugated polymer nanoparticles, methods of using, and methods of making

KAUST Repository

Habuchi, Satoshi; Piwonski, Hubert Marek; Michinobu, Tsuyoshi

2017-01-01

Embodiments of the present disclosure provide for conjugated polymer nanoparticle, method of making conjugated polymer nanoparticles, method of using conjugated polymer nanoparticle, polymers, and the like.

Conjugated polymer nanoparticles, methods of using, and methods of making

KAUST Repository

Habuchi, Satoshi

2017-03-16

Embodiments of the present disclosure provide for conjugated polymer nanoparticle, method of making conjugated polymer nanoparticles, method of using conjugated polymer nanoparticle, polymers, and the like.

Bacterial Response to Antibiotic Gradients in a Porous Microfluidic Device

Science.gov (United States)

Deng, J.; Shechtman, L. A.; Sanford, R. A.; Dong, Y.; Werth, C. J.; Fouke, B. W.

2015-12-01

Microorganisms in nature have evolved survival strategies to cope with a wide variety of environmental stresses, including gradients in temperature, pH, substrate availability and aqueous chemistry. Microfluidic devices provide a consistently reliable real-time means to quantitatively measure, control and reproduce the dynamic nature of these stresses. As an example, accelerated adaptation from genetic mutations have been observed in E. coli as it responds to gradients of Ciprofloxacin (Zhang et. al. 2011). However, the mechanisms by which bacteria respond to antibiotic gradients, as well as the effect of changes in how the stressor is applied, have not been systematically studied. In this study, newly designed and fabricated microfluidic devices with porous media have been utilized to determine the chemical stress fields that enhance adaptation and thus to test how E. coli bacterial communities adapt to antibiotic stresses. By applying antibiotic and nutrient into inlet channels adjacent to either side of the porous media inoculated with E. coli, a gradient of antibiotic was formed. Hydrogel barriers were selectively photo-polymerized in between of the inlet channels and the porous media to prevent any undesired convection. Hence, chemical solute can only be transported by diffusion, creating a reproducible antibiotic gradient over the porous media. The bacteria were also constrained by the hydrogel boundary barriers from escaping the porous media. Preliminary results suggest that E. coli moves freely with respect to Ciprofloxacin concentrations. In addition, and unexpectedly, the E. coli colonies exhibit a concentric pulsed growth front radiating away from the point of inoculation within the micromodel ecosystem and pulse over the porous media containing antibiotic. The bacteria at the growth front grow into long filaments (up to 100μm) while the bacteria in the inner concentric area are normal size. We hypothesize that the frontier bacteria, which are first

Human glutathione S-transferase-mediated glutathione conjugation of curcumin and efflux of these conjugates in Caco-2 cells

NARCIS (Netherlands)

Usta, M.; Wortelboer, H.M.; Vervoort, J.J.M.; Boersma, M.G.; Rietjens, I.M.C.M.; Bladeren, van P.J.; Cnubben, N.H.P.

2007-01-01

Curcumin, an alpha,beta-unsaturated carbonyl compound, reacts with glutathione, leading to the formation of two monoglutathionyl curcumin conjugates. In the present study, the structures of both glutathione conjugates of curcumin were identified by LC-MS and one- and two-dimensional H-1 NMR

Selective Covalent Conjugation of Phosphorothioate DNA Oligonucleotides with Streptavidin

Directory of Open Access Journals (Sweden)

Christof M. Niemeyer

2011-08-01

Full Text Available Protein-DNA conjugates have found numerous applications in the field of diagnostics and nanobiotechnology, however, their intrinsic susceptibility to DNA degradation by nucleases represents a major obstacle for many applications. We here report the selective covalent conjugation of the protein streptavidin (STV with phosphorothioate oligonucleotides (psDNA containing a terminal alkylthiolgroup as the chemically addressable linking unit, using a heterobifunctional NHS-/maleimide crosslinker. The psDNA-STV conjugates were synthesized in about 10% isolated yields. We demonstrate that the terminal alkylthiol group selectively reacts with the maleimide while the backbone sulfur atoms are not engaged in chemical conjugation. The novel psDNA-STV conjugates retain their binding capabilities for both biotinylated macromolecules and the complementary nucleic acid. Moreover, the psDNA-STV conjugate retained its binding capacity for complementary oligomers even after a nuclease digestion step, which effectively degrades deoxyribonucleotide oligomers and thus the binding capability of regular DNA-STV conjugates. The psDNA-STV therefore hold particular promise for applications e.g. in proteome research and novel biosensing devices, where interfering endogenous nucleic acids need to be removed from analytes by nuclease digestion.

Dye linked conjugated homopolymers: using conjugated polymer electroluminescence to optically pump porphyrin-dye emission

DEFF Research Database (Denmark)

Nielsen, K.T.; Spanggaard, H.; Krebs, Frederik C

2004-01-01

. Electroluminescent devices of the homopolymer itself and of the zinc-porphyrin containing polymer were prepared and the nature of the electroluminescence was characterized. The homopolymer segments were found to optically pump the emission of the zinc-porphyrin dye moities. The homopolymer exhibits blue......Zinc-porphyrin dye molecules were incorporated into the backbone of a conjugated polymer material by a method, which allowed for the incorporation of only one zinc-porphyrin dye molecule into the backbone of each conjugated polymer molecule. The electronic properties of the homopolymer were...

Lipid-peptide-polymer conjugates and nanoparticles thereof

Science.gov (United States)

Xu, Ting; Dong, He; Shu, Jessica

2015-06-02

The present invention provides a conjugate having a peptide with from about 10 to about 100 amino acids, wherein the peptide adopts a helical structure. The conjugate also includes a first polymer covalently linked to the peptide, and a hydrophobic moiety covalently linked to the N-terminus of the peptide, wherein the hydrophobic moiety comprises a second polymer or a lipid moiety. The present invention also provides helix bundles form by self-assembling the conjugates, and particles formed by self-assembling the helix bundles. Methods of preparing the helix bundles and particles are also provided.

Novel β-cyclodextrin-eosin conjugates.

Science.gov (United States)

Benkovics, Gábor; Afonso, Damien; Darcsi, András; Béni, Szabolcs; Conoci, Sabrina; Fenyvesi, Éva; Szente, Lajos; Malanga, Milo; Sortino, Salvatore

2017-01-01

Eosin B (EoB) and eosin Y (EoY), two xanthene dye derivatives with photosensitizing ability were prepared in high purity through an improved synthetic route. The dyes were grafted to a 6-monoamino-β-cyclodextrin scaffold under mild reaction conditions through a stable amide linkage using the coupling agent 4-(4,6-dimethoxy-1,3,5-triazin-2-yl)-4-methylmorpholinium chloride. The molecular conjugates, well soluble in aqueous medium, were extensively characterized by 1D and 2D NMR spectroscopy and mass spectrometry. Preliminary spectroscopic investigations showed that the β-cyclodextrin-EoY conjugate retains both the fluorescence properties and the capability to photogenerate singlet oxygen of the unbound chromophore. In contrast, the corresponding β-cyclodextrin-EoB conjugate did not show either relevant emission or photosensitizing activity probably due to aggregation in aqueous medium, which precludes any response to light excitation.

Novel β-cyclodextrin–eosin conjugates

Directory of Open Access Journals (Sweden)

Gábor Benkovics

2017-03-01

Full Text Available Eosin B (EoB and eosin Y (EoY, two xanthene dye derivatives with photosensitizing ability were prepared in high purity through an improved synthetic route. The dyes were grafted to a 6-monoamino-β-cyclodextrin scaffold under mild reaction conditions through a stable amide linkage using the coupling agent 4-(4,6-dimethoxy-1,3,5-triazin-2-yl-4-methylmorpholinium chloride. The molecular conjugates, well soluble in aqueous medium, were extensively characterized by 1D and 2D NMR spectroscopy and mass spectrometry. Preliminary spectroscopic investigations showed that the β-cyclodextrin–EoY conjugate retains both the fluorescence properties and the capability to photogenerate singlet oxygen of the unbound chromophore. In contrast, the corresponding β-cyclodextrin–EoB conjugate did not show either relevant emission or photosensitizing activity probably due to aggregation in aqueous medium, which precludes any response to light excitation.

Photodynamic tissue adhesion with chlorin(e6) protein conjugates.

Science.gov (United States)

Khadem, J; Veloso, A A; Tolentino, F; Hasan, T; Hamblin, M R

1999-12-01

To test the hypothesis that a photodynamic laser-activated tissue solder would perform better in sealing scleral incisions when the photosensitizer was covalently linked to the protein than when it was noncovalently mixed. Conjugates and mixtures were prepared between the photosensitizer chlorin(e6) and various proteins (albumin, fibrinogen, and gelatin) in different ratios and used to weld penetrating scleral incisions made in human cadaveric eyes. A blue-green (488-514 nm) argon laser activated the adhesive, and the strength of the closure was measured by increasing the intraocular pressure until the wound showed leakage. Both covalent conjugates and noncovalent mixtures showed a light dose-dependent increase in leaking pressure. A preparation of albumin chlorin(e6) conjugate with additional albumin added (2.5 protein to chlorin(e6) molar ratio) showed significantly higher weld strength than other protein conjugates and mixtures. This is the first report of dye-protein conjugates as tissue solders. These conjugates may have applications in ophthalmology.

Human glutathione S-transferase-mediated glutathione conjugation of curcumin and efflux of these conjugates in caco-2 cells

NARCIS (Netherlands)

Usta, M.; Wortelboer, H.M.; Vervoort, J.; Boersma, M.G.; Rietjens, I.M.C.M.; Bladeren, P.J. van; Cnubben, N.H.P.

2007-01-01

Curcumin, an α,β-unsaturated carbonyl compound, reacts with glutathione, leading to the formation of two monoglutathionyl curcumin conjugates. In the present study, the structures of both glutathione conjugates of curcumin were identified by LC-MS and one- and two-dimensional 1H NMR analysis, and

Constraining the composition and thermal state of the mantle beneath Europe from inversion of long-period electromagnetic sounding data

DEFF Research Database (Denmark)

Khan, Amir; Connolly, J.A.D.; Olsen, Nils

2006-01-01

We reexamine the problem of inverting C responses, covering periods between 1 month and 1 year collected from 42 European observatories, to constrain the internal structure of the Earth. Earlier studies used the C responses, which connect the magnetic vertical component and the horizontal gradient...... of the horizontal components of electromagnetic variations, to obtain the conductivity profile of the Earth's mantle. Here, we go beyond this approach by inverting directly for chemical composition and thermal state of the Earth, rather than subsurface electrical conductivity structure. The primary inversion...... of geophysical data for compositional parameters, planetary composition, and thermal state is feasible. The inversion indicates most probable lower mantle geothermal gradients of similar to 0.58 K/km, core mantle boundary temperatures of similar to 2900 degrees C, bulk Earth molar Mg/Si ratios of similar to 1...

DENDRIMER CONJUGATES FOR SELECTIVE OF PROTEIN AGGREGATES

DEFF Research Database (Denmark)

2004-01-01

Dendrimer conjugates are presented, which are formed between a dendrimer and a protein solubilising substance. Such dendrimer conjugates are effective in the treatment of protein aggregate-related diseases (e.g. prion-related diseases). The protein solubilising substance and the dendrimer together...

A conserved helicase processivity factor is needed for conjugation and replication of an integrative and conjugative element.

Directory of Open Access Journals (Sweden)

Jacob Thomas

Full Text Available Integrative and conjugative elements (ICEs are agents of horizontal gene transfer and have major roles in evolution and acquisition of new traits, including antibiotic resistances. ICEs are found integrated in a host chromosome and can excise and transfer to recipient bacteria via conjugation. Conjugation involves nicking of the ICE origin of transfer (oriT by the ICE-encoded relaxase and transfer of the nicked single strand of ICE DNA. For ICEBs1 of Bacillus subtilis, nicking of oriT by the ICEBs1 relaxase NicK also initiates rolling circle replication. This autonomous replication of ICEBs1 is critical for stability of the excised element in growing cells. We found a conserved and previously uncharacterized ICE gene that is required for conjugation and replication of ICEBs1. Our results indicate that this gene, helP (formerly ydcP, encodes a helicase processivity factor that enables the host-encoded helicase PcrA to unwind the double-stranded ICEBs1 DNA. HelP was required for both conjugation and replication of ICEBs1, and HelP and NicK were the only ICEBs1 proteins needed for replication from ICEBs1 oriT. Using chromatin immunoprecipitation, we measured association of HelP, NicK, PcrA, and the host-encoded single-strand DNA binding protein Ssb with ICEBs1. We found that NicK was required for association of HelP and PcrA with ICEBs1 DNA. HelP was required for association of PcrA and Ssb with ICEBs1 regions distal, but not proximal, to oriT, indicating that PcrA needs HelP to progress beyond nicked oriT and unwind ICEBs1. In vitro, HelP directly stimulated the helicase activity of the PcrA homologue UvrD. Our findings demonstrate that HelP is a helicase processivity factor needed for efficient unwinding of ICEBs1 for conjugation and replication. Homologues of HelP and PcrA-type helicases are encoded on many known and putative ICEs. We propose that these factors are essential for ICE conjugation, replication, and genetic stability.

Conjugate Gaze Palsies

Science.gov (United States)

... version Home Brain, Spinal Cord, and Nerve Disorders Cranial Nerve Disorders Conjugate Gaze Palsies Horizontal gaze palsy Vertical ... Version. DOCTORS: Click here for the Professional Version Cranial Nerve Disorders Overview of the Cranial Nerves Internuclear Ophthalmoplegia ...

Exploring Constrained Creative Communication

DEFF Research Database (Denmark)

Sørensen, Jannick Kirk

2017-01-01

Creative collaboration via online tools offers a less ‘media rich’ exchange of information between participants than face-to-face collaboration. The participants’ freedom to communicate is restricted in means of communication, and rectified in terms of possibilities offered in the interface. How do...... these constrains influence the creative process and the outcome? In order to isolate the communication problem from the interface- and technology problem, we examine via a design game the creative communication on an open-ended task in a highly constrained setting, a design game. Via an experiment the relation...... between communicative constrains and participants’ perception of dialogue and creativity is examined. Four batches of students preparing for forming semester project groups were conducted and documented. Students were asked to create an unspecified object without any exchange of communication except...

Synthesis of Mikto-Arm Star Peptide Conjugates.

Science.gov (United States)

Koo, Jin Mo; Su, Hao; Lin, Yi-An; Cui, Honggang

2018-01-01

Mikto-arm star peptide conjugates are an emerging class of self-assembling peptide-based structural units that contain three or more auxiliary segments of different chemical compositions and/or functionalities. This group of molecules exhibit interesting self-assembly behavior in solution due to their chemically asymmetric topology. Here we describe the detailed procedure for synthesis of an ABC Mikto-arm star peptide conjugate in which two immiscible entities (a saturated hydrocarbon and a hydrophobic and lipophobic fluorocarbon) are conjugated onto a short β-sheet forming peptide sequence, GNNQQNY, derived from the Sup35 prion, through a lysine junction. Automated and manual Fmoc-solid phase synthesis techniques are used to synthesize the Mikto-arm star peptide conjugates, followed by HPLC purification. We envision that this set of protocols can afford a versatile platform to synthesize a new class of peptidic building units for diverse applications.

Fullerene-biomolecule conjugates and their biomedicinal applications.

Science.gov (United States)

Yang, Xinlin; Ebrahimi, Ali; Li, Jie; Cui, Quanjun

2014-01-01

Fullerenes are among the strongest antioxidants and are characterized as "radical sponges." The research on biomedicinal applications of fullerenes has achieved significant progress since the landmark publication by Friedman et al in 1993. Fullerene-biomolecule conjugates have become an important area of research during the past 2 decades. By a thorough literature search, we attempt to update the information about the synthesis of different types of fullerene-biomolecule conjugates, including fullerene-containing amino acids and peptides, oligonucleotides, sugars, and esters. Moreover, we also discuss in this review recently reported data on the biological and pharmaceutical utilities of these compounds and some other fullerene derivatives of biomedical importance. While within the fullerene-biomolecule conjugates, in which fullerene may act as both an antioxidant and a carrier, specific targeting biomolecules conjugated to fullerene will undoubtedly strengthen the delivery of functional fullerenes to sites of clinical interest.

Gold Nanoparticle Conjugation Enhances the Antiacanthamoebic Effects of Chlorhexidine

Science.gov (United States)

Aqeel, Yousuf; Siddiqui, Ruqaiyyah; Anwar, Ayaz; Shah, Muhammad Raza

2015-01-01

Acanthamoeba keratitis is a serious infection with blinding consequences and often associated with contact lens wear. Early diagnosis, followed by aggressive topical application of drugs, is a prerequisite in successful treatment, but even then prognosis remains poor. Several drugs have shown promise, including chlorhexidine gluconate; however, host cell toxicity at physiologically relevant concentrations remains a challenge. Nanoparticles, subcolloidal structures ranging in size from 10 to 100 nm, are effective drug carriers for enhancing drug potency. The overall aim of the present study was to determine whether conjugation with gold nanoparticles enhances the antiacanthamoebic potential of chlorhexidine. Gold-conjugated chlorhexidine nanoparticles were synthesized. Briefly, gold solution was mixed with chlorhexidine and reduced by adding sodium borohydride, resulting in an intense deep red color, indicative of colloidal gold-conjugated chlorhexidine nanoparticles. The synthesis was confirmed using UV-visible spectrophotometry that shows a plasmon resonance peak of 500 to 550 nm, indicative of gold nanoparticles. Further characterization using matrix-assisted laser desorption ionization-mass spectrometry showed a gold-conjugated chlorhexidine complex at m/z 699 ranging in size from 20 to 100 nm, as determined using atomic force microscopy. To determine the amoebicidal and amoebistatic effects, amoebae were incubated with gold-conjugated chlorhexidine nanoparticles. For controls, amoebae also were incubated with gold and silver nanoparticles alone, chlorhexidine alone, neomycin-conjugated nanoparticles, and neomycin alone. The findings showed that gold-conjugated chlorhexidine nanoparticles exhibited significant amoebicidal and amoebistatic effects at 5 μM. Amoebicidal effects were observed by parasite viability testing using a Trypan blue exclusion assay and flow-cytometric analysis using propidium iodide, while amoebistatic effects were observed using growth

Analytical characterization of polymer-drug conjugates

International Nuclear Information System (INIS)

Rizzo, V.; Gigli, M.; Pinciroli, V.

1998-01-01

A few polymeric conjugates of antitumor drugs have been recently developed in view of possible therapeutic advantages: solubilization of sparingly soluble drugs in water, improvement of therapeutic index, organ targeting through a second chemical species bound to the same polymeric chain. In this article it's described the analytical approach used in the characterization of the conjugates for chemical identity, purity and strength of the contained active ingredient. The techniques are: high field NMR and size exclusion chromatography with non-aqueous mobile phase for identity; selective hydrolysis and HPLC for strength and purity. A complete and reliable picture is thus obtained both for qualitative and for quantitative aspects. This is an important step forward in the direction of further development and marketing of polymer-drug conjugates [it

Four-wave mixing and phase conjugation in plasmas

International Nuclear Information System (INIS)

Federici, J.F.

1989-01-01

Nonlinear optical effects such as Stimulated Brillouin Scattering, Stimulated Raman Scattering, self-focusing, wave-mixing, parametric mixing, etc., have a long history in plasma physics. Recently, four-wave mixing in plasmas and its applications to phase conjugation has been extensively studied. Although four-wave mixing (FWM), using various nonlinear mediums, has many practical applications in the visible regime, no successful attempt has been made to study or demonstrate FWM for wavelengths longer than 10μm. Plasmas as phase conjugate mirrors have received considerable attention since they become more efficient at longer wavelengths (far-infrared to microwave). The purpose of this thesis is to study various fundamental issues which concern the suitability of plasmas for four-wave mixing and phase conjugation. The major contributions of this thesis are the identification and study of thermal and ionization nonlinearities as potential four-wave mixing and phase conjugation mechanisms and the study of the affect of density inhomogeneities on the FWM process. Using a fluid description for the plasma, this thesis demonstrates that collisional heating generates a thermal force which substantially enhances the phase conjugate reflectivity. The prospect of using a novel ionization nonlinearity in weakly ionized plasmas for wave-mixing and phase conjugation is discussed. The ionization nonlinearity arises from localized heating of the plasma by the beat-wave. Wherever, the local temperature is increased, a plasma density grating is produced due to increased electron-impact ionization. Numerical estimates of the phase conjugate reflectivity indicate reflectivities in the range of 10 -4 -10 -3 are possible in a weakly ionized steady-state gas discharge plasma

Conjugation of the CRM197-inulin conjugate significantly increases the immunogenicity of Mycobacterium tuberculosis CFP10-TB10.4 fusion protein.

Science.gov (United States)

Hu, Shun; Yu, Weili; Hu, Chunyang; Wei, Dong; Shen, Lijuan; Hu, Tao; Yi, Youjin

2017-11-01

Mycobacterium tuberculosis (Mtb) is a serious fatal pathogen that causes tuberculosis (TB). Effective vaccination is urgently needed to deal with the serious threat from TB. Mtb-secreted protein antigens are important virulence determinants of Mtb with poor immunogenicity. Adjuvants and antigen delivery systems are thus highly desired to improve the immunogenicity of protein antigens. Inulin is a biocompatible polysaccharide (PS) adjuvant that can stimulate a strong cellular and humoral immunity. Bacterial capsular PS and haptens have been conjugated with cross-reacting material 197 (CRM 197 ) to improve their immunogenicity. CFP10 and TB10.4 were two Mtb-secreted immunodominant protein antigens. A CFP10-TB10.4 fusion protein (CT) was used as the antigen for covalent conjugation with the CRM 197 -inulin conjugate (CRM-inu). The resultant conjugate (CT-CRM-inu) elicited high CT-specific IgG titers, stimulated splenocyte proliferation and provoked the secretion of Th1-type and Th2-type cytokines. Conjugation with CRM-inu significantly prolonged the systemic circulation of CT and exposure to the immune system. Moreover, CT-CRM-inu showed no apparent toxicity to cardiac, hepatic and renal functions. Thus, conjugation of CT with CRM-inu provided an effective strategy for development of protein-based vaccines against Mtb infection. Copyright © 2017 Elsevier Ltd. All rights reserved.

Polyhedral meshing in numerical analysis of conjugate heat transfer

Science.gov (United States)

Sosnowski, Marcin; Krzywanski, Jaroslaw; Grabowska, Karolina; Gnatowska, Renata

2018-06-01

Computational methods have been widely applied in conjugate heat transfer analysis. The very first and crucial step in such research is the meshing process which consists in dividing the analysed geometry into numerous small control volumes (cells). In Computational Fluid Dynamics (CFD) applications it is desirable to use the hexahedral cells as the resulting mesh is characterized by low numerical diffusion. Unfortunately generating such mesh can be a very time-consuming task and in case of complicated geometry - it may not be possible to generate cells of good quality. Therefore tetrahedral cells have been implemented into commercial pre-processors. Their advantage is the ease of its generation even in case of very complex geometry. On the other hand tetrahedrons cannot be stretched excessively without decreasing the mesh quality factor, so significantly larger number of cells has to be used in comparison to hexahedral mesh in order to achieve a reasonable accuracy. Moreover the numerical diffusion of tetrahedral elements is significantly higher. Therefore the polyhedral cells are proposed within the paper in order to combine the advantages of hexahedrons (low numerical diffusion resulting in accurate solution) and tetrahedrons (rapid semi-automatic generation) as well as to overcome the disadvantages of both the above mentioned mesh types. The major benefit of polyhedral mesh is that each individual cell has many neighbours, so gradients can be well approximated. Polyhedrons are also less sensitive to stretching than tetrahedrons which results in better mesh quality leading to improved numerical stability of the model. In addition, numerical diffusion is reduced due to mass exchange over numerous faces. This leads to a more accurate solution achieved with a lower cell count. Therefore detailed comparison of numerical modelling results concerning conjugate heat transfer using tetrahedral and polyhedral meshes is presented in the paper.

Conjugated linoleic acid-rich soy oil triacylglycerol identification.

Science.gov (United States)

Lall, Rahul K; Proctor, Andrew; Jain, Vishal P; Lay, Jackson O

2009-03-11

Conjugated linoleic acid (CLA)-rich soy oil has been produced by soy oil linoleic acid (LA) photoisomerization, but CLA-rich oil triacylglycerol (TAG) characterization was not described. Therefore, the objectives were to identify and quantify new TAG fractions in CLA-rich oil by nonaqueous reversed-phase high-performance liquid chromatography (NARP-HPLC). Analytical NARP-HPLC with an acetonitrile/dichloromethane (ACN/DCM) gradient and an evaporating light scattering detector/ultraviolet (ELSD/UV) detector was used. New TAG peaks from LA-containing TAGs were observed. The LnLL, LLL, LLO, and LLP (Ln, linolenic; L, linoleic; O, oleic; and P, palmitic) peaks reduced after isomerization with an increase in adjacent peaks that coeluted with LnLnO, LnLO, LnOO, and LnPP. The newly formed peaks were wider than those of the original oil and absorbed at 233 nm, suggesting the possibility of various CLA containing TAGs. The HPLC profile showed five fractions of mixed TAGs, and fatty acid analysis showed that CLA isomers were found predominately in fractions 2 and 3, which originally contained most LA. The CLA isomers were 70-80% trans,trans and 20-30% cis,trans and trans,cis.

SDSS-IV MaNGA: modelling the metallicity gradients of gas and stars - radially dependent metal outflow versus IMF

Science.gov (United States)

Lian, Jianhui; Thomas, Daniel; Maraston, Claudia; Goddard, Daniel; Parikh, Taniya; Fernández-Trincado, J. G.; Roman-Lopes, Alexandre; Rong, Yu; Tang, Baitian; Yan, Renbin

2018-05-01

In our previous work, we found that only two scenarios are capable of reproducing the observed integrated mass-metallicity relations for the gas and stellar components of local star-forming galaxies simultaneously. One scenario invokes a time-dependent metal outflow loading factor with stronger outflows at early times. The other scenario uses a time-dependent initial mass function (IMF) slope with a steeper IMF at early times. In this work, we extend our study to investigate the radial profile of gas and stellar metallicity in local star-forming galaxies using spatially resolved spectroscopic data from the SDSS-IV MaNGA survey. We find that most galaxies show negative gradients in both gas and stellar metallicity with steeper gradients in stellar metallicity. The stellar metallicity gradients tend to be mass dependent with steeper gradients in more massive galaxies while no clear mass dependence is found for the gas metallicity gradient. Then we compare the observations with the predictions from a chemical evolution model of the radial profiles of gas and stellar metallicities. We confirm that the two scenarios proposed in our previous work are also required to explain the metallicity gradients. Based on these two scenarios, we successfully reproduce the radial profiles of gas metallicity, stellar metallicity, stellar mass surface density, and star formation rate surface density simultaneously. The origin of the negative gradient in stellar metallicity turns out to be driven by either radially dependent metal outflow or IMF slope. In contrast, the radial dependence of the gas metallicity is less constrained because of the degeneracy in model parameters.

O:2-CRM(197) conjugates against Salmonella Paratyphi A.

Science.gov (United States)

Micoli, Francesca; Rondini, Simona; Gavini, Massimiliano; Lanzilao, Luisa; Medaglini, Donata; Saul, Allan; Martin, Laura B

2012-01-01

Enteric fevers remain a common and serious disease, affecting mainly children and adolescents in developing countries. Salmonella enterica serovar Typhi was believed to cause most enteric fever episodes, but several recent reports have shown an increasing incidence of S. Paratyphi A, encouraging the development of a bivalent vaccine to protect against both serovars, especially considering that at present there is no vaccine against S. Paratyphi A. The O-specific polysaccharide (O:2) of S. Paratyphi A is a protective antigen and clinical data have previously demonstrated the potential of using O:2 conjugate vaccines. Here we describe a new conjugation chemistry to link O:2 and the carrier protein CRM(197), using the terminus 3-deoxy-D-manno-octulosonic acid (KDO), thus leaving the O:2 chain unmodified. The new conjugates were tested in mice and compared with other O:2-antigen conjugates, synthesized adopting previously described methods that use CRM(197) as carrier protein. The newly developed conjugation chemistry yielded immunogenic conjugates with strong serum bactericidal activity against S. Paratyphi A.

O:2-CRM(197 conjugates against Salmonella Paratyphi A.

Directory of Open Access Journals (Sweden)

Francesca Micoli

Full Text Available Enteric fevers remain a common and serious disease, affecting mainly children and adolescents in developing countries. Salmonella enterica serovar Typhi was believed to cause most enteric fever episodes, but several recent reports have shown an increasing incidence of S. Paratyphi A, encouraging the development of a bivalent vaccine to protect against both serovars, especially considering that at present there is no vaccine against S. Paratyphi A. The O-specific polysaccharide (O:2 of S. Paratyphi A is a protective antigen and clinical data have previously demonstrated the potential of using O:2 conjugate vaccines. Here we describe a new conjugation chemistry to link O:2 and the carrier protein CRM(197, using the terminus 3-deoxy-D-manno-octulosonic acid (KDO, thus leaving the O:2 chain unmodified. The new conjugates were tested in mice and compared with other O:2-antigen conjugates, synthesized adopting previously described methods that use CRM(197 as carrier protein. The newly developed conjugation chemistry yielded immunogenic conjugates with strong serum bactericidal activity against S. Paratyphi A.

Comparison of the pharmacological and biological properties of HPMA copolymer-pirarubicin conjugates: A single-chain copolymer conjugate and its biodegradable tandem-diblock copolymer conjugate

Czech Academy of Sciences Publication Activity Database

Etrych, Tomáš; Tsukigawa, K.; Nakamura, H.; Chytil, Petr; Fang, J.; Ulbrich, Karel; Otagiri, M.; Maeda, H.

2017-01-01

Roč. 106, 30 August (2017), s. 10-19 ISSN 0928-0987 R&D Projects: GA ČR(CZ) GA15-02986S; GA MŠk(CZ) LQ1604; GA MŠk(CZ) ED1.1.00/02.0109 Grant - others:AV ČR,Japan Society for the Promotion of Science(CZ) JSPS-16-05 Program:Bilaterální spolupráce Institutional support: RVO:61389013 Keywords : pirarubicin * PHPMA conjugate * tandem-diblock PHPMA conjugate Subject RIV: FR - Pharmacology ; Medidal Chemistry OBOR OECD: Pharmacology and pharmacy Impact factor: 3.756, year: 2016

Integrated circuits based on conjugated polymer monolayer.

Science.gov (United States)

Li, Mengmeng; Mangalore, Deepthi Kamath; Zhao, Jingbo; Carpenter, Joshua H; Yan, Hongping; Ade, Harald; Yan, He; Müllen, Klaus; Blom, Paul W M; Pisula, Wojciech; de Leeuw, Dago M; Asadi, Kamal

2018-01-31

It is still a great challenge to fabricate conjugated polymer monolayer field-effect transistors (PoM-FETs) due to intricate crystallization and film formation of conjugated polymers. Here we demonstrate PoM-FETs based on a single monolayer of a conjugated polymer. The resulting PoM-FETs are highly reproducible and exhibit charge carrier mobilities reaching 3 cm 2  V -1  s -1 . The high performance is attributed to the strong interactions of the polymer chains present already in solution leading to pronounced edge-on packing and well-defined microstructure in the monolayer. The high reproducibility enables the integration of discrete unipolar PoM-FETs into inverters and ring oscillators. Real logic functionality has been demonstrated by constructing a 15-bit code generator in which hundreds of self-assembled PoM-FETs are addressed simultaneously. Our results provide the state-of-the-art example of integrated circuits based on a conjugated polymer monolayer, opening prospective pathways for bottom-up organic electronics.

Technical note: Avoiding the direct inversion of the numerator relationship matrix for genotyped animals in single-step genomic best linear unbiased prediction solved with the preconditioned conjugate gradient.

Science.gov (United States)

Masuda, Y; Misztal, I; Legarra, A; Tsuruta, S; Lourenco, D A L; Fragomeni, B O; Aguilar, I

2017-01-01

This paper evaluates an efficient implementation to multiply the inverse of a numerator relationship matrix for genotyped animals () by a vector (). The computation is required for solving mixed model equations in single-step genomic BLUP (ssGBLUP) with the preconditioned conjugate gradient (PCG). The inverse can be decomposed into sparse matrices that are blocks of the sparse inverse of a numerator relationship matrix () including genotyped animals and their ancestors. The elements of were rapidly calculated with the Henderson's rule and stored as sparse matrices in memory. Implementation of was by a series of sparse matrix-vector multiplications. Diagonal elements of , which were required as preconditioners in PCG, were approximated with a Monte Carlo method using 1,000 samples. The efficient implementation of was compared with explicit inversion of with 3 data sets including about 15,000, 81,000, and 570,000 genotyped animals selected from populations with 213,000, 8.2 million, and 10.7 million pedigree animals, respectively. The explicit inversion required 1.8 GB, 49 GB, and 2,415 GB (estimated) of memory, respectively, and 42 s, 56 min, and 13.5 d (estimated), respectively, for the computations. The efficient implementation required <1 MB, 2.9 GB, and 2.3 GB of memory, respectively, and <1 sec, 3 min, and 5 min, respectively, for setting up. Only <1 sec was required for the multiplication in each PCG iteration for any data sets. When the equations in ssGBLUP are solved with the PCG algorithm, is no longer a limiting factor in the computations.

METHOD OF CONJUGATED CIRCULAR ARCS TRACING

Directory of Open Access Journals (Sweden)

N. Ageyev Vladimir

2017-01-01

Full Text Available The geometric properties of conjugated circular arcs connecting two points on the plane with set directions of tan- gent vectors are studied in the work. It is shown that pairs of conjugated circular arcs with the same conditions in frontier points create one-parameter set of smooth curves tightly filling all the plane. One of the basic properties of this set is the fact that all coupling points of circular arcs are on the circular curve going through the initially given points. The circle radius depends on the direction of tangent vectors. Any point of the circle curve, named auxiliary in this work, determines a pair of conjugated arcs with given boundary conditions. One more condition of the auxiliary circle curve is that it divides the plane into two parts. The arcs going from the initial point are out of the circle limited by this circle curve and the arcs coming to the final point are inside it. These properties are the basis for the method of conjugated circular arcs tracing pro- posed in this article. The algorithm is rather simple and allows to fulfill all the needed plottings using only the divider and ruler. Two concrete examples are considered. The first one is related to the problem of tracing of a pair of conjugated arcs with the minimal curve jump when going through the coupling point. The second one demonstrates the possibility of trac- ing of the smooth curve going through any three points on the plane under condition that in the initial and final points the directions of tangent vectors are given. The proposed methods of conjugated circular arcs tracing can be applied in solving of a wide variety of problems connected with the tracing of cam contours, for example pattern curves in textile industry or in computer-aided-design systems when programming of looms with numeric control.

Peptide-Carrier Conjugation

DEFF Research Database (Denmark)

Hansen, Paul Robert

2015-01-01

To produce antibodies against synthetic peptides it is necessary to couple them to a protein carrier. This chapter provides a nonspecialist overview of peptide-carrier conjugation. Furthermore, a protocol for coupling cysteine-containing peptides to bovine serum albumin is outlined....

Class, Kinship Density, and Conjugal Role Segregation.

Science.gov (United States)

Hill, Malcolm D.

1988-01-01

Studied conjugal role segregation in 150 married women from intact families in working-class community. Found that, although involvement in dense kinship networks was associated with conjugal role segregation, respondents' attitudes toward marital roles and phase of family cycle when young children were present were more powerful predictors of…

Feature and Pose Constrained Visual Aided Inertial Navigation for Computationally Constrained Aerial Vehicles

Science.gov (United States)

Williams, Brian; Hudson, Nicolas; Tweddle, Brent; Brockers, Roland; Matthies, Larry

2011-01-01

A Feature and Pose Constrained Extended Kalman Filter (FPC-EKF) is developed for highly dynamic computationally constrained micro aerial vehicles. Vehicle localization is achieved using only a low performance inertial measurement unit and a single camera. The FPC-EKF framework augments the vehicle's state with both previous vehicle poses and critical environmental features, including vertical edges. This filter framework efficiently incorporates measurements from hundreds of opportunistic visual features to constrain the motion estimate, while allowing navigating and sustained tracking with respect to a few persistent features. In addition, vertical features in the environment are opportunistically used to provide global attitude references. Accurate pose estimation is demonstrated on a sequence including fast traversing, where visual features enter and exit the field-of-view quickly, as well as hover and ingress maneuvers where drift free navigation is achieved with respect to the environment.

Site-Selective Conjugation of Native Proteins with DNA

DEFF Research Database (Denmark)

Trads, Julie Brender; Tørring, Thomas; Gothelf, Kurt Vesterager

2017-01-01

Conjugation of DNA to proteins is increasingly used in academia and industry to provide proteins with tags for identification or handles for hybridization to other DNA strands. Assay technologies such as immuno-PCR and proximity ligation and the imaging technology DNA-PAINT require DNA-protein....... The introduction of a bioorthogonal handle at a specific position of a protein by recombinant techniques provides an excellent approach to site-specific conjugation, but for many laboratories and for applications where several proteins are to be labeled, the expression of recombinant proteins may be cumbersome...... conjugates. In DNA nanotechnology, the DNA handle is exploited to precisely position proteins by self-assembly. For these applications, site-selective conjugation is almost always desired because fully functional proteins are required to maintain the specificity of antibodies and the activity of enzymes...

Conjugated Polymers for Flexible Energy Harvesting and Storage.

Science.gov (United States)

Zhang, Zhitao; Liao, Meng; Lou, Huiqing; Hu, Yajie; Sun, Xuemei; Peng, Huisheng

2018-03-01

Since the discovery of conjugated polymers in the 1970s, they have attracted considerable interest in light of their advantages of having a tunable bandgap, high electroactivity, high flexibility, and good processability compared to inorganic conducting materials. The above combined advantages make them promising for effective energy harvesting and storage, which have been widely studied in recent decades. Herein, the key advancements in the use of conjugated polymers for flexible energy harvesting and storage are reviewed. The synthesis, structure, and properties of conjugated polymers are first summarized. Then, their applications in flexible polymer solar cells, thermoelectric generators, supercapacitors, and lithium-ion batteries are described. The remaining challenges are then discussed to highlight the future direction in the development of conjugated polymers. © 2018 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Formation of primary sperm conjugates in a haplogyne spider (Caponiidae, Araneae) with remarks on the evolution of sperm conjugation in spiders.

Science.gov (United States)

Lipke, Elisabeth; Michalik, Peter

2012-11-01

Sperm conjugation, where two or more sperm are physically united, is a rare but widespread pheno-menon across the animal kingdom. One group well known for its different types of sperm conjugation are spiders. Particularly, haplogyne spiders show a high diversity of sperm traits. Besides individual cleistospermia, primary (synspermia) and secondary (coenospermia, "spermatophore") sperm conjugation occurs. However, the evolution of sperm conjugates and sperm is not understood in this group. Here, we look at how sperm are transferred in Caponiidae (Haplogynae) in pursuit of additional information about the evolution of sperm transfer forms in spiders. Additionally, we investigated the male reproductive system and spermatozoa using light- and transmission electron-microscopy and provide a 3D reconstruction of individual as of well as conjugated spermatozoa. Mature spermatozoa are characterized by an extremely elongated, helical nucleus resulting in the longest spider sperm known to date. At the end of spermiogenesis, synspermia are formed by complete fusion of four spermatids. Thus, synspermia might have evolved early within ecribellate Haplogynae. The fused sperm cells are surrounded by a prominent vesicular area. The function of the vesicular area remains still unknown but might be correlated with the capacitation process inside the female. Further phylogenetic and functional implications of the spermatozoa and sperm conjugation are discussed. Copyright © 2012 Elsevier Ltd. All rights reserved.

Design and biological activity of β-sheet breaker peptide conjugates

International Nuclear Information System (INIS)

Rocha, Sandra; Cardoso, Isabel; Boerner, Hans; Pereira, Maria Carmo; Saraiva, Maria Joao; Coelho, Manuel

2009-01-01

The sequence LPFFD (iAβ 5 ) prevents amyloid-β peptide (Aβ) fibrillogenesis and neurotoxicity, hallmarks of Alzheimer's disease (AD), as previously demonstrated. In this study iAβ 5 was covalently linked to poly(ethylene glycol) (PEG) and the activity of conjugates was assessed and compared to the activity of the peptide alone by in vitro studies. The conjugates were characterized by MALDI-TOF. Competition binding assays established that conjugates retained the ability to bind Aβ with similar strength as iAβ 5 . Transmission electron microscopy analysis showed that iAβ 5 conjugates inhibited amyloid fibril formation, which is in agreement with binding properties observed for the conjugates towards Aβ. The conjugates were also able to prevent amyloid-induced cell death, as evaluated by activation of caspase 3. These results demonstrated that the biological activity of iAβ 5 is not affected by the pegylation process.

Choosing health, constrained choices.

Science.gov (United States)

Chee Khoon Chan

2009-12-01

In parallel with the neo-liberal retrenchment of the welfarist state, an increasing emphasis on the responsibility of individuals in managing their own affairs and their well-being has been evident. In the health arena for instance, this was a major theme permeating the UK government's White Paper Choosing Health: Making Healthy Choices Easier (2004), which appealed to an ethos of autonomy and self-actualization through activity and consumption which merited esteem. As a counterpoint to this growing trend of informed responsibilization, constrained choices (constrained agency) provides a useful framework for a judicious balance and sense of proportion between an individual behavioural focus and a focus on societal, systemic, and structural determinants of health and well-being. Constrained choices is also a conceptual bridge between responsibilization and population health which could be further developed within an integrative biosocial perspective one might refer to as the social ecology of health and disease.

The extended regulatory networks of SXT/R391 integrative and conjugative elements and IncA/C conjugative plasmids.

Science.gov (United States)

Poulin-Laprade, Dominic; Carraro, Nicolas; Burrus, Vincent

2015-01-01

Nowadays, healthcare systems are challenged by a major worldwide drug resistance crisis caused by the massive and rapid dissemination of antibiotic resistance genes and associated emergence of multidrug resistant pathogenic bacteria, in both clinical and environmental settings. Conjugation is the main driving force of gene transfer among microorganisms. This mechanism of horizontal gene transfer mediates the translocation of large DNA fragments between two bacterial cells in direct contact. Integrative and conjugative elements (ICEs) of the SXT/R391 family (SRIs) and IncA/C conjugative plasmids (ACPs) are responsible for the dissemination of a broad spectrum of antibiotic resistance genes among diverse species of Enterobacteriaceae and Vibrionaceae. The biology, diversity, prevalence and distribution of these two families of conjugative elements have been the subject of extensive studies for the past 15 years. Recently, the transcriptional regulators that govern their dissemination through the expression of ICE- or plasmid-encoded transfer genes have been described. Unrelated repressors control the activation of conjugation by preventing the expression of two related master activator complexes in both types of elements, i.e., SetCD in SXT/R391 ICEs and AcaCD in IncA/C plasmids. Finally, in addition to activating ICE- or plasmid-borne genes, these master activators have been shown to specifically activate phylogenetically unrelated mobilizable genomic islands (MGIs) that also disseminate antibiotic resistance genes and other adaptive traits among a plethora of pathogens such as Vibrio cholerae and Salmonella enterica.

The extended regulatory networks of SXT/R391 integrative and conjugative elements and IncA/C conjugative plasmids.

Directory of Open Access Journals (Sweden)

Dominic ePoulin-Laprade

2015-08-01

Full Text Available Nowadays, healthcare systems are challenged by a major worldwide drug resistance crisis caused by the massive and rapid dissemination of antibiotic resistance genes and associated emergence of multidrug resistant pathogenic bacteria, in both clinical and environmental settings. Conjugation is the main driving force of gene transfer among microorganisms. This mechanism of horizontal gene transfer mediates the translocation of large DNA fragments between two bacterial cells in direct contact. Integrative and conjugative elements (ICEs of the SXT/R391 family (SRIs and IncA/C conjugative plasmids (ACPs are responsible for the dissemination of a broad spectrum of antibiotic resistance genes among diverse species of Enterobacteriaceae and Vibrionaceae. The biology, diversity, prevalence and distribution of these two families of conjugative elements have been the subject of extensive studies for the past 15 years. Recently, the transcriptional regulators that govern their dissemination through the expression of ICE- or plasmid-encoded transfer genes have been described. Unrelated repressors control the activation of conjugation by preventing the expression of two related master activator complexes in both types of elements, i.e. SetCD in SXT/R391 ICEs and AcaCD in IncA/C plasmids. Finally, in addition to activating ICE- or plasmid-borne genes, these master activators have been shown to specifically activate phylogenetically unrelated mobilizable genomic islands (MGIs that also disseminate antibiotic resistance genes and other adaptive traits among a plethora of pathogens such as Vibrio cholerae and Salmonella enterica.

Full magnetic gradient tensor from triaxial aeromagnetic gradient measurements: Calculation and application

Science.gov (United States)

Luo, Yao; Wu, Mei-Ping; Wang, Ping; Duan, Shu-Ling; Liu, Hao-Jun; Wang, Jin-Long; An, Zhan-Feng

2015-09-01

The full magnetic gradient tensor (MGT) refers to the spatial change rate of the three field components of the geomagnetic field vector along three mutually orthogonal axes. The tensor is of use to geological mapping, resources exploration, magnetic navigation, and others. However, it is very difficult to measure the full magnetic tensor gradient using existing engineering technology. We present a method to use triaxial aeromagnetic gradient measurements for deriving the full MGT. The method uses the triaxial gradient data and makes full use of the variation of the magnetic anomaly modulus in three dimensions to obtain a self-consistent magnetic tensor gradient. Numerical simulations show that the full MGT data obtained with the proposed method are of high precision and satisfy the requirements of data processing. We selected triaxial aeromagnetic gradient data from the Hebei Province for calculating the full MGT. Data processing shows that using triaxial tensor gradient data allows to take advantage of the spatial rate of change of the total field in three dimensions and suppresses part of the independent noise in the aeromagnetic gradient. The calculated tensor components have improved resolution, and the transformed full tensor gradient satisfies the requirement of geological mapping and interpretation.

Quantifying the Energy Efficiency of Object Recognition and Optical Flow

Science.gov (United States)

2014-03-28

other linear solvers, such as conjugate- gradient (CG), preconditioned conjugate-gradient (PCG), and red-black Gauss Seidel (RB). We have also... converge faster than others. We will consider the trade-off between per- iteration efficiency and convergence rate in the next section. 3.1.4 Analysis of...performing solver, in terms of quality per number of iterations , is the preconditioned conjugate gradient solver, followed by the red-black Gauss

Coastal fish assemblages reflect geological and oceanographic gradients within an Australian zootone.

Directory of Open Access Journals (Sweden)

Euan S Harvey

Full Text Available Distributions of mobile animals have been shown to be heavily influenced by habitat and climate. We address the historical and contemporary context of fish habitats within a major zootone: the Recherche Archipelago, southern western Australia. Baited remote underwater video systems were set in nine habitat types within three regions to determine the species diversity and relative abundance of bony fishes, sharks and rays. Constrained ordinations and multivariate prediction and regression trees were used to examine the effects of gradients in longitude, depth, distance from islands and coast, and epibenthic habitat on fish assemblage composition. A total of 90 species from 43 families were recorded from a wide range of functional groups. Ordination accounted for 19% of the variation in the assemblage composition when constrained by spatial and epibenthic covariates, and identified redundancy in the use of distance from the nearest emergent island as a predictor. A spatial hierarchy of fourteen fish assemblages was identified using multivariate prediction and regression trees, with the primary split between assemblages on macroalgal reefs, and those on bare or sandy habitats supporting seagrass beds. The characterisation of indicator species for assemblages within the hierarchy revealed important faunal break in fish assemblages at 122.30 East at Cape Le Grand and subtle niche partitioning amongst species within the labrids and monacanthids. For example, some species of monacanthids were habitat specialists and predominantly found on seagrass (Acanthaluteres vittiger, Scobinichthys granulatus, reef (Meuschenia galii, Meuschenia hippocrepis or sand habitats (Nelusetta ayraudi. Predatory fish that consume molluscs, crustaceans and cephalopods were dominant with evidence of habitat generalisation in reef species to cope with local disturbances by wave action. Niche separation within major genera, and a sub-regional faunal break, indicate future

Synthesis and antimicrobial activity of gold nanoparticle conjugates with cefotaxime

Science.gov (United States)

Titanova, Elena O.; Burygin, Gennady L.

2016-04-01

Gold nanoparticles (GNPs) have attracted significant interest as a novel platform for various applications to nanobiotechnology and biomedicine. The conjugates of GNPs with antibiotics and antibodies were also used for selective photothermal killing of protozoa and bacteria. Also the conjugates of some antibiotics with GNPs decreased the number of bacterial growing cells. In this work was made the procedure optimization for conjugation of cefotaxime (a third-generation cephalosporin antibiotic) with GNPs (15 nm) and we examined the antimicrobial properties of this conjugate to bacteria culture of E. coli K-12. Addition of cefotaxime solution to colloidal gold does not change their color and extinction spectrum. For physiologically active concentration of cefotaxime (3 μg/mL), it was shown that the optimum pH for the conjugation was more than 9.5. A partial aggregation of the GNPs in saline medium was observed at pH 6.5-7.5. The optimum concentration of K2CO3 for conjugation cefotaxime with GNPs-15 was 5 mM. The optimum concentration of cefotaxime was at 0.36 μg/mL. We found the inhibition of the growth of E. coli K12 upon application cefotaxime-GNP conjugates.

Conjugated Polymer Solar Cells

National Research Council Canada - National Science Library

Paraschuk, Dmitry Y

2006-01-01

This report results from a contract tasking Moscow State University as follows: Conjugated polymers are promising materials for many photonics applications, in particular, for photovoltaic and solar cell devices...

Constraining neutrinoless double beta decay

International Nuclear Information System (INIS)

Dorame, L.; Meloni, D.; Morisi, S.; Peinado, E.; Valle, J.W.F.

2012-01-01

A class of discrete flavor-symmetry-based models predicts constrained neutrino mass matrix schemes that lead to specific neutrino mass sum-rules (MSR). We show how these theories may constrain the absolute scale of neutrino mass, leading in most of the cases to a lower bound on the neutrinoless double beta decay effective amplitude.

Conceptual design of a high real-estate gradient cavity for a SRF ERL

Science.gov (United States)

Xu, Chen; Ben-Zvi, Ilan; Hao, Yue; Xin, Tianmu; Wang, Haipeng

2017-10-01

The term "real-estate gradient" is used to describe the energy gain provided by an accelerating structure per actual length it takes in the accelerator. given that the length of the tunnel available for the accelerator is constrained, the real-estate gradient is an important measure of the efficiency of a given accelerator structure. When designing an accelerating cavity to be efficient in this sense, the unwanted Higher Order Mode (HOM) fields should be reduced by suitable HOM dampers. This is a particularly important consideration for high current operation. The additional RF components might take longitude space and reduce the total accelerating efficiency. We describe a new high efficiency 5-cell cavity with the dampers included. The total length of the cavity is reduced by 13% as compared to a more conventional design without compromising the cavity fundamental-mode performance. In addition, the HOM impedance is reduced for a higher Beam-Break-Up (BBU) threshold of operating current. In this paper, we consider an example, a possible application at the eRHIC Energy Recovery Linac (ERL).

Soluble polymer conjugates for drug delivery.

Science.gov (United States)

Minko, Tamara

2005-01-01

The use of water-soluble polymeric conjugates as drug carriers offers several possible advantages. These advantages include: (1) improved drug pharmacokinetics; (2) decreased toxicity to healthy organs; (3) possible facilitation of accumulation and preferential uptake by targeted cells; (4) programmed profile of drug release. In this review, we will consider the main types of useful polymeric conjugates and their role and effectiveness as carriers in drug delivery systems.: © 2005 Elsevier Ltd . All rights reserved.

Diffeomorphisms Holder conjugate to Anosov diffeomorphisms

OpenAIRE

Gogolev, Andrey

2008-01-01

We show by means of a counterexample that a $C^{1+Lip}$ diffeomorphism Holder conjugate to an Anosov diffeomorphism is not necessarily Anosov. The counterexample can bear higher smoothness up to $C^3$. Also we include a result from the 2006 Ph.D. thesis of T. Fisher: a $C^{1+Lip}$ diffeomorphism Holder conjugate to an Anosov diffeomorphism is Anosov itself provided that Holder exponents of the conjugacy and its inverse are sufficiently large.

Conjugate Problems in Convective Heat Transfer: Review

Directory of Open Access Journals (Sweden)

Abram Dorfman

2009-01-01

Full Text Available A review of conjugate convective heat transfer problems solved during the early and current time of development of this modern approach is presented. The discussion is based on analytical solutions of selected typical relatively simple conjugate problems including steady-state and transient processes, thermal material treatment, and heat and mass transfer in drying. This brief survey is accompanied by the list of almost two hundred publications considering application of different more and less complex analytical and numerical conjugate models for simulating technology processes and industrial devices from aerospace systems to food production. The references are combined in the groups of works studying similar problems so that each of the groups corresponds to one of selected analytical solutions considered in detail. Such structure of review gives the reader the understanding of early and current situation in conjugate convective heat transfer modeling and makes possible to use the information presented as an introduction to this area on the one hand, and to find more complicated publications of interest on the other hand.

Physiological Limits along an Elevational Gradient in a Radiation of Montane Ground Beetles.

Science.gov (United States)

Slatyer, Rachel A; Schoville, Sean D

2016-01-01

A central challenge in ecology and biogeography is to determine the extent to which physiological constraints govern the geographic ranges of species along environmental gradients. This study tests the hypothesis that temperature and desiccation tolerance are associated with the elevational ranges of 12 ground beetle species (genus Nebria) occurring on Mt. Rainier, Washington, U.S.A. Species from higher elevations did not have greater cold tolerance limits than lower-elevation species (all species ranged from -3.5 to -4.1°C), despite a steep decline in minimum temperature with elevation. Although heat tolerance limits varied among species (from 32.0 to 37.0°C), this variation was not generally associated with the relative elevational range of a species. Temperature gradients and acute thermal tolerance do not support the hypothesis that physiological constraints drive species turnover with elevation. Measurements of intraspecific variation in thermal tolerance limits were not significant for individuals taken at different elevations on Mt. Rainier, or from other mountains in Washington and Oregon. Desiccation resistance was also not associated with a species' elevational distribution. Our combined results contrast with previously-detected latitudinal gradients in acute physiological limits among insects and suggest that other processes such as chronic thermal stress or biotic interactions might be more important in constraining elevational distributions in this system.

Improvement of Emulsifying Properties of Wheat Gluten Hydrolysate λ-Carrageenan Conjugates

Directory of Open Access Journals (Sweden)

Jin-Shui Wang

2006-01-01

Full Text Available Gluten hydrolysate was prepared through limited enzymatic hydrolysis of wheat gluten resulting from the byproducts of wheat starch. The enzyme applied in the present study was Protamex. Response surface methodology was used to investigate the effects of pH, gluten hydrolysate (GHPλ-carrageenan (C ratio and reaction time on emulsifying properties of the GHP-C conjugate. The regression model for emulsion activity index (EAI was significant at p=0.001, while reaction time had a significant effect on EAI of the conjugate with regression coefficient of 4.25. The interactions of pH and GHP/ C ratio, and GHP/C ratio and reaction time significantly affected the EAI of the conjugate. Both the emulsifying property and nitrogen solubility index (NSI of GHP-C conjugate prepared under the optimal conditions increased more remarkably, compared to the control. The denaturation temperature of GHP-C conjugate obviously increased compared to wheat gluten. The addition of GHP-C conjugate had different effects on dough characteristics. Moreover, this conjugate can delay the increase in the bread crumb firmness during storage. It demonstrated that this conjugate couldimprove the dough characteristics and had anti-staling properties of bread.

Specific bile acid radioimmunoassays for separate determinations of unconjugated cholic acid, conjugated cholic acid and conjugated deoxycholic acid in serum and their clinical application

International Nuclear Information System (INIS)

Matern, S.; Gerok, W.

1977-01-01

Specific radioimmunoassays for separate determinations of serum unconjugated cholic, conjugated cholic and conjugated deoxycholic acids have been developed. Prior to the radioimmunoassay, extraction of serum bile acids was performed with Amberlite XAD-2. Unconjugated cholic acid was separated from glyco- and taurocholic acids by thin-layer chromatography. At 50% displacement of bound labeled glyco[ 3 H]cholic acid using antiserum obtained after immunization with cholic acid-bovine serum albumin-conjugate the cross-reactivity of taurocholic acid was 100%, cholic acid 80%, glycochenodeoxycholic acid 10%, chenodeoxycholic acid 7%, conjugated deoxycholic acid 3%, and conjugated lithocholic acid 3 H]cholic acid was linear on a logit-log plot from 5 to 80 pmol of unlabeled glycocholic acid. Fasting serum conjugated cholic acid in healthy subjects was 0.68 +- 0.34 μmol/l. Unconjugated cholic acid was determined by a solid phase radioimmunoassay using the cholic acid antibody chemically bound to Sepharose. The displacement curve of [ 3 H]cholic acid in the solid phase radioimmunoassay was linear on a logit-log plot from 5 to 200 pmol of unlabeled cholic acid. The coefficient of variation between samples was 5%. Fasting serum conjugated deoxycholic acid concentrations in 10 healthy subjects ranged from 0.18 to 0.92 μmol/l determined by a radioimmunoassay using antiserum obtained after immunization with deoxycholic acid-bovine serum albumin-conjugate. The clinical application of these bile acid radioimmunoassays is shown by an 'oral cholate tolerance test' as a sensitive indicator of liver function and by an 'oral cholyglycine tolerance test' as a useful test for bile acid absorption. (orig.) [de

Preparation and biodistribution study of 99Tcm labelled dextran conjugates

International Nuclear Information System (INIS)

Yang Chunhui; Li Hongyu; Liang Jixin; Lu Jia; Luo Hongyi; Zheng Deqiang; Sun Guiquan

2012-01-01

99 Tc m Mannosylated dextran conjugates were prepared through [ 99 Tc m (CO) 3 ] + precursor synthesized by carbonyl Isolink kit. The labelled conjugates were injected sub-dermally into the rear foots of the mice, and the patent blue solution was injected at the same site 10 min before sacrifice. The mice were killed at 1 h and 4 h postinjection, and the samples of different tissues including SLN, 2LN, injection site, liver, spleen, blood were dissected and counted. The uptake in terms was calculated. The results of biodistribution demonstrated that the SLN uptakes of radiopharmaceutical (without mannose in the molecules) were rather low and in vivo excretion of these conjugates were comparatively faster, and the uptake of injection site was also low; on the other hand, the SLN uptakes of radio pharmaceutical (with mannose in their molecules) were much higher than those of their corresponding dextran conjugates without mannose, but the retention in the injection site of these conjugates increased too. The results indicated that the affinity of mannosyl-dextran conjugates to the receptors on the surface of macrophages in the lymph node. In addition, the different relative molecular mass of dextran conjugates also cause different biodistribution results, the major one had higher SLN uptake, the difference was significant (P 99 Tc m (CO) 3 ] + labelled mannosylated dextran conjugates showed promising properties as SLN imaging agent and worth further investigation. (authors)

Experimental investigation of auroral generator regions with conjugate Cluster and FAST data

Directory of Open Access Journals (Sweden)

O. Marghitu

2006-03-01

Full Text Available Here and in the companion paper, Hamrin et al. (2006, we present experimental evidence for the crossing of auroral generator regions, based on conjugate Cluster and FAST data. To our knowledge, this is the first investigation that concentrates on the evaluation of the power density, E·J, in auroral generator regions, by using in-situ measurements. The Cluster data we discuss were collected within the Plasma Sheet Boundary Layer (PSBL, during a quiet magnetospheric interval, as judged from the geophysical indices, and several minutes before the onset of a small substorm, as indicated by the FAST data. Even at quiet times, the PSBL is an active location: electric fields are associated with plasma motion, caused by the dynamics of the plasma-sheet/lobe interface, while electrical currents are induced by pressure gradients. In the example we show, these ingredients do indeed sustain the conversion of mechanical energy into electromagnetic energy, as proved by the negative power density, E·J<0. The plasma characteristics in the vicinity of the generator regions indicate a complicated 3-D wavy structure of the plasma sheet boundary. Consistent with this structure, we suggest that at least part of the generated electromagnetic energy is carried away by Alfvén waves, to be dissipated in the ionosphere, near the polar cap boundary. Such a scenario is supported by the FAST data, which show energetic electron precipitation conjugated with the generator regions crossed by Cluster. A careful examination of the conjunction timing contributes to the validation of the generator signatures.

Rank gradient and p-gradient of amalgamated free products and HNN extensions

OpenAIRE

Pappas, Nathaniel

2013-01-01

We calculate the rank gradient and p-gradient of free products, free products with amalgamation over an amenable subgroup, and HNN extensions with an amenable associated subgroup. The notion of cost is used to compute the rank gradient of amalgamated free products and HNN extensions. For the p-gradient the Kurosh subgroup theorems for amalgamated free products and HNN extensions will be used.

Leveraging 35 years of Pinus taeda research in the southeastern US to constrain forest carbon cycle predictions: regional data assimilation using ecosystem experiments

Science.gov (United States)

Quinn Thomas, R.; Brooks, Evan B.; Jersild, Annika L.; Ward, Eric J.; Wynne, Randolph H.; Albaugh, Timothy J.; Dinon-Aldridge, Heather; Burkhart, Harold E.; Domec, Jean-Christophe; Fox, Thomas R.; Gonzalez-Benecke, Carlos A.; Martin, Timothy A.; Noormets, Asko; Sampson, David A.; Teskey, Robert O.

2017-07-01

Predicting how forest carbon cycling will change in response to climate change and management depends on the collective knowledge from measurements across environmental gradients, ecosystem manipulations of global change factors, and mathematical models. Formally integrating these sources of knowledge through data assimilation, or model-data fusion, allows the use of past observations to constrain model parameters and estimate prediction uncertainty. Data assimilation (DA) focused on the regional scale has the opportunity to integrate data from both environmental gradients and experimental studies to constrain model parameters. Here, we introduce a hierarchical Bayesian DA approach (Data Assimilation to Predict Productivity for Ecosystems and Regions, DAPPER) that uses observations of carbon stocks, carbon fluxes, water fluxes, and vegetation dynamics from loblolly pine plantation ecosystems across the southeastern US to constrain parameters in a modified version of the Physiological Principles Predicting Growth (3-PG) forest growth model. The observations included major experiments that manipulated atmospheric carbon dioxide (CO2) concentration, water, and nutrients, along with nonexperimental surveys that spanned environmental gradients across an 8.6 × 105 km2 region. We optimized regionally representative posterior distributions for model parameters, which dependably predicted data from plots withheld from the data assimilation. While the mean bias in predictions of nutrient fertilization experiments, irrigation experiments, and CO2 enrichment experiments was low, future work needs to focus modifications to model structures that decrease the bias in predictions of drought experiments. Predictions of how growth responded to elevated CO2 strongly depended on whether ecosystem experiments were assimilated and whether the assimilated field plots in the CO2 study were allowed to have different mortality parameters than the other field plots in the region. We present

Functional properties of nisin–carbohydrate conjugates formed by radiation induced Maillard reaction

International Nuclear Information System (INIS)

Muppalla, Shobita R.; Sonavale, Rahul; Chawla, Surinder P.; Sharma, Arun

2012-01-01

Nisin–carbohydrate conjugates were prepared by irradiating nisin either with glucose or dextran. Increase in browning and formation of intermediate products was observed with a concomitant decrease in free amino and reducing sugar groups indicating occurrence of the Maillard reaction catalyzed by irradiation. Nisin–carbohydrate conjugates showed a broad spectrum antibacterial activity against Gram negative bacteria (Escherichia coli, Pseudomonas fluorescence) as well as Gram positive bacteria (Staphylococcus aureus, Bacillus cereus). Results of antioxidant assays, including that of DPPH radical-scavenging activity and reducing power, showed that the nisin–dextran conjugates possessed better antioxidant potential than nisin–glucose conjugate. These results suggested that it was possible to enhance the functional properties of nisin by preparing radiation induced conjugates suitable for application in food industry. - Highlights: ► Nisin–carbohydrate conjugates were prepared using radiation induced Maillard reaction. ► Conjugation of nisin with dextran/glucose resulted in improvement of antibacterial spectrum. ► Conjugates of nisin with dextran/glucose had significant radical scavenging activity.

Cross-conjugation and quantum interference: a general correlation?

DEFF Research Database (Denmark)

Valkenier, Hennie; Guedon, Constant M.; Markussen, Troels

2014-01-01

We discuss the relationship between the pi-conjugation pattern, molecular length, and charge transport properties of molecular wires, both from an experimental and a theoretical viewpoint. Specifically, we focus on the role of quantum interference in the conductance properties of cross-conjugated...

Enzymatic degradation behavior and cytocompatibility of silk fibroin-starch-chitosan conjugate membranes

Energy Technology Data Exchange (ETDEWEB)

Baran, Erkan T., E-mail: erkantur@metu.edu.tr; Tuzlakoglu, Kadriye, E-mail: kadriye@dep.uminho.pt; Mano, Joao F., E-mail: jmano@dep.uminho.pt; Reis, Rui L., E-mail: rgreis@dep.uminho.pt

2012-08-01

The objective of this study was to investigate the influence of silk fibroin and oxidized starch conjugation on the enzymatic degradation behavior and the cytocompatability of chitosan based biomaterials. The tensile stress of conjugate membranes, which was at 50 Megapascal (MPa) for the lowest fibroin and starch composition (10 weight percent (wt.%)), was decreased significantly with the increased content of fibroin and starch. The weight loss of conjugates in {alpha}-amylase was more notable when the starch concentration was the highest at 30 wt.%. The conjugates were resistant to the degradation by protease and lysozyme except for the conjugates with the lowest starch concentration. After 10 days of cell culture, the proliferation of osteoblast-like cells (SaOS-2) was stimulated significantly by higher fibroin compositions and the DNA synthesis on the conjugate with the highest fibroin (30 wt.%) was about two times more compared to the native chitosan. The light microscopy and the image analysis results showed that the cell area and the lengths were decreased significantly with higher fibroin/chitosan ratio. The study proved that the conjugation of fibroin and starch with the chitosan based biomaterials by the use of non-toxic reductive alkylation crosslinking significantly improved the cytocompatibility and modulated the biodegradation, respectively. - Highlights: Black-Right-Pointing-Pointer Silk fibroin, starch and chitosan conjugates were prepared by reductive alkylation. Black-Right-Pointing-Pointer The enzymatic biodegradation and the cytocompatibility of conjugates were tested. Black-Right-Pointing-Pointer The conjugate with 30% starch composition was degraded by {alpha}-amylase significantly. Black-Right-Pointing-Pointer Higher starch composition in conjugates prevented protease and lysozyme degradation. Black-Right-Pointing-Pointer Fibroin incorporation effectively increased the cell proliferation of conjugates.

Recent Advances in Conjugated Polymers for Light Emitting Devices

Science.gov (United States)

AlSalhi, Mohamad Saleh; Alam, Javed; Dass, Lawrence Arockiasamy; Raja, Mohan

2011-01-01

A recent advance in the field of light emitting polymers has been the discovery of electroluminescent conjugated polymers, that is, kind of fluorescent polymers that emit light when excited by the flow of an electric current. These new generation fluorescent materials may now challenge the domination by inorganic semiconductor materials of the commercial market in light-emitting devices such as light-emitting diodes (LED) and polymer laser devices. This review provides information on unique properties of conjugated polymers and how they have been optimized to generate these properties. The review is organized in three sections focusing on the major advances in light emitting materials, recent literature survey and understanding the desirable properties as well as modern solid state lighting and displays. Recently, developed conjugated polymers are also functioning as roll-up displays for computers and mobile phones, flexible solar panels for power portable equipment as well as organic light emitting diodes in displays, in which television screens, luminous traffic, information signs, and light-emitting wallpaper in homes are also expected to broaden the use of conjugated polymers as light emitting polymers. The purpose of this review paper is to examine conjugated polymers in light emitting diodes (LEDs) in addition to organic solid state laser. Furthermore, since conjugated polymers have been approved as light-emitting organic materials similar to inorganic semiconductors, it is clear to motivate these organic light-emitting devices (OLEDs) and organic lasers for modern lighting in terms of energy saving ability. In addition, future aspects of conjugated polymers in LEDs were also highlighted in this review. PMID:21673938

Nested Sampling with Constrained Hamiltonian Monte Carlo

OpenAIRE

Betancourt, M. J.

2010-01-01

Nested sampling is a powerful approach to Bayesian inference ultimately limited by the computationally demanding task of sampling from a heavily constrained probability distribution. An effective algorithm in its own right, Hamiltonian Monte Carlo is readily adapted to efficiently sample from any smooth, constrained distribution. Utilizing this constrained Hamiltonian Monte Carlo, I introduce a general implementation of the nested sampling algorithm.

Some aspects of geomagnetically conjugate phenomena

Energy Technology Data Exchange (ETDEWEB)

Rycroft, M.J.

1987-12-01

Both charged particles and waves convey information about the thermosphere, ionosphere and magnetosphere from the Northern to the Southern Hemisphere and vice versa, along geomagnetic flux tubes.The interhemispheric travel time of electrons or ions, being dependent upon L-value , pitch angle and energy (which may lie between less than or equal to 1 eV and greater than or equal to 1 MeV) may be many hours, ranging down to less than or equal to 1 s. However, the one-hop propagation time for magnetohydrodynamic or whistler mode waves generally lies between 10/sup 2/s and 1 s. Such times, therefore, give the time scales of transient phenomena that are geomagnetically conjugate and of changes in steady-state plasma processes occurring in geomagnetically conjugate regions. Contrasting examples are presented of conjugate physical phenomena, obtained using satellite, rocket, aircraft and ground-based observations; the latter capitalise upon the rather rare disposition of land - rather than ocean - at each end of a geophysically interesting flux tube. Particular attention is paid to the interactions between whistler mode waves and energetic electrons. Geomagnetic, radio, optical and plasma observations, taken together with model computations, provide a wealth of knowledge on conjugate phenomena and their dependence on conditions in the solar wind, substorms, L-value, etc... Finally, some suggestions are made for future lines of research.

Comparative cytotoxicity of gold-doxorubicin and InP-doxorubicin conjugates.

Science.gov (United States)

Zhang, Xuan; Chibli, Hicham; Kong, Dekun; Nadeau, Jay

2012-07-11

Direct comparisons of different types of nanoparticles for drug delivery have seldom been performed. In this study we compare the physical properties and cellular activity of doxorubicin (Dox) conjugates to gold nanoparticles (Au) and InP quantum dots of comparable diameter. Although the Au particles alone are non-toxic and InP is moderately toxic, Au-Dox is more effective than InP-Dox against the Dox-resistant B16 melanoma cell line. Light exposure does not augment the efficacy of InP-Dox, suggesting that conjugates are breaking down. Electron and confocal microscopy and atomic absorption spectroscopy reveal that over 60% of the Au-Dox conjugates reach the cell nucleus. In contrast, InP-Dox enters cell nuclei to a very limited extent, although liberated Dox from the conjugates does eventually reach the nucleus. These observations are attributed to faster Dox release from Au conjugates under endosomal conditions, greater aggregation of InP-Dox with cytoplasmic proteins, and adherence of InP to membranes. These findings have important implications for design of active drug-nanoparticle conjugates.

Synthesis and evaluation of the antioxidative potential of minoxidil-polyamine conjugates.

Science.gov (United States)

Hadjipavlou-Litina, Dimitra; Magoulas, George E; Bariamis, Stavros E; Tsimali, Zinovia; Avgoustakis, Konstantinos; Kontogiorgis, Christos A; Athanassopoulos, Constantinos M; Papaioannou, Dionissios

2013-07-01

A series of conjugates (MNX-CO-PA) of minoxidil (MNX) with the polyamines (PAs) putrescine (PUT), spermidine (SPD) and spermine (SPM) as well as dopamine were produced through activation of MNX with N,N'-carbonyldiimidazole, followed by reaction with dopamine or selectively protected PAs and acid-mediated deprotection. These conjugates together with conjugates of the general type MNX-PA or PA-MNX-PA, readily produced using literature protocols, were tested as antioxidants. The most potent inhibitors of lipid peroxidation were the conjugates MNX-SPM (2, 94%), SPM-MNX-SPM (4, 94%) and MNX-N(4)-SPD (7, 91%) and MNX (91%). The most powerful lipoxygenase (LOX) inhibitors were MNX (IC50 = 20 μM) and the conjugates MNX-N(8)-SPD (9, IC50 = 22.1 μM), MNX-CO-dopamine (11, IC50 = 28 μM) and MNX-N(1)-SPD (8, IC50 = 30 μM). The most interesting conjugates 2, MNX-CO-PUT (5), 8 and 11 as well as MNX were generally found to exhibit weaker (22-36.5%) or no (conjugate 8) anti-inflammatory activity than indomethacin (47%) with the exception of MNX which showed almost equal potency (49%) to indomethacin. The cytocompatibility of conjugates and MNX at the highest concentration of 100 μM showed a survival percentage of 87-107%, with the exception of conjugates with SPM (compound 2) and MNX-CO-SPM (6), which showed considerable cytotoxicity (survival percentage 8-14%). Molecular docking studies were carried on conjugate 9 and the parent compound MNX and were found to be in accordance with our experimental biological results. Copyright © 2013 Elsevier Masson SAS. All rights reserved.

Anticancer activity of drug conjugates in head and neck cancer cells.

Science.gov (United States)

Majumdar, Debatosh; Rahman, Mohammad Aminur; Chen, Zhuo Georgia; Shin, Dong M

2016-06-01

Sexually transmitted oral cancer/head and neck cancer is increasing rapidly. Human papilloma virus (HPV) is playing a role in the pathogenesis of a subset of squamous cell carcinoma of head and neck (SCCHN). Paclitaxel is a widely used anticancer drug for breast, ovarian, testicular, cervical, non-small cell lung, head and neck cancer. However, it is water insoluble and orally inactive. We report the synthesis of water soluble nanosize conjugates of paclitaxel, branched PEG, and EGFR-targeting peptide by employing native chemical ligation. We performed a native chemical ligation between the N-hydroxy succinimide (NHS) ester of paclitaxel succinate and cysteine at pH 6.5 to give the cysteine-conjugated paclitaxel derivative. The thiol functionality of cysteine was activated and subsequently conjugated to multiarm thiol-PEG to obtain the paclitaxel branched PEG conjugate. Finally, we conjugated an EGFR-targeting peptide to obtain conjugates of paclitaxel, branched PEG, and EGFR-targeting peptide. These conjugates show anticancer activity against squamous cell carcinoma of head and neck cells (SCCHN, Tu212).

Small angle scattering from protein/sugar conjugates

Science.gov (United States)

Jackson, Andrew; White, John

2006-11-01

The Maillard reaction between free amine groups on proteins and sugars is well known. We have examined the effect of the reaction of the casein group of milk proteins with sugars on their nanoscale structure and aggregation. The small angle neutron scattering from beta casein and sodium caseinate and their sugar conjugates have been studied as a function of solution concentration. At high conjugate concentration (greater than ca. 5 mg/ml) the addition of sugar reduces supra-micellar aggregation of the protein whilst at lower concentration, where the protein is expected to be deaggregated already, little effect is seen. Guinier analysis of the scattering data show a radius of gyration of around 75 A˚ for beta casein in solution and around 80 A˚ for the sucrose conjugate.

Clustering Using Boosted Constrained k-Means Algorithm

Directory of Open Access Journals (Sweden)

Masayuki Okabe

2018-03-01

Full Text Available This article proposes a constrained clustering algorithm with competitive performance and less computation time to the state-of-the-art methods, which consists of a constrained k-means algorithm enhanced by the boosting principle. Constrained k-means clustering using constraints as background knowledge, although easy to implement and quick, has insufficient performance compared with metric learning-based methods. Since it simply adds a function into the data assignment process of the k-means algorithm to check for constraint violations, it often exploits only a small number of constraints. Metric learning-based methods, which exploit constraints to create a new metric for data similarity, have shown promising results although the methods proposed so far are often slow depending on the amount of data or number of feature dimensions. We present a method that exploits the advantages of the constrained k-means and metric learning approaches. It incorporates a mechanism for accepting constraint priorities and a metric learning framework based on the boosting principle into a constrained k-means algorithm. In the framework, a metric is learned in the form of a kernel matrix that integrates weak cluster hypotheses produced by the constrained k-means algorithm, which works as a weak learner under the boosting principle. Experimental results for 12 data sets from 3 data sources demonstrated that our method has performance competitive to those of state-of-the-art constrained clustering methods for most data sets and that it takes much less computation time. Experimental evaluation demonstrated the effectiveness of controlling the constraint priorities by using the boosting principle and that our constrained k-means algorithm functions correctly as a weak learner of boosting.

Quantum dot-polymer conjugates for stable luminescent displays.

Science.gov (United States)

Ghimire, Sushant; Sivadas, Anjaly; Yuyama, Ken-Ichi; Takano, Yuta; Francis, Raju; Biju, Vasudevanpillai

2018-05-23

The broad absorption of light in the UV-Vis-NIR region and the size-based tunable photoluminescence color of semiconductor quantum dots make these tiny crystals one of the most attractive antennae in solar cells and phosphors in electrooptical devices. One of the primary requirements for such real-world applications of quantum dots is their stable and uniform distribution in optically transparent matrices. In this work, we prepare transparent thin films of polymer-quantum dot conjugates, where CdSe/ZnS quantum dots are uniformly distributed at high densities in a chitosan-polystyrene copolymer (CS-g-PS) matrix. Here, quantum dots in an aqueous solution are conjugated to the copolymer by a phase transfer reaction. With the stable conjugation of quantum dots to the copolymer, we prevent undesired phase separation between the two and aggregation of quantum dots. Furthermore, the conjugate allows us to prepare transparent thin films in which quantum dots are uniformly distributed at high densities. The CS-g-PS copolymer helps us in not only preserving the photoluminescence properties of quantum dots in the film but also rendering excellent photostability to quantum dots at the ensemble and single particle levels, making the conjugate a promising material for photoluminescence-based devices.

Free and conjugated dopamine in human ventricular fluid

International Nuclear Information System (INIS)

Sharpless, N.S.; Thal, L.J.; Wolfson, L.I.; Tabaddor, K.; Tyce, G.M.; Waltz, J.M.

1981-01-01

Free dopamine and an acid hydrolyzable conjugate of dopamine were measured in human ventricular fluid specimens with a radioenzymatic assay and by high performance liquid chromatography (HPLC) with electrochemical detection. Only trace amounts of free norepinephrine and dopamine were detected in ventricular fluid from patients with movement disorders. When the ventricular fluid was hydrolyzed by heating in HClO 4 or by lyophilization in dilute HClO 4 , however, a substantial amount of free dopamine was released. Values for free plus conjugated dopamine in ventricular fluid from patients who had never taken L-DOPA ranged from 139 to 340 pg/ml when determined by HPLC and from 223 to 428 pg/ml when measured radioenzymatically. The correlation coefficient for values obtained by the two methods in the same sample of CSF was 0.94 (P<0.001). Patients who had been treated with L-DOPA had higher levels of conjugated dopamine in their ventricular CSF which correlated inversely with the time between the last dose of L-DOPA and withdrawal of the ventricular fluid. Additionally, one patient with acute cerebral trauma had elevated levels of free norepinephrine and both free and conjugated dopamine in his ventricular fluid. Conjugation may be an important inactivation pathway for released dopamine in man. (Auth.)

Conjugal conflict and violence: a review and theoretical paradigm.

Science.gov (United States)

Smilkstein, G; Aspy, C B; Quiggins, P A

1994-02-01

Conjugal violence has been described as having multiple etiologies. The variables are so numerous that intervention and research protocols are difficult to effect. This paper proposes a paradigm that establishes conjugal conflict and violence as separate entities. According to the paradigm, conjugal conflict is viewed as "an inevitable part of human association," whereas conjugal violence is determined to be a learned behavioral tactic that is employed as a coping strategy when an individual's conflict threshold potential is exceeded. Evidence will be offered that violence is learned from family of origin and from observing what is common or accepted practice in the community. Use of this paradigm would give primacy to community education programs that advance the concept of conflict resolution through rational discourse.

DNA-cell conjugates

Science.gov (United States)

Hsiao, Shih-Chia; Francis, Matthew B.; Bertozzi, Carolyn; Mathies, Richard; Chandra, Ravi; Douglas, Erik; Twite, Amy; Toriello, Nicholas; Onoe, Hiroaki

2016-05-03

The present invention provides conjugates of DNA and cells by linking the DNA to a native functional group on the cell surface. The cells can be without cell walls or can have cell walls. The modified cells can be linked to a substrate surface and used in assay or bioreactors.

DNA-cell conjugates

Science.gov (United States)

Hsiao, Shih-Chia; Francis, Matthew B.; Bertozzi, Carolyn; Mathies, Richard; Chandra, Ravi; Douglas, Erik; Twite, Amy; Toriello, Nicholas; Onoe, Hiroaki

2018-05-15

The present invention provides conjugates of DNA and cells by linking the DNA to a native functional group on the cell surface. The cells can be without cell walls or can have cell walls. The modified cells can be linked to a substrate surface and used in assay or bioreactors.

Electrochemomechanical constrained multiobjective optimization of PPy/MWCNT actuators

International Nuclear Information System (INIS)

Khalili, N; Naguib, H E; Kwon, R H

2014-01-01

Polypyrrole (PPy) conducting polymers have shown a great potential for the fabrication of conjugated polymer-based actuating devices. Consequently, they have been a key point in developing many advanced emerging applications such as biomedical devices and biomimetic robotics. When designing an actuator, taking all of the related decision variables, their roles and relationships into consideration is of pivotal importance to determine the actuator’s final performance. Therefore, the central focus of this study is to develop an electrochemomechanical constrained multiobjective optimization model of a PPy/MWCNTs trilayer actuator. For this purpose, the objective functions are designed to capture the three main characteristics of these actuators, namely their tip vertical displacement, blocking force and response time. To obtain the optimum range of the designated decision variables within the feasible domain, a multiobjective optimization algorithm is applied while appropriate constraints are imposed. The optimum points form a Pareto surface on which they are consistently spread. The numerical results are presented; these results enable one to design an actuator with consideration to the desired output performances. For the experimental analysis, a multilayer bending-type actuator is fabricated, which is composed of a PVDF layer and two layers of PPy with an incorporated layer of multi-walled carbon nanotubes deposited on each side of the PVDF membrane. The numerical results are experimentally verified; in order to determine the performance of the fabricated actuator, its outputs are compared with a neat PPy actuator’s experimental and numerical counterparts. (paper)

Structure and function of nanoparticle-protein conjugates

International Nuclear Information System (INIS)

Aubin-Tam, M-E; Hamad-Schifferli, K

2008-01-01

Conjugation of proteins to nanoparticles has numerous applications in sensing, imaging, delivery, catalysis, therapy and control of protein structure and activity. Therefore, characterizing the nanoparticle-protein interface is of great importance. A variety of covalent and non-covalent linking chemistries have been reported for nanoparticle attachment. Site-specific labeling is desirable in order to control the protein orientation on the nanoparticle, which is crucial in many applications such as fluorescence resonance energy transfer. We evaluate methods for successful site-specific attachment. Typically, a specific protein residue is linked directly to the nanoparticle core or to the ligand. As conjugation often affects the protein structure and function, techniques to probe structure and activity are assessed. We also examine how molecular dynamics simulations of conjugates would complete those experimental techniques in order to provide atomistic details on the effect of nanoparticle attachment. Characterization studies of nanoparticle-protein complexes show that the structure and function are influenced by the chemistry of the nanoparticle ligand, the nanoparticle size, the nanoparticle material, the stoichiometry of the conjugates, the labeling site on the protein and the nature of the linkage (covalent versus non-covalent)

Fullerene–biomolecule conjugates and their biomedicinal applications

Directory of Open Access Journals (Sweden)

Yang X

2013-12-01

Full Text Available Xinlin Yang,1 Ali Ebrahimi,1 Jie Li,1,2 Quanjun Cui11Orthopaedic Research Laboratory, Department of Orthopaedic Surgery, University of Virginia School of Medicine, Charlottesville, VA, USA; 2School of Materials Science, Beijing Institute of Technology, Beijing, People's Republic of ChinaAbstract: Fullerenes are among the strongest antioxidants and are characterized as "radical sponges." The research on biomedicinal applications of fullerenes has achieved significant progress since the landmark publication by Friedman et al in 1993. Fullerene–biomolecule conjugates have become an important area of research during the past 2 decades. By a thorough literature search, we attempt to update the information about the synthesis of different types of fullerene–biomolecule conjugates, including fullerene-containing amino acids and peptides, oligonucleotides, sugars, and esters. Moreover, we also discuss in this review recently reported data on the biological and pharmaceutical utilities of these compounds and some other fullerene derivatives of biomedical importance. While within the fullerene–biomolecule conjugates, in which fullerene may act as both an antioxidant and a carrier, specific targeting biomolecules conjugated to fullerene will undoubtedly strengthen the delivery of functional fullerenes to sites of clinical interest.Keywords: fullerene, amino acid, peptide, oligonucleotide, sugar, ester

The Synthesis of Substituted Piperazine-cholesterol Conjugates for ...

African Journals Online (AJOL)

A small library of cholesterol-piperazine conjugates were synthesized by the reaction of cholesteryl chloroformate with a set of substituted piperazines in dichloromethane at room temperature. The conjugates, all obtained in good to excellent yields, were synthesized to be key components of nucleic acid transfection ...

Nanostructured conjugated polymers in chemical sensors: synthesis, properties and applications.

Science.gov (United States)

Correa, D S; Medeiros, E S; Oliveira, J E; Paterno, L G; Mattoso, Luiz C

2014-09-01

Conjugated polymers are organic materials endowed with a π-electron conjugation along the polymer backbone that present appealing electrical and optical properties for technological applications. By using conjugated polymeric materials in the nanoscale, such properties can be further enhanced. In addition, the use of nanostructured materials makes possible miniaturize devices at the micro/nano scale. The applications of conjugated nanostructured polymers include sensors, actuators, flexible displays, discrete electronic devices, and smart fabric, to name a few. In particular, the use of conjugated polymers in chemical and biological sensors is made feasible owning to their sensitivity to the physicochemical conditions of its surrounding environment, such as chemical composition, pH, dielectric constant, humidity or even temperature. Subtle changes in these conditions bring about variations on the electrical (resistivity and capacitance), optical (absorptivity, luminescence, etc.), and mechanical properties of the conjugated polymer, which can be precisely measured by different experimental methods and ultimately associated with a specific analyte and its concentration. The present review article highlights the main features of conjugated polymers that make them suitable for chemical sensors. An especial emphasis is given to nanostructured sensors systems, which present high sensitivity and selectivity, and find application in beverage and food quality control, pharmaceutical industries, medical diagnosis, environmental monitoring, and homeland security, and other applications as discussed throughout this review.

Intense correlation between brain infarction and protein-conjugated acrolein.

Science.gov (United States)

Saiki, Ryotaro; Nishimura, Kazuhiro; Ishii, Itsuko; Omura, Tomohiro; Okuyama, Shigeru; Kashiwagi, Keiko; Igarashi, Kazuei

2009-10-01

We recently found that increases in plasma levels of protein-conjugated acrolein and polyamine oxidases, enzymes that produce acrolein, are good markers for stroke. The aim of this study was to determine whether the level of protein-conjugated acrolein is increased and levels of spermine and spermidine, the substrates of acrolein production, are decreased at the locus of infarction. A unilateral infarction was induced in mouse brain by photoinduction after injection of Rose Bengal. The volume of the infarction was analyzed using the public domain National Institutes of Health image program. The level of protein-conjugated acrolein at the locus of infarction and in plasma was measured by Western blotting and enzyme-linked immunosorbent assay, respectively. The levels of polyamines at the locus of infarction and in plasma were measured by high-performance liquid chromatography. The level of protein-conjugated acrolein was greatly increased, and levels of spermine and spermidine were decreased at the locus of infarction at 24 hours after the induction of stroke. The size of infarction was significantly decreased by N-acetylcysteine, a scavenger of acrolein. It was also found that the increases in the protein-conjugated acrolein, polyamines, and polyamine oxidases in plasma were observed after the induction of stroke. The results indicate that the induction of infarction is well correlated with the increase in protein-conjugated acrolein at the locus of infarction and in plasma.

Active constrained layer damping of geometrically nonlinear vibrations of functionally graded plates using piezoelectric fiber-reinforced composites

International Nuclear Information System (INIS)

Panda, Satyajit; Ray, M C

2008-01-01

In this paper, a geometrically nonlinear dynamic analysis has been presented for functionally graded (FG) plates integrated with a patch of active constrained layer damping (ACLD) treatment and subjected to a temperature field. The constraining layer of the ACLD treatment is considered to be made of the piezoelectric fiber-reinforced composite (PFRC) material. The temperature field is assumed to be spatially uniform over the substrate plate surfaces and varied through the thickness of the host FG plates. The temperature-dependent material properties of the FG substrate plates are assumed to be graded in the thickness direction of the plates according to a power-law distribution while the Poisson's ratio is assumed to be a constant over the domain of the plate. The constrained viscoelastic layer of the ACLD treatment is modeled using the Golla–Hughes–McTavish (GHM) method. Based on the first-order shear deformation theory, a three-dimensional finite element model has been developed to model the open-loop and closed-loop nonlinear dynamics of the overall FG substrate plates under the thermal environment. The analysis suggests the potential use of the ACLD treatment with its constraining layer made of the PFRC material for active control of geometrically nonlinear vibrations of FG plates in the absence or the presence of the temperature gradient across the thickness of the plates. It is found that the ACLD treatment is more effective in controlling the geometrically nonlinear vibrations of FG plates than in controlling their linear vibrations. The analysis also reveals that the ACLD patch is more effective for controlling the nonlinear vibrations of FG plates when it is attached to the softest surface of the FG plates than when it is bonded to the stiffest surface of the plates. The effect of piezoelectric fiber orientation in the active constraining PFRC layer on the damping characteristics of the overall FG plates is also discussed

Active constrained layer damping of geometrically nonlinear vibrations of functionally graded plates using piezoelectric fiber-reinforced composites

Science.gov (United States)

Panda, Satyajit; Ray, M. C.

2008-04-01

In this paper, a geometrically nonlinear dynamic analysis has been presented for functionally graded (FG) plates integrated with a patch of active constrained layer damping (ACLD) treatment and subjected to a temperature field. The constraining layer of the ACLD treatment is considered to be made of the piezoelectric fiber-reinforced composite (PFRC) material. The temperature field is assumed to be spatially uniform over the substrate plate surfaces and varied through the thickness of the host FG plates. The temperature-dependent material properties of the FG substrate plates are assumed to be graded in the thickness direction of the plates according to a power-law distribution while the Poisson's ratio is assumed to be a constant over the domain of the plate. The constrained viscoelastic layer of the ACLD treatment is modeled using the Golla-Hughes-McTavish (GHM) method. Based on the first-order shear deformation theory, a three-dimensional finite element model has been developed to model the open-loop and closed-loop nonlinear dynamics of the overall FG substrate plates under the thermal environment. The analysis suggests the potential use of the ACLD treatment with its constraining layer made of the PFRC material for active control of geometrically nonlinear vibrations of FG plates in the absence or the presence of the temperature gradient across the thickness of the plates. It is found that the ACLD treatment is more effective in controlling the geometrically nonlinear vibrations of FG plates than in controlling their linear vibrations. The analysis also reveals that the ACLD patch is more effective for controlling the nonlinear vibrations of FG plates when it is attached to the softest surface of the FG plates than when it is bonded to the stiffest surface of the plates. The effect of piezoelectric fiber orientation in the active constraining PFRC layer on the damping characteristics of the overall FG plates is also discussed.

Optical observations geomagnetically conjugate to sprite-producing lightning discharges

Directory of Open Access Journals (Sweden)

R. A. Marshall

2005-09-01

Full Text Available Theoretical studies have predicted that large positive cloud-to-ground discharges can trigger a runaway avalanche process of relativistic electrons, forming a geomagnetically trapped electron beam. The beam may undergo pitch angle and energy scattering during its traverse of the Earth's magnetosphere, with a small percentage of electrons remaining in the loss cone and precipitating in the magnetically conjugate atmosphere. In particular, N2 1P and N2+1N optical emissions are expected to be observable. In July and August 2003, an attempt was made to detect these optical emissions, called "conjugate sprites", in correlation with sprite observations in Europe near . Sprite observations were made from the Observatoire du Pic du Midi (OMP in the French Pyrenées, and VLF receivers were installed in Europe to detect causative sferics and ionospheric disturbances associated with sprites. In the Southern Hemisphere conjugate region, the Wide-angle Array for Sprite Photometry (WASP was deployed at the South African Astronomical Observatory (SAAO, near Sutherland, South Africa, to observe optical emissions with a field-of-view magnetically conjugate to the Northern Hemisphere observing region. Observations at OMP revealed over 130 documented sprites, with WASP observations covering the conjugate region successfully for 30 of these events. However, no incidences of optical emissions in the conjugate hemisphere were found. Analysis of the conjugate optical data from SAAO, along with ELF energy measurements from Palmer Station, Antarctica, and charge-moment analysis, show that the lightning events during the course of this experiment likely had insufficient intensity to create a relativistic beam. Keywords. Ionosphere (Ionsophere-magnetosphere interactions; Ionospheric disturbances; Instruments and techniques

Covalently bound conjugates of albumin and heparin: Synthesis, fractionation and characterization

NARCIS (Netherlands)

Hennink, Wim E.; Feijen, Jan; Ebert, Charles D.; Kim, Sung Wan

1983-01-01

Covalently bound conjugates of human serum albumin and heparin were prepared as compounds which could improve the blood-compatibility of polymer surfaces either by preadsorption or by covalent coupling of the conjugates onto blood contacting surfaces. The conjugates (10–16 weight % of heparin) were

Small angle scattering from protein/sugar conjugates

International Nuclear Information System (INIS)

Jackson, Andrew; White, John

2006-01-01

The Maillard reaction between free amine groups on proteins and sugars is well known. We have examined the effect of the reaction of the casein group of milk proteins with sugars on their nanoscale structure and aggregation. The small angle neutron scattering from beta casein and sodium caseinate and their sugar conjugates have been studied as a function of solution concentration. At high conjugate concentration (greater than ca. 5mg/ml) the addition of sugar reduces supra-micellar aggregation of the protein whilst at lower concentration, where the protein is expected to be deaggregated already, little effect is seen. Guinier analysis of the scattering data show a radius of gyration of around 75A-bar for beta casein in solution and around 80A-bar for the sucrose conjugate

Small angle scattering from protein/sugar conjugates

Energy Technology Data Exchange (ETDEWEB)

Jackson, Andrew [Research School of Chemistry, Australian National University, Canberra, ACT 0200 (Australia)]. E-mail: ajj@nist.gov; White, John [Research School of Chemistry, Australian National University, Canberra, ACT 0200 (Australia)

2006-11-15

The Maillard reaction between free amine groups on proteins and sugars is well known. We have examined the effect of the reaction of the casein group of milk proteins with sugars on their nanoscale structure and aggregation. The small angle neutron scattering from beta casein and sodium caseinate and their sugar conjugates have been studied as a function of solution concentration. At high conjugate concentration (greater than ca. 5mg/ml) the addition of sugar reduces supra-micellar aggregation of the protein whilst at lower concentration, where the protein is expected to be deaggregated already, little effect is seen. Guinier analysis of the scattering data show a radius of gyration of around 75A-bar for beta casein in solution and around 80A-bar for the sucrose conjugate.

Deciphering conjugative plasmid permissiveness in wastewater microbiomes

DEFF Research Database (Denmark)

Jacquiod, Samuel Jehan Auguste; Brejnrod, Asker Daniel; Milani, Stefan Morberg

2017-01-01

Wastewater treatment plants (WWTPs) are designed to robustly treat polluted water. They are characterized by ceaseless flows of organic, chemical and microbial matter, followed by treatment steps before environmental release. WWTPs are hotspots of horizontal gene transfer between bacteria via...... still remains largely uncharted. Furthermore, current in vitro methods used to assess conjugation in complex microbiomes do not include in situ behaviours of recipient cells, resulting in partial understanding of transfers. We investigated the in vitro conjugation capacities of WWTP microbiomes from...... inlet sewage and outlet treated water using the broad-host range IncP-1 conjugative plasmid, pKJK5. A thorough molecular approach coupling metagenomes to 16S rRNA DNA/cDNA amplicon sequencing was established to characterize microbiomes using the ecological concept of functional response groups. A broad...

Thiolated pectin-doxorubicin conjugates: Synthesis, characterization and anticancer activity studies.

Science.gov (United States)

Cheewatanakornkool, Kamonrak; Niratisai, Sathit; Manchun, Somkamol; Dass, Crispin R; Sriamornsak, Pornsak

2017-10-15

In this paper, pectin was cross-linked by a coupling reaction with either thioglycolic acid or cystamine dihydrochloride to form thiolated pectins. The thiolated pectins were then coupled with doxorubicin (DOX) derivative to obtain thiolated pectin-DOX conjugates by two different methods, disulfide bond formation and disulfide bond exchange. The disulfide bond exchange method provided a simple, fast, and efficient approach for synthesis of thiolated pectin-DOX conjugates, compared to the disulfide bond formation. Characteristics, physicochemical properties, and morphology of thiolated pectins and thiolated pectin-DOX conjugates were determined. DOX content in thiolated pectin-DOX conjugates using low methoxy pectin was found to be higher than that using high methoxy pectin. The in vitro anticancer activity of thiolated pectin-DOX conjugates was significantly higher than that of free DOX, in mouse colon carcinoma and human bone osteosarcoma cells, but insignificantly different from that of free DOX, in human prostate cancer cells. Due to their promising anticancer activity in mouse colon carcinoma cells, the thiolated pectin-DOX conjugates might be suitable for building drug platform for colorectal cancer-targeted delivery of DOX. Copyright © 2017 Elsevier Ltd. All rights reserved.

Less is More: A Comparison of Antibody-Gold Nanoparticle Conjugates of Different Ratios.

Science.gov (United States)

Byzova, Nadezhda A; Safenkova, Irina V; Slutskaya, Elvira S; Zherdev, Anatoly V; Dzantiev, Boris B

2017-11-15

This comprehensive study is related to gold nanoparticles (GNPs) conjugated with antibodies. The goal of the study is to determine the minimal concentration of antibodies for conjugate synthesis when the conjugates have high antigen-capturing activity. Two systems were studied: gold nanoparticles conjugated with monoclonal antibodies (mAb-GNP) specific to Helicobacter pylori and gold nanoparticles conjugated with polyclonal antibodies (pAb-GNP) specific to mouse immunoglobulins. Several conjugates were synthesized with different GNP-to-antibody molar ratios (from 1:1 to 1:245) through nondirectional and noncovalent immobilization on a surface of GNPs with a diameter of 25.3 ± 4.6 nm. The maximal antigen-capturing activities and equilibrium constants of the conjugates correlate with the formation of a constant hydrodynamic radius of the conjugates for mAb-GNP (GNP to antibody molar ratio 1:58) and with the stabilizing concentration by flocculation curves for pAb-GNP (GNP to antibody molar ratio 1:116). The application of the conjugates to the lateral flow immunoassay shows that the antibody concentrations used for the conjugation can be reduced (below the stabilizing concentration) without losing activity for the mAb-GNP conjugates. The findings highlight that the optimal concentration of antibodies immobilized on the surface of GNPs is not always equal to the stabilizing concentration determined by the flocculation curve.

Conjugation vs hyperconjugation in molecular structure of acrolein

Science.gov (United States)

Shishkina, Svitlana V.; Slabko, Anzhelika I.; Shishkin, Oleg V.

2013-01-01

Analysis of geometric parameters of butadiene and acrolein reveals the contradiction between the Csp2-Csp2 bond length in acrolein and classical concept of conjugation degree in the polarized molecules. In this Letter the reasons of this contradiction have been investigated. It is concluded that the Csp2-Csp2 bond length in acrolein is determined by influence of the bonding for it π-π conjugation and antibonding n → σ∗ hyperconjugation between the oxygen lone pair and the antibonding orbital of the single bond. It was shown also this bond length depends on the difference in energy of conjugative and hyperconjugative interactions.

Enhanced photodynamic efficacy of zinc phthalocyanine by conjugating to heptalysine.

Science.gov (United States)

Li, Linsen; Luo, Zhipu; Chen, Zhuo; Chen, Jincan; Zhou, Shanyong; Xu, Peng; Hu, Ping; Wang, Jundong; Chen, Naisheng; Huang, Jinling; Huang, Mingdong

2012-11-21

Zinc phthalocyanine (ZnPc) is a promising photosensitizer for photodynamic therapy, but faces some challenges: ZnPc is insoluble in water and thus requires either special formulation of ZnPc by, e.g., liposome or Cremophor EL, or chemical modification of Pc ring to enhance its bioavailability and photodynamic efficacy. Here, we conjugated monosubstituted ZnPc-COOH with a series of oligolysine moieties with different numbers of lysine residues (ZnPc-(Lys)(n) (n = 1, 3, 5, 7, 9) to improve the water solubility of the ZnPc conjugates. We measured the photosensitizing efficacies and the cellular uptakes of this series of conjugates on a normal and a cancerous cell line. In addition, we developed a sensitive in situ method to distinguish the difference in photodynamic efficacy among conjugates. Our results showed that ZnPc-(Lys)(7) has the highest photodynamic efficacy compared to the other conjugates investigated.

Dose gradient curve: A new tool for evaluating dose gradient.

Science.gov (United States)

Sung, KiHoon; Choi, Young Eun

2018-01-01

Stereotactic radiotherapy, which delivers an ablative high radiation dose to a target volume for maximum local tumor control, requires a rapid dose fall-off outside the target volume to prevent extensive damage to nearby normal tissue. Currently, there is no tool to comprehensively evaluate the dose gradient near the target volume. We propose the dose gradient curve (DGC) as a new tool to evaluate the quality of a treatment plan with respect to the dose fall-off characteristics. The average distance between two isodose surfaces was represented by the dose gradient index (DGI) estimated by a simple equation using the volume and surface area of isodose levels. The surface area was calculated by mesh generation and surface triangulation. The DGC was defined as a plot of the DGI of each dose interval as a function of the dose. Two types of DGCs, differential and cumulative, were generated. The performance of the DGC was evaluated using stereotactic radiosurgery plans for virtual targets. Over the range of dose distributions, the dose gradient of each dose interval was well-characterized by the DGC in an easily understandable graph format. Significant changes in the DGC were observed reflecting the differences in planning situations and various prescription doses. The DGC is a rational method for visualizing the dose gradient as the average distance between two isodose surfaces; the shorter the distance, the steeper the dose gradient. By combining the DGC with the dose-volume histogram (DVH) in a single plot, the DGC can be utilized to evaluate not only the dose gradient but also the target coverage in routine clinical practice.

Nonlinear propagation of phase-conjugate focused sound beams in water

Science.gov (United States)

Brysev, A. P.; Krutyansky, L. M.; Preobrazhensky, V. L.; Pyl'nov, Yu. V.; Cunningham, K. B.; Hamilton, M. F.

2000-07-01

Nonlinear propagation of phase-conjugate, focused, ultrasound beams is studied. Measurements are presented of harmonic amplitudes along the axis and in the focal plane of the conjugate beam, and of the waveform and spectrum at the focus. A maximum peak pressure of 3.9 MPa was recorded in the conjugate beam. The measurements are compared with simulations based on the KZK equation, and satisfactory agreement is obtained.

Simultaneous inhibition of key growth pathways in melanoma cells and tumor regression by a designed bidentate constrained helical peptide.

Science.gov (United States)

Dhar, Amlanjyoti; Mallick, Shampa; Ghosh, Piya; Maiti, Atanu; Ahmed, Israr; Bhattacharya, Seemana; Mandal, Tapashi; Manna, Asit; Roy, Koushik; Singh, Sandeep; Nayak, Dipak Kumar; Wilder, Paul T; Markowitz, Joseph; Weber, David; Ghosh, Mrinal K; Chattopadhyay, Samit; Guha, Rajdeep; Konar, Aditya; Bandyopadhyay, Santu; Roy, Siddhartha

2014-07-01

Protein-protein interactions are part of a large number of signaling networks and potential targets for drug development. However, discovering molecules that can specifically inhibit such interactions is a major challenge. S100B, a calcium-regulated protein, plays a crucial role in the proliferation of melanoma cells through protein-protein interactions. In this article, we report the design and development of a bidentate conformationally constrained peptide against dimeric S100B based on a natural tight-binding peptide, TRTK-12. The helical conformation of the peptide was constrained by the substitution of α-amino isobutyric acid--an amino acid having high helical propensity--in positions which do not interact with S100B. A branched bidentate version of the peptide was bound to S100B tightly with a dissociation constant of 8 nM. When conjugated to a cell-penetrating peptide, it caused growth inhibition and rapid apoptosis in melanoma cells. The molecule exerts antiproliferative action through simultaneous inhibition of key growth pathways, including reactivation of wild-type p53 and inhibition of Akt and STAT3 phosphorylation. The apoptosis induced by the bidentate constrained helix is caused by direct migration of p53 to mitochondria. At moderate intravenous dose, the peptide completely inhibits melanoma growth in a mouse model without any significant observable toxicity. The specificity was shown by lack of ability of a double mutant peptide to cause tumor regression at the same dose level. The methodology described here for direct protein-protein interaction inhibition may be effective for rapid development of inhibitors against relatively weak protein-protein interactions for de novo drug development. © 2014 Wiley Periodicals, Inc.

Ternary gradient metal-organic frameworks.

Science.gov (United States)

Liu, Chong; Rosi, Nathaniel L

2017-09-08

Gradient MOFs contain directional gradients of either structure or functionality. We have successfully prepared two ternary gradient MOFs based on bMOF-100 analogues, namely bMOF-100/102/106 and bMOF-110/100/102, via cascade ligand exchange reactions. The cubic unit cell parameter discrepancy within an individual ternary gradient MOF crystal is as large as ∼1 nm, demonstrating the impressive compatibility and flexibility of the component MOF materials. Because of the presence of a continuum of unit cells, the pore diameters within individual crystals also change in a gradient fashion from ∼2.5 nm to ∼3.0 nm for bMOF-100/102/106, and from ∼2.2 nm to ∼2.7 nm for bMOF-110/100/102, indicating significant porosity gradients. Like previously reported binary gradient MOFs, the composition of the ternary gradient MOFs can be easily controlled by adjusting the reaction conditions. Finally, X-ray diffraction and microspectrophotometry were used to analyse fractured gradient MOF crystals by comparing unit cell parameters and absorbance spectra at different locations, thus revealing the profile of heterogeneity (i.e. gradient distribution of properties) and further confirming the formation of ternary gradient MOFs.

Bio-degradable highly fluorescent conjugated polymer nanoparticles for bio-medical imaging applications.

Science.gov (United States)

Repenko, Tatjana; Rix, Anne; Ludwanowski, Simon; Go, Dennis; Kiessling, Fabian; Lederle, Wiltrud; Kuehne, Alexander J C

2017-09-07

Conjugated polymer nanoparticles exhibit strong fluorescence and have been applied for biological fluorescence imaging in cell culture and in small animals. However, conjugated polymer particles are hydrophobic and often chemically inert materials with diameters ranging from below 50 nm to several microns. As such, conjugated polymer nanoparticles cannot be excreted through the renal system. This drawback has prevented their application for clinical bio-medical imaging. Here, we present fully conjugated polymer nanoparticles based on imidazole units. These nanoparticles can be bio-degraded by activated macrophages. Reactive oxygen species induce scission of the conjugated polymer backbone at the imidazole unit, leading to complete decomposition of the particles into soluble low molecular weight fragments. Furthermore, the nanoparticles can be surface functionalized for directed targeting. The approach opens a wide range of opportunities for conjugated polymer particles in the fields of medical imaging, drug-delivery, and theranostics.Conjugated polymer nanoparticles have been applied for biological fluorescence imaging in cell culture and in small animals, but cannot readily be excreted through the renal system. Here the authors show fully conjugated polymer nanoparticles based on imidazole units that can be bio-degraded by activated macrophages.

Lightweight cryptography for constrained devices

DEFF Research Database (Denmark)

Alippi, Cesare; Bogdanov, Andrey; Regazzoni, Francesco

2014-01-01

Lightweight cryptography is a rapidly evolving research field that responds to the request for security in resource constrained devices. This need arises from crucial pervasive IT applications, such as those based on RFID tags where cost and energy constraints drastically limit the solution...... complexity, with the consequence that traditional cryptography solutions become too costly to be implemented. In this paper, we survey design strategies and techniques suitable for implementing security primitives in constrained devices....

ITMETH, Iterative Routines for Linear System

International Nuclear Information System (INIS)

Greenbaum, A.

1989-01-01

1 - Description of program or function: ITMETH is a collection of iterative routines for solving large, sparse linear systems. 2 - Method of solution: ITMETH solves general linear systems of the form AX=B using a variety of methods: Jacobi iteration; Gauss-Seidel iteration; incomplete LU decomposition or matrix splitting with iterative refinement; diagonal scaling, matrix splitting, or incomplete LU decomposition with the conjugate gradient method for the problem AA'Y=B, X=A'Y; bi-conjugate gradient method with diagonal scaling, matrix splitting, or incomplete LU decomposition; and ortho-min method with diagonal scaling, matrix splitting, or incomplete LU decomposition. ITMETH also solves symmetric positive definite linear systems AX=B using the conjugate gradient method with diagonal scaling or matrix splitting, or the incomplete Cholesky conjugate gradient method

Optical observations geomagnetically conjugate to sprite-producing lightning discharges

Directory of Open Access Journals (Sweden)

R. A. Marshall

2005-09-01

Full Text Available Theoretical studies have predicted that large positive cloud-to-ground discharges can trigger a runaway avalanche process of relativistic electrons, forming a geomagnetically trapped electron beam. The beam may undergo pitch angle and energy scattering during its traverse of the Earth's magnetosphere, with a small percentage of electrons remaining in the loss cone and precipitating in the magnetically conjugate atmosphere. In particular, N₂ 1P and N₂⁺1N optical emissions are expected to be observable. In July and August 2003, an attempt was made to detect these optical emissions, called "conjugate sprites", in correlation with sprite observations in Europe near . Sprite observations were made from the Observatoire du Pic du Midi (OMP in the French Pyrenées, and VLF receivers were installed in Europe to detect causative sferics and ionospheric disturbances associated with sprites. In the Southern Hemisphere conjugate region, the Wide-angle Array for Sprite Photometry (WASP was deployed at the South African Astronomical Observatory (SAAO, near Sutherland, South Africa, to observe optical emissions with a field-of-view magnetically conjugate to the Northern Hemisphere observing region. Observations at OMP revealed over 130 documented sprites, with WASP observations covering the conjugate region successfully for 30 of these events. However, no incidences of optical emissions in the conjugate hemisphere were found. Analysis of the conjugate optical data from SAAO, along with ELF energy measurements from Palmer Station, Antarctica, and charge-moment analysis, show that the lightning events during the course of this experiment likely had insufficient intensity to create a relativistic beam.

Keywords. Ionosphere (Ionsophere-magnetosphere interactions; Ionospheric disturbances; Instruments and techniques

A New Self-Constrained Inversion Method of Potential Fields Based on Probability Tomography

Science.gov (United States)

Sun, S.; Chen, C.; WANG, H.; Wang, Q.

2014-12-01

The self-constrained inversion method of potential fields uses a priori information self-extracted from potential field data. Differing from external a priori information, the self-extracted information are generally parameters derived exclusively from the analysis of the gravity and magnetic data (Paoletti et al., 2013). Here we develop a new self-constrained inversion method based on probability tomography. Probability tomography doesn't need any priori information, as well as large inversion matrix operations. Moreover, its result can describe the sources, especially the distribution of which is complex and irregular, entirely and clearly. Therefore, we attempt to use the a priori information extracted from the probability tomography results to constrain the inversion for physical properties. The magnetic anomaly data was taken as an example in this work. The probability tomography result of magnetic total field anomaly(ΔΤ) shows a smoother distribution than the anomalous source and cannot display the source edges exactly. However, the gradients of ΔΤ are with higher resolution than ΔΤ in their own direction, and this characteristic is also presented in their probability tomography results. So we use some rules to combine the probability tomography results of ∂ΔΤ⁄∂x, ∂ΔΤ⁄∂y and ∂ΔΤ⁄∂z into a new result which is used for extracting a priori information, and then incorporate the information into the model objective function as spatial weighting functions to invert the final magnetic susceptibility. Some magnetic synthetic examples incorporated with and without a priori information extracted from the probability tomography results were made to do comparison, results of which show that the former are more concentrated and with higher resolution of the source body edges. This method is finally applied in an iron mine in China with field measured ΔΤ data and performs well. ReferencesPaoletti, V., Ialongo, S., Florio, G., Fedi, M

$L_{0}$ Gradient Projection.

Science.gov (United States)

Ono, Shunsuke

2017-04-01

Minimizing L 0 gradient, the number of the non-zero gradients of an image, together with a quadratic data-fidelity to an input image has been recognized as a powerful edge-preserving filtering method. However, the L 0 gradient minimization has an inherent difficulty: a user-given parameter controlling the degree of flatness does not have a physical meaning since the parameter just balances the relative importance of the L 0 gradient term to the quadratic data-fidelity term. As a result, the setting of the parameter is a troublesome work in the L 0 gradient minimization. To circumvent the difficulty, we propose a new edge-preserving filtering method with a novel use of the L 0 gradient. Our method is formulated as the minimization of the quadratic data-fidelity subject to the hard constraint that the L 0 gradient is less than a user-given parameter α . This strategy is much more intuitive than the L 0 gradient minimization because the parameter α has a clear meaning: the L 0 gradient value of the output image itself, so that one can directly impose a desired degree of flatness by α . We also provide an efficient algorithm based on the so-called alternating direction method of multipliers for computing an approximate solution of the nonconvex problem, where we decompose it into two subproblems and derive closed-form solutions to them. The advantages of our method are demonstrated through extensive experiments.

Guanidinylated polyethyleneimine-polyoxypropylene-polyoxyethylene conjugates as gene transfection agents.

Science.gov (United States)

Bromberg, Lev; Raduyk, Svetlana; Hatton, T Alan; Concheiro, Angel; Rodriguez-Valencia, Cosme; Silva, Maite; Alvarez-Lorenzo, Carmen

2009-05-20

Conjugates of linear and branched polyethyleneimine (PEI) and monoamine polyether Jeffamine M-2070 (PO/EO mol ratio 10/31, 2000 Da) were synthesized through polyether activation by cyanuric chloride followed by attachment to PEI and guanidinylation by 1H-pyrazole-carboxamidine hydrochloride. The resulting guanidinylated PEI-polyether conjugates (termed gPEI-Jeffamine) efficiently complexed plasmid DNA, and their polyplexes possessed enhanced colloidal stability in the presence of serum proteins. In vitro studies with mammalian CHO-1, 3T3, and Cos-7 cell lines demonstrated improved transfection efficiency of the pCMVbeta-gal plasmid/gPEI-Jeffamine polyplexes. The guanidinylation of the amino groups of PEI and the conjugation of PEI with the Jeffamine polyether enhanced the conjugates' interaction with genetic material and reduced the cytotoxicity of the polyplexes in experiments with the L929 cell line.

Gradient pre-emphasis to counteract first-order concomitant fields on asymmetric MRI gradient systems.

Science.gov (United States)

Tao, Shengzhen; Weavers, Paul T; Trzasko, Joshua D; Shu, Yunhong; Huston, John; Lee, Seung-Kyun; Frigo, Louis M; Bernstein, Matt A

2017-06-01

To develop a gradient pre-emphasis scheme that prospectively counteracts the effects of the first-order concomitant fields for any arbitrary gradient waveform played on asymmetric gradient systems, and to demonstrate the effectiveness of this approach using a real-time implementation on a compact gradient system. After reviewing the first-order concomitant fields that are present on asymmetric gradients, we developed a generalized gradient pre-emphasis model assuming arbitrary gradient waveforms to counteract their effects. A numerically straightforward, easily implemented approximate solution to this pre-emphasis problem was derived that was compatible with the current hardware infrastructure of conventional MRI scanners for eddy current compensation. The proposed method was implemented on the gradient driver subsystem, and its real-time use was tested using a series of phantom and in vivo data acquired from two-dimensional Cartesian phase-difference, echo-planar imaging, and spiral acquisitions. The phantom and in vivo results demonstrated that unless accounted for, first-order concomitant fields introduce considerable phase estimation error into the measured data and result in images with spatially dependent blurring/distortion. The resulting artifacts were effectively prevented using the proposed gradient pre-emphasis. We have developed an efficient and effective gradient pre-emphasis framework to counteract the effects of first-order concomitant fields of asymmetric gradient systems. Magn Reson Med 77:2250-2262, 2017. © 2016 International Society for Magnetic Resonance in Medicine. © 2016 International Society for Magnetic Resonance in Medicine.

Treatment with Cefotaxime Affects Expression of Conjugation Associated Proteins and Conjugation Transfer Frequency of an IncI1 Plasmid in Escherichia coli

DEFF Research Database (Denmark)

Møller, Thea S B; Liu, Gang; Boysen, Anders

2017-01-01

research suggests that the effect of antibiotic treatment on plasmid conjugation frequencies, and hence the spread of resistance plasmids, may have been overestimated. We addressed the question by quantifying transfer proteins and conjugation frequencies of a blaCTX-M-1 encoding IncI1 resistance plasmid....... The frequency of plasmid conjugation, measured in an antibiotic free environment, increased significantly when the donor was pre-grown in broth containing CTX compared to growth without this drug, regardless of whether blaCTX-M-1 was located on the plasmid or in trans on the chromosome. The results shows...

125I Radioimmunoassay of serum ursodeoxycholyl conjugates

International Nuclear Information System (INIS)

Hill, A.; Ross, P.E.; Bouchier, I.A.D.

1983-01-01

A radioimmunoassay for serum ursodeoxycholic conjugates using an iodine-125 ligand has been developed. The bile acid was present in normal fasting serum (0.19 +- SD 0.19 μmol/l, n=24) and 2-hour post-prandial serum (0.8 +- SD 0.8 μmol/l, n=16). Gallstone patients undergoing oral ursodeoxycholic acid therapy had significantly higher post-prandial serum levels (21.5 +- SD 14.0 μmol/l, n=15) by radioimmunoassay. Gas liquid chromatography analysis indicated that in normal serum ursodeoxycholic acid was totally conjugated, whereas sera from gallstone patients contained a proportion as the free bile acid (10.2 +- SD 8.1 μmol/l, n=15). Following an oral dose of ursodeoxycholic acid, both unconjugated and conjugated forms of the bile acid appeared in the serum of healthy individuals. (Auth.)

Bispecific small molecule-antibody conjugate targeting prostate cancer.

Science.gov (United States)

Kim, Chan Hyuk; Axup, Jun Y; Lawson, Brian R; Yun, Hwayoung; Tardif, Virginie; Choi, Sei Hyun; Zhou, Quan; Dubrovska, Anna; Biroc, Sandra L; Marsden, Robin; Pinstaff, Jason; Smider, Vaughn V; Schultz, Peter G

2013-10-29

Bispecific antibodies, which simultaneously target CD3 on T cells and tumor-associated antigens to recruit cytotoxic T cells to cancer cells, are a promising new approach to the treatment of hormone-refractory prostate cancer. Here we report a site-specific, semisynthetic method for the production of bispecific antibody-like therapeutics in which a derivative of the prostate-specific membrane antigen-binding small molecule DUPA was selectively conjugated to a mutant αCD3 Fab containing the unnatural amino acid, p-acetylphenylalanine, at a defined site. Homogeneous conjugates were generated in excellent yields and had good solubility. The efficacy of the conjugate was optimized by modifying the linker structure, relative binding orientation, and stoichiometry of the ligand. The optimized conjugate showed potent and selective in vitro activity (EC50 ~ 100 pM), good serum half-life, and potent in vivo activity in prophylactic and treatment xenograft mouse models. This semisynthetic approach is likely to be applicable to the generation of additional bispecific agents using drug-like ligands selective for other cell-surface receptors.

Bispecific small molecule–antibody conjugate targeting prostate cancer

Science.gov (United States)

Kim, Chan Hyuk; Axup, Jun Y.; Lawson, Brian R.; Yun, Hwayoung; Tardif, Virginie; Choi, Sei Hyun; Zhou, Quan; Dubrovska, Anna; Biroc, Sandra L.; Marsden, Robin; Pinstaff, Jason; Smider, Vaughn V.; Schultz, Peter G.

2013-01-01

Bispecific antibodies, which simultaneously target CD3 on T cells and tumor-associated antigens to recruit cytotoxic T cells to cancer cells, are a promising new approach to the treatment of hormone-refractory prostate cancer. Here we report a site-specific, semisynthetic method for the production of bispecific antibody-like therapeutics in which a derivative of the prostate-specific membrane antigen-binding small molecule DUPA was selectively conjugated to a mutant αCD3 Fab containing the unnatural amino acid, p-acetylphenylalanine, at a defined site. Homogeneous conjugates were generated in excellent yields and had good solubility. The efficacy of the conjugate was optimized by modifying the linker structure, relative binding orientation, and stoichiometry of the ligand. The optimized conjugate showed potent and selective in vitro activity (EC50 ∼100 pM), good serum half-life, and potent in vivo activity in prophylactic and treatment xenograft mouse models. This semisynthetic approach is likely to be applicable to the generation of additional bispecific agents using drug-like ligands selective for other cell-surface receptors. PMID:24127589

Synthesis and characterization of nido-carborane-cobalamin conjugates

International Nuclear Information System (INIS)

Hogenkamp, Harry P.C.; Collins, Douglas A.; Live, David; Benson, Linda M.; Naylor, Stephen