Performance of local optimization in single-plane fluoroscopic analysis for total knee arthroplasty.

PubMed

Prins, A H; Kaptein, B L; Stoel, B C; Lahaye, D J P; Valstar, E R

2015-11-05

Fluoroscopy-derived joint kinematics plays an important role in the evaluation of knee prostheses. Fluoroscopic analysis requires estimation of the 3D prosthesis pose from its 2D silhouette in the fluoroscopic image, by optimizing a dissimilarity measure. Currently, extensive user-interaction is needed, which makes analysis labor-intensive and operator-dependent. The aim of this study was to review five optimization methods for 3D pose estimation and to assess their performance in finding the correct solution. Two derivative-free optimizers (DHSAnn and IIPM) and three gradient-based optimizers (LevMar, DoNLP2 and IpOpt) were evaluated. For the latter three optimizers two different implementations were evaluated: one with a numerically approximated gradient and one with an analytically derived gradient for computational efficiency. On phantom data, all methods were able to find the 3D pose within 1mm and 1° in more than 85% of cases. IpOpt had the highest success-rate: 97%. On clinical data, the success rates were higher than 85% for the in-plane positions, but not for the rotations. IpOpt was the most expensive method and the application of an analytically derived gradients accelerated the gradient-based methods by a factor 3-4 without any differences in success rate. In conclusion, 85% of the frames can be analyzed automatically in clinical data and only 15% of the frames require manual supervision. The optimal success-rate on phantom data (97% with IpOpt) on phantom data indicates that even less supervision may become feasible. Copyright © 2015 Elsevier Ltd. All rights reserved.

MR-based field-of-view extension in MR/PET: B0 homogenization using gradient enhancement (HUGE).

PubMed

Blumhagen, Jan O; Ladebeck, Ralf; Fenchel, Matthias; Scheffler, Klaus

2013-10-01

In whole-body MR/PET, the human attenuation correction can be based on the MR data. However, an MR-based field-of-view (FoV) is limited due to physical restrictions such as B0 inhomogeneities and gradient nonlinearities. Therefore, for large patients, the MR image and the attenuation map might be truncated and the attenuation correction might be biased. The aim of this work is to explore extending the MR FoV through B0 homogenization using gradient enhancement in which an optimal readout gradient field is determined to locally compensate B0 inhomogeneities and gradient nonlinearities. A spin-echo-based sequence was developed that computes an optimal gradient for certain regions of interest, for example, the patient's arms. A significant distortion reduction was achieved outside the normal MR-based FoV. This FoV extension was achieved without any hardware modifications. In-plane distortions in a transaxially extended FoV of up to 600 mm were analyzed in phantom studies. In vivo measurements of the patient's arms lying outside the normal specified FoV were compared with and without the use of B0 homogenization using gradient enhancement. In summary, we designed a sequence that provides data for reducing the image distortions due to B0 inhomogeneities and gradient nonlinearities and used the data to extend the MR FoV. Copyright © 2011 Wiley Periodicals, Inc.

Preliminary Structural Design Using Topology Optimization with a Comparison of Results from Gradient and Genetic Algorithm Methods

NASA Technical Reports Server (NTRS)

Burt, Adam O.; Tinker, Michael L.

2014-01-01

In this paper, genetic algorithm based and gradient-based topology optimization is presented in application to a real hardware design problem. Preliminary design of a planetary lander mockup structure is accomplished using these methods that prove to provide major weight savings by addressing the structural efficiency during the design cycle. This paper presents two alternative formulations of the topology optimization problem. The first is the widely-used gradient-based implementation using commercially available algorithms. The second is formulated using genetic algorithms and internally developed capabilities. These two approaches are applied to a practical design problem for hardware that has been built, tested and proven to be functional. Both formulations converged on similar solutions and therefore were proven to be equally valid implementations of the process. This paper discusses both of these formulations at a high level.

Topology optimization of finite strain viscoplastic systems under transient loads [Dynamic topology optimization based on finite strain visco-plasticity

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ivarsson, Niklas; Wallin, Mathias; Tortorelli, Daniel

In this paper, a transient finite strain viscoplastic model is implemented in a gradient-based topology optimization framework to design impact mitigating structures. The model's kinematics relies on the multiplicative split of the deformation gradient, and the constitutive response is based on isotropic hardening viscoplasticity. To solve the mechanical balance laws, the implicit Newmark-beta method is used together with a total Lagrangian finite element formulation. The optimization problem is regularized using a partial differential equation filter and solved using the method of moving asymptotes. Sensitivities required to solve the optimization problem are derived using the adjoint method. To demonstrate the capabilitymore » of the algorithm, several protective systems are designed, in which the absorbed viscoplastic energy is maximized. Finally, the numerical examples demonstrate that transient finite strain viscoplastic effects can successfully be combined with topology optimization.« less

Topology optimization of finite strain viscoplastic systems under transient loads [Dynamic topology optimization based on finite strain visco-plasticity

DOE PAGES

Ivarsson, Niklas; Wallin, Mathias; Tortorelli, Daniel

2018-02-08

In this paper, a transient finite strain viscoplastic model is implemented in a gradient-based topology optimization framework to design impact mitigating structures. The model's kinematics relies on the multiplicative split of the deformation gradient, and the constitutive response is based on isotropic hardening viscoplasticity. To solve the mechanical balance laws, the implicit Newmark-beta method is used together with a total Lagrangian finite element formulation. The optimization problem is regularized using a partial differential equation filter and solved using the method of moving asymptotes. Sensitivities required to solve the optimization problem are derived using the adjoint method. To demonstrate the capabilitymore » of the algorithm, several protective systems are designed, in which the absorbed viscoplastic energy is maximized. Finally, the numerical examples demonstrate that transient finite strain viscoplastic effects can successfully be combined with topology optimization.« less

Research on particle swarm optimization algorithm based on optimal movement probability

NASA Astrophysics Data System (ADS)

Ma, Jianhong; Zhang, Han; He, Baofeng

2017-01-01

The particle swarm optimization algorithm to improve the control precision, and has great application value training neural network and fuzzy system control fields etc.The traditional particle swarm algorithm is used for the training of feed forward neural networks,the search efficiency is low, and easy to fall into local convergence.An improved particle swarm optimization algorithm is proposed based on error back propagation gradient descent. Particle swarm optimization for Solving Least Squares Problems to meme group, the particles in the fitness ranking, optimization problem of the overall consideration, the error back propagation gradient descent training BP neural network, particle to update the velocity and position according to their individual optimal and global optimization, make the particles more to the social optimal learning and less to its optimal learning, it can avoid the particles fall into local optimum, by using gradient information can accelerate the PSO local search ability, improve the multi beam particle swarm depth zero less trajectory information search efficiency, the realization of improved particle swarm optimization algorithm. Simulation results show that the algorithm in the initial stage of rapid convergence to the global optimal solution can be near to the global optimal solution and keep close to the trend, the algorithm has faster convergence speed and search performance in the same running time, it can improve the convergence speed of the algorithm, especially the later search efficiency.

Gradient-based Optimization for Poroelastic and Viscoelastic MR Elastography

PubMed Central

Tan, Likun; McGarry, Matthew D.J.; Van Houten, Elijah E.W.; Ji, Ming; Solamen, Ligin; Weaver, John B.

2017-01-01

We describe an efficient gradient computation for solving inverse problems arising in magnetic resonance elastography (MRE). The algorithm can be considered as a generalized ‘adjoint method’ based on a Lagrangian formulation. One requirement for the classic adjoint method is assurance of the self-adjoint property of the stiffness matrix in the elasticity problem. In this paper, we show this property is no longer a necessary condition in our algorithm, but the computational performance can be as efficient as the classic method, which involves only two forward solutions and is independent of the number of parameters to be estimated. The algorithm is developed and implemented in material property reconstructions using poroelastic and viscoelastic modeling. Various gradient- and Hessian-based optimization techniques have been tested on simulation, phantom and in vivo brain data. The numerical results show the feasibility and the efficiency of the proposed scheme for gradient calculation. PMID:27608454

Optimization of wind plant layouts using an adjoint approach

DOE PAGES

King, Ryan N.; Dykes, Katherine; Graf, Peter; ...

2017-03-10

Using adjoint optimization and three-dimensional steady-state Reynolds-averaged Navier–Stokes (RANS) simulations, we present a new gradient-based approach for optimally siting wind turbines within utility-scale wind plants. By solving the adjoint equations of the flow model, the gradients needed for optimization are found at a cost that is independent of the number of control variables, thereby permitting optimization of large wind plants with many turbine locations. Moreover, compared to the common approach of superimposing prescribed wake deficits onto linearized flow models, the computational efficiency of the adjoint approach allows the use of higher-fidelity RANS flow models which can capture nonlinear turbulent flowmore » physics within a wind plant. The steady-state RANS flow model is implemented in the Python finite-element package FEniCS and the derivation and solution of the discrete adjoint equations are automated within the dolfin-adjoint framework. Gradient-based optimization of wind turbine locations is demonstrated for idealized test cases that reveal new optimization heuristics such as rotational symmetry, local speedups, and nonlinear wake curvature effects. Layout optimization is also demonstrated on more complex wind rose shapes, including a full annual energy production (AEP) layout optimization over 36 inflow directions and 5 wind speed bins.« less

Optimization of wind plant layouts using an adjoint approach

DOE Office of Scientific and Technical Information (OSTI.GOV)

King, Ryan N.; Dykes, Katherine; Graf, Peter

Using adjoint optimization and three-dimensional steady-state Reynolds-averaged Navier–Stokes (RANS) simulations, we present a new gradient-based approach for optimally siting wind turbines within utility-scale wind plants. By solving the adjoint equations of the flow model, the gradients needed for optimization are found at a cost that is independent of the number of control variables, thereby permitting optimization of large wind plants with many turbine locations. Moreover, compared to the common approach of superimposing prescribed wake deficits onto linearized flow models, the computational efficiency of the adjoint approach allows the use of higher-fidelity RANS flow models which can capture nonlinear turbulent flowmore » physics within a wind plant. The steady-state RANS flow model is implemented in the Python finite-element package FEniCS and the derivation and solution of the discrete adjoint equations are automated within the dolfin-adjoint framework. Gradient-based optimization of wind turbine locations is demonstrated for idealized test cases that reveal new optimization heuristics such as rotational symmetry, local speedups, and nonlinear wake curvature effects. Layout optimization is also demonstrated on more complex wind rose shapes, including a full annual energy production (AEP) layout optimization over 36 inflow directions and 5 wind speed bins.« less

Demonstration of Automatically-Generated Adjoint Code for Use in Aerodynamic Shape Optimization

NASA Technical Reports Server (NTRS)

Green, Lawrence; Carle, Alan; Fagan, Mike

1999-01-01

Gradient-based optimization requires accurate derivatives of the objective function and constraints. These gradients may have previously been obtained by manual differentiation of analysis codes, symbolic manipulators, finite-difference approximations, or existing automatic differentiation (AD) tools such as ADIFOR (Automatic Differentiation in FORTRAN). Each of these methods has certain deficiencies, particularly when applied to complex, coupled analyses with many design variables. Recently, a new AD tool called ADJIFOR (Automatic Adjoint Generation in FORTRAN), based upon ADIFOR, was developed and demonstrated. Whereas ADIFOR implements forward-mode (direct) differentiation throughout an analysis program to obtain exact derivatives via the chain rule of calculus, ADJIFOR implements the reverse-mode counterpart of the chain rule to obtain exact adjoint form derivatives from FORTRAN code. Automatically-generated adjoint versions of the widely-used CFL3D computational fluid dynamics (CFD) code and an algebraic wing grid generation code were obtained with just a few hours processing time using the ADJIFOR tool. The codes were verified for accuracy and were shown to compute the exact gradient of the wing lift-to-drag ratio, with respect to any number of shape parameters, in about the time required for 7 to 20 function evaluations. The codes have now been executed on various computers with typical memory and disk space for problems with up to 129 x 65 x 33 grid points, and for hundreds to thousands of independent variables. These adjoint codes are now used in a gradient-based aerodynamic shape optimization problem for a swept, tapered wing. For each design iteration, the optimization package constructs an approximate, linear optimization problem, based upon the current objective function, constraints, and gradient values. The optimizer subroutines are called within a design loop employing the approximate linear problem until an optimum shape is found, the design loop limit is reached, or no further design improvement is possible due to active design variable bounds and/or constraints. The resulting shape parameters are then used by the grid generation code to define a new wing surface and computational grid. The lift-to-drag ratio and its gradient are computed for the new design by the automatically-generated adjoint codes. Several optimization iterations may be required to find an optimum wing shape. Results from two sample cases will be discussed. The reader should note that this work primarily represents a demonstration of use of automatically- generated adjoint code within an aerodynamic shape optimization. As such, little significance is placed upon the actual optimization results, relative to the method for obtaining the results.

Subpixel displacement measurement method based on the combination of particle swarm optimization and gradient algorithm

NASA Astrophysics Data System (ADS)

Guang, Chen; Qibo, Feng; Keqin, Ding; Zhan, Gao

2017-10-01

A subpixel displacement measurement method based on the combination of particle swarm optimization (PSO) and gradient algorithm (GA) was proposed for accuracy and speed optimization in GA, which is a subpixel displacement measurement method better applied in engineering practice. An initial integer-pixel value was obtained according to the global searching ability of PSO, and then gradient operators were adopted for a subpixel displacement search. A comparison was made between this method and GA by simulated speckle images and rigid-body displacement in metal specimens. The results showed that the computational accuracy of the combination of PSO and GA method reached 0.1 pixel in the simulated speckle images, or even 0.01 pixels in the metal specimen. Also, computational efficiency and the antinoise performance of the improved method were markedly enhanced.

On the Convergence Analysis of the Optimized Gradient Method.

PubMed

Kim, Donghwan; Fessler, Jeffrey A

2017-01-01

This paper considers the problem of unconstrained minimization of smooth convex functions having Lipschitz continuous gradients with known Lipschitz constant. We recently proposed the optimized gradient method for this problem and showed that it has a worst-case convergence bound for the cost function decrease that is twice as small as that of Nesterov's fast gradient method, yet has a similarly efficient practical implementation. Drori showed recently that the optimized gradient method has optimal complexity for the cost function decrease over the general class of first-order methods. This optimality makes it important to study fully the convergence properties of the optimized gradient method. The previous worst-case convergence bound for the optimized gradient method was derived for only the last iterate of a secondary sequence. This paper provides an analytic convergence bound for the primary sequence generated by the optimized gradient method. We then discuss additional convergence properties of the optimized gradient method, including the interesting fact that the optimized gradient method has two types of worstcase functions: a piecewise affine-quadratic function and a quadratic function. These results help complete the theory of an optimal first-order method for smooth convex minimization.

On the Convergence Analysis of the Optimized Gradient Method

PubMed Central

Kim, Donghwan; Fessler, Jeffrey A.

2016-01-01

This paper considers the problem of unconstrained minimization of smooth convex functions having Lipschitz continuous gradients with known Lipschitz constant. We recently proposed the optimized gradient method for this problem and showed that it has a worst-case convergence bound for the cost function decrease that is twice as small as that of Nesterov’s fast gradient method, yet has a similarly efficient practical implementation. Drori showed recently that the optimized gradient method has optimal complexity for the cost function decrease over the general class of first-order methods. This optimality makes it important to study fully the convergence properties of the optimized gradient method. The previous worst-case convergence bound for the optimized gradient method was derived for only the last iterate of a secondary sequence. This paper provides an analytic convergence bound for the primary sequence generated by the optimized gradient method. We then discuss additional convergence properties of the optimized gradient method, including the interesting fact that the optimized gradient method has two types of worstcase functions: a piecewise affine-quadratic function and a quadratic function. These results help complete the theory of an optimal first-order method for smooth convex minimization. PMID:28461707

Design keys for paper-based concentration gradient generators.

PubMed

Schaumburg, Federico; Urteaga, Raúl; Kler, Pablo A; Berli, Claudio L A

2018-08-03

The generation of concentration gradients is an essential operation for several analytical processes implemented on microfluidic paper-based analytical devices. The dynamic gradient formation is based on the transverse dispersion of chemical species across co-flowing streams. In paper channels, this transverse flux of molecules is dominated by mechanical dispersion, which is substantially different than molecular diffusion, which is the mechanism acting in conventional microchannels. Therefore, the design of gradient generators on paper requires strategies different from those used in traditional microfluidics. This work considers the foundations of transverse dispersion in porous substrates to investigate the optimal design of microfluidic paper-based concentration gradient generators (μPGGs) by computer simulations. A set of novel and versatile μPGGs were designed in the format of numerical prototypes, and virtual experiments were run to explore the ranges of operation and the overall performance of such devices. Then physical prototypes were fabricated and experimentally tested in our lab. Finally, some basic rules for the design of optimized μPGGs are proposed. Apart from improving the efficiency of mixers, diluters and μPGGs, the results of this investigation are relevant to attain highly controlled concentration fields on paper-based devices. Copyright © 2018 Elsevier B.V. All rights reserved.

Gradient stationary phase optimized selectivity liquid chromatography with conventional columns.

PubMed

Chen, Kai; Lynen, Frédéric; Szucs, Roman; Hanna-Brown, Melissa; Sandra, Pat

2013-05-21

Stationary phase optimized selectivity liquid chromatography (SOSLC) is a promising technique to optimize the selectivity of a given separation. By combination of different stationary phases, SOSLC offers excellent possibilities for method development under both isocratic and gradient conditions. The so far available commercial SOSLC protocol utilizes dedicated column cartridges and corresponding cartridge holders to build up the combined column of different stationary phases. The present work is aimed at developing and extending the gradient SOSLC approach towards coupling conventional columns. Generic tubing was used to connect short commercially available LC columns. Fast and base-line separation of a mixture of 12 compounds containing phenones, benzoic acids and hydroxybenzoates under both isocratic and linear gradient conditions was selected to demonstrate the potential of SOSLC. The influence of the connecting tubing on the deviation of predictions is also discussed.

Universal field matching in craniospinal irradiation by a background-dose gradient-optimized method.

PubMed

Traneus, Erik; Bizzocchi, Nicola; Fellin, Francesco; Rombi, Barbara; Farace, Paolo

2018-01-01

The gradient-optimized methods are overcoming the traditional feathering methods to plan field junctions in craniospinal irradiation. In this note, a new gradient-optimized technique, based on the use of a background dose, is described. Treatment planning was performed by RayStation (RaySearch Laboratories, Stockholm, Sweden) on the CT scans of a pediatric patient. Both proton (by pencil beam scanning) and photon (by volumetric modulated arc therapy) treatments were planned with three isocenters. An 'in silico' ideal background dose was created first to cover the upper-spinal target and to produce a perfect dose gradient along the upper and lower junction regions. Using it as background, the cranial and the lower-spinal beams were planned by inverse optimization to obtain dose coverage of their relevant targets and of the junction volumes. Finally, the upper-spinal beam was inversely planned after removal of the background dose and with the previously optimized beams switched on. In both proton and photon plans, the optimized cranial and the lower-spinal beams produced a perfect linear gradient in the junction regions, complementary to that produced by the optimized upper-spinal beam. The final dose distributions showed a homogeneous coverage of the targets. Our simple technique allowed to obtain high-quality gradients in the junction region. Such technique universally works for photons as well as protons and could be applicable to the TPSs that allow to manage a background dose. © 2017 The Authors. Journal of Applied Clinical Medical Physics published by Wiley Periodicals, Inc. on behalf of American Association of Physicists in Medicine.

Simulation and Optimization of an Airfoil with Leading Edge Slat

NASA Astrophysics Data System (ADS)

Schramm, Matthias; Stoevesandt, Bernhard; Peinke, Joachim

2016-09-01

A gradient-based optimization is used in order to improve the shape of a leading edge slat upstream of a DU 91-W2-250 airfoil. The simulations are performed by solving the Reynolds-Averaged Navier-Stokes equations (RANS) using the open source CFD code OpenFOAM. Gradients are computed via the adjoint approach, which is suitable to deal with many design parameters, but keeping the computational costs low. The implementation is verified by comparing the gradients from the adjoint method with gradients obtained by finite differences for a NACA 0012 airfoil. The simulations of the leading edge slat are validated against measurements from the acoustic wind tunnel of Oldenburg University at a Reynolds number of Re = 6 • 105. The shape of the slat is optimized using the adjoint approach resulting in a drag reduction of 2%. Although the optimization is done for Re = 6 • 105, the improvements also hold for a higher Reynolds number of Re = 7.9 • 106, which is more realistic at modern wind turbines.

Optimal Disturbances in Boundary Layers Subject to Streamwise Pressure Gradient

NASA Technical Reports Server (NTRS)

Ashpis, David E.; Tumin, Anatoli

2003-01-01

An analysis of the non-modal growth of perturbations in a boundary layer in the presence of a streamwise pressure gradient is presented. The analysis is based on PSE equations for an incompressible fluid. Examples with Falkner- Skan profiles indicate that a favorable pressure gradient decreases the non-modal growth while an unfavorable pressure gradient leads to an increase of the amplification. It is suggested that the transient growth mechanism be utilized to choose optimal parameters of tripping elements on a low-pressure turbine (LPT) airfoil. As an example, a boundary-layer flow with a streamwise pressure gradient corresponding to the pressure distribution over a LPT airfoil is considered. It is shown that there is an optimal spacing of the tripping elements and that the transient growth effect depends on the starting point. The amplification is found to be small at the LPT s very low Reynolds numbers, but there is a possibility to enhance the transient energy growth by means of wall cooling.

Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks

PubMed Central

Chen, Jianhui; Liu, Ji; Ye, Jieping

2013-01-01

We consider the problem of learning incoherent sparse and low-rank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the sparse and low-rank patterns are induced by a cardinality regularization term and a low-rank constraint, respectively. This formulation is non-convex; we convert it into its convex surrogate, which can be routinely solved via semidefinite programming for small-size problems. We propose to employ the general projected gradient scheme to efficiently solve such a convex surrogate; however, in the optimization formulation, the objective function is non-differentiable and the feasible domain is non-trivial. We present the procedures for computing the projected gradient and ensuring the global convergence of the projected gradient scheme. The computation of projected gradient involves a constrained optimization problem; we show that the optimal solution to such a problem can be obtained via solving an unconstrained optimization subproblem and an Euclidean projection subproblem. We also present two projected gradient algorithms and analyze their rates of convergence in details. In addition, we illustrate the use of the presented projected gradient algorithms for the proposed multi-task learning formulation using the least squares loss. Experimental results on a collection of real-world data sets demonstrate the effectiveness of the proposed multi-task learning formulation and the efficiency of the proposed projected gradient algorithms. PMID:24077658

Learning Incoherent Sparse and Low-Rank Patterns from Multiple Tasks.

PubMed

Chen, Jianhui; Liu, Ji; Ye, Jieping

2012-02-01

We consider the problem of learning incoherent sparse and low-rank patterns from multiple tasks. Our approach is based on a linear multi-task learning formulation, in which the sparse and low-rank patterns are induced by a cardinality regularization term and a low-rank constraint, respectively. This formulation is non-convex; we convert it into its convex surrogate, which can be routinely solved via semidefinite programming for small-size problems. We propose to employ the general projected gradient scheme to efficiently solve such a convex surrogate; however, in the optimization formulation, the objective function is non-differentiable and the feasible domain is non-trivial. We present the procedures for computing the projected gradient and ensuring the global convergence of the projected gradient scheme. The computation of projected gradient involves a constrained optimization problem; we show that the optimal solution to such a problem can be obtained via solving an unconstrained optimization subproblem and an Euclidean projection subproblem. We also present two projected gradient algorithms and analyze their rates of convergence in details. In addition, we illustrate the use of the presented projected gradient algorithms for the proposed multi-task learning formulation using the least squares loss. Experimental results on a collection of real-world data sets demonstrate the effectiveness of the proposed multi-task learning formulation and the efficiency of the proposed projected gradient algorithms.

Optimization in Quaternion Dynamic Systems: Gradient, Hessian, and Learning Algorithms.

PubMed

Xu, Dongpo; Xia, Yili; Mandic, Danilo P

2016-02-01

The optimization of real scalar functions of quaternion variables, such as the mean square error or array output power, underpins many practical applications. Solutions typically require the calculation of the gradient and Hessian. However, real functions of quaternion variables are essentially nonanalytic, which are prohibitive to the development of quaternion-valued learning systems. To address this issue, we propose new definitions of quaternion gradient and Hessian, based on the novel generalized Hamilton-real (GHR) calculus, thus making a possible efficient derivation of general optimization algorithms directly in the quaternion field, rather than using the isomorphism with the real domain, as is current practice. In addition, unlike the existing quaternion gradients, the GHR calculus allows for the product and chain rule, and for a one-to-one correspondence of the novel quaternion gradient and Hessian with their real counterparts. Properties of the quaternion gradient and Hessian relevant to numerical applications are also introduced, opening a new avenue of research in quaternion optimization and greatly simplified the derivations of learning algorithms. The proposed GHR calculus is shown to yield the same generic algorithm forms as the corresponding real- and complex-valued algorithms. Advantages of the proposed framework are illuminated over illustrative simulations in quaternion signal processing and neural networks.

[Fast optimization of stepwise gradient conditions for ternary mobile phase in reversed-phase high performance liquid chromatography].

PubMed

Shan, Yi-chu; Zhang, Yu-kui; Zhao, Rui-huan

2002-07-01

In high performance liquid chromatography, it is necessary to apply multi-composition gradient elution for the separation of complex samples such as environmental and biological samples. Multivariate stepwise gradient elution is one of the most efficient elution modes, because it combines the high selectivity of multi-composition mobile phase and shorter analysis time of gradient elution. In practical separations, the separation selectivity of samples can be effectively adjusted by using ternary mobile phase. For the optimization of these parameters, the retention equation of samples must be obtained at first. Traditionally, several isocratic experiments are used to get the retention equation of solute. However, it is time consuming especially for the separation of complex samples with a wide range of polarity. A new method for the fast optimization of ternary stepwise gradient elution was proposed based on the migration rule of solute in column. First, the coefficients of retention equation of solute are obtained by running several linear gradient experiments, then the optimal separation conditions are searched according to the hierarchical chromatography response function which acts as the optimization criterion. For each kind of organic modifier, two initial linear gradient experiments are used to obtain the primary coefficients of retention equation of each solute. For ternary mobile phase, only four linear gradient runs are needed to get the coefficients of retention equation. Then the retention times of solutes under arbitrary mobile phase composition can be predicted. The initial optimal mobile phase composition is obtained by resolution mapping for all of the solutes. A hierarchical chromatography response function is used to evaluate the separation efficiencies and search the optimal elution conditions. In subsequent optimization, the migrating distance of solute in the column is considered to decide the mobile phase composition and sustaining time of the latter steps until all the solutes are eluted out. Thus the first stepwise gradient elution conditions are predicted. If the resolution of samples under the predicted optimal separation conditions is satisfactory, the optimization procedure is stopped; otherwise, the coefficients of retention equation are adjusted according to the experimental results under the previously predicted elution conditions. Then the new stepwise gradient elution conditions are predicted repeatedly until satisfactory resolution is obtained. Normally, the satisfactory separation conditions can be found only after six experiments by using the proposed method. In comparison with the traditional optimization method, the time needed to finish the optimization procedure can be greatly reduced. The method has been validated by its application to the separation of several samples such as amino acid derivatives, aromatic amines, in which satisfactory separations were obtained with predicted resolution.

Topology optimization of finite strain viscoplastic systems under transient loads

DOE PAGES

Ivarsson, Niklas; Wallin, Mathias; Tortorelli, Daniel

2018-02-08

In this paper, a transient finite strain viscoplastic model is implemented in a gradient-based topology optimization framework to design impact mitigating structures. The model's kinematics relies on the multiplicative split of the deformation gradient, and the constitutive response is based on isotropic hardening viscoplasticity. To solve the mechanical balance laws, the implicit Newmark-beta method is used together with a total Lagrangian finite element formulation. The optimization problem is regularized using a partial differential equation filter and solved using the method of moving asymptotes. Sensitivities required to solve the optimization problem are derived using the adjoint method. To demonstrate the capabilitymore » of the algorithm, several protective systems are designed, in which the absorbed viscoplastic energy is maximized. Finally, the numerical examples demonstrate that transient finite strain viscoplastic effects can successfully be combined with topology optimization.« less

Model of separation performance of bilinear gradients in scanning format counter-flow gradient electrofocusing techniques.

PubMed

Shameli, Seyed Mostafa; Glawdel, Tomasz; Ren, Carolyn L

2015-03-01

Counter-flow gradient electrofocusing allows the simultaneous concentration and separation of analytes by generating a gradient in the total velocity of each analyte that is the sum of its electrophoretic velocity and the bulk counter-flow velocity. In the scanning format, the bulk counter-flow velocity is varying with time so that a number of analytes with large differences in electrophoretic mobility can be sequentially focused and passed by a single detection point. Studies have shown that nonlinear (such as a bilinear) velocity gradients along the separation channel can improve both peak capacity and separation resolution simultaneously, which cannot be realized by using a single linear gradient. Developing an effective separation system based on the scanning counter-flow nonlinear gradient electrofocusing technique usually requires extensive experimental and numerical efforts, which can be reduced significantly with the help of analytical models for design optimization and guiding experimental studies. Therefore, this study focuses on developing an analytical model to evaluate the separation performance of scanning counter-flow bilinear gradient electrofocusing methods. In particular, this model allows a bilinear gradient and a scanning rate to be optimized for the desired separation performance. The results based on this model indicate that any bilinear gradient provides a higher separation resolution (up to 100%) compared to the linear case. This model is validated by numerical studies. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A Smoothed Eclipse Model for Solar Electric Propulsion Trajectory Optimization

NASA Technical Reports Server (NTRS)

Aziz, Jonathan D.; Scheeres, Daniel J.; Parker, Jeffrey S.; Englander, Jacob A.

2017-01-01

Solar electric propulsion (SEP) is the dominant design option for employing low-thrust propulsion on a space mission. Spacecraft solar arrays power the SEP system but are subject to blackout periods during solar eclipse conditions. Discontinuity in power available to the spacecraft must be accounted for in trajectory optimization, but gradient-based methods require a differentiable power model. This work presents a power model that smooths the eclipse transition from total eclipse to total sunlight with a logistic function. Example trajectories are computed with differential dynamic programming, a second-order gradient-based method.

Adjoint-based Sensitivity of Jet Noise to Near-nozzle Forcing

NASA Astrophysics Data System (ADS)

Chung, Seung Whan; Vishnampet, Ramanathan; Bodony, Daniel; Freund, Jonathan

2017-11-01

Past efforts have used optimal control theory, based on the numerical solution of the adjoint flow equations, to perturb turbulent jets in order to reduce their radiated sound. These efforts have been successful in that sound is reduced, with concomitant changes to the large-scale turbulence structures in the flow. However, they have also been inconclusive, in that the ultimate level of reduction seemed to depend upon the accuracy of the adjoint-based gradient rather than a physical limitation of the flow. The chaotic dynamics of the turbulence can degrade the smoothness of cost functional in the control-parameter space, which is necessary for gradient-based optimization. We introduce a route to overcoming this challenge, in part by leveraging the regularity and accuracy with a dual-consistent, discrete-exact adjoint formulation. We confirm its properties and use it to study the sensitivity and controllability of the acoustic radiation from a simulation of a M = 1.3 turbulent jet, whose statistics matches data. The smoothness of the cost functional over time is quantified by a minimum optimization step size beyond which the gradient cannot have a certain degree of accuracy. Based on this, we achieve a moderate level of sound reduction in the first few optimization steps. This material is based [in part] upon work supported by the Department of Energy, National Nuclear Security Administration, under Award Number DE-NA0002374.

Feedback-Based Projected-Gradient Method for Real-Time Optimization of Aggregations of Energy Resources

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall-Anese, Emiliano; Bernstein, Andrey; Simonetto, Andrea

This paper develops an online optimization method to maximize operational objectives of distribution-level distributed energy resources (DERs), while adjusting the aggregate power generated (or consumed) in response to services requested by grid operators. The design of the online algorithm is based on a projected-gradient method, suitably modified to accommodate appropriate measurements from the distribution network and the DERs. By virtue of this approach, the resultant algorithm can cope with inaccuracies in the representation of the AC power flows, it avoids pervasive metering to gather the state of noncontrollable resources, and it naturally lends itself to a distributed implementation. Optimality claimsmore » are established in terms of tracking of the solution of a well-posed time-varying convex optimization problem.« less

Feedback-Based Projected-Gradient Method For Real-Time Optimization of Aggregations of Energy Resources: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dall-Anese, Emiliano; Bernstein, Andrey; Simonetto, Andrea

This paper develops an online optimization method to maximize the operational objectives of distribution-level distributed energy resources (DERs) while adjusting the aggregate power generated (or consumed) in response to services requested by grid operators. The design of the online algorithm is based on a projected-gradient method, suitably modified to accommodate appropriate measurements from the distribution network and the DERs. By virtue of this approach, the resultant algorithm can cope with inaccuracies in the representation of the AC power, it avoids pervasive metering to gather the state of noncontrollable resources, and it naturally lends itself to a distributed implementation. Optimality claimsmore » are established in terms of tracking of the solution of a well-posed time-varying optimization problem.« less

Contribution to the optimal shape design of two-dimensional internal flows with embedded shocks

NASA Technical Reports Server (NTRS)

Iollo, Angelo; Salas, Manuel D.

1995-01-01

We explore the practicability of optimal shape design for flows modeled by the Euler equations. We define a functional whose minimum represents the optimality condition. The gradient of the functional with respect to the geometry is calculated with the Lagrange multipliers, which are determined by solving a co-state equation. The optimization problem is then examined by comparing the performance of several gradient-based optimization algorithms. In this formulation, the flow field can be computed to an arbitrary order of accuracy. Finally, some results for internal flows with embedded shocks are presented, including a case for which the solution to the inverse problem does not belong to the design space.

Optimal inverse functions created via population-based optimization.

PubMed

Jennings, Alan L; Ordóñez, Raúl

2014-06-01

Finding optimal inputs for a multiple-input, single-output system is taxing for a system operator. Population-based optimization is used to create sets of functions that produce a locally optimal input based on a desired output. An operator or higher level planner could use one of the functions in real time. For the optimization, each agent in the population uses the cost and output gradients to take steps lowering the cost while maintaining their current output. When an agent reaches an optimal input for its current output, additional agents are generated in the output gradient directions. The new agents then settle to the local optima for the new output values. The set of associated optimal points forms an inverse function, via spline interpolation, from a desired output to an optimal input. In this manner, multiple locally optimal functions can be created. These functions are naturally clustered in input and output spaces allowing for a continuous inverse function. The operator selects the best cluster over the anticipated range of desired outputs and adjusts the set point (desired output) while maintaining optimality. This reduces the demand from controlling multiple inputs, to controlling a single set point with no loss in performance. Results are demonstrated on a sample set of functions and on a robot control problem.

A new sparse optimization scheme for simultaneous beam angle and fluence map optimization in radiotherapy planning

NASA Astrophysics Data System (ADS)

Liu, Hongcheng; Dong, Peng; Xing, Lei

2017-08-01

{{\\ell }2,1} -minimization-based sparse optimization was employed to solve the beam angle optimization (BAO) in intensity-modulated radiation therapy (IMRT) planning. The technique approximates the exact BAO formulation with efficiently computable convex surrogates, leading to plans that are inferior to those attainable with recently proposed gradient-based greedy schemes. In this paper, we alleviate/reduce the nontrivial inconsistencies between the {{\\ell }2,1} -based formulations and the exact BAO model by proposing a new sparse optimization framework based on the most recent developments in group variable selection. We propose the incorporation of the group-folded concave penalty (gFCP) as a substitution to the {{\\ell }2,1} -minimization framework. The new formulation is then solved by a variation of an existing gradient method. The performance of the proposed scheme is evaluated by both plan quality and the computational efficiency using three IMRT cases: a coplanar prostate case, a coplanar head-and-neck case, and a noncoplanar liver case. Involved in the evaluation are two alternative schemes: the {{\\ell }2,1} -minimization approach and the gradient norm method (GNM). The gFCP-based scheme outperforms both counterpart approaches. In particular, gFCP generates better plans than those obtained using the {{\\ell }2,1} -minimization for all three cases with a comparable computation time. As compared to the GNM, the gFCP improves both the plan quality and computational efficiency. The proposed gFCP-based scheme provides a promising framework for BAO and promises to improve both planning time and plan quality.

A new sparse optimization scheme for simultaneous beam angle and fluence map optimization in radiotherapy planning.

PubMed

Liu, Hongcheng; Dong, Peng; Xing, Lei

2017-07-20

[Formula: see text]-minimization-based sparse optimization was employed to solve the beam angle optimization (BAO) in intensity-modulated radiation therapy (IMRT) planning. The technique approximates the exact BAO formulation with efficiently computable convex surrogates, leading to plans that are inferior to those attainable with recently proposed gradient-based greedy schemes. In this paper, we alleviate/reduce the nontrivial inconsistencies between the [Formula: see text]-based formulations and the exact BAO model by proposing a new sparse optimization framework based on the most recent developments in group variable selection. We propose the incorporation of the group-folded concave penalty (gFCP) as a substitution to the [Formula: see text]-minimization framework. The new formulation is then solved by a variation of an existing gradient method. The performance of the proposed scheme is evaluated by both plan quality and the computational efficiency using three IMRT cases: a coplanar prostate case, a coplanar head-and-neck case, and a noncoplanar liver case. Involved in the evaluation are two alternative schemes: the [Formula: see text]-minimization approach and the gradient norm method (GNM). The gFCP-based scheme outperforms both counterpart approaches. In particular, gFCP generates better plans than those obtained using the [Formula: see text]-minimization for all three cases with a comparable computation time. As compared to the GNM, the gFCP improves both the plan quality and computational efficiency. The proposed gFCP-based scheme provides a promising framework for BAO and promises to improve both planning time and plan quality.

Energetic constraints, size gradients, and size limits in benthic marine invertebrates.

PubMed

Sebens, Kenneth P

2002-08-01

Populations of marine benthic organisms occupy habitats with a range of physical and biological characteristics. In the intertidal zone, energetic costs increase with temperature and aerial exposure, and prey intake increases with immersion time, generating size gradients with small individuals often found at upper limits of distribution. Wave action can have similar effects, limiting feeding time or success, although certain species benefit from wave dislodgment of their prey; this also results in gradients of size and morphology. The difference between energy intake and metabolic (and/or behavioral) costs can be used to determine an energetic optimal size for individuals in such populations. Comparisons of the energetic optimal size to the maximum predicted size based on mechanical constraints, and the ensuing mortality schedule, provides a mechanism to study and explain organism size gradients in intertidal and subtidal habitats. For species where the energetic optimal size is well below the maximum size that could persist under a certain set of wave/flow conditions, it is probable that energetic constraints dominate. When the opposite is true, populations of small individuals can dominate habitats with strong dislodgment or damage probability. When the maximum size of individuals is far below either energetic optima or mechanical limits, other sources of mortality (e.g., predation) may favor energy allocation to early reproduction rather than to continued growth. Predictions based on optimal size models have been tested for a variety of intertidal and subtidal invertebrates including sea anemones, corals, and octocorals. This paper provides a review of the optimal size concept, and employs a combination of the optimal energetic size model and life history modeling approach to explore energy allocation to growth or reproduction as the optimal size is approached.

The q-G method : A q-version of the Steepest Descent method for global optimization.

PubMed

Soterroni, Aline C; Galski, Roberto L; Scarabello, Marluce C; Ramos, Fernando M

2015-01-01

In this work, the q-Gradient (q-G) method, a q-version of the Steepest Descent method, is presented. The main idea behind the q-G method is the use of the negative of the q-gradient vector of the objective function as the search direction. The q-gradient vector, or simply the q-gradient, is a generalization of the classical gradient vector based on the concept of Jackson's derivative from the q-calculus. Its use provides the algorithm an effective mechanism for escaping from local minima. The q-G method reduces to the Steepest Descent method when the parameter q tends to 1. The algorithm has three free parameters and it is implemented so that the search process gradually shifts from global exploration in the beginning to local exploitation in the end. We evaluated the q-G method on 34 test functions, and compared its performance with 34 optimization algorithms, including derivative-free algorithms and the Steepest Descent method. Our results show that the q-G method is competitive and has a great potential for solving multimodal optimization problems.

High gradient RF test results of S-band and C-band cavities for medical linear accelerators

NASA Astrophysics Data System (ADS)

Degiovanni, A.; Bonomi, R.; Garlasché, M.; Verdú-Andrés, S.; Wegner, R.; Amaldi, U.

2018-05-01

TERA Foundation has proposed and designed hadrontherapy facilities based on novel linacs, i.e. high gradient linacs which accelerate either protons or light ions. The overall length of the linac, and therefore its cost, is almost inversely proportional to the average accelerating gradient. With the scope of studying the limiting factors for high gradient operation and to optimize the linac design, TERA, in collaboration with the CLIC Structure Development Group, has conducted a series of high gradient experiments. The main goals were to study the high gradient behavior and to evaluate the maximum gradient reached in 3 and 5.7 GHz structures to direct the design of medical accelerators based on high gradient linacs. This paper summarizes the results of the high power tests of 3.0 and 5.7 GHz single-cell cavities.

Performance evaluation of matrix gradient coils.

PubMed

Jia, Feng; Schultz, Gerrit; Testud, Frederik; Welz, Anna Masako; Weber, Hans; Littin, Sebastian; Yu, Huijun; Hennig, Jürgen; Zaitsev, Maxim

2016-02-01

In this paper, we present a new performance measure of a matrix coil (also known as multi-coil) from the perspective of efficient, local, non-linear encoding without explicitly considering target encoding fields. An optimization problem based on a joint optimization for the non-linear encoding fields is formulated. Based on the derived objective function, a figure of merit of a matrix coil is defined, which is a generalization of a previously known resistive figure of merit for traditional gradient coils. A cylindrical matrix coil design with a high number of elements is used to illustrate the proposed performance measure. The results are analyzed to reveal novel features of matrix coil designs, which allowed us to optimize coil parameters, such as number of coil elements. A comparison to a scaled, existing multi-coil is also provided to demonstrate the use of the proposed performance parameter. The assessment of a matrix gradient coil profits from using a single performance parameter that takes the local encoding performance of the coil into account in relation to the dissipated power.

A New Artificial Neural Network Enhanced by the Shuffled Complex Evolution Optimization with Principal Component Analysis (SP-UCI) for Water Resources Management

NASA Astrophysics Data System (ADS)

Hayatbini, N.; Faridzad, M.; Yang, T.; Akbari Asanjan, A.; Gao, X.; Sorooshian, S.

2016-12-01

The Artificial Neural Networks (ANNs) are useful in many fields, including water resources engineering and management. However, due to the non-linear and chaotic characteristics associated with natural processes and human decision making, the use of ANNs in real-world applications is still limited, and its performance needs to be further improved for a broader practical use. The commonly used Back-Propagation (BP) scheme and gradient-based optimization in training the ANNs have already found to be problematic in some cases. The BP scheme and gradient-based optimization methods are associated with the risk of premature convergence, stuck in local optimums, and the searching is highly dependent on initial conditions. Therefore, as an alternative to BP and gradient-based searching scheme, we propose an effective and efficient global searching method, termed the Shuffled Complex Evolutionary Global optimization algorithm with Principal Component Analysis (SP-UCI), to train the ANN connectivity weights. Large number of real-world datasets are tested with the SP-UCI-based ANN, as well as various popular Evolutionary Algorithms (EAs)-enhanced ANNs, i.e., Particle Swarm Optimization (PSO)-, Genetic Algorithm (GA)-, Simulated Annealing (SA)-, and Differential Evolution (DE)-enhanced ANNs. Results show that SP-UCI-enhanced ANN is generally superior over other EA-enhanced ANNs with regard to the convergence and computational performance. In addition, we carried out a case study for hydropower scheduling in the Trinity Lake in the western U.S. In this case study, multiple climate indices are used as predictors for the SP-UCI-enhanced ANN. The reservoir inflows and hydropower releases are predicted up to sub-seasonal to seasonal scale. Results show that SP-UCI-enhanced ANN is able to achieve better statistics than other EAs-based ANN, which implies the usefulness and powerfulness of proposed SP-UCI-enhanced ANN for reservoir operation, water resources engineering and management. The SP-UCI-enhanced ANN is universally applicable to many other regression and prediction problems, and it has a good potential to be an alternative to the classical BP scheme and gradient-based optimization methods.

Fast three-dimensional inner volume excitations using parallel transmission and optimized k-space trajectories.

PubMed

Davids, Mathias; Schad, Lothar R; Wald, Lawrence L; Guérin, Bastien

2016-10-01

To design short parallel transmission (pTx) pulses for excitation of arbitrary three-dimensional (3D) magnetization patterns. We propose a joint optimization of the pTx radiofrequency (RF) and gradient waveforms for excitation of arbitrary 3D magnetization patterns. Our optimization of the gradient waveforms is based on the parameterization of k-space trajectories (3D shells, stack-of-spirals, and cross) using a small number of shape parameters that are well-suited for optimization. The resulting trajectories are smooth and sample k-space efficiently with few turns while using the gradient system at maximum performance. Within each iteration of the k-space trajectory optimization, we solve a small tip angle least-squares RF pulse design problem. Our RF pulse optimization framework was evaluated both in Bloch simulations and experiments on a 7T scanner with eight transmit channels. Using an optimized 3D cross (shells) trajectory, we were able to excite a cube shape (brain shape) with 3.4% (6.2%) normalized root-mean-square error in less than 5 ms using eight pTx channels and a clinical gradient system (Gmax  = 40 mT/m, Smax  = 150 T/m/s). This compared with 4.7% (41.2%) error for the unoptimized 3D cross (shells) trajectory. Incorporation of B0 robustness in the pulse design significantly altered the k-space trajectory solutions. Our joint gradient and RF optimization approach yields excellent excitation of 3D cube and brain shapes in less than 5 ms, which can be used for reduced field of view imaging and fat suppression in spectroscopy by excitation of the brain only. Magn Reson Med 76:1170-1182, 2016. © 2015 Wiley Periodicals, Inc. © 2015 Wiley Periodicals, Inc.

A PDE Sensitivity Equation Method for Optimal Aerodynamic Design

NASA Technical Reports Server (NTRS)

Borggaard, Jeff; Burns, John

1996-01-01

The use of gradient based optimization algorithms in inverse design is well established as a practical approach to aerodynamic design. A typical procedure uses a simulation scheme to evaluate the objective function (from the approximate states) and its gradient, then passes this information to an optimization algorithm. Once the simulation scheme (CFD flow solver) has been selected and used to provide approximate function evaluations, there are several possible approaches to the problem of computing gradients. One popular method is to differentiate the simulation scheme and compute design sensitivities that are then used to obtain gradients. Although this black-box approach has many advantages in shape optimization problems, one must compute mesh sensitivities in order to compute the design sensitivity. In this paper, we present an alternative approach using the PDE sensitivity equation to develop algorithms for computing gradients. This approach has the advantage that mesh sensitivities need not be computed. Moreover, when it is possible to use the CFD scheme for both the forward problem and the sensitivity equation, then there are computational advantages. An apparent disadvantage of this approach is that it does not always produce consistent derivatives. However, for a proper combination of discretization schemes, one can show asymptotic consistency under mesh refinement, which is often sufficient to guarantee convergence of the optimal design algorithm. In particular, we show that when asymptotically consistent schemes are combined with a trust-region optimization algorithm, the resulting optimal design method converges. We denote this approach as the sensitivity equation method. The sensitivity equation method is presented, convergence results are given and the approach is illustrated on two optimal design problems involving shocks.

Proposed Drill Sites

DOE Data Explorer

Lane, Michael

2013-06-28

Proposed drill sites for intermediate depth temperature gradient holes and/or deep resource confirmation wells. Temperature gradient contours based on shallow TG program and faults interpreted from seismic reflection survey are shown, as are two faults interpreted by seismic contractor Optim but not by Oski Energy, LLC.

Multiple-Point Temperature Gradient Algorithm for Ring Laser Gyroscope Bias Compensation

PubMed Central

Li, Geng; Zhang, Pengfei; Wei, Guo; Xie, Yuanping; Yu, Xudong; Long, Xingwu

2015-01-01

To further improve ring laser gyroscope (RLG) bias stability, a multiple-point temperature gradient algorithm is proposed for RLG bias compensation in this paper. Based on the multiple-point temperature measurement system, a complete thermo-image of the RLG block is developed. Combined with the multiple-point temperature gradients between different points of the RLG block, the particle swarm optimization algorithm is used to tune the support vector machine (SVM) parameters, and an optimized design for selecting the thermometer locations is also discussed. The experimental results validate the superiority of the introduced method and enhance the precision and generalizability in the RLG bias compensation model. PMID:26633401

Gradient-Based Optimization of Wind Farms with Different Turbine Heights: Preprint

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stanley, Andrew P. J.; Thomas, Jared; Ning, Andrew

Turbine wakes reduce power production in a wind farm. Current wind farms are generally built with turbines that are all the same height, but if wind farms included turbines with different tower heights, the cost of energy (COE) may be reduced. We used gradient-based optimization to demonstrate a method to optimize wind farms with varied hub heights. Our study includes a modified version of the FLORIS wake model that accommodates three-dimensional wakes integrated with a tower structural model. Our purpose was to design a process to minimize the COE of a wind farm through layout optimization and varying turbine hubmore » heights. Results indicate that when a farm is optimized for layout and height with two separate height groups, COE can be lowered by as much as 5%-9%, compared to a similar layout and height optimization where all the towers are the same. The COE has the best improvement in farms with high turbine density and a low wind shear exponent.« less

Gradient-Based Optimization of Wind Farms with Different Turbine Heights

DOE Office of Scientific and Technical Information (OSTI.GOV)

Stanley, Andrew P. J.; Thomas, Jared; Ning, Andrew

Turbine wakes reduce power production in a wind farm. Current wind farms are generally built with turbines that are all the same height, but if wind farms included turbines with different tower heights, the cost of energy (COE) may be reduced. We used gradient-based optimization to demonstrate a method to optimize wind farms with varied hub heights. Our study includes a modified version of the FLORIS wake model that accommodates three-dimensional wakes integrated with a tower structural model. Our purpose was to design a process to minimize the COE of a wind farm through layout optimization and varying turbine hubmore » heights. Results indicate that when a farm is optimized for layout and height with two separate height groups, COE can be lowered by as much as 5%-9%, compared to a similar layout and height optimization where all the towers are the same. The COE has the best improvement in farms with high turbine density and a low wind shear exponent.« less

Distributed Optimization Design of Continuous-Time Multiagent Systems With Unknown-Frequency Disturbances.

PubMed

Wang, Xinghu; Hong, Yiguang; Yi, Peng; Ji, Haibo; Kang, Yu

2017-05-24

In this paper, a distributed optimization problem is studied for continuous-time multiagent systems with unknown-frequency disturbances. A distributed gradient-based control is proposed for the agents to achieve the optimal consensus with estimating unknown frequencies and rejecting the bounded disturbance in the semi-global sense. Based on convex optimization analysis and adaptive internal model approach, the exact optimization solution can be obtained for the multiagent system disturbed by exogenous disturbances with uncertain parameters.

Constrained Burn Optimization for the International Space Station

NASA Technical Reports Server (NTRS)

Brown, Aaron J.; Jones, Brandon A.

2017-01-01

In long-term trajectory planning for the International Space Station (ISS), translational burns are currently targeted sequentially to meet the immediate trajectory constraints, rather than simultaneously to meet all constraints, do not employ gradient-based search techniques, and are not optimized for a minimum total deltav (v) solution. An analytic formulation of the constraint gradients is developed and used in an optimization solver to overcome these obstacles. Two trajectory examples are explored, highlighting the advantage of the proposed method over the current approach, as well as the potential v and propellant savings in the event of propellant shortages.

Transient Growth Theory Prediction of Optimal Placing of Passive and Active Flow Control Devices for Separation Delay in LPT Airfoils

NASA Technical Reports Server (NTRS)

Tumin, Anatoli; Ashpis, David E.

2003-01-01

An analysis of the non-modal growth of perturbations in a boundary layer in the presence of a streamwise pressure gradient is presented. The analysis is based on PSE equations for an incompressible fluid. Examples with Falkner-Skan profiles indicate that a favorable pressure gradient decreases the non-modal growth while an unfavorable pressure gradient leads to an increase of the amplification. It is suggested that the transient growth mechanism be utilized to choose optimal parameters of tripping elements on a low-pressure turbine (LPT) airfoil. As an example, a boundary layer flow with a streamwise pressure gradient corresponding to the pressure distribution over a LPT airfoil is considered. It is shown that there is an optimal spacing of the tripping elements and that the transient growth effect depends on the starting point. At very low Reynolds numbers, there is a possibility to enhance the transient energy growth by means of wall cooling.

Simulations of Flame Acceleration and DDT in Mixture Composition Gradients

NASA Astrophysics Data System (ADS)

Zheng, Weilin; Kaplan, Carolyn; Houim, Ryan; Oran, Elaine

2017-11-01

Unsteady, multidimensional, fully compressible numerical simulations of methane-air in an obstructed channel with spatial gradients in equivalence ratios have been carried to determine the effects of the gradients on flame acceleration and transition to detonation. Results for gradients perpendicular to the propagation direction were considered here. A calibrated, optimized chemical-diffusive model that reproduces correct flame and detonation properties for methane-air over a range of equivalence ratios was derived from a combination of a genetic algorithm with a Nelder-Mead optimization scheme. Inhomogeneous mixtures of methane-air resulted in slower flame acceleration and longer distance to DDT. Detonations were more likely to decouple into a flame and a shock under sharper concentration gradients. Detailed analyses of temperature and equivalence ratio illustrated that vertical gradients can greatly affect the formation of hot spots that initiate detonation by changing the strength of leading shock wave and local equivalence ratio near the base of obstacles. This work is supported by the Alpha Foundation (Grant No. AFC215-20).

The effect of model uncertainty on some optimal routing problems

NASA Technical Reports Server (NTRS)

Mohanty, Bibhu; Cassandras, Christos G.

1991-01-01

The effect of model uncertainties on optimal routing in a system of parallel queues is examined. The uncertainty arises in modeling the service time distribution for the customers (jobs, packets) to be served. For a Poisson arrival process and Bernoulli routing, the optimal mean system delay generally depends on the variance of this distribution. However, as the input traffic load approaches the system capacity the optimal routing assignment and corresponding mean system delay are shown to converge to a variance-invariant point. The implications of these results are examined in the context of gradient-based routing algorithms. An example of a model-independent algorithm using online gradient estimation is also included.

Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

NASA Technical Reports Server (NTRS)

Nemec, Marian; Aftosmis, Michael J.

2004-01-01

Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented an effective optimization framework that incorporates a direct-CAD interface. In this work, we enhance the capabilities of this framework with efficient gradient computations using the discrete adjoint method. We present details of the adjoint numerical implementation, which reuses the domain decomposition, multigrid, and time-marching schemes of the flow solver. Furthermore, we explain and demonstrate the use of CAD in conjunction with the Cartesian adjoint approach. The final paper will contain a number of complex geometry, industrially relevant examples with many design variables to demonstrate the effectiveness of the adjoint method on Cartesian meshes.

High-Lift Optimization Design Using Neural Networks on a Multi-Element Airfoil

NASA Technical Reports Server (NTRS)

Greenman, Roxana M.; Roth, Karlin R.; Smith, Charles A. (Technical Monitor)

1998-01-01

The high-lift performance of a multi-element airfoil was optimized by using neural-net predictions that were trained using a computational data set. The numerical data was generated using a two-dimensional, incompressible, Navier-Stokes algorithm with the Spalart-Allmaras turbulence model. Because it is difficult to predict maximum lift for high-lift systems, an empirically-based maximum lift criteria was used in this study to determine both the maximum lift and the angle at which it occurs. Multiple input, single output networks were trained using the NASA Ames variation of the Levenberg-Marquardt algorithm for each of the aerodynamic coefficients (lift, drag, and moment). The artificial neural networks were integrated with a gradient-based optimizer. Using independent numerical simulations and experimental data for this high-lift configuration, it was shown that this design process successfully optimized flap deflection, gap, overlap, and angle of attack to maximize lift. Once the neural networks were trained and integrated with the optimizer, minimal additional computer resources were required to perform optimization runs with different initial conditions and parameters. Applying the neural networks within the high-lift rigging optimization process reduced the amount of computational time and resources by 83% compared with traditional gradient-based optimization procedures for multiple optimization runs.

High gradient RF test results of S-band and C-band cavities for medical linear accelerators

DOE PAGES

Degiovanni, A.; Bonomi, R.; Garlasche, M.; ...

2018-02-09

TERA Foundation has proposed and designed hadrontherapy facilities based on novel linacs, i.e. high gradient linacs which accelerate either protons or light ions. The overall length of the linac, and therefore its cost, is almost inversely proportional to the average accelerating gradient. With the scope of studying the limiting factors for high gradient operation and to optimize the linac design, TERA, in collaboration with the CLIC Structure Development Group, has conducted a series of high gradient experiments. The main goals were to study the high gradient behavior and to evaluate the maximum gradient reached in 3 and 5.7 GHz structuresmore » to direct the design of medical accelerators based on high gradient linacs. Lastly, this paper summarizes the results of the high power tests of 3.0 and 5.7 GHz single-cell cavities.« less

High gradient RF test results of S-band and C-band cavities for medical linear accelerators

DOE Office of Scientific and Technical Information (OSTI.GOV)

Degiovanni, A.; Bonomi, R.; Garlasche, M.

TERA Foundation has proposed and designed hadrontherapy facilities based on novel linacs, i.e. high gradient linacs which accelerate either protons or light ions. The overall length of the linac, and therefore its cost, is almost inversely proportional to the average accelerating gradient. With the scope of studying the limiting factors for high gradient operation and to optimize the linac design, TERA, in collaboration with the CLIC Structure Development Group, has conducted a series of high gradient experiments. The main goals were to study the high gradient behavior and to evaluate the maximum gradient reached in 3 and 5.7 GHz structuresmore » to direct the design of medical accelerators based on high gradient linacs. Lastly, this paper summarizes the results of the high power tests of 3.0 and 5.7 GHz single-cell cavities.« less

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

PubMed

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.

Retention prediction and separation optimization under multilinear gradient elution in liquid chromatography with Microsoft Excel macros.

PubMed

Fasoula, S; Zisi, Ch; Gika, H; Pappa-Louisi, A; Nikitas, P

2015-05-22

A package of Excel VBA macros have been developed for modeling multilinear gradient retention data obtained in single or double gradient elution mode by changing organic modifier(s) content and/or eluent pH. For this purpose, ten chromatographic models were used and four methods were adopted for their application. The methods were based on (a) the analytical expression of the retention time, provided that this expression is available, (b) the retention times estimated using the Nikitas-Pappa approach, (c) the stepwise approximation, and (d) a simple numerical approximation involving the trapezoid rule for integration of the fundamental equation for gradient elution. For all these methods, Excel VBA macros have been written and implemented using two different platforms; the fitting and the optimization platform. The fitting platform calculates not only the adjustable parameters of the chromatographic models, but also the significance of these parameters and furthermore predicts the analyte elution times. The optimization platform determines the gradient conditions that lead to the optimum separation of a mixture of analytes by using the Solver evolutionary mode, provided that proper constraints are set in order to obtain the optimum gradient profile in the minimum gradient time. The performance of the two platforms was tested using experimental and artificial data. It was found that using the proposed spreadsheets, fitting, prediction, and optimization can be performed easily and effectively under all conditions. Overall, the best performance is exhibited by the analytical and Nikitas-Pappa's methods, although the former cannot be used under all circumstances. Copyright © 2015 Elsevier B.V. All rights reserved.

Limited-memory fast gradient descent method for graph regularized nonnegative matrix factorization.

PubMed

Guan, Naiyang; Wei, Lei; Luo, Zhigang; Tao, Dacheng

2013-01-01

Graph regularized nonnegative matrix factorization (GNMF) decomposes a nonnegative data matrix X[Symbol:see text]R(m x n) to the product of two lower-rank nonnegative factor matrices, i.e.,W[Symbol:see text]R(m x r) and H[Symbol:see text]R(r x n) (r < min {m,n}) and aims to preserve the local geometric structure of the dataset by minimizing squared Euclidean distance or Kullback-Leibler (KL) divergence between X and WH. The multiplicative update rule (MUR) is usually applied to optimize GNMF, but it suffers from the drawback of slow-convergence because it intrinsically advances one step along the rescaled negative gradient direction with a non-optimal step size. Recently, a multiple step-sizes fast gradient descent (MFGD) method has been proposed for optimizing NMF which accelerates MUR by searching the optimal step-size along the rescaled negative gradient direction with Newton's method. However, the computational cost of MFGD is high because 1) the high-dimensional Hessian matrix is dense and costs too much memory; and 2) the Hessian inverse operator and its multiplication with gradient cost too much time. To overcome these deficiencies of MFGD, we propose an efficient limited-memory FGD (L-FGD) method for optimizing GNMF. In particular, we apply the limited-memory BFGS (L-BFGS) method to directly approximate the multiplication of the inverse Hessian and the gradient for searching the optimal step size in MFGD. The preliminary results on real-world datasets show that L-FGD is more efficient than both MFGD and MUR. To evaluate the effectiveness of L-FGD, we validate its clustering performance for optimizing KL-divergence based GNMF on two popular face image datasets including ORL and PIE and two text corpora including Reuters and TDT2. The experimental results confirm the effectiveness of L-FGD by comparing it with the representative GNMF solvers.

Implementation of a dose gradient method into optimization of dose distribution in prostate cancer 3D-CRT plans

PubMed Central

Giżyńska, Marta K.; Kukołowicz, Paweł F.; Kordowski, Paweł

2014-01-01

Aim The aim of this work is to present a method of beam weight and wedge angle optimization for patients with prostate cancer. Background 3D-CRT is usually realized with forward planning based on a trial and error method. Several authors have published a few methods of beam weight optimization applicable to the 3D-CRT. Still, none on these methods is in common use. Materials and methods Optimization is based on the assumption that the best plan is achieved if dose gradient at ICRU point is equal to zero. Our optimization algorithm requires beam quality index, depth of maximum dose, profiles of wedged fields and maximum dose to femoral heads. The method was tested for 10 patients with prostate cancer, treated with the 3-field technique. Optimized plans were compared with plans prepared by 12 experienced planners. Dose standard deviation in target volume, and minimum and maximum doses were analyzed. Results The quality of plans obtained with the proposed optimization algorithms was comparable to that prepared by experienced planners. Mean difference in target dose standard deviation was 0.1% in favor of the plans prepared by planners for optimization of beam weights and wedge angles. Introducing a correction factor for patient body outline for dose gradient at ICRU point improved dose distribution homogeneity. On average, a 0.1% lower standard deviation was achieved with the optimization algorithm. No significant difference in mean dose–volume histogram for the rectum was observed. Conclusions Optimization shortens very much time planning. The average planning time was 5 min and less than a minute for forward and computer optimization, respectively. PMID:25337411

Reentry-Vehicle Shape Optimization Using a Cartesian Adjoint Method and CAD Geometry

NASA Technical Reports Server (NTRS)

Nemec, Marian; Aftosmis, Michael J.

2006-01-01

A DJOINT solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (e.g., geometric parameters that control the shape). Classic aerodynamic applications of gradient-based optimization include the design of cruise configurations for transonic and supersonic flow, as well as the design of high-lift systems. are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric computer-aided design (CAD). In previous work on Cartesian adjoint solvers, Melvin et al. developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the two-dimensional Euler equations using a ghost-cell method to enforce the wall boundary conditions. In Refs. 18 and 19, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm were the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The accuracy of the gradient computation was verified using several three-dimensional test cases, which included design variables such as the free stream parameters and the planform shape of an isolated wing. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Factors under consideration include the computation of mesh sensitivities that provide a reliable approximation of the objective function gradient, as well as the computation of surface shape sensitivities based on a direct-CAD interface. We present detailed gradient verification studies and then focus on a shape optimization problem for an Apollo-like reentry vehicle. The goal of the optimization is to enhance the lift-to-drag ratio of the capsule by modifying the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design.

Momentum-weighted conjugate gradient descent algorithm for gradient coil optimization.

PubMed

Lu, Hanbing; Jesmanowicz, Andrzej; Li, Shi-Jiang; Hyde, James S

2004-01-01

MRI gradient coil design is a type of nonlinear constrained optimization. A practical problem in transverse gradient coil design using the conjugate gradient descent (CGD) method is that wire elements move at different rates along orthogonal directions (r, phi, z), and tend to cross, breaking the constraints. A momentum-weighted conjugate gradient descent (MW-CGD) method is presented to overcome this problem. This method takes advantage of the efficiency of the CGD method combined with momentum weighting, which is also an intrinsic property of the Levenberg-Marquardt algorithm, to adjust step sizes along the three orthogonal directions. A water-cooled, 12.8 cm inner diameter, three axis torque-balanced gradient coil for rat imaging was developed based on this method, with an efficiency of 2.13, 2.08, and 4.12 mT.m(-1).A(-1) along X, Y, and Z, respectively. Experimental data demonstrate that this method can improve efficiency by 40% and field uniformity by 27%. This method has also been applied to the design of a gradient coil for the human brain, employing remote current return paths. The benefits of this design include improved gradient field uniformity and efficiency, with a shorter length than gradient coil designs using coaxial return paths. Copyright 2003 Wiley-Liss, Inc.

Structural optimization with approximate sensitivities

NASA Technical Reports Server (NTRS)

Patnaik, S. N.; Hopkins, D. A.; Coroneos, R.

1994-01-01

Computational efficiency in structural optimization can be enhanced if the intensive computations associated with the calculation of the sensitivities, that is, gradients of the behavior constraints, are reduced. Approximation to gradients of the behavior constraints that can be generated with small amount of numerical calculations is proposed. Structural optimization with these approximate sensitivities produced correct optimum solution. Approximate gradients performed well for different nonlinear programming methods, such as the sequence of unconstrained minimization technique, method of feasible directions, sequence of quadratic programming, and sequence of linear programming. Structural optimization with approximate gradients can reduce by one third the CPU time that would otherwise be required to solve the problem with explicit closed-form gradients. The proposed gradient approximation shows potential to reduce intensive computation that has been associated with traditional structural optimization.

ANOTHER LOOK AT THE FAST ITERATIVE SHRINKAGE/THRESHOLDING ALGORITHM (FISTA)*

PubMed Central

Kim, Donghwan; Fessler, Jeffrey A.

2017-01-01

This paper provides a new way of developing the “Fast Iterative Shrinkage/Thresholding Algorithm (FISTA)” [3] that is widely used for minimizing composite convex functions with a nonsmooth term such as the ℓ1 regularizer. In particular, this paper shows that FISTA corresponds to an optimized approach to accelerating the proximal gradient method with respect to a worst-case bound of the cost function. This paper then proposes a new algorithm that is derived by instead optimizing the step coefficients of the proximal gradient method with respect to a worst-case bound of the composite gradient mapping. The proof is based on the worst-case analysis called Performance Estimation Problem in [11]. PMID:29805242

Gaussian process regression to accelerate geometry optimizations relying on numerical differentiation

NASA Astrophysics Data System (ADS)

Schmitz, Gunnar; Christiansen, Ove

2018-06-01

We study how with means of Gaussian Process Regression (GPR) geometry optimizations, which rely on numerical gradients, can be accelerated. The GPR interpolates a local potential energy surface on which the structure is optimized. It is found to be efficient to combine results on a low computational level (HF or MP2) with the GPR-calculated gradient of the difference between the low level method and the target method, which is a variant of explicitly correlated Coupled Cluster Singles and Doubles with perturbative Triples correction CCSD(F12*)(T) in this study. Overall convergence is achieved if both the potential and the geometry are converged. Compared to numerical gradient-based algorithms, the number of required single point calculations is reduced. Although introducing an error due to the interpolation, the optimized structures are sufficiently close to the minimum of the target level of theory meaning that the reference and predicted minimum only vary energetically in the μEh regime.

Automated correction of improperly rotated diffusion gradient orientations in diffusion weighted MRI.

PubMed

Jeurissen, Ben; Leemans, Alexander; Sijbers, Jan

2014-10-01

Ensuring one is using the correct gradient orientations in a diffusion MRI study can be a challenging task. As different scanners, file formats and processing tools use different coordinate frame conventions, in practice, users can end up with improperly oriented gradient orientations. Using such wrongly oriented gradient orientations for subsequent diffusion parameter estimation will invalidate all rotationally variant parameters and fiber tractography results. While large misalignments can be detected by visual inspection, small rotations of the gradient table (e.g. due to angulation of the acquisition plane), are much more difficult to detect. In this work, we propose an automated method to align the coordinate frame of the gradient orientations with that of the corresponding diffusion weighted images, using a metric based on whole brain fiber tractography. By transforming the gradient table and measuring the average fiber trajectory length, we search for the transformation that results in the best global 'connectivity'. To ensure a fast calculation of the metric we included a range of algorithmic optimizations in our tractography routine. To make the optimization routine robust to spurious local maxima, we use a stochastic optimization routine that selects a random set of seed points on each evaluation. Using simulations, we show that our method can recover the correct gradient orientations with high accuracy and precision. In addition, we demonstrate that our technique can successfully recover rotated gradient tables on a wide range of clinically realistic data sets. As such, our method provides a practical and robust solution to an often overlooked pitfall in the processing of diffusion MRI. Copyright © 2014 Elsevier B.V. All rights reserved.

Gradient gravitational search: An efficient metaheuristic algorithm for global optimization.

PubMed

Dash, Tirtharaj; Sahu, Prabhat K

2015-05-30

The adaptation of novel techniques developed in the field of computational chemistry to solve the concerned problems for large and flexible molecules is taking the center stage with regard to efficient algorithm, computational cost and accuracy. In this article, the gradient-based gravitational search (GGS) algorithm, using analytical gradients for a fast minimization to the next local minimum has been reported. Its efficiency as metaheuristic approach has also been compared with Gradient Tabu Search and others like: Gravitational Search, Cuckoo Search, and Back Tracking Search algorithms for global optimization. Moreover, the GGS approach has also been applied to computational chemistry problems for finding the minimal value potential energy of two-dimensional and three-dimensional off-lattice protein models. The simulation results reveal the relative stability and physical accuracy of protein models with efficient computational cost. © 2015 Wiley Periodicals, Inc.

Medial-based deformable models in nonconvex shape-spaces for medical image segmentation.

PubMed

McIntosh, Chris; Hamarneh, Ghassan

2012-01-01

We explore the application of genetic algorithms (GA) to deformable models through the proposition of a novel method for medical image segmentation that combines GA with nonconvex, localized, medial-based shape statistics. We replace the more typical gradient descent optimizer used in deformable models with GA, and the convex, implicit, global shape statistics with nonconvex, explicit, localized ones. Specifically, we propose GA to reduce typical deformable model weaknesses pertaining to model initialization, pose estimation and local minima, through the simultaneous evolution of a large number of models. Furthermore, we constrain the evolution, and thus reduce the size of the search-space, by using statistically-based deformable models whose deformations are intuitive (stretch, bulge, bend) and are driven in terms of localized principal modes of variation, instead of modes of variation across the entire shape that often fail to capture localized shape changes. Although GA are not guaranteed to achieve the global optima, our method compares favorably to the prevalent optimization techniques, convex/nonconvex gradient-based optimizers and to globally optimal graph-theoretic combinatorial optimization techniques, when applied to the task of corpus callosum segmentation in 50 mid-sagittal brain magnetic resonance images.

An adjoint method for gradient-based optimization of stellarator coil shapes

NASA Astrophysics Data System (ADS)

Paul, E. J.; Landreman, M.; Bader, A.; Dorland, W.

2018-07-01

We present a method for stellarator coil design via gradient-based optimization of the coil-winding surface. The REGCOIL (Landreman 2017 Nucl. Fusion 57 046003) approach is used to obtain the coil shapes on the winding surface using a continuous current potential. We apply the adjoint method to calculate derivatives of the objective function, allowing for efficient computation of analytic gradients while eliminating the numerical noise of approximate derivatives. We are able to improve engineering properties of the coils by targeting the root-mean-squared current density in the objective function. We obtain winding surfaces for W7-X and HSX which simultaneously decrease the normal magnetic field on the plasma surface and increase the surface-averaged distance between the coils and the plasma in comparison with the actual winding surfaces. The coils computed on the optimized surfaces feature a smaller toroidal extent and curvature and increased inter-coil spacing. A technique for computation of the local sensitivity of figures of merit to normal displacements of the winding surface is presented, with potential applications for understanding engineering tolerances.

A Requirements-Driven Optimization Method for Acoustic Liners Using Analytic Derivatives

NASA Technical Reports Server (NTRS)

Berton, Jeffrey J.; Lopes, Leonard V.

2017-01-01

More than ever, there is flexibility and freedom in acoustic liner design. Subject to practical considerations, liner design variables may be manipulated to achieve a target attenuation spectrum. But characteristics of the ideal attenuation spectrum can be difficult to know. Many multidisciplinary system effects govern how engine noise sources contribute to community noise. Given a hardwall fan noise source to be suppressed, and using an analytical certification noise model to compute a community noise measure of merit, the optimal attenuation spectrum can be derived using multidisciplinary systems analysis methods. In a previous paper on this subject, a method deriving the ideal target attenuation spectrum that minimizes noise perceived by observers on the ground was described. A simple code-wrapping approach was used to evaluate a community noise objective function for an external optimizer. Gradients were evaluated using a finite difference formula. The subject of this paper is an application of analytic derivatives that supply precise gradients to an optimization process. Analytic derivatives improve the efficiency and accuracy of gradient-based optimization methods and allow consideration of more design variables. In addition, the benefit of variable impedance liners is explored using a multi-objective optimization.

Chiral stationary phase optimized selectivity liquid chromatography: A strategy for the separation of chiral isomers.

PubMed

Hegade, Ravindra Suryakant; De Beer, Maarten; Lynen, Frederic

2017-09-15

Chiral Stationary-Phase Optimized Selectivity Liquid Chromatography (SOSLC) is proposed as a tool to optimally separate mixtures of enantiomers on a set of commercially available coupled chiral columns. This approach allows for the prediction of the separation profiles on any possible combination of the chiral stationary phases based on a limited number of preliminary analyses, followed by automated selection of the optimal column combination. Both the isocratic and gradient SOSLC approach were implemented for prediction of the retention times for a mixture of 4 chiral pairs on all possible combinations of the 5 commercial chiral columns. Predictions in isocratic and gradient mode were performed with a commercially available and with an in-house developed Microsoft visual basic algorithm, respectively. Optimal predictions in the isocratic mode required the coupling of 4 columns whereby relative deviations between the predicted and experimental retention times ranged between 2 and 7%. Gradient predictions led to the coupling of 3 chiral columns allowing baseline separation of all solutes, whereby differences between predictions and experiments ranged between 0 and 12%. The methodology is a novel tool allowing optimizing the separation of mixtures of optical isomers. Copyright © 2017 Elsevier B.V. All rights reserved.

Optimal Design of Gradient Materials and Bi-Level Optimization of Topology Using Targets (BOTT)

NASA Astrophysics Data System (ADS)

Garland, Anthony

The objective of this research is to understand the fundamental relationships necessary to develop a method to optimize both the topology and the internal gradient material distribution of a single object while meeting constraints and conflicting objectives. Functionally gradient material (FGM) objects possess continuous varying material properties throughout the object, and they allow an engineer to tailor individual regions of an object to have specific mechanical properties by locally modifying the internal material composition. A variety of techniques exists for topology optimization, and several methods exist for FGM optimization, but combining the two together is difficult. Understanding the relationship between topology and material gradient optimization enables the selection of an appropriate model and the development of algorithms, which allow engineers to design high-performance parts that better meet design objectives than optimized homogeneous material objects. For this research effort, topology optimization means finding the optimal connected structure with an optimal shape. FGM optimization means finding the optimal macroscopic material properties within an object. Tailoring the material constitutive matrix as a function of position results in gradient properties. Once, the target macroscopic properties are known, a mesostructure or a particular material nanostructure can be found which gives the target material properties at each macroscopic point. This research demonstrates that topology and gradient materials can both be optimized together for a single part. The algorithms use a discretized model of the domain and gradient based optimization algorithms. In addition, when considering two conflicting objectives the algorithms in this research generate clear 'features' within a single part. This tailoring of material properties within different areas of a single part (automated design of 'features') using computational design tools is a novel benefit of gradient material designs. A macroscopic gradient can be achieved by varying the microstructure or the mesostructures of an object. The mesostructure interpretation allows for more design freedom since the mesostructures can be tuned to have non-isotropic material properties. A new algorithm called Bi-level Optimization of Topology using Targets (BOTT) seeks to find the best distribution of mesostructure designs throughout a single object in order to minimize an objective value. On the macro level, the BOTT algorithm optimizes the macro topology and gradient material properties within the object. The BOTT algorithm optimizes the material gradient by finding the best constitutive matrix at each location with the object. In order to enhance the likelihood that a mesostructure can be generated with the same equivalent constitutive matrix, the variability of the constitutive matrix is constrained to be an orthotropic material. The stiffness in the X and Y directions (of the base coordinate system) can change in addition to rotating the orthotropic material to align with the loading at each region. Second, the BOTT algorithm designs mesostructures with macroscopic properties equal to the target properties found in step one while at the same time the algorithm seeks to minimize material usage in each mesostructure. The mesostructure algorithm maximizes the strain energy of the mesostructures unit cell when a pseudo strain is applied to the cell. A set of experiments reveals the fundamental relationship between target cell density and the strain (or pseudo strain) applied to a unit cell and the output effective properties of the mesostructure. At low density, a few mesostructure unit cell design are possible, while at higher density the mesostructure unit cell designs have many possibilities. Therefore, at low densities the effective properties of the mesostructure are a step function of the applied pseudo strain. At high densities, the effective properties of the mesostructure are continuous function of the applied pseudo strain. Finally, the macro and mesostructure designs are coordinated so that the macro and meso levels agree on the material properties at each macro region. In addition, a coordination effort seeks to coordinate the boundaries of adjacent mesostructure designs so that the macro load path is transmitted from one mesostructure design to its neighbors. The BOTT algorithm has several advantages over existing algorithms within the literature. First, the BOTT algorithm significantly reduces the computational power required to run the algorithm. Second, the BOTT algorithm indirectly enforces a minimum mesostructure density constraint which increases the manufacturability of the final design. Third, the BOTT algorithm seeks to transfer the load from one mesostructure to its neighbors by coordinating the boundaries of adjacent mesostructure designs. However, the BOTT algorithm can still be improved since it may have difficulty converging due to the step function nature of the mesostructure design problem at low density.

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models.

PubMed

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.

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models

PubMed Central

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. PMID:26502409

Oscillator strengths, first-order properties, and nuclear gradients for local ADC(2).

PubMed

Schütz, Martin

2015-06-07

We describe theory and implementation of oscillator strengths, orbital-relaxed first-order properties, and nuclear gradients for the local algebraic diagrammatic construction scheme through second order. The formalism is derived via time-dependent linear response theory based on a second-order unitary coupled cluster model. The implementation presented here is a modification of our previously developed algorithms for Laplace transform based local time-dependent coupled cluster linear response (CC2LR); the local approximations thus are state specific and adaptive. The symmetry of the Jacobian leads to considerable simplifications relative to the local CC2LR method; as a result, a gradient evaluation is about four times less expensive. Test calculations show that in geometry optimizations, usually very similar geometries are obtained as with the local CC2LR method (provided that a second-order method is applicable). As an exemplary application, we performed geometry optimizations on the low-lying singlet states of chlorophyllide a.

Accelerating IMRT optimization by voxel sampling

NASA Astrophysics Data System (ADS)

Martin, Benjamin C.; Bortfeld, Thomas R.; Castañon, David A.

2007-12-01

This paper presents a new method for accelerating intensity-modulated radiation therapy (IMRT) optimization using voxel sampling. Rather than calculating the dose to the entire patient at each step in the optimization, the dose is only calculated for some randomly selected voxels. Those voxels are then used to calculate estimates of the objective and gradient which are used in a randomized version of a steepest descent algorithm. By selecting different voxels on each step, we are able to find an optimal solution to the full problem. We also present an algorithm to automatically choose the best sampling rate for each structure within the patient during the optimization. Seeking further improvements, we experimented with several other gradient-based optimization algorithms and found that the delta-bar-delta algorithm performs well despite the randomness. Overall, we were able to achieve approximately an order of magnitude speedup on our test case as compared to steepest descent.

A hybrid multi-objective evolutionary algorithm for wind-turbine blade optimization

NASA Astrophysics Data System (ADS)

Sessarego, M.; Dixon, K. R.; Rival, D. E.; Wood, D. H.

2015-08-01

A concurrent-hybrid non-dominated sorting genetic algorithm (hybrid NSGA-II) has been developed and applied to the simultaneous optimization of the annual energy production, flapwise root-bending moment and mass of the NREL 5 MW wind-turbine blade. By hybridizing a multi-objective evolutionary algorithm (MOEA) with gradient-based local search, it is believed that the optimal set of blade designs could be achieved in lower computational cost than for a conventional MOEA. To measure the convergence between the hybrid and non-hybrid NSGA-II on a wind-turbine blade optimization problem, a computationally intensive case was performed using the non-hybrid NSGA-II. From this particular case, a three-dimensional surface representing the optimal trade-off between the annual energy production, flapwise root-bending moment and blade mass was achieved. The inclusion of local gradients in the blade optimization, however, shows no improvement in the convergence for this three-objective problem.

Pixel-based OPC optimization based on conjugate gradients.

PubMed

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.

Optimization for high-dose-rate brachytherapy of cervical cancer with adaptive simulated annealing and gradient descent.

PubMed

Yao, Rui; Templeton, Alistair K; Liao, Yixiang; Turian, Julius V; Kiel, Krystyna D; Chu, James C H

2014-01-01

To validate an in-house optimization program that uses adaptive simulated annealing (ASA) and gradient descent (GD) algorithms and investigate features of physical dose and generalized equivalent uniform dose (gEUD)-based objective functions in high-dose-rate (HDR) brachytherapy for cervical cancer. Eight Syed/Neblett template-based cervical cancer HDR interstitial brachytherapy cases were used for this study. Brachytherapy treatment plans were first generated using inverse planning simulated annealing (IPSA). Using the same dwell positions designated in IPSA, plans were then optimized with both physical dose and gEUD-based objective functions, using both ASA and GD algorithms. Comparisons were made between plans both qualitatively and based on dose-volume parameters, evaluating each optimization method and objective function. A hybrid objective function was also designed and implemented in the in-house program. The ASA plans are higher on bladder V75% and D2cc (p=0.034) and lower on rectum V75% and D2cc (p=0.034) than the IPSA plans. The ASA and GD plans are not significantly different. The gEUD-based plans have higher homogeneity index (p=0.034), lower overdose index (p=0.005), and lower rectum gEUD and normal tissue complication probability (p=0.005) than the physical dose-based plans. The hybrid function can produce a plan with dosimetric parameters between the physical dose-based and gEUD-based plans. The optimized plans with the same objective value and dose-volume histogram could have different dose distributions. Our optimization program based on ASA and GD algorithms is flexible on objective functions, optimization parameters, and can generate optimized plans comparable with IPSA. Copyright © 2014 American Brachytherapy Society. Published by Elsevier Inc. All rights reserved.

Integrated Design of Downwind Land-Based Wind Turbines using Analytic Gradients

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ning, Andrew; Petch, Derek

2016-12-01

Wind turbines are complex systems where component-level changes can have significant system-level effects. Effective wind turbine optimization generally requires an integrated analysis approach with a large number of design variables. Optimizing across large variable sets is orders of magnitude more efficient with gradient-based methods as compared with gradient-free method, particularly when using exact gradients. We have developed a wind turbine analysis set of over 100 components where 90% of the models provide numerically exact gradients through symbolic differentiation, automatic differentiation, and adjoint methods. This framework is applied to a specific design study focused on downwind land-based wind turbines. Downwind machinesmore » are of potential interest for large wind turbines where the blades are often constrained by the stiffness required to prevent a tower strike. The mass of these rotor blades may be reduced by utilizing a downwind configuration where the constraints on tower strike are less restrictive. The large turbines of this study range in power rating from 5-7MW and in diameter from 105m to 175m. The changes in blade mass and power production have important effects on the rest of the system, and thus the nacelle and tower systems are also optimized. For high-speed wind sites, downwind configurations do not appear advantageous. The decrease in blade mass (10%) is offset by increases in tower mass caused by the bending moment from the rotor-nacelle-assembly. For low-wind speed sites, the decrease in blade mass is more significant (25-30%) and shows potential for modest decreases in overall cost of energy (around 1-2%).« less

Three-Dimensional Viscous Alternating Direction Implicit Algorithm and Strategies for Shape Optimization

NASA Technical Reports Server (NTRS)

Pandya, Mohagna J.; Baysal, Oktay

1997-01-01

A gradient-based shape optimization based on quasi-analytical sensitivities has been extended for practical three-dimensional aerodynamic applications. The flow analysis has been rendered by a fully implicit, finite-volume formulation of the Euler and Thin-Layer Navier-Stokes (TLNS) equations. Initially, the viscous laminar flow analysis for a wing has been compared with an independent computational fluid dynamics (CFD) code which has been extensively validated. The new procedure has been demonstrated in the design of a cranked arrow wing at Mach 2.4 with coarse- and fine-grid based computations performed with Euler and TLNS equations. The influence of the initial constraints on the geometry and aerodynamics of the optimized shape has been explored. Various final shapes generated for an identical initial problem formulation but with different optimization path options (coarse or fine grid, Euler or TLNS), have been aerodynamically evaluated via a common fine-grid TLNS-based analysis. The initial constraint conditions show significant bearing on the optimization results. Also, the results demonstrate that to produce an aerodynamically efficient design, it is imperative to include the viscous physics in the optimization procedure with the proper resolution. Based upon the present results, to better utilize the scarce computational resources, it is recommended that, a number of viscous coarse grid cases using either a preconditioned bi-conjugate gradient (PbCG) or an alternating-direction-implicit (ADI) method, should initially be employed to improve the optimization problem definition, the design space and initial shape. Optimized shapes should subsequently be analyzed using a high fidelity (viscous with fine-grid resolution) flow analysis to evaluate their true performance potential. Finally, a viscous fine-grid-based shape optimization should be conducted, using an ADI method, to accurately obtain the final optimized shape.

Hybrid DFP-CG method for solving unconstrained optimization problems

NASA Astrophysics Data System (ADS)

Osman, Wan Farah Hanan Wan; Asrul Hery Ibrahim, Mohd; Mamat, Mustafa

2017-09-01

The conjugate gradient (CG) method and quasi-Newton method are both well known method for solving unconstrained optimization method. In this paper, we proposed a new method by combining the search direction between conjugate gradient method and quasi-Newton method based on BFGS-CG method developed by Ibrahim et al. The Davidon-Fletcher-Powell (DFP) update formula is used as an approximation of Hessian for this new hybrid algorithm. Numerical result showed that the new algorithm perform well than the ordinary DFP method and proven to posses both sufficient descent and global convergence properties.

Applications of thermal-gradients method for the optimization of α-amylase crystallization conditions based on dynamic and static light scattering data

NASA Astrophysics Data System (ADS)

Delboni, L. F.; Iulek, J.; Burger, R.; da Silva, A. C. R.; Moreno, A.

2002-02-01

The expression, purification, crystallization, and characterization by X-ray diffraction of α-amylase are described here. Dynamic and static light scattering methods with a temperature controller was used to optimize the crystallization conditions of α-amylase from Bacillus stearothermophilus an important enzyme in many fields of industrial activity. After applying thermal gradients for growing crystals, X-ray cryo-crystallographic methods were employed for the data collection. Crystals grown by these thermal-gradients diffracted up to a maximum resolution of 3.8 Å, which allowed the determination of the unit cell constants as follows: a=61.7 Å, b=86.7 Å, c=92.2 Å and space group C222 (or C222 1).

On the convergence of a linesearch based proximal-gradient method for nonconvex optimization

NASA Astrophysics Data System (ADS)

Bonettini, S.; Loris, I.; Porta, F.; Prato, M.; Rebegoldi, S.

2017-05-01

We consider a variable metric linesearch based proximal gradient method for the minimization of the sum of a smooth, possibly nonconvex function plus a convex, possibly nonsmooth term. We prove convergence of this iterative algorithm to a critical point if the objective function satisfies the Kurdyka-Łojasiewicz property at each point of its domain, under the assumption that a limit point exists. The proposed method is applied to a wide collection of image processing problems and our numerical tests show that our algorithm results to be flexible, robust and competitive when compared to recently proposed approaches able to address the optimization problems arising in the considered applications.

Concurrent Monte Carlo transport and fluence optimization with fluence adjusting scalable transport Monte Carlo

PubMed Central

Svatos, M.; Zankowski, C.; Bednarz, B.

2016-01-01

Purpose: The future of radiation therapy will require advanced inverse planning solutions to support single-arc, multiple-arc, and “4π” delivery modes, which present unique challenges in finding an optimal treatment plan over a vast search space, while still preserving dosimetric accuracy. The successful clinical implementation of such methods would benefit from Monte Carlo (MC) based dose calculation methods, which can offer improvements in dosimetric accuracy when compared to deterministic methods. The standard method for MC based treatment planning optimization leverages the accuracy of the MC dose calculation and efficiency of well-developed optimization methods, by precalculating the fluence to dose relationship within a patient with MC methods and subsequently optimizing the fluence weights. However, the sequential nature of this implementation is computationally time consuming and memory intensive. Methods to reduce the overhead of the MC precalculation have been explored in the past, demonstrating promising reductions of computational time overhead, but with limited impact on the memory overhead due to the sequential nature of the dose calculation and fluence optimization. The authors propose an entirely new form of “concurrent” Monte Carlo treat plan optimization: a platform which optimizes the fluence during the dose calculation, reduces wasted computation time being spent on beamlets that weakly contribute to the final dose distribution, and requires only a low memory footprint to function. In this initial investigation, the authors explore the key theoretical and practical considerations of optimizing fluence in such a manner. Methods: The authors present a novel derivation and implementation of a gradient descent algorithm that allows for optimization during MC particle transport, based on highly stochastic information generated through particle transport of very few histories. A gradient rescaling and renormalization algorithm, and the concept of momentum from stochastic gradient descent were used to address obstacles unique to performing gradient descent fluence optimization during MC particle transport. The authors have applied their method to two simple geometrical phantoms, and one clinical patient geometry to examine the capability of this platform to generate conformal plans as well as assess its computational scaling and efficiency, respectively. Results: The authors obtain a reduction of at least 50% in total histories transported in their investigation compared to a theoretical unweighted beamlet calculation and subsequent fluence optimization method, and observe a roughly fixed optimization time overhead consisting of ∼10% of the total computation time in all cases. Finally, the authors demonstrate a negligible increase in memory overhead of ∼7–8 MB to allow for optimization of a clinical patient geometry surrounded by 36 beams using their platform. Conclusions: This study demonstrates a fluence optimization approach, which could significantly improve the development of next generation radiation therapy solutions while incurring minimal additional computational overhead. PMID:27277051

Evolutionary Optimization of Centrifugal Nozzles for Organic Vapours

NASA Astrophysics Data System (ADS)

Persico, Giacomo

2017-03-01

This paper discusses the shape-optimization of non-conventional centrifugal turbine nozzles for Organic Rankine Cycle applications. The optimal aerodynamic design is supported by the use of a non-intrusive, gradient-free technique specifically developed for shape optimization of turbomachinery profiles. The method is constructed as a combination of a geometrical parametrization technique based on B-Splines, a high-fidelity and experimentally validated Computational Fluid Dynamic solver, and a surrogate-based evolutionary algorithm. The non-ideal gas behaviour featuring the flow of organic fluids in the cascades of interest is introduced via a look-up-table approach, which is rigorously applied throughout the whole optimization process. Two transonic centrifugal nozzles are considered, featuring very different loading and radial extension. The use of a systematic and automatic design method to such a non-conventional configuration highlights the character of centrifugal cascades; the blades require a specific and non-trivial definition of the shape, especially in the rear part, to avoid the onset of shock waves. It is shown that the optimization acts in similar way for the two cascades, identifying an optimal curvature of the blade that both provides a relevant increase of cascade performance and a reduction of downstream gradients.

A modified conjugate gradient coefficient with inexact line search for unconstrained optimization

NASA Astrophysics Data System (ADS)

Aini, Nurul; Rivaie, Mohd; Mamat, Mustafa

2016-11-01

Conjugate gradient (CG) method is a line search algorithm mostly known for its wide application in solving unconstrained optimization problems. Its low memory requirements and global convergence properties makes it one of the most preferred method in real life application such as in engineering and business. In this paper, we present a new CG method based on AMR* and CD method for solving unconstrained optimization functions. The resulting algorithm is proven to have both the sufficient descent and global convergence properties under inexact line search. Numerical tests are conducted to assess the effectiveness of the new method in comparison to some previous CG methods. The results obtained indicate that our method is indeed superior.

Solving traveling salesman problems with DNA molecules encoding numerical values.

PubMed

Lee, Ji Youn; Shin, Soo-Yong; Park, Tai Hyun; Zhang, Byoung-Tak

2004-12-01

We introduce a DNA encoding method to represent numerical values and a biased molecular algorithm based on the thermodynamic properties of DNA. DNA strands are designed to encode real values by variation of their melting temperatures. The thermodynamic properties of DNA are used for effective local search of optimal solutions using biochemical techniques, such as denaturation temperature gradient polymerase chain reaction and temperature gradient gel electrophoresis. The proposed method was successfully applied to the traveling salesman problem, an instance of optimization problems on weighted graphs. This work extends the capability of DNA computing to solving numerical optimization problems, which is contrasted with other DNA computing methods focusing on logical problem solving.

Dai-Kou type conjugate gradient methods with a line search only using gradient.

PubMed

Huang, Yuanyuan; Liu, Changhe

2017-01-01

In this paper, the Dai-Kou type conjugate gradient methods are developed to solve the optimality condition of an unconstrained optimization, they only utilize gradient information and have broader application scope. Under suitable conditions, the developed methods are globally convergent. Numerical tests and comparisons with the PRP+ conjugate gradient method only using gradient show that the methods are efficient.

A Class of Prediction-Correction Methods for Time-Varying Convex Optimization

NASA Astrophysics Data System (ADS)

Simonetto, Andrea; Mokhtari, Aryan; Koppel, Alec; Leus, Geert; Ribeiro, Alejandro

2016-09-01

This paper considers unconstrained convex optimization problems with time-varying objective functions. We propose algorithms with a discrete time-sampling scheme to find and track the solution trajectory based on prediction and correction steps, while sampling the problem data at a constant rate of $1/h$, where $h$ is the length of the sampling interval. The prediction step is derived by analyzing the iso-residual dynamics of the optimality conditions. The correction step adjusts for the distance between the current prediction and the optimizer at each time step, and consists either of one or multiple gradient steps or Newton steps, which respectively correspond to the gradient trajectory tracking (GTT) or Newton trajectory tracking (NTT) algorithms. Under suitable conditions, we establish that the asymptotic error incurred by both proposed methods behaves as $O(h^2)$, and in some cases as $O(h^4)$, which outperforms the state-of-the-art error bound of $O(h)$ for correction-only methods in the gradient-correction step. Moreover, when the characteristics of the objective function variation are not available, we propose approximate gradient and Newton tracking algorithms (AGT and ANT, respectively) that still attain these asymptotical error bounds. Numerical simulations demonstrate the practical utility of the proposed methods and that they improve upon existing techniques by several orders of magnitude.

Tunable, Flexible, and Efficient Optimization of Control Pulses for Practical Qubits

NASA Astrophysics Data System (ADS)

Machnes, Shai; Assémat, Elie; Tannor, David; Wilhelm, Frank K.

2018-04-01

Quantum computation places very stringent demands on gate fidelities, and experimental implementations require both the controls and the resultant dynamics to conform to hardware-specific constraints. Superconducting qubits present the additional requirement that pulses must have simple parameterizations, so they can be further calibrated in the experiment, to compensate for uncertainties in system parameters. Other quantum technologies, such as sensing, require extremely high fidelities. We present a novel, conceptually simple and easy-to-implement gradient-based optimal control technique named gradient optimization of analytic controls (GOAT), which satisfies all the above requirements, unlike previous approaches. To demonstrate GOAT's capabilities, with emphasis on flexibility and ease of subsequent calibration, we optimize fast coherence-limited pulses for two leading superconducting qubits architectures—flux-tunable transmons and fixed-frequency transmons with tunable couplers.

Multifidelity Analysis and Optimization for Supersonic Design

NASA Technical Reports Server (NTRS)

Kroo, Ilan; Willcox, Karen; March, Andrew; Haas, Alex; Rajnarayan, Dev; Kays, Cory

2010-01-01

Supersonic aircraft design is a computationally expensive optimization problem and multifidelity approaches over a significant opportunity to reduce design time and computational cost. This report presents tools developed to improve supersonic aircraft design capabilities including: aerodynamic tools for supersonic aircraft configurations; a systematic way to manage model uncertainty; and multifidelity model management concepts that incorporate uncertainty. The aerodynamic analysis tools developed are appropriate for use in a multifidelity optimization framework, and include four analysis routines to estimate the lift and drag of a supersonic airfoil, a multifidelity supersonic drag code that estimates the drag of aircraft configurations with three different methods: an area rule method, a panel method, and an Euler solver. In addition, five multifidelity optimization methods are developed, which include local and global methods as well as gradient-based and gradient-free techniques.

An optimization approach for fitting canonical tensor decompositions.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dunlavy, Daniel M.; Acar, Evrim; Kolda, Tamara Gibson

Tensor decompositions are higher-order analogues of matrix decompositions and have proven to be powerful tools for data analysis. In particular, we are interested in the canonical tensor decomposition, otherwise known as the CANDECOMP/PARAFAC decomposition (CPD), which expresses a tensor as the sum of component rank-one tensors and is used in a multitude of applications such as chemometrics, signal processing, neuroscience, and web analysis. The task of computing the CPD, however, can be difficult. The typical approach is based on alternating least squares (ALS) optimization, which can be remarkably fast but is not very accurate. Previously, nonlinear least squares (NLS) methodsmore » have also been recommended; existing NLS methods are accurate but slow. In this paper, we propose the use of gradient-based optimization methods. We discuss the mathematical calculation of the derivatives and further show that they can be computed efficiently, at the same cost as one iteration of ALS. Computational experiments demonstrate that the gradient-based optimization methods are much more accurate than ALS and orders of magnitude faster than NLS.« less

Construction of bionic tissue engineering cartilage scaffold based on three-dimensional printing and oriented frozen technology.

PubMed

Xu, Yuanyuan; Guo, Xiao; Yang, Shuaitao; Li, Long; Zhang, Peng; Sun, Wei; Liu, Changyong; Mi, Shengli

2018-06-01

Articular cartilage (AC) has gradient features in both mechanics and histology as well as a poor regeneration ability. The repair of AC poses difficulties in both research and the clinic. In this paper, a gradient scaffold based on poly(lactic-co-glycolic acid) (PLGA)-extracellular matrix was proposed. Cartilage scaffolds with a three-layer gradient structure were fabricated by PLGA through three-dimensional printing, and the microstructure orientation and pore fabrication were made by decellularized extracellular matrix injection and directional freezing. The manufactured scaffold has a mechanical strength close to that of real cartilage. A quantitative optimization of the Young's modulus and shear modulus was achieved by material mechanics formulas, which achieved a more accurate mechanical bionic and a more stable interface performance because of the one-time molding process. At the same time, the scaffolds have a bionic and gradient microstructure orientation and pore size, and the stratification ratio can be quantitatively optimized by design of the freeze box and temperature simulation. In general, this paper provides a method to optimize AC scaffolds by both mechanics and histology as well as a bionic multimaterial scaffold. This paper is of significance for cell culture and clinical transplantation experiments. © 2018 Wiley Periodicals, Inc. J Biomed Mater Res Part A: 106A: 1664-1676, 2018. © 2018 Wiley Periodicals, Inc.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yang, Y. M., E-mail: ymingy@gmail.com; Bednarz, B.; Svatos, M.

Purpose: The future of radiation therapy will require advanced inverse planning solutions to support single-arc, multiple-arc, and “4π” delivery modes, which present unique challenges in finding an optimal treatment plan over a vast search space, while still preserving dosimetric accuracy. The successful clinical implementation of such methods would benefit from Monte Carlo (MC) based dose calculation methods, which can offer improvements in dosimetric accuracy when compared to deterministic methods. The standard method for MC based treatment planning optimization leverages the accuracy of the MC dose calculation and efficiency of well-developed optimization methods, by precalculating the fluence to dose relationship withinmore » a patient with MC methods and subsequently optimizing the fluence weights. However, the sequential nature of this implementation is computationally time consuming and memory intensive. Methods to reduce the overhead of the MC precalculation have been explored in the past, demonstrating promising reductions of computational time overhead, but with limited impact on the memory overhead due to the sequential nature of the dose calculation and fluence optimization. The authors propose an entirely new form of “concurrent” Monte Carlo treat plan optimization: a platform which optimizes the fluence during the dose calculation, reduces wasted computation time being spent on beamlets that weakly contribute to the final dose distribution, and requires only a low memory footprint to function. In this initial investigation, the authors explore the key theoretical and practical considerations of optimizing fluence in such a manner. Methods: The authors present a novel derivation and implementation of a gradient descent algorithm that allows for optimization during MC particle transport, based on highly stochastic information generated through particle transport of very few histories. A gradient rescaling and renormalization algorithm, and the concept of momentum from stochastic gradient descent were used to address obstacles unique to performing gradient descent fluence optimization during MC particle transport. The authors have applied their method to two simple geometrical phantoms, and one clinical patient geometry to examine the capability of this platform to generate conformal plans as well as assess its computational scaling and efficiency, respectively. Results: The authors obtain a reduction of at least 50% in total histories transported in their investigation compared to a theoretical unweighted beamlet calculation and subsequent fluence optimization method, and observe a roughly fixed optimization time overhead consisting of ∼10% of the total computation time in all cases. Finally, the authors demonstrate a negligible increase in memory overhead of ∼7–8 MB to allow for optimization of a clinical patient geometry surrounded by 36 beams using their platform. Conclusions: This study demonstrates a fluence optimization approach, which could significantly improve the development of next generation radiation therapy solutions while incurring minimal additional computational overhead.« less

Design optimization using adjoint of Long-time LES for the trailing edge of a transonic turbine vane

NASA Astrophysics Data System (ADS)

Talnikar, Chaitanya; Wang, Qiqi

2017-11-01

Adjoint-based design optimization methods have been applied to low-fidelity simulation methods like Reynolds Averaged Navier-Stokes (RANS) and are useful for designing fluid machinery components. But to reliably capture the complex flow phenomena involved in turbomachinery, high fidelity simulations like large eddy simulation (LES) are required. Unfortunately due to the chaotic dynamics of turbulence, the unsteady adjoint method for LES diverges and produces incorrect gradients. Using a viscosity stabilized unsteady adjoint method developed for LES, the gradient can be obtained with reasonable accuracy. In this paper, design of the trailing edge of a gas turbine inlet guide vane is performed with the objective to reduce stagnation pressure loss and heat transfer over the surface of the vane. Slight changes in the shape of trailing edge can significantly impact these quantities by altering the boundary layer development process and separation points. The trailing edge is parameterized using a linear combination of 5 convex designs. Bayesian optimization is used as a global optimizer with the objective function evaluated from the LES and gradients obtained using the viscosity adjoint method. Results from the optimization, performed on the supercomputer Mira, are presented.

Energy minimization in medical image analysis: Methodologies and applications.

PubMed

Zhao, Feng; Xie, Xianghua

2016-02-01

Energy minimization is of particular interest in medical image analysis. In the past two decades, a variety of optimization schemes have been developed. In this paper, we present a comprehensive survey of the state-of-the-art optimization approaches. These algorithms are mainly classified into two categories: continuous method and discrete method. The former includes Newton-Raphson method, gradient descent method, conjugate gradient method, proximal gradient method, coordinate descent method, and genetic algorithm-based method, while the latter covers graph cuts method, belief propagation method, tree-reweighted message passing method, linear programming method, maximum margin learning method, simulated annealing method, and iterated conditional modes method. We also discuss the minimal surface method, primal-dual method, and the multi-objective optimization method. In addition, we review several comparative studies that evaluate the performance of different minimization techniques in terms of accuracy, efficiency, or complexity. These optimization techniques are widely used in many medical applications, for example, image segmentation, registration, reconstruction, motion tracking, and compressed sensing. We thus give an overview on those applications as well. Copyright © 2015 John Wiley & Sons, Ltd.

Design of two-channel filter bank using nature inspired optimization based fractional derivative constraints.

PubMed

Kuldeep, B; Singh, V K; Kumar, A; Singh, G K

2015-01-01

In this article, a novel approach for 2-channel linear phase quadrature mirror filter (QMF) bank design based on a hybrid of gradient based optimization and optimization of fractional derivative constraints is introduced. For the purpose of this work, recently proposed nature inspired optimization techniques such as cuckoo search (CS), modified cuckoo search (MCS) and wind driven optimization (WDO) are explored for the design of QMF bank. 2-Channel QMF is also designed with particle swarm optimization (PSO) and artificial bee colony (ABC) nature inspired optimization techniques. The design problem is formulated in frequency domain as sum of L2 norm of error in passband, stopband and transition band at quadrature frequency. The contribution of this work is the novel hybrid combination of gradient based optimization (Lagrange multiplier method) and nature inspired optimization (CS, MCS, WDO, PSO and ABC) and its usage for optimizing the design problem. Performance of the proposed method is evaluated by passband error (ϕp), stopband error (ϕs), transition band error (ϕt), peak reconstruction error (PRE), stopband attenuation (As) and computational time. The design examples illustrate the ingenuity of the proposed method. Results are also compared with the other existing algorithms, and it was found that the proposed method gives best result in terms of peak reconstruction error and transition band error while it is comparable in terms of passband and stopband error. Results show that the proposed method is successful for both lower and higher order 2-channel QMF bank design. A comparative study of various nature inspired optimization techniques is also presented, and the study singles out CS as a best QMF optimization technique. Copyright © 2014 ISA. Published by Elsevier Ltd. All rights reserved.

Stripe nonuniformity correction for infrared imaging system based on single image optimization

NASA Astrophysics Data System (ADS)

Hua, Weiping; Zhao, Jufeng; Cui, Guangmang; Gong, Xiaoli; Ge, Peng; Zhang, Jiang; Xu, Zhihai

2018-06-01

Infrared imaging is often disturbed by stripe nonuniformity noise. Scene-based correction method can effectively reduce the impact of stripe noise. In this paper, a stripe nonuniformity correction method based on differential constraint is proposed. Firstly, the gray distribution of stripe nonuniformity is analyzed and the penalty function is constructed by the difference of horizontal gradient and vertical gradient. With the weight function, the penalty function is optimized to obtain the corrected image. Comparing with other single-frame approaches, experiments show that the proposed method performs better in both subjective and objective analysis, and does less damage to edge and detail. Meanwhile, the proposed method runs faster. We have also discussed the differences between the proposed idea and multi-frame methods. Our method is finally well applied in hardware system.

Higher Nucleoporin-Importinβ Affinity at the Nuclear Basket Increases Nucleocytoplasmic Import

PubMed Central

Azimi, Mohammad; Mofrad, Mohammad R. K.

2013-01-01

Several in vitro studies have shown the presence of an affinity gradient in nuclear pore complex proteins for the import receptor Importinβ, at least partially contributing to nucleocytoplasmic transport, while others have historically argued against the presence of such a gradient. Nonetheless, the existence of an affinity gradient has remained an uncharacterized contributing factor. To shed light on the affinity gradient theory and better characterize how the existence of such an affinity gradient between the nuclear pore and the import receptor may influence the nucleocytoplasmic traffic, we have developed a general-purpose agent based modeling (ABM) framework that features a new method for relating rate constants to molecular binding and unbinding probabilities, and used our ABM approach to quantify the effects of a wide range of forward and reverse nucleoporin-Importinβ affinity gradients. Our results indicate that transport through the nuclear pore complex is maximized with an effective macroscopic affinity gradient of 2000 µM, 200 µM and 10 µM in the cytoplasmic, central channel and nuclear basket respectively. The transport rate at this gradient is approximately 10% higher than the transport rate for a comparable pore lacking any affinity gradient, which has a peak transport rate when all nucleoporins have an affinity of 200 µM for Importinβ. Furthermore, this optimal ratio of affinity gradients is representative of the ratio of affinities reported for the yeast nuclear pore complex – suggesting that the affinity gradient seen in vitro is highly optimized. PMID:24282617

Noise-shaping gradient descent-based online adaptation algorithms for digital calibration of analog circuits.

PubMed

Chakrabartty, Shantanu; Shaga, Ravi K; Aono, Kenji

2013-04-01

Analog circuits that are calibrated using digital-to-analog converters (DACs) use a digital signal processor-based algorithm for real-time adaptation and programming of system parameters. In this paper, we first show that this conventional framework for adaptation yields suboptimal calibration properties because of artifacts introduced by quantization noise. We then propose a novel online stochastic optimization algorithm called noise-shaping or ΣΔ gradient descent, which can shape the quantization noise out of the frequency regions spanning the parameter adaptation trajectories. As a result, the proposed algorithms demonstrate superior parameter search properties compared to floating-point gradient methods and better convergence properties than conventional quantized gradient-methods. In the second part of this paper, we apply the ΣΔ gradient descent algorithm to two examples of real-time digital calibration: 1) balancing and tracking of bias currents, and 2) frequency calibration of a band-pass Gm-C biquad filter biased in weak inversion. For each of these examples, the circuits have been prototyped in a 0.5-μm complementary metal-oxide-semiconductor process, and we demonstrate that the proposed algorithm is able to find the optimal solution even in the presence of spurious local minima, which are introduced by the nonlinear and non-monotonic response of calibration DACs.

Stationary-phase optimized selectivity liquid chromatography: development of a linear gradient prediction algorithm.

PubMed

De Beer, Maarten; Lynen, Fréderic; Chen, Kai; Ferguson, Paul; Hanna-Brown, Melissa; Sandra, Pat

2010-03-01

Stationary-phase optimized selectivity liquid chromatography (SOS-LC) is a tool in reversed-phase LC (RP-LC) to optimize the selectivity for a given separation by combining stationary phases in a multisegment column. The presently (commercially) available SOS-LC optimization procedure and algorithm are only applicable to isocratic analyses. Step gradient SOS-LC has been developed, but this is still not very elegant for the analysis of complex mixtures composed of components covering a broad hydrophobicity range. A linear gradient prediction algorithm has been developed allowing one to apply SOS-LC as a generic RP-LC optimization method. The algorithm allows operation in isocratic, stepwise, and linear gradient run modes. The features of SOS-LC in the linear gradient mode are demonstrated by means of a mixture of 13 steroids, whereby baseline separation is predicted and experimentally demonstrated.

Particle Swarm Optimization of Low-Thrust, Geocentric-to-Halo-Orbit Transfers

NASA Astrophysics Data System (ADS)

Abraham, Andrew J.

Missions to Lagrange points are becoming increasingly popular amongst spacecraft mission planners. Lagrange points are locations in space where the gravity force from two bodies, and the centrifugal force acting on a third body, cancel. To date, all spacecraft that have visited a Lagrange point have done so using high-thrust, chemical propulsion. Due to the increasing availability of low-thrust (high efficiency) propulsive devices, and their increasing capability in terms of fuel efficiency and instantaneous thrust, it has now become possible for a spacecraft to reach a Lagrange point orbit without the aid of chemical propellant. While at any given time there are many paths for a low-thrust trajectory to take, only one is optimal. The traditional approach to spacecraft trajectory optimization utilizes some form of gradient-based algorithm. While these algorithms offer numerous advantages, they also have a few significant shortcomings. The three most significant shortcomings are: (1) the fact that an initial guess solution is required to initialize the algorithm, (2) the radius of convergence can be quite small and can allow the algorithm to become trapped in local minima, and (3) gradient information is not always assessable nor always trustworthy for a given problem. To avoid these problems, this dissertation is focused on optimizing a low-thrust transfer trajectory from a geocentric orbit to an Earth-Moon, L1, Lagrange point orbit using the method of Particle Swarm Optimization (PSO). The PSO method is an evolutionary heuristic that was originally written to model birds swarming to locate hidden food sources. This PSO method will enable the exploration of the invariant stable manifold of the target Lagrange point orbit in an effort to optimize the spacecraft's low-thrust trajectory. Examples of these optimized trajectories are presented and contrasted with those found using traditional, gradient-based approaches. In summary, the results of this dissertation find that the PSO method does, indeed, successfully optimize the low-thrust trajectory transfer problem without the need for initial guessing. Furthermore, a two-degree-of-freedom PSO problem formulation significantly outperformed a one-degree-of-freedom formulation by at least an order of magnitude, in terms of CPU time. Finally, the PSO method is also used to solve a traditional, two-burn, impulsive transfer to a Lagrange point orbit using a hybrid optimization algorithm that incorporates a gradient-based shooting algorithm as a pre-optimizer. Surprisingly, the results of this study show that "fast" transfers outperform "slow" transfers in terms of both Deltav and time of flight.

An inverse problem strategy based on forward model evaluations: Gradient-based optimization without adjoint solves

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aguilo Valentin, Miguel Alejandro

2016-07-01

This study presents a new nonlinear programming formulation for the solution of inverse problems. First, a general inverse problem formulation based on the compliance error functional is presented. The proposed error functional enables the computation of the Lagrange multipliers, and thus the first order derivative information, at the expense of just one model evaluation. Therefore, the calculation of the Lagrange multipliers does not require the solution of the computationally intensive adjoint problem. This leads to significant speedups for large-scale, gradient-based inverse problems.

Sail Plan Configuration Optimization for a Modern Clipper Ship

NASA Astrophysics Data System (ADS)

Gerritsen, Margot; Doyle, Tyler; Iaccarino, Gianluca; Moin, Parviz

2002-11-01

We investigate the use of gradient-based and evolutionary algorithms for sail shape optimization. We present preliminary results for the optimization of sheeting angles for the rig of the future three-masted clipper yacht Maltese Falcon. This yacht will be equipped with square-rigged masts made up of yards of circular arc cross sections. This design is especially attractive for megayachts because it provides a large sail area while maintaining aerodynamic and structural efficiency. The rig remains almost rigid in a large range of wind conditions and therefore a simple geometrical model can be constructed without accounting for the true flying shape. The sheeting angle optimization studies are performed using both gradient-based cost function minimization and evolutionary algorithms. The fluid flow is modeled by the Reynolds-averaged Navier-Stokes equations with the Spallart-Allmaras turbulence model. Unstructured non-conforming grids are used to increase robustness and computational efficiency. The optimization process is automated by integrating the system components (geometry construction, grid generation, flow solver, force calculator, optimization). We compare the optimization results to those done previously by user-controlled parametric studies using simple cost functions and user intuition. We also investigate the effectiveness of various cost functions in the optimization (driving force maximization, ratio of driving force to heeling force maximization).

Low Complexity Models to improve Incomplete Sensitivities for Shape Optimization

NASA Astrophysics Data System (ADS)

Stanciu, Mugurel; Mohammadi, Bijan; Moreau, Stéphane

2003-01-01

The present global platform for simulation and design of multi-model configurations treat shape optimization problems in aerodynamics. Flow solvers are coupled with optimization algorithms based on CAD-free and CAD-connected frameworks. Newton methods together with incomplete expressions of gradients are used. Such incomplete sensitivities are improved using reduced models based on physical assumptions. The validity and the application of this approach in real-life problems are presented. The numerical examples concern shape optimization for an airfoil, a business jet and a car engine cooling axial fan.

Two-Dimensional High-Lift Aerodynamic Optimization Using Neural Networks

NASA Technical Reports Server (NTRS)

Greenman, Roxana M.

1998-01-01

The high-lift performance of a multi-element airfoil was optimized by using neural-net predictions that were trained using a computational data set. The numerical data was generated using a two-dimensional, incompressible, Navier-Stokes algorithm with the Spalart-Allmaras turbulence model. Because it is difficult to predict maximum lift for high-lift systems, an empirically-based maximum lift criteria was used in this study to determine both the maximum lift and the angle at which it occurs. The 'pressure difference rule,' which states that the maximum lift condition corresponds to a certain pressure difference between the peak suction pressure and the pressure at the trailing edge of the element, was applied and verified with experimental observations for this configuration. Multiple input, single output networks were trained using the NASA Ames variation of the Levenberg-Marquardt algorithm for each of the aerodynamic coefficients (lift, drag and moment). The artificial neural networks were integrated with a gradient-based optimizer. Using independent numerical simulations and experimental data for this high-lift configuration, it was shown that this design process successfully optimized flap deflection, gap, overlap, and angle of attack to maximize lift. Once the neural nets were trained and integrated with the optimizer, minimal additional computer resources were required to perform optimization runs with different initial conditions and parameters. Applying the neural networks within the high-lift rigging optimization process reduced the amount of computational time and resources by 44% compared with traditional gradient-based optimization procedures for multiple optimization runs.

Whole brain inhomogeneous magnetization transfer (ihMT) imaging: Sensitivity enhancement within a steady-state gradient echo sequence.

PubMed

Mchinda, Samira; Varma, Gopal; Prevost, Valentin H; Le Troter, Arnaud; Rapacchi, Stanislas; Guye, Maxime; Pelletier, Jean; Ranjeva, Jean-Philippe; Alsop, David C; Duhamel, Guillaume; Girard, Olivier M

2018-05-01

To implement, characterize, and optimize an interleaved inhomogeneous magnetization transfer (ihMT) gradient echo sequence allowing for whole-brain imaging within a clinically compatible scan time. A general framework for ihMT modelling was developed based on the Provotorov theory of radiofrequency saturation, which accounts for the dipolar order underpinning the ihMT effect. Experimental studies and numerical simulations were performed to characterize and optimize the ihMT-gradient echo dependency with sequence timings, saturation power, and offset frequency. The protocol was optimized in terms of maximum signal intensity and the reproducibility assessed for a nominal resolution of 1.5 mm isotropic. All experiments were performed on healthy volunteers at 1.5T. An important mechanism driving signal optimization and leading to strong ihMT signal enhancement that relies on the dynamics of radiofrequency energy deposition has been identified. By taking advantage of the delay allowed for readout between ihMT pulse bursts, it was possible to boost the ihMT signal by almost 2-fold compared to previous implementation. Reproducibility of the optimal protocol was very good, with an intra-individual error < 2%. The proposed sensitivity-boosted and time-efficient steady-state ihMT-gradient echo sequence, implemented and optimized at 1.5T, allowed robust high-resolution 3D ihMT imaging of the whole brain within a clinically compatible scan time. Magn Reson Med 79:2607-2619, 2018. © 2017 International Society for Magnetic Resonance in Medicine. © 2017 International Society for Magnetic Resonance in Medicine.

Particle swarm optimization-based automatic parameter selection for deep neural networks and its applications in large-scale and high-dimensional data

PubMed Central

2017-01-01

In this paper, we propose a new automatic hyperparameter selection approach for determining the optimal network configuration (network structure and hyperparameters) for deep neural networks using particle swarm optimization (PSO) in combination with a steepest gradient descent algorithm. In the proposed approach, network configurations were coded as a set of real-number m-dimensional vectors as the individuals of the PSO algorithm in the search procedure. During the search procedure, the PSO algorithm is employed to search for optimal network configurations via the particles moving in a finite search space, and the steepest gradient descent algorithm is used to train the DNN classifier with a few training epochs (to find a local optimal solution) during the population evaluation of PSO. After the optimization scheme, the steepest gradient descent algorithm is performed with more epochs and the final solutions (pbest and gbest) of the PSO algorithm to train a final ensemble model and individual DNN classifiers, respectively. The local search ability of the steepest gradient descent algorithm and the global search capabilities of the PSO algorithm are exploited to determine an optimal solution that is close to the global optimum. We constructed several experiments on hand-written characters and biological activity prediction datasets to show that the DNN classifiers trained by the network configurations expressed by the final solutions of the PSO algorithm, employed to construct an ensemble model and individual classifier, outperform the random approach in terms of the generalization performance. Therefore, the proposed approach can be regarded an alternative tool for automatic network structure and parameter selection for deep neural networks. PMID:29236718

A modular approach to large-scale design optimization of aerospace systems

NASA Astrophysics Data System (ADS)

Hwang, John T.

Gradient-based optimization and the adjoint method form a synergistic combination that enables the efficient solution of large-scale optimization problems. Though the gradient-based approach struggles with non-smooth or multi-modal problems, the capability to efficiently optimize up to tens of thousands of design variables provides a valuable design tool for exploring complex tradeoffs and finding unintuitive designs. However, the widespread adoption of gradient-based optimization is limited by the implementation challenges for computing derivatives efficiently and accurately, particularly in multidisciplinary and shape design problems. This thesis addresses these difficulties in two ways. First, to deal with the heterogeneity and integration challenges of multidisciplinary problems, this thesis presents a computational modeling framework that solves multidisciplinary systems and computes their derivatives in a semi-automated fashion. This framework is built upon a new mathematical formulation developed in this thesis that expresses any computational model as a system of algebraic equations and unifies all methods for computing derivatives using a single equation. The framework is applied to two engineering problems: the optimization of a nanosatellite with 7 disciplines and over 25,000 design variables; and simultaneous allocation and mission optimization for commercial aircraft involving 330 design variables, 12 of which are integer variables handled using the branch-and-bound method. In both cases, the framework makes large-scale optimization possible by reducing the implementation effort and code complexity. The second half of this thesis presents a differentiable parametrization of aircraft geometries and structures for high-fidelity shape optimization. Existing geometry parametrizations are not differentiable, or they are limited in the types of shape changes they allow. This is addressed by a novel parametrization that smoothly interpolates aircraft components, providing differentiability. An unstructured quadrilateral mesh generation algorithm is also developed to automate the creation of detailed meshes for aircraft structures, and a mesh convergence study is performed to verify that the quality of the mesh is maintained as it is refined. As a demonstration, high-fidelity aerostructural analysis is performed for two unconventional configurations with detailed structures included, and aerodynamic shape optimization is applied to the truss-braced wing, which finds and eliminates a shock in the region bounded by the struts and the wing.

High-throughput growth temperature optimization of ferroelectric SrxBa1-xNb2O6 epitaxial thin films using a temperature gradient method

NASA Astrophysics Data System (ADS)

Ohkubo, I.; Christen, H. M.; Kalinin, Sergei V.; Jellison, G. E.; Rouleau, C. M.; Lowndes, D. H.

2004-02-01

We have developed a multisample film growth method on a temperature-gradient substrate holder to quickly optimize the film growth temperature in pulsed-laser deposition. A smooth temperature gradient is achieved, covering a range of temperatures from 200 to 830 °C. In a single growth run, the optimal growth temperature for SrxBa1-xNb2O6 thin films on MgO(001) substrates was determined to be 750 °C, based on results from ellipsometry and piezoresponse force microscopy. Variations in optical properties and ferroelectric domains structures were clearly observed as function of growth temperature, and these physical properties can be related to their different crystalline quality. Piezoresponse force microscopy indicated the formation of uniform ferroelectric film for deposition temperatures above 750 °C. At 660 °C, isolated micron-sized ferroelectric islands were observed, while samples deposited below 550 °C did not exhibit clear piezoelectric contrast.

Hybrid Quantum-Classical Approach to Quantum Optimal Control.

PubMed

Li, Jun; Yang, Xiaodong; Peng, Xinhua; Sun, Chang-Pu

2017-04-14

A central challenge in quantum computing is to identify more computational problems for which utilization of quantum resources can offer significant speedup. Here, we propose a hybrid quantum-classical scheme to tackle the quantum optimal control problem. We show that the most computationally demanding part of gradient-based algorithms, namely, computing the fitness function and its gradient for a control input, can be accomplished by the process of evolution and measurement on a quantum simulator. By posing queries to and receiving answers from the quantum simulator, classical computing devices update the control parameters until an optimal control solution is found. To demonstrate the quantum-classical scheme in experiment, we use a seven-qubit nuclear magnetic resonance system, on which we have succeeded in optimizing state preparation without involving classical computation of the large Hilbert space evolution.

Optimal control of switching time in switched stochastic systems with multi-switching times and different costs

NASA Astrophysics Data System (ADS)

Liu, Xiaomei; Li, Shengtao; Zhang, Kanjian

2017-08-01

In this paper, we solve an optimal control problem for a class of time-invariant switched stochastic systems with multi-switching times, where the objective is to minimise a cost functional with different costs defined on the states. In particular, we focus on problems in which a pre-specified sequence of active subsystems is given and the switching times are the only control variables. Based on the calculus of variation, we derive the gradient of the cost functional with respect to the switching times on an especially simple form, which can be directly used in gradient descent algorithms to locate the optimal switching instants. Finally, a numerical example is given, highlighting the validity of the proposed methodology.

Numerical experience with a class of algorithms for nonlinear optimization using inexact function and gradient information

NASA Technical Reports Server (NTRS)

Carter, Richard G.

1989-01-01

For optimization problems associated with engineering design, parameter estimation, image reconstruction, and other optimization/simulation applications, low accuracy function and gradient values are frequently much less expensive to obtain than high accuracy values. Here, researchers investigate the computational performance of trust region methods for nonlinear optimization when high accuracy evaluations are unavailable or prohibitively expensive, and confirm earlier theoretical predictions when the algorithm is convergent even with relative gradient errors of 0.5 or more. The proper choice of the amount of accuracy to use in function and gradient evaluations can result in orders-of-magnitude savings in computational cost.

Multi-sensor image fusion algorithm based on multi-objective particle swarm optimization algorithm

NASA Astrophysics Data System (ADS)

Xie, Xia-zhu; Xu, Ya-wei

2017-11-01

On the basis of DT-CWT (Dual-Tree Complex Wavelet Transform - DT-CWT) theory, an approach based on MOPSO (Multi-objective Particle Swarm Optimization Algorithm) was proposed to objectively choose the fused weights of low frequency sub-bands. High and low frequency sub-bands were produced by DT-CWT. Absolute value of coefficients was adopted as fusion rule to fuse high frequency sub-bands. Fusion weights in low frequency sub-bands were used as particles in MOPSO. Spatial Frequency and Average Gradient were adopted as two kinds of fitness functions in MOPSO. The experimental result shows that the proposed approach performances better than Average Fusion and fusion methods based on local variance and local energy respectively in brightness, clarity and quantitative evaluation which includes Entropy, Spatial Frequency, Average Gradient and QAB/F.

Efficient Gradient-Based Shape Optimization Methodology Using Inviscid/Viscous CFD

NASA Technical Reports Server (NTRS)

Baysal, Oktay

1997-01-01

The formerly developed preconditioned-biconjugate-gradient (PBCG) solvers for the analysis and the sensitivity equations had resulted in very large error reductions per iteration; quadratic convergence was achieved whenever the solution entered the domain of attraction to the root. Its memory requirement was also lower as compared to a direct inversion solver. However, this memory requirement was high enough to preclude the realistic, high grid-density design of a practical 3D geometry. This limitation served as the impetus to the first-year activity (March 9, 1995 to March 8, 1996). Therefore, the major activity for this period was the development of the low-memory methodology for the discrete-sensitivity-based shape optimization. This was accomplished by solving all the resulting sets of equations using an alternating-direction-implicit (ADI) approach. The results indicated that shape optimization problems which required large numbers of grid points could be resolved with a gradient-based approach. Therefore, to better utilize the computational resources, it was recommended that a number of coarse grid cases, using the PBCG method, should initially be conducted to better define the optimization problem and the design space, and obtain an improved initial shape. Subsequently, a fine grid shape optimization, which necessitates using the ADI method, should be conducted to accurately obtain the final optimized shape. The other activity during this period was the interaction with the members of the Aerodynamic and Aeroacoustic Methods Branch of Langley Research Center during one stage of their investigation to develop an adjoint-variable sensitivity method using the viscous flow equations. This method had algorithmic similarities to the variational sensitivity methods and the control-theory approach. However, unlike the prior studies, it was considered for the three-dimensional, viscous flow equations. The major accomplishment in the second period of this project (March 9, 1996 to March 8, 1997) was the extension of the shape optimization methodology for the Thin-Layer Navier-Stokes equations. Both the Euler-based and the TLNS-based analyses compared with the analyses obtained using the CFL3D code. The sensitivities, again from both levels of the flow equations, also compared very well with the finite-differenced sensitivities. A fairly large set of shape optimization cases were conducted to study a number of issues previously not well understood. The testbed for these cases was the shaping of an arrow wing in Mach 2.4 flow. All the final shapes, obtained either from a coarse-grid-based or a fine-grid-based optimization, using either a Euler-based or a TLNS-based analysis, were all re-analyzed using a fine-grid, TLNS solution for their function evaluations. This allowed for a more fair comparison of their relative merits. From the aerodynamic performance standpoint, the fine-grid TLNS-based optimization produced the best shape, and the fine-grid Euler-based optimization produced the lowest cruise efficiency.

3-D phononic crystals with ultra-wide band gaps

PubMed Central

Lu, Yan; Yang, Yang; Guest, James K.; Srivastava, Ankit

2017-01-01

In this paper gradient based topology optimization (TO) is used to discover 3-D phononic structures that exhibit ultra-wide normalized all-angle all-mode band gaps. The challenging computational task of repeated 3-D phononic band-structure evaluations is accomplished by a combination of a fast mixed variational eigenvalue solver and distributed Graphic Processing Unit (GPU) parallel computations. The TO algorithm utilizes the material distribution-based approach and a gradient-based optimizer. The design sensitivity for the mixed variational eigenvalue problem is derived using the adjoint method and is implemented through highly efficient vectorization techniques. We present optimized results for two-material simple cubic (SC), body centered cubic (BCC), and face centered cubic (FCC) crystal structures and show that in each of these cases different initial designs converge to single inclusion network topologies within their corresponding primitive cells. The optimized results show that large phononic stop bands for bulk wave propagation can be achieved at lower than close packed spherical configurations leading to lighter unit cells. For tungsten carbide - epoxy crystals we identify all angle all mode normalized stop bands exceeding 100%, which is larger than what is possible with only spherical inclusions. PMID:28233812

3-D phononic crystals with ultra-wide band gaps.

PubMed

Lu, Yan; Yang, Yang; Guest, James K; Srivastava, Ankit

2017-02-24

In this paper gradient based topology optimization (TO) is used to discover 3-D phononic structures that exhibit ultra-wide normalized all-angle all-mode band gaps. The challenging computational task of repeated 3-D phononic band-structure evaluations is accomplished by a combination of a fast mixed variational eigenvalue solver and distributed Graphic Processing Unit (GPU) parallel computations. The TO algorithm utilizes the material distribution-based approach and a gradient-based optimizer. The design sensitivity for the mixed variational eigenvalue problem is derived using the adjoint method and is implemented through highly efficient vectorization techniques. We present optimized results for two-material simple cubic (SC), body centered cubic (BCC), and face centered cubic (FCC) crystal structures and show that in each of these cases different initial designs converge to single inclusion network topologies within their corresponding primitive cells. The optimized results show that large phononic stop bands for bulk wave propagation can be achieved at lower than close packed spherical configurations leading to lighter unit cells. For tungsten carbide - epoxy crystals we identify all angle all mode normalized stop bands exceeding 100%, which is larger than what is possible with only spherical inclusions.

Spiral bacterial foraging optimization method: Algorithm, evaluation and convergence analysis

NASA Astrophysics Data System (ADS)

Kasaiezadeh, Alireza; Khajepour, Amir; Waslander, Steven L.

2014-04-01

A biologically-inspired algorithm called Spiral Bacterial Foraging Optimization (SBFO) is investigated in this article. SBFO, previously proposed by the same authors, is a multi-agent, gradient-based algorithm that minimizes both the main objective function (local cost) and the distance between each agent and a temporary central point (global cost). A random jump is included normal to the connecting line of each agent to the central point, which produces a vortex around the temporary central point. This random jump is also suitable to cope with premature convergence, which is a feature of swarm-based optimization methods. The most important advantages of this algorithm are as follows: First, this algorithm involves a stochastic type of search with a deterministic convergence. Second, as gradient-based methods are employed, faster convergence is demonstrated over GA, DE, BFO, etc. Third, the algorithm can be implemented in a parallel fashion in order to decentralize large-scale computation. Fourth, the algorithm has a limited number of tunable parameters, and finally SBFO has a strong certainty of convergence which is rare in existing global optimization algorithms. A detailed convergence analysis of SBFO for continuously differentiable objective functions has also been investigated in this article.

Trajectory optimization for an asymmetric launch vehicle. M.S. Thesis - MIT

NASA Technical Reports Server (NTRS)

Sullivan, Jeanne Marie

1990-01-01

A numerical optimization technique is used to fully automate the trajectory design process for an symmetric configuration of the proposed Advanced Launch System (ALS). The objective of the ALS trajectory design process is the maximization of the vehicle mass when it reaches the desired orbit. The trajectories used were based on a simple shape that could be described by a small set of parameters. The use of a simple trajectory model can significantly reduce the computation time required for trajectory optimization. A predictive simulation was developed to determine the on-orbit mass given an initial vehicle state, wind information, and a set of trajectory parameters. This simulation utilizes an idealized control system to speed computation by increasing the integration time step. The conjugate gradient method is used for the numerical optimization of on-orbit mass. The method requires only the evaluation of the on-orbit mass function using the predictive simulation, and the gradient of the on-orbit mass function with respect to the trajectory parameters. The gradient is approximated with finite differencing. Prelaunch trajectory designs were carried out using the optimization procedure. The predictive simulation is used in flight to redesign the trajectory to account for trajectory deviations produced by off-nominal conditions, e.g., stronger than expected head winds.

Design of LED projector based on gradient-index lens

NASA Astrophysics Data System (ADS)

Qian, Liyong; Zhu, Xiangbing; Cui, Haitian; Wang, Yuanhang

2018-01-01

In this study, a new type of projector light path is designed to eliminate the deficits of existing projection systems, such as complex structure and low collection efficiency. Using a three-color LED array as the lighting source, by means of the special optical properties of a gradient-index lens, the complex structure of the traditional projector is simplified. Traditional components, such as the color wheel, relay lens, and mirror, become unnecessary. In this way, traditional problems, such as low utilization of light energy and loss of light energy, are solved. With the help of Zemax software, the projection lens is optimized. The optimized projection lens, LED, gradient-index lens, and digital micromirror device are imported into Tracepro. The ray tracing results show that both the utilization of light energy and the uniformity are improved significantly.

Exploring the complexity of quantum control optimization trajectories.

PubMed

Nanduri, Arun; Shir, Ofer M; Donovan, Ashley; Ho, Tak-San; Rabitz, Herschel

2015-01-07

The control of quantum system dynamics is generally performed by seeking a suitable applied field. The physical objective as a functional of the field forms the quantum control landscape, whose topology, under certain conditions, has been shown to contain no critical point suboptimal traps, thereby enabling effective searches for fields that give the global maximum of the objective. This paper addresses the structure of the landscape as a complement to topological critical point features. Recent work showed that landscape structure is highly favorable for optimization of state-to-state transition probabilities, in that gradient-based control trajectories to the global maximum value are nearly straight paths. The landscape structure is codified in the metric R ≥ 1.0, defined as the ratio of the length of the control trajectory to the Euclidean distance between the initial and optimal controls. A value of R = 1 would indicate an exactly straight trajectory to the optimal observable value. This paper extends the state-to-state transition probability results to the quantum ensemble and unitary transformation control landscapes. Again, nearly straight trajectories predominate, and we demonstrate that R can take values approaching 1.0 with high precision. However, the interplay of optimization trajectories with critical saddle submanifolds is found to influence landscape structure. A fundamental relationship necessary for perfectly straight gradient-based control trajectories is derived, wherein the gradient on the quantum control landscape must be an eigenfunction of the Hessian. This relation is an indicator of landscape structure and may provide a means to identify physical conditions when control trajectories can achieve perfect linearity. The collective favorable landscape topology and structure provide a foundation to understand why optimal quantum control can be readily achieved.

Optimization of non-linear gradient in hydrophobic interaction chromatography for the analytical characterization of antibody-drug conjugates.

PubMed

Bobály, Balázs; Randazzo, Giuseppe Marco; Rudaz, Serge; Guillarme, Davy; Fekete, Szabolcs

2017-01-20

The goal of this work was to evaluate the potential of non-linear gradients in hydrophobic interaction chromatography (HIC), to improve the separation between the different homologous species (drug-to-antibody, DAR) of commercial antibody-drug conjugates (ADC). The selectivities between Brentuximab Vedotin species were measured using three different gradient profiles, namely linear, power function based and logarithmic ones. The logarithmic gradient provides the most equidistant retention distribution for the DAR species and offers the best overall separation of cysteine linked ADC in HIC. Another important advantage of the logarithmic gradient, is its peak focusing effect for the DAR0 species, which is particularly useful to improve the quantitation limit of DAR0. Finally, the logarithmic behavior of DAR species of ADC in HIC was modelled using two different approaches, based on i) the linear solvent strength theory (LSS) and two scouting linear gradients and ii) a new derived equation and two logarithmic scouting gradients. In both cases, the retention predictions were excellent and systematically below 3% compared to the experimental values. Copyright © 2016 Elsevier B.V. All rights reserved.

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

NASA Technical Reports Server (NTRS)

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.

Optimization of Pulse Sequences in MRI Scheme

NASA Astrophysics Data System (ADS)

Roy, Subhankar; Hu, Jianping; Ummal Momeen, M.

2018-04-01

Magnetic resonance imaging (MRI) has a wide range of applications towards imaging the human body. In this work we have solved the Bloch equations for different magnetic field gradients along the transverse direction. We have modified the magnetic field components based on the relaxation terms and solved the field gradient as well as the field components for both off –pulse and on -pulse configurations. In particular we focus on different pulse sequences and optimize them to realize the best possible output. We have analyzed the field components along transverse direction because the rotation of the object to form the image by emitting signal is along the xy plane.

Did recent world record marathon runners employ optimal pacing strategies?

PubMed

Angus, Simon D

2014-01-01

We apply statistical analysis of high frequency (1 km) split data for the most recent two world-record marathon runs: Run 1 (2:03:59, 28 September 2008) and Run 2 (2:03:38, 25 September 2011). Based on studies in the endurance cycling literature, we develop two principles to approximate 'optimal' pacing in the field marathon. By utilising GPS and weather data, we test, and then de-trend, for each athlete's field response to gradient and headwind on course, recovering standardised proxies for power-based pacing traces. The resultant traces were analysed to ascertain if either runner followed optimal pacing principles; and characterise any deviations from optimality. Whereas gradient was insignificant, headwind was a significant factor in running speed variability for both runners, with Runner 2 targeting the (optimal) parallel variation principle, whilst Runner 1 did not. After adjusting for these responses, neither runner followed the (optimal) 'even' power pacing principle, with Runner 2's macro-pacing strategy fitting a sinusoidal oscillator with exponentially expanding envelope whilst Runner 1 followed a U-shaped, quadratic form. The study suggests that: (a) better pacing strategy could provide elite marathon runners with an economical pathway to significant performance improvements at world-record level; and (b) the data and analysis herein is consistent with a complex-adaptive model of power regulation.

Systematic Optimization of Long Gradient Chromatography Mass Spectrometry for Deep Analysis of Brain Proteome

DOE Office of Scientific and Technical Information (OSTI.GOV)

Wang, Hong; Yang, Yanling; Li, Yuxin

2015-02-06

Development of high resolution liquid chromatography (LC) is essential for improving the sensitivity and throughput of mass spectrometry (MS)-based proteomics. Here we present systematic optimization of a long gradient LC-MS/MS platform to enhance protein identification from a complex mixture. The platform employed an in-house fabricated, reverse phase column (100 μm x 150 cm) coupled with Q Exactive MS. The column was capable of achieving a peak capacity of approximately 700 in a 720 min gradient of 10-45% acetonitrile. The optimal loading level was about 6 micrograms of peptides, although the column allowed loading as many as 20 micrograms. Gas phasemore » fractionation of peptide ions further increased the number of peptide identification by ~10%. Moreover, the combination of basic pH LC pre-fractionation with the long gradient LC-MS/MS platform enabled the identification of 96,127 peptides and 10,544 proteins at 1% protein false discovery rate in a postmortem brain sample of Alzheimer’s disease. As deep RNA sequencing of the same specimen suggested that ~16,000 genes were expressed, current analysis covered more than 60% of the expressed proteome. Further improvement strategies of the LC/LC-MS/MS platform were also discussed.« less

Adjoint-based optimization of PDEs in moving domains

NASA Astrophysics Data System (ADS)

Protas, Bartosz; Liao, Wenyuan

2008-02-01

In this investigation we address the problem of adjoint-based optimization of PDE systems in moving domains. As an example we consider the one-dimensional heat equation with prescribed boundary temperatures and heat fluxes. We discuss two methods of deriving an adjoint system necessary to obtain a gradient of a cost functional. In the first approach we derive the adjoint system after mapping the problem to a fixed domain, whereas in the second approach we derive the adjoint directly in the moving domain by employing methods of the noncylindrical calculus. We show that the operations of transforming the system from a variable to a fixed domain and deriving the adjoint do not commute and that, while the gradient information contained in both systems is the same, the second approach results in an adjoint problem with a simpler structure which is therefore easier to implement numerically. This approach is then used to solve a moving boundary optimization problem for our model system.

A comparison of two closely-related approaches to aerodynamic design optimization

NASA Technical Reports Server (NTRS)

Shubin, G. R.; Frank, P. D.

1991-01-01

Two related methods for aerodynamic design optimization are compared. The methods, called the implicit gradient approach and the variational (or optimal control) approach, both attempt to obtain gradients necessary for numerical optimization at a cost significantly less than that of the usual black-box approach that employs finite difference gradients. While the two methods are seemingly quite different, they are shown to differ (essentially) in that the order of discretizing the continuous problem, and of applying calculus, is interchanged. Under certain circumstances, the two methods turn out to be identical. We explore the relationship between these methods by applying them to a model problem for duct flow that has many features in common with transonic flow over an airfoil. We find that the gradients computed by the variational method can sometimes be sufficiently inaccurate to cause the optimization to fail.

A mathematical model for the generation and control of a pH gradient in an immobilized enzyme system involving acid generation.

PubMed

Chen, G; Fournier, R L; Varanasi, S

1998-02-20

An optimal pH control technique has been developed for multistep enzymatic synthesis reactions where the optimal pH differs by several units for each step. This technique separates an acidic environment from a basic environment by the hydrolysis of urea within a thin layer of immobilized urease. With this technique, a two-step enzymatic reaction can take place simultaneously, in proximity to each other, and at their respective optimal pH. Because a reaction system involving an acid generation represents a more challenging test of this pH control technique, a number of factors that affect the generation of such a pH gradient are considered in this study. The mathematical model proposed is based on several simplifying assumptions and represents a first attempt to provide an analysis of this complex problem. The results show that, by choosing appropriate parameters, the pH control technique still can generate the desired pH gradient even if there is an acid-generating reaction in the system. Copyright 1998 John Wiley & Sons, Inc.

An approach to multiobjective optimization of rotational therapy. II. Pareto optimal surfaces and linear combinations of modulated blocked arcs for a prostate geometry.

PubMed

Pardo-Montero, Juan; Fenwick, John D

2010-06-01

The purpose of this work is twofold: To further develop an approach to multiobjective optimization of rotational therapy treatments recently introduced by the authors [J. Pardo-Montero and J. D. Fenwick, "An approach to multiobjective optimization of rotational therapy," Med. Phys. 36, 3292-3303 (2009)], especially regarding its application to realistic geometries, and to study the quality (Pareto optimality) of plans obtained using such an approach by comparing them with Pareto optimal plans obtained through inverse planning. In the previous work of the authors, a methodology is proposed for constructing a large number of plans, with different compromises between the objectives involved, from a small number of geometrically based arcs, each arc prioritizing different objectives. Here, this method has been further developed and studied. Two different techniques for constructing these arcs are investigated, one based on image-reconstruction algorithms and the other based on more common gradient-descent algorithms. The difficulty of dealing with organs abutting the target, briefly reported in previous work of the authors, has been investigated using partial OAR unblocking. Optimality of the solutions has been investigated by comparison with a Pareto front obtained from inverse planning. A relative Euclidean distance has been used to measure the distance of these plans to the Pareto front, and dose volume histogram comparisons have been used to gauge the clinical impact of these distances. A prostate geometry has been used for the study. For geometries where a blocked OAR abuts the target, moderate OAR unblocking can substantially improve target dose distribution and minimize hot spots while not overly compromising dose sparing of the organ. Image-reconstruction type and gradient-descent blocked-arc computations generate similar results. The Pareto front for the prostate geometry, reconstructed using a large number of inverse plans, presents a hockey-stick shape comprising two regions: One where the dose to the target is close to prescription and trade-offs can be made between doses to the organs at risk and (small) changes in target dose, and one where very substantial rectal sparing is achieved at the cost of large target underdosage. Plans computed following the approach using a conformal arc and four blocked arcs generally lie close to the Pareto front, although distances of some plans from high gradient regions of the Pareto front can be greater. Only around 12% of plans lie a relative Euclidean distance of 0.15 or greater from the Pareto front. Using the alternative distance measure of Craft ["Calculating and controlling the error of discrete representations of Pareto surfaces in convex multi-criteria optimization," Phys. Medica (to be published)], around 2/5 of plans lie more than 0.05 from the front. Computation of blocked arcs is quite fast, the algorithms requiring 35%-80% of the running time per iteration needed for conventional inverse plan computation. The geometry-based arc approach to multicriteria optimization of rotational therapy allows solutions to be obtained that lie close to the Pareto front. Both the image-reconstruction type and gradient-descent algorithms produce similar modulated arcs, the latter one perhaps being preferred because it is more easily implementable in standard treatment planning systems. Moderate unblocking provides a good way of dealing with OARs which abut the PTV. Optimization of geometry-based arcs is faster than usual inverse optimization of treatment plans, making this approach more rapid than an inverse-based Pareto front reconstruction.

Smart Phase Tuning in Microwave Photonic Integrated Circuits Toward Automated Frequency Multiplication by Design

NASA Astrophysics Data System (ADS)

Nabavi, N.

2018-07-01

The author investigates the monitoring methods for fine adjustment of the previously proposed on-chip architecture for frequency multiplication and translation of harmonics by design. Digital signal processing (DSP) algorithms are utilized to create an optimized microwave photonic integrated circuit functionality toward automated frequency multiplication. The implemented DSP algorithms are formed on discrete Fourier transform and optimization-based algorithms (Greedy and gradient-based algorithms), which are analytically derived and numerically compared based on the accuracy and speed of convergence criteria.

Data-driven gradient algorithm for high-precision quantum control

NASA Astrophysics Data System (ADS)

Wu, Re-Bing; Chu, Bing; Owens, David H.; Rabitz, Herschel

2018-04-01

In the quest to achieve scalable quantum information processing technologies, gradient-based optimal control algorithms (e.g., grape) are broadly used for implementing high-precision quantum gates, but their performance is often hindered by deterministic or random errors in the system model and the control electronics. In this paper, we show that grape can be taught to be more effective by jointly learning from the design model and the experimental data obtained from process tomography. The resulting data-driven gradient optimization algorithm (d-grape) can in principle correct all deterministic gate errors, with a mild efficiency loss. The d-grape algorithm may become more powerful with broadband controls that involve a large number of control parameters, while other algorithms usually slow down due to the increased size of the search space. These advantages are demonstrated by simulating the implementation of a two-qubit controlled-not gate.

Classical Optimal Control for Energy Minimization Based On Diffeomorphic Modulation under Observable-Response-Preserving Homotopy.

PubMed

Soley, Micheline B; Markmann, Andreas; Batista, Victor S

2018-06-12

We introduce the so-called "Classical Optimal Control Optimization" (COCO) method for global energy minimization based on the implementation of the diffeomorphic modulation under observable-response-preserving homotopy (DMORPH) gradient algorithm. A probe particle with time-dependent mass m( t;β) and dipole μ( r, t;β) is evolved classically on the potential energy surface V( r) coupled to an electric field E( t;β), as described by the time-dependent density of states represented on a grid, or otherwise as a linear combination of Gaussians generated by the k-means clustering algorithm. Control parameters β defining m( t;β), μ( r, t;β), and E( t;β) are optimized by following the gradients of the energy with respect to β, adapting them to steer the particle toward the global minimum energy configuration. We find that the resulting COCO algorithm is capable of resolving near-degenerate states separated by large energy barriers and successfully locates the global minima of golf potentials on flat and rugged surfaces, previously explored for testing quantum annealing methodologies and the quantum optimal control optimization (QuOCO) method. Preliminary results show successful energy minimization of multidimensional Lennard-Jones clusters. Beyond the analysis of energy minimization in the specific model systems investigated, we anticipate COCO should be valuable for solving minimization problems in general, including optimization of parameters in applications to machine learning and molecular structure determination.

Efficient Geometry Minimization and Transition Structure Optimization Using Interpolated Potential Energy Surfaces and Iteratively Updated Hessians.

PubMed

Zheng, Jingjing; Frisch, Michael J

2017-12-12

An efficient geometry optimization algorithm based on interpolated potential energy surfaces with iteratively updated Hessians is presented in this work. At each step of geometry optimization (including both minimization and transition structure search), an interpolated potential energy surface is properly constructed by using the previously calculated information (energies, gradients, and Hessians/updated Hessians), and Hessians of the two latest geometries are updated in an iterative manner. The optimized minimum or transition structure on the interpolated surface is used for the starting geometry of the next geometry optimization step. The cost of searching the minimum or transition structure on the interpolated surface and iteratively updating Hessians is usually negligible compared with most electronic structure single gradient calculations. These interpolated potential energy surfaces are often better representations of the true potential energy surface in a broader range than a local quadratic approximation that is usually used in most geometry optimization algorithms. Tests on a series of large and floppy molecules and transition structures both in gas phase and in solutions show that the new algorithm can significantly improve the optimization efficiency by using the iteratively updated Hessians and optimizations on interpolated surfaces.

Simultaneous multislice refocusing via time optimal control.

PubMed

Rund, Armin; Aigner, Christoph Stefan; Kunisch, Karl; Stollberger, Rudolf

2018-02-09

Joint design of minimum duration RF pulses and slice-selective gradient shapes for MRI via time optimal control with strict physical constraints, and its application to simultaneous multislice imaging. The minimization of the pulse duration is cast as a time optimal control problem with inequality constraints describing the refocusing quality and physical constraints. It is solved with a bilevel method, where the pulse length is minimized in the upper level, and the constraints are satisfied in the lower level. To address the inherent nonconvexity of the optimization problem, the upper level is enhanced with new heuristics for finding a near global optimizer based on a second optimization problem. A large set of optimized examples shows an average temporal reduction of 87.1% for double diffusion and 74% for turbo spin echo pulses compared to power independent number of slices pulses. The optimized results are validated on a 3T scanner with phantom measurements. The presented design method computes minimum duration RF pulse and slice-selective gradient shapes subject to physical constraints. The shorter pulse duration can be used to decrease the effective echo time in existing echo-planar imaging or echo spacing in turbo spin echo sequences. © 2018 International Society for Magnetic Resonance in Medicine.

Engineering calculations for communications satellite systems planning

NASA Technical Reports Server (NTRS)

Reilly, C. H.; Levis, C. A.; Mount-Campbell, C.; Gonsalvez, D. J.; Wang, C. W.; Yamamura, Y.

1985-01-01

Computer-based techniques for optimizing communications-satellite orbit and frequency assignments are discussed. A gradient-search code was tested against a BSS scenario derived from the RARC-83 data. Improvement was obtained, but each iteration requires about 50 minutes of IBM-3081 CPU time. Gradient-search experiments on a small FSS test problem, consisting of a single service area served by 8 satellites, showed quickest convergence when the satellites were all initially placed near the center of the available orbital arc with moderate spacing. A transformation technique is proposed for investigating the surface topography of the objective function used in the gradient-search method. A new synthesis approach is based on transforming single-entry interference constraints into corresponding constraints on satellite spacings. These constraints are used with linear objective functions to formulate the co-channel orbital assignment task as a linear-programming (LP) problem or mixed integer programming (MIP) problem. Globally optimal solutions are always found with the MIP problems, but not necessarily with the LP problems. The MIP solutions can be used to evaluate the quality of the LP solutions. The initial results are very encouraging.

Analytical instrumentation infrastructure for combinatorial and high-throughput development of formulated discrete and gradient polymeric sensor materials arrays

NASA Astrophysics Data System (ADS)

Potyrailo, Radislav A.; Hassib, Lamyaa

2005-06-01

Multicomponent polymer-based formulations of optical sensor materials are difficult and time consuming to optimize using conventional approaches. To address these challenges, our long-term goal is to determine relationships between sensor formulation and sensor response parameters using new scientific methodologies. As the first step, we have designed and implemented an automated analytical instrumentation infrastructure for combinatorial and high-throughput development of polymeric sensor materials for optical sensors. Our approach is based on the fabrication and performance screening of discrete and gradient sensor arrays. Simultaneous formation of multiple sensor coatings into discrete 4×6, 6×8, and 8×12 element arrays (3-15μL volume per element) and their screening provides not only a well-recognized acceleration in the screening rate, but also considerably reduces or even eliminates sources of variability, which are randomly affecting sensors response during a conventional one-at-a-time sensor coating evaluation. The application of gradient sensor arrays provides additional capabilities for rapid finding of the optimal formulation parameters.

GPU-based stochastic-gradient optimization for non-rigid medical image registration in time-critical applications

NASA Astrophysics Data System (ADS)

Bhosale, Parag; Staring, Marius; Al-Ars, Zaid; Berendsen, Floris F.

2018-03-01

Currently, non-rigid image registration algorithms are too computationally intensive to use in time-critical applications. Existing implementations that focus on speed typically address this by either parallelization on GPU-hardware, or by introducing methodically novel techniques into CPU-oriented algorithms. Stochastic gradient descent (SGD) optimization and variations thereof have proven to drastically reduce the computational burden for CPU-based image registration, but have not been successfully applied in GPU hardware due to its stochastic nature. This paper proposes 1) NiftyRegSGD, a SGD optimization for the GPU-based image registration tool NiftyReg, 2) random chunk sampler, a new random sampling strategy that better utilizes the memory bandwidth of GPU hardware. Experiments have been performed on 3D lung CT data of 19 patients, which compared NiftyRegSGD (with and without random chunk sampler) with CPU-based elastix Fast Adaptive SGD (FASGD) and NiftyReg. The registration runtime was 21.5s, 4.4s and 2.8s for elastix-FASGD, NiftyRegSGD without, and NiftyRegSGD with random chunk sampling, respectively, while similar accuracy was obtained. Our method is publicly available at https://github.com/SuperElastix/NiftyRegSGD.

Dynamic optimization of open-loop input signals for ramp-up current profiles in tokamak plasmas

NASA Astrophysics Data System (ADS)

Ren, Zhigang; Xu, Chao; Lin, Qun; Loxton, Ryan; Teo, Kok Lay

2016-03-01

Establishing a good current spatial profile in tokamak fusion reactors is crucial to effective steady-state operation. The evolution of the current spatial profile is related to the evolution of the poloidal magnetic flux, which can be modeled in the normalized cylindrical coordinates using a parabolic partial differential equation (PDE) called the magnetic diffusion equation. In this paper, we consider the dynamic optimization problem of attaining the best possible current spatial profile during the ramp-up phase of the tokamak. We first use the Galerkin method to obtain a finite-dimensional ordinary differential equation (ODE) model based on the original magnetic diffusion PDE. Then, we combine the control parameterization method with a novel time-scaling transformation to obtain an approximate optimal parameter selection problem, which can be solved using gradient-based optimization techniques such as sequential quadratic programming (SQP). This control parameterization approach involves approximating the tokamak input signals by piecewise-linear functions whose slopes and break-points are decision variables to be optimized. We show that the gradient of the objective function with respect to the decision variables can be computed by solving an auxiliary dynamic system governing the state sensitivity matrix. Finally, we conclude the paper with simulation results for an example problem based on experimental data from the DIII-D tokamak in San Diego, California.

Method for optimizing channelized quadratic observers for binary classification of large-dimensional image datasets

PubMed Central

Kupinski, M. K.; Clarkson, E.

2015-01-01

We present a new method for computing optimized channels for channelized quadratic observers (CQO) that is feasible for high-dimensional image data. The method for calculating channels is applicable in general and optimal for Gaussian distributed image data. Gradient-based algorithms for determining the channels are presented for five different information-based figures of merit (FOMs). Analytic solutions for the optimum channels for each of the five FOMs are derived for the case of equal mean data for both classes. The optimum channels for three of the FOMs under the equal mean condition are shown to be the same. This result is critical since some of the FOMs are much easier to compute. Implementing the CQO requires a set of channels and the first- and second-order statistics of channelized image data from both classes. The dimensionality reduction from M measurements to L channels is a critical advantage of CQO since estimating image statistics from channelized data requires smaller sample sizes and inverting a smaller covariance matrix is easier. In a simulation study we compare the performance of ideal and Hotelling observers to CQO. The optimal CQO channels are calculated using both eigenanalysis and a new gradient-based algorithm for maximizing Jeffrey's divergence (J). Optimal channel selection without eigenanalysis makes the J-CQO on large-dimensional image data feasible. PMID:26366764

Topology-optimized broadband surface relief transmission grating

NASA Astrophysics Data System (ADS)

Andkjær, Jacob; Ryder, Christian P.; Nielsen, Peter C.; Rasmussen, Thomas; Buchwald, Kristian; Sigmund, Ole

2014-03-01

We propose a design methodology for systematic design of surface relief transmission gratings with optimized diffraction efficiency. The methodology is based on a gradient-based topology optimization formulation along with 2D frequency domain finite element simulations for TE and TM polarized plane waves. The goal of the optimization is to find a grating design that maximizes diffraction efficiency for the -1st transmission order when illuminated by unpolarized plane waves. Results indicate that a surface relief transmission grating can be designed with a diffraction efficiency of more than 40% in a broadband range going from the ultraviolet region, through the visible region and into the near-infrared region.

Determination of full piezoelectric complex parameters using gradient-based optimization algorithm

NASA Astrophysics Data System (ADS)

Kiyono, C. Y.; Pérez, N.; Silva, E. C. N.

2016-02-01

At present, numerical techniques allow the precise simulation of mechanical structures, but the results are limited by the knowledge of the material properties. In the case of piezoelectric ceramics, the full model determination in the linear range involves five elastic, three piezoelectric, and two dielectric complex parameters. A successful solution to obtaining piezoceramic properties consists of comparing the experimental measurement of the impedance curve and the results of a numerical model by using the finite element method (FEM). In the present work, a new systematic optimization method is proposed to adjust the full piezoelectric complex parameters in the FEM model. Once implemented, the method only requires the experimental data (impedance modulus and phase data acquired by an impedometer), material density, geometry, and initial values for the properties. This method combines a FEM routine implemented using an 8-noded axisymmetric element with a gradient-based optimization routine based on the method of moving asymptotes (MMA). The main objective of the optimization procedure is minimizing the quadratic difference between the experimental and numerical electrical conductance and resistance curves (to consider resonance and antiresonance frequencies). To assure the convergence of the optimization procedure, this work proposes restarting the optimization loop whenever the procedure ends in an undesired or an unfeasible solution. Two experimental examples using PZ27 and APC850 samples are presented to test the precision of the method and to check the dependency of the frequency range used, respectively.

Paracrine communication maximizes cellular response fidelity in wound signaling

PubMed Central

Handly, L Naomi; Pilko, Anna; Wollman, Roy

2015-01-01

Population averaging due to paracrine communication can arbitrarily reduce cellular response variability. Yet, variability is ubiquitously observed, suggesting limits to paracrine averaging. It remains unclear whether and how biological systems may be affected by such limits of paracrine signaling. To address this question, we quantify the signal and noise of Ca2+ and ERK spatial gradients in response to an in vitro wound within a novel microfluidics-based device. We find that while paracrine communication reduces gradient noise, it also reduces the gradient magnitude. Accordingly we predict the existence of a maximum gradient signal to noise ratio. Direct in vitro measurement of paracrine communication verifies these predictions and reveals that cells utilize optimal levels of paracrine signaling to maximize the accuracy of gradient-based positional information. Our results demonstrate the limits of population averaging and show the inherent tradeoff in utilizing paracrine communication to regulate cellular response fidelity. DOI: http://dx.doi.org/10.7554/eLife.09652.001 PMID:26448485

Aerodynamic Design of Complex Configurations Using Cartesian Methods and CAD Geometry

NASA Technical Reports Server (NTRS)

Nemec, Marian; Aftosmis, Michael J.; Pulliam, Thomas H.

2003-01-01

The objective for this paper is to present the development of an optimization capability for the Cartesian inviscid-flow analysis package of Aftosmis et al. We evaluate and characterize the following modules within the new optimization framework: (1) A component-based geometry parameterization approach using a CAD solid representation and the CAPRI interface. (2) The use of Cartesian methods in the development Optimization techniques using a genetic algorithm. The discussion and investigations focus on several real world problems of the optimization process. We examine the architectural issues associated with the deployment of a CAD-based design approach in a heterogeneous parallel computing environment that contains both CAD workstations and dedicated compute nodes. In addition, we study the influence of noise on the performance of optimization techniques, and the overall efficiency of the optimization process for aerodynamic design of complex three-dimensional configurations. of automated optimization tools. rithm and a gradient-based algorithm.

An image morphing technique based on optimal mass preserving mapping.

PubMed

Zhu, Lei; Yang, Yan; Haker, Steven; Tannenbaum, Allen

2007-06-01

Image morphing, or image interpolation in the time domain, deals with the metamorphosis of one image into another. In this paper, a new class of image morphing algorithms is proposed based on the theory of optimal mass transport. The L(2) mass moving energy functional is modified by adding an intensity penalizing term, in order to reduce the undesired double exposure effect. It is an intensity-based approach and, thus, is parameter free. The optimal warping function is computed using an iterative gradient descent approach. This proposed morphing method is also extended to doubly connected domains using a harmonic parameterization technique, along with finite-element methods.

An Image Morphing Technique Based on Optimal Mass Preserving Mapping

PubMed Central

Zhu, Lei; Yang, Yan; Haker, Steven; Tannenbaum, Allen

2013-01-01

Image morphing, or image interpolation in the time domain, deals with the metamorphosis of one image into another. In this paper, a new class of image morphing algorithms is proposed based on the theory of optimal mass transport. The L2 mass moving energy functional is modified by adding an intensity penalizing term, in order to reduce the undesired double exposure effect. It is an intensity-based approach and, thus, is parameter free. The optimal warping function is computed using an iterative gradient descent approach. This proposed morphing method is also extended to doubly connected domains using a harmonic parameterization technique, along with finite-element methods. PMID:17547128

Static and Dynamic Model Update of an Inflatable/Rigidizable Torus Structure

NASA Technical Reports Server (NTRS)

Horta, Lucas G.; Reaves, mercedes C.

2006-01-01

The present work addresses the development of an experimental and computational procedure for validating finite element models. A torus structure, part of an inflatable/rigidizable Hexapod, is used to demonstrate the approach. Because of fabrication, materials, and geometric uncertainties, a statistical approach combined with optimization is used to modify key model parameters. Static test results are used to update stiffness parameters and dynamic test results are used to update the mass distribution. Updated parameters are computed using gradient and non-gradient based optimization algorithms. Results show significant improvements in model predictions after parameters are updated. Lessons learned in the areas of test procedures, modeling approaches, and uncertainties quantification are presented.

Implementation and verification of global optimization benchmark problems

NASA Astrophysics Data System (ADS)

Posypkin, Mikhail; Usov, Alexander

2017-12-01

The paper considers the implementation and verification of a test suite containing 150 benchmarks for global deterministic box-constrained optimization. A C++ library for describing standard mathematical expressions was developed for this purpose. The library automate the process of generating the value of a function and its' gradient at a given point and the interval estimates of a function and its' gradient on a given box using a single description. Based on this functionality, we have developed a collection of tests for an automatic verification of the proposed benchmarks. The verification has shown that literary sources contain mistakes in the benchmarks description. The library and the test suite are available for download and can be used freely.

A hybrid linear/nonlinear training algorithm for feedforward neural networks.

PubMed

McLoone, S; Brown, M D; Irwin, G; Lightbody, A

1998-01-01

This paper presents a new hybrid optimization strategy for training feedforward neural networks. The algorithm combines gradient-based optimization of nonlinear weights with singular value decomposition (SVD) computation of linear weights in one integrated routine. It is described for the multilayer perceptron (MLP) and radial basis function (RBF) networks and then extended to the local model network (LMN), a new feedforward structure in which a global nonlinear model is constructed from a set of locally valid submodels. Simulation results are presented demonstrating the superiority of the new hybrid training scheme compared to second-order gradient methods. It is particularly effective for the LMN architecture where the linear to nonlinear parameter ratio is large.

Effect of RF Gradient upon the Performance of the Wisconsin SRF Electron Gun

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bosch, Robert; Legg, Robert A.

2013-12-01

The performance of the Wisconsin 200-MHz SRF electron gun is simulated for several values of the RF gradient. Bunches with charge of 200 pC are modeled for the case where emittance compensation is completed during post-acceleration to 85 MeV in a TESLA module. We first perform simulations in which the initial bunch radius is optimal for the design gradient of 41 MV/m. We then optimize the radius as a function of RF gradient to improve the performance for low gradients.

An optimization-based framework for anisotropic simplex mesh adaptation

NASA Astrophysics Data System (ADS)

Yano, Masayuki; Darmofal, David L.

2012-09-01

We present a general framework for anisotropic h-adaptation of simplex meshes. Given a discretization and any element-wise, localizable error estimate, our adaptive method iterates toward a mesh that minimizes error for a given degrees of freedom. Utilizing mesh-metric duality, we consider a continuous optimization problem of the Riemannian metric tensor field that provides an anisotropic description of element sizes. First, our method performs a series of local solves to survey the behavior of the local error function. This information is then synthesized using an affine-invariant tensor manipulation framework to reconstruct an approximate gradient of the error function with respect to the metric tensor field. Finally, we perform gradient descent in the metric space to drive the mesh toward optimality. The method is first demonstrated to produce optimal anisotropic meshes minimizing the L2 projection error for a pair of canonical problems containing a singularity and a singular perturbation. The effectiveness of the framework is then demonstrated in the context of output-based adaptation for the advection-diffusion equation using a high-order discontinuous Galerkin discretization and the dual-weighted residual (DWR) error estimate. The method presented provides a unified framework for optimizing both the element size and anisotropy distribution using an a posteriori error estimate and enables efficient adaptation of anisotropic simplex meshes for high-order discretizations.

Optimization of sound absorbing performance for gradient multi-layer-assembled sintered fibrous absorbers

NASA Astrophysics Data System (ADS)

Zhang, Bo; Zhang, Weiyong; Zhu, Jian

2012-04-01

The transfer matrix method, based on plane wave theory, of multi-layer equivalent fluid is employed to evaluate the sound absorbing properties of two-layer-assembled and three-layer-assembled sintered fibrous sheets (generally regarded as a kind of compound absorber or structures). Two objective functions which are more suitable for the optimization of sound absorption properties of multi-layer absorbers within the wider frequency ranges are developed and the optimized results of using two objective functions are also compared with each other. It is found that using the two objective functions, especially the second one, may be more helpful to exert the sound absorbing properties of absorbers at lower frequencies to the best of their abilities. Then the calculation and optimization of sound absorption properties of multi-layer-assembled structures are performed by developing a simulated annealing genetic arithmetic program and using above-mentioned objective functions. Finally, based on the optimization in this work the thoughts of the gradient design over the acoustic parameters- the porosity, the tortuosity, the viscous and thermal characteristic lengths and the thickness of each samples- of porous metals are put forth and thereby some useful design criteria upon the acoustic parameters of each layer of porous fibrous metals are given while applying the multi-layer-assembled compound absorbers in noise control engineering.

Nonlinear optimization with linear constraints using a projection method

NASA Technical Reports Server (NTRS)

Fox, T.

1982-01-01

Nonlinear optimization problems that are encountered in science and industry are examined. A method of projecting the gradient vector onto a set of linear contraints is developed, and a program that uses this method is presented. The algorithm that generates this projection matrix is based on the Gram-Schmidt method and overcomes some of the objections to the Rosen projection method.

Application of modified Rosenbrock's method for optimization of nutrient media used in microorganism culturing.

PubMed

Votruba, J; Pilát, P; Prokop, A

1975-12-01

The Rosenbrock's procedure has been modified for optimization of nutrient medium composition and has been found to be less tedious than the Box-Wilson method, especially for larger numbers of optimized parameters. Its merits are particularly obvious with multiparameter optimization where the gradient method, so far the only one employed in microbiology from a variety of optimization methods (e.g., refs, 9 and 10), becomes impractical because of the excessive number of experiments required. The method suggested is also more stable during optimization than the gradient methods which are very sensitive to the selection of steps in the direction of the gradient and may thus easily shoot out of the optimized region. It is also anticipated that other direct search methods, particularly simplex design, may be easily adapted for optimization of medium composition. It is obvious that direct search methods may find an application in process improvement in antibiotic and related industries.

Gradient Optimization for Analytic conTrols - GOAT

NASA Astrophysics Data System (ADS)

Assémat, Elie; Machnes, Shai; Tannor, David; Wilhelm-Mauch, Frank

Quantum optimal control becomes a necessary step in a number of studies in the quantum realm. Recent experimental advances showed that superconducting qubits can be controlled with an impressive accuracy. However, most of the standard optimal control algorithms are not designed to manage such high accuracy. To tackle this issue, a novel quantum optimal control algorithm have been introduced: the Gradient Optimization for Analytic conTrols (GOAT). It avoids the piecewise constant approximation of the control pulse used by standard algorithms. This allows an efficient implementation of very high accuracy optimization. It also includes a novel method to compute the gradient that provides many advantages, e.g. the absence of backpropagation or the natural route to optimize the robustness of the control pulses. This talk will present the GOAT algorithm and a few applications to transmons systems.

Edge remap for solids

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kamm, James R.; Love, Edward; Robinson, Allen C.

We review the edge element formulation for describing the kinematics of hyperelastic solids. This approach is used to frame the problem of remapping the inverse deformation gradient for Arbitrary Lagrangian-Eulerian (ALE) simulations of solid dynamics. For hyperelastic materials, the stress state is completely determined by the deformation gradient, so remapping this quantity effectively updates the stress state of the material. A method, inspired by the constrained transport remap in electromagnetics, is reviewed, according to which the zero-curl constraint on the inverse deformation gradient is implicitly satisfied. Open issues related to the accuracy of this approach are identified. An optimization-based approachmore » is implemented to enforce positivity of the determinant of the deformation gradient. The efficacy of this approach is illustrated with numerical examples.« less

Different elution modes and field programming in gravitational field-flow fractionation. III. Field programming by flow-rate gradient generated by a programmable pump.

PubMed

Plocková, J; Chmelík, J

2001-05-25

Gravitational field-flow fractionation (GFFF) utilizes the Earth's gravitational field as an external force that causes the settlement of particles towards the channel accumulation wall. Hydrodynamic lift forces oppose this action by elevating particles away from the channel accumulation wall. These two counteracting forces enable modulation of the resulting force field acting on particles in GFFF. In this work, force-field programming based on modulating the magnitude of hydrodynamic lift forces was implemented via changes of flow-rate, which was accomplished by a programmable pump. Several flow-rate gradients (step gradients, linear gradients, parabolic, and combined gradients) were tested and evaluated as tools for optimization of the separation of a silica gel particle mixture. The influence of increasing amount of sample injected on the peak resolution under flow-rate gradient conditions was also investigated. This is the first time that flow-rate gradients have been implemented for programming of the resulting force field acting on particles in GFFF.

A flatter gallium profile for high-efficiency Cu(In,Ga)(Se,S)2 solar cell and improved robustness against sulfur-gradient variation

NASA Astrophysics Data System (ADS)

Huang, Chien-Yao; Lee, Wen-Chin; Lin, Albert

2016-09-01

Co-optimization of the gallium and sulfur profiles in penternary Cu(In,Ga)(Se,S)2 thin film solar cell and its impacts on device performance and variability are investigated in this work. An absorber formation method to modulate the gallium profiling under low sulfur-incorporation is disclosed, which solves the problem of Ga-segregation in selenization. Flatter Ga-profiles, which lack of experimental investigations to date, are explored and an optimal Ga-profile achieving 17.1% conversion efficiency on a 30 cm × 30 cm sub-module without anti-reflection coating is presented. Flatter Ga-profile gives rise to the higher Voc × Jsc by improved bandgap matching to solar spectrum, which is hard to be achieved by the case of Ga-accumulation. However, voltage-induced carrier collection loss is found, as evident from the measured voltage-dependent photocurrent characteristics based on a small-signal circuit model. The simulation results reveal that the loss is attributed to the synergistic effect of the detrimental gallium and sulfur gradients, which can deteriorate the carrier collection especially in quasi-neutral region (QNR). Furthermore, the underlying physics is presented, and it provides a clear physical picture to the empirical trends of device performance, I-V characteristics, and voltage-dependent photocurrent, which cannot be explained by the standard solar circuit model. The parameter "FGa" and front sulfur-gradient are found to play critical roles on the trade-off between space charge region (SCR) recombination and QNR carrier collection. The co-optimized gallium and sulfur gradients are investigated, and the corresponding process modification for further efficiency-enhancement is proposed. In addition, the performance impact of sulfur-gradient variation is studied, and a gallium design for suppressing the sulfur-induced variability is proposed. Device performances of varied Ga-profiles with front sulfur-gradients are simulated based on a compact device model. Finally, an exploratory path toward 20% high-efficiency Ga-profile with robustness against sulfur-induced performance variability is presented.

Turbopump Performance Improved by Evolutionary Algorithms

NASA Technical Reports Server (NTRS)

Oyama, Akira; Liou, Meng-Sing

2002-01-01

The development of design optimization technology for turbomachinery has been initiated using the multiobjective evolutionary algorithm under NASA's Intelligent Synthesis Environment and Revolutionary Aeropropulsion Concepts programs. As an alternative to the traditional gradient-based methods, evolutionary algorithms (EA's) are emergent design-optimization algorithms modeled after the mechanisms found in natural evolution. EA's search from multiple points, instead of moving from a single point. In addition, they require no derivatives or gradients of the objective function, leading to robustness and simplicity in coupling any evaluation codes. Parallel efficiency also becomes very high by using a simple master-slave concept for function evaluations, since such evaluations often consume the most CPU time, such as computational fluid dynamics. Application of EA's to multiobjective design problems is also straightforward because EA's maintain a population of design candidates in parallel. Because of these advantages, EA's are a unique and attractive approach to real-world design optimization problems.

Design Optimization Toolkit: Users' Manual

DOE Office of Scientific and Technical Information (OSTI.GOV)

Aguilo Valentin, Miguel Alejandro

The Design Optimization Toolkit (DOTk) is a stand-alone C++ software package intended to solve complex design optimization problems. DOTk software package provides a range of solution methods that are suited for gradient/nongradient-based optimization, large scale constrained optimization, and topology optimization. DOTk was design to have a flexible user interface to allow easy access to DOTk solution methods from external engineering software packages. This inherent flexibility makes DOTk barely intrusive to other engineering software packages. As part of this inherent flexibility, DOTk software package provides an easy-to-use MATLAB interface that enables users to call DOTk solution methods directly from the MATLABmore » command window.« less

Improved Propulsion Modeling for Low-Thrust Trajectory Optimization

NASA Technical Reports Server (NTRS)

Knittel, Jeremy M.; Englander, Jacob A.; Ozimek, Martin T.; Atchison, Justin A.; Gould, Julian J.

2017-01-01

Low-thrust trajectory design is tightly coupled with spacecraft systems design. In particular, the propulsion and power characteristics of a low-thrust spacecraft are major drivers in the design of the optimal trajectory. Accurate modeling of the power and propulsion behavior is essential for meaningful low-thrust trajectory optimization. In this work, we discuss new techniques to improve the accuracy of propulsion modeling in low-thrust trajectory optimization while maintaining the smooth derivatives that are necessary for a gradient-based optimizer. The resulting model is significantly more realistic than the industry standard and performs well inside an optimizer. A variety of deep-space trajectory examples are presented.

Four-body trajectory optimization

NASA Technical Reports Server (NTRS)

Pu, C. L.; Edelbaum, T. N.

1974-01-01

A comprehensive optimization program has been developed for computing fuel-optimal trajectories between the earth and a point in the sun-earth-moon system. It presents methods for generating fuel optimal two-impulse trajectories which may originate at the earth or a point in space and fuel optimal three-impulse trajectories between two points in space. The extrapolation of the state vector and the computation of the state transition matrix are accomplished by the Stumpff-Weiss method. The cost and constraint gradients are computed analytically in terms of the terminal state and the state transition matrix. The 4-body Lambert problem is solved by using the Newton-Raphson method. An accelerated gradient projection method is used to optimize a 2-impulse trajectory with terminal constraint. The Davidon's Variance Method is used both in the accelerated gradient projection method and the outer loop of a 3-impulse trajectory optimization problem.

Longitudinal gradient coil optimization in the presence of transient eddy currents.

PubMed

Trakic, A; Liu, F; Lopez, H Sanchez; Wang, H; Crozier, S

2007-06-01

The switching of magnetic field gradient coils in magnetic resonance imaging (MRI) inevitably induces transient eddy currents in conducting system components, such as the cryostat vessel. These secondary currents degrade the spatial and temporal performance of the gradient coils, and compensation methods are commonly employed to correct for these distortions. This theoretical study shows that by incorporating the eddy currents into the coil optimization process, it is possible to modify a gradient coil design so that the fields created by the coil and the eddy currents combine together to generate a spatially homogeneous gradient that follows the input pulse. Shielded and unshielded longitudinal gradient coils are used to exemplify this novel approach. To assist in the evaluation of transient eddy currents induced within a realistic cryostat vessel, a low-frequency finite-difference time-domain (FDTD) method using the total-field scattered-field (TFSF) scheme was performed. The simulations demonstrate the effectiveness of the proposed method for optimizing longitudinal gradient fields while taking into account the spatial and temporal behavior of the eddy currents.

RES: Regularized Stochastic BFGS Algorithm

NASA Astrophysics Data System (ADS)

Mokhtari, Aryan; Ribeiro, Alejandro

2014-12-01

RES, a regularized stochastic version of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton method is proposed to solve convex optimization problems with stochastic objectives. The use of stochastic gradient descent algorithms is widespread, but the number of iterations required to approximate optimal arguments can be prohibitive in high dimensional problems. Application of second order methods, on the other hand, is impracticable because computation of objective function Hessian inverses incurs excessive computational cost. BFGS modifies gradient descent by introducing a Hessian approximation matrix computed from finite gradient differences. RES utilizes stochastic gradients in lieu of deterministic gradients for both, the determination of descent directions and the approximation of the objective function's curvature. Since stochastic gradients can be computed at manageable computational cost RES is realizable and retains the convergence rate advantages of its deterministic counterparts. Convergence results show that lower and upper bounds on the Hessian egeinvalues of the sample functions are sufficient to guarantee convergence to optimal arguments. Numerical experiments showcase reductions in convergence time relative to stochastic gradient descent algorithms and non-regularized stochastic versions of BFGS. An application of RES to the implementation of support vector machines is developed.

Solar collector parameter identification from unsteady data by a discrete-gradient optimization algorithm

NASA Technical Reports Server (NTRS)

Hotchkiss, G. B.; Burmeister, L. C.; Bishop, K. A.

1980-01-01

A discrete-gradient optimization algorithm is used to identify the parameters in a one-node and a two-node capacitance model of a flat-plate collector. Collector parameters are first obtained by a linear-least-squares fit to steady state data. These parameters, together with the collector heat capacitances, are then determined from unsteady data by use of the discrete-gradient optimization algorithm with less than 10 percent deviation from the steady state determination. All data were obtained in the indoor solar simulator at the NASA Lewis Research Center.

Optimization of single-base-pair mismatch discrimination in oligonucleotide microarrays

NASA Technical Reports Server (NTRS)

Urakawa, Hidetoshi; El Fantroussi, Said; Smidt, Hauke; Smoot, James C.; Tribou, Erik H.; Kelly, John J.; Noble, Peter A.; Stahl, David A.

2003-01-01

The discrimination between perfect-match and single-base-pair-mismatched nucleic acid duplexes was investigated by using oligonucleotide DNA microarrays and nonequilibrium dissociation rates (melting profiles). DNA and RNA versions of two synthetic targets corresponding to the 16S rRNA sequences of Staphylococcus epidermidis (38 nucleotides) and Nitrosomonas eutropha (39 nucleotides) were hybridized to perfect-match probes (18-mer and 19-mer) and to a set of probes having all possible single-base-pair mismatches. The melting profiles of all probe-target duplexes were determined in parallel by using an imposed temperature step gradient. We derived an optimum wash temperature for each probe and target by using a simple formula to calculate a discrimination index for each temperature of the step gradient. This optimum corresponded to the output of an independent analysis using a customized neural network program. These results together provide an experimental and analytical framework for optimizing mismatch discrimination among all probes on a DNA microarray.

Gradient design for liquid chromatography using multi-scale optimization.

PubMed

López-Ureña, S; Torres-Lapasió, J R; Donat, R; García-Alvarez-Coque, M C

2018-01-26

In reversed phase-liquid chromatography, the usual solution to the "general elution problem" is the application of gradient elution with programmed changes of organic solvent (or other properties). A correct quantification of chromatographic peaks in liquid chromatography requires well resolved signals in a proper analysis time. When the complexity of the sample is high, the gradient program should be accommodated to the local resolution needs of each analyte. This makes the optimization of such situations rather troublesome, since enhancing the resolution for a given analyte may imply a collateral worsening of the resolution of other analytes. The aim of this work is to design multi-linear gradients that maximize the resolution, while fulfilling some restrictions: all peaks should be eluted before a given maximal time, the gradient should be flat or increasing, and sudden changes close to eluting peaks are penalized. Consequently, an equilibrated baseline resolution for all compounds is sought. This goal is achieved by splitting the optimization problem in a multi-scale framework. In each scale κ, an optimization problem is solved with N κ  ≈ 2 κ variables that are used to build the gradients. The N κ variables define cubic splines written in terms of a B-spline basis. This allows expressing gradients as polygonals of M points approximating the splines. The cubic splines are built using subdivision schemes, a technique of fast generation of smooth curves, compatible with the multi-scale framework. Owing to the nature of the problem and the presence of multiple local maxima, the algorithm used in the optimization problem of each scale κ should be "global", such as the pattern-search algorithm. The multi-scale optimization approach is successfully applied to find the best multi-linear gradient for resolving a mixture of amino acid derivatives. Copyright © 2017 Elsevier B.V. All rights reserved.

Optimization of intra-voxel incoherent motion imaging at 3.0 Tesla for fast liver examination.

PubMed

Leporq, Benjamin; Saint-Jalmes, Hervé; Rabrait, Cecile; Pilleul, Frank; Guillaud, Olivier; Dumortier, Jérôme; Scoazec, Jean-Yves; Beuf, Olivier

2015-05-01

Optimization of multi b-values MR protocol for fast intra-voxel incoherent motion imaging of the liver at 3.0 Tesla. A comparison of four different acquisition protocols were carried out based on estimated IVIM (DSlow , DFast , and f) and ADC-parameters in 25 healthy volunteers. The effects of respiratory gating compared with free breathing acquisition then diffusion gradient scheme (simultaneous or sequential) and finally use of weighted averaging for different b-values were assessed. An optimization study based on Cramer-Rao lower bound theory was then performed to minimize the number of b-values required for a suitable quantification. The duration-optimized protocol was evaluated on 12 patients with chronic liver diseases No significant differences of IVIM parameters were observed between the assessed protocols. Only four b-values (0, 12, 82, and 1310 s.mm(-2) ) were found mandatory to perform a suitable quantification of IVIM parameters. DSlow and DFast significantly decreased between nonadvanced and advanced fibrosis (P < 0.05 and P < 0.01) whereas perfusion fraction and ADC variations were not found to be significant. Results showed that IVIM could be performed in free breathing, with a weighted-averaging procedure, a simultaneous diffusion gradient scheme and only four optimized b-values (0, 10, 80, and 800) reducing scan duration by a factor of nine compared with a nonoptimized protocol. Preliminary results have shown that parameters such as DSlow and DFast based on optimized IVIM protocol can be relevant biomarkers to distinguish between nonadvanced and advanced fibrosis. © 2014 Wiley Periodicals, Inc.

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

NASA Astrophysics Data System (ADS)

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.

Co-optimal distribution of leaf nitrogen and hydraulic conductance in plant canopies.

PubMed

Peltoniemi, Mikko S; Duursma, Remko A; Medlyn, Belinda E

2012-05-01

Leaf properties vary significantly within plant canopies, due to the strong gradient in light availability through the canopy, and the need for plants to use resources efficiently. At high light, photosynthesis is maximized when leaves have a high nitrogen content and water supply, whereas at low light leaves have a lower requirement for both nitrogen and water. Studies of the distribution of leaf nitrogen (N) within canopies have shown that, if water supply is ignored, the optimal distribution is that where N is proportional to light, but that the gradient of N in real canopies is shallower than the optimal distribution. We extend this work by considering the optimal co-allocation of nitrogen and water supply within plant canopies. We developed a simple 'toy' two-leaf canopy model and optimized the distribution of N and hydraulic conductance (K) between the two leaves. We asked whether hydraulic constraints to water supply can explain shallow N gradients in canopies. We found that the optimal N distribution within plant canopies is proportional to the light distribution only if hydraulic conductance, K, is also optimally distributed. The optimal distribution of K is that where K and N are both proportional to incident light, such that optimal K is highest to the upper canopy. If the plant is constrained in its ability to construct higher K to sun-exposed leaves, the optimal N distribution does not follow the gradient in light within canopies, but instead follows a shallower gradient. We therefore hypothesize that measured deviations from the predicted optimal distribution of N could be explained by constraints on the distribution of K within canopies. Further empirical research is required on the extent to which plants can construct optimal K distributions, and whether shallow within-canopy N distributions can be explained by sub-optimal K distributions.

OPC and PSM design using inverse lithography: a nonlinear optimization approach

NASA Astrophysics Data System (ADS)

Poonawala, Amyn; Milanfar, Peyman

2006-03-01

We propose a novel method for the fast synthesis of low complexity model-based optical proximity correction (OPC) and phase shift masks (PSM) to improve the resolution and pattern fidelity of optical microlithography. We use the pixel-based mask representation, a continuous function formulation, and gradient based iterative optimization techniques to solve the above inverse problem. The continuous function formulation allows analytic calculation of the gradient. Pixel-based parametrization provides tremendous liberty in terms of the features possible in the synthesized masks, but also suffers the inherent disadvantage that the masks are very complex and difficult to manufacture. We therefore introduce the regularization framework; a useful tool which provides the flexibility to promote certain desirable properties in the solution. We employ the above framework to ensure that the estimated masks have only two or three (allowable) transmission values and are also comparatively simple and easy to manufacture. The results demonstrate that we are able to bring the CD on target using OPC masks. Furthermore, we were also able to boost the contrast of the aerial image using attenuated, strong, and 100% transmission phase shift masks. Our algorithm automatically (and optimally) adds assist-bars, dog-ears, serifs, anti-serifs, and other custom structures best suited for printing the desired pattern.

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

NASA Astrophysics Data System (ADS)

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.

Optimization-based image reconstruction in x-ray computed tomography by sparsity exploitation of local continuity and nonlocal spatial self-similarity

NASA Astrophysics Data System (ADS)

Han-Ming, Zhang; Lin-Yuan, Wang; Lei, Li; Bin, Yan; Ai-Long, Cai; Guo-En, Hu

2016-07-01

The additional sparse prior of images has been the subject of much research in problems of sparse-view computed tomography (CT) reconstruction. A method employing the image gradient sparsity is often used to reduce the sampling rate and is shown to remove the unwanted artifacts while preserve sharp edges, but may cause blocky or patchy artifacts. To eliminate this drawback, we propose a novel sparsity exploitation-based model for CT image reconstruction. In the presented model, the sparse representation and sparsity exploitation of both gradient and nonlocal gradient are investigated. The new model is shown to offer the potential for better results by introducing a similarity prior information of the image structure. Then, an effective alternating direction minimization algorithm is developed to optimize the objective function with a robust convergence result. Qualitative and quantitative evaluations have been carried out both on the simulation and real data in terms of accuracy and resolution properties. The results indicate that the proposed method can be applied for achieving better image-quality potential with the theoretically expected detailed feature preservation. Project supported by the National Natural Science Foundation of China (Grant No. 61372172).

Mitigation of Engine Inlet Distortion Through Adjoint-Based Design

NASA Technical Reports Server (NTRS)

Ordaz, Irian; Rallabhandi, Sriram; Nielsen, Eric J.; Diskin, Boris

2017-01-01

The adjoint-based design capability in FUN3D is extended to allow efficient gradient- based optimization and design of concepts with highly integrated aero-propulsive systems. A circumferential distortion calculation, along with the derivatives needed to perform adjoint-based design, have been implemented in FUN3D. This newly implemented distortion calculation can be used not only for design but also to drive the existing mesh adaptation process and reduce the error associated with the fan distortion calculation. The design capability is demonstrated by the shape optimization of an in-house aircraft concept equipped with an aft fuselage propulsor. The optimization objective is the minimization of flow distortion at the aerodynamic interface plane of this aft fuselage propulsor.

Lattice-Boltzmann-based simulations of diffusiophoresis of colloids and cells

NASA Astrophysics Data System (ADS)

Kreft Pearce, Jennifer; Castigliego, Joshua

Increasing environmental degradation due to plastic pollutants requires innovative solutions that facilitate the extraction of pollutants without harming local biota. We present results from a lattice-Boltzmann-base Brownian Dynamics simulation on diffusiophoresis and the separation of particles within the system. A gradient in viscosity that simulates a concentration gradient in a dissolved polymer allows us to separate various types of particles based on their deformability. As seen in previous experiments, simulated particles that have a higher deformability react differently to the polymer matrix than those with a lower deformability. Therefore, the particles can be separated from each other. The system described above was simulated with various concentration gradients as well as various Soret coefficients in order to optimize the separation of the particles. This simulation, in particular, was intended to model an oceanic system where the particles of interest were motile and nonmotile plankton and microplastics. The separation of plankton from the microplastics was achieved.

Aspects of the "Design Space" in high pressure liquid chromatography method development.

PubMed

Molnár, I; Rieger, H-J; Monks, K E

2010-05-07

The present paper describes a multifactorial optimization of 4 critical HPLC method parameters, i.e. gradient time (t(G)), temperature (T), pH and ternary composition (B(1):B(2)) based on 36 experiments. The effect of these experimental variables on critical resolution and selectivity was carried out in such a way as to systematically vary all four factors simultaneously. The basic element is a gradient time-temperature (t(G)-T) plane, which is repeated at three different pH's of the eluent A and at three different ternary compositions of eluent B between methanol and acetonitrile. The so-defined volume enables the investigation of the critical resolution for a part of the Design Space of a given sample. Further improvement of the analysis time, with conservation of the previously optimized selectivity, was possible by reducing the gradient time and increasing the flow rate. Multidimensional robust regions were successfully defined and graphically depicted. Copyright (c) 2010 Elsevier B.V. All rights reserved.

Panel flutter optimization by gradient projection

NASA Technical Reports Server (NTRS)

Pierson, B. L.

1975-01-01

A gradient projection optimal control algorithm incorporating conjugate gradient directions of search is described and applied to several minimum weight panel design problems subject to a flutter speed constraint. New numerical solutions are obtained for both simply-supported and clamped homogeneous panels of infinite span for various levels of inplane loading and minimum thickness. The minimum thickness inequality constraint is enforced by a simple transformation of variables.

Wrinkle-free design of thin membrane structures using stress-based topology optimization

NASA Astrophysics Data System (ADS)

Luo, Yangjun; Xing, Jian; Niu, Yanzhuang; Li, Ming; Kang, Zhan

2017-05-01

Thin membrane structures would experience wrinkling due to local buckling deformation when compressive stresses are induced in some regions. Using the stress criterion for membranes in wrinkled and taut states, this paper proposed a new stress-based topology optimization methodology to seek the optimal wrinkle-free design of macro-scale thin membrane structures under stretching. Based on the continuum model and linearly elastic assumption in the taut state, the optimization problem is defined as to maximize the structural stiffness under membrane area and principal stress constraints. In order to make the problem computationally tractable, the stress constraints are reformulated into equivalent ones and relaxed by a cosine-type relaxation scheme. The reformulated optimization problem is solved by a standard gradient-based algorithm with the adjoint-variable sensitivity analysis. Several examples with post-bulking simulations and experimental tests are given to demonstrate the effectiveness of the proposed optimization model for eliminating stress-related wrinkles in the novel design of thin membrane structures.

Radiofrequency pulse design using nonlinear gradient magnetic fields.

PubMed

Kopanoglu, Emre; Constable, R Todd

2015-09-01

An iterative k-space trajectory and radiofrequency (RF) pulse design method is proposed for excitation using nonlinear gradient magnetic fields. The spatial encoding functions (SEFs) generated by nonlinear gradient fields are linearly dependent in Cartesian coordinates. Left uncorrected, this may lead to flip angle variations in excitation profiles. In the proposed method, SEFs (k-space samples) are selected using a matching pursuit algorithm, and the RF pulse is designed using a conjugate gradient algorithm. Three variants of the proposed approach are given: the full algorithm, a computationally cheaper version, and a third version for designing spoke-based trajectories. The method is demonstrated for various target excitation profiles using simulations and phantom experiments. The method is compared with other iterative (matching pursuit and conjugate gradient) and noniterative (coordinate-transformation and Jacobian-based) pulse design methods as well as uniform density spiral and EPI trajectories. The results show that the proposed method can increase excitation fidelity. An iterative method for designing k-space trajectories and RF pulses using nonlinear gradient fields is proposed. The method can either be used for selecting the SEFs individually to guide trajectory design, or can be adapted to design and optimize specific trajectories of interest. © 2014 Wiley Periodicals, Inc.

Role of spatial averaging in multicellular gradient sensing.

PubMed

Smith, Tyler; Fancher, Sean; Levchenko, Andre; Nemenman, Ilya; Mugler, Andrew

2016-05-20

Gradient sensing underlies important biological processes including morphogenesis, polarization, and cell migration. The precision of gradient sensing increases with the length of a detector (a cell or group of cells) in the gradient direction, since a longer detector spans a larger range of concentration values. Intuition from studies of concentration sensing suggests that precision should also increase with detector length in the direction transverse to the gradient, since then spatial averaging should reduce the noise. However, here we show that, unlike for concentration sensing, the precision of gradient sensing decreases with transverse length for the simplest gradient sensing model, local excitation-global inhibition. The reason is that gradient sensing ultimately relies on a subtraction of measured concentration values. While spatial averaging indeed reduces the noise in these measurements, which increases precision, it also reduces the covariance between the measurements, which results in the net decrease in precision. We demonstrate how a recently introduced gradient sensing mechanism, regional excitation-global inhibition (REGI), overcomes this effect and recovers the benefit of transverse averaging. Using a REGI-based model, we compute the optimal two- and three-dimensional detector shapes, and argue that they are consistent with the shapes of naturally occurring gradient-sensing cell populations.

Role of spatial averaging in multicellular gradient sensing

NASA Astrophysics Data System (ADS)

Smith, Tyler; Fancher, Sean; Levchenko, Andre; Nemenman, Ilya; Mugler, Andrew

2016-06-01

Gradient sensing underlies important biological processes including morphogenesis, polarization, and cell migration. The precision of gradient sensing increases with the length of a detector (a cell or group of cells) in the gradient direction, since a longer detector spans a larger range of concentration values. Intuition from studies of concentration sensing suggests that precision should also increase with detector length in the direction transverse to the gradient, since then spatial averaging should reduce the noise. However, here we show that, unlike for concentration sensing, the precision of gradient sensing decreases with transverse length for the simplest gradient sensing model, local excitation-global inhibition. The reason is that gradient sensing ultimately relies on a subtraction of measured concentration values. While spatial averaging indeed reduces the noise in these measurements, which increases precision, it also reduces the covariance between the measurements, which results in the net decrease in precision. We demonstrate how a recently introduced gradient sensing mechanism, regional excitation-global inhibition (REGI), overcomes this effect and recovers the benefit of transverse averaging. Using a REGI-based model, we compute the optimal two- and three-dimensional detector shapes, and argue that they are consistent with the shapes of naturally occurring gradient-sensing cell populations.

Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent.

PubMed

Guan, Naiyang; Tao, Dacheng; Luo, Zhigang; Yuan, Bo

2011-07-01

Nonnegative matrix factorization (NMF) has become a popular data-representation method and has been widely used in image processing and pattern-recognition problems. This is because the learned bases can be interpreted as a natural parts-based representation of data and this interpretation is consistent with the psychological intuition of combining parts to form a whole. For practical classification tasks, however, NMF ignores both the local geometry of data and the discriminative information of different classes. In addition, existing research results show that the learned basis is unnecessarily parts-based because there is neither explicit nor implicit constraint to ensure the representation parts-based. In this paper, we introduce the manifold regularization and the margin maximization to NMF and obtain the manifold regularized discriminative NMF (MD-NMF) to overcome the aforementioned problems. The multiplicative update rule (MUR) can be applied to optimizing MD-NMF, but it converges slowly. In this paper, we propose a fast gradient descent (FGD) to optimize MD-NMF. FGD contains a Newton method that searches the optimal step length, and thus, FGD converges much faster than MUR. In addition, FGD includes MUR as a special case and can be applied to optimizing NMF and its variants. For a problem with 165 samples in R(1600), FGD converges in 28 s, while MUR requires 282 s. We also apply FGD in a variant of MD-NMF and experimental results confirm its efficiency. Experimental results on several face image datasets suggest the effectiveness of MD-NMF.

Aerothermodynamic shape optimization of hypersonic blunt bodies

NASA Astrophysics Data System (ADS)

Eyi, Sinan; Yumuşak, Mine

2015-07-01

The aim of this study is to develop a reliable and efficient design tool that can be used in hypersonic flows. The flow analysis is based on the axisymmetric Euler/Navier-Stokes and finite-rate chemical reaction equations. The equations are coupled simultaneously and solved implicitly using Newton's method. The Jacobian matrix is evaluated analytically. A gradient-based numerical optimization is used. The adjoint method is utilized for sensitivity calculations. The objective of the design is to generate a hypersonic blunt geometry that produces the minimum drag with low aerodynamic heating. Bezier curves are used for geometry parameterization. The performances of the design optimization method are demonstrated for different hypersonic flow conditions.

Møller-Plesset perturbation theory gradient in the generalized hybrid orbital quantum mechanical and molecular mechanical method

NASA Astrophysics Data System (ADS)

Jung, Jaewoon; Sugita, Yuji; Ten-no, S.

2010-02-01

An analytic gradient expression is formulated and implemented for the second-order Møller-Plesset perturbation theory (MP2) based on the generalized hybrid orbital QM/MM method. The method enables us to obtain an accurate geometry at a reasonable computational cost. The performance of the method is assessed for various isomers of alanine dipepetide. We also compare the optimized structures of fumaramide-derived [2]rotaxane and cAMP-dependent protein kinase with experiment.

Hybrid intelligent optimization methods for engineering problems

NASA Astrophysics Data System (ADS)

Pehlivanoglu, Yasin Volkan

The purpose of optimization is to obtain the best solution under certain conditions. There are numerous optimization methods because different problems need different solution methodologies; therefore, it is difficult to construct patterns. Also mathematical modeling of a natural phenomenon is almost based on differentials. Differential equations are constructed with relative increments among the factors related to yield. Therefore, the gradients of these increments are essential to search the yield space. However, the landscape of yield is not a simple one and mostly multi-modal. Another issue is differentiability. Engineering design problems are usually nonlinear and they sometimes exhibit discontinuous derivatives for the objective and constraint functions. Due to these difficulties, non-gradient-based algorithms have become more popular in recent decades. Genetic algorithms (GA) and particle swarm optimization (PSO) algorithms are popular, non-gradient based algorithms. Both are population-based search algorithms and have multiple points for initiation. A significant difference from a gradient-based method is the nature of the search methodologies. For example, randomness is essential for the search in GA or PSO. Hence, they are also called stochastic optimization methods. These algorithms are simple, robust, and have high fidelity. However, they suffer from similar defects, such as, premature convergence, less accuracy, or large computational time. The premature convergence is sometimes inevitable due to the lack of diversity. As the generations of particles or individuals in the population evolve, they may lose their diversity and become similar to each other. To overcome this issue, we studied the diversity concept in GA and PSO algorithms. Diversity is essential for a healthy search, and mutations are the basic operators to provide the necessary variety within a population. After having a close scrutiny of the diversity concept based on qualification and quantification studies, we improved new mutation strategies and operators to provide beneficial diversity within the population. We called this new approach as multi-frequency vibrational GA or PSO. They were applied to different aeronautical engineering problems in order to study the efficiency of these new approaches. These implementations were: applications to selected benchmark test functions, inverse design of two-dimensional (2D) airfoil in subsonic flow, optimization of 2D airfoil in transonic flow, path planning problems of autonomous unmanned aerial vehicle (UAV) over a 3D terrain environment, 3D radar cross section minimization problem for a 3D air vehicle, and active flow control over a 2D airfoil. As demonstrated by these test cases, we observed that new algorithms outperform the current popular algorithms. The principal role of this multi-frequency approach was to determine which individuals or particles should be mutated, when they should be mutated, and which ones should be merged into the population. The new mutation operators, when combined with a mutation strategy and an artificial intelligent method, such as, neural networks or fuzzy logic process, they provided local and global diversities during the reproduction phases of the generations. Additionally, the new approach also introduced random and controlled diversity. Due to still being population-based techniques, these methods were as robust as the plain GA or PSO algorithms. Based on the results obtained, it was concluded that the variants of the present multi-frequency vibrational GA and PSO were efficient algorithms, since they successfully avoided all local optima within relatively short optimization cycles.

Local CC2 response method based on the Laplace transform: analytic energy gradients for ground and excited states.

PubMed

Ledermüller, Katrin; Schütz, Martin

2014-04-28

A multistate local CC2 response method for the calculation of analytic energy gradients with respect to nuclear displacements is presented for ground and electronically excited states. The gradient enables the search for equilibrium geometries of extended molecular systems. Laplace transform is used to partition the eigenvalue problem in order to obtain an effective singles eigenvalue problem and adaptive, state-specific local approximations. This leads to an approximation in the energy Lagrangian, which however is shown (by comparison with the corresponding gradient method without Laplace transform) to be of no concern for geometry optimizations. The accuracy of the local approximation is tested and the efficiency of the new code is demonstrated by application calculations devoted to a photocatalytic decarboxylation process of present interest.

Topology optimization of unsteady flow problems using the lattice Boltzmann method

NASA Astrophysics Data System (ADS)

Nørgaard, Sebastian; Sigmund, Ole; Lazarov, Boyan

2016-02-01

This article demonstrates and discusses topology optimization for unsteady incompressible fluid flows. The fluid flows are simulated using the lattice Boltzmann method, and a partial bounceback model is implemented to model the transition between fluid and solid phases in the optimization problems. The optimization problem is solved with a gradient based method, and the design sensitivities are computed by solving the discrete adjoint problem. For moderate Reynolds number flows, it is demonstrated that topology optimization can successfully account for unsteady effects such as vortex shedding and time-varying boundary conditions. Such effects are relevant in several engineering applications, i.e. fluid pumps and control valves.

An efficient and practical approach to obtain a better optimum solution for structural optimization

NASA Astrophysics Data System (ADS)

Chen, Ting-Yu; Huang, Jyun-Hao

2013-08-01

For many structural optimization problems, it is hard or even impossible to find the global optimum solution owing to unaffordable computational cost. An alternative and practical way of thinking is thus proposed in this research to obtain an optimum design which may not be global but is better than most local optimum solutions that can be found by gradient-based search methods. The way to reach this goal is to find a smaller search space for gradient-based search methods. It is found in this research that data mining can accomplish this goal easily. The activities of classification, association and clustering in data mining are employed to reduce the original design space. For unconstrained optimization problems, the data mining activities are used to find a smaller search region which contains the global or better local solutions. For constrained optimization problems, it is used to find the feasible region or the feasible region with better objective values. Numerical examples show that the optimum solutions found in the reduced design space by sequential quadratic programming (SQP) are indeed much better than those found by SQP in the original design space. The optimum solutions found in a reduced space by SQP sometimes are even better than the solution found using a hybrid global search method with approximate structural analyses.

SU-E-T-295: Simultaneous Beam Sampling and Aperture Shape Optimization for Station Parameter Optimized Radiation Therapy (SPORT)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zarepisheh, M; Li, R; Xing, L

Purpose: Station Parameter Optimized Radiation Therapy (SPORT) was recently proposed to fully utilize the technical capability of emerging digital LINACs, in which the station parameters of a delivery system, (such as aperture shape and weight, couch position/angle, gantry/collimator angle) are optimized altogether. SPORT promises to deliver unprecedented radiation dose distributions efficiently, yet there does not exist any optimization algorithm to implement it. The purpose of this work is to propose an optimization algorithm to simultaneously optimize the beam sampling and aperture shapes. Methods: We build a mathematical model whose variables are beam angles (including non-coplanar and/or even nonisocentric beams) andmore » aperture shapes. To solve the resulting large scale optimization problem, we devise an exact, convergent and fast optimization algorithm by integrating three advanced optimization techniques named column generation, gradient method, and pattern search. Column generation is used to find a good set of aperture shapes as an initial solution by adding apertures sequentially. Then we apply the gradient method to iteratively improve the current solution by reshaping the aperture shapes and updating the beam angles toward the gradient. Algorithm continues by pattern search method to explore the part of the search space that cannot be reached by the gradient method. Results: The proposed technique is applied to a series of patient cases and significantly improves the plan quality. In a head-and-neck case, for example, the left parotid gland mean-dose, brainstem max-dose, spinal cord max-dose, and mandible mean-dose are reduced by 10%, 7%, 24% and 12% respectively, compared to the conventional VMAT plan while maintaining the same PTV coverage. Conclusion: Combined use of column generation, gradient search and pattern search algorithms provide an effective way to optimize simultaneously the large collection of station parameters and significantly improves quality of resultant treatment plans as compared with conventional VMAT or IMRT treatments.« less

An historical survey of computational methods in optimal control.

NASA Technical Reports Server (NTRS)

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.

A gradient system solution to Potts mean field equations and its electronic implementation.

PubMed

Urahama, K; Ueno, S

1993-03-01

A gradient system solution method is presented for solving Potts mean field equations for combinatorial optimization problems subject to winner-take-all constraints. In the proposed solution method the optimum solution is searched by using gradient descent differential equations whose trajectory is confined within the feasible solution space of optimization problems. This gradient system is proven theoretically to always produce a legal local optimum solution of combinatorial optimization problems. An elementary analog electronic circuit implementing the presented method is designed on the basis of current-mode subthreshold MOS technologies. The core constituent of the circuit is the winner-take-all circuit developed by Lazzaro et al. Correct functioning of the presented circuit is exemplified with simulations of the circuits implementing the scheme for solving the shortest path problems.

Nested Conjugate Gradient Algorithm with Nested Preconditioning for Non-linear Image Restoration.

PubMed

Skariah, Deepak G; Arigovindan, Muthuvel

2017-06-19

We develop a novel optimization algorithm, which we call Nested Non-Linear Conjugate Gradient algorithm (NNCG), for image restoration based on quadratic data fitting and smooth non-quadratic regularization. The algorithm is constructed as a nesting of two conjugate gradient (CG) iterations. The outer iteration is constructed as a preconditioned non-linear CG algorithm; the preconditioning is performed by the inner CG iteration that is linear. The inner CG iteration, which performs preconditioning for outer CG iteration, itself is accelerated by an another FFT based non-iterative preconditioner. We prove that the method converges to a stationary point for both convex and non-convex regularization functionals. We demonstrate experimentally that proposed method outperforms the well-known majorization-minimization method used for convex regularization, and a non-convex inertial-proximal method for non-convex regularization functional.

Observations on computational methodologies for use in large-scale, gradient-based, multidisciplinary design incorporating advanced CFD codes

NASA Technical Reports Server (NTRS)

Newman, P. A.; Hou, G. J.-W.; Jones, H. E.; Taylor, A. C., III; Korivi, V. M.

1992-01-01

How a combination of various computational methodologies could reduce the enormous computational costs envisioned in using advanced CFD codes in gradient based optimized multidisciplinary design (MdD) procedures is briefly outlined. Implications of these MdD requirements upon advanced CFD codes are somewhat different than those imposed by a single discipline design. A means for satisfying these MdD requirements for gradient information is presented which appear to permit: (1) some leeway in the CFD solution algorithms which can be used; (2) an extension to 3-D problems; and (3) straightforward use of other computational methodologies. Many of these observations have previously been discussed as possibilities for doing parts of the problem more efficiently; the contribution here is observing how they fit together in a mutually beneficial way.

Conjugate gradient optimization programs for shuttle reentry

NASA Technical Reports Server (NTRS)

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.

Optimization of elution salt concentration in stepwise elution of protein chromatography using linear gradient elution data. Reducing residual protein A by cation-exchange chromatography in monoclonal antibody purification.

PubMed

Ishihara, Takashi; Kadoya, Toshihiko; Endo, Naomi; Yamamoto, Shuichi

2006-05-05

Our simple method for optimization of the elution salt concentration in stepwise elution was applied to the actual protein separation system, which involves several difficulties such as detection of the target. As a model separation system, reducing residual protein A by cation-exchange chromatography in human monoclonal antibody (hMab) purification was chosen. We carried out linear gradient elution experiments and obtained the data for the peak salt concentration of hMab and residual protein A, respectively. An enzyme-linked immunosorbent assay was applied to the measurement of the residual protein A. From these data, we calculated the distribution coefficient of the hMab and the residual protein A as a function of salt concentration. The optimal salt concentration of stepwise elution to reduce the residual protein A from the hMab was determined based on the relationship between the distribution coefficient and the salt concentration. Using the optimized condition, we successfully performed the separation, resulting in high recovery of hMab and the elimination of residual protein A.

Contact-force distribution optimization and control for quadruped robots using both gradient and adaptive neural networks.

PubMed

Li, Zhijun; Ge, Shuzhi Sam; Liu, Sibang

2014-08-01

This paper investigates optimal feet forces' distribution and control of quadruped robots under external disturbance forces. First, we formulate a constrained dynamics of quadruped robots and derive a reduced-order dynamical model of motion/force. Consider an external wrench on quadruped robots; the distribution of required forces and moments on the supporting legs of a quadruped robot is handled as a tip-point force distribution and used to equilibrate the external wrench. Then, a gradient neural network is adopted to deal with the optimized objective function formulated as to minimize this quadratic objective function subjected to linear equality and inequality constraints. For the obtained optimized tip-point force and the motion of legs, we propose the hybrid motion/force control based on an adaptive neural network to compensate for the perturbations in the environment and approximate feedforward force and impedance of the leg joints. The proposed control can confront the uncertainties including approximation error and external perturbation. The verification of the proposed control is conducted using a simulation.

Generation of structural topologies using efficient technique based on sorted compliances

NASA Astrophysics Data System (ADS)

Mazur, Monika; Tajs-Zielińska, Katarzyna; Bochenek, Bogdan

2018-01-01

Topology optimization, although well recognized is still widely developed. It has gained recently more attention since large computational ability become available for designers. This process is stimulated simultaneously by variety of emerging, innovative optimization methods. It is observed that traditional gradient-based mathematical programming algorithms, in many cases, are replaced by novel and e cient heuristic methods inspired by biological, chemical or physical phenomena. These methods become useful tools for structural optimization because of their versatility and easy numerical implementation. In this paper engineering implementation of a novel heuristic algorithm for minimum compliance topology optimization is discussed. The performance of the topology generator is based on implementation of a special function utilizing information of compliance distribution within the design space. With a view to cope with engineering problems the algorithm has been combined with structural analysis system Ansys.

Isolation and purification of rabbit mesenchymal stem cells using an optimized protocol.

PubMed

Lin, Chunbo; Shen, Maorong; Chen, Weiping; Li, Xiaofeng; Luo, Daoming; Cai, Jinhong; Yang, Yuan

2015-11-01

Mesenchymal stem cells were first isolated and grown in vitro by Friedenstein over 40 yr ago; however, their isolation remains challenging as they lack unique markers for identification and are present in very small quantities in mesenchymal tissues and bone marrow. Using whole marrow samples, common methods for mesenchymal stem cell isolation are the adhesion method and density gradient fractionation. The whole marrow sample adhesion method still results in the nonspecific isolation of mononuclear cells, and activation and/or potential loss of target cells. Density gradient fractionation methods are complicated, and may result in contamination with toxic substances that affect cell viability. In the present study, we developed an optimized protocol for the isolation and purification of mesenchymal stem cells based on the principles of hypotonic lysis and natural sedimentation.

Modeling and Optimization for Management of Intermittent Water Supply

NASA Astrophysics Data System (ADS)

Lieb, A. M.; Wilkening, J.; Rycroft, C.

2014-12-01

In many urban areas, piped water is supplied only intermittently, as valves direct water to different parts of the water distribution system at different times. The flow is transient, and may transition between free-surface and pressurized, resulting in complex dynamical features with important consequences for water suppliers and users. These consequences include degradation of distribution system components, compromised water quality, and inequitable water availability. The goal of this work is to model the important dynamics and identify operating conditions that mitigate certain negative effects of intermittent water supply. Specifically, we will look at controlling valve parameters occurring as boundary conditions in a network model of transient, transition flow through closed pipes. Gradient-based optimization will be used to find boundary values to minimize pressure gradients and ensure equitable water availability at system endpoints.

Human motion planning based on recursive dynamics and optimal control techniques

NASA Technical Reports Server (NTRS)

Lo, Janzen; Huang, Gang; Metaxas, Dimitris

2002-01-01

This paper presents an efficient optimal control and recursive dynamics-based computer animation system for simulating and controlling the motion of articulated figures. A quasi-Newton nonlinear programming technique (super-linear convergence) is implemented to solve minimum torque-based human motion-planning problems. The explicit analytical gradients needed in the dynamics are derived using a matrix exponential formulation and Lie algebra. Cubic spline functions are used to make the search space for an optimal solution finite. Based on our formulations, our method is well conditioned and robust, in addition to being computationally efficient. To better illustrate the efficiency of our method, we present results of natural looking and physically correct human motions for a variety of human motion tasks involving open and closed loop kinematic chains.

Optimization Based Efficiencies in First Order Reliability Analysis

NASA Technical Reports Server (NTRS)

Peck, Jeffrey A.; Mahadevan, Sankaran

2003-01-01

This paper develops a method for updating the gradient vector of the limit state function in reliability analysis using Broyden's rank one updating technique. In problems that use commercial code as a black box, the gradient calculations are usually done using a finite difference approach, which becomes very expensive for large system models. The proposed method replaces the finite difference gradient calculations in a standard first order reliability method (FORM) with Broyden's Quasi-Newton technique. The resulting algorithm of Broyden updates within a FORM framework (BFORM) is used to run several example problems, and the results compared to standard FORM results. It is found that BFORM typically requires fewer functional evaluations that FORM to converge to the same answer.

Exploration Opportunity Search of Near-earth Objects Based on Analytical Gradients

NASA Astrophysics Data System (ADS)

Ren, Yuan; Cui, Ping-Yuan; Luan, En-Jie

2008-07-01

The problem of search of opportunity for the exploration of near-earth minor objects is investigated. For rendezvous missions, the analytical gradients of the performance index with respect to the free parameters are derived using the variational calculus and the theory of state-transition matrix. After generating randomly some initial guesses in the search space, the performance index is optimized, guided by the analytical gradients, leading to the local minimum points representing the potential launch opportunities. This method not only keeps the global-search property of the traditional method, but also avoids the blindness in the latter, thereby increasing greatly the computing speed. Furthermore, with this method, the searching precision could be controlled effectively.

Search of exploration opportunity for near earth objects based on analytical gradients

NASA Astrophysics Data System (ADS)

Ren, Y.; Cui, P. Y.; Luan, E. J.

2008-01-01

The problem of searching for exploration opportunity of near Earth objects is investigated. For rendezvous missions, the analytical gradients of performance index with respect to free parameters are derived by combining the calculus of variation with the theory of state-transition matrix. Then, some initial guesses are generated random in the search space, and the performance index is optimized with the guidance of analytical gradients from these initial guesses. This method not only keeps the property of global search in traditional method, but also avoids the blindness in the traditional exploration opportunity search; hence, the computing speed could be increased greatly. Furthermore, by using this method, the search precision could be controlled effectively.

Dynamic motion planning of 3D human locomotion using gradient-based optimization.

PubMed

Kim, Hyung Joo; Wang, Qian; Rahmatalla, Salam; Swan, Colby C; Arora, Jasbir S; Abdel-Malek, Karim; Assouline, Jose G

2008-06-01

Since humans can walk with an infinite variety of postures and limb movements, there is no unique solution to the modeling problem to predict human gait motions. Accordingly, we test herein the hypothesis that the redundancy of human walking mechanisms makes solving for human joint profiles and force time histories an indeterminate problem best solved by inverse dynamics and optimization methods. A new optimization-based human-modeling framework is thus described for predicting three-dimensional human gait motions on level and inclined planes. The basic unknowns in the framework are the joint motion time histories of a 25-degree-of-freedom human model and its six global degrees of freedom. The joint motion histories are calculated by minimizing an objective function such as deviation of the trunk from upright posture that relates to the human model's performance. A variety of important constraints are imposed on the optimization problem, including (1) satisfaction of dynamic equilibrium equations by requiring the model's zero moment point (ZMP) to lie within the instantaneous geometrical base of support, (2) foot collision avoidance, (3) limits on ground-foot friction, and (4) vanishing yawing moment. Analytical forms of objective and constraint functions are presented and discussed for the proposed human-modeling framework in which the resulting optimization problems are solved using gradient-based mathematical programming techniques. When the framework is applied to the modeling of bipedal locomotion on level and inclined planes, acyclic human walking motions that are smooth and realistic as opposed to less natural robotic motions are obtained. The aspects of the modeling framework requiring further investigation and refinement, as well as potential applications of the framework in biomechanics, are discussed.

Adaptive hybrid optimal quantum control for imprecisely characterized systems.

PubMed

Egger, D J; Wilhelm, F K

2014-06-20

Optimal quantum control theory carries a huge promise for quantum technology. Its experimental application, however, is often hindered by imprecise knowledge of the input variables, the quantum system's parameters. We show how to overcome this by adaptive hybrid optimal control, using a protocol named Ad-HOC. This protocol combines open- and closed-loop optimal control by first performing a gradient search towards a near-optimal control pulse and then an experimental fidelity estimation with a gradient-free method. For typical settings in solid-state quantum information processing, adaptive hybrid optimal control enhances gate fidelities by an order of magnitude, making optimal control theory applicable and useful.

Gradient-based optimization with B-splines on sparse grids for solving forward-dynamics simulations of three-dimensional, continuum-mechanical musculoskeletal system models.

PubMed

Valentin, J; Sprenger, M; Pflüger, D; Röhrle, O

2018-05-01

Investigating the interplay between muscular activity and motion is the basis to improve our understanding of healthy or diseased musculoskeletal systems. To be able to analyze the musculoskeletal systems, computational models are used. Albeit some severe modeling assumptions, almost all existing musculoskeletal system simulations appeal to multibody simulation frameworks. Although continuum-mechanical musculoskeletal system models can compensate for some of these limitations, they are essentially not considered because of their computational complexity and cost. The proposed framework is the first activation-driven musculoskeletal system model, in which the exerted skeletal muscle forces are computed using 3-dimensional, continuum-mechanical skeletal muscle models and in which muscle activations are determined based on a constraint optimization problem. Numerical feasibility is achieved by computing sparse grid surrogates with hierarchical B-splines, and adaptive sparse grid refinement further reduces the computational effort. The choice of B-splines allows the use of all existing gradient-based optimization techniques without further numerical approximation. This paper demonstrates that the resulting surrogates have low relative errors (less than 0.76%) and can be used within forward simulations that are subject to constraint optimization. To demonstrate this, we set up several different test scenarios in which an upper limb model consisting of the elbow joint, the biceps and triceps brachii, and an external load is subjected to different optimization criteria. Even though this novel method has only been demonstrated for a 2-muscle system, it can easily be extended to musculoskeletal systems with 3 or more muscles. Copyright © 2018 John Wiley & Sons, Ltd.

Transient Growth Analysis of Compressible Boundary Layers with Parabolized Stability Equations

NASA Technical Reports Server (NTRS)

Paredes, Pedro; Choudhari, Meelan M.; Li, Fei; Chang, Chau-Lyan

2016-01-01

The linear form of parabolized linear stability equations (PSE) is used in a variational approach to extend the previous body of results for the optimal, non-modal disturbance growth in boundary layer flows. This methodology includes the non-parallel effects associated with the spatial development of boundary layer flows. As noted in literature, the optimal initial disturbances correspond to steady counter-rotating stream-wise vortices, which subsequently lead to the formation of stream-wise-elongated structures, i.e., streaks, via a lift-up effect. The parameter space for optimal growth is extended to the hypersonic Mach number regime without any high enthalpy effects, and the effect of wall cooling is studied with particular emphasis on the role of the initial disturbance location and the value of the span-wise wavenumber that leads to the maximum energy growth up to a specified location. Unlike previous predictions that used a basic state obtained from a self-similar solution to the boundary layer equations, mean flow solutions based on the full Navier-Stokes (NS) equations are used in select cases to help account for the viscous-inviscid interaction near the leading edge of the plate and also for the weak shock wave emanating from that region. These differences in the base flow lead to an increasing reduction with Mach number in the magnitude of optimal growth relative to the predictions based on self-similar mean-flow approximation. Finally, the maximum optimal energy gain for the favorable pressure gradient boundary layer near a planar stagnation point is found to be substantially weaker than that in a zero pressure gradient Blasius boundary layer.

Generalized gradient algorithm for trajectory optimization

NASA Technical Reports Server (NTRS)

Zhao, Yiyuan; Bryson, A. E.; Slattery, R.

1990-01-01

The generalized gradient algorithm presented and verified as a basis for the solution of trajectory optimization problems improves the performance index while reducing path equality constraints, and terminal equality constraints. The algorithm is conveniently divided into two phases, of which the first, 'feasibility' phase yields a solution satisfying both path and terminal constraints, while the second, 'optimization' phase uses the results of the first phase as initial guesses.

A Single-Lap Joint Adhesive Bonding Optimization Method Using Gradient and Genetic Algorithms

NASA Technical Reports Server (NTRS)

Smeltzer, Stanley S., III; Finckenor, Jeffrey L.

1999-01-01

A natural process for any engineer, scientist, educator, etc. is to seek the most efficient method for accomplishing a given task. In the case of structural design, an area that has a significant impact on the structural efficiency is joint design. Unless the structure is machined from a solid block of material, the individual components which compose the overall structure must be joined together. The method for joining a structure varies depending on the applied loads, material, assembly and disassembly requirements, service life, environment, etc. Using both metallic and fiber reinforced plastic materials limits the user to two methods or a combination of these methods for joining the components into one structure. The first is mechanical fastening and the second is adhesive bonding. Mechanical fastening is by far the most popular joining technique; however, in terms of structural efficiency, adhesive bonding provides a superior joint since the load is distributed uniformly across the joint. The purpose of this paper is to develop a method for optimizing single-lap joint adhesive bonded structures using both gradient and genetic algorithms and comparing the solution process for each method. The goal of the single-lap joint optimization is to find the most efficient structure that meets the imposed requirements while still remaining as lightweight, economical, and reliable as possible. For the single-lap joint, an optimum joint is determined by minimizing the weight of the overall joint based on constraints from adhesive strengths as well as empirically derived rules. The analytical solution of the sin-le-lap joint is determined using the classical Goland-Reissner technique for case 2 type adhesive joints. Joint weight minimization is achieved using a commercially available routine, Design Optimization Tool (DOT), for the gradient solution while an author developed method is used for the genetic algorithm solution. Results illustrate the critical design variables as a function of adhesive properties and convergences of different joints based on the two optimization methods.

A fast finite-difference algorithm for topology optimization of permanent magnets

NASA Astrophysics Data System (ADS)

Abert, Claas; Huber, Christian; Bruckner, Florian; Vogler, Christoph; Wautischer, Gregor; Suess, Dieter

2017-09-01

We present a finite-difference method for the topology optimization of permanent magnets that is based on the fast-Fourier-transform (FFT) accelerated computation of the stray-field. The presented method employs the density approach for topology optimization and uses an adjoint method for the gradient computation. Comparison to various state-of-the-art finite-element implementations shows a superior performance and accuracy. Moreover, the presented method is very flexible and easy to implement due to various preexisting FFT stray-field implementations that can be used.

Numerical optimization in Hilbert space using inexact function and gradient evaluations

NASA Technical Reports Server (NTRS)

Carter, Richard G.

1989-01-01

Trust region algorithms provide a robust iterative technique for solving non-convex unstrained optimization problems, but in many instances it is prohibitively expensive to compute high accuracy function and gradient values for the method. Of particular interest are inverse and parameter estimation problems, since function and gradient evaluations involve numerically solving large systems of differential equations. A global convergence theory is presented for trust region algorithms in which neither function nor gradient values are known exactly. The theory is formulated in a Hilbert space setting so that it can be applied to variational problems as well as the finite dimensional problems normally seen in trust region literature. The conditions concerning allowable error are remarkably relaxed: relative errors in the gradient error condition is automatically satisfied if the error is orthogonal to the gradient approximation. A technique for estimating gradient error and improving the approximation is also presented.

A multi-material topology optimization approach for wrinkle-free design of cable-suspended membrane structures

NASA Astrophysics Data System (ADS)

Luo, Yangjun; Niu, Yanzhuang; Li, Ming; Kang, Zhan

2017-06-01

In order to eliminate stress-related wrinkles in cable-suspended membrane structures and to provide simple and reliable deployment, this study presents a multi-material topology optimization model and an effective solution procedure for generating optimal connected layouts for membranes and cables. On the basis of the principal stress criterion of membrane wrinkling behavior and the density-based interpolation of multi-phase materials, the optimization objective is to maximize the total structural stiffness while satisfying principal stress constraints and specified material volume requirements. By adopting the cosine-type relaxation scheme to avoid the stress singularity phenomenon, the optimization model is successfully solved through a standard gradient-based algorithm. Four-corner tensioned membrane structures with different loading cases were investigated to demonstrate the effectiveness of the proposed method in automatically finding the optimal design composed of curved boundary cables and wrinkle-free membranes.

A uniplanar three-axis gradient set for in vivo magnetic resonance microscopy.

PubMed

Demyanenko, Andrey V; Zhao, Lin; Kee, Yun; Nie, Shuyi; Fraser, Scott E; Tyszka, J Michael

2009-09-01

We present an optimized uniplanar magnetic resonance gradient design specifically tailored for MR imaging applications in developmental biology and histology. Uniplanar gradient designs sacrifice gradient uniformity for high gradient efficiency and slew rate, and are attractive for surface imaging applications where open access from one side of the sample is required. However, decreasing the size of the uniplanar gradient set presents several unique engineering challenges, particularly for heat dissipation and thermal insulation of the sample from gradient heating. We demonstrate a new three-axis, target-field optimized uniplanar gradient coil design that combines efficient cooling and insulation to significantly reduce sample heating at sample-gradient distances of less than 5mm. The instrument is designed for microscopy in horizontal bore magnets. Empirical gradient current efficiencies in the prototype coils lie between 3.75G/cm/A and 4.5G/cm/A with current and heating-limited maximum gradient strengths between 235G/cm and 450G/cm at a 2% duty cycle. The uniplanar gradient prototype is demonstrated with non-linearity corrections for both high-resolution structural imaging of tissue slices and for long time-course imaging of live, developing amphibian embryos in a horizontal bore 7T magnet.

Wing-section optimization for supersonic viscous flow

NASA Technical Reports Server (NTRS)

Item, Cem C.; Baysal, Oktay (Editor)

1995-01-01

To improve the shape of a supersonic wing, an automated method that also includes higher fidelity to the flow physics is desirable. With this impetus, an aerodynamic optimization methodology incorporating thin-layer Navier-Stokes equations and sensitivity analysis had been previously developed. Prior to embarking upon the wind design task, the present investigation concentrated on testing the feasibility of the methodology, and the identification of adequate problem formulations, by defining two-dimensional, cost-effective test cases. Starting with two distinctly different initial airfoils, two independent shape optimizations resulted in shapes with similar features: slightly cambered, parabolic profiles with sharp leading- and trailing-edges. Secondly, the normal section to the subsonic portion of the leading edge, which had a high normal angle-of-attack, was considered. The optimization resulted in a shape with twist and camber which eliminated the adverse pressure gradient, hence, exploiting the leading-edge thrust. The wing section shapes obtained in all the test cases had the features predicted by previous studies. Therefore, it was concluded that the flowfield analyses and sensitivity coefficients were computed and fed to the present gradient-based optimizer correctly. Also, as a result of the present two-dimensional study, suggestions were made for the problem formulations which should contribute to an effective wing shape optimization.

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

NASA Technical Reports Server (NTRS)

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-input/two-output drone flight control system.

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

NASA Technical Reports Server (NTRS)

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.

Cost Optimal Design of a Power Inductor by Sequential Gradient Search

NASA Astrophysics Data System (ADS)

Basak, Raju; Das, Arabinda; Sanyal, Amarnath

2018-05-01

Power inductors are used for compensating VAR generated by long EHV transmission lines and in electronic circuits. For the EHV-lines, the rating of the inductor is decided upon by techno-economic considerations on the basis of the line-susceptance. It is a high voltage high current device, absorbing little active power and large reactive power. The cost is quite high- hence the design should be made cost-optimally. The 3-phase power inductor is similar in construction to a 3-phase core-type transformer with the exception that it has only one winding per phase and each limb is provided with an air-gap, the length of which is decided upon by the inductance required. In this paper, a design methodology based on sequential gradient search technique and the corresponding algorithm leading to cost-optimal design of a 3-phase EHV power inductor has been presented. The case-study has been made on a 220 kV long line of NHPC running from Chukha HPS to Birpara of Coochbihar.

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

NASA Astrophysics Data System (ADS)

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.

RF Pulse Design using Nonlinear Gradient Magnetic Fields

PubMed Central

Kopanoglu, Emre; Constable, R. Todd

2014-01-01

Purpose An iterative k-space trajectory and radio-frequency (RF) pulse design method is proposed for Excitation using Nonlinear Gradient Magnetic fields (ENiGMa). Theory and Methods The spatial encoding functions (SEFs) generated by nonlinear gradient fields (NLGFs) are linearly dependent in Cartesian-coordinates. Left uncorrected, this may lead to flip-angle variations in excitation profiles. In the proposed method, SEFs (k-space samples) are selected using a Matching-Pursuit algorithm, and the RF pulse is designed using a Conjugate-Gradient algorithm. Three variants of the proposed approach are given: the full-algorithm, a computationally-cheaper version, and a third version for designing spoke-based trajectories. The method is demonstrated for various target excitation profiles using simulations and phantom experiments. Results The method is compared to other iterative (Matching-Pursuit and Conjugate Gradient) and non-iterative (coordinate-transformation and Jacobian-based) pulse design methods as well as uniform density spiral and EPI trajectories. The results show that the proposed method can increase excitation fidelity significantly. Conclusion An iterative method for designing k-space trajectories and RF pulses using nonlinear gradient fields is proposed. The method can either be used for selecting the SEFs individually to guide trajectory design, or can be adapted to design and optimize specific trajectories of interest. PMID:25203286

Performance optimization in electric field gradient focusing.

PubMed

Sun, Xuefei; Farnsworth, Paul B; Tolley, H Dennis; Warnick, Karl F; Woolley, Adam T; Lee, Milton L

2009-01-02

Electric field gradient focusing (EFGF) is a technique used to simultaneously separate and concentrate biomacromolecules, such as proteins, based on the opposing forces of an electric field gradient and a hydrodynamic flow. Recently, we reported EFGF devices fabricated completely from copolymers functionalized with poly(ethylene glycol), which display excellent resistance to protein adsorption. However, the previous devices did not provide the predicted linear electric field gradient and stable current. To improve performance, Tris-HCl buffer that was previously doped in the hydrogel was replaced with a phosphate buffer containing a salt (i.e., potassium chloride, KCl) with high mobility ions. The new devices exhibited stable current, good reproducibility, and a linear electric field distribution in agreement with the shaped gradient region design due to improved ion transport in the hydrogel. The field gradient was calculated based on theory to be approximately 5.76 V/cm(2) for R-phycoerythrin when the applied voltage was 500 V. The effect of EFGF separation channel dimensions was also investigated; a narrower focused band was achieved in a smaller diameter channel. The relationship between the bandwidth and channel diameter is consistent with theory. Three model proteins were resolved in an EFGF channel of this design. The improved device demonstrated 14,000-fold concentration of a protein sample (from 2 ng/mL to 27 microg/mL).

A microfluidic multi-injector for gradient generation.

PubMed

Chung, Bong Geun; Lin, Francis; Jeon, Noo Li

2006-06-01

This paper describes a microfluidic multi-injector (MMI) that can generate temporal and spatial concentration gradients of soluble molecules. Compared to conventional glass micropipette-based methods that generate a single gradient, the MMI exploits microfluidic integration and actuation of multiple pulsatile injectors to generate arbitrary overlapping gradients that have not previously been possible. The MMI device is fabricated in poly(dimethylsiloxane) (PDMS) using multi-layer soft lithography and consists of fluidic channels and control channels with pneumatically actuated on-chip barrier valves. Repetitive actuation of on-chip valves control pulsatile release of solution that establishes microscopic chemical gradients around the orifice. The volume of solution released per actuation cycle ranged from 30 picolitres to several hundred picolitres and increased linearly with the duration of valve opening. The shape of the measured gradient profile agreed closely with the simulated diffusion profile from a point source. Steady state gradient profiles could be attained within 10 minutes, or less with an optimized pulse sequence. Overlapping gradients from 2 injectors were generated and characterized to highlight the advantages of MMI over conventional micropipette assays. The MMI platform should be useful for a wide range of basic and applied studies on chemotaxis and axon guidance.

Review of design optimization methods for turbomachinery aerodynamics

NASA Astrophysics Data System (ADS)

Li, Zhihui; Zheng, Xinqian

2017-08-01

In today's competitive environment, new turbomachinery designs need to be not only more efficient, quieter, and ;greener; but also need to be developed at on much shorter time scales and at lower costs. A number of advanced optimization strategies have been developed to achieve these requirements. This paper reviews recent progress in turbomachinery design optimization to solve real-world aerodynamic problems, especially for compressors and turbines. This review covers the following topics that are important for optimizing turbomachinery designs. (1) optimization methods, (2) stochastic optimization combined with blade parameterization methods and the design of experiment methods, (3) gradient-based optimization methods for compressors and turbines and (4) data mining techniques for Pareto Fronts. We also present our own insights regarding the current research trends and the future optimization of turbomachinery designs.

Efficient boundary hunting via vector quantization

NASA Astrophysics Data System (ADS)

Diamantini, Claudia; Panti, Maurizio

2001-03-01

A great amount of information about a classification problem is contained in those instances falling near the decision boundary. This intuition dates back to the earliest studies in pattern recognition, and in the more recent adaptive approaches to the so called boundary hunting, such as the work of Aha et alii on Instance Based Learning and the work of Vapnik et alii on Support Vector Machines. The last work is of particular interest, since theoretical and experimental results ensure the accuracy of boundary reconstruction. However, its optimization approach has heavy computational and memory requirements, which limits its application on huge amounts of data. In the paper we describe an alternative approach to boundary hunting based on adaptive labeled quantization architectures. The adaptation is performed by a stochastic gradient algorithm for the minimization of the error probability. Error probability minimization guarantees the accurate approximation of the optimal decision boundary, while the use of a stochastic gradient algorithm defines an efficient method to reach such approximation. In the paper comparisons to Support Vector Machines are considered.

Performance analysis of a GPS Interferometric attitude determination system for a gravity gradient stabilized spacecraft. M.S. Thesis

NASA Technical Reports Server (NTRS)

Stoll, John C.

1995-01-01

The performance of an unaided attitude determination system based on GPS interferometry is examined using linear covariance analysis. The modelled system includes four GPS antennae onboard a gravity gradient stabilized spacecraft, specifically the Air Force's RADCAL satellite. The principal error sources are identified and modelled. The optimal system's sensitivities to these error sources are examined through an error budget and by varying system parameters. The effects of two satellite selection algorithms, Geometric and Attitude Dilution of Precision (GDOP and ADOP, respectively) are examined. The attitude performance of two optimal-suboptimal filters is also presented. Based on this analysis, the limiting factors in attitude accuracy are the knowledge of the relative antenna locations, the electrical path lengths from the antennae to the receiver, and the multipath environment. The performance of the system is found to be fairly insensitive to torque errors, orbital inclination, and the two satellite geometry figures-of-merit tested.

The plug-based nanovolume Microcapillary Protein Crystallization System (MPCS)

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gerdts, Cory J.; Elliott, Mark; Lovell, Scott

2012-02-08

The Microcapillary Protein Crystallization System (MPCS) embodies a new semi-automated plug-based crystallization technology which enables nanolitre-volume screening of crystallization conditions in a plasticware format that allows crystals to be easily removed for traditional cryoprotection and X-ray diffraction data collection. Protein crystals grown in these plastic devices can be directly subjected to in situ X-ray diffraction studies. The MPCS integrates the formulation of crystallization cocktails with the preparation of the crystallization experiments. Within microfluidic Teflon tubing or the microfluidic circuitry of a plastic CrystalCard, {approx}10-20 nl volume droplets are generated, each representing a microbatch-style crystallization experiment with a different chemical composition.more » The entire protein sample is utilized in crystallization experiments. Sparse-matrix screening and chemical gradient screening can be combined in one comprehensive 'hybrid' crystallization trial. The technology lends itself well to optimization by high-granularity gradient screening using optimization reagents such as precipitation agents, ligands or cryoprotectants.« less

FusionArc optimization: a hybrid volumetric modulated arc therapy (VMAT) and intensity modulated radiation therapy (IMRT) planning strategy.

PubMed

Matuszak, Martha M; Steers, Jennifer M; Long, Troy; McShan, Daniel L; Fraass, Benedick A; Romeijn, H Edwin; Ten Haken, Randall K

2013-07-01

To introduce a hybrid volumetric modulated arc therapy/intensity modulated radiation therapy (VMAT/IMRT) optimization strategy called FusionArc that combines the delivery efficiency of single-arc VMAT with the potentially desirable intensity modulation possible with IMRT. A beamlet-based inverse planning system was enhanced to combine the advantages of VMAT and IMRT into one comprehensive technique. In the hybrid strategy, baseline single-arc VMAT plans are optimized and then the current cost function gradients with respect to the beamlets are used to define a metric for predicting which beam angles would benefit from further intensity modulation. Beams with the highest metric values (called the gradient factor) are converted from VMAT apertures to IMRT fluence, and the optimization proceeds with the mixed variable set until convergence or until additional beams are selected for conversion. One phantom and two clinical cases were used to validate the gradient factor and characterize the FusionArc strategy. Comparisons were made between standard IMRT, single-arc VMAT, and FusionArc plans with one to five IMRT∕hybrid beams. The gradient factor was found to be highly predictive of the VMAT angles that would benefit plan quality the most from beam modulation. Over the three cases studied, a FusionArc plan with three converted beams achieved superior dosimetric quality with reductions in final cost ranging from 26.4% to 48.1% compared to single-arc VMAT. Additionally, the three beam FusionArc plans required 22.4%-43.7% fewer MU∕Gy than a seven beam IMRT plan. While the FusionArc plans with five converted beams offer larger reductions in final cost--32.9%-55.2% compared to single-arc VMAT--the decrease in MU∕Gy compared to IMRT was noticeably smaller at 12.2%-18.5%, when compared to IMRT. A hybrid VMAT∕IMRT strategy was implemented to find a high quality compromise between gantry-angle and intensity-based degrees of freedom. This optimization method will allow patients to be simultaneously planned for dosimetric quality and delivery efficiency without switching between delivery techniques. Example phantom and clinical cases suggest that the conversion of only three VMAT segments to modulated beams may result in a good combination of quality and efficiency.

Selectivity optimization in green chromatography by gradient stationary phase optimized selectivity liquid chromatography.

PubMed

Chen, Kai; Lynen, Frédéric; De Beer, Maarten; Hitzel, Laure; Ferguson, Paul; Hanna-Brown, Melissa; Sandra, Pat

2010-11-12

Stationary phase optimized selectivity liquid chromatography (SOSLC) is a promising technique to optimize the selectivity of a given separation by using a combination of different stationary phases. Previous work has shown that SOSLC offers excellent possibilities for method development, especially after the recent modification towards linear gradient SOSLC. The present work is aimed at developing and extending the SOSLC approach towards selectivity optimization and method development for green chromatography. Contrary to current LC practices, a green mobile phase (water/ethanol/formic acid) is hereby preselected and the composition of the stationary phase is optimized under a given gradient profile to obtain baseline resolution of all target solutes in the shortest possible analysis time. With the algorithm adapted to the high viscosity property of ethanol, the principle is illustrated with a fast, full baseline resolution for a randomly selected mixture composed of sulphonamides, xanthine alkaloids and steroids. Copyright © 2010 Elsevier B.V. All rights reserved.

Numerical optimization methods for controlled systems with parameters

NASA Astrophysics Data System (ADS)

Tyatyushkin, A. I.

2017-10-01

First- and second-order numerical methods for optimizing controlled dynamical systems with parameters are discussed. In unconstrained-parameter problems, the control parameters are optimized by applying the conjugate gradient method. A more accurate numerical solution in these problems is produced by Newton's method based on a second-order functional increment formula. Next, a general optimal control problem with state constraints and parameters involved on the righthand sides of the controlled system and in the initial conditions is considered. This complicated problem is reduced to a mathematical programming one, followed by the search for optimal parameter values and control functions by applying a multimethod algorithm. The performance of the proposed technique is demonstrated by solving application problems.

Airfoil optimization for unsteady flows with application to high-lift noise reduction

NASA Astrophysics Data System (ADS)

Rumpfkeil, Markus Peer

The use of steady-state aerodynamic optimization methods in the computational fluid dynamic (CFD) community is fairly well established. In particular, the use of adjoint methods has proven to be very beneficial because their cost is independent of the number of design variables. The application of numerical optimization to airframe-generated noise, however, has not received as much attention, but with the significant quieting of modern engines, airframe noise now competes with engine noise. Optimal control techniques for unsteady flows are needed in order to be able to reduce airframe-generated noise. In this thesis, a general framework is formulated to calculate the gradient of a cost function in a nonlinear unsteady flow environment via the discrete adjoint method. The unsteady optimization algorithm developed in this work utilizes a Newton-Krylov approach since the gradient-based optimizer uses the quasi-Newton method BFGS, Newton's method is applied to the nonlinear flow problem, GMRES is used to solve the resulting linear problem inexactly, and last but not least the linear adjoint problem is solved using Bi-CGSTAB. The flow is governed by the unsteady two-dimensional compressible Navier-Stokes equations in conjunction with a one-equation turbulence model, which are discretized using structured grids and a finite difference approach. The effectiveness of the unsteady optimization algorithm is demonstrated by applying it to several problems of interest including shocktubes, pulses in converging-diverging nozzles, rotating cylinders, transonic buffeting, and an unsteady trailing-edge flow. In order to address radiated far-field noise, an acoustic wave propagation program based on the Ffowcs Williams and Hawkings (FW-H) formulation is implemented and validated. The general framework is then used to derive the adjoint equations for a novel hybrid URANS/FW-H optimization algorithm in order to be able to optimize the shape of airfoils based on their calculated far-field pressure fluctuations. Validation and application results for this novel hybrid URANS/FW-H optimization algorithm show that it is possible to optimize the shape of an airfoil in an unsteady flow environment to minimize its radiated far-field noise while maintaining good aerodynamic performance.

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

PubMed

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.

Detection of thermal gradients through fiber-optic Chirped Fiber Bragg Grating (CFBG): Medical thermal ablation scenario

NASA Astrophysics Data System (ADS)

Korganbayev, Sanzhar; Orazayev, Yerzhan; Sovetov, Sultan; Bazyl, Ali; Schena, Emiliano; Massaroni, Carlo; Gassino, Riccardo; Vallan, Alberto; Perrone, Guido; Saccomandi, Paola; Arturo Caponero, Michele; Palumbo, Giovanna; Campopiano, Stefania; Iadicicco, Agostino; Tosi, Daniele

2018-03-01

In this paper, we describe a novel method for spatially distributed temperature measurement with Chirped Fiber Bragg Grating (CFBG) fiber-optic sensors. The proposed method determines the thermal profile in the CFBG region from demodulation of the CFBG optical spectrum. The method is based on an iterative optimization that aims at minimizing the mismatch between the measured CFBG spectrum and a CFBG model based on coupled-mode theory (CMT), perturbed by a temperature gradient. In the demodulation part, we simulate different temperature distribution patterns with Monte-Carlo approach on simulated CFBG spectra. Afterwards, we obtain cost function that minimizes difference between measured and simulated spectra, and results in final temperature profile. Experiments and simulations have been carried out first with a linear gradient, demonstrating a correct operation (error 2.9 °C); then, a setup has been arranged to measure the temperature pattern on a 5-cm long section exposed to medical laser thermal ablation. Overall, the proposed method can operate as a real-time detection technique for thermal gradients over 1.5-5 cm regions, and turns as a key asset for the estimation of thermal gradients at the micro-scale in biomedical applications.

Conjugate gradient heat bath for ill-conditioned actions.

PubMed

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.

Ultrasound image edge detection based on a novel multiplicative gradient and Canny operator.

PubMed

Zheng, Yinfei; Zhou, Yali; Zhou, Hao; Gong, Xiaohong

2015-07-01

To achieve the fast and accurate segmentation of ultrasound image, a novel edge detection method for speckle noised ultrasound images was proposed, which was based on the traditional Canny and a novel multiplicative gradient operator. The proposed technique combines a new multiplicative gradient operator of non-Newtonian type with the traditional Canny operator to generate the initial edge map, which is subsequently optimized by the following edge tracing step. To verify the proposed method, we compared it with several other edge detection methods that had good robustness to noise, with experiments on the simulated and in vivo medical ultrasound image. Experimental results showed that the proposed algorithm has higher speed for real-time processing, and the edge detection accuracy could be 75% or more. Thus, the proposed method is very suitable for fast and accurate edge detection of medical ultrasound images. © The Author(s) 2014.

A new optimal seam method for seamless image stitching

NASA Astrophysics Data System (ADS)

Xue, Jiale; Chen, Shengyong; Cheng, Xu; Han, Ying; Zhao, Meng

2017-07-01

A novel optimal seam method which aims to stitch those images with overlapping area more seamlessly has been propos ed. Considering the traditional gradient domain optimal seam method and fusion algorithm result in bad color difference measurement and taking a long time respectively, the input images would be converted to HSV space and a new energy function is designed to seek optimal stitching path. To smooth the optimal stitching path, a simplified pixel correction and weighted average method are utilized individually. The proposed methods exhibit performance in eliminating the stitching seam compared with the traditional gradient optimal seam and high efficiency with multi-band blending algorithm.

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

NASA Technical Reports Server (NTRS)

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.

Efficient operation scheduling for adsorption chillers using predictive optimization-based control methods

NASA Astrophysics Data System (ADS)

Bürger, Adrian; Sawant, Parantapa; Bohlayer, Markus; Altmann-Dieses, Angelika; Braun, Marco; Diehl, Moritz

2017-10-01

Within this work, the benefits of using predictive control methods for the operation of Adsorption Cooling Machines (ACMs) are shown on a simulation study. Since the internal control decisions of series-manufactured ACMs often cannot be influenced, the work focuses on optimized scheduling of an ACM considering its internal functioning as well as forecasts for load and driving energy occurrence. For illustration, an assumed solar thermal climate system is introduced and a system model suitable for use within gradient-based optimization methods is developed. The results of a system simulation using a conventional scheme for ACM scheduling are compared to the results of a predictive, optimization-based scheduling approach for the same exemplary scenario of load and driving energy occurrence. The benefits of the latter approach are shown and future actions for application of these methods for system control are addressed.

Analysis of deformable image registration accuracy using computational modeling

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhong Hualiang; Kim, Jinkoo; Chetty, Indrin J.

2010-03-15

Computer aided modeling of anatomic deformation, allowing various techniques and protocols in radiation therapy to be systematically verified and studied, has become increasingly attractive. In this study the potential issues in deformable image registration (DIR) were analyzed based on two numerical phantoms: One, a synthesized, low intensity gradient prostate image, and the other a lung patient's CT image data set. Each phantom was modeled with region-specific material parameters with its deformation solved using a finite element method. The resultant displacements were used to construct a benchmark to quantify the displacement errors of the Demons and B-Spline-based registrations. The results showmore » that the accuracy of these registration algorithms depends on the chosen parameters, the selection of which is closely associated with the intensity gradients of the underlying images. For the Demons algorithm, both single resolution (SR) and multiresolution (MR) registrations required approximately 300 iterations to reach an accuracy of 1.4 mm mean error in the lung patient's CT image (and 0.7 mm mean error averaged in the lung only). For the low gradient prostate phantom, these algorithms (both SR and MR) required at least 1600 iterations to reduce their mean errors to 2 mm. For the B-Spline algorithms, best performance (mean errors of 1.9 mm for SR and 1.6 mm for MR, respectively) on the low gradient prostate was achieved using five grid nodes in each direction. Adding more grid nodes resulted in larger errors. For the lung patient's CT data set, the B-Spline registrations required ten grid nodes in each direction for highest accuracy (1.4 mm for SR and 1.5 mm for MR). The numbers of iterations or grid nodes required for optimal registrations depended on the intensity gradients of the underlying images. In summary, the performance of the Demons and B-Spline registrations have been quantitatively evaluated using numerical phantoms. The results show that parameter selection for optimal accuracy is closely related to the intensity gradients of the underlying images. Also, the result that the DIR algorithms produce much lower errors in heterogeneous lung regions relative to homogeneous (low intensity gradient) regions, suggests that feature-based evaluation of deformable image registration accuracy must be viewed cautiously.« less

Use of optimization to predict the effect of selected parameters on commuter aircraft performance

NASA Technical Reports Server (NTRS)

Wells, V. L.; Shevell, R. S.

1982-01-01

The relationships between field length and cruise speed and aircraft direct operating cost were determined. A gradient optimizing computer program was developed to minimize direct operating cost (DOC) as a function of airplane geometry. In this way, the best airplane operating under one set of constraints can be compared with the best operating under another. A constant 30-passenger fuselage and rubberized engines based on the General Electric CT-7 were used as a baseline. All aircraft had to have a 600 nautical mile maximum range and were designed to FAR part 25 structural integrity and climb gradient regulations. Direct operating cost was minimized for a typical design mission of 150 nautical miles. For purposes of C sub L sub max calculation, all aircraft had double-slotted flaps but with no Fowler action.

Stochastic Resonance in Signal Detection and Human Perception

DTIC Science & Technology

2006-07-05

learning scheme performing a stochastic gradient ascent on the SNR to determine the optimal noise level based on the samples from the process. Rather than...produce some SR effect in threshold neurons and a new statistically robust learning law was proposed to find the optimal noise level. [McDonnell...Ultimately, we know that it is the brain that responds to a visual stimulus causing neurons to fire. Conceivably if we understood the effect of the noise PDF

Minimum maximum temperature gradient coil design.

PubMed

While, Peter T; Poole, Michael S; Forbes, Larry K; Crozier, Stuart

2013-08-01

Ohmic heating is a serious problem in gradient coil operation. A method is presented for redesigning cylindrical gradient coils to operate at minimum peak temperature, while maintaining field homogeneity and coil performance. To generate these minimaxT coil windings, an existing analytic method for simulating the spatial temperature distribution of single layer gradient coils is combined with a minimax optimization routine based on sequential quadratic programming. Simulations are provided for symmetric and asymmetric gradient coils that show considerable improvements in reducing maximum temperature over existing methods. The winding patterns of the minimaxT coils were found to be heavily dependent on the assumed thermal material properties and generally display an interesting "fish-eye" spreading of windings in the dense regions of the coil. Small prototype coils were constructed and tested for experimental validation and these demonstrate that with a reasonable estimate of material properties, thermal performance can be improved considerably with negligible change to the field error or standard figures of merit. © 2012 Wiley Periodicals, Inc.

The skylight gradient of luminance helps sandhoppers in sun and moon identification.

PubMed

Ugolini, Alberto; Galanti, Giuditta; Mercatelli, Luca

2012-08-15

To return to the ecologically optimal zone of the beach, the sandhopper Talitrus saltator (Montagu) maintains a constant sea-land direction based on the sun and moon compasses. In this study, we investigated the role of the skylight gradient of luminance in sun and moon identification under natural and artificial conditions of illumination. Clock-shifted (inverted) sandhoppers tested under the sun (during their subjective night) and under the full moon (during their subjective day) exhibit orientation in accordance with correct identification of the sun and the moon at night. Tested in artificial conditions of illumination at night without the artificial gradient of luminance, the artificial astronomical cue is identified as the moon even when the conditions of illumination allow sun compass orientation during the day. When the artificial gradient of luminance is added, the artificial astronomical cue is identified as the sun. The role of the sky gradient of luminance in sun and moon identification is discussed on the basis of present and past findings.

A deep belief network with PLSR for nonlinear system modeling.

PubMed

Qiao, Junfei; Wang, Gongming; Li, Wenjing; Li, Xiaoli

2018-08-01

Nonlinear system modeling plays an important role in practical engineering, and deep learning-based deep belief network (DBN) is now popular in nonlinear system modeling and identification because of the strong learning ability. However, the existing weights optimization for DBN is based on gradient, which always leads to a local optimum and a poor training result. In this paper, a DBN with partial least square regression (PLSR-DBN) is proposed for nonlinear system modeling, which focuses on the problem of weights optimization for DBN using PLSR. Firstly, unsupervised contrastive divergence (CD) algorithm is used in weights initialization. Secondly, initial weights derived from CD algorithm are optimized through layer-by-layer PLSR modeling from top layer to bottom layer. Instead of gradient method, PLSR-DBN can determine the optimal weights using several PLSR models, so that a better performance of PLSR-DBN is achieved. Then, the analysis of convergence is theoretically given to guarantee the effectiveness of the proposed PLSR-DBN model. Finally, the proposed PLSR-DBN is tested on two benchmark nonlinear systems and an actual wastewater treatment system as well as a handwritten digit recognition (nonlinear mapping and modeling) with high-dimension input data. The experiment results show that the proposed PLSR-DBN has better performances of time and accuracy on nonlinear system modeling than that of other methods. Copyright © 2017 Elsevier Ltd. All rights reserved.

Multidisciplinary Optimization of a Transport Aircraft Wing using Particle Swarm Optimization

NASA Technical Reports Server (NTRS)

Sobieszczanski-Sobieski, Jaroslaw; Venter, Gerhard

2002-01-01

The purpose of this paper is to demonstrate the application of particle swarm optimization to a realistic multidisciplinary optimization test problem. The paper's new contributions to multidisciplinary optimization is the application of a new algorithm for dealing with the unique challenges associated with multidisciplinary optimization problems, and recommendations as to the utility of the algorithm in future multidisciplinary optimization applications. The selected example is a bi-level optimization problem that demonstrates severe numerical noise and has a combination of continuous and truly discrete design variables. The use of traditional gradient-based optimization algorithms is thus not practical. The numerical results presented indicate that the particle swarm optimization algorithm is able to reliably find the optimum design for the problem presented here. The algorithm is capable of dealing with the unique challenges posed by multidisciplinary optimization as well as the numerical noise and truly discrete variables present in the current example problem.

A Study of Penalty Function Methods for Constraint Handling with Genetic Algorithm

NASA Technical Reports Server (NTRS)

Ortiz, Francisco

2004-01-01

COMETBOARDS (Comparative Evaluation Testbed of Optimization and Analysis Routines for Design of Structures) is a design optimization test bed that can evaluate the performance of several different optimization algorithms. A few of these optimization algorithms are the sequence of unconstrained minimization techniques (SUMT), sequential linear programming (SLP) and the sequential quadratic programming techniques (SQP). A genetic algorithm (GA) is a search technique that is based on the principles of natural selection or "survival of the fittest". Instead of using gradient information, the GA uses the objective function directly in the search. The GA searches the solution space by maintaining a population of potential solutions. Then, using evolving operations such as recombination, mutation and selection, the GA creates successive generations of solutions that will evolve and take on the positive characteristics of their parents and thus gradually approach optimal or near-optimal solutions. By using the objective function directly in the search, genetic algorithms can be effectively applied in non-convex, highly nonlinear, complex problems. The genetic algorithm is not guaranteed to find the global optimum, but it is less likely to get trapped at a local optimum than traditional gradient-based search methods when the objective function is not smooth and generally well behaved. The purpose of this research is to assist in the integration of genetic algorithm (GA) into COMETBOARDS. COMETBOARDS cast the design of structures as a constrained nonlinear optimization problem. One method used to solve constrained optimization problem with a GA to convert the constrained optimization problem into an unconstrained optimization problem by developing a penalty function that penalizes infeasible solutions. There have been several suggested penalty function in the literature each with there own strengths and weaknesses. A statistical analysis of some suggested penalty functions is performed in this study. Also, a response surface approach to robust design is used to develop a new penalty function approach. This new penalty function approach is then compared with the other existing penalty functions.

Graded-index fiber tip optical tweezers: numerical simulation and trapping experiment.

PubMed

Gong, Yuan; Ye, Ai-Yan; Wu, Yu; Rao, Yun-Jiang; Yao, Yao; Xiao, Song

2013-07-01

Optical fiber tweezers based on a graded-index multimode fiber (GIMMF) tip is proposed. Light propagation characteristics and gradient force distribution near the GIMMF tip are numerically investigated, which are further compared with that of optical fiber tips based on conventional single mode fibers. The simulated results indicated that by selecting optimal GIMMF length, the gradient force of the GIMMF tip tweezers is about 4 times higher than that of the SMF tip tweezers with a same shape. To prove the feasibility of such a new concept, optical trapping of yeast cells with a diameter of ~5 μm using the chemically-etched GIMMF tip is experimentally demonstrated and the trapping force is also calculated.

Combinatorial techniques to efficiently investigate and optimize organic thin film processing and properties.

PubMed

Wieberger, Florian; Kolb, Tristan; Neuber, Christian; Ober, Christopher K; Schmidt, Hans-Werner

2013-04-08

In this article we present several developed and improved combinatorial techniques to optimize processing conditions and material properties of organic thin films. The combinatorial approach allows investigations of multi-variable dependencies and is the perfect tool to investigate organic thin films regarding their high performance purposes. In this context we develop and establish the reliable preparation of gradients of material composition, temperature, exposure, and immersion time. Furthermore we demonstrate the smart application of combinations of composition and processing gradients to create combinatorial libraries. First a binary combinatorial library is created by applying two gradients perpendicular to each other. A third gradient is carried out in very small areas and arranged matrix-like over the entire binary combinatorial library resulting in a ternary combinatorial library. Ternary combinatorial libraries allow identifying precise trends for the optimization of multi-variable dependent processes which is demonstrated on the lithographic patterning process. Here we verify conclusively the strong interaction and thus the interdependency of variables in the preparation and properties of complex organic thin film systems. The established gradient preparation techniques are not limited to lithographic patterning. It is possible to utilize and transfer the reported combinatorial techniques to other multi-variable dependent processes and to investigate and optimize thin film layers and devices for optical, electro-optical, and electronic applications.

Gradient Material Strategies for Hydrogel Optimization in Tissue Engineering Applications

PubMed Central

2018-01-01

Although a number of combinatorial/high-throughput approaches have been developed for biomaterial hydrogel optimization, a gradient sample approach is particularly well suited to identify hydrogel property thresholds that alter cellular behavior in response to interacting with the hydrogel due to reduced variation in material preparation and the ability to screen biological response over a range instead of discrete samples each containing only one condition. This review highlights recent work on cell–hydrogel interactions using a gradient material sample approach. Fabrication strategies for composition, material and mechanical property, and bioactive signaling gradient hydrogels that can be used to examine cell–hydrogel interactions will be discussed. The effects of gradients in hydrogel samples on cellular adhesion, migration, proliferation, and differentiation will then be examined, providing an assessment of the current state of the field and the potential of wider use of the gradient sample approach to accelerate our understanding of matrices on cellular behavior. PMID:29485612

Free terminal time optimal control problem of an HIV model based on a conjugate gradient method.

PubMed

Jang, Taesoo; Kwon, Hee-Dae; Lee, Jeehyun

2011-10-01

The minimum duration of treatment periods and the optimal multidrug therapy for human immunodeficiency virus (HIV) type 1 infection are considered. We formulate an optimal tracking problem, attempting to drive the states of the model to a "healthy" steady state in which the viral load is low and the immune response is strong. We study an optimal time frame as well as HIV therapeutic strategies by analyzing the free terminal time optimal tracking control problem. The minimum duration of treatment periods and the optimal multidrug therapy are found by solving the corresponding optimality systems with the additional transversality condition for the terminal time. We demonstrate by numerical simulations that the optimal dynamic multidrug therapy can lead to the long-term control of HIV by the strong immune response after discontinuation of therapy.

Optimization and quantization in gradient symbol systems: a framework for integrating the continuous and the discrete in cognition.

PubMed

Smolensky, Paul; Goldrick, Matthew; Mathis, Donald

2014-08-01

Mental representations have continuous as well as discrete, combinatorial properties. For example, while predominantly discrete, phonological representations also vary continuously; this is reflected by gradient effects in instrumental studies of speech production. Can an integrated theoretical framework address both aspects of structure? The framework we introduce here, Gradient Symbol Processing, characterizes the emergence of grammatical macrostructure from the Parallel Distributed Processing microstructure (McClelland, Rumelhart, & The PDP Research Group, 1986) of language processing. The mental representations that emerge, Distributed Symbol Systems, have both combinatorial and gradient structure. They are processed through Subsymbolic Optimization-Quantization, in which an optimization process favoring representations that satisfy well-formedness constraints operates in parallel with a distributed quantization process favoring discrete symbolic structures. We apply a particular instantiation of this framework, λ-Diffusion Theory, to phonological production. Simulations of the resulting model suggest that Gradient Symbol Processing offers a way to unify accounts of grammatical competence with both discrete and continuous patterns in language performance. Copyright © 2013 Cognitive Science Society, Inc.

A rotor optimization using regression analysis

NASA Technical Reports Server (NTRS)

Giansante, N.

1984-01-01

The design and development of helicopter rotors is subject to the many design variables and their interactions that effect rotor operation. Until recently, selection of rotor design variables to achieve specified rotor operational qualities has been a costly, time consuming, repetitive task. For the past several years, Kaman Aerospace Corporation has successfully applied multiple linear regression analysis, coupled with optimization and sensitivity procedures, in the analytical design of rotor systems. It is concluded that approximating equations can be developed rapidly for a multiplicity of objective and constraint functions and optimizations can be performed in a rapid and cost effective manner; the number and/or range of design variables can be increased by expanding the data base and developing approximating functions to reflect the expanded design space; the order of the approximating equations can be expanded easily to improve correlation between analyzer results and the approximating equations; gradients of the approximating equations can be calculated easily and these gradients are smooth functions reducing the risk of numerical problems in the optimization; the use of approximating functions allows the problem to be started easily and rapidly from various initial designs to enhance the probability of finding a global optimum; and the approximating equations are independent of the analysis or optimization codes used.

Designing optimal nanofocusing with a gradient hyperlens

NASA Astrophysics Data System (ADS)

Shen, Lian; Prokopeva, Ludmila J.; Chen, Hongsheng; Kildishev, Alexander V.

2017-11-01

We report the design of a high-throughput gradient hyperbolic lenslet built with real-life materials and capable of focusing a beam into a deep sub-wavelength spot of λ/23. This efficient design is achieved through high-order transformation optics and circular effective-medium theory (CEMT), which are used to engineer the radially varying anisotropic artificial material based on the thin alternating cylindrical metal and dielectric layers. The radial gradient of the effective anisotropic optical constants allows for matching the impedances at the input and output interfaces, drastically improving the throughput of the lenslet. However, it is the use of the zeroth-order CEMT that enables the practical realization of a gradient hyperlens with realistic materials. To illustrate the importance of using the CEMT versus the conventional planar effective-medium theory (PEMT) for cylindrical anisotropic systems, such as our hyperlens, both the CEMT and PEMT are adopted to design gradient hyperlenses with the same materials and order of elemental layers. The CEMT- and PEMT-based designs show similar performance if the number of metal-dielectric binary layers is sufficiently large (9+ pairs) and if the layers are sufficiently thin. However, for the manufacturable lenses with realistic numbers of layers (e.g. five pairs) and thicknesses, the performance of the CEMT design continues to be practical, whereas the PEMT-based design stops working altogether. The accurate design of transformation optics-based layered cylindrical devices enabled by CEMT allow for a new class of robustly manufacturable nanophotonic systems, even with relatively thick layers of real-life materials.

Improved optimization of polycyclic aromatic hydrocarbons (PAHs) mixtures resolution in reversed-phase high-performance liquid chromatography by using factorial design and response surface methodology.

PubMed

Andrade-Eiroa, Auréa; Diévart, Pascal; Dagaut, Philippe

2010-04-15

A new procedure for optimizing PAHs separation in very complex mixtures by reverse phase high performance (RPLC) is proposed. It is based on changing gradually the experimental conditions all along the chromatographic procedure as a function of the physical properties of the compounds eluted. The temperature and speed flow gradients allowed obtaining the optimum resolution in large chromatographic determinations where PAHs with very different medium polarizability have to be separated. Whereas optimization procedures of RPLC methodologies had always been accomplished regardless of the physico-chemical properties of the target analytes, we found that resolution is highly dependent on the physico-chemical properties of the target analytes. Based on resolution criterion, optimization process for a 16 EPA PAHs mixture was performed on three sets of difficult-to-separate PAHs pairs: acenaphthene-fluorene (for the optimization procedure in the first part of the chromatogram where light PAHs elute), benzo[g,h,i]perylene-dibenzo[a,h]anthracene and benzo[g,h,i]perylene-indeno[1,2,3-cd]pyrene (for the optimization procedure of the second part of the chromatogram where the heavier PAHs elute). Two-level full factorial designs were applied to detect interactions among variables to be optimized: speed flow, temperature of column oven and mobile-phase gradient in the two parts of the studied chromatogram. Experimental data were fitted by multivariate nonlinear regression models and optimum values of speed flow and temperature were obtained through mathematical analysis of the constructed models. An HPLC system equipped with a reversed phase 5 microm C18, 250 mm x 4.6mm column (with acetonitrile/water mobile phase), a column oven, a binary pump, a photodiode array detector (PDA), and a fluorimetric detector were used in this work. Optimum resolution was achieved operating at 1.0 mL/min in the first part of the chromatogram (until 45 min) and 0.5 mL/min in the second one (from 45 min to the end) and by applying programmed temperature gradient (15 degrees C until 30 min and progressively increasing temperature until reaching 40 degrees C at 45 min). (c) 2009 Elsevier B.V. All rights reserved.

Sequential-Optimization-Based Framework for Robust Modeling and Design of Heterogeneous Catalytic Systems

DOE PAGES

Rangarajan, Srinivas; Maravelias, Christos T.; Mavrikakis, Manos

2017-11-09

Here, we present a general optimization-based framework for (i) ab initio and experimental data driven mechanistic modeling and (ii) optimal catalyst design of heterogeneous catalytic systems. Both cases are formulated as a nonlinear optimization problem that is subject to a mean-field microkinetic model and thermodynamic consistency requirements as constraints, for which we seek sparse solutions through a ridge (L 2 regularization) penalty. The solution procedure involves an iterative sequence of forward simulation of the differential algebraic equations pertaining to the microkinetic model using a numerical tool capable of handling stiff systems, sensitivity calculations using linear algebra, and gradient-based nonlinear optimization.more » A multistart approach is used to explore the solution space, and a hierarchical clustering procedure is implemented for statistically classifying potentially competing solutions. An example of methanol synthesis through hydrogenation of CO and CO 2 on a Cu-based catalyst is used to illustrate the framework. The framework is fast, is robust, and can be used to comprehensively explore the model solution and design space of any heterogeneous catalytic system.« less

Sequential-Optimization-Based Framework for Robust Modeling and Design of Heterogeneous Catalytic Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Rangarajan, Srinivas; Maravelias, Christos T.; Mavrikakis, Manos

Here, we present a general optimization-based framework for (i) ab initio and experimental data driven mechanistic modeling and (ii) optimal catalyst design of heterogeneous catalytic systems. Both cases are formulated as a nonlinear optimization problem that is subject to a mean-field microkinetic model and thermodynamic consistency requirements as constraints, for which we seek sparse solutions through a ridge (L 2 regularization) penalty. The solution procedure involves an iterative sequence of forward simulation of the differential algebraic equations pertaining to the microkinetic model using a numerical tool capable of handling stiff systems, sensitivity calculations using linear algebra, and gradient-based nonlinear optimization.more » A multistart approach is used to explore the solution space, and a hierarchical clustering procedure is implemented for statistically classifying potentially competing solutions. An example of methanol synthesis through hydrogenation of CO and CO 2 on a Cu-based catalyst is used to illustrate the framework. The framework is fast, is robust, and can be used to comprehensively explore the model solution and design space of any heterogeneous catalytic system.« less

Gradient Evolution-based Support Vector Machine Algorithm for Classification

NASA Astrophysics Data System (ADS)

Zulvia, Ferani E.; Kuo, R. J.

2018-03-01

This paper proposes a classification algorithm based on a support vector machine (SVM) and gradient evolution (GE) algorithms. SVM algorithm has been widely used in classification. However, its result is significantly influenced by the parameters. Therefore, this paper aims to propose an improvement of SVM algorithm which can find the best SVMs’ parameters automatically. The proposed algorithm employs a GE algorithm to automatically determine the SVMs’ parameters. The GE algorithm takes a role as a global optimizer in finding the best parameter which will be used by SVM algorithm. The proposed GE-SVM algorithm is verified using some benchmark datasets and compared with other metaheuristic-based SVM algorithms. The experimental results show that the proposed GE-SVM algorithm obtains better results than other algorithms tested in this paper.

Bending efficiency through property gradients in bamboo, palm, and wood-based composites.

PubMed

Wegst, Ulrike G K

2011-07-01

Nature, to a greater extent than engineering, takes advantage of hierarchical structures. These allow for optimization at each structural level to achieve mechanical efficiency, meaning mechanical performance per unit mass. Palms and bamboos do this exceptionally well; both are fibre-reinforced cellular materials in which the fibres are aligned parallel to the stem or culm, respectively. The distribution of these fibres is, however, not uniform: there is a density and modulus gradient across the section. This property gradient increases the flexural rigidity of the plants per unit mass, mass being a measure of metabolic investment made into an organism's construction. An analytical model is presented with which a 'gradient shape factor' can be calculated that describes by how much a plant's bending efficiency is increased through gradient structures. Combining the 'gradient shape factor' with a 'microstructural shape factor' that captures the efficiency gained through the cellular nature of the fibre composite's matrix, and a 'macroscopical shape factor' with which the tubular shape of bamboo can be described, for example, it is possible to explore how much each of these three structural levels of the hierarchy contributes to the overall bending performance of the stem or culm. In analogy, the bending efficiency of the commonly used wood-based composite medium-density fibreboard can be analysed; its property gradient is due to its manufacture by hot pressing. A few other engineered materials exist that emulate property gradients; new manufacturing routes to prepare them are currently being explored. It appears worthwhile to pursue these further. Copyright © 2011. Published by Elsevier Ltd.

A Motor-Gradient and Clustering Model of the Centripetal Motility of MTOCs in Meiosis I of Mouse Oocytes

PubMed Central

2016-01-01

Asters nucleated by Microtubule (MT) organizing centers (MTOCs) converge on chromosomes during spindle assembly in mouse oocytes undergoing meiosis I. Time-lapse imaging suggests that this centripetal motion is driven by a biased ‘search-and-capture’ mechanism. Here, we develop a model of a random walk in a drift field to test the nature of the bias and the spatio-temporal dynamics of the search process. The model is used to optimize the spatial field of drift in simulations, by comparison to experimental motility statistics. In a second step, this optimized gradient is used to determine the location of immobilized dynein motors and MT polymerization parameters, since these are hypothesized to generate the gradient of forces needed to move MTOCs. We compare these scenarios to self-organized mechanisms by which asters have been hypothesized to find the cell-center- MT pushing at the cell-boundary and clustering motor complexes. By minimizing the error between simulation outputs and experiments, we find a model of “pulling” by a gradient of dynein motors alone can drive the centripetal motility. Interestingly, models of passive MT based “pushing” at the cortex, clustering by cross-linking motors and MT-dynamic instability gradients alone, by themselves do not result in the observed motility. The model predicts the sensitivity of the results to motor density and stall force, but not MTs per aster. A hybrid model combining a chromatin-centered immobilized dynein gradient, diffusible minus-end directed clustering motors and pushing at the cell cortex, is required to comprehensively explain the available data. The model makes experimentally testable predictions of a spatial bias and self-organized mechanisms by which MT asters can find the center of a large cell. PMID:27706163

A Motor-Gradient and Clustering Model of the Centripetal Motility of MTOCs in Meiosis I of Mouse Oocytes.

PubMed

Khetan, Neha; Athale, Chaitanya A

2016-10-01

Asters nucleated by Microtubule (MT) organizing centers (MTOCs) converge on chromosomes during spindle assembly in mouse oocytes undergoing meiosis I. Time-lapse imaging suggests that this centripetal motion is driven by a biased 'search-and-capture' mechanism. Here, we develop a model of a random walk in a drift field to test the nature of the bias and the spatio-temporal dynamics of the search process. The model is used to optimize the spatial field of drift in simulations, by comparison to experimental motility statistics. In a second step, this optimized gradient is used to determine the location of immobilized dynein motors and MT polymerization parameters, since these are hypothesized to generate the gradient of forces needed to move MTOCs. We compare these scenarios to self-organized mechanisms by which asters have been hypothesized to find the cell-center- MT pushing at the cell-boundary and clustering motor complexes. By minimizing the error between simulation outputs and experiments, we find a model of "pulling" by a gradient of dynein motors alone can drive the centripetal motility. Interestingly, models of passive MT based "pushing" at the cortex, clustering by cross-linking motors and MT-dynamic instability gradients alone, by themselves do not result in the observed motility. The model predicts the sensitivity of the results to motor density and stall force, but not MTs per aster. A hybrid model combining a chromatin-centered immobilized dynein gradient, diffusible minus-end directed clustering motors and pushing at the cell cortex, is required to comprehensively explain the available data. The model makes experimentally testable predictions of a spatial bias and self-organized mechanisms by which MT asters can find the center of a large cell.

A mesh gradient technique for numerical optimization

NASA Technical Reports Server (NTRS)

Willis, E. A., Jr.

1973-01-01

A class of successive-improvement optimization methods in which directions of descent are defined in the state space along each trial trajectory are considered. The given problem is first decomposed into two discrete levels by imposing mesh points. Level 1 consists of running optimal subarcs between each successive pair of mesh points. For normal systems, these optimal two-point boundary value problems can be solved by following a routine prescription if the mesh spacing is sufficiently close. A spacing criterion is given. Under appropriate conditions, the criterion value depends only on the coordinates of the mesh points, and its gradient with respect to those coordinates may be defined by interpreting the adjoint variables as partial derivatives of the criterion value function. In level 2, the gradient data is used to generate improvement steps or search directions in the state space which satisfy the boundary values and constraints of the given problem.

Program manual for ASTOP, an Arbitrary space trajectory optimization program

NASA Technical Reports Server (NTRS)

Horsewood, J. L.

1974-01-01

The ASTOP program (an Arbitrary Space Trajectory Optimization Program) designed to generate optimum low-thrust trajectories in an N-body field while satisfying selected hardware and operational constraints is presented. The trajectory is divided into a number of segments or arcs over which the control is held constant. This constant control over each arc is optimized using a parameter optimization scheme based on gradient techniques. A modified Encke formulation of the equations of motion is employed. The program provides a wide range of constraint, end conditions, and performance index options. The basic approach is conducive to future expansion of features such as the incorporation of new constraints and the addition of new end conditions.

Monoplane 3D-2D registration of cerebral angiograms based on multi-objective stratified optimization

NASA Astrophysics Data System (ADS)

Aksoy, T.; Špiclin, Ž.; Pernuš, F.; Unal, G.

2017-12-01

Registration of 3D pre-interventional to 2D intra-interventional medical images has an increasingly important role in surgical planning, navigation and treatment, because it enables the physician to co-locate depth information given by pre-interventional 3D images with the live information in intra-interventional 2D images such as x-ray. Most tasks during image-guided interventions are carried out under a monoplane x-ray, which is a highly ill-posed problem for state-of-the-art 3D to 2D registration methods. To address the problem of rigid 3D-2D monoplane registration we propose a novel multi-objective stratified parameter optimization, wherein a small set of high-magnitude intensity gradients are matched between the 3D and 2D images. The stratified parameter optimization matches rotation templates to depth templates, first sampled from projected 3D gradients and second from the 2D image gradients, so as to recover 3D rigid-body rotations and out-of-plane translation. The objective for matching was the gradient magnitude correlation coefficient, which is invariant to in-plane translation. The in-plane translations are then found by locating the maximum of the gradient phase correlation between the best matching pair of rotation and depth templates. On twenty pairs of 3D and 2D images of ten patients undergoing cerebral endovascular image-guided intervention the 3D to monoplane 2D registration experiments were setup with a rather high range of initial mean target registration error from 0 to 100 mm. The proposed method effectively reduced the registration error to below 2 mm, which was further refined by a fast iterative method and resulted in a high final registration accuracy (0.40 mm) and high success rate (> 96%). Taking into account a fast execution time below 10 s, the observed performance of the proposed method shows a high potential for application into clinical image-guidance systems.

Multi-disciplinary optimization of aeroservoelastic systems

NASA Technical Reports Server (NTRS)

Karpel, Mordechay

1990-01-01

Efficient analytical and computational tools for simultaneous optimal design of the structural and control components of aeroservoelastic systems are presented. The optimization objective is to achieve aircraft performance requirements and sufficient flutter and control stability margins with a minimal weight penalty and without violating the design constraints. Analytical sensitivity derivatives facilitate an efficient optimization process which allows a relatively large number of design variables. Standard finite element and unsteady aerodynamic routines are used to construct a modal data base. Minimum State aerodynamic approximations and dynamic residualization methods are used to construct a high accuracy, low order aeroservoelastic model. Sensitivity derivatives of flutter dynamic pressure, control stability margins and control effectiveness with respect to structural and control design variables are presented. The performance requirements are utilized by equality constraints which affect the sensitivity derivatives. A gradient-based optimization algorithm is used to minimize an overall cost function. A realistic numerical example of a composite wing with four controls is used to demonstrate the modeling technique, the optimization process, and their accuracy and efficiency.

Multidisciplinary optimization of aeroservoelastic systems using reduced-size models

NASA Technical Reports Server (NTRS)

Karpel, Mordechay

1992-01-01

Efficient analytical and computational tools for simultaneous optimal design of the structural and control components of aeroservoelastic systems are presented. The optimization objective is to achieve aircraft performance requirements and sufficient flutter and control stability margins with a minimal weight penalty and without violating the design constraints. Analytical sensitivity derivatives facilitate an efficient optimization process which allows a relatively large number of design variables. Standard finite element and unsteady aerodynamic routines are used to construct a modal data base. Minimum State aerodynamic approximations and dynamic residualization methods are used to construct a high accuracy, low order aeroservoelastic model. Sensitivity derivatives of flutter dynamic pressure, control stability margins and control effectiveness with respect to structural and control design variables are presented. The performance requirements are utilized by equality constraints which affect the sensitivity derivatives. A gradient-based optimization algorithm is used to minimize an overall cost function. A realistic numerical example of a composite wing with four controls is used to demonstrate the modeling technique, the optimization process, and their accuracy and efficiency.

Cryogenic Tank Structure Sizing With Structural Optimization Method

NASA Technical Reports Server (NTRS)

Wang, J. T.; Johnson, T. F.; Sleight, D. W.; Saether, E.

2001-01-01

Structural optimization methods in MSC /NASTRAN are used to size substructures and to reduce the weight of a composite sandwich cryogenic tank for future launch vehicles. Because the feasible design space of this problem is non-convex, many local minima are found. This non-convex problem is investigated in detail by conducting a series of analyses along a design line connecting two feasible designs. Strain constraint violations occur for some design points along the design line. Since MSC/NASTRAN uses gradient-based optimization procedures. it does not guarantee that the lowest weight design can be found. In this study, a simple procedure is introduced to create a new starting point based on design variable values from previous optimization analyses. Optimization analysis using this new starting point can produce a lower weight design. Detailed inputs for setting up the MSC/NASTRAN optimization analysis and final tank design results are presented in this paper. Approaches for obtaining further weight reductions are also discussed.

Time-optimal control of the spacecraft trajectories in the Earth-Moon system

NASA Astrophysics Data System (ADS)

Starinova, O. L.; Fain, M. K.; Materova, I. L.

2017-01-01

This paper outlines the multiparametric optimization of the L1-L2 and L2-L1 missions in the Earth-Moon system using electric propulsion. The optimal control laws are obtained using the Fedorenko successful linearization method to estimate the derivatives and the gradient method to optimize the control laws. The study of the transfers is based on the restricted circular three-body problem. The mathematical model of the missions is described within the barycentric system of coordinates. The optimization criterion is the total flight time. The perturbation from the Earth, the Moon and the Sun are taking into account. The impact of the shaded areas, induced by the Earth and the Moon, is also accounted. As the results of the optimization we obtained optimal control laws, corresponding trajectories and minimal total flight times.

Strategies and Applications for Incorporating Physical and Chemical Signal Gradients in Tissue Engineering

PubMed Central

Singh, Milind; Berkland, Cory

2008-01-01

From embryonic development to wound repair, concentration gradients of bioactive signaling molecules guide tissue formation and regeneration. Moreover, gradients in cellular and extracellular architecture as well as in mechanical properties are readily apparent in native tissues. Perhaps tissue engineers can take a cue from nature in attempting to regenerate tissues by incorporating gradients into engineering design strategies. Indeed, gradient-based approaches are an emerging trend in tissue engineering, standing in contrast to traditional approaches of homogeneous delivery of cells and/or growth factors using isotropic scaffolds. Gradients in tissue engineering lie at the intersection of three major paradigms in the field—biomimetic, interfacial, and functional tissue engineering—by combining physical (via biomaterial design) and chemical (with growth/differentiation factors and cell adhesion molecules) signal delivery to achieve a continuous transition in both structure and function. This review consolidates several key methodologies to generate gradients, some of which have never been employed in a tissue engineering application, and discusses strategies for incorporating these methods into tissue engineering and implant design. A key finding of this review was that two-dimensional physicochemical gradient substrates, which serve as excellent high-throughput screening tools for optimizing desired biomaterial properties, can be enhanced in the future by transitioning from two dimensions to three dimensions, which would enable studies of cell–protein–biomaterial interactions in a more native tissue–like environment. In addition, biomimetic tissue regeneration via combined delivery of graded physical and chemical signals appears to be a promising strategy for the regeneration of heterogeneous tissues and tissue interfaces. In the future, in vivo applications will shed more light on the performance of gradient-based mechanical integrity and signal delivery strategies compared to traditional tissue engineering approaches. PMID:18803499

Strategies and applications for incorporating physical and chemical signal gradients in tissue engineering.

PubMed

Singh, Milind; Berkland, Cory; Detamore, Michael S

2008-12-01

From embryonic development to wound repair, concentration gradients of bioactive signaling molecules guide tissue formation and regeneration. Moreover, gradients in cellular and extracellular architecture as well as in mechanical properties are readily apparent in native tissues. Perhaps tissue engineers can take a cue from nature in attempting to regenerate tissues by incorporating gradients into engineering design strategies. Indeed, gradient-based approaches are an emerging trend in tissue engineering, standing in contrast to traditional approaches of homogeneous delivery of cells and/or growth factors using isotropic scaffolds. Gradients in tissue engineering lie at the intersection of three major paradigms in the field-biomimetic, interfacial, and functional tissue engineering-by combining physical (via biomaterial design) and chemical (with growth/differentiation factors and cell adhesion molecules) signal delivery to achieve a continuous transition in both structure and function. This review consolidates several key methodologies to generate gradients, some of which have never been employed in a tissue engineering application, and discusses strategies for incorporating these methods into tissue engineering and implant design. A key finding of this review was that two-dimensional physicochemical gradient substrates, which serve as excellent high-throughput screening tools for optimizing desired biomaterial properties, can be enhanced in the future by transitioning from two dimensions to three dimensions, which would enable studies of cell-protein-biomaterial interactions in a more native tissue-like environment. In addition, biomimetic tissue regeneration via combined delivery of graded physical and chemical signals appears to be a promising strategy for the regeneration of heterogeneous tissues and tissue interfaces. In the future, in vivo applications will shed more light on the performance of gradient-based mechanical integrity and signal delivery strategies compared to traditional tissue engineering approaches.

Solving the optimal attention allocation problem in manual control

NASA Technical Reports Server (NTRS)

Kleinman, D. L.

1976-01-01

Within the context of the optimal control model of human response, analytic expressions for the gradients of closed-loop performance metrics with respect to human operator attention allocation are derived. These derivatives serve as the basis for a gradient algorithm that determines the optimal attention that a human should allocate among several display indicators in a steady-state manual control task. Application of the human modeling techniques are made to study the hover control task for a CH-46 VTOL flight tested by NASA.

Geometry Design Optimization of Functionally Graded Scaffolds for Bone Tissue Engineering: A Mechanobiological Approach.

PubMed

Boccaccio, Antonio; Uva, Antonio Emmanuele; Fiorentino, Michele; Mori, Giorgio; Monno, Giuseppe

2016-01-01

Functionally Graded Scaffolds (FGSs) are porous biomaterials where porosity changes in space with a specific gradient. In spite of their wide use in bone tissue engineering, possible models that relate the scaffold gradient to the mechanical and biological requirements for the regeneration of the bony tissue are currently missing. In this study we attempt to bridge the gap by developing a mechanobiology-based optimization algorithm aimed to determine the optimal graded porosity distribution in FGSs. The algorithm combines the parametric finite element model of a FGS, a computational mechano-regulation model and a numerical optimization routine. For assigned boundary and loading conditions, the algorithm builds iteratively different scaffold geometry configurations with different porosity distributions until the best microstructure geometry is reached, i.e. the geometry that allows the amount of bone formation to be maximized. We tested different porosity distribution laws, loading conditions and scaffold Young's modulus values. For each combination of these variables, the explicit equation of the porosity distribution law-i.e the law that describes the pore dimensions in function of the spatial coordinates-was determined that allows the highest amounts of bone to be generated. The results show that the loading conditions affect significantly the optimal porosity distribution. For a pure compression loading, it was found that the pore dimensions are almost constant throughout the entire scaffold and using a FGS allows the formation of amounts of bone slightly larger than those obtainable with a homogeneous porosity scaffold. For a pure shear loading, instead, FGSs allow to significantly increase the bone formation compared to a homogeneous porosity scaffolds. Although experimental data is still necessary to properly relate the mechanical/biological environment to the scaffold microstructure, this model represents an important step towards optimizing geometry of functionally graded scaffolds based on mechanobiological criteria.

The Society of Thoracic Surgeons, The Society of Cardiovascular Anesthesiologists, and The American Society of ExtraCorporeal Technology: Clinical Practice Guidelines for Cardiopulmonary Bypass--Temperature Management During Cardiopulmonary Bypass.

PubMed

Engelman, Richard; Baker, Robert A; Likosky, Donald S; Grigore, Alina; Dickinson, Timothy A; Shore-Lesserson, Linda; Hammon, John W

2015-08-01

In order to improve our understanding of the evidence-based literature supporting temperature management during adult cardiopulmonary bypass, The Society of Thoracic Surgeons, the Society of Cardiovascular Anesthesiology and the American Society of ExtraCorporeal Technology tasked the authors to conduct a review of the peer-reviewed literature, including: 1) optimal site for temperature monitoring, 2) avoidance of hyperthermia, 3) peak cooling temperature gradient and cooling rate, and 4) peak warming temperature gradient and rewarming rate. Authors adopted the American College of Cardiology/American Heart Association method for development clinical practice guidelines, and arrived at the following recommendations: No Recommendation No recommendation for a guideline is provided concerning optimal temperature for weaning from CPB due to insufficient published evidence. Copyright © 2015 The Society of Thoracic Surgeons. Published by Elsevier Inc. All rights reserved.

Comparison of SIRT and SQS for Regularized Weighted Least Squares Image Reconstruction

PubMed Central

Gregor, Jens; Fessler, Jeffrey A.

2015-01-01

Tomographic image reconstruction is often formulated as a regularized weighted least squares (RWLS) problem optimized by iterative algorithms that are either inherently algebraic or derived from a statistical point of view. This paper compares a modified version of SIRT (Simultaneous Iterative Reconstruction Technique), which is of the former type, with a version of SQS (Separable Quadratic Surrogates), which is of the latter type. We show that the two algorithms minimize the same criterion function using similar forms of preconditioned gradient descent. We present near-optimal relaxation for both based on eigenvalue bounds and include a heuristic extension for use with ordered subsets. We provide empirical evidence that SIRT and SQS converge at the same rate for all intents and purposes. For context, we compare their performance with an implementation of preconditioned conjugate gradient. The illustrative application is X-ray CT of luggage for aviation security. PMID:26478906

Preconditioning strategies for nonlinear conjugate gradient methods, based on quasi-Newton updates

NASA Astrophysics Data System (ADS)

Andrea, Caliciotti; Giovanni, Fasano; Massimo, Roma

2016-10-01

This paper reports two proposals of possible preconditioners for the Nonlinear Conjugate Gradient (NCG) method, in large scale unconstrained optimization. On one hand, the common idea of our preconditioners is inspired to L-BFGS quasi-Newton updates, on the other hand we aim at explicitly approximating in some sense the inverse of the Hessian matrix. Since we deal with large scale optimization problems, we propose matrix-free approaches where the preconditioners are built using symmetric low-rank updating formulae. Our distinctive new contributions rely on using information on the objective function collected as by-product of the NCG, at previous iterations. Broadly speaking, our first approach exploits the secant equation, in order to impose interpolation conditions on the objective function. In the second proposal we adopt and ad hoc modified-secant approach, in order to possibly guarantee some additional theoretical properties.

A Fast Gradient Method for Nonnegative Sparse Regression With Self-Dictionary

NASA Astrophysics Data System (ADS)

Gillis, Nicolas; Luce, Robert

2018-01-01

A nonnegative matrix factorization (NMF) can be computed efficiently under the separability assumption, which asserts that all the columns of the given input data matrix belong to the cone generated by a (small) subset of them. The provably most robust methods to identify these conic basis columns are based on nonnegative sparse regression and self dictionaries, and require the solution of large-scale convex optimization problems. In this paper we study a particular nonnegative sparse regression model with self dictionary. As opposed to previously proposed models, this model yields a smooth optimization problem where the sparsity is enforced through linear constraints. We show that the Euclidean projection on the polyhedron defined by these constraints can be computed efficiently, and propose a fast gradient method to solve our model. We compare our algorithm with several state-of-the-art methods on synthetic data sets and real-world hyperspectral images.

Improving the time efficiency of the Fourier synthesis method for slice selection in magnetic resonance imaging.

PubMed

Tahayori, B; Khaneja, N; Johnston, L A; Farrell, P M; Mareels, I M Y

2016-01-01

The design of slice selective pulses for magnetic resonance imaging can be cast as an optimal control problem. The Fourier synthesis method is an existing approach to solve these optimal control problems. In this method the gradient field as well as the excitation field are switched rapidly and their amplitudes are calculated based on a Fourier series expansion. Here, we provide a novel insight into the Fourier synthesis method via representing the Bloch equation in spherical coordinates. Based on the spherical Bloch equation, we propose an alternative sequence of pulses that can be used for slice selection which is more time efficient compared to the original method. Simulation results demonstrate that while the performance of both methods is approximately the same, the required time for the proposed sequence of pulses is half of the original sequence of pulses. Furthermore, the slice selectivity of both sequences of pulses changes with radio frequency field inhomogeneities in a similar way. We also introduce a measure, referred to as gradient complexity, to compare the performance of both sequences of pulses. This measure indicates that for a desired level of uniformity in the excited slice, the gradient complexity for the proposed sequence of pulses is less than the original sequence. Copyright © 2015 Associazione Italiana di Fisica Medica. Published by Elsevier Ltd. All rights reserved.

Automated Calibration For Numerical Models Of Riverflow

NASA Astrophysics Data System (ADS)

Fernandez, Betsaida; Kopmann, Rebekka; Oladyshkin, Sergey

2017-04-01

Calibration of numerical models is fundamental since the beginning of all types of hydro system modeling, to approximate the parameters that can mimic the overall system behavior. Thus, an assessment of different deterministic and stochastic optimization methods is undertaken to compare their robustness, computational feasibility, and global search capacity. Also, the uncertainty of the most suitable methods is analyzed. These optimization methods minimize the objective function that comprises synthetic measurements and simulated data. Synthetic measurement data replace the observed data set to guarantee an existing parameter solution. The input data for the objective function derivate from a hydro-morphological dynamics numerical model which represents an 180-degree bend channel. The hydro- morphological numerical model shows a high level of ill-posedness in the mathematical problem. The minimization of the objective function by different candidate methods for optimization indicates a failure in some of the gradient-based methods as Newton Conjugated and BFGS. Others reveal partial convergence, such as Nelder-Mead, Polak und Ribieri, L-BFGS-B, Truncated Newton Conjugated, and Trust-Region Newton Conjugated Gradient. Further ones indicate parameter solutions that range outside the physical limits, such as Levenberg-Marquardt and LeastSquareRoot. Moreover, there is a significant computational demand for genetic optimization methods, such as Differential Evolution and Basin-Hopping, as well as for Brute Force methods. The Deterministic Sequential Least Square Programming and the scholastic Bayes Inference theory methods present the optimal optimization results. keywords: Automated calibration of hydro-morphological dynamic numerical model, Bayesian inference theory, deterministic optimization methods.

Optimal structural design of the midship of a VLCC based on the strategy integrating SVM and GA

NASA Astrophysics Data System (ADS)

Sun, Li; Wang, Deyu

2012-03-01

In this paper a hybrid process of modeling and optimization, which integrates a support vector machine (SVM) and genetic algorithm (GA), was introduced to reduce the high time cost in structural optimization of ships. SVM, which is rooted in statistical learning theory and an approximate implementation of the method of structural risk minimization, can provide a good generalization performance in metamodeling the input-output relationship of real problems and consequently cuts down on high time cost in the analysis of real problems, such as FEM analysis. The GA, as a powerful optimization technique, possesses remarkable advantages for the problems that can hardly be optimized with common gradient-based optimization methods, which makes it suitable for optimizing models built by SVM. Based on the SVM-GA strategy, optimization of structural scantlings in the midship of a very large crude carrier (VLCC) ship was carried out according to the direct strength assessment method in common structural rules (CSR), which eventually demonstrates the high efficiency of SVM-GA in optimizing the ship structural scantlings under heavy computational complexity. The time cost of this optimization with SVM-GA has been sharply reduced, many more loops have been processed within a small amount of time and the design has been improved remarkably.

Development of gradient descent adaptive algorithms to remove common mode artifact for improvement of cardiovascular signal quality.

PubMed

Ciaccio, Edward J; Micheli-Tzanakou, Evangelia

2007-07-01

Common-mode noise degrades cardiovascular signal quality and diminishes measurement accuracy. Filtering to remove noise components in the frequency domain often distorts the signal. Two adaptive noise canceling (ANC) algorithms were tested to adjust weighted reference signals for optimal subtraction from a primary signal. Update of weight w was based upon the gradient term of the steepest descent equation: [see text], where the error epsilon is the difference between primary and weighted reference signals. nabla was estimated from Deltaepsilon(2) and Deltaw without using a variable Deltaw in the denominator which can cause instability. The Parallel Comparison (PC) algorithm computed Deltaepsilon(2) using fixed finite differences +/- Deltaw in parallel during each discrete time k. The ALOPEX algorithm computed Deltaepsilon(2)x Deltaw from time k to k + 1 to estimate nabla, with a random number added to account for Deltaepsilon(2) . Deltaw--> 0 near the optimal weighting. Using simulated data, both algorithms stably converged to the optimal weighting within 50-2000 discrete sample points k even with a SNR = 1:8 and weights which were initialized far from the optimal. Using a sharply pulsatile cardiac electrogram signal with added noise so that the SNR = 1:5, both algorithms exhibited stable convergence within 100 ms (100 sample points). Fourier spectral analysis revealed minimal distortion when comparing the signal without added noise to the ANC restored signal. ANC algorithms based upon difference calculations can rapidly and stably converge to the optimal weighting in simulated and real cardiovascular data. Signal quality is restored with minimal distortion, increasing the accuracy of biophysical measurement.

New approaches to optimization in aerospace conceptual design

NASA Technical Reports Server (NTRS)

Gage, Peter J.

1995-01-01

Aerospace design can be viewed as an optimization process, but conceptual studies are rarely performed using formal search algorithms. Three issues that restrict the success of automatic search are identified in this work. New approaches are introduced to address the integration of analyses and optimizers, to avoid the need for accurate gradient information and a smooth search space (required for calculus-based optimization), and to remove the restrictions imposed by fixed complexity problem formulations. (1) Optimization should be performed in a flexible environment. A quasi-procedural architecture is used to conveniently link analysis modules and automatically coordinate their execution. It efficiently controls a large-scale design tasks. (2) Genetic algorithms provide a search method for discontinuous or noisy domains. The utility of genetic optimization is demonstrated here, but parameter encodings and constraint-handling schemes must be carefully chosen to avoid premature convergence to suboptimal designs. The relationship between genetic and calculus-based methods is explored. (3) A variable-complexity genetic algorithm is created to permit flexible parameterization, so that the level of description can change during optimization. This new optimizer automatically discovers novel designs in structural and aerodynamic tasks.

Non-Darcy flow of water-based carbon nanotubes with nonlinear radiation and heat generation/absorption

NASA Astrophysics Data System (ADS)

Hayat, T.; Ullah, Siraj; Khan, M. Ijaz; Alsaedi, A.; Zaigham Zia, Q. M.

2018-03-01

Here modeling and computations are presented to introduce the novel concept of Darcy-Forchheimer three-dimensional flow of water-based carbon nanotubes with nonlinear thermal radiation and heat generation/absorption. Bidirectional stretching surface induces the flow. Darcy's law is commonly replace by Forchheimer relation. Xue model is implemented for nonliquid transport mechanism. Nonlinear formulation based upon conservation laws of mass, momentum and energy is first modeled and then solved by optimal homotopy analysis technique. Optimal estimations of auxiliary variables are obtained. Importance of influential variables on the velocity and thermal fields is interpreted graphically. Moreover velocity and temperature gradients are discussed and analyzed. Physical interpretation of influential variables is examined.

Shape optimization using a NURBS-based interface-enriched generalized FEM

DOE PAGES

Najafi, Ahmad R.; Safdari, Masoud; Tortorelli, Daniel A.; ...

2016-11-26

This study presents a gradient-based shape optimization over a fixed mesh using a non-uniform rational B-splines-based interface-enriched generalized finite element method, applicable to multi-material structures. In the proposed method, non-uniform rational B-splines are used to parameterize the design geometry precisely and compactly by a small number of design variables. An analytical shape sensitivity analysis is developed to compute derivatives of the objective and constraint functions with respect to the design variables. Subtle but important new terms involve the sensitivity of shape functions and their spatial derivatives. As a result, verification and illustrative problems are solved to demonstrate the precision andmore » capability of the method.« less

Quantitative structure-retention relationships applied to development of liquid chromatography gradient-elution method for the separation of sartans.

PubMed

Golubović, Jelena; Protić, Ana; Otašević, Biljana; Zečević, Mira

2016-04-01

QSRR are mathematically derived relationships between the chromatographic parameters determined for a representative series of analytes in given separation systems and the molecular descriptors accounting for the structural differences among the investigated analytes. Artificial neural network is a technique of data analysis, which sets out to emulate the human brain's way of working. The aim of the present work was to optimize separation of six angiotensin receptor antagonists, so-called sartans: losartan, valsartan, irbesartan, telmisartan, candesartan cilexetil and eprosartan in a gradient-elution HPLC method. For this purpose, ANN as a mathematical tool was used for establishing a QSRR model based on molecular descriptors of sartans and varied instrumental conditions. The optimized model can be further used for prediction of an external congener of sartans and analysis of the influence of the analyte structure, represented through molecular descriptors, on retention behaviour. Molecular descriptors included in modelling were electrostatic, geometrical and quantum-chemical descriptors: connolly solvent excluded volume non-1,4 van der Waals energy, octanol/water distribution coefficient, polarizability, number of proton-donor sites and number of proton-acceptor sites. Varied instrumental conditions were gradient time, buffer pH and buffer molarity. High prediction ability of the optimized network enabled complete separation of the analytes within the run time of 15.5 min under following conditions: gradient time of 12.5 min, buffer pH of 3.95 and buffer molarity of 25 mM. Applied methodology showed the potential to predict retention behaviour of an external analyte with the properties within the training space. Connolly solvent excluded volume, polarizability and number of proton-acceptor sites appeared to be most influential paramateres on retention behaviour of the sartans. Copyright © 2015 Elsevier B.V. All rights reserved.

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

PubMed

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.

Optimal Disturbances in Boundary Layers Subject to Streamwise Pressure Gradient

NASA Technical Reports Server (NTRS)

Tumin, Anatoli; Ashpis, David E.

2003-01-01

Laminar-turbulent transition in shear flows is still an enigma in the area of fluid mechanics. The conventional explanation of the phenomenon is based on the instability of the shear flow with respect to infinitesimal disturbances. The conventional hydrodynamic stability theory deals with the analysis of normal modes that might be unstable. The latter circumstance is accompanied by an exponential growth of the disturbances that might lead to laminar-turbulent transition. Nevertheless, in many cases, the transition scenario bypasses the exponential growth stage associated with the normal modes. This type of transition is called bypass transition. An understanding of the phenomenon has eluded us to this day. One possibility is that bypass transition is associated with so-called algebraic (non-modal) growth of disturbances in shear flows. In the present work, an analysis of the optimal disturbances/streamwise vortices associated with the transient growth mechanism is performed for boundary layers in the presence of a streamwise pressure gradient. The theory will provide the optimal spacing of the control elements in the spanwise direction and their placement in the streamwise direction.

An interior-point method for total variation regularized positron emission tomography image reconstruction

NASA Astrophysics Data System (ADS)

Bai, Bing

2012-03-01

There has been a lot of work on total variation (TV) regularized tomographic image reconstruction recently. Many of them use gradient-based optimization algorithms with a differentiable approximation of the TV functional. In this paper we apply TV regularization in Positron Emission Tomography (PET) image reconstruction. We reconstruct the PET image in a Bayesian framework, using Poisson noise model and TV prior functional. The original optimization problem is transformed to an equivalent problem with inequality constraints by adding auxiliary variables. Then we use an interior point method with logarithmic barrier functions to solve the constrained optimization problem. In this method, a series of points approaching the solution from inside the feasible region are found by solving a sequence of subproblems characterized by an increasing positive parameter. We use preconditioned conjugate gradient (PCG) algorithm to solve the subproblems directly. The nonnegativity constraint is enforced by bend line search. The exact expression of the TV functional is used in our calculations. Simulation results show that the algorithm converges fast and the convergence is insensitive to the values of the regularization and reconstruction parameters.

Optimality and inference in hydrology from entropy production considerations: synthetic hillslope numerical experiments

NASA Astrophysics Data System (ADS)

Kollet, S. J.

2015-05-01

In this study, entropy production optimization and inference principles are applied to a synthetic semi-arid hillslope in high-resolution, physics-based simulations. The results suggest that entropy or power is indeed maximized, because of the strong nonlinearity of variably saturated flow and competing processes related to soil moisture fluxes, the depletion of gradients, and the movement of a free water table. Thus, it appears that the maximum entropy production (MEP) principle may indeed be applicable to hydrologic systems. In the application to hydrologic system, the free water table constitutes an important degree of freedom in the optimization of entropy production and may also relate the theory to actual observations. In an ensuing analysis, an attempt is made to transfer the complex, "microscopic" hillslope model into a macroscopic model of reduced complexity using the MEP principle as an interference tool to obtain effective conductance coefficients and forces/gradients. The results demonstrate a new approach for the application of MEP to hydrologic systems and may form the basis for fruitful discussions and research in future.

Towards computational materials design from first principles using alchemical changes and derivatives.

DOE Office of Scientific and Technical Information (OSTI.GOV)

von Lilienfeld-Toal, Otto Anatole

2010-11-01

The design of new materials with specific physical, chemical, or biological properties is a central goal of much research in materials and medicinal sciences. Except for the simplest and most restricted cases brute-force computational screening of all possible compounds for interesting properties is beyond any current capacity due to the combinatorial nature of chemical compound space (set of stoichiometries and configurations). Consequently, when it comes to computationally optimizing more complex systems, reliable optimization algorithms must not only trade-off sufficient accuracy and computational speed of the models involved, they must also aim for rapid convergence in terms of number of compoundsmore » 'visited'. I will give an overview on recent progress on alchemical first principles paths and gradients in compound space that appear to be promising ingredients for more efficient property optimizations. Specifically, based on molecular grand canonical density functional theory an approach will be presented for the construction of high-dimensional yet analytical property gradients in chemical compound space. Thereafter, applications to molecular HOMO eigenvalues, catalyst design, and other problems and systems shall be discussed.« less

Performance seeking control excitation mode

NASA Technical Reports Server (NTRS)

Schkolnik, Gerard

1995-01-01

Flight testing of the performance seeking control (PSC) excitation mode was successfully completed at NASA Dryden on the F-15 highly integrated digital electronic control (HIDEC) aircraft. Although the excitation mode was not one of the original objectives of the PSC program, it was rapidly prototyped and implemented into the architecture of the PSC algorithm, allowing valuable and timely research data to be gathered. The primary flight test objective was to investigate the feasibility of a future measurement-based performance optimization algorithm. This future algorithm, called AdAPT, which stands for adaptive aircraft performance technology, generates and applies excitation inputs to selected control effectors. Fourier transformations are used to convert measured response and control effector data into frequency domain models which are mapped into state space models using multiterm frequency matching. Formal optimization principles are applied to produce an integrated, performance optimal effector suite. The key technical challenge of the measurement-based approach is the identification of the gradient of the performance index to the selected control effector. This concern was addressed by the excitation mode flight test. The AdAPT feasibility study utilized the PSC excitation mode to apply separate sinusoidal excitation trims to the controls - one aircraft, inlet first ramp (cowl), and one engine, throat area. Aircraft control and response data were recorded using on-board instrumentation and analyzed post-flight. Sensor noise characteristics, axial acceleration performance gradients, and repeatability were determined. Results were compared to pilot comments to assess the ride quality. Flight test results indicate that performance gradients were identified at all flight conditions, sensor noise levels were acceptable at the frequencies of interest, and excitations were generally not sensed by the pilot.

Towards an Optimal Gradient-dependent Energy Functional of the PZ-SIC Form

DOE PAGES

Jónsson, Elvar Örn; Lehtola, Susi; Jónsson, Hannes

2015-06-01

Results of Perdew–Zunger self-interaction corrected (PZ-SIC) density functional theory calculations of the atomization energy of 35 molecules are compared to those of high-level quantum chemistry calculations. While the PBE functional, which is commonly used in calculations of condensed matter, is known to predict on average too high atomization energy (overbinding of the molecules), the application of PZ-SIC gives a large overcorrection and leads to significant underestimation of the atomization energy. The exchange enhancement factor that is optimal for the generalized gradient approximation within the Kohn-Sham (KS) approach may not be optimal for the self-interaction corrected functional. The PBEsol functional, wheremore » the exchange enhancement factor was optimized for solids, gives poor results for molecules in KS but turns out to work better than PBE in PZ-SIC calculations. The exchange enhancement is weaker in PBEsol and the functional is closer to the local density approximation. Furthermore, the drop in the exchange enhancement factor for increasing reduced gradient in the PW91 functional gives more accurate results than the plateaued enhancement in the PBE functional. A step towards an optimal exchange enhancement factor for a gradient dependent functional of the PZ-SIC form is taken by constructing an exchange enhancement factor that mimics PBEsol for small values of the reduced gradient, and PW91 for large values. The average atomization energy is then in closer agreement with the high-level quantum chemistry calculations, but the variance is still large, the F 2 molecule being a notable outlier.« less

Particle Swarm Optimization

NASA Technical Reports Server (NTRS)

Venter, Gerhard; Sobieszczanski-Sobieski Jaroslaw

2002-01-01

The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.

Accelerating atomic structure search with cluster regularization

NASA Astrophysics Data System (ADS)

Sørensen, K. H.; Jørgensen, M. S.; Bruix, A.; Hammer, B.

2018-06-01

We present a method for accelerating the global structure optimization of atomic compounds. The method is demonstrated to speed up the finding of the anatase TiO2(001)-(1 × 4) surface reconstruction within a density functional tight-binding theory framework using an evolutionary algorithm. As a key element of the method, we use unsupervised machine learning techniques to categorize atoms present in a diverse set of partially disordered surface structures into clusters of atoms having similar local atomic environments. Analysis of more than 1000 different structures shows that the total energy of the structures correlates with the summed distances of the atomic environments to their respective cluster centers in feature space, where the sum runs over all atoms in each structure. Our method is formulated as a gradient based minimization of this summed cluster distance for a given structure and alternates with a standard gradient based energy minimization. While the latter minimization ensures local relaxation within a given energy basin, the former enables escapes from meta-stable basins and hence increases the overall performance of the global optimization.

Optimized operation of dielectric laser accelerators: Single bunch

NASA Astrophysics Data System (ADS)

Hanuka, Adi; Schächter, Levi

2018-05-01

We introduce a general approach to determine the optimal charge, efficiency and gradient for laser driven accelerators in a self-consistent way. We propose a way to enhance the operational gradient of dielectric laser accelerators by leverage of beam-loading effect. While the latter may be detrimental from the perspective of the effective gradient experienced by the particles, it can be beneficial as the effective field experienced by the accelerating structure, is weaker. As a result, the constraint imposed by the damage threshold fluence is accordingly weakened and our self-consistent approach predicts permissible gradients of ˜10 GV /m , one order of magnitude higher than previously reported experimental results—with unbunched pulse of electrons. Our approach leads to maximum efficiency to occur for higher gradients as compared with a scenario in which the beam-loading effect on the material is ignored. In any case, maximum gradient does not occur for the same conditions that maximum efficiency does—a trade-off set of parameters is suggested.

Microfluidic Synthesis of Composite Cross-Gradient Materials for Investigating Cell–Biomaterial Interactions

PubMed Central

He, Jiankang; Du, Yanan; Guo, Yuqi; Hancock, Matthew J.; Wang, Ben; Shin, Hyeongho; Wu, Jinhui; Li, Dichen; Khademhosseini, Ali

2010-01-01

Combinatorial material synthesis is a powerful approach for creating composite material libraries for the high-throughput screening of cell–material interactions. Although current combinatorial screening platforms have been tremendously successful in identifying target (termed “hit”) materials from composite material libraries, new material synthesis approaches are needed to further optimize the concentrations and blending ratios of the component materials. Here we employed a microfluidic platform to rapidly synthesize composite materials containing cross-gradients of gelatin and chitosan for investigating cell–biomaterial interactions. The microfluidic synthesis of the cross-gradient was optimized experimentally and theoretically to produce quantitatively controllable variations in the concentrations and blending ratios of the two components. The anisotropic chemical compositions of the gelatin/chitosan cross-gradients were characterized by Fourier transform infrared spectrometry and X-ray photoelectron spectrometry. The three-dimensional (3D) porous gelatin/chitosan cross-gradient materials were shown to regulate the cellular morphology and proliferation of smooth muscle cells (SMCs) in a gradient-dependent manner. We envision that our microfluidic cross-gradient platform may accelerate the material development processes involved in a wide range of biomedical applications. PMID:20721897

Stan : A Probabilistic Programming Language

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carpenter, Bob; Gelman, Andrew; Hoffman, Matthew D.

Stan is a probabilistic programming language for specifying statistical models. A Stan program imperatively defines a log probability function over parameters conditioned on specified data and constants. As of version 2.14.0, Stan provides full Bayesian inference for continuous-variable models through Markov chain Monte Carlo methods such as the No-U-Turn sampler, an adaptive form of Hamiltonian Monte Carlo sampling. Penalized maximum likelihood estimates are calculated using optimization methods such as the limited memory Broyden-Fletcher-Goldfarb-Shanno algorithm. Stan is also a platform for computing log densities and their gradients and Hessians, which can be used in alternative algorithms such as variational Bayes, expectationmore » propagation, and marginal inference using approximate integration. To this end, Stan is set up so that the densities, gradients, and Hessians, along with intermediate quantities of the algorithm such as acceptance probabilities, are easily accessible. Stan can also be called from the command line using the cmdstan package, through R using the rstan package, and through Python using the pystan package. All three interfaces support sampling and optimization-based inference with diagnostics and posterior analysis. rstan and pystan also provide access to log probabilities, gradients, Hessians, parameter transforms, and specialized plotting.« less

Stan : A Probabilistic Programming Language

DOE PAGES

Carpenter, Bob; Gelman, Andrew; Hoffman, Matthew D.; ...

2017-01-01

Stan is a probabilistic programming language for specifying statistical models. A Stan program imperatively defines a log probability function over parameters conditioned on specified data and constants. As of version 2.14.0, Stan provides full Bayesian inference for continuous-variable models through Markov chain Monte Carlo methods such as the No-U-Turn sampler, an adaptive form of Hamiltonian Monte Carlo sampling. Penalized maximum likelihood estimates are calculated using optimization methods such as the limited memory Broyden-Fletcher-Goldfarb-Shanno algorithm. Stan is also a platform for computing log densities and their gradients and Hessians, which can be used in alternative algorithms such as variational Bayes, expectationmore » propagation, and marginal inference using approximate integration. To this end, Stan is set up so that the densities, gradients, and Hessians, along with intermediate quantities of the algorithm such as acceptance probabilities, are easily accessible. Stan can also be called from the command line using the cmdstan package, through R using the rstan package, and through Python using the pystan package. All three interfaces support sampling and optimization-based inference with diagnostics and posterior analysis. rstan and pystan also provide access to log probabilities, gradients, Hessians, parameter transforms, and specialized plotting.« less

Topology optimization of hyperelastic structures using a level set method

NASA Astrophysics Data System (ADS)

Chen, Feifei; Wang, Yiqiang; Wang, Michael Yu; Zhang, Y. F.

2017-12-01

Soft rubberlike materials, due to their inherent compliance, are finding widespread implementation in a variety of applications ranging from assistive wearable technologies to soft material robots. Structural design of such soft and rubbery materials necessitates the consideration of large nonlinear deformations and hyperelastic material models to accurately predict their mechanical behaviour. In this paper, we present an effective level set-based topology optimization method for the design of hyperelastic structures that undergo large deformations. The method incorporates both geometric and material nonlinearities where the strain and stress measures are defined within the total Lagrange framework and the hyperelasticity is characterized by the widely-adopted Mooney-Rivlin material model. A shape sensitivity analysis is carried out, in the strict sense of the material derivative, where the high-order terms involving the displacement gradient are retained to ensure the descent direction. As the design velocity enters into the shape derivative in terms of its gradient and divergence terms, we develop a discrete velocity selection strategy. The whole optimization implementation undergoes a two-step process, where the linear optimization is first performed and its optimized solution serves as the initial design for the subsequent nonlinear optimization. It turns out that this operation could efficiently alleviate the numerical instability and facilitate the optimization process. To demonstrate the validity and effectiveness of the proposed method, three compliance minimization problems are studied and their optimized solutions present significant mechanical benefits of incorporating the nonlinearities, in terms of remarkable enhancement in not only the structural stiffness but also the critical buckling load.

Statistical Mechanics of the Delayed Reward-Based Learning with Node Perturbation

NASA Astrophysics Data System (ADS)

Hiroshi Saito,; Kentaro Katahira,; Kazuo Okanoya,; Masato Okada,

2010-06-01

In reward-based learning, reward is typically given with some delay after a behavior that causes the reward. In machine learning literature, the framework of the eligibility trace has been used as one of the solutions to handle the delayed reward in reinforcement learning. In recent studies, the eligibility trace is implied to be important for difficult neuroscience problem known as the “distal reward problem”. Node perturbation is one of the stochastic gradient methods from among many kinds of reinforcement learning implementations, and it searches the approximate gradient by introducing perturbation to a network. Since the stochastic gradient method does not require a objective function differential, it is expected to be able to account for the learning mechanism of a complex system, like a brain. We study the node perturbation with the eligibility trace as a specific example of delayed reward-based learning, and analyzed it using a statistical mechanics approach. As a result, we show the optimal time constant of the eligibility trace respect to the reward delay and the existence of unlearnable parameter configurations.

Multimodel methods for optimal control of aeroacoustics.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Guoquan; Collis, Samuel Scott

2005-01-01

A new multidomain/multiphysics computational framework for optimal control of aeroacoustic noise has been developed based on a near-field compressible Navier-Stokes solver coupled with a far-field linearized Euler solver both based on a discontinuous Galerkin formulation. In this approach, the coupling of near- and far-field domains is achieved by weakly enforcing continuity of normal fluxes across a coupling surface that encloses all nonlinearities and noise sources. For optimal control, gradient information is obtained by the solution of an appropriate adjoint problem that involves the propagation of adjoint information from the far-field to the near-field. This computational framework has been successfully appliedmore » to study optimal boundary-control of blade-vortex interaction, which is a significant noise source for helicopters on approach to landing. In the model-problem presented here, the noise propagated toward the ground is reduced by 12dB.« less

An automated approach to magnetic divertor configuration design

NASA Astrophysics Data System (ADS)

Blommaert, M.; Dekeyser, W.; Baelmans, M.; Gauger, N. R.; Reiter, D.

2015-01-01

Automated methods based on optimization can greatly assist computational engineering design in many areas. In this paper an optimization approach to the magnetic design of a nuclear fusion reactor divertor is proposed and applied to a tokamak edge magnetic configuration in a first feasibility study. The approach is based on reduced models for magnetic field and plasma edge, which are integrated with a grid generator into one sensitivity code. The design objective chosen here for demonstrative purposes is to spread the divertor target heat load as much as possible over the entire target area. Constraints on the separatrix position are introduced to eliminate physically irrelevant magnetic field configurations during the optimization cycle. A gradient projection method is used to ensure stable cost function evaluations during optimization. The concept is applied to a configuration with typical Joint European Torus (JET) parameters and it automatically provides plausible configurations with reduced heat load.

A trust region-based approach to optimize triple response systems

NASA Astrophysics Data System (ADS)

Fan, Shu-Kai S.; Fan, Chihhao; Huang, Chia-Fen

2014-05-01

This article presents a new computing procedure for the global optimization of the triple response system (TRS) where the response functions are non-convex quadratics and the input factors satisfy a radial constrained region of interest. The TRS arising from response surface modelling can be approximated using a nonlinear mathematical program that considers one primary objective function and two secondary constraint functions. An optimization algorithm named the triple response surface algorithm (TRSALG) is proposed to determine the global optimum for the non-degenerate TRS. In TRSALG, the Lagrange multipliers of the secondary functions are determined using the Hooke-Jeeves search method and the Lagrange multiplier of the radial constraint is located using the trust region method within the global optimality space. The proposed algorithm is illustrated in terms of three examples appearing in the quality-control literature. The results of TRSALG compared to a gradient-based method are also presented.

Aircraft symmetric flight optimization. [gradient techniques for supersonic aircraft control

NASA Technical Reports Server (NTRS)

Falco, M.; Kelley, H. J.

1973-01-01

Review of the development of gradient techniques and their application to aircraft optimal performance computations in the vertical plane of flight. Results obtained using the method of gradients are presented for attitude- and throttle-control programs which extremize the fuel, range, and time performance indices subject to various trajectory and control constraints, including boundedness of engine throttle control. A penalty function treatment of state inequality constraints which generally appear in aircraft performance problems is outlined. Numerical results for maximum-range, minimum-fuel, and minimum-time climb paths for a hypothetical supersonic turbojet interceptor are presented and discussed. In addition, minimum-fuel climb paths subject to various levels of ground overpressure intensity constraint are indicated for a representative supersonic transport. A variant of the Gel'fand-Tsetlin 'method of ravines' is reviewed, and two possibilities for further development of continuous gradient processes are cited - namely, a projection version of conjugate gradients and a curvilinear search.

MEMS cantilever based magnetic field gradient sensor

NASA Astrophysics Data System (ADS)

Dabsch, Alexander; Rosenberg, Christoph; Stifter, Michael; Keplinger, Franz

2017-05-01

This paper describes major contributions to a MEMS magnetic field gradient sensor. An H-shaped structure supported by four arms with two circuit paths on the surface is designed for measuring two components of the magnetic flux density and one component of the gradient. The structure is produced from silicon wafers by a dry etching process. The gold leads on the surface carry the alternating current which interacts with the magnetic field component perpendicular to the direction of the current. If the excitation frequency is near to a mechanical resonance, vibrations with an amplitude within the range of 1-103 nm are expected. Both theoretical (simulations and analytic calculations) and experimental analysis have been carried out to optimize the structures for different strength of the magnetic gradient. In the same way the impact of the coupling structure on the resonance frequency and of different operating modes to simultaneously measure two components of the flux density were tested. For measuring the local gradient of the flux density the structure was operated at the first symmetrical and the first anti-symmetrical mode. Depending on the design, flux densities of approximately 2.5 µT and gradients starting from 1 µT mm-1 can be measured.

A deterministic global optimization using smooth diagonal auxiliary functions

NASA Astrophysics Data System (ADS)

Sergeyev, Yaroslav D.; Kvasov, Dmitri E.

2015-04-01

In many practical decision-making problems it happens that functions involved in optimization process are black-box with unknown analytical representations and hard to evaluate. In this paper, a global optimization problem is considered where both the goal function f (x) and its gradient f‧ (x) are black-box functions. It is supposed that f‧ (x) satisfies the Lipschitz condition over the search hyperinterval with an unknown Lipschitz constant K. A new deterministic 'Divide-the-Best' algorithm based on efficient diagonal partitions and smooth auxiliary functions is proposed in its basic version, its convergence conditions are studied and numerical experiments executed on eight hundred test functions are presented.

A feasible DY conjugate gradient method for linear equality constraints

NASA Astrophysics Data System (ADS)

LI, Can

2017-09-01

In this paper, we propose a feasible conjugate gradient method for solving linear equality constrained optimization problem. The method is an extension of the Dai-Yuan conjugate gradient method proposed by Dai and Yuan to linear equality constrained optimization problem. It can be applied to solve large linear equality constrained problem due to lower storage requirement. An attractive property of the method is that the generated direction is always feasible and descent direction. Under mild conditions, the global convergence of the proposed method with exact line search is established. Numerical experiments are also given which show the efficiency of the method.

Thermodynamics of Gas Turbine Cycles with Analytic Derivatives in OpenMDAO

NASA Technical Reports Server (NTRS)

Gray, Justin; Chin, Jeffrey; Hearn, Tristan; Hendricks, Eric; Lavelle, Thomas; Martins, Joaquim R. R. A.

2016-01-01

A new equilibrium thermodynamics analysis tool was built based on the CEA method using the OpenMDAO framework. The new tool provides forward and adjoint analytic derivatives for use with gradient based optimization algorithms. The new tool was validated against the original CEA code to ensure an accurate analysis and the analytic derivatives were validated against finite-difference approximations. Performance comparisons between analytic and finite difference methods showed a significant speed advantage for the analytic methods. To further test the new analysis tool, a sample optimization was performed to find the optimal air-fuel equivalence ratio, , maximizing combustion temperature for a range of different pressures. Collectively, the results demonstrate the viability of the new tool to serve as the thermodynamic backbone for future work on a full propulsion modeling tool.

On the Use of CAD and Cartesian Methods for Aerodynamic Optimization

NASA Technical Reports Server (NTRS)

Nemec, M.; Aftosmis, M. J.; Pulliam, T. H.

2004-01-01

The objective for this paper is to present the development of an optimization capability for Curt3D, a Cartesian inviscid-flow analysis package. We present the construction of a new optimization framework and we focus on the following issues: 1) Component-based geometry parameterization approach using parametric-CAD models and CAPRI. A novel geometry server is introduced that addresses the issue of parallel efficiency while only sparingly consuming CAD resources; 2) The use of genetic and gradient-based algorithms for three-dimensional aerodynamic design problems. The influence of noise on the optimization methods is studied. Our goal is to create a responsive and automated framework that efficiently identifies design modifications that result in substantial performance improvements. In addition, we examine the architectural issues associated with the deployment of a CAD-based approach in a heterogeneous parallel computing environment that contains both CAD workstations and dedicated compute engines. We demonstrate the effectiveness of the framework for a design problem that features topology changes and complex geometry.

Texture mapping via optimal mass transport.

PubMed

Dominitz, Ayelet; Tannenbaum, Allen

2010-01-01

In this paper, we present a novel method for texture mapping of closed surfaces. Our method is based on the technique of optimal mass transport (also known as the "earth-mover's metric"). This is a classical problem that concerns determining the optimal way, in the sense of minimal transportation cost, of moving a pile of soil from one site to another. In our context, the resulting mapping is area preserving and minimizes angle distortion in the optimal mass sense. Indeed, we first begin with an angle-preserving mapping (which may greatly distort area) and then correct it using the mass transport procedure derived via a certain gradient flow. In order to obtain fast convergence to the optimal mapping, we incorporate a multiresolution scheme into our flow. We also use ideas from discrete exterior calculus in our computations.

Human-in-the-loop Bayesian optimization of wearable device parameters

PubMed Central

Malcolm, Philippe; Speeckaert, Jozefien; Siviy, Christoper J.; Walsh, Conor J.; Kuindersma, Scott

2017-01-01

The increasing capabilities of exoskeletons and powered prosthetics for walking assistance have paved the way for more sophisticated and individualized control strategies. In response to this opportunity, recent work on human-in-the-loop optimization has considered the problem of automatically tuning control parameters based on realtime physiological measurements. However, the common use of metabolic cost as a performance metric creates significant experimental challenges due to its long measurement times and low signal-to-noise ratio. We evaluate the use of Bayesian optimization—a family of sample-efficient, noise-tolerant, and global optimization methods—for quickly identifying near-optimal control parameters. To manage experimental complexity and provide comparisons against related work, we consider the task of minimizing metabolic cost by optimizing walking step frequencies in unaided human subjects. Compared to an existing approach based on gradient descent, Bayesian optimization identified a near-optimal step frequency with a faster time to convergence (12 minutes, p < 0.01), smaller inter-subject variability in convergence time (± 2 minutes, p < 0.01), and lower overall energy expenditure (p < 0.01). PMID:28926613

Arbitrary magnetic field gradient waveform correction using an impulse response based pre-equalization technique.

PubMed

Goora, Frédéric G; Colpitts, Bruce G; Balcom, Bruce J

2014-01-01

The time-varying magnetic fields used in magnetic resonance applications result in the induction of eddy currents on conductive structures in the vicinity of both the sample under investigation and the gradient coils. These eddy currents typically result in undesired degradations of image quality for MRI applications. Their ubiquitous nature has resulted in the development of various approaches to characterize and minimize their impact on image quality. This paper outlines a method that utilizes the magnetic field gradient waveform monitor method to directly measure the temporal evolution of the magnetic field gradient from a step-like input function and extracts the system impulse response. With the basic assumption that the gradient system is sufficiently linear and time invariant to permit system theory analysis, the impulse response is used to determine a pre-equalized (optimized) input waveform that provides a desired gradient response at the output of the system. An algorithm has been developed that calculates a pre-equalized waveform that may be accurately reproduced by the amplifier (is physically realizable) and accounts for system limitations including system bandwidth, amplifier slew rate capabilities, and noise inherent in the initial measurement. Significant improvements in magnetic field gradient waveform fidelity after pre-equalization have been realized and are summarized. Copyright © 2013 Elsevier Inc. All rights reserved.

A blind deconvolution method based on L1/L2 regularization prior in the gradient space

NASA Astrophysics Data System (ADS)

Cai, Ying; Shi, Yu; Hua, Xia

2018-02-01

In the process of image restoration, the result of image restoration is very different from the real image because of the existence of noise, in order to solve the ill posed problem in image restoration, a blind deconvolution method based on L1/L2 regularization prior to gradient domain is proposed. The method presented in this paper first adds a function to the prior knowledge, which is the ratio of the L1 norm to the L2 norm, and takes the function as the penalty term in the high frequency domain of the image. Then, the function is iteratively updated, and the iterative shrinkage threshold algorithm is applied to solve the high frequency image. In this paper, it is considered that the information in the gradient domain is better for the estimation of blur kernel, so the blur kernel is estimated in the gradient domain. This problem can be quickly implemented in the frequency domain by fast Fast Fourier Transform. In addition, in order to improve the effectiveness of the algorithm, we have added a multi-scale iterative optimization method. This paper proposes the blind deconvolution method based on L1/L2 regularization priors in the gradient space can obtain the unique and stable solution in the process of image restoration, which not only keeps the edges and details of the image, but also ensures the accuracy of the results.

Deterministic Design Optimization of Structures in OpenMDAO Framework

NASA Technical Reports Server (NTRS)

Coroneos, Rula M.; Pai, Shantaram S.

2012-01-01

Nonlinear programming algorithms play an important role in structural design optimization. Several such algorithms have been implemented in OpenMDAO framework developed at NASA Glenn Research Center (GRC). OpenMDAO is an open source engineering analysis framework, written in Python, for analyzing and solving Multi-Disciplinary Analysis and Optimization (MDAO) problems. It provides a number of solvers and optimizers, referred to as components and drivers, which users can leverage to build new tools and processes quickly and efficiently. Users may download, use, modify, and distribute the OpenMDAO software at no cost. This paper summarizes the process involved in analyzing and optimizing structural components by utilizing the framework s structural solvers and several gradient based optimizers along with a multi-objective genetic algorithm. For comparison purposes, the same structural components were analyzed and optimized using CometBoards, a NASA GRC developed code. The reliability and efficiency of the OpenMDAO framework was compared and reported in this report.

Spatial frequency performance limitations of radiation dose optimization and beam positioning

NASA Astrophysics Data System (ADS)

Stewart, James M. P.; Stapleton, Shawn; Chaudary, Naz; Lindsay, Patricia E.; Jaffray, David A.

2018-06-01

The flexibility and sophistication of modern radiotherapy treatment planning and delivery methods have advanced techniques to improve the therapeutic ratio. Contemporary dose optimization and calculation algorithms facilitate radiotherapy plans which closely conform the three-dimensional dose distribution to the target, with beam shaping devices and image guided field targeting ensuring the fidelity and accuracy of treatment delivery. Ultimately, dose distribution conformity is limited by the maximum deliverable dose gradient; shallow dose gradients challenge techniques to deliver a tumoricidal radiation dose while minimizing dose to surrounding tissue. In this work, this ‘dose delivery resolution’ observation is rigorously formalized for a general dose delivery model based on the superposition of dose kernel primitives. It is proven that the spatial resolution of a delivered dose is bounded by the spatial frequency content of the underlying dose kernel, which in turn defines a lower bound in the minimization of a dose optimization objective function. In addition, it is shown that this optimization is penalized by a dose deposition strategy which enforces a constant relative phase (or constant spacing) between individual radiation beams. These results are further refined to provide a direct, analytic method to estimate the dose distribution arising from the minimization of such an optimization function. The efficacy of the overall framework is demonstrated on an image guided small animal microirradiator for a set of two-dimensional hypoxia guided dose prescriptions.

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

PubMed

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.

Cooperative Optimal Coordination for Distributed Energy Resources

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yang, Tao; Wu, Di; Ren, Wei

In this paper, we consider the optimal coordination problem for distributed energy resources (DERs) including distributed generators and energy storage devices. We propose an algorithm based on the push-sum and gradient method to optimally coordinate storage devices and distributed generators in a distributed manner. In the proposed algorithm, each DER only maintains a set of variables and updates them through information exchange with a few neighbors over a time-varying directed communication network. We show that the proposed distributed algorithm solves the optimal DER coordination problem if the time-varying directed communication network is uniformly jointly strongly connected, which is a mildmore » condition on the connectivity of communication topologies. The proposed distributed algorithm is illustrated and validated by numerical simulations.« less

Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis :

DOE Office of Scientific and Technical Information (OSTI.GOV)

Adams, Brian M.; Ebeida, Mohamed Salah; Eldred, Michael S.

The Dakota (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a exible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quanti cation with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components requiredmore » for iterative systems analyses, the Dakota toolkit provides a exible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a user's manual for the Dakota software and provides capability overviews and procedures for software execution, as well as a variety of example studies.« less

Viscous Aerodynamic Shape Optimization with Installed Propulsion Effects

NASA Technical Reports Server (NTRS)

Heath, Christopher M.; Seidel, Jonathan A.; Rallabhandi, Sriram K.

2017-01-01

Aerodynamic shape optimization is demonstrated to tailor the under-track pressure signature of a conceptual low-boom supersonic aircraft. Primarily, the optimization reduces nearfield pressure waveforms induced by propulsion integration effects. For computational efficiency, gradient-based optimization is used and coupled to the discrete adjoint formulation of the Reynolds-averaged Navier Stokes equations. The engine outer nacelle, nozzle, and vertical tail fairing are axi-symmetrically parameterized, while the horizontal tail is shaped using a wing-based parameterization. Overall, 48 design variables are coupled to the geometry and used to deform the outer mold line. During the design process, an inequality drag constraint is enforced to avoid major compromise in aerodynamic performance. Linear elastic mesh morphing is used to deform volume grids between design iterations. The optimization is performed at Mach 1.6 cruise, assuming standard day altitude conditions at 51,707-ft. To reduce uncertainty, a coupled thermodynamic engine cycle model is employed that captures installed inlet performance effects on engine operation.

Medical image registration by combining global and local information: a chain-type diffeomorphic demons algorithm.

PubMed

Liu, Xiaozheng; Yuan, Zhenming; Zhu, Junming; Xu, Dongrong

2013-12-07

The demons algorithm is a popular algorithm for non-rigid image registration because of its computational efficiency and simple implementation. The deformation forces of the classic demons algorithm were derived from image gradients by considering the deformation to decrease the intensity dissimilarity between images. However, the methods using the difference of image intensity for medical image registration are easily affected by image artifacts, such as image noise, non-uniform imaging and partial volume effects. The gradient magnitude image is constructed from the local information of an image, so the difference in a gradient magnitude image can be regarded as more reliable and robust for these artifacts. Then, registering medical images by considering the differences in both image intensity and gradient magnitude is a straightforward selection. In this paper, based on a diffeomorphic demons algorithm, we propose a chain-type diffeomorphic demons algorithm by combining the differences in both image intensity and gradient magnitude for medical image registration. Previous work had shown that the classic demons algorithm can be considered as an approximation of a second order gradient descent on the sum of the squared intensity differences. By optimizing the new dissimilarity criteria, we also present a set of new demons forces which were derived from the gradients of the image and gradient magnitude image. We show that, in controlled experiments, this advantage is confirmed, and yields a fast convergence.

Experiments in Neural-Network Control of a Free-Flying Space Robot

NASA Technical Reports Server (NTRS)

Wilson, Edward

1995-01-01

Four important generic issues are identified and addressed in some depth in this thesis as part of the development of an adaptive neural network based control system for an experimental free flying space robot prototype. The first issue concerns the importance of true system level design of the control system. A new hybrid strategy is developed here, in depth, for the beneficial integration of neural networks into the total control system. A second important issue in neural network control concerns incorporating a priori knowledge into the neural network. In many applications, it is possible to get a reasonably accurate controller using conventional means. If this prior information is used purposefully to provide a starting point for the optimizing capabilities of the neural network, it can provide much faster initial learning. In a step towards addressing this issue, a new generic Fully Connected Architecture (FCA) is developed for use with backpropagation. A third issue is that neural networks are commonly trained using a gradient based optimization method such as backpropagation; but many real world systems have Discrete Valued Functions (DVFs) that do not permit gradient based optimization. One example is the on-off thrusters that are common on spacecraft. A new technique is developed here that now extends backpropagation learning for use with DVFs. The fourth issue is that the speed of adaptation is often a limiting factor in the implementation of a neural network control system. This issue has been strongly resolved in the research by drawing on the above new contributions.

Direct Electrospray Printing of Gradient Refractive Index Chalcogenide Glass Films.

PubMed

Novak, Spencer; Lin, Pao Tai; Li, Cheng; Lumdee, Chatdanai; Hu, Juejun; Agarwal, Anuradha; Kik, Pieter G; Deng, Weiwei; Richardson, Kathleen

2017-08-16

A spatially varying effective refractive index gradient using chalcogenide glass layers is printed on a silicon wafer using an optimized electrospray (ES) deposition process. Using solution-derived glass precursors, IR-transparent Ge 23 Sb 7 S 70 and As 40 S 60 glass films of programmed thickness are fabricated to yield a bilayer structure, resulting in an effective gradient refractive index (GRIN) film. Optical and compositional analysis tools confirm the optical and physical nature of the gradient in the resulting high-optical-quality films, demonstrating the power of direct printing of multimaterial structures compatible with planar photonic fabrication protocols. The potential application of such tailorable materials and structures as they relate to the enhancement of sensitivity in chalcogenide glass based planar chemical sensor device design is presented. This method, applicable to a broad cross section of glass compositions, shows promise in directly depositing GRIN films with tunable refractive index profiles for bulk and planar optical components and devices.

Elimination of Hot Tears in Steel Castings by Means of Solidification Pattern Optimization

NASA Astrophysics Data System (ADS)

Kotas, Petr; Tutum, Cem Celal; Thorborg, Jesper; Hattel, Jesper Henri

2012-06-01

A methodology of how to exploit the Niyama criterion for the elimination of various defects such as centerline porosity, macrosegregation, and hot tearing in steel castings is presented. The tendency of forming centerline porosity is governed by the temperature distribution close to the end of the solidification interval, specifically by thermal gradients and cooling rates. The physics behind macrosegregation and hot tears indicate that these two defects also are dependent heavily on thermal gradients and pressure drop in the mushy zone. The objective of this work is to show that by optimizing the solidification pattern, i.e., establishing directional and progressive solidification with the help of the Niyama criterion, macrosegregation and hot tearing issues can be both minimized or eliminated entirely. An original casting layout was simulated using a transient three-dimensional (3-D) thermal fluid model incorporated in a commercial simulation software package to determine potential flaws and inadequacies. Based on the initial casting process assessment, multiobjective optimization of the solidification pattern of the considered steel part followed. That is, the multiobjective optimization problem of choosing the proper riser and chill designs has been investigated using genetic algorithms while simultaneously considering their impact on centerline porosity, the macrosegregation pattern, and primarily on hot tear formation.

A novel recurrent neural network with finite-time convergence for linear programming.

PubMed

Liu, Qingshan; Cao, Jinde; Chen, Guanrong

2010-11-01

In this letter, a novel recurrent neural network based on the gradient method is proposed for solving linear programming problems. Finite-time convergence of the proposed neural network is proved by using the Lyapunov method. Compared with the existing neural networks for linear programming, the proposed neural network is globally convergent to exact optimal solutions in finite time, which is remarkable and rare in the literature of neural networks for optimization. Some numerical examples are given to show the effectiveness and excellent performance of the new recurrent neural network.

Large-Scale Optimization for Bayesian Inference in Complex Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Willcox, Karen; Marzouk, Youssef

2013-11-12

The SAGUARO (Scalable Algorithms for Groundwater Uncertainty Analysis and Robust Optimization) Project focused on the development of scalable numerical algorithms for large-scale Bayesian inversion in complex systems that capitalize on advances in large-scale simulation-based optimization and inversion methods. The project was a collaborative effort among MIT, the University of Texas at Austin, Georgia Institute of Technology, and Sandia National Laboratories. The research was directed in three complementary areas: efficient approximations of the Hessian operator, reductions in complexity of forward simulations via stochastic spectral approximations and model reduction, and employing large-scale optimization concepts to accelerate sampling. The MIT--Sandia component of themore » SAGUARO Project addressed the intractability of conventional sampling methods for large-scale statistical inverse problems by devising reduced-order models that are faithful to the full-order model over a wide range of parameter values; sampling then employs the reduced model rather than the full model, resulting in very large computational savings. Results indicate little effect on the computed posterior distribution. On the other hand, in the Texas--Georgia Tech component of the project, we retain the full-order model, but exploit inverse problem structure (adjoint-based gradients and partial Hessian information of the parameter-to-observation map) to implicitly extract lower dimensional information on the posterior distribution; this greatly speeds up sampling methods, so that fewer sampling points are needed. We can think of these two approaches as ``reduce then sample'' and ``sample then reduce.'' In fact, these two approaches are complementary, and can be used in conjunction with each other. Moreover, they both exploit deterministic inverse problem structure, in the form of adjoint-based gradient and Hessian information of the underlying parameter-to-observation map, to achieve their speedups.« less

Seamline Determination Based on PKGC Segmentation for Remote Sensing Image Mosaicking

PubMed Central

Dong, Qiang; Liu, Jinghong

2017-01-01

This paper presents a novel method of seamline determination for remote sensing image mosaicking. A two-level optimization strategy is applied to determine the seamline. Object-level optimization is executed firstly. Background regions (BRs) and obvious regions (ORs) are extracted based on the results of parametric kernel graph cuts (PKGC) segmentation. The global cost map which consists of color difference, a multi-scale morphological gradient (MSMG) constraint, and texture difference is weighted by BRs. Finally, the seamline is determined in the weighted cost from the start point to the end point. Dijkstra’s shortest path algorithm is adopted for pixel-level optimization to determine the positions of seamline. Meanwhile, a new seamline optimization strategy is proposed for image mosaicking with multi-image overlapping regions. The experimental results show the better performance than the conventional method based on mean-shift segmentation. Seamlines based on the proposed method bypass the obvious objects and take less time in execution. This new method is efficient and superior for seamline determination in remote sensing image mosaicking. PMID:28749446

A frozen Gaussian approximation-based multi-level particle swarm optimization for seismic inversion

DOE Office of Scientific and Technical Information (OSTI.GOV)

Li, Jinglai, E-mail: jinglaili@sjtu.edu.cn; Lin, Guang, E-mail: lin491@purdue.edu; Computational Sciences and Mathematics Division, Pacific Northwest National Laboratory, Richland, WA 99352

2015-09-01

In this paper, we propose a frozen Gaussian approximation (FGA)-based multi-level particle swarm optimization (MLPSO) method for seismic inversion of high-frequency wave data. The method addresses two challenges in it: First, the optimization problem is highly non-convex, which makes hard for gradient-based methods to reach global minima. This is tackled by MLPSO which can escape from undesired local minima. Second, the character of high-frequency of seismic waves requires a large number of grid points in direct computational methods, and thus renders an extremely high computational demand on the simulation of each sample in MLPSO. We overcome this difficulty by threemore » steps: First, we use FGA to compute high-frequency wave propagation based on asymptotic analysis on phase plane; Then we design a constrained full waveform inversion problem to prevent the optimization search getting into regions of velocity where FGA is not accurate; Last, we solve the constrained optimization problem by MLPSO that employs FGA solvers with different fidelity. The performance of the proposed method is demonstrated by a two-dimensional full-waveform inversion example of the smoothed Marmousi model.« less

Optimization of neural network architecture for classification of radar jamming FM signals

NASA Astrophysics Data System (ADS)

Soto, Alberto; Mendoza, Ariadna; Flores, Benjamin C.

2017-05-01

The purpose of this study is to investigate several artificial Neural Network (NN) architectures in order to design a cognitive radar system capable of optimally distinguishing linear Frequency-Modulated (FM) signals from bandlimited Additive White Gaussian Noise (AWGN). The goal is to create a theoretical framework to determine an optimal NN architecture to achieve a Probability of Detection (PD) of 95% or higher and a Probability of False Alarm (PFA) of 1.5% or lower at 5 dB Signal to Noise Ratio (SNR). Literature research reveals that the frequency-domain power spectral densities characterize a signal more efficiently than its time-domain counterparts. Therefore, the input data is preprocessed by calculating the magnitude square of the Discrete Fourier Transform of the digitally sampled bandlimited AWGN and linear FM signals to populate a matrix containing N number of samples and M number of spectra. This matrix is used as input for the NN, and the spectra are divided as follows: 70% for training, 15% for validation, and 15% for testing. The study begins by experimentally deducing the optimal number of hidden neurons (1-40 neurons), then the optimal number of hidden layers (1-5 layers), and lastly, the most efficient learning algorithm. The training algorithms examined are: Resilient Backpropagation, Scaled Conjugate Gradient, Conjugate Gradient with Powell/Beale Restarts, Polak-Ribiére Conjugate Gradient, and Variable Learning Rate Backpropagation. We determine that an architecture with ten hidden neurons (or higher), one hidden layer, and a Scaled Conjugate Gradient for training algorithm encapsulates an optimal architecture for our application.

Investigations into dual-grating THz-driven accelerators

NASA Astrophysics Data System (ADS)

Wei, Y.; Ischebeck, R.; Dehler, M.; Ferrari, E.; Hiller, N.; Jamison, S.; Xia, G.; Hanahoe, K.; Li, Y.; Smith, J. D. A.; Welsch, C. P.

2018-01-01

Advanced acceleration technologies are receiving considerable interest in order to miniaturize future particle accelerators. One such technology is the dual-grating dielectric structures, which can support accelerating fields one to two orders of magnitude higher than the metal RF cavities in conventional accelerators. This opens up the possibility of enabling high accelerating gradients of up to several GV/m. This paper investigates numerically a quartz dual-grating structure which is driven by THz pulses to accelerate electrons. Geometry optimizations are carried out to achieve the trade-offs between accelerating gradient and vacuum channel gap. A realistic electron bunch available from the future Compact Linear Accelerator for Research and Applications (CLARA) is loaded into an optimized 100-period dual-grating structure for a detailed wakefield study. A THz pulse is then employed to interact with this CLARA bunch in the optimized structure. The computed beam quality is analyzed in terms of emittance, energy spread and loaded accelerating gradient. The simulations show that an accelerating gradient of 348 ± 12 MV/m with an emittance growth of 3.0% can be obtained.

Improvement of the cruise performances of a wing by means of aerodynamic optimization. Validation with a Far-Field method

NASA Astrophysics Data System (ADS)

Jiménez-Varona, J.; Ponsin Roca, J.

2015-06-01

Under a contract with AIRBUS MILITARY (AI-M), an exercise to analyze the potential of optimization techniques to improve the wing performances at cruise conditions has been carried out by using an in-house design code. The original wing was provided by AI-M and several constraints were posed for the redesign. To maximize the aerodynamic efficiency at cruise, optimizations were performed using the design techniques developed internally at INTA under a research program (Programa de Termofluidodinámica). The code is a gradient-based optimizaa tion code, which uses classical finite differences approach for gradient computations. Several techniques for search direction computation are implemented for unconstrained and constrained problems. Techniques for geometry modifications are based on different approaches which include perturbation functions for the thickness and/or mean line distributions and others by Bézier curves fitting of certain degree. It is very e important to afford a real design which involves several constraints that reduce significantly the feasible design space. And the assessment of the code is needed in order to check the capabilities and the possible drawbacks. Lessons learnt will help in the development of future enhancements. In addition, the validation of the results was done using also the well-known TAU flow solver and a far-field drag method in order to determine accurately the improvement in terms of drag counts.

Optimal Control-Based Adaptive NN Design for a Class of Nonlinear Discrete-Time Block-Triangular Systems.

PubMed

Liu, Yan-Jun; Tong, Shaocheng

2016-11-01

In this paper, we propose an optimal control scheme-based adaptive neural network design for a class of unknown nonlinear discrete-time systems. The controlled systems are in a block-triangular multi-input-multi-output pure-feedback structure, i.e., there are both state and input couplings and nonaffine functions to be included in every equation of each subsystem. The design objective is to provide a control scheme, which not only guarantees the stability of the systems, but also achieves optimal control performance. The main contribution of this paper is that it is for the first time to achieve the optimal performance for such a class of systems. Owing to the interactions among subsystems, making an optimal control signal is a difficult task. The design ideas are that: 1) the systems are transformed into an output predictor form; 2) for the output predictor, the ideal control signal and the strategic utility function can be approximated by using an action network and a critic network, respectively; and 3) an optimal control signal is constructed with the weight update rules to be designed based on a gradient descent method. The stability of the systems can be proved based on the difference Lyapunov method. Finally, a numerical simulation is given to illustrate the performance of the proposed scheme.

Neural Stem Cell Differentiation Using Microfluidic Device-Generated Growth Factor Gradient.

PubMed

Kim, Ji Hyeon; Sim, Jiyeon; Kim, Hyun-Jung

2018-04-11

Neural stem cells (NSCs) have the ability to self-renew and differentiate into multiple nervous system cell types. During embryonic development, the concentrations of soluble biological molecules have a critical role in controlling cell proliferation, migration, differentiation and apoptosis. In an effort to find optimal culture conditions for the generation of desired cell types in vitro , we used a microfluidic chip-generated growth factor gradient system. In the current study, NSCs in the microfluidic device remained healthy during the entire period of cell culture, and proliferated and differentiated in response to the concentration gradient of growth factors (epithermal growth factor and basic fibroblast growth factor). We also showed that overexpression of ASCL1 in NSCs increased neuronal differentiation depending on the concentration gradient of growth factors generated in the microfluidic gradient chip. The microfluidic system allowed us to study concentration-dependent effects of growth factors within a single device, while a traditional system requires multiple independent cultures using fixed growth factor concentrations. Our study suggests that the microfluidic gradient-generating chip is a powerful tool for determining the optimal culture conditions.

Optimized phase gradient measurements and phase-amplitude interplay in optical coherence elastography

NASA Astrophysics Data System (ADS)

Zaitsev, Vladimir Y.; Matveyev, Alexander L.; Matveev, Lev A.; Gelikonov, Grigory V.; Sovetsky, Aleksandr A.; Vitkin, Alex

2016-11-01

In compressional optical coherence elastography, phase-variation gradients are used for estimating quasistatic strains created in tissue. Using reference and deformed optical coherence tomography (OCT) scans, one typically compares phases from pixels with the same coordinates in both scans. Usually, this limits the allowable strains to fairly small values < to 10-3, with the caveat that such weak phase gradients may become corrupted by stronger measurement noises. Here, we extend the OCT phase-resolved elastographic methodology by (1) showing that an order of magnitude greater strains can significantly increase the accuracy of derived phase-gradient differences, while also avoiding error-phone phase-unwrapping procedures and minimizing the influence of decorrelation noise caused by suprapixel displacements, (2) discussing the appearance of artifactual stiff inclusions in resultant OCT elastograms in the vicinity of bright scatterers due to the amplitude-phase interplay in phase-variation measurements, and (3) deriving/evaluating methods of phase-gradient estimation that can outperform conventionally used least-square gradient fitting. We present analytical arguments, numerical simulations, and experimental examples to demonstrate the advantages of the proposed optimized phase-variation methodology.

Numerical approach of collision avoidance and optimal control on robotic manipulators

NASA Technical Reports Server (NTRS)

Wang, Jyhshing Jack

1990-01-01

Collision-free optimal motion and trajectory planning for robotic manipulators are solved by a method of sequential gradient restoration algorithm. Numerical examples of a two degree-of-freedom (DOF) robotic manipulator are demonstrated to show the excellence of the optimization technique and obstacle avoidance scheme. The obstacle is put on the midway, or even further inward on purpose, of the previous no-obstacle optimal trajectory. For the minimum-time purpose, the trajectory grazes by the obstacle and the minimum-time motion successfully avoids the obstacle. The minimum-time is longer for the obstacle avoidance cases than the one without obstacle. The obstacle avoidance scheme can deal with multiple obstacles in any ellipsoid forms by using artificial potential fields as penalty functions via distance functions. The method is promising in solving collision-free optimal control problems for robotics and can be applied to any DOF robotic manipulators with any performance indices and mobile robots as well. Since this method generates optimum solution based on Pontryagin Extremum Principle, rather than based on assumptions, the results provide a benchmark against which any optimization techniques can be measured.

SEEK: A FORTRAN optimization program using a feasible directions gradient search

NASA Technical Reports Server (NTRS)

Savage, M.

1995-01-01

This report describes the use of computer program 'SEEK' which works in conjunction with two user-written subroutines and an input data file to perform an optimization procedure on a user's problem. The optimization method uses a modified feasible directions gradient technique. SEEK is written in ANSI standard Fortran 77, has an object size of about 46K bytes, and can be used on a personal computer running DOS. This report describes the use of the program and discusses the optimizing method. The program use is illustrated with four example problems: a bushing design, a helical coil spring design, a gear mesh design, and a two-parameter Weibull life-reliability curve fit.

A heuristic approach to optimization of structural topology including self-weight

NASA Astrophysics Data System (ADS)

Tajs-Zielińska, Katarzyna; Bochenek, Bogdan

2018-01-01

Topology optimization of structures under a design-dependent self-weight load is investigated in this paper. The problem deserves attention because of its significant importance in the engineering practice, especially nowadays as topology optimization is more often applied when designing large engineering structures, for example, bridges or carrying systems of tall buildings. It is worth noting that well-known approaches of topology optimization which have been successfully applied to structures under fixed loads cannot be directly adapted to the case of design-dependent loads, so that topology generation can be a challenge also for numerical algorithms. The paper presents the application of a simple but efficient non-gradient method to topology optimization of elastic structures under self-weight loading. The algorithm is based on the Cellular Automata concept, the application of which can produce effective solutions with low computational cost.

Speckle-metric-optimization-based adaptive optics for laser beam projection and coherent beam combining.

PubMed

Vorontsov, Mikhail; Weyrauch, Thomas; Lachinova, Svetlana; Gatz, Micah; Carhart, Gary

2012-07-15

Maximization of a projected laser beam's power density at a remotely located extended object (speckle target) can be achieved by using an adaptive optics (AO) technique based on sensing and optimization of the target-return speckle field's statistical characteristics, referred to here as speckle metrics (SM). SM AO was demonstrated in a target-in-the-loop coherent beam combining experiment using a bistatic laser beam projection system composed of a coherent fiber-array transmitter and a power-in-the-bucket receiver. SM sensing utilized a 50 MHz rate dithering of the projected beam that provided a stair-mode approximation of the outgoing combined beam's wavefront tip and tilt with subaperture piston phases. Fiber-integrated phase shifters were used for both the dithering and SM optimization with stochastic parallel gradient descent control.

Tunable, Flexible and Efficient Optimization of Control Pulses for Superconducting Qubits, part I - Theory

NASA Astrophysics Data System (ADS)

Machnes, Shai; AsséMat, Elie; Tannor, David; Wilhelm, Frank

Quantum computation places very stringent demands on gate fidelities, and experimental implementations require both the controls and the resultant dynamics to conform to hardware-specific ansatzes and constraints. Superconducting qubits present the additional requirement that pulses have simple parametrizations, so they can be further calibrated in the experiment, to compensate for uncertainties in system characterization. We present a novel, conceptually simple and easy-to-implement gradient-based optimal control algorithm, GOAT, which satisfies all the above requirements. In part II we shall demonstrate the algorithm's capabilities, by using GOAT to optimize fast high-accuracy pulses for two leading superconducting qubits architectures - Xmons and IBM's flux-tunable couplers.

Modularization of gradient-index optical design using wavefront matching enabled optimization.

PubMed

Nagar, Jogender; Brocker, Donovan E; Campbell, Sawyer D; Easum, John A; Werner, Douglas H

2016-05-02

This paper proposes a new design paradigm which allows for a modular approach to replacing a homogeneous optical lens system with a higher-performance GRadient-INdex (GRIN) lens system using a WaveFront Matching (WFM) method. In multi-lens GRIN systems, a full-system-optimization approach can be challenging due to the large number of design variables. The proposed WFM design paradigm enables optimization of each component independently by explicitly matching the WaveFront Error (WFE) of the original homogeneous component at the exit pupil, resulting in an efficient design procedure for complex multi-lens systems.

A method for real-time implementation of HOG feature extraction

NASA Astrophysics Data System (ADS)

Luo, Hai-bo; Yu, Xin-rong; Liu, Hong-mei; Ding, Qing-hai

2011-08-01

Histogram of oriented gradient (HOG) is an efficient feature extraction scheme, and HOG descriptors are feature descriptors which is widely used in computer vision and image processing for the purpose of biometrics, target tracking, automatic target detection(ATD) and automatic target recognition(ATR) etc. However, computation of HOG feature extraction is unsuitable for hardware implementation since it includes complicated operations. In this paper, the optimal design method and theory frame for real-time HOG feature extraction based on FPGA were proposed. The main principle is as follows: firstly, the parallel gradient computing unit circuit based on parallel pipeline structure was designed. Secondly, the calculation of arctangent and square root operation was simplified. Finally, a histogram generator based on parallel pipeline structure was designed to calculate the histogram of each sub-region. Experimental results showed that the HOG extraction can be implemented in a pixel period by these computing units.

Recent developments of axial flow compressors under transonic flow conditions

NASA Astrophysics Data System (ADS)

Srinivas, G.; Raghunandana, K.; Satish Shenoy, B.

2017-05-01

The objective of this paper is to give a holistic view of the most advanced technology and procedures that are practiced in the field of turbomachinery design. Compressor flow solver is the turbulence model used in the CFD to solve viscous problems. The popular techniques like Jameson’s rotated difference scheme was used to solve potential flow equation in transonic condition for two dimensional aero foils and later three dimensional wings. The gradient base method is also a popular method especially for compressor blade shape optimization. Various other types of optimization techniques available are Evolutionary algorithms (EAs) and Response surface methodology (RSM). It is observed that in order to improve compressor flow solver and to get agreeable results careful attention need to be paid towards viscous relations, grid resolution, turbulent modeling and artificial viscosity, in CFD. The advanced techniques like Jameson’s rotated difference had most substantial impact on wing design and aero foil. For compressor blade shape optimization, Evolutionary algorithm is quite simple than gradient based technique because it can solve the parameters simultaneously by searching from multiple points in the given design space. Response surface methodology (RSM) is a method basically used to design empirical models of the response that were observed and to study systematically the experimental data. This methodology analyses the correct relationship between expected responses (output) and design variables (input). RSM solves the function systematically in a series of mathematical and statistical processes. For turbomachinery blade optimization recently RSM has been implemented successfully. The well-designed high performance axial flow compressors finds its application in any air-breathing jet engines.

Three-dimensional desirability spaces for quality-by-design-based HPLC development.

PubMed

Mokhtar, Hatem I; Abdel-Salam, Randa A; Hadad, Ghada M

2015-04-01

In this study, three-dimensional desirability spaces were introduced as a graphical representation method of design space. This was illustrated in the context of application of quality-by-design concepts on development of a stability indicating gradient reversed-phase high-performance liquid chromatography method for the determination of vinpocetine and α-tocopheryl acetate in a capsule dosage form. A mechanistic retention model to optimize gradient time, initial organic solvent concentration and ternary solvent ratio was constructed for each compound from six experimental runs. Then, desirability function of each optimized criterion and subsequently the global desirability function were calculated throughout the knowledge space. The three-dimensional desirability spaces were plotted as zones exceeding a threshold value of desirability index in space defined by the three optimized method parameters. Probabilistic mapping of desirability index aided selection of design space within the potential desirability subspaces. Three-dimensional desirability spaces offered better visualization and potential design spaces for the method as a function of three method parameters with ability to assign priorities to this critical quality as compared with the corresponding resolution spaces. © The Author 2014. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

An optimization-based approach for solving a time-harmonic multiphysical wave problem with higher-order schemes

NASA Astrophysics Data System (ADS)

Mönkölä, Sanna

2013-06-01

This study considers developing numerical solution techniques for the computer simulations of time-harmonic fluid-structure interaction between acoustic and elastic waves. The focus is on the efficiency of an iterative solution method based on a controllability approach and spectral elements. We concentrate on the model, in which the acoustic waves in the fluid domain are modeled by using the velocity potential and the elastic waves in the structure domain are modeled by using displacement. Traditionally, the complex-valued time-harmonic equations are used for solving the time-harmonic problems. Instead of that, we focus on finding periodic solutions without solving the time-harmonic problems directly. The time-dependent equations can be simulated with respect to time until a time-harmonic solution is reached, but the approach suffers from poor convergence. To overcome this challenge, we follow the approach first suggested and developed for the acoustic wave equations by Bristeau, Glowinski, and Périaux. Thus, we accelerate the convergence rate by employing a controllability method. The problem is formulated as a least-squares optimization problem, which is solved with the conjugate gradient (CG) algorithm. Computation of the gradient of the functional is done directly for the discretized problem. A graph-based multigrid method is used for preconditioning the CG algorithm.

Design Method of Digital Optimal Control Scheme and Multiple Paralleled Bridge Type Current Amplifier for Generating Gradient Magnetic Fields in MRI Systems

NASA Astrophysics Data System (ADS)

Watanabe, Shuji; Takano, Hiroshi; Fukuda, Hiroya; Hiraki, Eiji; Nakaoka, Mutsuo

This paper deals with a digital control scheme of multiple paralleled high frequency switching current amplifier with four-quadrant chopper for generating gradient magnetic fields in MRI (Magnetic Resonance Imaging) systems. In order to track high precise current pattern in Gradient Coils (GC), the proposal current amplifier cancels the switching current ripples in GC with each other and designed optimum switching gate pulse patterns without influences of the large filter current ripple amplitude. The optimal control implementation and the linear control theory in GC current amplifiers have affinity to each other with excellent characteristics. The digital control system can be realized easily through the digital control implementation, DSPs or microprocessors. Multiple-parallel operational microprocessors realize two or higher paralleled GC current pattern tracking amplifier with optimal control design and excellent results are given for improving the image quality of MRI systems.

DOE Office of Scientific and Technical Information (OSTI.GOV)

H.E. Mynick, N. Pomphrey and P. Xanthopoulos

Recent progress in reducing turbulent transport in stellarators and tokamaks by 3D shaping using a stellarator optimization code in conjunction with a gyrokinetic code is presented. The original applications of the method focussed on ion temperature gradient transport in a quasi-axisymmetric stellarator design. Here, an examination of both other turbulence channels and other starting configurations is initiated. It is found that the designs evolved for transport from ion temperature gradient turbulence also display reduced transport from other transport channels whose modes are also stabilized by improved curvature, such as electron temperature gradient and ballooning modes. The optimizer is also appliedmore » to evolving from a tokamak, finding appreciable turbulence reduction for these devices as well. From these studies, improved understanding is obtained of why the deformations found by the optimizer are beneficial, and these deformations are related to earlier theoretical work in both stellarators and tokamaks.« less

Stochastic parallel gradient descent based adaptive optics used for a high contrast imaging coronagraph

NASA Astrophysics Data System (ADS)

Dong, Bing; Ren, De-Qing; Zhang, Xi

2011-08-01

An adaptive optics (AO) system based on a stochastic parallel gradient descent (SPGD) algorithm is proposed to reduce the speckle noises in the optical system of a stellar coronagraph in order to further improve the contrast. The principle of the SPGD algorithm is described briefly and a metric suitable for point source imaging optimization is given. The feasibility and good performance of the SPGD algorithm is demonstrated by an experimental system featured with a 140-actuator deformable mirror and a Hartmann-Shark wavefront sensor. Then the SPGD based AO is applied to a liquid crystal array (LCA) based coronagraph to improve the contrast. The LCA can modulate the incoming light to generate a pupil apodization mask of any pattern. A circular stepped pattern is used in our preliminary experiment and the image contrast shows improvement from 10-3 to 10-4.5 at an angular distance of 2λ/D after being corrected by SPGD based AO.

Artifacts Quantification of Metal Implants in MRI

NASA Astrophysics Data System (ADS)

Vrachnis, I. N.; Vlachopoulos, G. F.; Maris, T. G.; Costaridou, L. I.

2017-11-01

The presence of materials with different magnetic properties, such as metal implants, causes distortion of the magnetic field locally, resulting in signal voids and pile ups, i.e. susceptibility artifacts in MRI. Quantitative and unbiased measurement of the artifact is prerequisite for optimization of acquisition parameters. In this study an image gradient based segmentation method is proposed for susceptibility artifact quantification. The method captures abrupt signal alterations by calculation of the image gradient. Then the artifact is quantified in terms of its extent by an automated cross entropy thresholding method as image area percentage. The proposed method for artifact quantification was tested in phantoms containing two orthopedic implants with significantly different magnetic permeabilities. The method was compared against a method proposed in the literature, considered as a reference, demonstrating moderate to good correlation (Spearman’s rho = 0.62 and 0.802 in case of titanium and stainless steel implants). The automated character of the proposed quantification method seems promising towards MRI acquisition parameter optimization.

Comparison of genetic algorithms with conjugate gradient methods

NASA Technical Reports Server (NTRS)

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.

Joint design of large-tip-angle parallel RF pulses and blipped gradient trajectories.

PubMed

Cao, Zhipeng; Donahue, Manus J; Ma, Jun; Grissom, William A

2016-03-01

To design multichannel large-tip-angle kT-points and spokes radiofrequency (RF) pulses and gradient waveforms for transmit field inhomogeneity compensation in high field magnetic resonance imaging. An algorithm to design RF subpulse weights and gradient blip areas is proposed to minimize a magnitude least-squares cost function that measures the difference between realized and desired state parameters in the spin domain, and penalizes integrated RF power. The minimization problem is solved iteratively with interleaved target phase updates, RF subpulse weights updates using the conjugate gradient method with optimal control-based derivatives, and gradient blip area updates using the conjugate gradient method. Two-channel parallel transmit simulations and experiments were conducted in phantoms and human subjects at 7 T to demonstrate the method and compare it to small-tip-angle-designed pulses and circularly polarized excitations. The proposed algorithm designed more homogeneous and accurate 180° inversion and refocusing pulses than other methods. It also designed large-tip-angle pulses on multiple frequency bands with independent and joint phase relaxation. Pulses designed by the method improved specificity and contrast-to-noise ratio in a finger-tapping spin echo blood oxygen level dependent functional magnetic resonance imaging study, compared with circularly polarized mode refocusing. A joint RF and gradient waveform design algorithm was proposed and validated to improve large-tip-angle inversion and refocusing at ultrahigh field. © 2015 Wiley Periodicals, Inc.

Longitudinal gradient coils with enhanced radial uniformity in restricted diameter: Single-current and multiple-current approaches.

PubMed

Romero, Javier A; Domínguez, Gabriela A; Anoardo, Esteban

2017-03-01

An important requirement for a gradient coil is that the uniformity of the generated magnetic field gradient should be maximal within the active volume of the coil. For a cylindrical geometry, the radial uniformity of the gradient turns critic, particularly in cases where the gradient-unit has to be designed to fit into the inner bore of a compact magnet of reduced dimensions, like those typically used in fast-field-cycling NMR. In this paper we present two practical solutions aimed to fulfill this requirement. We propose a matrix-inversion optimization algorithm based on the Biot-Savart law, that using a proper cost function, allows maximizing the uniformity of the gradient and power efficiency. The used methodology and the simulation code were validated in a single-current design, by comparing the computer simulated field map with the experimental data measured in a real prototype. After comparing the obtained results with the target field approach, a multiple-element coil driven by independent current sources is discussed, and a real prototype evaluated. Opposed equispaced independent windings are connected in pairs conforming an arrangement of independent anti-Helmholtz units. This last coil seizes 80% of its radial dimension with a gradient uniformity better than 5%. The design also provides an adaptable region of uniformity along with adjustable coil efficiency. Copyright © 2017 Elsevier Inc. All rights reserved.

Analytic gradient for second order Møller-Plesset perturbation theory with the polarizable continuum model based on the fragment molecular orbital method.

PubMed

Nagata, Takeshi; Fedorov, Dmitri G; Li, Hui; Kitaura, Kazuo

2012-05-28

A new energy expression is proposed for the fragment molecular orbital method interfaced with the polarizable continuum model (FMO/PCM). The solvation free energy is shown to be more accurate on a set of representative polypeptides with neutral and charged residues, in comparison to the original formulation at the same level of the many-body expansion of the electrostatic potential determining the apparent surface charges. The analytic first derivative of the energy with respect to nuclear coordinates is formulated at the second-order Møller-Plesset (MP2) perturbation theory level combined with PCM, for which we derived coupled perturbed Hartree-Fock equations. The accuracy of the analytic gradient is demonstrated on test calculations in comparison to numeric gradient. Geometry optimization of the small Trp-cage protein (PDB: 1L2Y) is performed with FMO/PCM/6-31(+)G(d) at the MP2 and restricted Hartree-Fock with empirical dispersion (RHF/D). The root mean square deviations between the FMO optimized and NMR experimental structure are found to be 0.414 and 0.426 Å for RHF/D and MP2, respectively. The details of the hydrogen bond network in the Trp-cage protein are revealed.

Analytic gradient for second order Møller-Plesset perturbation theory with the polarizable continuum model based on the fragment molecular orbital method

NASA Astrophysics Data System (ADS)

Nagata, Takeshi; Fedorov, Dmitri G.; Li, Hui; Kitaura, Kazuo

2012-05-01

A new energy expression is proposed for the fragment molecular orbital method interfaced with the polarizable continuum model (FMO/PCM). The solvation free energy is shown to be more accurate on a set of representative polypeptides with neutral and charged residues, in comparison to the original formulation at the same level of the many-body expansion of the electrostatic potential determining the apparent surface charges. The analytic first derivative of the energy with respect to nuclear coordinates is formulated at the second-order Møller-Plesset (MP2) perturbation theory level combined with PCM, for which we derived coupled perturbed Hartree-Fock equations. The accuracy of the analytic gradient is demonstrated on test calculations in comparison to numeric gradient. Geometry optimization of the small Trp-cage protein (PDB: 1L2Y) is performed with FMO/PCM/6-31(+)G(d) at the MP2 and restricted Hartree-Fock with empirical dispersion (RHF/D). The root mean square deviations between the FMO optimized and NMR experimental structure are found to be 0.414 and 0.426 Å for RHF/D and MP2, respectively. The details of the hydrogen bond network in the Trp-cage protein are revealed.

Precision Sensing by Two Opposing Gradient Sensors: How Does Escherichia coli Find its Preferred pH Level?

PubMed Central

Hu, Bo; Tu, Yuhai

2013-01-01

It is essential for bacteria to find optimal conditions for their growth and survival. The optimal levels of certain environmental factors (such as pH and temperature) often correspond to some intermediate points of the respective gradients. This requires the ability of bacteria to navigate from both directions toward the optimum location and is distinct from the conventional unidirectional chemotactic strategy. Remarkably, Escherichia coli cells can perform such a precision sensing task in pH taxis by using the same chemotaxis machinery, but with opposite pH responses from two different chemoreceptors (Tar and Tsr). To understand bacterial pH sensing, we developed an Ising-type model for a mixed cluster of opposing receptors based on the push-pull mechanism. Our model can quantitatively explain experimental observations in pH taxis for various mutants and wild-type cells. We show how the preferred pH level depends on the relative abundance of the competing sensors and how the sensory activity regulates the behavioral response. Our model allows us to make quantitative predictions on signal integration of pH and chemoattractant stimuli. Our study reveals two general conditions and a robust push-pull scheme for precision sensing, which should be applicable in other adaptive sensory systems with opposing gradient sensors. PMID:23823247

Reflectance analysis of porosity gradient in nanostructured silicon layers

NASA Astrophysics Data System (ADS)

Jurečka, Stanislav; Imamura, Kentaro; Matsumoto, Taketoshi; Kobayashi, Hikaru

2017-12-01

In this work we study optical properties of nanostructured layers formed on silicon surface. Nanostructured layers on Si are formed in order to reach high suppression of the light reflectance. Low spectral reflectance is important for improvement of the conversion efficiency of solar cells and for other optoelectronic applications. Effective method of forming nanostructured layers with ultralow reflectance in a broad interval of wavelengths is in our approach based on metal assisted etching of Si. Si surface immersed in HF and H2O2 solution is etched in contact with the Pt mesh roller and the structure of the mesh is transferred on the etched surface. During this etching procedure the layer density evolves gradually and the spectral reflectance decreases exponentially with the depth in porous layer. We analyzed properties of the layer porosity by incorporating the porosity gradient into construction of the layer spectral reflectance theoretical model. Analyzed layer is splitted into 20 sublayers in our approach. Complex dielectric function in each sublayer is computed by using Bruggeman effective media theory and the theoretical spectral reflectance of modelled multilayer system is computed by using Abeles matrix formalism. Porosity gradient is extracted from the theoretical reflectance model optimized in comparison to the experimental values. Resulting values of the structure porosity development provide important information for optimization of the technological treatment operations.

Constrained H1-regularization schemes for diffeomorphic image registration

PubMed Central

Mang, Andreas; Biros, George

2017-01-01

We propose regularization schemes for deformable registration and efficient algorithms for their numerical approximation. We treat image registration as a variational optimal control problem. The deformation map is parametrized by its velocity. Tikhonov regularization ensures well-posedness. Our scheme augments standard smoothness regularization operators based on H1- and H2-seminorms with a constraint on the divergence of the velocity field, which resembles variational formulations for Stokes incompressible flows. In our formulation, we invert for a stationary velocity field and a mass source map. This allows us to explicitly control the compressibility of the deformation map and by that the determinant of the deformation gradient. We also introduce a new regularization scheme that allows us to control shear. We use a globalized, preconditioned, matrix-free, reduced space (Gauss–)Newton–Krylov scheme for numerical optimization. We exploit variable elimination techniques to reduce the number of unknowns of our system; we only iterate on the reduced space of the velocity field. Our current implementation is limited to the two-dimensional case. The numerical experiments demonstrate that we can control the determinant of the deformation gradient without compromising registration quality. This additional control allows us to avoid oversmoothing of the deformation map. We also demonstrate that we can promote or penalize shear whilst controlling the determinant of the deformation gradient. PMID:29075361

Acceleration for 2D time-domain elastic full waveform inversion using a single GPU card

NASA Astrophysics Data System (ADS)

Jiang, Jinpeng; Zhu, Peimin

2018-05-01

Full waveform inversion (FWI) is a challenging procedure due to the high computational cost related to the modeling, especially for the elastic case. The graphics processing unit (GPU) has become a popular device for the high-performance computing (HPC). To reduce the long computation time, we design and implement the GPU-based 2D elastic FWI (EFWI) in time domain using a single GPU card. We parallelize the forward modeling and gradient calculations using the CUDA programming language. To overcome the limitation of relatively small global memory on GPU, the boundary saving strategy is exploited to reconstruct the forward wavefield. Moreover, the L-BFGS optimization method used in the inversion increases the convergence of the misfit function. A multiscale inversion strategy is performed in the workflow to obtain the accurate inversion results. In our tests, the GPU-based implementations using a single GPU device achieve >15 times speedup in forward modeling, and about 12 times speedup in gradient calculation, compared with the eight-core CPU implementations optimized by OpenMP. The test results from the GPU implementations are verified to have enough accuracy by comparing the results obtained from the CPU implementations.

Assessing trait-based scaling theory in tropical and temperate forests spanning a broad temperature gradients

NASA Astrophysics Data System (ADS)

Enquist, B. J.

2017-12-01

Tropical and temperate elevation gradients are natural laboratories to assess how changing climate can influence tropical forests. However, there is a need for theory and integrated data collection to scale from traits to ecosystems. We assess predictions of a novel trait-based metabolic scaling theory including whether observed shifts in forest traits across a broad tropical temperature gradient is consistent with local phenotypic optima and adaptive compensation for temperature. We tested a new anaytical theory - Trait Driver Theory - that is capable of scaling from traits to entire stands and ecosystems across several elevation gradients spanning 3300m. Each gradient consists of thousands of tropical and temperate tree trait measures taken from forest plots. In several of these plots, in particular in southern Perú, gross and net primary productivity (GPP and NPP) were measured. We measured multiple traits linked to variation in tree growth and assessed their frequency distributions within and across the elevation gradient. We paired these trait measures across individuals within forests with simultaneous measures of ecosystem net and gross primary productivity. Consistent with theory, variation in forest NPP and GPP primarily scaled with forest biomass but the secondary effect of temperature on productivity was much less than expected. This weak temperature dependency appears to reflect directional shifts in several mean community traits that underlie tree growth with decreases in site temperature. The observed shift in traits of trees that dominant more cold environments appear to reflect `adaptive/acclimatory' compensation for the kinetic effects of temperature on leaf photosynthesis and tree growth. Forest trait distributions across the gradient showed peaked and skewed distributions, consistent with the importance of local filtering of optimal growth traits and recent shifts in species composition and dominance due to warming from climate change. Trait-based metabolic scaling theory provides a basis to predict how shifts in climate have and will influence the trait composition and ecosystem functioning of temperate and tropical forests.

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

NASA Technical Reports Server (NTRS)

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.

Shaping and timing gradient pulses to reduce MRI acoustic noise.

PubMed

Segbers, Marcel; Rizzo Sierra, Carlos V; Duifhuis, Hendrikus; Hoogduin, Johannes M

2010-08-01

A method to reduce the acoustic noise generated by gradient systems in MRI has been recently proposed; such a method is based on the linear response theory. Since the physical cause of MRI acoustic noise is the time derivative of the gradient current, a common trapezoid current shape produces an acoustic gradient coil response mainly during the rising and falling edge. In the falling edge, the coil acoustic response presents a 180 degrees phase difference compared to the rising edge. Therefore, by varying the width of the trapezoid and keeping the ramps constant, it is possible to suppress one selected frequency and its higher harmonics. This value is matched to one of the prominent resonance frequencies of the gradient coil system. The idea of cancelling a single frequency is extended to a second frequency, using two successive trapezoid-shaped pulses presented at a selected interval. Overall sound pressure level reduction of 6 and 10 dB is found for the two trapezoid shapes and a single pulse shape, respectively. The acoustically optimized pulse shape proposed is additionally tested in a simulated echo planar imaging readout train, obtaining a sound pressure level reduction of 12 dB for the best case.

Development of a shear stress-free microfluidic gradient generator capable of quantitatively analyzing single-cell morphology.

PubMed

Barata, David; Spennati, Giulia; Correia, Cristina; Ribeiro, Nelson; Harink, Björn; van Blitterswijk, Clemens; Habibovic, Pamela; van Rijt, Sabine

2017-09-07

Microfluidics, the science of engineering fluid streams at the micrometer scale, offers unique tools for creating and controlling gradients of soluble compounds. Gradient generation can be used to recreate complex physiological microenvironments, but is also useful for screening purposes. For example, in a single experiment, adherent cells can be exposed to a range of concentrations of the compound of interest, enabling high-content analysis of cell behaviour and enhancing throughput. In this study, we present the development of a microfluidic screening platform where, by means of diffusion, gradients of soluble compounds can be generated and sustained. This platform enables the culture of adherent cells under shear stress-free conditions, and their exposure to a soluble compound in a concentration gradient-wise manner. The platform consists of five serial cell culture chambers, all coupled to two lateral fluid supply channels that are used for gradient generation through a source-sink mechanism. Furthermore, an additional inlet and outlet are used for cell seeding inside the chambers. Finite element modeling was used for the optimization of the design of the platform and for validation of the dynamics of gradient generation. Then, as a proof-of-concept, human osteosarcoma MG-63 cells were cultured inside the platform and exposed to a gradient of Cytochalasin D, an actin polymerization inhibitor. This set-up allowed us to analyze cell morphological changes over time, including cell area and eccentricity measurements, as a function of Cytochalasin D concentration by using fluorescence image-based cytometry.

High-Fidelity Aerodynamic Shape Optimization for Natural Laminar Flow

NASA Astrophysics Data System (ADS)

Rashad, Ramy

To ensure the long-term sustainability of aviation, serious effort is underway to mitigate the escalating economic, environmental, and social concerns of the industry. Significant improvement to the energy efficiency of air transportation is required through the research and development of advanced and unconventional airframe and engine technologies. In the quest to reduce airframe drag, this thesis is concerned with the development and demonstration of an effective design tool for improving the aerodynamic efficiency of subsonic and transonic airfoils. The objective is to advance the state-of-the-art in high-fidelity aerodynamic shape optimization by incorporating and exploiting the phenomenon of laminar-turbulent transition in an efficient manner. A framework for the design and optimization of Natural Laminar Flow (NLF) airfoils is developed and demonstrated with transition prediction capable of accounting for the effects of Reynolds number, freestream turbulence intensity, Mach number, and pressure gradients. First, a two-dimensional Reynolds-averaged Navier-Stokes (RANS) flow solver has been extended to incorporate an iterative laminar-turbulent transition prediction methodology. The natural transition locations due to Tollmien-Schlichting instabilities are predicted using the simplified eN envelope method of Drela and Giles or, alternatively, the compressible form of the Arnal-Habiballah-Delcourt criterion. The boundary-layer properties are obtained directly from the Navier-Stokes flow solution, and the transition to turbulent flow is modeled using an intermittency function in conjunction with the Spalart-Allmaras turbulence model. The RANS solver is subsequently employed in a gradient-based sequential quadratic programming shape optimization framework. The laminar-turbulent transition criteria are tightly coupled into the objective and gradient evaluations. The gradients are obtained using a new augmented discrete-adjoint formulation for non-local transition criteria. Using the eN transition criterion, the proposed framework is applied to the single and multipoint optimization of subsonic and transonic airfoils, leading to robust NLF designs. The aerodynamic design requirements over a range of cruise flight conditions are cast into a multipoint optimization problem through a composite objective defined using a weighted integral of the operating points. To study and quantify off-design performance, a Pareto front is formed using a weighted objective combining free-transition and fully-turbulent operating conditions. Next we examine the sensitivity of NLF design to the freestream disturbance environment, highlighting the on- and off-design performance at different critical N-factors. Finally, we propose and demonstrate a technique to enable the design of airfoils with robust performance over a range of critical N-factors.

Aerodynamic shape optimization using preconditioned conjugate gradient methods

NASA Technical Reports Server (NTRS)

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.

SU-E-T-453: Optimization of Dose Gradient for Gamma Knife Radiosurgery.

PubMed

Sheth, N; Chen, Y; Yang, J

2012-06-01

The goals of stereotactic radiosurgery (SRS) are the ablation of target tissue and sparing of critical normal tissue. We develop tools to aid in the selection of collimation and prescription (Rx) isodose line to optimize the dose gradient for single isocenter intracranial stereotactic radiosurgery (SRS) with GammaKnife 4C utilizing the updated physics data in GammaPlan v10.1. Single isocenter intracranial SRS plans were created to treat the center of a solid water anthropomorphism head phantom for each GammaKnife collimator (4 mm, 8 mm, 14 mm, and 18 mm). The dose gradient, defined as the difference of effective radii of spheres equal to half and full Rx volumes, and Rx treatment volume was analyzed for isodoses from 99% to 20% of Rx. The dosimetric data on Rx volume and dose gradient vs. Rx isodose for each collimator was compiled into an easy to read nomogram as well as plotted graphically. The 4, 8, 14, and 18 mm collimators have the sharpest dose gradient at the 64%, 70%, 76%, and 77% Rx isodose lines, respectively. This corresponds to treating 4.77 mm, 8.86 mm, 14.78 mm, and 18.77 mm diameter targets with dose gradients radii of 1.06 mm, 1.63 mm, 2.54 mm, and 3.17 mm, respectively. We analyzed the dosimetric data for the most recent version of GammaPlan treatment planning software to develop tools that when applied clinically will aid in the selection of a collimator and Rx isodose line for optimal dose gradient and target coverage for single isocenter intracranial SRS with GammaKnife 4C. © 2012 American Association of Physicists in Medicine.

Aerodynamic design optimization using sensitivity analysis and computational fluid dynamics

NASA Technical Reports Server (NTRS)

Baysal, Oktay; Eleshaky, Mohamed E.

1991-01-01

A new and efficient method is presented for aerodynamic design optimization, which is based on a computational fluid dynamics (CFD)-sensitivity analysis algorithm. The method is applied to design a scramjet-afterbody configuration for an optimized axial thrust. The Euler equations are solved for the inviscid analysis of the flow, which in turn provides the objective function and the constraints. The CFD analysis is then coupled with the optimization procedure that uses a constrained minimization method. The sensitivity coefficients, i.e. gradients of the objective function and the constraints, needed for the optimization are obtained using a quasi-analytical method rather than the traditional brute force method of finite difference approximations. During the one-dimensional search of the optimization procedure, an approximate flow analysis (predicted flow) based on a first-order Taylor series expansion is used to reduce the computational cost. Finally, the sensitivity of the optimum objective function to various design parameters, which are kept constant during the optimization, is computed to predict new optimum solutions. The flow analysis of the demonstrative example are compared with the experimental data. It is shown that the method is more efficient than the traditional methods.

A computational framework for simultaneous estimation of muscle and joint contact forces and body motion using optimization and surrogate modeling.

PubMed

Eskinazi, Ilan; Fregly, Benjamin J

2018-04-01

Concurrent estimation of muscle activations, joint contact forces, and joint kinematics by means of gradient-based optimization of musculoskeletal models is hindered by computationally expensive and non-smooth joint contact and muscle wrapping algorithms. We present a framework that simultaneously speeds up computation and removes sources of non-smoothness from muscle force optimizations using a combination of parallelization and surrogate modeling, with special emphasis on a novel method for modeling joint contact as a surrogate model of a static analysis. The approach allows one to efficiently introduce elastic joint contact models within static and dynamic optimizations of human motion. We demonstrate the approach by performing two optimizations, one static and one dynamic, using a pelvis-leg musculoskeletal model undergoing a gait cycle. We observed convergence on the order of seconds for a static optimization time frame and on the order of minutes for an entire dynamic optimization. The presented framework may facilitate model-based efforts to predict how planned surgical or rehabilitation interventions will affect post-treatment joint and muscle function. Copyright © 2018 IPEM. Published by Elsevier Ltd. All rights reserved.

Gradient optimization and nonlinear control

NASA Technical Reports Server (NTRS)

Hasdorff, L.

1976-01-01

The book represents an introduction to computation in control by an iterative, gradient, numerical method, where linearity is not assumed. The general language and approach used are those of elementary functional analysis. The particular gradient method that is emphasized and used is conjugate gradient descent, a well known method exhibiting quadratic convergence while requiring very little more computation than simple steepest descent. Constraints are not dealt with directly, but rather the approach is to introduce them as penalty terms in the criterion. General conjugate gradient descent methods are developed and applied to problems in control.

Efficient geometry optimization by Hellmann-Feynman forces with the anti-Hermitian contracted Schrödinger equation

NASA Astrophysics Data System (ADS)

Foley, Jonathan J.; Mazziotti, David A.

2010-10-01

An efficient method for geometry optimization based on solving the anti-Hermitian contracted Schrödinger equation (ACSE) is presented. We formulate a reduced version of the Hellmann-Feynman theorem (HFT) in terms of the two-electron reduced Hamiltonian operator and the two-electron reduced density matrix (2-RDM). The HFT offers a considerable reduction in computational cost over methods which rely on numerical derivatives. While previous geometry optimizations with numerical gradients required 2M evaluations of the ACSE where M is the number of nuclear degrees of freedom, the HFT requires only a single ACSE calculation of the 2-RDM per gradient. Synthesizing geometry optimization techniques with recent extensions of the ACSE theory to arbitrary electronic and spin states provides an important suite of tools for accurately determining equilibrium and transition-state structures of ground- and excited-state molecules in closed- and open-shell configurations. The ability of the ACSE to balance single- and multi-reference correlation is particularly advantageous in the determination of excited-state geometries where the electronic configurations differ greatly from the ground-state reference. Applications are made to closed-shell molecules N2, CO, H2O, the open-shell molecules B2 and CH, and the excited state molecules N2, B2, and BH. We also study the HCN ↔ HNC isomerization and the geometry optimization of hydroxyurea, a molecule which has a significant role in the treatment of sickle-cell anaemia.

A new design approach based on differential evolution algorithm for geometric optimization of magnetorheological brakes

NASA Astrophysics Data System (ADS)

Le-Duc, Thang; Ho-Huu, Vinh; Nguyen-Thoi, Trung; Nguyen-Quoc, Hung

2016-12-01

In recent years, various types of magnetorheological brakes (MRBs) have been proposed and optimized by different optimization algorithms that are integrated in commercial software such as ANSYS and Comsol Multiphysics. However, many of these optimization algorithms often possess some noteworthy shortcomings such as the trap of solutions at local extremes, or the limited number of design variables or the difficulty of dealing with discrete design variables. Thus, to overcome these limitations and develop an efficient computation tool for optimal design of the MRBs, an optimization procedure that combines differential evolution (DE), a gradient-free global optimization method with finite element analysis (FEA) is proposed in this paper. The proposed approach is then applied to the optimal design of MRBs with different configurations including conventional MRBs and MRBs with coils placed on the side housings. Moreover, to approach a real-life design, some necessary design variables of MRBs are considered as discrete variables in the optimization process. The obtained optimal design results are compared with those of available optimal designs in the literature. The results reveal that the proposed method outperforms some traditional approaches.

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

NASA Astrophysics Data System (ADS)

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.

Optimal trajectories of aircraft and spacecraft

NASA Technical Reports Server (NTRS)

Miele, A.

1990-01-01

Work done on algorithms for the numerical solutions of optimal control problems and their application to the computation of optimal flight trajectories of aircraft and spacecraft is summarized. General considerations on calculus of variations, optimal control, numerical algorithms, and applications of these algorithms to real-world problems are presented. The sequential gradient-restoration algorithm (SGRA) is examined for the numerical solution of optimal control problems of the Bolza type. Both the primal formulation and the dual formulation are discussed. Aircraft trajectories, in particular, the application of the dual sequential gradient-restoration algorithm (DSGRA) to the determination of optimal flight trajectories in the presence of windshear are described. Both take-off trajectories and abort landing trajectories are discussed. Take-off trajectories are optimized by minimizing the peak deviation of the absolute path inclination from a reference value. Abort landing trajectories are optimized by minimizing the peak drop of altitude from a reference value. Abort landing trajectories are optimized by minimizing the peak drop of altitude from a reference value. The survival capability of an aircraft in a severe windshear is discussed, and the optimal trajectories are found to be superior to both constant pitch trajectories and maximum angle of attack trajectories. Spacecraft trajectories, in particular, the application of the primal sequential gradient-restoration algorithm (PSGRA) to the determination of optimal flight trajectories for aeroassisted orbital transfer are examined. Both the coplanar case and the noncoplanar case are discussed within the frame of three problems: minimization of the total characteristic velocity; minimization of the time integral of the square of the path inclination; and minimization of the peak heating rate. The solution of the second problem is called nearly-grazing solution, and its merits are pointed out as a useful engineering compromise between energy requirements and aerodynamics heating requirements.

A Sea-Sky Line Detection Method for Unmanned Surface Vehicles Based on Gradient Saliency.

PubMed

Wang, Bo; Su, Yumin; Wan, Lei

2016-04-15

Special features in real marine environments such as cloud clutter, sea glint and weather conditions always result in various kinds of interference in optical images, which make it very difficult for unmanned surface vehicles (USVs) to detect the sea-sky line (SSL) accurately. To solve this problem a saliency-based SSL detection method is proposed. Through the computation of gradient saliency the line features of SSL are enhanced effectively, while other interference factors are relatively suppressed, and line support regions are obtained by a region growing method on gradient orientation. The SSL identification is achieved according to region contrast, line segment length and orientation features, and optimal state estimation of SSL detection is implemented by introducing a cubature Kalman filter (CKF). In the end, the proposed method is tested on a benchmark dataset from the "XL" USV in a real marine environment, and the experimental results demonstrate that the proposed method is significantly superior to other state-of-the-art methods in terms of accuracy rate and real-time performance, and its accuracy and stability are effectively improved by the CKF.

Blind retrospective motion correction of MR images.

PubMed

Loktyushin, Alexander; Nickisch, Hannes; Pohmann, Rolf; Schölkopf, Bernhard

2013-12-01

Subject motion can severely degrade MR images. A retrospective motion correction algorithm, Gradient-based motion correction, which significantly reduces ghosting and blurring artifacts due to subject motion was proposed. The technique uses the raw data of standard imaging sequences; no sequence modifications or additional equipment such as tracking devices are required. Rigid motion is assumed. The approach iteratively searches for the motion trajectory yielding the sharpest image as measured by the entropy of spatial gradients. The vast space of motion parameters is efficiently explored by gradient-based optimization with a convergence guarantee. The method has been evaluated on both synthetic and real data in two and three dimensions using standard imaging techniques. MR images are consistently improved over different kinds of motion trajectories. Using a graphics processing unit implementation, computation times are in the order of a few minutes for a full three-dimensional volume. The presented technique can be an alternative or a complement to prospective motion correction methods and is able to improve images with strong motion artifacts from standard imaging sequences without requiring additional data. Copyright © 2013 Wiley Periodicals, Inc., a Wiley company.

Geometry Design Optimization of Functionally Graded Scaffolds for Bone Tissue Engineering: A Mechanobiological Approach

PubMed Central

Boccaccio, Antonio; Uva, Antonio Emmanuele; Fiorentino, Michele; Mori, Giorgio; Monno, Giuseppe

2016-01-01

Functionally Graded Scaffolds (FGSs) are porous biomaterials where porosity changes in space with a specific gradient. In spite of their wide use in bone tissue engineering, possible models that relate the scaffold gradient to the mechanical and biological requirements for the regeneration of the bony tissue are currently missing. In this study we attempt to bridge the gap by developing a mechanobiology-based optimization algorithm aimed to determine the optimal graded porosity distribution in FGSs. The algorithm combines the parametric finite element model of a FGS, a computational mechano-regulation model and a numerical optimization routine. For assigned boundary and loading conditions, the algorithm builds iteratively different scaffold geometry configurations with different porosity distributions until the best microstructure geometry is reached, i.e. the geometry that allows the amount of bone formation to be maximized. We tested different porosity distribution laws, loading conditions and scaffold Young’s modulus values. For each combination of these variables, the explicit equation of the porosity distribution law–i.e the law that describes the pore dimensions in function of the spatial coordinates–was determined that allows the highest amounts of bone to be generated. The results show that the loading conditions affect significantly the optimal porosity distribution. For a pure compression loading, it was found that the pore dimensions are almost constant throughout the entire scaffold and using a FGS allows the formation of amounts of bone slightly larger than those obtainable with a homogeneous porosity scaffold. For a pure shear loading, instead, FGSs allow to significantly increase the bone formation compared to a homogeneous porosity scaffolds. Although experimental data is still necessary to properly relate the mechanical/biological environment to the scaffold microstructure, this model represents an important step towards optimizing geometry of functionally graded scaffolds based on mechanobiological criteria. PMID:26771746

Dakota, a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis version 6.0 theory manual

DOE Office of Scientific and Technical Information (OSTI.GOV)

Adams, Brian M.; Ebeida, Mohamed Salah; Eldred, Michael S

The Dakota (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a exible and extensible interface between simulation codes and iterative analysis methods. Dakota contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quanti cation with sampling, reliability, and stochastic expansion methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components requiredmore » for iterative systems analyses, the Dakota toolkit provides a exible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a theoretical manual for selected algorithms implemented within the Dakota software. It is not intended as a comprehensive theoretical treatment, since a number of existing texts cover general optimization theory, statistical analysis, and other introductory topics. Rather, this manual is intended to summarize a set of Dakota-related research publications in the areas of surrogate-based optimization, uncertainty quanti cation, and optimization under uncertainty that provide the foundation for many of Dakota's iterative analysis capabilities.« less

A Novel Hybrid Firefly Algorithm for Global Optimization.

PubMed

Zhang, Lina; Liu, Liqiang; Yang, Xin-She; Dai, Yuntao

Global optimization is challenging to solve due to its nonlinearity and multimodality. Traditional algorithms such as the gradient-based methods often struggle to deal with such problems and one of the current trends is to use metaheuristic algorithms. In this paper, a novel hybrid population-based global optimization algorithm, called hybrid firefly algorithm (HFA), is proposed by combining the advantages of both the firefly algorithm (FA) and differential evolution (DE). FA and DE are executed in parallel to promote information sharing among the population and thus enhance searching efficiency. In order to evaluate the performance and efficiency of the proposed algorithm, a diverse set of selected benchmark functions are employed and these functions fall into two groups: unimodal and multimodal. The experimental results show better performance of the proposed algorithm compared to the original version of the firefly algorithm (FA), differential evolution (DE) and particle swarm optimization (PSO) in the sense of avoiding local minima and increasing the convergence rate.

A Novel Hybrid Firefly Algorithm for Global Optimization

PubMed Central

Zhang, Lina; Liu, Liqiang; Yang, Xin-She; Dai, Yuntao

2016-01-01

Global optimization is challenging to solve due to its nonlinearity and multimodality. Traditional algorithms such as the gradient-based methods often struggle to deal with such problems and one of the current trends is to use metaheuristic algorithms. In this paper, a novel hybrid population-based global optimization algorithm, called hybrid firefly algorithm (HFA), is proposed by combining the advantages of both the firefly algorithm (FA) and differential evolution (DE). FA and DE are executed in parallel to promote information sharing among the population and thus enhance searching efficiency. In order to evaluate the performance and efficiency of the proposed algorithm, a diverse set of selected benchmark functions are employed and these functions fall into two groups: unimodal and multimodal. The experimental results show better performance of the proposed algorithm compared to the original version of the firefly algorithm (FA), differential evolution (DE) and particle swarm optimization (PSO) in the sense of avoiding local minima and increasing the convergence rate. PMID:27685869

Under-Track CFD-Based Shape Optimization for a Low-Boom Demonstrator Concept

NASA Technical Reports Server (NTRS)

Wintzer, Mathias; Ordaz, Irian; Fenbert, James W.

2015-01-01

The detailed outer mold line shaping of a Mach 1.6, demonstrator-sized low-boom concept is presented. Cruise trim is incorporated a priori as part of the shaping objective, using an equivalent-area-based approach. Design work is performed using a gradient-driven optimization framework that incorporates a three-dimensional, nonlinear flow solver, a parametric geometry modeler, and sensitivities derived using the adjoint method. The shaping effort is focused on reducing the under-track sonic boom level using an inverse design approach, while simultaneously satisfying the trim requirement. Conceptual-level geometric constraints are incorporated in the optimization process, including the internal layout of fuel tanks, landing gear, engine, and crew station. Details of the model parameterization and design process are documented for both flow-through and powered states, and the performance of these optimized vehicles presented in terms of inviscid L/D, trim state, pressures in the near-field and at the ground, and predicted sonic boom loudness.

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

NASA Astrophysics Data System (ADS)

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.

Efficient robust conditional random fields.

PubMed

Song, Dongjin; Liu, Wei; Zhou, Tianyi; Tao, Dacheng; Meyer, David A

2015-10-01

Conditional random fields (CRFs) are a flexible yet powerful probabilistic approach and have shown advantages for popular applications in various areas, including text analysis, bioinformatics, and computer vision. Traditional CRF models, however, are incapable of selecting relevant features as well as suppressing noise from noisy original features. Moreover, conventional optimization methods often converge slowly in solving the training procedure of CRFs, and will degrade significantly for tasks with a large number of samples and features. In this paper, we propose robust CRFs (RCRFs) to simultaneously select relevant features. An optimal gradient method (OGM) is further designed to train RCRFs efficiently. Specifically, the proposed RCRFs employ the l1 norm of the model parameters to regularize the objective used by traditional CRFs, therefore enabling discovery of the relevant unary features and pairwise features of CRFs. In each iteration of OGM, the gradient direction is determined jointly by the current gradient together with the historical gradients, and the Lipschitz constant is leveraged to specify the proper step size. We show that an OGM can tackle the RCRF model training very efficiently, achieving the optimal convergence rate [Formula: see text] (where k is the number of iterations). This convergence rate is theoretically superior to the convergence rate O(1/k) of previous first-order optimization methods. Extensive experiments performed on three practical image segmentation tasks demonstrate the efficacy of OGM in training our proposed RCRFs.

B1 transmit phase gradient coil for single-axis TRASE RF encoding.

PubMed

Deng, Qunli; King, Scott B; Volotovskyy, Vyacheslav; Tomanek, Boguslaw; Sharp, Jonathan C

2013-07-01

TRASE (Transmit Array Spatial Encoding) MRI uses RF transmit phase gradients instead of B0 field gradients for k-space traversal and high-resolution MR image formation. Transmit coil performance is a key determinant of TRASE image quality. The purpose of this work is to design an optimized RF transmit phase gradient array for spatial encoding in a transverse direction (x- or y- axis) for a 0.2T vertical B0 field MRI system, using a single transmitter channel. This requires the generation of two transmit B1 RF fields with uniform amplitude and positive and negative linear phase gradients respectively over the imaging volume. A two-element array consisting of a double Maxwell-type coil and a Helmholtz-type coil was designed using 3D field simulations. The phase gradient polarity is set by the relative phase of the RF signals driving the simultaneously energized elements. Field mapping and 1D TRASE imaging experiments confirmed that the constructed coil produced the fields and operated as designed. A substantially larger imaging volume relative to that obtainable from a non-optimized Maxwell-Helmholtz design was achieved. The Maxwell (sine)-Helmholtz (cosine) approach has proven successful for a horizontal phase gradient coil. A similar approach may be useful for other phase-gradient coil designs. Copyright © 2013 Elsevier Inc. All rights reserved.

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

NASA Astrophysics Data System (ADS)

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.

The Society of Thoracic Surgeons, The Society of Cardiovascular Anesthesiologists, and The American Society of ExtraCorporeal Technology: Clinical Practice Guidelines for Cardiopulmonary Bypass--Temperature Management during Cardiopulmonary Bypass.

PubMed

Engelman, Richard; Baker, Robert A; Likosky, Donald S; Grigore, Alina; Dickinson, Timothy A; Shore-Lesserson, Linda; Hammon, John W

2015-09-01

To improve our understanding of the evidence-based literature supporting temperature management during adult cardiopulmonary bypass, The Society of Thoracic Surgeons, the Society of Cardiovascular Anesthesiology and the American Society of ExtraCorporeal Technology tasked the authors to conduct a review of the peer-reviewed literature, including 1) optimal site for temperature monitoring, 2) avoidance of hyperthermia, 3) peak cooling temperature gradient and cooling rate, and 4) peak warming temperature gradient and rewarming rate. Authors adopted the American College of Cardiology/American Heart Association method for development clinical practice guidelines, and arrived at the following recommendation.

Parallel Implementations of Gradient Based Iterative Algorithms for a Class of Discrete Optimal Control Problems.

DTIC Science & Technology

1987-02-28

g Ru + Ft~FzQZ...0 otherwise, and let X be the nN costate vector X =(Xt, X, , t,)t )X in E defined by X = Fz-tQz. Then, given u and z 0, the gradient g may be...34 ’ ’-" ’.’.’.’ ’ ". ."’.’,’,’ ./, ’ ’- ," ," .- ’- ". %.’’.’ "- ’" " ,,’’ " "- . "-" ’ ,r .’’"" ’ "." .r -".’ ". ." ." ." " . ." " . €"". ’.- -8- g Ru + FIX. (6) With the notation

Realizable optimal control for a remotely piloted research vehicle. [stability augmentation

NASA Technical Reports Server (NTRS)

Dunn, H. J.

1980-01-01

The design of a control system using the linear-quadratic regulator (LQR) control law theory for time invariant systems in conjunction with an incremental gradient procedure is presented. The incremental gradient technique reduces the full-state feedback controller design, generated by the LQR algorithm, to a realizable design. With a realizable controller, the feedback gains are based only on the available system outputs instead of being based on the full-state outputs. The design is for a remotely piloted research vehicle (RPRV) stability augmentation system. The design includes methods for accounting for noisy measurements, discrete controls with zero-order-hold outputs, and computational delay errors. Results from simulation studies of the response of the RPRV to a step in the elevator and frequency analysis techniques are included to illustrate these abnormalities and their influence on the controller design.

Computer-aided diagnosis of lung nodule using gradient tree boosting and Bayesian optimization.

PubMed

Nishio, Mizuho; Nishizawa, Mitsuo; Sugiyama, Osamu; Kojima, Ryosuke; Yakami, Masahiro; Kuroda, Tomohiro; Togashi, Kaori

2018-01-01

We aimed to evaluate a computer-aided diagnosis (CADx) system for lung nodule classification focussing on (i) usefulness of the conventional CADx system (hand-crafted imaging feature + machine learning algorithm), (ii) comparison between support vector machine (SVM) and gradient tree boosting (XGBoost) as machine learning algorithms, and (iii) effectiveness of parameter optimization using Bayesian optimization and random search. Data on 99 lung nodules (62 lung cancers and 37 benign lung nodules) were included from public databases of CT images. A variant of the local binary pattern was used for calculating a feature vector. SVM or XGBoost was trained using the feature vector and its corresponding label. Tree Parzen Estimator (TPE) was used as Bayesian optimization for parameters of SVM and XGBoost. Random search was done for comparison with TPE. Leave-one-out cross-validation was used for optimizing and evaluating the performance of our CADx system. Performance was evaluated using area under the curve (AUC) of receiver operating characteristic analysis. AUC was calculated 10 times, and its average was obtained. The best averaged AUC of SVM and XGBoost was 0.850 and 0.896, respectively; both were obtained using TPE. XGBoost was generally superior to SVM. Optimal parameters for achieving high AUC were obtained with fewer numbers of trials when using TPE, compared with random search. Bayesian optimization of SVM and XGBoost parameters was more efficient than random search. Based on observer study, AUC values of two board-certified radiologists were 0.898 and 0.822. The results show that diagnostic accuracy of our CADx system was comparable to that of radiologists with respect to classifying lung nodules.

An update on the study of high-gradient elliptical SRF cavities at 805 MHz for proton and other applications

DOE Office of Scientific and Technical Information (OSTI.GOV)

Tajima, Tsuyoshi; Haynes, Brian; Krawczyk, Frank

2010-09-09

An update on the study of 805 MHz elliptical SRF cavities that have been optimized for high gradient will be presented. An optimized cell shape, which is still appropriate for easy high pressure water rinsing, has been designed with the ratios of peak magnetic and electric fields to accelerating gradient being 3.75 mT/(MV/m) and 1.82, respectively. A total of 3 single-cell cavities have been fabricated. Two of the 3 cavities have been tested so far. The second cavity achieved an E{sub acc} of {approx}50 MV/m at Q{sub 0} of 1.4 x 10{sup 10}. This result demonstrates that 805 MHz cavitiesmore » can, in principle, achieve as high as, or could even be better than, 1.3 GHz high-gradient cavities.« less

The influence of installation angle of GGIs on full-tensor gravity gradient measurement

NASA Astrophysics Data System (ADS)

Wei, Hongwei; Wu, Meiping

2018-03-01

Gravity gradient plays an important role in many disciplines as a fundamental signal to reflect the information of the earth. Full-tensor gravity gradient measurement (FGGM) is an effective way to obtain the gravity gradient signal. In this paper, the installation mode of GGIs in FGGM is studied. It is expected that the accuracy of FGGM will be improved by optimizing the installation mode of GGIs. In addition, we analysed the relationship between GGIs’ installation angle and FGGM by establishing the measurement model of FGGM. Then the following conclusions was proved that there was no relationship between GGIs’ installation angle and the measurement result. This conclusion showed that there was no optimal angle for the GGIs’ installation in FGGM, and the installation angle only need to satisfy the relationship shown in the conclusion section of this paper. Finally, this conclusion was demonstrated by computer simulations.

Aerodynamic Shape Optimization of a Dual-Stream Supersonic Plug Nozzle

NASA Technical Reports Server (NTRS)

Heath, Christopher M.; Gray, Justin S.; Park, Michael A.; Nielsen, Eric J.; Carlson, Jan-Renee

2015-01-01

Aerodynamic shape optimization was performed on an isolated axisymmetric plug nozzle sized for a supersonic business jet. The dual-stream concept was tailored to attenuate nearfield pressure disturbances without compromising nozzle performance. Adjoint-based anisotropic mesh refinement was applied to resolve nearfield compression and expansion features in the baseline viscous grid. Deformed versions of the adapted grid were used for subsequent adjoint-driven shape optimization. For design, a nonlinear gradient-based optimizer was coupled to the discrete adjoint formulation of the Reynolds-averaged Navier- Stokes equations. All nozzle surfaces were parameterized using 3rd order B-spline interpolants and perturbed axisymmetrically via free-form deformation. Geometry deformations were performed using 20 design variables shared between the outer cowl, shroud and centerbody nozzle surfaces. Interior volume grid deformation during design was accomplished using linear elastic mesh morphing. The nozzle optimization was performed at a design cruise speed of Mach 1.6, assuming core and bypass pressure ratios of 6.19 and 3.24, respectively. Ambient flight conditions at design were commensurate with 45,000-ft standard day atmosphere.

Optimization of design and operating parameters of a space-based optical-electronic system with a distributed aperture.

PubMed

Tcherniavski, Iouri; Kahrizi, Mojtaba

2008-11-20

Using a gradient optimization method with objective functions formulated in terms of a signal-to-noise ratio (SNR) calculated at given values of the prescribed spatial ground resolution, optimization problems of geometrical parameters of a distributed optical system and a charge-coupled device of a space-based optical-electronic system are solved for samples of the optical systems consisting of two and three annular subapertures. The modulation transfer function (MTF) of the distributed aperture is expressed in terms of an average MTF taking residual image alignment (IA) and optical path difference (OPD) errors into account. The results show optimal solutions of the optimization problems depending on diverse variable parameters. The information on the magnitudes of the SNR can be used to determine the number of the subapertures and their sizes, while the information on the SNR decrease depending on the IA and OPD errors can be useful in design of a beam combination control system to produce the necessary requirements to its accuracy on the basis of the permissible deterioration in the image quality.

Optimization of an electromagnetic linear actuator using a network and a finite element model

NASA Astrophysics Data System (ADS)

Neubert, Holger; Kamusella, Alfred; Lienig, Jens

2011-03-01

Model based design optimization leads to robust solutions only if the statistical deviations of design, load and ambient parameters from nominal values are considered. We describe an optimization methodology that involves these deviations as stochastic variables for an exemplary electromagnetic actuator used to drive a Braille printer. A combined model simulates the dynamic behavior of the actuator and its non-linear load. It consists of a dynamic network model and a stationary magnetic finite element (FE) model. The network model utilizes lookup tables of the magnetic force and the flux linkage computed by the FE model. After a sensitivity analysis using design of experiment (DoE) methods and a nominal optimization based on gradient methods, a robust design optimization is performed. Selected design variables are involved in form of their density functions. In order to reduce the computational effort we use response surfaces instead of the combined system model obtained in all stochastic analysis steps. Thus, Monte-Carlo simulations can be applied. As a result we found an optimum system design meeting our requirements with regard to function and reliability.

Performance optimization of dye-sensitized solar cells by multilayer gradient scattering architecture of TiO2 microspheres.

PubMed

Li, Mingyue; Li, Meiya; Liu, Xiaolian; Bai, Lihua; Luoshan, Mengdai; Lei, Wen; Wang, Zhen; Zhu, Yongdan; Zhao, Xingzhong

2017-01-20

TiO 2 microspheres (TMSs) with unique hierarchical structure and unusual high specific surface area are synthesized and incorporated into a photoanode in various TMS multilayer gradient architectures to form novel photoanodes and dye-sensitized solar cells (DSSCs). Significant influences of these architectures on the photoelectric properties of DSSCs are obtained. The DSSC with the optimal TMS gradient-ascent architecture of M036 has the largest amounts of dye absorption, strongest light absorption, longest electron lifetime and lowest electron recombination, and thus exhibits the maximum short circuit current density (J sc ) of 16.49 mA cm -2 and photoelectric conversion efficiency (η) of 7.01%, notably higher than those of conventional DSSCs by 21% and 22%, respectively. These notable improvements in the properties of DSSCs can be attributed to the TMS gradient-ascent architecture of M036 which can most effectively increase dye absorption and localize incident light within the photoanode by the light scattering of TMSs, and thus utilize the incident light thoroughly. This study provides an optimized and universal configuration for the scattering microspheres incorporated in the hybrid photoanode, which can significantly improve the performance of DSSCs.

Gradient maintenance: A new algorithm for fast online replanning

DOE Office of Scientific and Technical Information (OSTI.GOV)

Ahunbay, Ergun E., E-mail: eahunbay@mcw.edu; Li, X. Allen

2015-06-15

Purpose: Clinical use of online adaptive replanning has been hampered by the unpractically long time required to delineate volumes based on the image of the day. The authors propose a new replanning algorithm, named gradient maintenance (GM), which does not require the delineation of organs at risk (OARs), and can enhance automation, drastically reducing planning time and improving consistency and throughput of online replanning. Methods: The proposed GM algorithm is based on the hypothesis that if the dose gradient toward each OAR in daily anatomy can be maintained the same as that in the original plan, the intended plan qualitymore » of the original plan would be preserved in the adaptive plan. The algorithm requires a series of partial concentric rings (PCRs) to be automatically generated around the target toward each OAR on the planning and the daily images. The PCRs are used in the daily optimization objective function. The PCR dose constraints are generated with dose–volume data extracted from the original plan. To demonstrate this idea, GM plans generated using daily images acquired using an in-room CT were compared to regular optimization and image guided radiation therapy repositioning plans for representative prostate and pancreatic cancer cases. Results: The adaptive replanning using the GM algorithm, requiring only the target contour from the CT of the day, can be completed within 5 min without using high-power hardware. The obtained adaptive plans were almost as good as the regular optimization plans and were better than the repositioning plans for the cases studied. Conclusions: The newly proposed GM replanning algorithm, requiring only target delineation, not full delineation of OARs, substantially increased planning speed for online adaptive replanning. The preliminary results indicate that the GM algorithm may be a solution to improve the ability for automation and may be especially suitable for sites with small-to-medium size targets surrounded by several critical structures.« less

Hormone purification by isoelectric focusing in space

NASA Technical Reports Server (NTRS)

Bier, M.

1988-01-01

The objective of the program was the definition and development of optimal methods for electrophoretic separations in microgravity. The approach is based on a triad consisting of ground based experiments, mathematical modeling and experiments in microgravity. Zone electrophoresis is a rate process, where separation is achieved in uniform buffers on the basis of differences in electrophoretic mobilities. Optimization and modeling of continuous flow electrophoresis mainly concern the hydrodynamics of the flow process, including gravity dependent fluid convection due to density gradients and gravity independent electroosmosis. Optimization of focusing requires a more complex model describing the molecular transport processes involved in electrophoresis of interacting systems. Three different focusing instruments were designed, embodying novel principles of fluid stabilization. Fluid stability was achieved by: (1) flow streamlining by means of membrane elements in combination with rapid fluid recycling; (2) apparatus rotation in combination with said membrane elements; and (3) shear stress induced by rapid recycling through a narrow gap channel.

Sensitivity analysis, approximate analysis, and design optimization for internal and external viscous flows

NASA Technical Reports Server (NTRS)

Taylor, Arthur C., III; Hou, Gene W.; Korivi, Vamshi M.

1991-01-01

A gradient-based design optimization strategy for practical aerodynamic design applications is presented, which uses the 2D thin-layer Navier-Stokes equations. The strategy is based on the classic idea of constructing different modules for performing the major tasks such as function evaluation, function approximation and sensitivity analysis, mesh regeneration, and grid sensitivity analysis, all driven and controlled by a general-purpose design optimization program. The accuracy of aerodynamic shape sensitivity derivatives is validated on two viscous test problems: internal flow through a double-throat nozzle and external flow over a NACA 4-digit airfoil. A significant improvement in aerodynamic performance has been achieved in both cases. Particular attention is given to a consistent treatment of the boundary conditions in the calculation of the aerodynamic sensitivity derivatives for the classic problems of external flow over an isolated lifting airfoil on 'C' or 'O' meshes.

Control theory based airfoil design using the Euler equations

NASA Technical Reports Server (NTRS)

Jameson, Antony; Reuther, James

1994-01-01

This paper describes the implementation of optimization techniques based on control theory for airfoil design. In our previous work it was shown that control theory could be employed to devise effective optimization procedures for two-dimensional profiles by using the potential flow equation with either a conformal mapping or a general coordinate system. The goal of our present work is to extend the development to treat the Euler equations in two-dimensions by procedures that can readily be generalized to treat complex shapes in three-dimensions. Therefore, we have developed methods which can address airfoil design through either an analytic mapping or an arbitrary grid perturbation method applied to a finite volume discretization of the Euler equations. Here the control law serves to provide computationally inexpensive gradient information to a standard numerical optimization method. Results are presented for both the inverse problem and drag minimization problem.

Control theory based airfoil design for potential flow and a finite volume discretization

NASA Technical Reports Server (NTRS)

Reuther, J.; Jameson, A.

1994-01-01

This paper describes the implementation of optimization techniques based on control theory for airfoil design. In previous studies it was shown that control theory could be used to devise an effective optimization procedure for two-dimensional profiles in which the shape is determined by a conformal transformation from a unit circle, and the control is the mapping function. The goal of our present work is to develop a method which does not depend on conformal mapping, so that it can be extended to treat three-dimensional problems. Therefore, we have developed a method which can address arbitrary geometric shapes through the use of a finite volume method to discretize the potential flow equation. Here the control law serves to provide computationally inexpensive gradient information to a standard numerical optimization method. Results are presented, where both target speed distributions and minimum drag are used as objective functions.

Meta-Modeling-Based Groundwater Remediation Optimization under Flexibility in Environmental Standard.

PubMed

He, Li; Xu, Zongda; Fan, Xing; Li, Jing; Lu, Hongwei

2017-05-01

  This study develops a meta-modeling based mathematical programming approach with flexibility in environmental standards. It integrates numerical simulation, meta-modeling analysis, and fuzzy programming within a general framework. A set of models between remediation strategies and remediation performance can well guarantee the mitigation in computational efforts in the simulation and optimization process. In order to prevent the occurrence of over-optimistic and pessimistic optimization strategies, a high satisfaction level resulting from the implementation of a flexible standard can indicate the degree to which the environmental standard is satisfied. The proposed approach is applied to a naphthalene-contaminated site in China. Results show that a longer remediation period corresponds to a lower total pumping rate and a stringent risk standard implies a high total pumping rate. The wells located near or in the down-gradient direction to the contaminant sources have the most significant efficiency among all of remediation schemes.

SPICE modelling of a coupled piezoelectric-bimetal heat engine for autonomous Wireless Sensor Nodes (WSN) power supply

NASA Astrophysics Data System (ADS)

Boughaleb, J.; Monfray, S.; Vine, G.; Cottinet, P. J.; Arnaud, A.; Boisseau, S.; Duret, A. B.; Quenard, S.; Puscasu, O.; Maitre, C.; Trochut, S.; Hasbani, F.; Di Gilio, T.; Heinrich, V.; Urard, P.; Grasset, J. C.; Boeuf, F.; Guyomar, D.; Skotnicki, T.

2014-11-01

This paper deals with an electrical modelling and optimization of a thermal energy harvester dedicated to power autonomous systems. Such devices based on bimetal strips and piezoceramics turn thermal gradients into electricity by a two-step conversion mechanism. This work focuses first on a demonstration of a ST-WSN (GreenNet demonstration platform) supplied by the harvester to validate, for the first time, the harvesters viability. That demonstration focuses attention on the need for an optimized power management circuit for piezoelectric generators able to reach output voltages up to 20 V. The work deals then with the proposal of an equivalent lumped element model of the piezoelectric transducer with its SPICE implementation to enable the optimization of a dedicated power management circuit based on the Pulsed Synchronous Charge Extractor (PSCE). Simulations using the SPICE model and the power management circuit lead to an increased extracted power by 144%.

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

PubMed

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

Large scale micro-photometry for high resolution pH-characterization during electro-osmotic pumping and modular micro-swimming

NASA Astrophysics Data System (ADS)

Niu, Ran; Khodorov, Stanislav; Weber, Julian; Reinmüller, Alexander; Palberg, Thomas

2017-11-01

Micro-fluidic pumps as well as artificial micro-swimmers are conveniently realized exploiting phoretic solvent flows based on local gradients of temperature, electrolyte concentration or pH. We here present a facile micro-photometric method for monitoring pH gradients and demonstrate its performance and scope on different experimental situations including an electro-osmotic pump and modular micro-swimmers assembled from ion exchange resin beads and polystyrene colloids. In combination with the present microscope and DSLR camera our method offers a 2 μm spatial resolution at video frame rate over a field of view of 3920 × 2602 μm2. Under optimal conditions we achieve a pH-resolution of 0.05 with about equal contributions from statistical and systematical uncertainties. Our quantitative micro-photometric characterization of pH gradients which develop in time and reach out several mm is anticipated to provide valuable input for reliable modeling and simulations of a large variety of complex flow situations involving pH-gradients including artificial micro-swimmers, microfluidic pumping or even electro-convection.

Small-Tip-Angle Spokes Pulse Design Using Interleaved Greedy and Local Optimization Methods

PubMed Central

Grissom, William A.; Khalighi, Mohammad-Mehdi; Sacolick, Laura I.; Rutt, Brian K.; Vogel, Mika W.

2013-01-01

Current spokes pulse design methods can be grouped into methods based either on sparse approximation or on iterative local (gradient descent-based) optimization of the transverse-plane spatial frequency locations visited by the spokes. These two classes of methods have complementary strengths and weaknesses: sparse approximation-based methods perform an efficient search over a large swath of candidate spatial frequency locations but most are incompatible with off-resonance compensation, multifrequency designs, and target phase relaxation, while local methods can accommodate off-resonance and target phase relaxation but are sensitive to initialization and suboptimal local cost function minima. This article introduces a method that interleaves local iterations, which optimize the radiofrequency pulses, target phase patterns, and spatial frequency locations, with a greedy method to choose new locations. Simulations and experiments at 3 and 7 T show that the method consistently produces single- and multifrequency spokes pulses with lower flip angle inhomogeneity compared to current methods. PMID:22392822

Comparison of bootstrap approaches for estimation of uncertainties of DTI parameters.

PubMed

Chung, SungWon; Lu, Ying; Henry, Roland G

2006-11-01

Bootstrap is an empirical non-parametric statistical technique based on data resampling that has been used to quantify uncertainties of diffusion tensor MRI (DTI) parameters, useful in tractography and in assessing DTI methods. The current bootstrap method (repetition bootstrap) used for DTI analysis performs resampling within the data sharing common diffusion gradients, requiring multiple acquisitions for each diffusion gradient. Recently, wild bootstrap was proposed that can be applied without multiple acquisitions. In this paper, two new approaches are introduced called residual bootstrap and repetition bootknife. We show that repetition bootknife corrects for the large bias present in the repetition bootstrap method and, therefore, better estimates the standard errors. Like wild bootstrap, residual bootstrap is applicable to single acquisition scheme, and both are based on regression residuals (called model-based resampling). Residual bootstrap is based on the assumption that non-constant variance of measured diffusion-attenuated signals can be modeled, which is actually the assumption behind the widely used weighted least squares solution of diffusion tensor. The performances of these bootstrap approaches were compared in terms of bias, variance, and overall error of bootstrap-estimated standard error by Monte Carlo simulation. We demonstrate that residual bootstrap has smaller biases and overall errors, which enables estimation of uncertainties with higher accuracy. Understanding the properties of these bootstrap procedures will help us to choose the optimal approach for estimating uncertainties that can benefit hypothesis testing based on DTI parameters, probabilistic fiber tracking, and optimizing DTI methods.

Magnetic field design for selecting and aligning immunomagnetic labeled cells.

PubMed

Tibbe, Arjan G J; de Grooth, Bart G; Greve, Jan; Dolan, Gerald J; Rao, Chandra; Terstappen, Leon W M M

2002-03-01

Recently we introduced the CellTracks cell analysis system, in which samples are prepared based on a combination of immunomagnetic selection, separation, and alignment of cells along ferromagnetic lines. Here we describe the underlying magnetic principles and considerations made in the magnetic field design to achieve the best possible cell selection and alignment of magnetically labeled cells. Materials and Methods Computer simulations, in combination with experimental data, were used to optimize the design of the magnets and Ni lines to obtain the optimal magnetic configuration. A homogeneous cell distribution on the upper surface of the sample chamber was obtained with a magnet where the pole faces were tilted towards each other. The spatial distribution of magnetically aligned objects in between the Ni lines was dependent on the ratio of the diameter of the aligned object and the line spacing, which was tested with magnetically and fluorescently labeled 6 microm polystyrene beads. The best result was obtained when the line spacing was equal to or smaller than the diameter of the aligned object. The magnetic gradient of the designed permanent magnet extracts magnetically labeled cells from any cell suspension to a desired plane, providing a homogeneous cell distribution. In addition, it magnetizes ferro-magnetic Ni lines in this plane whose additional local gradient adds to the gradient of the permanent magnet. The resultant gradient aligns the magnetically labeled cells first brought to this plane. This combination makes it possible, in a single step, to extract and align cells on a surface from any cell suspension. Copyright 2002 Wiley-Liss, Inc.

Aeroassisted orbital maneuvering using Lyapunov optimal feedback control

NASA Technical Reports Server (NTRS)

Grantham, Walter J.; Lee, Byoung-Soo

1987-01-01

A Liapunov optimal feedback controller incorporating a preferred direction of motion at each state of the system which is opposite to the gradient of a specified descent function is developed for aeroassisted orbital transfer from high-earth orbit to LEO. The performances of the Liapunov controller and a calculus-of-variations open-loop minimum-fuel controller, both of which are based on the 1962 U.S. Standard Atmosphere, are simulated using both the 1962 U.S. Standard Atmosphere and an atmosphere corresponding to the STS-6 Space Shuttle flight. In the STS-6 atmosphere, the calculus-of-variations open-loop controller fails to exit the atmosphere, while the Liapunov controller achieves the optimal minimum-fuel conditions, despite the + or - 40 percent fluctuations in the STS-6 atmosphere.

Active marks structure optimization for optical-electronic systems of spatial position control of industrial objects

NASA Astrophysics Data System (ADS)

Sycheva, Elena A.; Vasilev, Aleksandr S.; Lashmanov, Oleg U.; Korotaev, Valery V.

2017-06-01

The article is devoted to the optimization of optoelectronic systems of the spatial position of objects. Probabilistic characteristics of the detection of an active structured mark on a random noisy background are investigated. The developed computer model and the results of the study allow us to estimate the probabilistic characteristics of detection of a complex structured mark on a random gradient background, and estimate the error of spatial coordinates. The results of the study make it possible to improve the accuracy of measuring the coordinates of the object. Based on the research recommendations are given on the choice of parameters of the optimal mark structure for use in opticalelectronic systems for monitoring the spatial position of large-sized structures.

GOCE gravity gradient data for lithospheric modeling - From well surveyed to frontier areas

NASA Astrophysics Data System (ADS)

Bouman, J.; Ebbing, J.; Gradmann, S.; Fuchs, M.; Fattah, R. Abdul; Meekes, S.; Schmidt, M.; Lieb, V.; Haagmans, R.

2012-04-01

We explore how GOCE gravity gradient data can improve modeling of the Earth's lithosphere and thereby contribute to a better understanding of the Earth's dynamic processes. The idea is to invert satellite gravity gradients and terrestrial gravity data in the well explored and understood North-East Atlantic Margin and to compare the results of this inversion, providing improved information about the lithosphere and upper mantle, with results obtained by means of models based upon other sources like seismics and magnetic field information. Transfer of the obtained knowledge to the less explored Rub' al Khali desert is foreseen. We present a case study for the North-East Atlantic margin, where we analyze the use of satellite gravity gradients by comparison with a well-constrained 3D density model that provides a detailed picture from the upper mantle to the top basement (base of sediments). The latter horizon is well resolved from gravity and especially magnetic data, whereas sedimentary layers are mainly constrained from seismic studies, but do in general not show a prominent effect in the gravity and magnetic field. We analyze how gravity gradients can increase confidence in the modeled structures by calculating a sensitivity matrix for the existing 3D model. This sensitivity matrix describes the relation between calculated gravity gradient data and geological structures with respect to their depth, extent and relative density contrast. As the sensitivity of the modeled bodies varies for different tensor components, we can use this matrix for a weighted inversion of gradient data to optimize the model. This sensitivity analysis will be used as input to study the Rub' al Khali desert in Saudi Arabia. In terms of modeling and data availability this is a frontier area. Here gravity gradient data will be used to better identify the extent of anomalous structures within the basin, with the goal to improve the modeling for hydrocarbon exploration purposes.

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

PubMed

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.

Application of Artificial Neural Networks in the Design and Optimization of a Nanoparticulate Fingolimod Delivery System Based on Biodegradable Poly(3-Hydroxybutyrate-Co-3-Hydroxyvalerate).

PubMed

Shahsavari, Shadab; Rezaie Shirmard, Leila; Amini, Mohsen; Abedin Dokoosh, Farid

2017-01-01

Formulation of a nanoparticulate Fingolimod delivery system based on biodegradable poly(3-hydroxybutyrate-co-3-hydroxyvalerate) was optimized according to artificial neural networks (ANNs). Concentration of poly(3-hydroxybutyrate-co-3-hydroxyvalerate), PVA and amount of Fingolimod is considered as the input value, and the particle size, polydispersity index, loading capacity, and entrapment efficacy as output data in experimental design study. In vitro release study was carried out for best formulation according to statistical analysis. ANNs are employed to generate the best model to determine the relationships between various values. In order to specify the model with the best accuracy and proficiency for the in vitro release, a multilayer percepteron with different training algorithm has been examined. Three training model formulations including Levenberg-Marquardt (LM), gradient descent, and Bayesian regularization were employed for training the ANN models. It is demonstrated that the predictive ability of each training algorithm is in the order of LM > gradient descent > Bayesian regularization. Also, optimum formulation was achieved by LM training function with 15 hidden layers and 20 neurons. The transfer function of the hidden layer for this formulation and the output layer were tansig and purlin, respectively. Also, the optimization process was developed by minimizing the error among the predicted and observed values of training algorithm (about 0.0341). Copyright © 2016 American Pharmacists Association®. Published by Elsevier Inc. All rights reserved.

Development of novel microfluidic platforms for neural stem cell research

NASA Astrophysics Data System (ADS)

Chung, Bonggeun

This dissertation describes the development and characterization of novel microfluidic platforms to study proliferation, differentiation, migration, and apoptosis of neural stem cells (NSCs). NSCs hold tremendous promise for fundamental biological studies and cell-based therapies in human disorders. NSCs are defined as cells that can self-renew yet maintain the ability to generate the three principal cell types of the central nervous system such as neurons, astrocytes, and oligodendrocytes. NSCs therefore have therapeutic possibilities in multiple neurodevelopmental and neurodegenerative diseases. Despite their promise, cell-based therapies are limited by the inability to precisely control their behavior in culture. Compared to traditional culture tools, microfluidic platforms can provide much greater control over cell microenvironments and optimize proliferation and differentiation conditions of cells exposed to combinatorial mixtures of growth factors. Human NSCs were cultured for more than 1 week in the microfluidic device while constantly exposed to a continuous gradient of a growth factor mixture. NSCs proliferated and differentiated in a graded and proportional fashion that varied directly with growth factor concentration. In parallel to the study of growth and differentiation of NSCs, we are interested in proliferation and apoptosis of mouse NSCs exposed to morphogen gradients. Morphogen gradients are fundamental to animal brain development. Nonetheless, much controversy remains about the mechanisms by which morphogen gradients act on the developing brain. To overcome limitations of in-vitro models of gradients, we have developed a hybrid microfluidic platform that can mimic morphogen gradient profiles. Bone morphogenetic protein (BMP) activity in the developing cortex is graded and cortical NSC responses to BMPs are highly dependent on concentration and gradient slope of BMPs. To make novel microfluidic devices integrated with multiple functions, we have also developed a microfluidic multi-injector (MMI) that can generate temporal and spatial concentration gradients. MMI consists of fluidic channels and control channels with pneumatically actuated on-chip barrier valves. Repetitive actuations of on-chip valves control pulsatile release of solution that establishes microscopic chemical gradients. The development of novel gradient-generating microfluidic platforms will help in advancing our understanding of brain development and provide a versatile tool with basic and applied studies in stem cell biology.

Formulation for Simultaneous Aerodynamic Analysis and Design Optimization

NASA Technical Reports Server (NTRS)

Hou, G. W.; Taylor, A. C., III; Mani, S. V.; Newman, P. A.

1993-01-01

An efficient approach for simultaneous aerodynamic analysis and design optimization is presented. This approach does not require the performance of many flow analyses at each design optimization step, which can be an expensive procedure. Thus, this approach brings us one step closer to meeting the challenge of incorporating computational fluid dynamic codes into gradient-based optimization techniques for aerodynamic design. An adjoint-variable method is introduced to nullify the effect of the increased number of design variables in the problem formulation. The method has been successfully tested on one-dimensional nozzle flow problems, including a sample problem with a normal shock. Implementations of the above algorithm are also presented that incorporate Newton iterations to secure a high-quality flow solution at the end of the design process. Implementations with iterative flow solvers are possible and will be required for large, multidimensional flow problems.

A niching genetic algorithm applied to optimize a SiC-bulk crystal growth system

NASA Astrophysics Data System (ADS)

Su, Juan; Chen, Xuejiang; Li, Yuan; Pons, Michel; Blanquet, Elisabeth

2017-06-01

A niching genetic algorithm (NGA) was presented to optimize a SiC-bulk crystal growth system by PVT. The NGA based on clearing mechanism and its combination method with heat transfer model for SiC crystal growth were described in details. Then three inverse problems for optimization of growth system were carried out by NGA. Firstly, the radius of blind hole was optimized to decrease the radial temperature gradient along the substrate while the center temperature on the surface of substrate is fixed at 2500 K. Secondly, insulation materials with anisotropic thermal conductivities were selected to obtain much higher growth rate as 600, 800 and 1000 μm/h. Finally, the density of coils was also rearranged to minimize the temperature variation in the SiC powder. All the results were analyzed and discussed.

Ames Optimized TCA Configuration

NASA Technical Reports Server (NTRS)

Cliff, Susan E.; Reuther, James J.; Hicks, Raymond M.

1999-01-01

Configuration design at Ames was carried out with the SYN87-SB (single block) Euler code using a 193 x 49 x 65 C-H grid. The Euler solver is coupled to the constrained (NPSOL) and the unconstrained (QNMDIF) optimization packages. Since the single block grid is able to model only wing-body configurations, the nacelle/diverter effects were included in the optimization process by SYN87's option to superimpose the nacelle/diverter interference pressures on the wing. These interference pressures were calculated using the AIRPLANE code. AIRPLANE is an Euler solver that uses a unstructured tetrahedral mesh and is capable of computations about arbitrary complete configurations. In addition, the buoyancy effects of the nacelle/diverters were also included in the design process by imposing the pressure field obtained during the design process onto the triangulated surfaces of the nacelle/diverter mesh generated by AIRPLANE. The interference pressures and nacelle buoyancy effects are added to the final forces after each flow field calculation. Full details of the (recently enhanced) ghost nacelle capability are given in a related talk. The pseudo nacelle corrections were greatly improved during this design cycle. During the Ref H and Cycle 1 design activities, the nacelles were only translated and pitched. In the cycle 2 design effort the nacelles can translate vertically, and pitch to accommodate the changes in the lower surface geometry. The diverter heights (between their leading and trailing edges) were modified during design as the shape of the lower wing changed, with the drag of the diverter changing accordingly. Both adjoint and finite difference gradients were used during optimization. The adjoint-based gradients were found to give good direction in the design space for configurations near the starting point, but as the design approached a minimum, the finite difference gradients were found to be more accurate. Use of finite difference gradients was limited by the CPU time limit available on the Cray machines. A typical optimization run using finite difference gradients can use only 30 to 40 design variables and one optimization iteration within the 8 hour queue limit for the chosen grid size and convergence level. The efficiency afforded by the adjoint method allowed for 50-120 design variables and 5-10 optimization iterations in the 8 hour queue. Geometric perturbations to the wing and fuselage were made using the Hicks/Henne (HH) shape functions. The HH functions were distributed uniformly along the chords of the wing defining sections and lofted linearly. During single-surface design, constraints on thickness and volume at selected wing stations were imposed. Both fuselage camber and cross-sectional area distributions were permitted to change during design. The major disadvantage to the use of these functions is the inherent surface waviness produced by repeated use of such functions. Many smoothing operations were required following optimization runs to produce a configuration with reasonable smoothness. Wagner functions were also used on the wing sections but were never used on the fuselage. The Wagner functions are a family of increasingly oscillatory functions that have also been used extensively in airfoil design. The leading and trailing edge regions of the wing were designed by use of polynomial and monomial functions respectively. Twist was attempted but was abandoned because of little performance improvement available from changing the baseline twist.

Towards adjoint-based inversion for rheological parameters in nonlinear viscous mantle flow

NASA Astrophysics Data System (ADS)

Worthen, Jennifer; Stadler, Georg; Petra, Noemi; Gurnis, Michael; Ghattas, Omar

2014-09-01

We address the problem of inferring mantle rheological parameter fields from surface velocity observations and instantaneous nonlinear mantle flow models. We formulate this inverse problem as an infinite-dimensional nonlinear least squares optimization problem governed by nonlinear Stokes equations. We provide expressions for the gradient of the cost functional of this optimization problem with respect to two spatially-varying rheological parameter fields: the viscosity prefactor and the exponent of the second invariant of the strain rate tensor. Adjoint (linearized) Stokes equations, which are characterized by a 4th order anisotropic viscosity tensor, facilitates efficient computation of the gradient. A quasi-Newton method for the solution of this optimization problem is presented, which requires the repeated solution of both nonlinear forward Stokes and linearized adjoint Stokes equations. For the solution of the nonlinear Stokes equations, we find that Newton’s method is significantly more efficient than a Picard fixed point method. Spectral analysis of the inverse operator given by the Hessian of the optimization problem reveals that the numerical eigenvalues collapse rapidly to zero, suggesting a high degree of ill-posedness of the inverse problem. To overcome this ill-posedness, we employ Tikhonov regularization (favoring smooth parameter fields) or total variation (TV) regularization (favoring piecewise-smooth parameter fields). Solution of two- and three-dimensional finite element-based model inverse problems show that a constant parameter in the constitutive law can be recovered well from surface velocity observations. Inverting for a spatially-varying parameter field leads to its reasonable recovery, in particular close to the surface. When inferring two spatially varying parameter fields, only an effective viscosity field and the total viscous dissipation are recoverable. Finally, a model of a subducting plate shows that a localized weak zone at the plate boundary can be partially recovered, especially with TV regularization.

Development of an atmospheric N2O isotopocule model and optimization procedure, and application to source estimation

NASA Astrophysics Data System (ADS)

Ishijima, K.; Takigawa, M.; Sudo, K.; Toyoda, S.; Yoshida, N.; Röckmann, T.; Kaiser, J.; Aoki, S.; Morimoto, S.; Sugawara, S.; Nakazawa, T.

2015-07-01

This paper presents the development of an atmospheric N2O isotopocule model based on a chemistry-coupled atmospheric general circulation model (ACTM). We also describe a simple method to optimize the model and present its use in estimating the isotopic signatures of surface sources at the hemispheric scale. Data obtained from ground-based observations, measurements of firn air, and balloon and aircraft flights were used to optimize the long-term trends, interhemispheric gradients, and photolytic fractionation, respectively, in the model. This optimization successfully reproduced realistic spatial and temporal variations of atmospheric N2O isotopocules throughout the atmosphere from the surface to the stratosphere. The very small gradients associated with vertical profiles through the troposphere and the latitudinal and vertical distributions within each hemisphere were also reasonably simulated. The results of the isotopic characterization of the global total sources were generally consistent with previous one-box model estimates, indicating that the observed atmospheric trend is the dominant factor controlling the source isotopic signature. However, hemispheric estimates were different from those generated by a previous two-box model study, mainly due to the model accounting for the interhemispheric transport and latitudinal and vertical distributions of tropospheric N2O isotopocules. Comparisons of time series of atmospheric N2O isotopocule ratios between our model and observational data from several laboratories revealed the need for a more systematic and elaborate intercalibration of the standard scales used in N2O isotopic measurements in order to capture a more complete and precise picture of the temporal and spatial variations in atmospheric N2O isotopocule ratios. This study highlights the possibility that inverse estimation of surface N2O fluxes, including the isotopic information as additional constraints, could be realized.

Development of an atmospheric N2O isotopocule model and optimization procedure, and application to source estimation

NASA Astrophysics Data System (ADS)

Ishijima, K.; Takigawa, M.; Sudo, K.; Toyoda, S.; Yoshida, N.; Röckmann, T.; Kaiser, J.; Aoki, S.; Morimoto, S.; Sugawara, S.; Nakazawa, T.

2015-12-01

This work presents the development of an atmospheric N2O isotopocule model based on a chemistry-coupled atmospheric general circulation model (ACTM). We also describe a simple method to optimize the model and present its use in estimating the isotopic signatures of surface sources at the hemispheric scale. Data obtained from ground-based observations, measurements of firn air, and balloon and aircraft flights were used to optimize the long-term trends, interhemispheric gradients, and photolytic fractionation, respectively, in the model. This optimization successfully reproduced realistic spatial and temporal variations of atmospheric N2O isotopocules throughout the atmosphere from the surface to the stratosphere. The very small gradients associated with vertical profiles through the troposphere and the latitudinal and vertical distributions within each hemisphere were also reasonably simulated. The results of the isotopic characterization of the global total sources were generally consistent with previous one-box model estimates, indicating that the observed atmospheric trend is the dominant factor controlling the source isotopic signature. However, hemispheric estimates were different from those generated by a previous two-box model study, mainly due to the model accounting for the interhemispheric transport and latitudinal and vertical distributions of tropospheric N2O isotopocules. Comparisons of time series of atmospheric N2O isotopocule ratios between our model and observational data from several laboratories revealed the need for a more systematic and elaborate intercalibration of the standard scales used in N2O isotopic measurements in order to capture a more complete and precise picture of the temporal and spatial variations in atmospheric N2O isotopocule ratios. This study highlights the possibility that inverse estimation of surface N2O fluxes, including the isotopic information as additional constraints, could be realized.

Artificial Bee Colony Optimization of Capping Potentials for Hybrid Quantum Mechanical/Molecular Mechanical Calculations.

PubMed

Schiffmann, Christoph; Sebastiani, Daniel

2011-05-10

We present an algorithmic extension of a numerical optimization scheme for analytic capping potentials for use in mixed quantum-classical (quantum mechanical/molecular mechanical, QM/MM) ab initio calculations. Our goal is to minimize bond-cleavage-induced perturbations in the electronic structure, measured by means of a suitable penalty functional. The optimization algorithm-a variant of the artificial bee colony (ABC) algorithm, which relies on swarm intelligence-couples deterministic (downhill gradient) and stochastic elements to avoid local minimum trapping. The ABC algorithm outperforms the conventional downhill gradient approach, if the penalty hypersurface exhibits wiggles that prevent a straight minimization pathway. We characterize the optimized capping potentials by computing NMR chemical shifts. This approach will increase the accuracy of QM/MM calculations of complex biomolecules.

Study of genetic direct search algorithms for function optimization

NASA Technical Reports Server (NTRS)

Zeigler, B. P.

1974-01-01

The results are presented of a study to determine the performance of genetic direct search algorithms in solving function optimization problems arising in the optimal and adaptive control areas. The findings indicate that: (1) genetic algorithms can outperform standard algorithms in multimodal and/or noisy optimization situations, but suffer from lack of gradient exploitation facilities when gradient information can be utilized to guide the search. (2) For large populations, or low dimensional function spaces, mutation is a sufficient operator. However for small populations or high dimensional functions, crossover applied in about equal frequency with mutation is an optimum combination. (3) Complexity, in terms of storage space and running time, is significantly increased when population size is increased or the inversion operator, or the second level adaptation routine is added to the basic structure.

Comparing implementations of penalized weighted least-squares sinogram restoration.

PubMed

Forthmann, Peter; Koehler, Thomas; Defrise, Michel; La Riviere, Patrick

2010-11-01

A CT scanner measures the energy that is deposited in each channel of a detector array by x rays that have been partially absorbed on their way through the object. The measurement process is complex and quantitative measurements are always and inevitably associated with errors, so CT data must be preprocessed prior to reconstruction. In recent years, the authors have formulated CT sinogram preprocessing as a statistical restoration problem in which the goal is to obtain the best estimate of the line integrals needed for reconstruction from the set of noisy, degraded measurements. The authors have explored both penalized Poisson likelihood (PL) and penalized weighted least-squares (PWLS) objective functions. At low doses, the authors found that the PL approach outperforms PWLS in terms of resolution-noise tradeoffs, but at standard doses they perform similarly. The PWLS objective function, being quadratic, is more amenable to computational acceleration than the PL objective. In this work, the authors develop and compare two different methods for implementing PWLS sinogram restoration with the hope of improving computational performance relative to PL in the standard-dose regime. Sinogram restoration is still significant in the standard-dose regime since it can still outperform standard approaches and it allows for correction of effects that are not usually modeled in standard CT preprocessing. The authors have explored and compared two implementation strategies for PWLS sinogram restoration: (1) A direct matrix-inversion strategy based on the closed-form solution to the PWLS optimization problem and (2) an iterative approach based on the conjugate-gradient algorithm. Obtaining optimal performance from each strategy required modifying the naive off-the-shelf implementations of the algorithms to exploit the particular symmetry and sparseness of the sinogram-restoration problem. For the closed-form approach, the authors subdivided the large matrix inversion into smaller coupled problems and exploited sparseness to minimize matrix operations. For the conjugate-gradient approach, the authors exploited sparseness and preconditioned the problem to speed up convergence. All methods produced qualitatively and quantitatively similar images as measured by resolution-variance tradeoffs and difference images. Despite the acceleration strategies, the direct matrix-inversion approach was found to be uncompetitive with iterative approaches, with a computational burden higher by an order of magnitude or more. The iterative conjugate-gradient approach, however, does appear promising, with computation times half that of the authors' previous penalized-likelihood implementation. Iterative conjugate-gradient based PWLS sinogram restoration with careful matrix optimizations has computational advantages over direct matrix PWLS inversion and over penalized-likelihood sinogram restoration and can be considered a good alternative in standard-dose regimes.

Systematic interpolation method predicts protein chromatographic elution with salt gradients, pH gradients and combined salt/pH gradients.

PubMed

Creasy, Arch; Barker, Gregory; Carta, Giorgio

2017-03-01

A methodology is presented to predict protein elution behavior from an ion exchange column using both individual or combined pH and salt gradients based on high-throughput batch isotherm data. The buffer compositions are first optimized to generate linear pH gradients from pH 5.5 to 7 with defined concentrations of sodium chloride. Next, high-throughput batch isotherm data are collected for a monoclonal antibody on the cation exchange resin POROS XS over a range of protein concentrations, salt concentrations, and solution pH. Finally, a previously developed empirical interpolation (EI) method is extended to describe protein binding as a function of the protein and salt concentration and solution pH without using an explicit isotherm model. The interpolated isotherm data are then used with a lumped kinetic model to predict the protein elution behavior. Experimental results obtained for laboratory scale columns show excellent agreement with the predicted elution curves for both individual or combined pH and salt gradients at protein loads up to 45 mg/mL of column. Numerical studies show that the model predictions are robust as long as the isotherm data cover the range of mobile phase compositions where the protein actually elutes from the column. Copyright © 2017 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

A unifying retinex model based on non-local differential operators

NASA Astrophysics Data System (ADS)

Zosso, Dominique; Tran, Giang; Osher, Stanley

2013-02-01

In this paper, we present a unifying framework for retinex that is able to reproduce many of the existing retinex implementations within a single model. The fundamental assumption, as shared with many retinex models, is that the observed image is a multiplication between the illumination and the true underlying reflectance of the object. Starting from Morel's 2010 PDE model for retinex, where illumination is supposed to vary smoothly and where the reflectance is thus recovered from a hard-thresholded Laplacian of the observed image in a Poisson equation, we define our retinex model in similar but more general two steps. First, look for a filtered gradient that is the solution of an optimization problem consisting of two terms: The first term is a sparsity prior of the reflectance, such as the TV or H1 norm, while the second term is a quadratic fidelity prior of the reflectance gradient with respect to the observed image gradients. In a second step, since this filtered gradient almost certainly is not a consistent image gradient, we then look for a reflectance whose actual gradient comes close. Beyond unifying existing models, we are able to derive entirely novel retinex formulations by using more interesting non-local versions for the sparsity and fidelity prior. Hence we define within a single framework new retinex instances particularly suited for texture-preserving shadow removal, cartoon-texture decomposition, color and hyperspectral image enhancement.

Adjoint Sensitivity Computations for an Embedded-Boundary Cartesian Mesh Method and CAD Geometry

NASA Technical Reports Server (NTRS)

Nemec, Marian; Aftosmis,Michael J.

2006-01-01

Cartesian-mesh methods are perhaps the most promising approach for addressing the issues of flow solution automation for aerodynamic design problems. In these methods, the discretization of the wetted surface is decoupled from that of the volume mesh. This not only enables fast and robust mesh generation for geometry of arbitrary complexity, but also facilitates access to geometry modeling and manipulation using parametric Computer-Aided Design (CAD) tools. Our goal is to combine the automation capabilities of Cartesian methods with an eficient computation of design sensitivities. We address this issue using the adjoint method, where the computational cost of the design sensitivities, or objective function gradients, is esseutially indepeudent of the number of design variables. In previous work, we presented an accurate and efficient algorithm for the solution of the adjoint Euler equations discretized on Cartesian meshes with embedded, cut-cell boundaries. Novel aspects of the algorithm included the computation of surface shape sensitivities for triangulations based on parametric-CAD models and the linearization of the coupling between the surface triangulation and the cut-cells. The objective of the present work is to extend our adjoint formulation to problems involving general shape changes. Central to this development is the computation of volume-mesh sensitivities to obtain a reliable approximation of the objective finction gradient. Motivated by the success of mesh-perturbation schemes commonly used in body-fitted unstructured formulations, we propose an approach based on a local linearization of a mesh-perturbation scheme similar to the spring analogy. This approach circumvents most of the difficulties that arise due to non-smooth changes in the cut-cell layer as the boundary shape evolves and provides a consistent approximation tot he exact gradient of the discretized abjective function. A detailed gradient accurace study is presented to verify our approach. Thereafter, we focus on a shape optimization problem for an Apollo-like reentry capsule. The optimization seeks to enhance the lift-to-drag ratio of the capsule by modifyjing the shape of its heat-shield in conjunction with a center-of-gravity (c.g.) offset. This multipoint and multi-objective optimization problem is used to demonstrate the overall effectiveness of the Cartesian adjoint method for addressing the issues of complex aerodynamic design. This abstract presents only a brief outline of the numerical method and results; full details will be given in the final paper.

Power Control and Optimization of Photovoltaic and Wind Energy Conversion Systems

NASA Astrophysics Data System (ADS)

Ghaffari, Azad

Power map and Maximum Power Point (MPP) of Photovoltaic (PV) and Wind Energy Conversion Systems (WECS) highly depend on system dynamics and environmental parameters, e.g., solar irradiance, temperature, and wind speed. Power optimization algorithms for PV systems and WECS are collectively known as Maximum Power Point Tracking (MPPT) algorithm. Gradient-based Extremum Seeking (ES), as a non-model-based MPPT algorithm, governs the system to its peak point on the steepest descent curve regardless of changes of the system dynamics and variations of the environmental parameters. Since the power map shape defines the gradient vector, then a close estimate of the power map shape is needed to create user assignable transients in the MPPT algorithm. The Hessian gives a precise estimate of the power map in a neighborhood around the MPP. The estimate of the inverse of the Hessian in combination with the estimate of the gradient vector are the key parts to implement the Newton-based ES algorithm. Hence, we generate an estimate of the Hessian using our proposed perturbation matrix. Also, we introduce a dynamic estimator to calculate the inverse of the Hessian which is an essential part of our algorithm. We present various simulations and experiments on the micro-converter PV systems to verify the validity of our proposed algorithm. The ES scheme can also be used in combination with other control algorithms to achieve desired closed-loop performance. The WECS dynamics is slow which causes even slower response time for the MPPT based on the ES. Hence, we present a control scheme, extended from Field-Oriented Control (FOC), in combination with feedback linearization to reduce the convergence time of the closed-loop system. Furthermore, the nonlinear control prevents magnetic saturation of the stator of the Induction Generator (IG). The proposed control algorithm in combination with the ES guarantees the closed-loop system robustness with respect to high level parameter uncertainty in the IG dynamics. The simulation results verify the effectiveness of the proposed algorithm.

Gel-based coloration technique for the submillimeter-scale imaging of labile phosphorus in sediments and soils with diffusive gradients in thin films.

PubMed

Ding, Shiming; Wang, Yan; Xu, Di; Zhu, Chungang; Zhang, Chaosheng

2013-07-16

We report a highly promising technique for the high-resolution imaging of labile phosphorus (P) in sediments and soils in combination with the diffusive gradients in thin films (DGT). This technique was based on the surface coloration of the Zr-oxide binding gel using the conventional molybdenum blue method following the DGT uptake of P to this gel. The accumulated mass of the P in the gel was then measured according to the grayscale intensity on the gel surface using computer-imaging densitometry. A pretreatment of the gel in hot water (85 °C) for 5 d was required to immobilize the phosphate and the formed blue complex in the gel during the color development. The optimal time required for a complete color development was determined to be 45 min. The appropriate volume of the coloring reagent added was 200 times of that of the gel. A calibration equation was established under the optimized conditions, based on which a quantitative measurement of P was obtained when the concentration of P in solutions ranged from 0.04 mg L(-1) to 4.1 mg L(-1) for a 24 h deployment of typical DGT devices at 25 °C. The suitability of the coloration technique was well demonstrated by the observation of small, discrete spots with elevated P concentrations in a sediment profile.

Optimization of computations for adjoint field and Jacobian needed in 3D CSEM inversion

NASA Astrophysics Data System (ADS)

Dehiya, Rahul; Singh, Arun; Gupta, Pravin K.; Israil, M.

2017-01-01

We present the features and results of a newly developed code, based on Gauss-Newton optimization technique, for solving three-dimensional Controlled-Source Electromagnetic inverse problem. In this code a special emphasis has been put on representing the operations by block matrices for conjugate gradient iteration. We show how in the computation of Jacobian, the matrix formed by differentiation of system matrix can be made independent of frequency to optimize the operations at conjugate gradient step. The coarse level parallel computing, using OpenMP framework, is used primarily due to its simplicity in implementation and accessibility of shared memory multi-core computing machine to almost anyone. We demonstrate how the coarseness of modeling grid in comparison to source (comp`utational receivers) spacing can be exploited for efficient computing, without compromising the quality of the inverted model, by reducing the number of adjoint calls. It is also demonstrated that the adjoint field can even be computed on a grid coarser than the modeling grid without affecting the inversion outcome. These observations were reconfirmed using an experiment design where the deviation of source from straight tow line is considered. Finally, a real field data inversion experiment is presented to demonstrate robustness of the code.

Accelerated gradient methods for the x-ray imaging of solar flares

NASA Astrophysics Data System (ADS)

Bonettini, S.; Prato, M.

2014-05-01

In this paper we present new optimization strategies for the reconstruction of x-ray images of solar flares by means of the data collected by the Reuven Ramaty high energy solar spectroscopic imager. The imaging concept of the satellite is based on rotating modulation collimator instruments, which allow the use of both Fourier imaging approaches and reconstruction techniques based on the straightforward inversion of the modulated count profiles. Although in the last decade, greater attention has been devoted to the former strategies due to their very limited computational cost, here we consider the latter model and investigate the effectiveness of different accelerated gradient methods for the solution of the corresponding constrained minimization problem. Moreover, regularization is introduced through either an early stopping of the iterative procedure, or a Tikhonov term added to the discrepancy function by means of a discrepancy principle accounting for the Poisson nature of the noise affecting the data.

3D theory of a high-gain free-electron laser based on a transverse gradient undulator

NASA Astrophysics Data System (ADS)

Baxevanis, Panagiotis; Ding, Yuantao; Huang, Zhirong; Ruth, Ronald

2014-02-01

The performance of a free-electron laser (FEL) depends significantly on the various parameters of the driving electron beam. In particular, a large energy spread in the beam results in a substantial reduction of the FEL gain, an effect which is especially relevant when one considers FELs driven by plasma accelerators or ultimate storage rings. For such cases, one possible solution is to use a transverse gradient undulator (TGU). In this concept, the energy spread problem is mitigated by properly dispersing the electron beam and introducing a linear, transverse field dependence in the undulator. This paper presents a self-consistent theoretical analysis of a TGU-based, high-gain FEL which takes into account three-dimensional (3D) effects, including beam size variations along the undulator. The results of our theory compare favorably with simulation and are used in fast optimization studies of various x-ray FEL configurations.

A TPMS-based method for modeling porous scaffolds for bionic bone tissue engineering.

PubMed

Shi, Jianping; Zhu, Liya; Li, Lan; Li, Zongan; Yang, Jiquan; Wang, Xingsong

2018-05-09

In the field of bone defect repair, gradient porous scaffolds have received increased attention because they provide a better environment for promoting tissue regeneration. In this study, we propose an effective method to generate bionic porous scaffolds based on the TPMS (triply periodic minimal surface) and SF (sigmoid function) methods. First, cortical bone morphological features (e.g., pore size and distribution) were determined for several regions of a rabbit femoral bone by analyzing CT-scans. A finite element method was used to evaluate the mechanical properties of the bone at these respective areas. These results were used to place different TPMS substructures into one scaffold domain with smooth transitions. The geometrical parameters of the scaffolds were optimized to match the elastic properties of a human bone. With this proposed method, a functional gradient porous scaffold could be designed and produced by an additive manufacturing method.

Analysis of low molecular weight acids by monolithic immobilized pH gradient-based capillary isoelectric focusing coupled with mass spectrometry.

PubMed

Wang, Tingting; Fekete, Agnes; Gaspar, Andras; Ma, Junfeng; Liang, Zhen; Yuan, Huiming; Zhang, Lihua; Schmitt-Kopplin, Philippe; Zhang, Yukui

2011-02-01

A novel method for the separation and detection of low molecular weight (LMW) acids was developed using monolithic immobilized pH gradient-based capillary isoelectric focusing coupled with mass spectrometry. Two main parameters, focusing conditions and delivery buffer conditions, which might affect separation efficiency, were optimized with the focusing time of 7 min at 350 V/cm and the delivery buffer of 50% (v/v) acetonitrile in 10 mmol/L ammonium formate (pH 3.0). Under these conditions, the linear correlation between the volume of delivery solvent and the pK(a) of the model components was observed. In addition, the separation mechanism of LMW acids was proposed as well. We suppose that this method may provide a useful tool for the characterization of LMW components (e.g. natural organic matter of different origins). Copyright © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Spin–orbit DFT with Analytic Gradients and Applications to Heavy Element Compounds

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Zhiyong

We have implemented the unrestricted DFT approach with one-electron spin–orbit operators in the massively parallel NWChem program. Also implemented is the analytic gradient in the DFT approach with spin–orbit interactions. The current capabilities include single-point calculations and geometry optimization. Vibrational frequencies can be calculated numerically from the analytically calculated gradients. The implementation is based on the spin–orbit interaction operator derived from the effective core potential approach. The exchange functionals used in the implementation are functionals derived for non-spin–orbit calculations, including GGA as well as hybrid functionals. Spin–orbit Hartree–Fock calculations can also be carried out. We have applied the spin–orbit DFTmore » methods to the Uranyl aqua complexes. We have optimized the structures and calculated the vibrational frequencies of both (UO2 2+)aq and (UO2 +)aq with and without spin–orbit effects. The effects of the spin–orbit interaction on the structures and frequencies of these two complexes are discussed. We also carried out calculations for Th2, and several low-lying electronic states are calculated. Our results indicate that, for open-shell systems, there are significant effects due to the spin–orbit effects and the electronic configurations with and without spin–orbit interactions could change due to the occupation of orbitals of larger spin–orbit interactions.« less

Precision sensing by two opposing gradient sensors: how does Escherichia coli find its preferred pH level?

PubMed

Hu, Bo; Tu, Yuhai

2013-07-02

It is essential for bacteria to find optimal conditions for their growth and survival. The optimal levels of certain environmental factors (such as pH and temperature) often correspond to some intermediate points of the respective gradients. This requires the ability of bacteria to navigate from both directions toward the optimum location and is distinct from the conventional unidirectional chemotactic strategy. Remarkably, Escherichia coli cells can perform such a precision sensing task in pH taxis by using the same chemotaxis machinery, but with opposite pH responses from two different chemoreceptors (Tar and Tsr). To understand bacterial pH sensing, we developed an Ising-type model for a mixed cluster of opposing receptors based on the push-pull mechanism. Our model can quantitatively explain experimental observations in pH taxis for various mutants and wild-type cells. We show how the preferred pH level depends on the relative abundance of the competing sensors and how the sensory activity regulates the behavioral response. Our model allows us to make quantitative predictions on signal integration of pH and chemoattractant stimuli. Our study reveals two general conditions and a robust push-pull scheme for precision sensing, which should be applicable in other adaptive sensory systems with opposing gradient sensors. Copyright © 2013 Biophysical Society. Published by Elsevier Inc. All rights reserved.

Numerical simulations on active shielding methods comparison and wrapped angle optimization for gradient coil design in MRI with enhanced shielding effect

NASA Astrophysics Data System (ADS)

Wang, Yaohui; Xin, Xuegang; Guo, Lei; Chen, Zhifeng; Liu, Feng

2018-05-01

The switching of a gradient coil current in magnetic resonance imaging will induce an eddy current in the surrounding conducting structures while the secondary magnetic field produced by the eddy current is harmful for the imaging. To minimize the eddy current effects, the stray field shielding in the gradient coil design is usually realized by minimizing the magnetic fields on the cryostat surface or the secondary magnetic fields over the imaging region. In this work, we explicitly compared these two active shielding design methods. Both the stray field and eddy current on the cryostat inner surface were quantitatively discussed by setting the stray field constraint with an ultra-low maximum intensity of 2 G and setting the secondary field constraint with an extreme small shielding ratio of 0.000 001. The investigation revealed that the secondary magnetic field control strategy can produce coils with a better performance. However, the former (minimizing the magnetic fields) is preferable when designing a gradient coil with an ultra-low eddy current that can also strictly control the stray field leakage at the edge of the cryostat inner surface. A wrapped-edge gradient coil design scheme was then optimized for a more effective control of the stray fields. The numerical simulation on the wrapped-edge coil design shows that the optimized wrapping angles for the x and z coils in terms of our coil dimensions are 40° and 90°, respectively.

Genetic programming assisted stochastic optimization strategies for optimization of glucose to gluconic acid fermentation.

PubMed

Cheema, Jitender Jit Singh; Sankpal, Narendra V; Tambe, Sanjeev S; Kulkarni, Bhaskar D

2002-01-01

This article presents two hybrid strategies for the modeling and optimization of the glucose to gluconic acid batch bioprocess. In the hybrid approaches, first a novel artificial intelligence formalism, namely, genetic programming (GP), is used to develop a process model solely from the historic process input-output data. In the next step, the input space of the GP-based model, representing process operating conditions, is optimized using two stochastic optimization (SO) formalisms, viz., genetic algorithms (GAs) and simultaneous perturbation stochastic approximation (SPSA). These SO formalisms possess certain unique advantages over the commonly used gradient-based optimization techniques. The principal advantage of the GP-GA and GP-SPSA hybrid techniques is that process modeling and optimization can be performed exclusively from the process input-output data without invoking the detailed knowledge of the process phenomenology. The GP-GA and GP-SPSA techniques have been employed for modeling and optimization of the glucose to gluconic acid bioprocess, and the optimized process operating conditions obtained thereby have been compared with those obtained using two other hybrid modeling-optimization paradigms integrating artificial neural networks (ANNs) and GA/SPSA formalisms. Finally, the overall optimized operating conditions given by the GP-GA method, when verified experimentally resulted in a significant improvement in the gluconic acid yield. The hybrid strategies presented here are generic in nature and can be employed for modeling and optimization of a wide variety of batch and continuous bioprocesses.

A homotopy algorithm for digital optimal projection control GASD-HADOC

NASA Technical Reports Server (NTRS)

Collins, Emmanuel G., Jr.; Richter, Stephen; Davis, Lawrence D.

1993-01-01

The linear-quadratic-gaussian (LQG) compensator was developed to facilitate the design of control laws for multi-input, multi-output (MIMO) systems. The compensator is computed by solving two algebraic equations for which standard closed-loop solutions exist. Unfortunately, the minimal dimension of an LQG compensator is almost always equal to the dimension of the plant and can thus often violate practical implementation constraints on controller order. This deficiency is especially highlighted when considering control-design for high-order systems such as flexible space structures. This deficiency motivated the development of techniques that enable the design of optimal controllers whose dimension is less than that of the design plant. A homotopy approach based on the optimal projection equations that characterize the necessary conditions for optimal reduced-order control. Homotopy algorithms have global convergence properties and hence do not require that the initializing reduced-order controller be close to the optimal reduced-order controller to guarantee convergence. However, the homotopy algorithm previously developed for solving the optimal projection equations has sublinear convergence properties and the convergence slows at higher authority levels and may fail. A new homotopy algorithm for synthesizing optimal reduced-order controllers for discrete-time systems is described. Unlike the previous homotopy approach, the new algorithm is a gradient-based, parameter optimization formulation and was implemented in MATLAB. The results reported may offer the foundation for a reliable approach to optimal, reduced-order controller design.

Convis: A Toolbox to Fit and Simulate Filter-Based Models of Early Visual Processing

PubMed Central

Huth, Jacob; Masquelier, Timothée; Arleo, Angelo

2018-01-01

We developed Convis, a Python simulation toolbox for large scale neural populations which offers arbitrary receptive fields by 3D convolutions executed on a graphics card. The resulting software proves to be flexible and easily extensible in Python, while building on the PyTorch library (The Pytorch Project, 2017), which was previously used successfully in deep learning applications, for just-in-time optimization and compilation of the model onto CPU or GPU architectures. An alternative implementation based on Theano (Theano Development Team, 2016) is also available, although not fully supported. Through automatic differentiation, any parameter of a specified model can be optimized to approach a desired output which is a significant improvement over e.g., Monte Carlo or particle optimizations without gradients. We show that a number of models including even complex non-linearities such as contrast gain control and spiking mechanisms can be implemented easily. We show in this paper that we can in particular recreate the simulation results of a popular retina simulation software VirtualRetina (Wohrer and Kornprobst, 2009), with the added benefit of providing (1) arbitrary linear filters instead of the product of Gaussian and exponential filters and (2) optimization routines utilizing the gradients of the model. We demonstrate the utility of 3d convolution filters with a simple direction selective filter. Also we show that it is possible to optimize the input for a certain goal, rather than the parameters, which can aid the design of experiments as well as closed-loop online stimulus generation. Yet, Convis is more than a retina simulator. For instance it can also predict the response of V1 orientation selective cells. Convis is open source under the GPL-3.0 license and available from https://github.com/jahuth/convis/ with documentation at https://jahuth.github.io/convis/. PMID:29563867

Littoral transport rates in the Santa Barbara Littoral Cell: a process-based model analysis

USGS Publications Warehouse

Elias, E. P. L.; Barnard, Patrick L.; Brocatus, John

2009-01-01

Identification of the sediment transport patterns and pathways is essential for sustainable coastal zone management of the heavily modified coastline of Santa Barbara and Ventura County (California, USA). A process-based model application, based on Delft3D Online Morphology, is used to investigate the littoral transport potential along the Santa Barbara Littoral Cell (between Point Conception and Mugu Canyon). An advanced optimalization procedure is applied to enable annual sediment transport computations by reducing the ocean wave climate in 10 wave height - direction classes. Modeled littoral transport rates compare well with observed dredging volumes, and erosion or sedimentation hotspots coincide with the modeled divergence and convergence of the transport gradients. Sediment transport rates are strongly dependent on the alongshore variation in wave height due to wave sheltering, diffraction and focusing by the Northern Channel Islands, and the local orientation of the geologically-controlled coastline. Local transport gradients exceed the net eastward littoral transport, and are considered a primary driver for hot-spot erosion.

Control Theory based Shape Design for the Incompressible Navier-Stokes Equations

NASA Astrophysics Data System (ADS)

Cowles, G.; Martinelli, L.

2003-12-01

A design method for shape optimization in incompressible turbulent viscous flow has been developed and validated for inverse design. The gradient information is determined using a control theory based algorithm. With such an approach, the cost of computing the gradient is negligible. An additional adjoint system must be solved which requires the cost of a single steady state flow solution. Thus, this method has an enormous advantage over traditional finite-difference based algorithms. The method of artificial compressibility is utilized to solve both the flow and adjoint systems. An algebraic turbulence model is used to compute the eddy viscosity. The method is validated using several inverse wing design test cases. In each case, the program must modify the shape of the initial wing such that its pressure distribution matches that of the target wing. Results are shown for the inversion of both finite thickness wings as well as zero thickness wings which can be considered a model of yacht sails.

Novel Scalable 3-D MT Inverse Solver

NASA Astrophysics Data System (ADS)

Kuvshinov, A. V.; Kruglyakov, M.; Geraskin, A.

2016-12-01

We present a new, robust and fast, three-dimensional (3-D) magnetotelluric (MT) inverse solver. As a forward modelling engine a highly-scalable solver extrEMe [1] is used. The (regularized) inversion is based on an iterative gradient-type optimization (quasi-Newton method) and exploits adjoint sources approach for fast calculation of the gradient of the misfit. The inverse solver is able to deal with highly detailed and contrasting models, allows for working (separately or jointly) with any type of MT (single-site and/or inter-site) responses, and supports massive parallelization. Different parallelization strategies implemented in the code allow for optimal usage of available computational resources for a given problem set up. To parameterize an inverse domain a mask approach is implemented, which means that one can merge any subset of forward modelling cells in order to account for (usually) irregular distribution of observation sites. We report results of 3-D numerical experiments aimed at analysing the robustness, performance and scalability of the code. In particular, our computational experiments carried out at different platforms ranging from modern laptops to high-performance clusters demonstrate practically linear scalability of the code up to thousands of nodes. 1. Kruglyakov, M., A. Geraskin, A. Kuvshinov, 2016. Novel accurate and scalable 3-D MT forward solver based on a contracting integral equation method, Computers and Geosciences, in press.

Adjoint shape optimization for fluid-structure interaction of ducted flows

NASA Astrophysics Data System (ADS)

Heners, J. P.; Radtke, L.; Hinze, M.; Düster, A.

2018-03-01

Based on the coupled problem of time-dependent fluid-structure interaction, equations for an appropriate adjoint problem are derived by the consequent use of the formal Lagrange calculus. Solutions of both primal and adjoint equations are computed in a partitioned fashion and enable the formulation of a surface sensitivity. This sensitivity is used in the context of a steepest descent algorithm for the computation of the required gradient of an appropriate cost functional. The efficiency of the developed optimization approach is demonstrated by minimization of the pressure drop in a simple two-dimensional channel flow and in a three-dimensional ducted flow surrounded by a thin-walled structure.

Remote-loading labeling of liposomes with (99m)Tc-BMEDA and its stability evaluation: effects of lipid formulation and pH/chemical gradient.

PubMed

Li, Shihong; Goins, Beth; Phillips, William T; Bao, Ande

2011-03-01

Efficient, convenient, and stable radiolabeling plays a critical role for the monitoring of liposome behavior via either blood sampling, organ distribution, or noninvasive nuclear imaging. The direct labeling of liposome-carrying drugs without any prior modification undoubtedly is convenient and optimal for liposomal drug testing. In this article, we investigated the effect of various lipid formulations and pH/chemical gradients on the radiolabeling efficiency and entrapment stability of technetium-99m ((99m)Tc) remotely loaded into liposomes, using (99m)Tc-N,N-bis(2-mercaptoethyl)-N',N'-diethyl-ethylenediamine ((99m)Tc-BMEDA) complex. The tested liposomes either contained unsaturated lipid or possessed various surface charges. (99m)Tc could be efficiently loaded into various premanufactured liposomes containing either an ammonium sulfate pH, citrate pH, or glutathione (GSH) chemical gradient. (99m)Tc-entrapment stabilities of these liposomes in phosphate-buffered saline (PBS; pH 7.4) buffer at 25°C were mainly dependent on the pH/chemical gradient, but not lipid formulation. Stability sequence was ammonium sulfate pH-gradient>citrate pH-gradient>GSH-gradient. Stabilities of (99m)Tc-liposomes in 50% fetal bovine serum (FBS)/PBS (pH 7.4) buffer at 37°C are dependent on both lipid formulation and pH/chemical gradient. Specifically, (99m)Tc labeling of the ammonium sulfate pH-gradient liposomes were less stable in 50% FBS/PBS than in PBS, whereas noncationic liposomes with citrate pH- or GSH-gradient displayed higher stability, except that anionic citrate pH-gradient liposomes showed no stability difference in these two media. Cationic liposomes aggregated in 50% FBS/PBS, forming a new discrete fraction with larger particle sizes. These in vitro characterization results have indicated the optimism of using (99m)Tc-BMEDA for labeling pH/GSH gradient liposomes without the requirement of modifying lipid formulation for liposomal therapeutic-agent development.

Efficient Online Learning Algorithms Based on LSTM Neural Networks.

PubMed

Ergen, Tolga; Kozat, Suleyman Serdar

2017-09-13

We investigate online nonlinear regression and introduce novel regression structures based on the long short term memory (LSTM) networks. For the introduced structures, we also provide highly efficient and effective online training methods. To train these novel LSTM-based structures, we put the underlying architecture in a state space form and introduce highly efficient and effective particle filtering (PF)-based updates. We also provide stochastic gradient descent and extended Kalman filter-based updates. Our PF-based training method guarantees convergence to the optimal parameter estimation in the mean square error sense provided that we have a sufficient number of particles and satisfy certain technical conditions. More importantly, we achieve this performance with a computational complexity in the order of the first-order gradient-based methods by controlling the number of particles. Since our approach is generic, we also introduce a gated recurrent unit (GRU)-based approach by directly replacing the LSTM architecture with the GRU architecture, where we demonstrate the superiority of our LSTM-based approach in the sequential prediction task via different real life data sets. In addition, the experimental results illustrate significant performance improvements achieved by the introduced algorithms with respect to the conventional methods over several different benchmark real life data sets.

Microfluidic platform for optimization of crystallization conditions

NASA Astrophysics Data System (ADS)

Zhang, Shuheng; Gerard, Charline J. J.; Ikni, Aziza; Ferry, Gilles; Vuillard, Laurent M.; Boutin, Jean A.; Ferte, Nathalie; Grossier, Romain; Candoni, Nadine; Veesler, Stéphane

2017-08-01

We describe a universal, high-throughput droplet-based microfluidic platform for crystallization. It is suitable for a multitude of applications, due to its flexibility, ease of use, compatibility with all solvents and low cost. The platform offers four modular functions: droplet formation, on-line characterization, incubation and observation. We use it to generate droplet arrays with a concentration gradient in continuous long tubing, without using surfactant. We control droplet properties (size, frequency and spacing) in long tubing by using hydrodynamic empirical relations. We measure droplet chemical composition using both an off-line and a real-time on-line method. Applying this platform to a complicated chemical environment, membrane proteins, we successfully handle crystallization, suggesting that the platform is likely to perform well in other circumstances. We validate the platform for fine-gradient screening and optimization of crystallization conditions. Additional on-line detection methods may well be integrated into this platform in the future, for instance, an on-line diffraction technique. We believe this method could find applications in fields such as fluid interaction engineering, live cell study and enzyme kinetics.

Efficient gradient-based Monte Carlo simulation of materials: Applications to amorphous Si and Fe and Ni clusters

NASA Astrophysics Data System (ADS)

Limbu, Dil; Biswas, Parthapratim

We present a simple and efficient Monte-Carlo (MC) simulation of Iron (Fe) and Nickel (Ni) clusters with N =5-100 and amorphous Silicon (a-Si) starting from a random configuration. Using Sutton-Chen and Finnis-Sinclair potentials for Ni (in fcc lattice) and Fe (in bcc lattice), and Stillinger-Weber potential for a-Si, respectively, the total energy of the system is optimized by employing MC moves that include both the stochastic nature of MC simulations and the gradient of the potential function. For both iron and nickel clusters, the energy of the configurations is found to be very close to the values listed in the Cambridge Cluster Database, whereas the maximum force on each cluster is found to be much lower than the corresponding value obtained from the optimized structural configurations reported in the database. An extension of the method to model the amorphous state of Si is presented and the results are compared with experimental data and those obtained from other simulation methods. The work is partially supported by the NSF under Grant Number DMR 1507166.

Teaching Simulation and Computer-Aided Separation Optimization in Liquid Chromatography by Means of Illustrative Microsoft Excel Spreadsheets

ERIC Educational Resources Information Center

Fasoula, S.; Nikitas, P.; Pappa-Louisi, A.

2017-01-01

A series of Microsoft Excel spreadsheets were developed to simulate the process of separation optimization under isocratic and simple gradient conditions. The optimization procedure is performed in a stepwise fashion using simple macros for an automatic application of this approach. The proposed optimization approach involves modeling of the peak…

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

PubMed

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.

A nano ultra-performance liquid chromatography-high resolution mass spectrometry approach for global metabolomic profiling and case study on drug-resistant multiple myeloma.

PubMed

Jones, Drew R; Wu, Zhiping; Chauhan, Dharminder; Anderson, Kenneth C; Peng, Junmin

2014-04-01

Global metabolomics relies on highly reproducible and sensitive detection of a wide range of metabolites in biological samples. Here we report the optimization of metabolome analysis by nanoflow ultraperformance liquid chromatography coupled to high-resolution orbitrap mass spectrometry. Reliable peak features were extracted from the LC-MS runs based on mandatory detection in duplicates and additional noise filtering according to blank injections. The run-to-run variation in peak area showed a median of 14%, and the false discovery rate during a mock comparison was evaluated. To maximize the number of peak features identified, we systematically characterized the effect of sample loading amount, gradient length, and MS resolution. The number of features initially rose and later reached a plateau as a function of sample amount, fitting a hyperbolic curve. Longer gradients improved unique feature detection in part by time-resolving isobaric species. Increasing the MS resolution up to 120000 also aided in the differentiation of near isobaric metabolites, but higher MS resolution reduced the data acquisition rate and conferred no benefits, as predicted from a theoretical simulation of possible metabolites. Moreover, a biphasic LC gradient allowed even distribution of peak features across the elution, yielding markedly more peak features than the linear gradient. Using this robust nUPLC-HRMS platform, we were able to consistently analyze ~6500 metabolite features in a single 60 min gradient from 2 mg of yeast, equivalent to ~50 million cells. We applied this optimized method in a case study of drug (bortezomib) resistant and drug-sensitive multiple myeloma cells. Overall, 18% of metabolite features were matched to KEGG identifiers, enabling pathway enrichment analysis. Principal component analysis and heat map data correctly clustered isogenic phenotypes, highlighting the potential for hundreds of small molecule biomarkers of cancer drug resistance.

Nonseparable exchange–correlation functional for molecules, including homogeneous catalysis involving transition metals

DOE Office of Scientific and Technical Information (OSTI.GOV)

Yu, Haoyu S.; Zhang, Wenjing; Verma, Pragya

2015-01-01

The goal of this work is to develop a gradient approximation to the exchange–correlation functional of Kohn–Sham density functional theory for treating molecular problems with a special emphasis on the prediction of quantities important for homogeneous catalysis and other molecular energetics. Our training and validation of exchange–correlation functionals is organized in terms of databases and subdatabases. The key properties required for homogeneous catalysis are main group bond energies (database MGBE137), transition metal bond energies (database TMBE32), reaction barrier heights (database BH76), and molecular structures (database MS10). We also consider 26 other databases, most of which are subdatabases of a newlymore » extended broad database called Database 2015, which is presented in the present article and in its ESI. Based on the mathematical form of a nonseparable gradient approximation (NGA), as first employed in the N12 functional, we design a new functional by using Database 2015 and by adding smoothness constraints to the optimization of the functional. The resulting functional is called the gradient approximation for molecules, or GAM. The GAM functional gives better results for MGBE137, TMBE32, and BH76 than any available generalized gradient approximation (GGA) or than N12. The GAM functional also gives reasonable results for MS10 with an MUE of 0.018 Å. The GAM functional provides good results both within the training sets and outside the training sets. The convergence tests and the smooth curves of exchange–correlation enhancement factor as a function of the reduced density gradient show that the GAM functional is a smooth functional that should not lead to extra expense or instability in optimizations. NGAs, like GGAs, have the advantage over meta-GGAs and hybrid GGAs of respectively smaller grid-size requirements for integrations and lower costs for extended systems. These computational advantages combined with the relatively high accuracy for all the key properties needed for molecular catalysis make the GAM functional very promising for future applications.« less

Approach for Input Uncertainty Propagation and Robust Design in CFD Using Sensitivity Derivatives

NASA Technical Reports Server (NTRS)

Putko, Michele M.; Taylor, Arthur C., III; Newman, Perry A.; Green, Lawrence L.

2002-01-01

An implementation of the approximate statistical moment method for uncertainty propagation and robust optimization for quasi 3-D Euler CFD code is presented. Given uncertainties in statistically independent, random, normally distributed input variables, first- and second-order statistical moment procedures are performed to approximate the uncertainty in the CFD output. Efficient calculation of both first- and second-order sensitivity derivatives is required. In order to assess the validity of the approximations, these moments are compared with statistical moments generated through Monte Carlo simulations. The uncertainties in the CFD input variables are also incorporated into a robust optimization procedure. For this optimization, statistical moments involving first-order sensitivity derivatives appear in the objective function and system constraints. Second-order sensitivity derivatives are used in a gradient-based search to successfully execute a robust optimization. The approximate methods used throughout the analyses are found to be valid when considering robustness about input parameter mean values.

Analysis of the Hessian for Aerodynamic Optimization: Inviscid Flow

NASA Technical Reports Server (NTRS)

Arian, Eyal; Ta'asan, Shlomo

1996-01-01

In this paper we analyze inviscid aerodynamic shape optimization problems governed by the full potential and the Euler equations in two and three dimensions. The analysis indicates that minimization of pressure dependent cost functions results in Hessians whose eigenvalue distributions are identical for the full potential and the Euler equations. However the optimization problems in two and three dimensions are inherently different. While the two dimensional optimization problems are well-posed the three dimensional ones are ill-posed. Oscillations in the shape up to the smallest scale allowed by the design space can develop in the direction perpendicular to the flow, implying that a regularization is required. A natural choice of such a regularization is derived. The analysis also gives an estimate of the Hessian's condition number which implies that the problems at hand are ill-conditioned. Infinite dimensional approximations for the Hessians are constructed and preconditioners for gradient based methods are derived from these approximate Hessians.

Employing Sensitivity Derivatives for Robust Optimization under Uncertainty in CFD

NASA Technical Reports Server (NTRS)

Newman, Perry A.; Putko, Michele M.; Taylor, Arthur C., III

2004-01-01

A robust optimization is demonstrated on a two-dimensional inviscid airfoil problem in subsonic flow. Given uncertainties in statistically independent, random, normally distributed flow parameters (input variables), an approximate first-order statistical moment method is employed to represent the Computational Fluid Dynamics (CFD) code outputs as expected values with variances. These output quantities are used to form the objective function and constraints. The constraints are cast in probabilistic terms; that is, the probability that a constraint is satisfied is greater than or equal to some desired target probability. Gradient-based robust optimization of this stochastic problem is accomplished through use of both first and second-order sensitivity derivatives. For each robust optimization, the effect of increasing both input standard deviations and target probability of constraint satisfaction are demonstrated. This method provides a means for incorporating uncertainty when considering small deviations from input mean values.

Optimization of an exchange-correlation density functional for water

DOE Office of Scientific and Technical Information (OSTI.GOV)

Fritz, Michelle; Fernández-Serra, Marivi; Institute for Advanced Computational Science, Stony Brook University, Stony Brook, New York 11794-3800

2016-06-14

We describe a method, that we call data projection onto parameter space (DPPS), to optimize an energy functional of the electron density, so that it reproduces a dataset of experimental magnitudes. Our scheme, based on Bayes theorem, constrains the optimized functional not to depart unphysically from existing ab initio functionals. The resulting functional maximizes the probability of being the “correct” parameterization of a given functional form, in the sense of Bayes theory. The application of DPPS to water sheds new light on why density functional theory has performed rather poorly for liquid water, on what improvements are needed, and onmore » the intrinsic limitations of the generalized gradient approximation to electron exchange and correlation. Finally, we present tests of our water-optimized functional, that we call vdW-DF-w, showing that it performs very well for a variety of condensed water systems.« less

Overcoming limits to near-field radiative heat transfer in uniform planar media through multilayer optimization.

PubMed

Jin, Weiliang; Messina, Riccardo; Rodriguez, Alejandro W

2017-06-26

Radiative heat transfer between uniform plates is bounded by the narrow range and limited contribution of surface waves. Using a combination of analytical calculations and numerical gradient-based optimization, we show that such a limitation can be overcome in complicated multilayer geometries, allowing the scattering and coupling rates of slab resonances to be altered over a broad range of evanescent wavevectors. We conclude that while the radiative flux between two inhomogeneous slabs can only be weakly enhanced, the flux between a dipolar particle and an inhomogeneous slab-proportional to the local density of states-can be orders of magnitude larger, albeit at the expense of increased frequency selectivity. A brief discussion of hyperbolic metamaterials shows that they provide far less enhancement than optimized inhomogeneous slabs.

Retention modeling under organic modifier gradient conditions in ion-pair reversed-phase chromatography. Application to the separation of a set of underivatized amino acids.

PubMed

Pappa-Louisi, A; Agrafiotou, P; Papachristos, K

2010-07-01

The combined effect of the ion-pairing reagent concentration, C(ipr), and organic modifier content, phi, on the retention under phi-gradient conditions at different constant C(ipr) was treated in this study by using two approaches. In the first approach, the prediction of the retention time of a sample solute is based on a direct fitting procedure of a proper retention model to 3-D phi-gradient retention data obtained under the same phi-linear variation but with different slope and time duration of the initial isocratic part and in the presence of various constant C(ipr) values in the eluent. The second approach is based on a retention model describing the combined effect of C(ipr) and phi on the retention of solutes in isocratic mode and consequently analyzes isocratic data obtained in mobile phases containing different C(ipr) values. The effectiveness of the above approaches was tested in the retention prediction of a mixture of 16 underivatized amino acids using mobile phases containing acetonitrile as organic modifier and sodium dodecyl sulfate as ion-pairing reagent. From these approaches, only the first one gives satisfactory predictions and can be successfully used in optimization of ion-pair chromatographic separations under gradient conditions. The failure of the second approach to predict the retention of solutes in the gradient elution mode in the presence of different C(ipr) values was attributed to slow changes in the distribution equilibrium of ion-pairing reagents caused by phi-variation.

Detection of buried magnetic objects by a SQUID gradiometer system

NASA Astrophysics Data System (ADS)

Meyer, Hans-Georg; Hartung, Konrad; Linzen, Sven; Schneider, Michael; Stolz, Ronny; Fried, Wolfgang; Hauspurg, Sebastian

2009-05-01

We present a magnetic detection system based on superconducting gradiometric sensors (SQUID gradiometers). The system provides a unique fast mapping of large areas with a high resolution of the magnetic field gradient as well as the local position. A main part of this work is the localization and classification of magnetic objects in the ground by automatic interpretation of geomagnetic field gradients, measured by the SQUID system. In accordance with specific features the field is decomposed into segments, which allow inferences to possible objects in the ground. The global consideration of object describing properties and their optimization using error minimization methods allows the reconstruction of superimposed features and detection of buried objects. The analysis system of measured geomagnetic fields works fully automatically. By a given surface of area-measured gradients the algorithm determines within numerical limits the absolute position of objects including depth with sub-pixel accuracy and allows an arbitrary position and attitude of sources. Several SQUID gradiometer data sets were used to show the applicability of the analysis algorithm.

Single shot trajectory design for region-specific imaging using linear and nonlinear magnetic encoding fields.

PubMed

Layton, Kelvin J; Gallichan, Daniel; Testud, Frederik; Cocosco, Chris A; Welz, Anna M; Barmet, Christoph; Pruessmann, Klaas P; Hennig, Jürgen; Zaitsev, Maxim

2013-09-01

It has recently been demonstrated that nonlinear encoding fields result in a spatially varying resolution. This work develops an automated procedure to design single-shot trajectories that create a local resolution improvement in a region of interest. The technique is based on the design of optimized local k-space trajectories and can be applied to arbitrary hardware configurations that employ any number of linear and nonlinear encoding fields. The trajectories designed in this work are tested with the currently available hardware setup consisting of three standard linear gradients and two quadrupolar encoding fields generated from a custom-built gradient insert. A field camera is used to measure the actual encoding trajectories up to third-order terms, enabling accurate reconstructions of these demanding single-shot trajectories, although the eddy current and concomitant field terms of the gradient insert have not been completely characterized. The local resolution improvement is demonstrated in phantom and in vivo experiments. Copyright © 2012 Wiley Periodicals, Inc.

Accelerated iterative beam angle selection in IMRT

DOE Office of Scientific and Technical Information (OSTI.GOV)

Bangert, Mark, E-mail: m.bangert@dkfz.de; Unkelbach, Jan

2016-03-15

Purpose: Iterative methods for beam angle selection (BAS) for intensity-modulated radiation therapy (IMRT) planning sequentially construct a beneficial ensemble of beam directions. In a naïve implementation, the nth beam is selected by adding beam orientations one-by-one from a discrete set of candidates to an existing ensemble of (n − 1) beams. The best beam orientation is identified in a time consuming process by solving the fluence map optimization (FMO) problem for every candidate beam and selecting the beam that yields the largest improvement to the objective function value. This paper evaluates two alternative methods to accelerate iterative BAS based onmore » surrogates for the FMO objective function value. Methods: We suggest to select candidate beams not based on the FMO objective function value after convergence but (1) based on the objective function value after five FMO iterations of a gradient based algorithm and (2) based on a projected gradient of the FMO problem in the first iteration. The performance of the objective function surrogates is evaluated based on the resulting objective function values and dose statistics in a treatment planning study comprising three intracranial, three pancreas, and three prostate cases. Furthermore, iterative BAS is evaluated for an application in which a small number of noncoplanar beams complement a set of coplanar beam orientations. This scenario is of practical interest as noncoplanar setups may require additional attention of the treatment personnel for every couch rotation. Results: Iterative BAS relying on objective function surrogates yields similar results compared to naïve BAS with regard to the objective function values and dose statistics. At the same time, early stopping of the FMO and using the projected gradient during the first iteration enable reductions in computation time by approximately one to two orders of magnitude. With regard to the clinical delivery of noncoplanar IMRT treatments, we could show that optimized beam ensembles using only a few noncoplanar beam orientations often approach the plan quality of fully noncoplanar ensembles. Conclusions: We conclude that iterative BAS in combination with objective function surrogates can be a viable option to implement automated BAS at clinically acceptable computation times.« less

Accelerated iterative beam angle selection in IMRT.

PubMed

Bangert, Mark; Unkelbach, Jan

2016-03-01

Iterative methods for beam angle selection (BAS) for intensity-modulated radiation therapy (IMRT) planning sequentially construct a beneficial ensemble of beam directions. In a naïve implementation, the nth beam is selected by adding beam orientations one-by-one from a discrete set of candidates to an existing ensemble of (n - 1) beams. The best beam orientation is identified in a time consuming process by solving the fluence map optimization (FMO) problem for every candidate beam and selecting the beam that yields the largest improvement to the objective function value. This paper evaluates two alternative methods to accelerate iterative BAS based on surrogates for the FMO objective function value. We suggest to select candidate beams not based on the FMO objective function value after convergence but (1) based on the objective function value after five FMO iterations of a gradient based algorithm and (2) based on a projected gradient of the FMO problem in the first iteration. The performance of the objective function surrogates is evaluated based on the resulting objective function values and dose statistics in a treatment planning study comprising three intracranial, three pancreas, and three prostate cases. Furthermore, iterative BAS is evaluated for an application in which a small number of noncoplanar beams complement a set of coplanar beam orientations. This scenario is of practical interest as noncoplanar setups may require additional attention of the treatment personnel for every couch rotation. Iterative BAS relying on objective function surrogates yields similar results compared to naïve BAS with regard to the objective function values and dose statistics. At the same time, early stopping of the FMO and using the projected gradient during the first iteration enable reductions in computation time by approximately one to two orders of magnitude. With regard to the clinical delivery of noncoplanar IMRT treatments, we could show that optimized beam ensembles using only a few noncoplanar beam orientations often approach the plan quality of fully noncoplanar ensembles. We conclude that iterative BAS in combination with objective function surrogates can be a viable option to implement automated BAS at clinically acceptable computation times.

Dynamic Aberration Correction for Conformal Window of High-Speed Aircraft Using Optimized Model-Based Wavefront Sensorless Adaptive Optics.

PubMed

Dong, Bing; Li, Yan; Han, Xin-Li; Hu, Bin

2016-09-02

For high-speed aircraft, a conformal window is used to optimize the aerodynamic performance. However, the local shape of the conformal window leads to large amounts of dynamic aberrations varying with look angle. In this paper, deformable mirror (DM) and model-based wavefront sensorless adaptive optics (WSLAO) are used for dynamic aberration correction of an infrared remote sensor equipped with a conformal window and scanning mirror. In model-based WSLAO, aberration is captured using Lukosz mode, and we use the low spatial frequency content of the image spectral density as the metric function. Simulations show that aberrations induced by the conformal window are dominated by some low-order Lukosz modes. To optimize the dynamic correction, we can only correct dominant Lukosz modes and the image size can be minimized to reduce the time required to compute the metric function. In our experiment, a 37-channel DM is used to mimic the dynamic aberration of conformal window with scanning rate of 10 degrees per second. A 52-channel DM is used for correction. For a 128 × 128 image, the mean value of image sharpness during dynamic correction is 1.436 × 10(-5) in optimized correction and is 1.427 × 10(-5) in un-optimized correction. We also demonstrated that model-based WSLAO can achieve convergence two times faster than traditional stochastic parallel gradient descent (SPGD) method.

A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

NASA Technical Reports Server (NTRS)

Venter, Gerhard; Sobieszczanski-Sobieski, Jaroslaw

2005-01-01

A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

Adaptive synchronized switch damping on an inductor: a self-tuning switching law

NASA Astrophysics Data System (ADS)

Kelley, Christopher R.; Kauffman, Jeffrey L.

2017-03-01

Synchronized switch damping (SSD) techniques exploit low-power switching between passive circuits connected to piezoelectric material to reduce structural vibration. In the classical implementation of SSD, the piezoelectric material remains in an open circuit for the majority of the vibration cycle and switches briefly to a shunt circuit at every displacement extremum. Recent research indicates that this switch timing is only optimal for excitation exactly at resonance and points to more general optimal switch criteria based on the phase of the displacement and the system parameters. This work proposes a self-tuning approach that implements the more general optimal switch timing for synchronized switch damping on an inductor (SSDI) without needing any knowledge of the system parameters. The law involves a gradient-based search optimization that is robust to noise and uncertainties in the system. Testing of a physical implementation confirms this law successfully adapts to the frequency and parameters of the system. Overall, the adaptive SSDI controller provides better off-resonance steady-state vibration reduction than classical SSDI while matching performance at resonance.

Light acclimation optimizes leaf functional traits despite height-related constraints in a canopy shading experiment.

PubMed

Coble, Adam P; Cavaleri, Molly A

2015-04-01

Within-canopy gradients of leaf functional traits have been linked to both light availability and vertical gradients in leaf water potential. While observational studies can reveal patterns in leaf traits, within-canopy experimental manipulations can provide mechanistic insight to tease apart multiple interacting drivers. Our objectives were to disentangle effects of height and light environment on leaf functional traits by experimentally shading branches along vertical gradients within a sugar maple (Acer saccharum) forest. Shading reduced leaf mass per area (LMA), leaf density, area-based leaf nitrogen (N(area)), and carbon:nitrogen (C:N) ratio, and increased mass-based leaf nitrogen (N(mass)), highlighting the importance of light availability on leaf morphology and chemistry. Early in the growing season, midday leaf water potential (Ψ(mid)), LMA, and N(area) were driven primarily by height; later in the growing season, light became the most important driver for LMA and Narea. Carbon isotope composition (δ(13)C) displayed strong, linear correlations with height throughout the growing season, but did not change with shading, implying that height is more influential than light on water use efficiency and stomatal behavior. LMA, leaf density, N(mass), C:N ratio, and δ(13)C all changed seasonally, suggesting that leaf ageing effects on leaf functional traits are equally as important as microclimatic conditions. Overall, our results indicate that: (1) stomatal sensitivity to vapor pressure deficit or Ψ(mid) constrains the supply of CO2 to leaves at higher heights, independent of light environment, and (2) LMA and N(area) distributions become functionally optimized through morphological acclimation to light with increasing leaf age despite height-related constraints.

Vectorial mask optimization methods for robust optical lithography

NASA Astrophysics Data System (ADS)

Ma, Xu; Li, Yanqiu; Guo, Xuejia; Dong, Lisong; Arce, Gonzalo R.

2012-10-01

Continuous shrinkage of critical dimension in an integrated circuit impels the development of resolution enhancement techniques for low k1 lithography. Recently, several pixelated optical proximity correction (OPC) and phase-shifting mask (PSM) approaches were developed under scalar imaging models to account for the process variations. However, the lithography systems with larger-NA (NA>0.6) are predominant for current technology nodes, rendering the scalar models inadequate to describe the vector nature of the electromagnetic field that propagates through the optical lithography system. In addition, OPC and PSM algorithms based on scalar models can compensate for wavefront aberrations, but are incapable of mitigating polarization aberrations in practical lithography systems, which can only be dealt with under the vector model. To this end, we focus on developing robust pixelated gradient-based OPC and PSM optimization algorithms aimed at canceling defocus, dose variation, wavefront and polarization aberrations under a vector model. First, an integrative and analytic vector imaging model is applied to formulate the optimization problem, where the effects of process variations are explicitly incorporated in the optimization framework. A steepest descent algorithm is then used to iteratively optimize the mask patterns. Simulations show that the proposed algorithms can effectively improve the process windows of the optical lithography systems.

Moving force identification based on modified preconditioned conjugate gradient method

NASA Astrophysics Data System (ADS)

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.

Tunable two-dimensional liquid gradient refractive index (L-GRIN) lens for variable light focusing.

PubMed

Huang, Hua; Mao, Xiaole; Lin, Sz-Chin Steven; Kiraly, Brian; Huang, Yiping; Huang, Tony Jun

2010-09-21

We report a two-dimensional (2D) tunable liquid gradient refractive index (L-GRIN) lens for variable focusing of light in the out-of-plane direction. This lens focuses a light beam through a liquid medium with a 2D hyperbolic secant (HS) refractive index gradient. The refractive index gradient is established in a microfluidic chamber through the diffusion between two fluids with different refractive indices, i.e. CaCl(2) solution and deionized (DI) water. The 2D HS refractive index profile and subsequently the focal length of the L-GRIN lens can be tuned by changing the ratio of the flow rates of the CaCl(2) solution and DI water. The focusing effect is experimentally characterized through side-view and top-view image analysis, and the experimental data match well with the results from ray-tracing optical simulations. Advantages of the 2D L-GRIN lens include simple device fabrication procedure, low fluid consumption rate, convenient lens-tuning mechanism, and compatibility with existing microfluidic devices. We expect that with further optimizations, this 2D L-GRIN lens can be used in many optics-based lab-on-a-chip applications.

Investigation and Optimization of Blade Tip Winglets Using an Implicit Free Wake Vortex Method

NASA Astrophysics Data System (ADS)

Lawton, Stephen; Crawford, Curran

2014-06-01

Novel outer-blade geometries such as tip winglets can increase the aerodynamic power that can be extracted from the wind by tailoring the relative position and strengths of trailed vorticity. This design space is explored using both parameter studies and gradient-based optimization, with the aerodynamic analysis carried out using LibAero, a free wake vortex-based code introduced in previous work. The starting design is the NREL 5MW reference turbine, which allows comparison of the aerodynamic simulation for the unmodified blade with other codes. The code uses a Prandtl-Weissinger lifting line model to represent the blade, and vortex filaments as the flow elements. A fast multipole method is implemented to accelerate the influence calculations and reduce the computational cost. This results in higher fidelity aerodynamic simulations that can capture the effects of novel geometries while maintaining sufficiently fast run-times (on the order of an hour) to allow the use of optimization. Gradients of the objective function with respect to design variables are calculated using the complex step method which is accurate and efficient. Since the vortex structure behind the rotor is being resolved in detail, insight is also gained into the mechanisms by which these new blade designs affect performance. It is found that adding winglets can increase the power extracted from the wind by around 2%, with a similar increase in thrust. It is also possible to create a winglet that slightly lowers the thrust while maintaining very similar power compared to the standard straight blade.

Reduction of susceptibility-induced signal losses in multi-gradient-echo images: application to improved visualization of the subthalamic nucleus.

PubMed

Volz, Steffen; Hattingen, Elke; Preibisch, Christine; Gasser, Thomas; Deichmann, Ralf

2009-05-01

T2-weighted gradient echo (GE) images yield good contrast of iron-rich structures like the subthalamic nuclei due to microscopic susceptibility induced field gradients, providing landmarks for the exact placement of deep brain stimulation electrodes in Parkinson's disease treatment. An additional advantage is the low radio frequency (RF) exposure of GE sequences. However, T2-weighted images are also sensitive to macroscopic field inhomogeneities, resulting in signal losses, in particular in orbitofrontal and temporal brain areas, limiting anatomical information from these areas. In this work, an image correction method for multi-echo GE data based on evaluation of phase information for field gradient mapping is presented and tested in vivo on a 3 Tesla whole body MR scanner. In a first step, theoretical signal losses are calculated from the gradient maps and a pixelwise image intensity correction is performed. In a second step, intensity corrected images acquired at different echo times TE are combined using optimized weighting factors: in areas not affected by macroscopic field inhomogeneities, data acquired at long TE are weighted more strongly to achieve the contrast required. For large field gradients, data acquired at short TE are favored to avoid signal losses. When compared to the original data sets acquired at different TE and the respective intensity corrected data sets, the resulting combined data sets feature reduced signal losses in areas with major field gradients, while intensity profiles and a contrast-to-noise (CNR) analysis between subthalamic nucleus, red nucleus and the surrounding white matter demonstrate good contrast in deep brain areas.

Brain vascular image enhancement based on gradient adjust with split Bregman

NASA Astrophysics Data System (ADS)

Liang, Xiao; Dong, Di; Hui, Hui; Zhang, Liwen; Fang, Mengjie; Tian, Jie

2016-04-01

Light Sheet Microscopy is a high-resolution fluorescence microscopic technique which enables to observe the mouse brain vascular network clearly with immunostaining. However, micro-vessels are stained with few fluorescence antibodies and their signals are much weaker than large vessels, which make micro-vessels unclear in LSM images. In this work, we developed a vascular image enhancement method to enhance micro-vessel details which should be useful for vessel statistics analysis. Since gradient describes the edge information of the vessel, the main idea of our method is to increase the gradient values of the enhanced image to improve the micro-vessels contrast. Our method contained two steps: 1) calculate the gradient image of LSM image, and then amplify high gradient values of the original image to enhance the vessel edge and suppress low gradient values to remove noises. Then we formulated a new L1-norm regularization optimization problem to find an image with the expected gradient while keeping the main structure information of the original image. 2) The split Bregman iteration method was used to deal with the L1-norm regularization problem and generate the final enhanced image. The main advantage of the split Bregman method is that it has both fast convergence and low memory cost. In order to verify the effectiveness of our method, we applied our method to a series of mouse brain vascular images acquired from a commercial LSM system in our lab. The experimental results showed that our method could greatly enhance micro-vessel edges which were unclear in the original images.

Multi-objective optimization of piezoelectric circuitry network for mode delocalization and suppression of bladed disk

NASA Astrophysics Data System (ADS)

Yoo, David; Tang, J.

2017-04-01

Since weakly-coupled bladed disks are highly sensitive to the presence of uncertainties, they can easily undergo vibration localization. When vibration localization occurs, vibration modes of bladed disk become dramatically different from those under the perfectly periodic condition, and the dynamic response under engine-order excitation is drastically amplified. In previous studies, it is investigated that amplified vibration response can be suppressed by connecting piezoelectric circuitry into individual blades to induce the damped absorber effect, and localized vibration modes can be alleviated by integrating piezoelectric circuitry network. Delocalization of vibration modes and vibration suppression of bladed disk, however, require different optimal set of circuit parameters. In this research, multi-objective optimization approach is developed to enable finding the best circuit parameters, simultaneously achieving both objectives. In this way, the robustness and reliability in bladed disk can be ensured. Gradient-based optimizations are individually developed for mode delocalization and vibration suppression, which are then integrated into multi-objective optimization framework.

Morphing Wings: A Study Using High-Fidelity Aerodynamic Shape Optimization

NASA Astrophysics Data System (ADS)

Curiale, Nathanael J.

With the aviation industry under pressure to reduce fuel consumption, morphing wings have the capacity to improve aircraft performance, thereby making a significant contribution to reversing climate change. Through high-fidelity aerodynamic shape optimization, various forms of morphing wings are assessed for a hypothetical regional-class aircraft. The framework used solves the Reynolds-averaged Navier-Stokes equations and utilizes a gradient-based optimization algorithm. Baseline geometries are developed through multipoint optimization, where the average drag coefficient is minimized over a range of flight conditions with additional dive constraints. Morphing optimizations are then performed, beginning with these baseline shapes. Five distinct types of morphing are investigated and compared. Overall, a theoretical fully adaptable wing produces roughly a 2% improvement in average performance, whereas trailing-edge morphing with a 27-point multipoint baseline results in just over a 1% improvement in average performance. Trailing-edge morphing proves to be more beneficial than leading-edge morphing, upper-surface morphing, and a conventional flap.

Optimal Control of Thermo--Fluid Phenomena in Variable Domains

NASA Astrophysics Data System (ADS)

Volkov, Oleg; Protas, Bartosz

2008-11-01

This presentation concerns our continued research on adjoint--based optimization of viscous incompressible flows (the Navier--Stokes problem) coupled with heat conduction involving change of phase (the Stefan problem), and occurring in domains with variable boundaries. This problem is motivated by optimization of advanced welding techniques used in automotive manufacturing, where the goal is to determine an optimal heat input, so as to obtain a desired shape of the weld pool surface upon solidification. We argue that computation of sensitivities (gradients) in such free--boundary problems requires the use of the shape--differential calculus as a key ingredient. We also show that, with such tools available, the computational solution of the direct and inverse (optimization) problems can in fact be achieved in a similar manner and in a comparable computational time. Our presentation will address certain mathematical and computational aspects of the method. As an illustration we will consider the two--phase Stefan problem with contact point singularities where our approach allows us to obtain a thermodynamically consistent solution.

Use and optimization of a dual-flowrate loading strategy to maximize throughput in protein-a affinity chromatography.

PubMed

Ghose, Sanchayita; Nagrath, Deepak; Hubbard, Brian; Brooks, Clayton; Cramer, Steven M

2004-01-01

The effect of an alternate strategy employing two different flowrates during loading was explored as a means of increasing system productivity in Protein-A chromatography. The effect of such a loading strategy was evaluated using a chromatographic model that was able to accurately predict experimental breakthrough curves for this Protein-A system. A gradient-based optimization routine is carried out to establish the optimal loading conditions (initial and final flowrates and switching time). The two-step loading strategy (using a higher flowrate during the initial stages followed by a lower flowrate) was evaluated for an Fc-fusion protein and was found to result in significant improvements in process throughput. In an extension of this optimization routine, dynamic loading capacity and productivity were simultaneously optimized using a weighted objective function, and this result was compared to that obtained with the single flowrate. Again, the dual-flowrate strategy was found to be superior.

Identification of inelastic parameters based on deep drawing forming operations using a global-local hybrid Particle Swarm approach

NASA Astrophysics Data System (ADS)

Vaz, Miguel; Luersen, Marco A.; Muñoz-Rojas, Pablo A.; Trentin, Robson G.

2016-04-01

Application of optimization techniques to the identification of inelastic material parameters has substantially increased in recent years. The complex stress-strain paths and high nonlinearity, typical of this class of problems, require the development of robust and efficient techniques for inverse problems able to account for an irregular topography of the fitness surface. Within this framework, this work investigates the application of the gradient-based Sequential Quadratic Programming method, of the Nelder-Mead downhill simplex algorithm, of Particle Swarm Optimization (PSO), and of a global-local PSO-Nelder-Mead hybrid scheme to the identification of inelastic parameters based on a deep drawing operation. The hybrid technique has shown to be the best strategy by combining the good PSO performance to approach the global minimum basin of attraction with the efficiency demonstrated by the Nelder-Mead algorithm to obtain the minimum itself.

Manipulating the Gradient

ERIC Educational Resources Information Center

Gaze, Eric C.

2005-01-01

We introduce a cooperative learning, group lab for a Calculus III course to facilitate comprehension of the gradient vector and directional derivative concepts. The lab is a hands-on experience allowing students to manipulate a tangent plane and empirically measure the effect of partial derivatives on the direction of optimal ascent. (Contains 7…

Optimization of segmented thermoelectric generator using Taguchi and ANOVA techniques.

PubMed

Kishore, Ravi Anant; Sanghadasa, Mohan; Priya, Shashank

2017-12-01

Recent studies have demonstrated that segmented thermoelectric generators (TEGs) can operate over large thermal gradient and thus provide better performance (reported efficiency up to 11%) as compared to traditional TEGs, comprising of single thermoelectric (TE) material. However, segmented TEGs are still in early stages of development due to the inherent complexity in their design optimization and manufacturability. In this study, we demonstrate physics based numerical techniques along with Analysis of variance (ANOVA) and Taguchi optimization method for optimizing the performance of segmented TEGs. We have considered comprehensive set of design parameters, such as geometrical dimensions of p-n legs, height of segmentation, hot-side temperature, and load resistance, in order to optimize output power and efficiency of segmented TEGs. Using the state-of-the-art TE material properties and appropriate statistical tools, we provide near-optimum TEG configuration with only 25 experiments as compared to 3125 experiments needed by the conventional optimization methods. The effect of environmental factors on the optimization of segmented TEGs is also studied. Taguchi results are validated against the results obtained using traditional full factorial optimization technique and a TEG configuration for simultaneous optimization of power and efficiency is obtained.

Multi-Scale Modeling, Surrogate-Based Analysis, and Optimization of Lithium-Ion Batteries for Vehicle Applications

NASA Astrophysics Data System (ADS)

Du, Wenbo

A common attribute of electric-powered aerospace vehicles and systems such as unmanned aerial vehicles, hybrid- and fully-electric aircraft, and satellites is that their performance is usually limited by the energy density of their batteries. Although lithium-ion batteries offer distinct advantages such as high voltage and low weight over other battery technologies, they are a relatively new development, and thus significant gaps in the understanding of the physical phenomena that govern battery performance remain. As a result of this limited understanding, batteries must often undergo a cumbersome design process involving many manual iterations based on rules of thumb and ad-hoc design principles. A systematic study of the relationship between operational, geometric, morphological, and material-dependent properties and performance metrics such as energy and power density is non-trivial due to the multiphysics, multiphase, and multiscale nature of the battery system. To address these challenges, two numerical frameworks are established in this dissertation: a process for analyzing and optimizing several key design variables using surrogate modeling tools and gradient-based optimizers, and a multi-scale model that incorporates more detailed microstructural information into the computationally efficient but limited macro-homogeneous model. In the surrogate modeling process, multi-dimensional maps for the cell energy density with respect to design variables such as the particle size, ion diffusivity, and electron conductivity of the porous cathode material are created. A combined surrogate- and gradient-based approach is employed to identify optimal values for cathode thickness and porosity under various operating conditions, and quantify the uncertainty in the surrogate model. The performance of multiple cathode materials is also compared by defining dimensionless transport parameters. The multi-scale model makes use of detailed 3-D FEM simulations conducted at the particle-level. A monodisperse system of ellipsoidal particles is used to simulate the effective transport coefficients and interfacial reaction current density within the porous microstructure. Microscopic simulation results are shown to match well with experimental measurements, while differing significantly from homogenization approximations used in the macroscopic model. Global sensitivity analysis and surrogate modeling tools are applied to couple the two length scales and complete the multi-scale model.

Optimization of OT-MACH Filter Generation for Target Recognition

NASA Technical Reports Server (NTRS)

Johnson, Oliver C.; Edens, Weston; Lu, Thomas T.; Chao, Tien-Hsin

2009-01-01

An automatic Optimum Trade-off Maximum Average Correlation Height (OT-MACH) filter generator for use in a gray-scale optical correlator (GOC) has been developed for improved target detection at JPL. While the OT-MACH filter has been shown to be an optimal filter for target detection, actually solving for the optimum is too computationally intensive for multiple targets. Instead, an adaptive step gradient descent method was tested to iteratively optimize the three OT-MACH parameters, alpha, beta, and gamma. The feedback for the gradient descent method was a composite of the performance measures, correlation peak height and peak to side lobe ratio. The automated method generated and tested multiple filters in order to approach the optimal filter quicker and more reliably than the current manual method. Initial usage and testing has shown preliminary success at finding an approximation of the optimal filter, in terms of alpha, beta, gamma values. This corresponded to a substantial improvement in detection performance where the true positive rate increased for the same average false positives per image.

Nonconvex Sparse Logistic Regression With Weakly Convex Regularization

NASA Astrophysics Data System (ADS)

Shen, Xinyue; Gu, Yuantao

2018-06-01

In this work we propose to fit a sparse logistic regression model by a weakly convex regularized nonconvex optimization problem. The idea is based on the finding that a weakly convex function as an approximation of the $\\ell_0$ pseudo norm is able to better induce sparsity than the commonly used $\\ell_1$ norm. For a class of weakly convex sparsity inducing functions, we prove the nonconvexity of the corresponding sparse logistic regression problem, and study its local optimality conditions and the choice of the regularization parameter to exclude trivial solutions. Despite the nonconvexity, a method based on proximal gradient descent is used to solve the general weakly convex sparse logistic regression, and its convergence behavior is studied theoretically. Then the general framework is applied to a specific weakly convex function, and a necessary and sufficient local optimality condition is provided. The solution method is instantiated in this case as an iterative firm-shrinkage algorithm, and its effectiveness is demonstrated in numerical experiments by both randomly generated and real datasets.

Adaptive distance metric learning for diffusion tensor image segmentation.

PubMed

Kong, Youyong; Wang, Defeng; Shi, Lin; Hui, Steve C N; Chu, Winnie C W

2014-01-01

High quality segmentation of diffusion tensor images (DTI) is of key interest in biomedical research and clinical application. In previous studies, most efforts have been made to construct predefined metrics for different DTI segmentation tasks. These methods require adequate prior knowledge and tuning parameters. To overcome these disadvantages, we proposed to automatically learn an adaptive distance metric by a graph based semi-supervised learning model for DTI segmentation. An original discriminative distance vector was first formulated by combining both geometry and orientation distances derived from diffusion tensors. The kernel metric over the original distance and labels of all voxels were then simultaneously optimized in a graph based semi-supervised learning approach. Finally, the optimization task was efficiently solved with an iterative gradient descent method to achieve the optimal solution. With our approach, an adaptive distance metric could be available for each specific segmentation task. Experiments on synthetic and real brain DTI datasets were performed to demonstrate the effectiveness and robustness of the proposed distance metric learning approach. The performance of our approach was compared with three classical metrics in the graph based semi-supervised learning framework.

Adaptive Distance Metric Learning for Diffusion Tensor Image Segmentation

PubMed Central

Kong, Youyong; Wang, Defeng; Shi, Lin; Hui, Steve C. N.; Chu, Winnie C. W.

2014-01-01

High quality segmentation of diffusion tensor images (DTI) is of key interest in biomedical research and clinical application. In previous studies, most efforts have been made to construct predefined metrics for different DTI segmentation tasks. These methods require adequate prior knowledge and tuning parameters. To overcome these disadvantages, we proposed to automatically learn an adaptive distance metric by a graph based semi-supervised learning model for DTI segmentation. An original discriminative distance vector was first formulated by combining both geometry and orientation distances derived from diffusion tensors. The kernel metric over the original distance and labels of all voxels were then simultaneously optimized in a graph based semi-supervised learning approach. Finally, the optimization task was efficiently solved with an iterative gradient descent method to achieve the optimal solution. With our approach, an adaptive distance metric could be available for each specific segmentation task. Experiments on synthetic and real brain DTI datasets were performed to demonstrate the effectiveness and robustness of the proposed distance metric learning approach. The performance of our approach was compared with three classical metrics in the graph based semi-supervised learning framework. PMID:24651858

Optimization of Regional Geodynamic Models for Mantle Dynamics

NASA Astrophysics Data System (ADS)

Knepley, M.; Isaac, T.; Jadamec, M. A.

2016-12-01

The SubductionGenerator program is used to construct high resolution, 3D regional thermal structures for mantle convection simulations using a variety of data sources, including sea floor ages and geographically referenced 3D slab locations based on seismic observations. The initial bulk temperature field is constructed using a half-space cooling model or plate cooling model, and related smoothing functions based on a diffusion length-scale analysis. In this work, we seek to improve the 3D thermal model and test different model geometries and dynamically driven flow fields using constraints from observed seismic velocities and plate motions. Through a formal adjoint analysis, we construct the primal-dual version of the multi-objective PDE-constrained optimization problem for the plate motions and seismic misfit. We have efficient, scalable preconditioners for both the forward and adjoint problems based upon a block preconditioning strategy, and a simple gradient update is used to improve the control residual. The full optimal control problem is formulated on a nested hierarchy of grids, allowing a nonlinear multigrid method to accelerate the solution.

Complexity in congestive heart failure: A time-frequency approach

NASA Astrophysics Data System (ADS)

Banerjee, Santo; Palit, Sanjay K.; Mukherjee, Sayan; Ariffin, MRK; Rondoni, Lamberto

2016-03-01

Reconstruction of phase space is an effective method to quantify the dynamics of a signal or a time series. Various phase space reconstruction techniques have been investigated. However, there are some issues on the optimal reconstructions and the best possible choice of the reconstruction parameters. This research introduces the idea of gradient cross recurrence (GCR) and mean gradient cross recurrence density which shows that reconstructions in time frequency domain preserve more information about the dynamics than the optimal reconstructions in time domain. This analysis is further extended to ECG signals of normal and congestive heart failure patients. By using another newly introduced measure—gradient cross recurrence period density entropy, two classes of aforesaid ECG signals can be classified with a proper threshold. This analysis can be applied to quantifying and distinguishing biomedical and other nonlinear signals.

More efficient evolutionary strategies for model calibration with watershed model for demonstration

NASA Astrophysics Data System (ADS)

Baggett, J. S.; Skahill, B. E.

2008-12-01

Evolutionary strategies allow automatic calibration of more complex models than traditional gradient based approaches, but they are more computationally intensive. We present several efficiency enhancements for evolution strategies, many of which are not new, but when combined have been shown to dramatically decrease the number of model runs required for calibration of synthetic problems. To reduce the number of expensive model runs we employ a surrogate objective function for an adaptively determined fraction of the population at each generation (Kern et al., 2006). We demonstrate improvements to the adaptive ranking strategy that increase its efficiency while sacrificing little reliability and further reduce the number of model runs required in densely sampled parts of parameter space. Furthermore, we include a gradient individual in each generation that is usually not selected when the search is in a global phase or when the derivatives are poorly approximated, but when selected near a smooth local minimum can dramatically increase convergence speed (Tahk et al., 2007). Finally, the selection of the gradient individual is used to adapt the size of the population near local minima. We show, by incorporating these enhancements into the Covariance Matrix Adaption Evolution Strategy (CMAES; Hansen, 2006), that their synergetic effect is greater than their individual parts. This hybrid evolutionary strategy exploits smooth structure when it is present but degrades to an ordinary evolutionary strategy, at worst, if smoothness is not present. Calibration of 2D-3D synthetic models with the modified CMAES requires approximately 10%-25% of the model runs of ordinary CMAES. Preliminary demonstration of this hybrid strategy will be shown for watershed model calibration problems. Hansen, N. (2006). The CMA Evolution Strategy: A Comparing Review. In J.A. Lozano, P. Larrañga, I. Inza and E. Bengoetxea (Eds.). Towards a new evolutionary computation. Advances in estimation of distribution algorithms. pp. 75-102, Springer Kern, S., N. Hansen and P. Koumoutsakos (2006). Local Meta-Models for Optimization Using Evolution Strategies. In Ninth International Conference on Parallel Problem Solving from Nature PPSN IX, Proceedings, pp.939-948, Berlin: Springer. Tahk, M., Woo, H., and Park. M, (2007). A hybrid optimization of evolutionary and gradient search. Engineering Optimization, (39), 87-104.

Dynamic Sensor Tasking for Space Situational Awareness via Reinforcement Learning

NASA Astrophysics Data System (ADS)

Linares, R.; Furfaro, R.

2016-09-01

This paper studies the Sensor Management (SM) problem for optical Space Object (SO) tracking. The tasking problem is formulated as a Markov Decision Process (MDP) and solved using Reinforcement Learning (RL). The RL problem is solved using the actor-critic policy gradient approach. The actor provides a policy which is random over actions and given by a parametric probability density function (pdf). The critic evaluates the policy by calculating the estimated total reward or the value function for the problem. The parameters of the policy action pdf are optimized using gradients with respect to the reward function. Both the critic and the actor are modeled using deep neural networks (multi-layer neural networks). The policy neural network takes the current state as input and outputs probabilities for each possible action. This policy is random, and can be evaluated by sampling random actions using the probabilities determined by the policy neural network's outputs. The critic approximates the total reward using a neural network. The estimated total reward is used to approximate the gradient of the policy network with respect to the network parameters. This approach is used to find the non-myopic optimal policy for tasking optical sensors to estimate SO orbits. The reward function is based on reducing the uncertainty for the overall catalog to below a user specified uncertainty threshold. This work uses a 30 km total position error for the uncertainty threshold. This work provides the RL method with a negative reward as long as any SO has a total position error above the uncertainty threshold. This penalizes policies that take longer to achieve the desired accuracy. A positive reward is provided when all SOs are below the catalog uncertainty threshold. An optimal policy is sought that takes actions to achieve the desired catalog uncertainty in minimum time. This work trains the policy in simulation by letting it task a single sensor to "learn" from its performance. The proposed approach for the SM problem is tested in simulation and good performance is found using the actor-critic policy gradient method.

Post-Optimality Analysis In Aerospace Vehicle Design

NASA Technical Reports Server (NTRS)

Braun, Robert D.; Kroo, Ilan M.; Gage, Peter J.

1993-01-01

This analysis pertains to the applicability of optimal sensitivity information to aerospace vehicle design. An optimal sensitivity (or post-optimality) analysis refers to computations performed once the initial optimization problem is solved. These computations may be used to characterize the design space about the present solution and infer changes in this solution as a result of constraint or parameter variations, without reoptimizing the entire system. The present analysis demonstrates that post-optimality information generated through first-order computations can be used to accurately predict the effect of constraint and parameter perturbations on the optimal solution. This assessment is based on the solution of an aircraft design problem in which the post-optimality estimates are shown to be within a few percent of the true solution over the practical range of constraint and parameter variations. Through solution of a reusable, single-stage-to-orbit, launch vehicle design problem, this optimal sensitivity information is also shown to improve the efficiency of the design process, For a hierarchically decomposed problem, this computational efficiency is realized by estimating the main-problem objective gradient through optimal sep&ivity calculations, By reducing the need for finite differentiation of a re-optimized subproblem, a significant decrease in the number of objective function evaluations required to reach the optimal solution is obtained.

Modelling distributed mountain glacier volumes: A sensitivity study in the Austrian Alps

NASA Astrophysics Data System (ADS)

Helfricht, Kay; Huss, Matthias; Fischer, Andrea; Otto, Jan Christoph

2017-04-01

Knowledge about the spatial ice thickness distribution in glacier covered mountain regions and the elevation of the bedrock underneath the glaciers yields the basis for numerous applications in geoscience. Applications include the modelling of glacier dynamics, natural risk analyses and studies on mountain hydrology. Especially in recent times of accelerating and unprecedented changes of glacier extents, the remaining ice volume is of interest regarding future glacier and sea level scenarios. Subglacial depressions concern because of their hazard potential in case of sudden releases of debris or water. A number of approaches with different level of complexity have been developed in the past years to infer glacier ice thickness from surface characteristics. Within the FUTURELAKES project, the ice thickness estimation method presented by Huss and Farinotti (2012) was applied to all glaciers in the Austrian Alps based on glacier extents and surface topography corresponding to the three Austrian glacier inventories (1969 - 1997 - 2006) with the aim to predict size and location of future proglacial lakes. The availability of measured ice thickness data and a time series of glacier inventories of Austrian glaciers, allowed carrying out a sensitivity study of the key parameter, the apparent mass balance gradient. First, the parameters controlling the apparent mass balance gradient of 58 glaciers where calibrated glacier-wise with the aim to minimize mean deviations and mean absolute deviations to measured ice thickness. The results were analysed with respect to changes of the mass balance gradient with time. Secondly, we compared the observed to modelled ice thickness changes. For doing so, glacier-wise as well as regional means of mass balance gradients have been used. The results indicate that the initial values for the apparent mass balance gradient have to be adapted to the changing conditions within the four decades covered by the glacier inventories. The gradients flatten from the first to last inventory. This is consistent with the decreasing deviation between glaciological and geodetical glacier mass balance when a period with negative mass balances results in decreasing ice dynamics. The comparison of mean ice thickness changes between the Inventories reveals the effect of changes in glacier mass transport in addition to changes in glacier area and topography. 93% of the mean observed ice thickness change could be reproduced using the glacier-wise optimized mass balance gradients. More than 85% of mean ice thickness change was calculated from modelled ice thickness distributions with inventory mean optimized mass balance gradients. The ratio decreases to 60% the same parameters for all three glacier inventories and can be attributed to changes in glacier extent. Thus, the actual glacier mass turnover has to be considered to model glacier volumes based on glacier topography more realistically. Huss, M., and D. Farinotti (2012), Distributed ice thickness and volume of all glaciers around the globe, J. Geophys. Res., 117, F04010, doi:10.1029/2012JF002523.

Structural optimization of framed structures using generalized optimality criteria

NASA Technical Reports Server (NTRS)

Kolonay, R. M.; Venkayya, Vipperla B.; Tischler, V. A.; Canfield, R. A.

1989-01-01

The application of a generalized optimality criteria to framed structures is presented. The optimality conditions, Lagrangian multipliers, resizing algorithm, and scaling procedures are all represented as a function of the objective and constraint functions along with their respective gradients. The optimization of two plane frames under multiple loading conditions subject to stress, displacement, generalized stiffness, and side constraints is presented. These results are compared to those found by optimizing the frames using a nonlinear mathematical programming technique.

Smooth function approximation using neural networks.

PubMed

Ferrari, Silvia; Stengel, Robert F

2005-01-01

An algebraic approach for representing multidimensional nonlinear functions by feedforward neural networks is presented. In this paper, the approach is implemented for the approximation of smooth batch data containing the function's input, output, and possibly, gradient information. The training set is associated to the network adjustable parameters by nonlinear weight equations. The cascade structure of these equations reveals that they can be treated as sets of linear systems. Hence, the training process and the network approximation properties can be investigated via linear algebra. Four algorithms are developed to achieve exact or approximate matching of input-output and/or gradient-based training sets. Their application to the design of forward and feedback neurocontrollers shows that algebraic training is characterized by faster execution speeds and better generalization properties than contemporary optimization techniques.

Directed transport by surface chemical potential gradients for enhancing analyte collection in nanoscale sensors.

PubMed

Sitt, Amit; Hess, Henry

2015-05-13

Nanoscale detectors hold great promise for single molecule detection and the analysis of small volumes of dilute samples. However, the probability of an analyte reaching the nanosensor in a dilute solution is extremely low due to the sensor's small size. Here, we examine the use of a chemical potential gradient along a surface to accelerate analyte capture by nanoscale sensors. Utilizing a simple model for transport induced by surface binding energy gradients, we study the effect of the gradient on the efficiency of collecting nanoparticles and single and double stranded DNA. The results indicate that chemical potential gradients along a surface can lead to an acceleration of analyte capture by several orders of magnitude compared to direct collection from the solution. The improvement in collection is limited to a relatively narrow window of gradient slopes, and its extent strongly depends on the size of the gradient patch. Our model allows the optimization of gradient layouts and sheds light on the fundamental characteristics of chemical potential gradient induced transport.