An online supervised learning method based on gradient descent for spiking neurons.

Science.gov (United States)

Xu, Yan; Yang, Jing; Zhong, Shuiming

2017-09-01

The purpose of supervised learning with temporal encoding for spiking neurons is to make the neurons emit a specific spike train encoded by precise firing times of spikes. The gradient-descent-based (GDB) learning methods are widely used and verified in the current research. Although the existing GDB multi-spike learning (or spike sequence learning) methods have good performance, they work in an offline manner and still have some limitations. This paper proposes an online GDB spike sequence learning method for spiking neurons that is based on the online adjustment mechanism of real biological neuron synapses. The method constructs error function and calculates the adjustment of synaptic weights as soon as the neurons emit a spike during their running process. We analyze and synthesize desired and actual output spikes to select appropriate input spikes in the calculation of weight adjustment in this paper. The experimental results show that our method obviously improves learning performance compared with the offline learning manner and has certain advantage on learning accuracy compared with other learning methods. Stronger learning ability determines that the method has large pattern storage capacity. Copyright © 2017 Elsevier Ltd. All rights reserved.

Accelerating deep neural network training with inconsistent stochastic gradient descent.

Science.gov (United States)

Wang, Linnan; Yang, Yi; Min, Renqiang; Chakradhar, Srimat

2017-09-01

Stochastic Gradient Descent (SGD) updates Convolutional Neural Network (CNN) with a noisy gradient computed from a random batch, and each batch evenly updates the network once in an epoch. This model applies the same training effort to each batch, but it overlooks the fact that the gradient variance, induced by Sampling Bias and Intrinsic Image Difference, renders different training dynamics on batches. In this paper, we develop a new training strategy for SGD, referred to as Inconsistent Stochastic Gradient Descent (ISGD) to address this problem. The core concept of ISGD is the inconsistent training, which dynamically adjusts the training effort w.r.t the loss. ISGD models the training as a stochastic process that gradually reduces down the mean of batch's loss, and it utilizes a dynamic upper control limit to identify a large loss batch on the fly. ISGD stays on the identified batch to accelerate the training with additional gradient updates, and it also has a constraint to penalize drastic parameter changes. ISGD is straightforward, computationally efficient and without requiring auxiliary memories. A series of empirical evaluations on real world datasets and networks demonstrate the promising performance of inconsistent training. Copyright © 2017 Elsevier Ltd. All rights reserved.

Steepest descent method implementation on unconstrained optimization problem using C++ program

Science.gov (United States)

Napitupulu, H.; Sukono; Mohd, I. Bin; Hidayat, Y.; Supian, S.

2018-03-01

Steepest Descent is known as the simplest gradient method. Recently, many researches are done to obtain the appropriate step size in order to reduce the objective function value progressively. In this paper, the properties of steepest descent method from literatures are reviewed together with advantages and disadvantages of each step size procedure. The development of steepest descent method due to its step size procedure is discussed. In order to test the performance of each step size, we run a steepest descent procedure in C++ program. We implemented it to unconstrained optimization test problem with two variables, then we compare the numerical results of each step size procedure. Based on the numerical experiment, we conclude the general computational features and weaknesses of each procedure in each case of problem.

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

Directory of Open Access Journals (Sweden)

Min Sun

2014-01-01

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

Fast alternating projected gradient descent algorithms for recovering spectrally sparse signals

KAUST Repository

Cho, Myung

2016-06-24

We propose fast algorithms that speed up or improve the performance of recovering spectrally sparse signals from un-derdetermined measurements. Our algorithms are based on a non-convex approach of using alternating projected gradient descent for structured matrix recovery. We apply this approach to two formulations of structured matrix recovery: Hankel and Toeplitz mosaic structured matrix, and Hankel structured matrix. Our methods provide better recovery performance, and faster signal recovery than existing algorithms, including atomic norm minimization.

Fast alternating projected gradient descent algorithms for recovering spectrally sparse signals

KAUST Repository

Cho, Myung; Cai, Jian-Feng; Liu, Suhui; Eldar, Yonina C.; Xu, Weiyu

2016-01-01

We propose fast algorithms that speed up or improve the performance of recovering spectrally sparse signals from un-derdetermined measurements. Our algorithms are based on a non-convex approach of using alternating projected gradient descent for structured matrix recovery. We apply this approach to two formulations of structured matrix recovery: Hankel and Toeplitz mosaic structured matrix, and Hankel structured matrix. Our methods provide better recovery performance, and faster signal recovery than existing algorithms, including atomic norm minimization.

Gradient descent learning in and out of equilibrium

International Nuclear Information System (INIS)

Caticha, Nestor; Araujo de Oliveira, Evaldo

2001-01-01

Relations between the off thermal equilibrium dynamical process of on-line learning and the thermally equilibrated off-line learning are studied for potential gradient descent learning. The approach of Opper to study on-line Bayesian algorithms is used for potential based or maximum likelihood learning. We look at the on-line learning algorithm that best approximates the off-line algorithm in the sense of least Kullback-Leibler information loss. The closest on-line algorithm works by updating the weights along the gradient of an effective potential, which is different from the parent off-line potential. A few examples are analyzed and the origin of the potential annealing is discussed

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

Directory of Open Access Journals (Sweden)

Bakhtawar Baluch

2017-01-01

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

Sufficient Descent Polak-Ribière-Polyak Conjugate Gradient Algorithm for Large-Scale Box-Constrained Optimization

Directory of Open Access Journals (Sweden)

Qiuyu Wang

2014-01-01

descent method at first finite number of steps and then by conjugate gradient method subsequently. Under some appropriate conditions, we show that the algorithm converges globally. Numerical experiments and comparisons by using some box-constrained problems from CUTEr library are reported. Numerical comparisons illustrate that the proposed method is promising and competitive with the well-known method—L-BFGS-B.

Block-Based Gradient Descent for Local Backlight Dimming and Flicker Reduction

DEFF Research Database (Denmark)

Burini, Nino; Mantel, Claire; Nadernejad, Ehsan

2014-01-01

Local backlight dimming technology is a two-fold improvement for LED backlit LCD screens that allows to reduce power consumption and increase visual quality. This paper presents a fast version of an iterative backlight dimming algorithm based on gradient descent search. The speed is increased...

Fractional-order gradient descent learning of BP neural networks with Caputo derivative.

Science.gov (United States)

Wang, Jian; Wen, Yanqing; Gou, Yida; Ye, Zhenyun; Chen, Hua

2017-05-01

Fractional calculus has been found to be a promising area of research for information processing and modeling of some physical systems. In this paper, we propose a fractional gradient descent method for the backpropagation (BP) training of neural networks. In particular, the Caputo derivative is employed to evaluate the fractional-order gradient of the error defined as the traditional quadratic energy function. The monotonicity and weak (strong) convergence of the proposed approach are proved in detail. Two simulations have been implemented to illustrate the performance of presented fractional-order BP algorithm on three small datasets and one large dataset. The numerical simulations effectively verify the theoretical observations of this paper as well. Copyright © 2017 Elsevier Ltd. All rights reserved.

Dynamic gradient descent learning algorithms for enhanced empirical modeling of power plants

International Nuclear Information System (INIS)

Parlos, A.G.; Atiya, Amir; Chong, K.T.

1991-01-01

A newly developed dynamic gradient descent-based learning algorithm is used to train a recurrent multilayer perceptron network for use in empirical modeling of power plants. The two main advantages of the proposed learning algorithm are its ability to consider past error gradient information for future use and the two forward passes associated with its implementation, instead of one forward and one backward pass of the backpropagation algorithm. The latter advantage results in computational time saving because both passes can be performed simultaneously. The dynamic learning algorithm is used to train a hybrid feedforward/feedback neural network, a recurrent multilayer perceptron, which was previously found to exhibit good interpolation and extrapolation capabilities in modeling nonlinear dynamic systems. One of the drawbacks, however, of the previously reported work has been the long training times associated with accurate empirical models. The enhanced learning capabilities provided by the dynamic gradient descent-based learning algorithm are demonstrated by a case study of a steam power plant. The number of iterations required for accurate empirical modeling has been reduced from tens of thousands to hundreds, thus significantly expediting the learning process

Applying Gradient Descent in Convolutional Neural Networks

Science.gov (United States)

Cui, Nan

2018-04-01

With the development of the integrated circuit and computer science, people become caring more about solving practical issues via information technologies. Along with that, a new subject called Artificial Intelligent (AI) comes up. One popular research interest of AI is about recognition algorithm. In this paper, one of the most common algorithms, Convolutional Neural Networks (CNNs) will be introduced, for image recognition. Understanding its theory and structure is of great significance for every scholar who is interested in this field. Convolution Neural Network is an artificial neural network which combines the mathematical method of convolution and neural network. The hieratical structure of CNN provides it reliable computer speed and reasonable error rate. The most significant characteristics of CNNs are feature extraction, weight sharing and dimension reduction. Meanwhile, combining with the Back Propagation (BP) mechanism and the Gradient Descent (GD) method, CNNs has the ability to self-study and in-depth learning. Basically, BP provides an opportunity for backwardfeedback for enhancing reliability and GD is used for self-training process. This paper mainly discusses the CNN and the related BP and GD algorithms, including the basic structure and function of CNN, details of each layer, the principles and features of BP and GD, and some examples in practice with a summary in the end.

Conjugate descent formulation of backpropagation error in ...

African Journals Online (AJOL)

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

Error analysis of stochastic gradient descent ranking.

Science.gov (United States)

Chen, Hong; Tang, Yi; Li, Luoqing; Yuan, Yuan; Li, Xuelong; Tang, Yuanyan

2013-06-01

Ranking is always an important task in machine learning and information retrieval, e.g., collaborative filtering, recommender systems, drug discovery, etc. A kernel-based stochastic gradient descent algorithm with the least squares loss is proposed for ranking in this paper. The implementation of this algorithm is simple, and an expression of the solution is derived via a sampling operator and an integral operator. An explicit convergence rate for leaning a ranking function is given in terms of the suitable choices of the step size and the regularization parameter. The analysis technique used here is capacity independent and is novel in error analysis of ranking learning. Experimental results on real-world data have shown the effectiveness of the proposed algorithm in ranking tasks, which verifies the theoretical analysis in ranking error.

Computational Experience with Globally Convergent Descent Methods for Large Sparse Systems of Nonlinear Equations

Czech Academy of Sciences Publication Activity Database

Lukšan, Ladislav; Vlček, Jan

1998-01-01

Roč. 8, č. 3-4 (1998), s. 201-223 ISSN 1055-6788 R&D Projects: GA ČR GA201/96/0918 Keywords : nonlinear equations * Armijo-type descent methods * Newton-like methods * truncated methods * global convergence * nonsymmetric linear systems * conjugate gradient -type methods * residual smoothing * computational experiments Subject RIV: BB - Applied Statistics, Operational Research

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

Science.gov (United States)

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

2014-01-27

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

Global Convergence of a Spectral Conjugate Gradient Method for Unconstrained Optimization

Directory of Open Access Journals (Sweden)

Jinkui Liu

2012-01-01

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

Robust Fully Distributed Minibatch Gradient Descent with Privacy Preservation

Directory of Open Access Journals (Sweden)

Gábor Danner

2018-01-01

Full Text Available Privacy and security are among the highest priorities in data mining approaches over data collected from mobile devices. Fully distributed machine learning is a promising direction in this context. However, it is a hard problem to design protocols that are efficient yet provide sufficient levels of privacy and security. In fully distributed environments, secure multiparty computation (MPC is often applied to solve these problems. However, in our dynamic and unreliable application domain, known MPC algorithms are not scalable or not robust enough. We propose a light-weight protocol to quickly and securely compute the sum query over a subset of participants assuming a semihonest adversary. During the computation the participants learn no individual values. We apply this protocol to efficiently calculate the sum of gradients as part of a fully distributed minibatch stochastic gradient descent algorithm. The protocol achieves scalability and robustness by exploiting the fact that in this application domain a “quick and dirty” sum computation is acceptable. We utilize the Paillier homomorphic cryptosystem as part of our solution combined with extreme lossy gradient compression to make the cost of the cryptographic algorithms affordable. We demonstrate both theoretically and experimentally, based on churn statistics from a real smartphone trace, that the protocol is indeed practically viable.

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

Science.gov (United States)

Khadijah, Wan; Rivaie, Mohd; Mamat, Mustafa

2017-08-01

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

A feasible DY conjugate gradient method for linear equality constraints

Science.gov (United States)

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.

Programmed gradient descent biosorption of strontium ions by Saccaromyces cerevisiae and ashing analysis: A decrement solution for nuclide and heavy metal disposal

Energy Technology Data Exchange (ETDEWEB)

Liu, Mingxue [Life Science and Engineering College, Southwest University of Science and Technology, Mianyang, 621010 (China); Key Laboratory of Solid Waste Treatment and Resource Recycle, Ministry of Education of China, Mianyang, 621010 (China); Dong, Faqin, E-mail: fqdong@swust.edu.cn [Key Laboratory of Solid Waste Treatment and Resource Recycle, Ministry of Education of China, Mianyang, 621010 (China); Zhang, Wei [Key Laboratory of Solid Waste Treatment and Resource Recycle, Ministry of Education of China, Mianyang, 621010 (China); Nie, Xiaoqin [Fundamental Science on Nuclear Wastes and Environmental Safety Laboratory, Mianyang, 621010 (China); Sun, Shiyong [Key Laboratory of Solid Waste Treatment and Resource Recycle, Ministry of Education of China, Mianyang, 621010 (China); Wei, Hongfu; Luo, Lang; Xiang, Sha; Zhang, Gege [Life Science and Engineering College, Southwest University of Science and Technology, Mianyang, 621010 (China)

2016-08-15

Highlights: • A programmed gradient descent biosorption process was designed. • The adsorption and bioaccumulation quantity of strontium ions by yeast cell were measured. • The decrement of biosorbents after biosorption by ashing was analyzed. • A technological flow process of decrement solution for waste disposal was proposed. - Abstract: One of the waste disposal principles is decrement. The programmed gradient descent biosorption of strontium ions by Saccaromyces cerevisiae regarding bioremoval and ashing process for decrement were studied in present research. The results indicated that S. cerevisiae cells showed valid biosorption for strontium ions with greater than 90% bioremoval efficiency for high concentration strontium ions under batch culture conditions. The S. cerevisiae cells bioaccumulated approximately 10% of strontium ions in the cytoplasm besides adsorbing 90% strontium ions on cell wall. The programmed gradient descent biosorption presented good performance with a nearly 100% bioremoval ratio for low concentration strontium ions after 3 cycles. The ashing process resulted in a huge volume and weight reduction ratio as well as enrichment for strontium in the ash. XRD results showed that SrSO{sub 4} existed in ash. Simulated experiments proved that sulfate could adjust the precipitation of strontium ions. Finally, we proposed a technological flow process that combined the programmed gradient descent biosorption and ashing, which could yield great decrement and allow the supernatant to meet discharge standard. This technological flow process may be beneficial for nuclides and heavy metal disposal treatment in many fields.

Implementasi Jaringan Syaraf Tiruan Recurrent Menggunakan Gradient Descent Adaptive Learning Rate and Momentum Untuk Pendugaan Curah Hujan

Directory of Open Access Journals (Sweden)

Afan Galih Salman

2011-06-01

Full Text Available The artificial neural network (ANN technology in rainfall prediction can be done using the learning approach. The ANN prediction accuracy is measured by the determination coefficient (R2 and root mean square error (RMSE. This research implements Elman’s Recurrent ANN which is heuristically optimized based on el-nino southern oscilation (ENSO variables: wind, southern oscillation index (SOI, sea surface temperatur (SST dan outgoing long wave radiation (OLR to forecast regional monthly rainfall in Bongan Bali. The heuristic learning optimization done is basically a performance development of standard gradient descent learning algorithm into training algorithms: gradient descent momentum and adaptive learning rate. The patterns of input data affect the performance of Recurrent Elman neural network in estimation process. The first data group that is 75% training data and 25% testing data produce the maximum R2 leap 74,6% while the second data group that is 50% training data and 50% testing data produce the maximum R2 leap 49,8%.

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

Directory of Open Access Journals (Sweden)

Zhongbo Sun

2014-01-01

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

Sobolev gradients and differential equations

CERN Document Server

Neuberger, J W

2010-01-01

A Sobolev gradient of a real-valued functional on a Hilbert space is a gradient of that functional taken relative to an underlying Sobolev norm. This book shows how descent methods using such gradients allow a unified treatment of a wide variety of problems in differential equations. For discrete versions of partial differential equations, corresponding Sobolev gradients are seen to be vastly more efficient than ordinary gradients. In fact, descent methods with these gradients generally scale linearly with the number of grid points, in sharp contrast with the use of ordinary gradients. Aside from the first edition of this work, this is the only known account of Sobolev gradients in book form. Most of the applications in this book have emerged since the first edition was published some twelve years ago. What remains of the first edition has been extensively revised. There are a number of plots of results from calculations and a sample MatLab code is included for a simple problem. Those working through a fair p...

Stochastic Spectral Descent for Discrete Graphical Models

International Nuclear Information System (INIS)

Carlson, David; Hsieh, Ya-Ping; Collins, Edo; Carin, Lawrence; Cevher, Volkan

2015-01-01

Interest in deep probabilistic graphical models has in-creased in recent years, due to their state-of-the-art performance on many machine learning applications. Such models are typically trained with the stochastic gradient method, which can take a significant number of iterations to converge. Since the computational cost of gradient estimation is prohibitive even for modestly sized models, training becomes slow and practically usable models are kept small. In this paper we propose a new, largely tuning-free algorithm to address this problem. Our approach derives novel majorization bounds based on the Schatten- norm. Intriguingly, the minimizers of these bounds can be interpreted as gradient methods in a non-Euclidean space. We thus propose using a stochastic gradient method in non-Euclidean space. We both provide simple conditions under which our algorithm is guaranteed to converge, and demonstrate empirically that our algorithm leads to dramatically faster training and improved predictive ability compared to stochastic gradient descent for both directed and undirected graphical models.

Manifold regularized discriminative nonnegative matrix factorization with fast gradient descent.

Science.gov (United States)

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.

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

Science.gov (United States)

Du, Shouqiang; Chen, Miao

2018-01-01

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

Understanding and Optimizing Asynchronous Low-Precision Stochastic Gradient Descent

Science.gov (United States)

De Sa, Christopher; Feldman, Matthew; Ré, Christopher; Olukotun, Kunle

2018-01-01

Stochastic gradient descent (SGD) is one of the most popular numerical algorithms used in machine learning and other domains. Since this is likely to continue for the foreseeable future, it is important to study techniques that can make it run fast on parallel hardware. In this paper, we provide the first analysis of a technique called Buckwild! that uses both asynchronous execution and low-precision computation. We introduce the DMGC model, the first conceptualization of the parameter space that exists when implementing low-precision SGD, and show that it provides a way to both classify these algorithms and model their performance. We leverage this insight to propose and analyze techniques to improve the speed of low-precision SGD. First, we propose software optimizations that can increase throughput on existing CPUs by up to 11×. Second, we propose architectural changes, including a new cache technique we call an obstinate cache, that increase throughput beyond the limits of current-generation hardware. We also implement and analyze low-precision SGD on the FPGA, which is a promising alternative to the CPU for future SGD systems. PMID:29391770

Practical gradient-descent for memristive crossbars

OpenAIRE

Nair, Manu V; Dudek, Piotr

2015-01-01

This paper discusses implementations of gradientdescent based learning algorithms on memristive crossbar arrays. The Unregulated Step Descent (USD) is described as a practical algorithm for feed-forward on-line training of large crossbar arrays. It allows fast feed-forward fully parallel on-line hardware based learning, without requiring accurate models of the memristor behaviour and precise control of the programming pulses. The effect of device parameters, training parameters, and device va...

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

Directory of Open Access Journals (Sweden)

Zhifeng Dai

2014-01-01

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

Solving Optimal Control Problem of Monodomain Model Using Hybrid Conjugate Gradient Methods

Directory of Open Access Journals (Sweden)

Kin Wei Ng

2012-01-01

Full Text Available We present the numerical solutions for the PDE-constrained optimization problem arising in cardiac electrophysiology, that is, the optimal control problem of monodomain model. The optimal control problem of monodomain model is a nonlinear optimization problem that is constrained by the monodomain model. The monodomain model consists of a parabolic partial differential equation coupled to a system of nonlinear ordinary differential equations, which has been widely used for simulating cardiac electrical activity. Our control objective is to dampen the excitation wavefront using optimal applied extracellular current. Two hybrid conjugate gradient methods are employed for computing the optimal applied extracellular current, namely, the Hestenes-Stiefel-Dai-Yuan (HS-DY method and the Liu-Storey-Conjugate-Descent (LS-CD method. Our experiment results show that the excitation wavefronts are successfully dampened out when these methods are used. Our experiment results also show that the hybrid conjugate gradient methods are superior to the classical conjugate gradient methods when Armijo line search is used.

On Scalable Deep Learning and Parallelizing Gradient Descent

CERN Document Server

AUTHOR|(CDS)2129036; Möckel, Rico; Baranowski, Zbigniew; Canali, Luca

Speeding up gradient based methods has been a subject of interest over the past years with many practical applications, especially with respect to Deep Learning. Despite the fact that many optimizations have been done on a hardware level, the convergence rate of very large models remains problematic. Therefore, data parallel methods next to mini-batch parallelism have been suggested to further decrease the training time of parameterized models using gradient based methods. Nevertheless, asynchronous optimization was considered too unstable for practical purposes due to a lacking understanding of the underlying mechanisms. Recently, a theoretical contribution has been made which defines asynchronous optimization in terms of (implicit) momentum due to the presence of a queuing model of gradients based on past parameterizations. This thesis mainly builds upon this work to construct a better understanding why asynchronous optimization shows proportionally more divergent behavior when the number of parallel worker...

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

Science.gov (United States)

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

2017-09-01

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

Machine learning for inverse lithography: using stochastic gradient descent for robust photomask synthesis

International Nuclear Information System (INIS)

Jia, Ningning; Lam, Edmund Y

2010-01-01

Inverse lithography technology (ILT) synthesizes photomasks by solving an inverse imaging problem through optimization of an appropriate functional. Much effort on ILT is dedicated to deriving superior masks at a nominal process condition. However, the lower k 1 factor causes the mask to be more sensitive to process variations. Robustness to major process variations, such as focus and dose variations, is desired. In this paper, we consider the focus variation as a stochastic variable, and treat the mask design as a machine learning problem. The stochastic gradient descent approach, which is a useful tool in machine learning, is adopted to train the mask design. Compared with previous work, simulation shows that the proposed algorithm is effective in producing robust masks

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

Science.gov (United States)

Xu, Xiao; Kong, Fan-Yu

2016-01-01

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

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

Science.gov (United States)

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

2017-08-01

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

Terrain reconstruction based on descent images for the Chang’e III landing area

Directory of Open Access Journals (Sweden)

Xu Xinchao

2015-10-01

Full Text Available A new method that combined image matching and shape from shading for terrain reconstruction was proposed to solve the lack of terrain in the landing area of Chang'e III. First, the reflection equation was established based on the Lommel– Seeliger reflection model. After edge extraction, the gradients of points on the edge were solved. The normal vectors of adjacent points were obtained using the smoothness constraint. Furthermore, the gradients of residual points in the image were determined through evolution. The inadequacy of the reflection equation was eliminated by considering the gradient as the constraint of the reflection equation. The normal vector of each point could be obtained by solving the reflection equation. The terrain without coordinate information was reconstructed by iterating the vector field. After using scaleinvariant feature transform to extract matching points in the descent images, the terrain was converted to a lander centroid coordinate system. Experiments were carried out with MATLAB-simulated images, laboratory images, and descent images of Chang'e III. Results show that the proposed method performs better than the classical SFS algorithm. The new method can provide reference for other deep space exploration activities.

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

Science.gov (United States)

Bhaya, Amit; Kaszkurewicz, Eugenius

2004-01-01

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

Understanding the Convolutional Neural Networks with Gradient Descent and Backpropagation

Science.gov (United States)

Zhou, XueFei

2018-04-01

With the development of computer technology, the applications of machine learning are more and more extensive. And machine learning is providing endless opportunities to develop new applications. One of those applications is image recognition by using Convolutional Neural Networks (CNNs). CNN is one of the most common algorithms in image recognition. It is significant to understand its theory and structure for every scholar who is interested in this field. CNN is mainly used in computer identification, especially in voice, text recognition and other aspects of the application. It utilizes hierarchical structure with different layers to accelerate computing speed. In addition, the greatest features of CNNs are the weight sharing and dimension reduction. And all of these consolidate the high effectiveness and efficiency of CNNs with idea computing speed and error rate. With the help of other learning altruisms, CNNs could be used in several scenarios for machine learning, especially for deep learning. Based on the general introduction to the background and the core solution CNN, this paper is going to focus on summarizing how Gradient Descent and Backpropagation work, and how they contribute to the high performances of CNNs. Also, some practical applications will be discussed in the following parts. The last section exhibits the conclusion and some perspectives of future work.

Minimizing convex functions by continuous descent methods

Directory of Open Access Journals (Sweden)

Sergiu Aizicovici

2010-01-01

Full Text Available We study continuous descent methods for minimizing convex functions, defined on general Banach spaces, which are associated with an appropriate complete metric space of vector fields. We show that there exists an everywhere dense open set in this space of vector fields such that each of its elements generates strongly convergent trajectories.

Optimization algorithm based on densification and dynamic canonical descent

Science.gov (United States)

Bousson, K.; Correia, S. D.

2006-07-01

Stochastic methods have gained some popularity in global optimization in that most of them do not assume the cost functions to be differentiable. They have capabilities to avoid being trapped by local optima, and may converge even faster than gradient-based optimization methods on some problems. The present paper proposes an optimization method, which reduces the search space by means of densification curves, coupled with the dynamic canonical descent algorithm. The performances of the new method are shown on several known problems classically used for testing optimization algorithms, and proved to outperform competitive algorithms such as simulated annealing and genetic algorithms.

Stochastic Spectral and Conjugate Descent Methods

KAUST Repository

Kovalev, Dmitry

2018-02-11

The state-of-the-art methods for solving optimization problems in big dimensions are variants of randomized coordinate descent (RCD). In this paper we introduce a fundamentally new type of acceleration strategy for RCD based on the augmentation of the set of coordinate directions by a few spectral or conjugate directions. As we increase the number of extra directions to be sampled from, the rate of the method improves, and interpolates between the linear rate of RCD and a linear rate independent of the condition number. We develop and analyze also inexact variants of these methods where the spectral and conjugate directions are allowed to be approximate only. We motivate the above development by proving several negative results which highlight the limitations of RCD with importance sampling.

Stochastic Spectral and Conjugate Descent Methods

KAUST Repository

Kovalev, Dmitry; Gorbunov, Eduard; Gasanov, Elnur; Richtarik, Peter

2018-01-01

The state-of-the-art methods for solving optimization problems in big dimensions are variants of randomized coordinate descent (RCD). In this paper we introduce a fundamentally new type of acceleration strategy for RCD based on the augmentation of the set of coordinate directions by a few spectral or conjugate directions. As we increase the number of extra directions to be sampled from, the rate of the method improves, and interpolates between the linear rate of RCD and a linear rate independent of the condition number. We develop and analyze also inexact variants of these methods where the spectral and conjugate directions are allowed to be approximate only. We motivate the above development by proving several negative results which highlight the limitations of RCD with importance sampling.

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

International Nuclear Information System (INIS)

Dong Bing; Ren Deqing; Zhang Xi

2011-01-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.

Conjugate descent formulation of backpropagation error in ...

African Journals Online (AJOL)

The feedforward neural network architecture uses backpropagation learning to determine optimal weights between dierent interconnected layers. This learning procedure uses a gradient descent technique applied to a sum-of-squares error function for the given input-output pattern. It employs an iterative procedure to ...

Random versus Deterministic Descent in RNA Energy Landscape Analysis

Directory of Open Access Journals (Sweden)

Luke Day

2016-01-01

Full Text Available Identifying sets of metastable conformations is a major research topic in RNA energy landscape analysis, and recently several methods have been proposed for finding local minima in landscapes spawned by RNA secondary structures. An important and time-critical component of such methods is steepest, or gradient, descent in attraction basins of local minima. We analyse the speed-up achievable by randomised descent in attraction basins in the context of large sample sets where the size has an order of magnitude in the region of ~106. While the gain for each individual sample might be marginal, the overall run-time improvement can be significant. Moreover, for the two nongradient methods we analysed for partial energy landscapes induced by ten different RNA sequences, we obtained that the number of observed local minima is on average larger by 7.3% and 3.5%, respectively. The run-time improvement is approximately 16.6% and 6.8% on average over the ten partial energy landscapes. For the large sample size we selected for descent procedures, the coverage of local minima is very high up to energy values of the region where the samples were randomly selected from the partial energy landscapes; that is, the difference to the total set of local minima is mainly due to the upper area of the energy landscapes.

Conjugate descent formulation of backpropagation error in feedforward neural networks

Directory of Open Access Journals (Sweden)

NK Sharma

2009-06-01

Full Text Available The feedforward neural network architecture uses backpropagation learning to determine optimal weights between different interconnected layers. This learning procedure uses a gradient descent technique applied to a sum-of-squares error function for the given input-output pattern. It employs an iterative procedure to minimise the error function for a given set of patterns, by adjusting the weights of the network. The first derivates of the error with respect to the weights identify the local error surface in the descent direction. Hence the network exhibits a different local error surface for every different pattern presented to it, and weights are iteratively modified in order to minimise the current local error. The determination of an optimal weight vector is possible only when the total minimum error (mean of the minimum local errors for all patterns from the training set may be minimised. In this paper, we present a general mathematical formulation for the second derivative of the error function with respect to the weights (which represents a conjugate descent for arbitrary feedforward neural network topologies, and we use this derivative information to obtain the optimal weight vector. The local error is backpropagated among the units of hidden layers via the second order derivative of the error with respect to the weights of the hidden and output layers independently and also in combination. The new total minimum error point may be evaluated with the help of the current total minimum error and the current minimised local error. The weight modification processes is performed twice: once with respect to the present local error and once more with respect to the current total or mean error. We present some numerical evidence that our proposed method yields better network weights than those determined via a conventional gradient descent approach.

Modified Convolutional Neural Network Based on Dropout and the Stochastic Gradient Descent Optimizer

Directory of Open Access Journals (Sweden)

Jing Yang

2018-03-01

Full Text Available This study proposes a modified convolutional neural network (CNN algorithm that is based on dropout and the stochastic gradient descent (SGD optimizer (MCNN-DS, after analyzing the problems of CNNs in extracting the convolution features, to improve the feature recognition rate and reduce the time-cost of CNNs. The MCNN-DS has a quadratic CNN structure and adopts the rectified linear unit as the activation function to avoid the gradient problem and accelerate convergence. To address the overfitting problem, the algorithm uses an SGD optimizer, which is implemented by inserting a dropout layer into the all-connected and output layers, to minimize cross entropy. This study used the datasets MNIST, HCL2000, and EnglishHand as the benchmark data, analyzed the performance of the SGD optimizer under different learning parameters, and found that the proposed algorithm exhibited good recognition performance when the learning rate was set to [0.05, 0.07]. The performances of WCNN, MLP-CNN, SVM-ELM, and MCNN-DS were compared. Statistical results showed the following: (1 For the benchmark MNIST, the MCNN-DS exhibited a high recognition rate of 99.97%, and the time-cost of the proposed algorithm was merely 21.95% of MLP-CNN, and 10.02% of SVM-ELM; (2 Compared with SVM-ELM, the average improvement in the recognition rate of MCNN-DS was 2.35% for the benchmark HCL2000, and the time-cost of MCNN-DS was only 15.41%; (3 For the EnglishHand test set, the lowest recognition rate of the algorithm was 84.93%, the highest recognition rate was 95.29%, and the average recognition rate was 89.77%.

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

Directory of Open Access Journals (Sweden)

Ahmad Alhawarat

2015-01-01

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

Convergence results for a class of abstract continuous descent methods

Directory of Open Access Journals (Sweden)

Sergiu Aizicovici

2004-03-01

Full Text Available We study continuous descent methods for the minimization of Lipschitzian functions defined on a general Banach space. We establish convergence theorems for those methods which are generated by approximate solutions to evolution equations governed by regular vector fields. Since the complement of the set of regular vector fields is $sigma$-porous, we conclude that our results apply to most vector fields in the sense of Baire's categories.

preconditioning the modified conjugate gradient method

African Journals Online (AJOL)

Admin

steepest descent method, the number of matrix-vector products per iteration .... modified CGM algorithm is used for large class of problems that is not ..... New Trends in the Mathematical and Computer Sciences with Applications to Real World.

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

Science.gov (United States)

Antoine, Xavier; Levitt, Antoine; Tang, Qinglin

2017-08-01

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

Distributed Coordinate Descent Method for Learning with Big Data

OpenAIRE

Richtárik, Peter; Takáč, Martin

2013-01-01

In this paper we develop and analyze Hydra: HYbriD cooRdinAte descent method for solving loss minimization problems with big data. We initially partition the coordinates (features) and assign each partition to a different node of a cluster. At every iteration, each node picks a random subset of the coordinates from those it owns, independently from the other computers, and in parallel computes and applies updates to the selected coordinates based on a simple closed-form formula. We give bound...

Global Convergence of Arbitrary-Block Gradient Methods for Generalized Polyak-{\\L} ojasiewicz Functions

KAUST Repository

Csiba, Dominik

2017-09-09

In this paper we introduce two novel generalizations of the theory for gradient descent type methods in the proximal setting. First, we introduce the proportion function, which we further use to analyze all known (and many new) block-selection rules for block coordinate descent methods under a single framework. This framework includes randomized methods with uniform, non-uniform or even adaptive sampling strategies, as well as deterministic methods with batch, greedy or cyclic selection rules. Second, the theory of strongly-convex optimization was recently generalized to a specific class of non-convex functions satisfying the so-called Polyak-{\\\\L}ojasiewicz condition. To mirror this generalization in the weakly convex case, we introduce the Weak Polyak-{\\\\L}ojasiewicz condition, using which we give global convergence guarantees for a class of non-convex functions previously not considered in theory. Additionally, we establish (necessarily somewhat weaker) convergence guarantees for an even larger class of non-convex functions satisfying a certain smoothness assumption only. By combining the two abovementioned generalizations we recover the state-of-the-art convergence guarantees for a large class of previously known methods and setups as special cases of our general framework. Moreover, our frameworks allows for the derivation of new guarantees for many new combinations of methods and setups, as well as a large class of novel non-convex objectives. The flexibility of our approach offers a lot of potential for future research, as a new block selection procedure will have a convergence guarantee for all objectives considered in our framework, while a new objective analyzed under our approach will have a whole fleet of block selection rules with convergence guarantees readily available.

Global Convergence of Arbitrary-Block Gradient Methods for Generalized Polyak-{\\L} ojasiewicz Functions

KAUST Repository

Csiba, Dominik; Richtarik, Peter

2017-01-01

In this paper we introduce two novel generalizations of the theory for gradient descent type methods in the proximal setting. First, we introduce the proportion function, which we further use to analyze all known (and many new) block-selection rules for block coordinate descent methods under a single framework. This framework includes randomized methods with uniform, non-uniform or even adaptive sampling strategies, as well as deterministic methods with batch, greedy or cyclic selection rules. Second, the theory of strongly-convex optimization was recently generalized to a specific class of non-convex functions satisfying the so-called Polyak-{\\L}ojasiewicz condition. To mirror this generalization in the weakly convex case, we introduce the Weak Polyak-{\\L}ojasiewicz condition, using which we give global convergence guarantees for a class of non-convex functions previously not considered in theory. Additionally, we establish (necessarily somewhat weaker) convergence guarantees for an even larger class of non-convex functions satisfying a certain smoothness assumption only. By combining the two abovementioned generalizations we recover the state-of-the-art convergence guarantees for a large class of previously known methods and setups as special cases of our general framework. Moreover, our frameworks allows for the derivation of new guarantees for many new combinations of methods and setups, as well as a large class of novel non-convex objectives. The flexibility of our approach offers a lot of potential for future research, as a new block selection procedure will have a convergence guarantee for all objectives considered in our framework, while a new objective analyzed under our approach will have a whole fleet of block selection rules with convergence guarantees readily available.

Planning fuel-conservative descents in an airline environmental using a small programmable calculator: algorithm development and flight test results

Energy Technology Data Exchange (ETDEWEB)

Knox, C.E.; Vicroy, D.D.; Simmon, D.A.

1985-05-01

A simple, airborne, flight-management descent algorithm was developed and programmed into a small programmable calculator. The algorithm may be operated in either a time mode or speed mode. The time mode was designed to aid the pilot in planning and executing a fuel-conservative descent to arrive at a metering fix at a time designated by the air traffic control system. The speed model was designed for planning fuel-conservative descents when time is not a consideration. The descent path for both modes was calculated for a constant with considerations given for the descent Mach/airspeed schedule, gross weight, wind, wind gradient, and nonstandard temperature effects. Flight tests, using the algorithm on the programmable calculator, showed that the open-loop guidance could be useful to airline flight crews for planning and executing fuel-conservative descents.

Block-conjugate-gradient method

International Nuclear Information System (INIS)

McCarthy, J.F.

1989-01-01

It is shown that by using the block-conjugate-gradient method several, say s, columns of the inverse Kogut-Susskind fermion matrix can be found simultaneously, in less time than it would take to run the standard conjugate-gradient algorithm s times. The method improves in efficiency relative to the standard conjugate-gradient algorithm as the fermion mass is decreased and as the value of the coupling is pushed to its limit before the finite-size effects become important. Thus it is potentially useful for measuring propagators in large lattice-gauge-theory calculations of the particle spectrum

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

Science.gov (United States)

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.

Hybrid Steepest-Descent Methods for Triple Hierarchical Variational Inequalities

Directory of Open Access Journals (Sweden)

L. C. Ceng

2015-01-01

Full Text Available We introduce and analyze a relaxed iterative algorithm by combining Korpelevich’s extragradient method, hybrid steepest-descent method, and Mann’s iteration method. We prove that, under appropriate assumptions, the proposed algorithm converges strongly to a common element of the fixed point set of infinitely many nonexpansive mappings, the solution set of finitely many generalized mixed equilibrium problems (GMEPs, the solution set of finitely many variational inclusions, and the solution set of general system of variational inequalities (GSVI, which is just a unique solution of a triple hierarchical variational inequality (THVI in a real Hilbert space. In addition, we also consider the application of the proposed algorithm for solving a hierarchical variational inequality problem with constraints of finitely many GMEPs, finitely many variational inclusions, and the GSVI. The results obtained in this paper improve and extend the corresponding results announced by many others.

Accelerated convergence of the steepest-descent method for magnetohydrodynamic equilibria

International Nuclear Information System (INIS)

Handy, C.R.; Hirshman, S.P.

1984-06-01

Iterative schemes based on the method of steepest descent have recently been used to obtain magnetohydrodynamic (MHD) equilibria. Such schemes generate asymptotic geometric vector sequences whose convergence rate can be improved through the use of the epsilon-algorithm. The application of this nonlinear recursive technique to stiff systems is discussed. In principle, the epsilon-algorithm is capable of yielding quadratic convergence and therefore represents an attractive alternative to other quadratic convergence schemes requiring Jacobian matrix inversion. Because the damped MHD equations have eigenvalues with negative real parts (in the neighborhood of a stable equilibrium), the epsilon-algorithm will generally be stable. Concern for residual monotonic sequences leads to consideration of alternative methods for implementing the algorithm

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

Science.gov (United States)

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

2018-05-01

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

STOCHASTIC GRADIENT METHODS FOR UNCONSTRAINED OPTIMIZATION

Directory of Open Access Journals (Sweden)

Nataša Krejić

2014-12-01

Full Text Available This papers presents an overview of gradient based methods for minimization of noisy functions. It is assumed that the objective functions is either given with error terms of stochastic nature or given as the mathematical expectation. Such problems arise in the context of simulation based optimization. The focus of this presentation is on the gradient based Stochastic Approximation and Sample Average Approximation methods. The concept of stochastic gradient approximation of the true gradient can be successfully extended to deterministic problems. Methods of this kind are presented for the data fitting and machine learning problems.

Adaptive Regularization of Neural Networks Using Conjugate Gradient

DEFF Research Database (Denmark)

Goutte, Cyril; Larsen, Jan

1998-01-01

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

Policy Gradient Adaptive Dynamic Programming for Data-Based Optimal Control.

Science.gov (United States)

Luo, Biao; Liu, Derong; Wu, Huai-Ning; Wang, Ding; Lewis, Frank L

2017-10-01

The model-free optimal control problem of general discrete-time nonlinear systems is considered in this paper, and a data-based policy gradient adaptive dynamic programming (PGADP) algorithm is developed to design an adaptive optimal controller method. By using offline and online data rather than the mathematical system model, the PGADP algorithm improves control policy with a gradient descent scheme. The convergence of the PGADP algorithm is proved by demonstrating that the constructed Q -function sequence converges to the optimal Q -function. Based on the PGADP algorithm, the adaptive control method is developed with an actor-critic structure and the method of weighted residuals. Its convergence properties are analyzed, where the approximate Q -function converges to its optimum. Computer simulation results demonstrate the effectiveness of the PGADP-based adaptive control method.

Application of a Gradient Descent Continuous Actor-Critic Algorithm for Double-Side Day-Ahead Electricity Market Modeling

Directory of Open Access Journals (Sweden)

Huiru Zhao

2016-09-01

Full Text Available An important goal of China’s electric power system reform is to create a double-side day-ahead wholesale electricity market in the future, where the suppliers (represented by GenCOs and demanders (represented by DisCOs compete simultaneously with each other in one market. Therefore, modeling and simulating the dynamic bidding process and the equilibrium in the double-side day-ahead electricity market scientifically is not only important to some developed countries, but also to China to provide a bidding decision-making tool to help GenCOs and DisCOs obtain more profits in market competition. Meanwhile, it can also provide an economic analysis tool to help government officials design the proper market mechanisms and policies. The traditional dynamic game model and table-based reinforcement learning algorithm have already been employed in the day-ahead electricity market modeling. However, those models are based on some assumptions, such as taking the probability distribution function of market clearing price (MCP and each rival’s bidding strategy as common knowledge (in dynamic game market models, and assuming the discrete state and action sets of every agent (in table-based reinforcement learning market models, which are no longer applicable in a realistic situation. In this paper, a modified reinforcement learning method, called gradient descent continuous Actor-Critic (GDCAC algorithm was employed in the double-side day-ahead electricity market modeling and simulation. This algorithm can not only get rid of the abovementioned unrealistic assumptions, but also cope with the Markov decision-making process with continuous state and action sets just like the real electricity market. Meanwhile, the time complexity of our proposed model is only O(n. The simulation result of employing the proposed model in the double-side day-ahead electricity market shows the superiority of our approach in terms of participant’s profit or social welfare

Nonlinear conjugate gradient methods in micromagnetics

Directory of Open Access Journals (Sweden)

J. Fischbacher

2017-04-01

Full Text Available Conjugate gradient methods for energy minimization in micromagnetics are compared. The comparison of analytic results with numerical simulation shows that standard conjugate gradient method may fail to produce correct results. A method that restricts the step length in the line search is introduced, in order to avoid this problem. When the step length in the line search is controlled, conjugate gradient techniques are a fast and reliable way to compute the hysteresis properties of permanent magnets. The method is applied to investigate demagnetizing effects in NdFe12 based permanent magnets. The reduction of the coercive field by demagnetizing effects is μ0ΔH = 1.4 T at 450 K.

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models.

Science.gov (United States)

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

2015-01-01

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

Modified conjugate gradient method for diagonalizing large matrices.

Science.gov (United States)

Jie, Quanlin; Liu, Dunhuan

2003-11-01

We present an iterative method to diagonalize large matrices. The basic idea is the same as the conjugate gradient (CG) method, i.e, minimizing the Rayleigh quotient via its gradient and avoiding reintroducing errors to the directions of previous gradients. Each iteration step is to find lowest eigenvector of the matrix in a subspace spanned by the current trial vector and the corresponding gradient of the Rayleigh quotient, as well as some previous trial vectors. The gradient, together with the previous trial vectors, play a similar role as the conjugate gradient of the original CG algorithm. Our numeric tests indicate that this method converges significantly faster than the original CG method. And the computational cost of one iteration step is about the same as the original CG method. It is suitable for first principle calculations.

Approximate error conjugation gradient minimization methods

Science.gov (United States)

Kallman, Jeffrey S

2013-05-21

In one embodiment, a method includes selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, calculating an approximate error using the subset of rays, and calculating a minimum in a conjugate gradient direction based on the approximate error. In another embodiment, a system includes a processor for executing logic, logic for selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, logic for calculating an approximate error using the subset of rays, and logic for calculating a minimum in a conjugate gradient direction based on the approximate error. In other embodiments, computer program products, methods, and systems are described capable of using approximate error in constrained conjugate gradient minimization problems.

Preconditioning the modified conjugate gradient method ...

African Journals Online (AJOL)

In this paper, the convergence analysis of the conventional conjugate Gradient method was reviewed. And the convergence analysis of the modified conjugate Gradient method was analysed with our extension on preconditioning the algorithm. Convergence of the algorithm is a function of the condition number of M-1A.

A method for easily customizable gradient gel electrophoresis.

Science.gov (United States)

Miller, Andrew J; Roman, Brandon; Norstrom, Eric

2016-09-15

Gradient polyacrylamide gel electrophoresis is a powerful tool for the resolution of polypeptides by relative mobility. Here, we present a simplified method for generating polyacrylamide gradient gels for routine analysis without the need for specialized mixing equipment. The method allows for easily customizable gradients which can be optimized for specific polypeptide resolution requirements. Moreover, the method eliminates the possibility of buffer cross contamination in mixing equipment, and the time and resources saved with this method in place of traditional gradient mixing, or the purchase of pre-cast gels, are noteworthy given the frequency with which many labs use gradient gel SDS-PAGE. Copyright © 2016 Elsevier Inc. All rights reserved.

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

Science.gov (United States)

Wu, Yanlin

2017-01-01

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

A Gradient Taguchi Method for Engineering Optimization

Science.gov (United States)

Hwang, Shun-Fa; Wu, Jen-Chih; He, Rong-Song

2017-10-01

To balance the robustness and the convergence speed of optimization, a novel hybrid algorithm consisting of Taguchi method and the steepest descent method is proposed in this work. Taguchi method using orthogonal arrays could quickly find the optimum combination of the levels of various factors, even when the number of level and/or factor is quite large. This algorithm is applied to the inverse determination of elastic constants of three composite plates by combining numerical method and vibration testing. For these problems, the proposed algorithm could find better elastic constants in less computation cost. Therefore, the proposed algorithm has nice robustness and fast convergence speed as compared to some hybrid genetic algorithms.

Steepest descent moment method for three-dimensional magnetohydrodynamic equilibria

International Nuclear Information System (INIS)

Hirshman, S.P.; Whitson, J.C.

1983-11-01

An energy principle is used to obtain the solution of the magnetohydrodynamic (MHD) equilibrium equation J Vector x B Vector - del p = 0 for nested magnetic flux surfaces that are expressed in the inverse coordinate representation x Vector = x Vector(rho, theta, zeta). Here, theta and zeta are poloidal and toroidal flux coordinate angles, respectively, and p = p(rho) labels a magnetic surface. Ordinary differential equations in rho are obtained for the Fourier amplitudes (moments) in the doubly periodic spectral decomposition of x Vector. A steepest descent iteration is developed for efficiently solving these nonlinear, coupled moment equations. The existence of a positive-definite energy functional guarantees the monotonic convergence of this iteration toward an equilibrium solution (in the absence of magnetic island formation). A renormalization parameter lambda is introduced to ensure the rapid convergence of the Fourier series for x Vector, while simultaneously satisfying the MHD requirement that magnetic field lines are straight in flux coordinates. A descent iteration is also developed for determining the self-consistent value for lambda

Two New PRP Conjugate Gradient Algorithms for Minimization Optimization Models.

Directory of Open Access Journals (Sweden)

Gonglin Yuan

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

Regression Analysis of Top of Descent Location for Idle-thrust Descents

Science.gov (United States)

Stell, Laurel; Bronsvoort, Jesper; McDonald, Greg

2013-01-01

In this paper, multiple regression analysis is used to model the top of descent (TOD) location of user-preferred descent trajectories computed by the flight management system (FMS) on over 1000 commercial flights into Melbourne, Australia. The independent variables cruise altitude, final altitude, cruise Mach, descent speed, wind, and engine type were also recorded or computed post-operations. Both first-order and second-order models are considered, where cross-validation, hypothesis testing, and additional analysis are used to compare models. This identifies the models that should give the smallest errors if used to predict TOD location for new data in the future. A model that is linear in TOD altitude, final altitude, descent speed, and wind gives an estimated standard deviation of 3.9 nmi for TOD location given the trajec- tory parameters, which means about 80% of predictions would have error less than 5 nmi in absolute value. This accuracy is better than demonstrated by other ground automation predictions using kinetic models. Furthermore, this approach would enable online learning of the model. Additional data or further knowl- edge of algorithms is necessary to conclude definitively that no second-order terms are appropriate. Possible applications of the linear model are described, including enabling arriving aircraft to fly optimized descents computed by the FMS even in congested airspace. In particular, a model for TOD location that is linear in the independent variables would enable decision support tool human-machine interfaces for which a kinetic approach would be computationally too slow.

Comparison of genetic algorithms with conjugate gradient methods

Science.gov (United States)

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

1972-01-01

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

An Adaptive Orientation Estimation Method for Magnetic and Inertial Sensors in the Presence of Magnetic Disturbances

Directory of Open Access Journals (Sweden)

Bingfei Fan

2017-05-01

Full Text Available Magnetic and inertial sensors have been widely used to estimate the orientation of human segments due to their low cost, compact size and light weight. However, the accuracy of the estimated orientation is easily affected by external factors, especially when the sensor is used in an environment with magnetic disturbances. In this paper, we propose an adaptive method to improve the accuracy of orientation estimations in the presence of magnetic disturbances. The method is based on existing gradient descent algorithms, and it is performed prior to sensor fusion algorithms. The proposed method includes stationary state detection and magnetic disturbance severity determination. The stationary state detection makes this method immune to magnetic disturbances in stationary state, while the magnetic disturbance severity determination helps to determine the credibility of magnetometer data under dynamic conditions, so as to mitigate the negative effect of the magnetic disturbances. The proposed method was validated through experiments performed on a customized three-axis instrumented gimbal with known orientations. The error of the proposed method and the original gradient descent algorithms were calculated and compared. Experimental results demonstrate that in stationary state, the proposed method is completely immune to magnetic disturbances, and in dynamic conditions, the error caused by magnetic disturbance is reduced by 51.2% compared with original MIMU gradient descent algorithm.

Real-time aircraft continuous descent trajectory optimization with ATC time constraints using direct collocation methods.

OpenAIRE

Verhoeven, Ronald; Dalmau Codina, Ramon; Prats Menéndez, Xavier; de Gelder, Nico

2014-01-01

1 Abstract In this paper an initial implementation of a real - time aircraft trajectory optimization algorithm is presented . The aircraft trajectory for descent and approach is computed for minimum use of thrust and speed brake in support of a “green” continuous descent and approach flight operation, while complying with ATC time constraints for maintaining runway throughput and co...

An Optimized Method for Terrain Reconstruction Based on Descent Images

Directory of Open Access Journals (Sweden)

Xu Xinchao

2016-02-01

Full Text Available An optimization method is proposed to perform high-accuracy terrain reconstruction of the landing area of Chang’e III. First, feature matching is conducted using geometric model constraints. Then, the initial terrain is obtained and the initial normal vector of each point is solved on the basis of the initial terrain. By changing the vector around the initial normal vector in small steps a set of new vectors is obtained. By combining these vectors with the direction of light and camera, the functions are set up on the basis of a surface reflection model. Then, a series of gray values is derived by solving the equations. The new optimized vector is recorded when the obtained gray value is closest to the corresponding pixel. Finally, the optimized terrain is obtained after iteration of the vector field. Experiments were conducted using the laboratory images and descent images of Chang’e III. The results showed that the performance of the proposed method was better than that of the classical feature matching method. It can provide a reference for terrain reconstruction of the landing area in subsequent moon exploration missions.

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

Science.gov (United States)

Chowdhary, J; Keyes, T

2002-02-01

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

A TLBO based gradient descent learning-functional link higher order ANN: An efficient model for learning from non-linear data

Directory of Open Access Journals (Sweden)

Bighnaraj Naik

2018-01-01

Full Text Available All the higher order ANNs (HONNs including functional link ANN (FLANN are sensitive to random initialization of weight and rely on the learning algorithms adopted. Although a selection of efficient learning algorithms for HONNs helps to improve the performance, on the other hand, initialization of weights with optimized weights rather than random weights also play important roles on its efficiency. In this paper, the problem solving approach of the teaching learning based optimization (TLBO along with learning ability of the gradient descent learning (GDL is used to obtain the optimal set of weight of FLANN learning model. TLBO does not require any specific parameters rather it requires only some of the common independent parameters like number of populations, number of iterations and stopping criteria, thereby eliminating the intricacy in selection of algorithmic parameters for adjusting the set of weights of FLANN model. The proposed TLBO-FLANN is implemented in MATLAB and compared with GA-FLANN, PSO-FLANN and HS-FLANN. The TLBO-FLANN is tested on various 5-fold cross validated benchmark data sets from UCI machine learning repository and analyzed under the null-hypothesis by using Friedman test, Holm’s procedure and post hoc ANOVA statistical analysis (Tukey test & Dunnett test.

FUSION OF MULTI-SCALE DEMS FROM DESCENT AND NAVCM IMAGES OF CHANG’E-3 USING COMPRESSED SENSING METHOD

Directory of Open Access Journals (Sweden)

M. Peng

2017-07-01

Full Text Available The multi-source DEMs generated using the images acquired in the descent and landing phase and after landing contain supplementary information, and this makes it possible and beneficial to produce a higher-quality DEM through fusing the multi-scale DEMs. The proposed fusion method consists of three steps. First, source DEMs are split into small DEM patches, then the DEM patches are classified into a few groups by local density peaks clustering. Next, the grouped DEM patches are used for sub-dictionary learning by stochastic coordinate coding. The trained sub-dictionaries are combined into a dictionary for sparse representation. Finally, the simultaneous orthogonal matching pursuit (SOMP algorithm is used to achieve sparse representation. We use the real DEMs generated from Chang’e-3 descent images and navigation camera (Navcam stereo images to validate the proposed method. Through the experiments, we have reconstructed a seamless DEM with the highest resolution and the largest spatial coverage among the input data. The experimental results demonstrated the feasibility of the proposed method.

On Nonconvex Decentralized Gradient Descent

Science.gov (United States)

2016-08-01

and J. Bolte, On the convergence of the proximal algorithm for nonsmooth functions involving analytic features, Math . Program., 116: 5-16, 2009. [2] H...splitting, and regularized Gauss-Seidel methods, Math . Pro- gram., Ser. A, 137: 91-129, 2013. [3] P. Bianchi and J. Jakubowicz, Convergence of a multi-agent...subgradient method under random communication topologies , IEEE J. Sel. Top. Signal Process., 5:754-771, 2011. [11] A. Nedic and A. Ozdaglar, Distributed

Theseus' arid Peirithoos' descent into the underworld

NARCIS (Netherlands)

Bremmer, Jan N.

2015-01-01

In my contribution I will first briefly discuss the earliest known literary descent, that by Enkidu, which almost certainly influenced the poet of the Odyssey in his depiction of Odysseus' descent. Then I will take a brief look at some descents in the Archaic Age, in particular the earliest

A Block Coordinate Descent Method for Multi-Convex Optimization with Applications to Nonnegative Tensor Factorization and Completion

Science.gov (United States)

2012-08-01

Sciandrone, On the convergence of the block nonlinear Gauss - Seidel method under convex constraints , Oper. Res. Lett., 26 (2000), pp. 127–136. [23] S.P...include nonsmooth functions. Our main interest is the block coordinate descent (BCD) method of the Gauss - Seidel type, which mini- mizes F cyclically over...original objective around the current iterate . They do not use extrapolation either and only have subsequence convergence . There are examples of ri

The multigrid preconditioned conjugate gradient method

Science.gov (United States)

Tatebe, Osamu

1993-01-01

A multigrid preconditioned conjugate gradient method (MGCG method), which uses the multigrid method as a preconditioner of the PCG method, is proposed. The multigrid method has inherent high parallelism and improves convergence of long wavelength components, which is important in iterative methods. By using this method as a preconditioner of the PCG method, an efficient method with high parallelism and fast convergence is obtained. First, it is considered a necessary condition of the multigrid preconditioner in order to satisfy requirements of a preconditioner of the PCG method. Next numerical experiments show a behavior of the MGCG method and that the MGCG method is superior to both the ICCG method and the multigrid method in point of fast convergence and high parallelism. This fast convergence is understood in terms of the eigenvalue analysis of the preconditioned matrix. From this observation of the multigrid preconditioner, it is realized that the MGCG method converges in very few iterations and the multigrid preconditioner is a desirable preconditioner of the conjugate gradient method.

A numerical method for solving singular De`s

Energy Technology Data Exchange (ETDEWEB)

Mahaver, W.T.

1996-12-31

A numerical method is developed for solving singular differential equations using steepest descent based on weighted Sobolev gradients. The method is demonstrated on a variety of first and second order problems, including linear constrained, unconstrained, and partially constrained first order problems, a nonlinear first order problem with irregular singularity, and two second order variational problems.

Exploring the 3D Surfaces with Modified Method of Steepest Descent

Directory of Open Access Journals (Sweden)

Wioletta GRZENDA

2012-06-01

Full Text Available Aim: To prove expediency of the steepest descent method to divide a given cloud of (Y, X1, X2 points into the spatial clusters with purpose to estimate a simple regression model Y = f(Z|X1,X2 at each cluster. Material and Method: The exemplary data sets {Y, X1, X2} were drawn randomly from assumed 3D surface: Y = f(X1,X2, and then a random noise was added to variable Y. A polynomial model Y = f(X1,X2 and a set of models Y = f(Z|X1,X2 were estimated separately, both under Akaike information criterion (AIC, and then compared with respect to their determination coefficients R-square, and the residuals’ distributions. Results: In the artificial data set studied, the both compared methods after several iterations can provide regression models of the quite similar quality. Conclusions: Because the proposed novel method seems to be more robust to outliers, and easier to graphical presentations and to intuitive understanding than the conventional way of building a regression model, the proposed novel method can be recommended to use by non-statisticians, especially in situation when, besides usual moderate noise, the sporadic but influential measurement errors can occur.

Application of the conjugate-gradient method to ground-water models

Science.gov (United States)

Manteuffel, T.A.; Grove, D.B.; Konikow, Leonard F.

1984-01-01

The conjugate-gradient method can solve efficiently and accurately finite-difference approximations to the ground-water flow equation. An aquifer-simulation model using the conjugate-gradient method was applied to a problem of ground-water flow in an alluvial aquifer at the Rocky Mountain Arsenal, Denver, Colorado. For this application, the accuracy and efficiency of the conjugate-gradient method compared favorably with other available methods for steady-state flow. However, its efficiency relative to other available methods depends on the nature of the specific problem. The main advantage of the conjugate-gradient method is that it does not require the use of iteration parameters, thereby eliminating this partly subjective procedure. (USGS)

Discrete gradient methods for solving variational image regularisation models

International Nuclear Information System (INIS)

Grimm, V; McLachlan, Robert I; McLaren, David I; Quispel, G R W; Schönlieb, C-B

2017-01-01

Discrete gradient methods are well-known methods of geometric numerical integration, which preserve the dissipation of gradient systems. In this paper we show that this property of discrete gradient methods can be interesting in the context of variational models for image processing, that is where the processed image is computed as a minimiser of an energy functional. Numerical schemes for computing minimisers of such energies are desired to inherit the dissipative property of the gradient system associated to the energy and consequently guarantee a monotonic decrease of the energy along iterations, avoiding situations in which more computational work might lead to less optimal solutions. Under appropriate smoothness assumptions on the energy functional we prove that discrete gradient methods guarantee a monotonic decrease of the energy towards stationary states, and we promote their use in image processing by exhibiting experiments with convex and non-convex variational models for image deblurring, denoising, and inpainting. (paper)

Gradient-type methods in inverse parabolic problems

International Nuclear Information System (INIS)

Kabanikhin, Sergey; Penenko, Aleksey

2008-01-01

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

A Gauss-Newton method for the integration of spatial normal fields in shape Space

KAUST Repository

Balzer, Jonathan

2011-01-01

to solving a nonlinear least-squares problem in shape space. Previously, the corresponding minimization has been performed by gradient descent, which suffers from slow convergence and susceptibility to local minima. Newton-type methods, although significantly

Videodefaecography combined with measurement of the anorectal angle and of perineal descent

International Nuclear Information System (INIS)

Skomorowska, E.; Henrichsen, S.; Christiansen, J.; Hegedues, V.; Glostrup Sygehus, Copenhagen

1987-01-01

Cineradiographic defaecography combined with measurement of the anorectal angle and descent of the pelvic floor is proposed. The method used in 73 women gave valuable information in 48 patients who complained of anal incompetence, rectal tenesmus, and chronic constipation. In these patients, high and low rectal intussusception, rectocele, and pathologic movement of the pelvic floor were detected. Some of these phenomena could only be diagnosed by the radiologic method here described. Quantitations of the anorectal angle and descent of the pelvic floor placed the group with constipation halfway between normal individuals and those with anal incompetence. The value of this finding is discussed. Recent improvements in anorectal surgery often make videodefaecography decisive for the choice of the optimal operative method. Therefore, videodefaecography together with measurement of the anorectal angle and pelvic floor descent is recommended whenever anorectal surgery for correction of functional disturbances is contemplated. (orig.)

Continuous Descent Operations using Energy Principles

NARCIS (Netherlands)

De Jong, P.M.A.

2014-01-01

During today’s aircraft descents, Air Traf?c Control (ATC) commands aircraft to descend to specific altitudes and directions to maintain separation and spacing from other aircraft. When the aircraft is instructed to maintain an intermediate descent altitude, it requires engine thrust to maintain

A neural method for determining electromagnetic shower positions in laterally segmented calorimeters

International Nuclear Information System (INIS)

Roy, A.; Ray, A.; Mitra, T.; Roy, A.

1995-01-01

A method based on a neural network technique is proposed to calculate the coordinates of an incident photon striking a laterally segmented calorimeter and depositing shower energies in different segments. The technique uses a multilayer perceptron trained by back-propagation implemented through standard gradient descent followed by conjugate gradient algorithms and has been demonstrated with GEANT simulations of a BAF2 detector array. The position resolution results obtained by using this method are found to be substantially better than the first moment method with logarithmic weighting. (orig.)

An Efficient Approach for Solving Mesh Optimization Problems Using Newton’s Method

Directory of Open Access Journals (Sweden)

Jibum Kim

2014-01-01

Full Text Available We present an efficient approach for solving various mesh optimization problems. Our approach is based on Newton’s method, which uses both first-order (gradient and second-order (Hessian derivatives of the nonlinear objective function. The volume and surface mesh optimization algorithms are developed such that mesh validity and surface constraints are satisfied. We also propose several Hessian modification methods when the Hessian matrix is not positive definite. We demonstrate our approach by comparing our method with nonlinear conjugate gradient and steepest descent methods in terms of both efficiency and mesh quality.

Improving Robot Locomotion Through Learning Methods for Expensive Black-Box Systems

Science.gov (United States)

2013-11-01

in an industrial process, or the prescribed dosage of a drug during development. Definition (Environment Parameter). The environment parameter space...line indicates the deviation of this approximation from the original (right axis scale). The secondary gradient descent optimization over the linear...done through gradient descent on the representational error, cycling through all points one at a. t ime until convergence is reached. Figure 7.5 shows

Minimum weight protection - Gradient method; Protection de poids minimum - Methode du gradient

Energy Technology Data Exchange (ETDEWEB)

Danon, R.

1958-12-15

After having recalled that, when considering a mobile installation, total weight has a crucial importance, and that, in the case of a nuclear reactor, a non neglectable part of weight is that of protection, this note presents an iterative method which results, for a given protection, to a configuration with a minimum weight. After a description of the problem, the author presents the theoretical formulation of the gradient method as it is applied to the concerned case. This application is then discussed, as well as its validity in terms of convergence and uniqueness. Its actual application is then reported, and possibilities of practical applications are evoked.

Flight Management System Execution of Idle-Thrust Descents in Operations

Science.gov (United States)

Stell, Laurel L.

2011-01-01

To enable arriving aircraft to fly optimized descents computed by the flight management system (FMS) in congested airspace, ground automation must accurately predict descent trajectories. To support development of the trajectory predictor and its error models, commercial flights executed idle-thrust descents, and the recorded data includes the target speed profile and FMS intent trajectories. The FMS computes the intended descent path assuming idle thrust after top of descent (TOD), and any intervention by the controllers that alters the FMS execution of the descent is recorded so that such flights are discarded from the analysis. The horizontal flight path, cruise and meter fix altitudes, and actual TOD location are extracted from the radar data. Using more than 60 descents in Boeing 777 aircraft, the actual speeds are compared to the intended descent speed profile. In addition, three aspects of the accuracy of the FMS intent trajectory are analyzed: the meter fix crossing time, the TOD location, and the altitude at the meter fix. The actual TOD location is within 5 nmi of the intent location for over 95% of the descents. Roughly 90% of the time, the airspeed is within 0.01 of the target Mach number and within 10 KCAS of the target descent CAS, but the meter fix crossing time is only within 50 sec of the time computed by the FMS. Overall, the aircraft seem to be executing the descents as intended by the designers of the onboard automation.

New Conjugacy Conditions and Related Nonlinear Conjugate Gradient Methods

International Nuclear Information System (INIS)

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

2001-01-01

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

A new method of determining moisture gradient in wood

Science.gov (United States)

Zhiyong Cai

2008-01-01

Moisture gradient in wood and wood composites is one of most important factors that affects both physical stability and mechanical performance. This paper describes a method for measuring moisture gradient in lumber and engineering wood composites as it varies across material thickness. This innovative method employs a collimated radiation beam (x rays or [gamma] rays...

Non-homogeneous updates for the iterative coordinate descent algorithm

Science.gov (United States)

Yu, Zhou; Thibault, Jean-Baptiste; Bouman, Charles A.; Sauer, Ken D.; Hsieh, Jiang

2007-02-01

Statistical reconstruction methods show great promise for improving resolution, and reducing noise and artifacts in helical X-ray CT. In fact, statistical reconstruction seems to be particularly valuable in maintaining reconstructed image quality when the dosage is low and the noise is therefore high. However, high computational cost and long reconstruction times remain as a barrier to the use of statistical reconstruction in practical applications. Among the various iterative methods that have been studied for statistical reconstruction, iterative coordinate descent (ICD) has been found to have relatively low overall computational requirements due to its fast convergence. This paper presents a novel method for further speeding the convergence of the ICD algorithm, and therefore reducing the overall reconstruction time for statistical reconstruction. The method, which we call nonhomogeneous iterative coordinate descent (NH-ICD) uses spatially non-homogeneous updates to speed convergence by focusing computation where it is most needed. Experimental results with real data indicate that the method speeds reconstruction by roughly a factor of two for typical 3D multi-slice geometries.

Gradient High Performance Liquid Chromatography Method ...

African Journals Online (AJOL)

Purpose: To develop a gradient high performance liquid chromatography (HPLC) method for the simultaneous determination of phenylephrine (PHE) and ibuprofen (IBU) in solid ..... nimesulide, phenylephrine. Hydrochloride, chlorpheniramine maleate and caffeine anhydrous in pharmaceutical dosage form. Acta Pol.

Shape tracking with occlusions via coarse-to-fine region-based sobolev descent

KAUST Repository

Yang, Yanchao

2015-05-01

We present a method to track the shape of an object from video. The method uses a joint shape and appearance model of the object, which is propagated to match shape and radiance in subsequent frames, determining object shape. Self-occlusions and dis-occlusions of the object from camera and object motion pose difficulties to joint shape and appearance models in tracking. They are unable to adapt to new shape and appearance information, leading to inaccurate shape detection. In this work, we model self-occlusions and dis-occlusions in a joint shape and appearance tracking framework. Self-occlusions and the warp to propagate the model are coupled, thus we formulate a joint optimization problem. We derive a coarse-to-fine optimization method, advantageous in tracking, that initially perturbs the model by coarse perturbations before transitioning to finer-scale perturbations seamlessly. This coarse-to-fine behavior is automatically induced by gradient descent on a novel infinite-dimensional Riemannian manifold that we introduce. The manifold consists of planar parameterized regions, and the metric that we introduce is a novel Sobolev metric. Experiments on video exhibiting occlusions/dis-occlusions, complex radiance and background show that occlusion/dis-occlusion modeling leads to superior shape accuracy. © 2014 IEEE.

Gradient-based methods for production optimization of oil reservoirs

Energy Technology Data Exchange (ETDEWEB)

Suwartadi, Eka

2012-07-01

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

Optimization of axial enrichment distribution for BWR fuels using scoping libraries and block coordinate descent method

Energy Technology Data Exchange (ETDEWEB)

Tung, Wu-Hsiung, E-mail: wstong@iner.gov.tw; Lee, Tien-Tso; Kuo, Weng-Sheng; Yaur, Shung-Jung

2017-03-15

Highlights: • An optimization method for axial enrichment distribution in a BWR fuel was developed. • Block coordinate descent method is employed to search for optimal solution. • Scoping libraries are used to reduce computational effort. • Optimization search space consists of enrichment difference parameters. • Capability of the method to find optimal solution is demonstrated. - Abstract: An optimization method has been developed to search for the optimal axial enrichment distribution in a fuel assembly for a boiling water reactor core. The optimization method features: (1) employing the block coordinate descent method to find the optimal solution in the space of enrichment difference parameters, (2) using scoping libraries to reduce the amount of CASMO-4 calculation, and (3) integrating a core critical constraint into the objective function that is used to quantify the quality of an axial enrichment design. The objective function consists of the weighted sum of core parameters such as shutdown margin and critical power ratio. The core parameters are evaluated by using SIMULATE-3, and the cross section data required for the SIMULATE-3 calculation are generated by using CASMO-4 and scoping libraries. The application of the method to a 4-segment fuel design (with the highest allowable segment enrichment relaxed to 5%) demonstrated that the method can obtain an axial enrichment design with improved thermal limit ratios and objective function value while satisfying the core design constraints and core critical requirement through the use of an objective function. The use of scoping libraries effectively reduced the number of CASMO-4 calculation, from 85 to 24, in the 4-segment optimization case. An exhausted search was performed to examine the capability of the method in finding the optimal solution for a 4-segment fuel design. The results show that the method found a solution very close to the optimum obtained by the exhausted search. The number of

Luteinizing hormone in testicular descent

DEFF Research Database (Denmark)

Toppari, Jorma; Kaleva, Marko M; Virtanen, Helena E

2007-01-01

alone is not sufficient for normal testicular descent. The regulation of androgen production is influenced both by placental human chorionic gonadotropin (hCG) and pituitary luteinizing hormone (LH). There is evidence that the longer pregnancy continues, the more important role pituitary LH may have....... Insulin-like hormone-3 (INSL3) is suggested to be the main regulator of gubernacular development and therefore an apparent regulator of testicular descent. INSL3 production is also related to LH, and reduced INSL3 action is a possible cause for cryptorchidism. Cryptorchid boys have normal testosterone...

M-step preconditioned conjugate gradient methods

Science.gov (United States)

Adams, L.

1983-01-01

Preconditioned conjugate gradient methods for solving sparse symmetric and positive finite systems of linear equations are described. Necessary and sufficient conditions are given for when these preconditioners can be used and an analysis of their effectiveness is given. Efficient computer implementations of these methods are discussed and results on the CYBER 203 and the Finite Element Machine under construction at NASA Langley Research Center are included.

Accelerated gradient methods for total-variation-based CT image reconstruction

Energy Technology Data Exchange (ETDEWEB)

Joergensen, Jakob H.; Hansen, Per Christian [Technical Univ. of Denmark, Lyngby (Denmark). Dept. of Informatics and Mathematical Modeling; Jensen, Tobias L.; Jensen, Soeren H. [Aalborg Univ. (Denmark). Dept. of Electronic Systems; Sidky, Emil Y.; Pan, Xiaochuan [Chicago Univ., Chicago, IL (United States). Dept. of Radiology

2011-07-01

Total-variation (TV)-based CT image reconstruction has shown experimentally to be capable of producing accurate reconstructions from sparse-view data. In particular TV-based reconstruction is well suited for images with piecewise nearly constant regions. Computationally, however, TV-based reconstruction is demanding, especially for 3D imaging, and the reconstruction from clinical data sets is far from being close to real-time. This is undesirable from a clinical perspective, and thus there is an incentive to accelerate the solution of the underlying optimization problem. The TV reconstruction can in principle be found by any optimization method, but in practice the large scale of the systems arising in CT image reconstruction preclude the use of memory-intensive methods such as Newton's method. The simple gradient method has much lower memory requirements, but exhibits prohibitively slow convergence. In the present work we address the question of how to reduce the number of gradient method iterations needed to achieve a high-accuracy TV reconstruction. We consider the use of two accelerated gradient-based methods, GPBB and UPN, to solve the 3D-TV minimization problem in CT image reconstruction. The former incorporates several heuristics from the optimization literature such as Barzilai-Borwein (BB) step size selection and nonmonotone line search. The latter uses a cleverly chosen sequence of auxiliary points to achieve a better convergence rate. The methods are memory efficient and equipped with a stopping criterion to ensure that the TV reconstruction has indeed been found. An implementation of the methods (in C with interface to Matlab) is available for download from http://www2.imm.dtu.dk/~pch/TVReg/. We compare the proposed methods with the standard gradient method, applied to a 3D test problem with synthetic few-view data. We find experimentally that for realistic parameters the proposed methods significantly outperform the standard gradient method. (orig.)

Parente2: a fast and accurate method for detecting identity by descent

KAUST Repository

Rodriguez, Jesse M.; Bercovici, Sivan; Huang, Lin; Frostig, Roy; Batzoglou, Serafim

2014-01-01

Identity-by-descent (IBD) inference is the problem of establishing a genetic connection between two individuals through a genomic segment that is inherited by both individuals from a recent common ancestor. IBD inference is an important preceding step in a variety of population genomic studies, ranging from demographic studies to linking genomic variation with phenotype and disease. The problem of accurate IBD detection has become increasingly challenging with the availability of large collections of human genotypes and genomes: Given a cohort's size, a quadratic number of pairwise genome comparisons must be performed. Therefore, computation time and the false discovery rate can also scale quadratically. To enable accurate and efficient large-scale IBD detection, we present Parente2, a novel method for detecting IBD segments. Parente2 is based on an embedded log-likelihood ratio and uses a model that accounts for linkage disequilibrium by explicitly modeling haplotype frequencies. Parente2 operates directly on genotype data without the need to phase data prior to IBD inference. We evaluate Parente2's performance through extensive simulations using real data, and we show that it provides substantially higher accuracy compared to previous state-of-the-art methods while maintaining high computational efficiency.

Analytical Energy Gradients for Excited-State Coupled-Cluster Methods

Science.gov (United States)

Wladyslawski, Mark; Nooijen, Marcel

The equation-of-motion coupled-cluster (EOM-CC) and similarity transformed equation-of-motion coupled-cluster (STEOM-CC) methods have been firmly established as accurate and routinely applicable extensions of single-reference coupled-cluster theory to describe electronically excited states. An overview of these methods is provided, with emphasis on the many-body similarity transform concept that is the key to a rationalization of their accuracy. The main topic of the paper is the derivation of analytical energy gradients for such non-variational electronic structure approaches, with an ultimate focus on obtaining their detailed algebraic working equations. A general theoretical framework using Lagrange's method of undetermined multipliers is presented, and the method is applied to formulate the EOM-CC and STEOM-CC gradients in abstract operator terms, following the previous work in [P.G. Szalay, Int. J. Quantum Chem. 55 (1995) 151] and [S.R. Gwaltney, R.J. Bartlett, M. Nooijen, J. Chem. Phys. 111 (1999) 58]. Moreover, the systematics of the Lagrange multiplier approach is suitable for automation by computer, enabling the derivation of the detailed derivative equations through a standardized and direct procedure. To this end, we have developed the SMART (Symbolic Manipulation and Regrouping of Tensors) package of automated symbolic algebra routines, written in the Mathematica programming language. The SMART toolkit provides the means to expand, differentiate, and simplify equations by manipulation of the detailed algebraic tensor expressions directly. The Lagrangian multiplier formulation establishes a uniform strategy to perform the automated derivation in a standardized manner: A Lagrange multiplier functional is constructed from the explicit algebraic equations that define the energy in the electronic method; the energy functional is then made fully variational with respect to all of its parameters, and the symbolic differentiations directly yield the explicit

Gradient porous hydroxyapatite ceramics fabricated by freeze casting method

International Nuclear Information System (INIS)

Zuo Kaihui; Zhang Yuan; Jiang Dongliang; Zeng Yuping

2011-01-01

By controlling the cooling rates and the composition of slurries, the gradient porous hydroxyapatite ceramics are fabricated by the freeze casting method. According to the different cooling rate, the pores of HAP ceramics fabricated by gradient freeze casting are divided into three parts: one is lamellar pores, another is column pore and the last one is fine round pores. The laminated freeze casting is in favour of obtaining the gradient porous ceramics composed of different materials and the ceramics have unclear interfaces.

A different approach to estimate nonlinear regression model using numerical methods

Science.gov (United States)

Mahaboob, B.; Venkateswarlu, B.; Mokeshrayalu, G.; Balasiddamuni, P.

2017-11-01

This research paper concerns with the computational methods namely the Gauss-Newton method, Gradient algorithm methods (Newton-Raphson method, Steepest Descent or Steepest Ascent algorithm method, the Method of Scoring, the Method of Quadratic Hill-Climbing) based on numerical analysis to estimate parameters of nonlinear regression model in a very different way. Principles of matrix calculus have been used to discuss the Gradient-Algorithm methods. Yonathan Bard [1] discussed a comparison of gradient methods for the solution of nonlinear parameter estimation problems. However this article discusses an analytical approach to the gradient algorithm methods in a different way. This paper describes a new iterative technique namely Gauss-Newton method which differs from the iterative technique proposed by Gorden K. Smyth [2]. Hans Georg Bock et.al [10] proposed numerical methods for parameter estimation in DAE’s (Differential algebraic equation). Isabel Reis Dos Santos et al [11], Introduced weighted least squares procedure for estimating the unknown parameters of a nonlinear regression metamodel. For large-scale non smooth convex minimization the Hager and Zhang (HZ) conjugate gradient Method and the modified HZ (MHZ) method were presented by Gonglin Yuan et al [12].

On the efficiency of a randomized mirror descent algorithm in online optimization problems

Science.gov (United States)

Gasnikov, A. V.; Nesterov, Yu. E.; Spokoiny, V. G.

2015-04-01

A randomized online version of the mirror descent method is proposed. It differs from the existing versions by the randomization method. Randomization is performed at the stage of the projection of a subgradient of the function being optimized onto the unit simplex rather than at the stage of the computation of a subgradient, which is common practice. As a result, a componentwise subgradient descent with a randomly chosen component is obtained, which admits an online interpretation. This observation, for example, has made it possible to uniformly interpret results on weighting expert decisions and propose the most efficient method for searching for an equilibrium in a zero-sum two-person matrix game with sparse matrix.

Gender difference in metacarpal descent of fifth metacarpal

International Nuclear Information System (INIS)

Rafique, A.; Ali, H.; Ghani, S.

2006-01-01

To determine the difference in metacarpal descent of fifth metacarpal between men and women. Skyline of the 2nd and 3rd metacarpals were used as reference line, from which the descent of the 5th metacarpal head was measured. The position of 5th metacarpal head was documented as angle X. Metacarpal descent was defined as the difference between angle 'X' in relaxed and clenched fist position. The relaxed position was standardized by placing the forearm, wrist and palm on a shaped woodblock such that the wrist would be held in 25 - 30 degree in extension by a triangular spur, supported the 3rd metacarpal only. It was ensured that the movement of 4th and 5th metacarpals were not impaired. Analysis of variance was performed to compare the significance of means between genders at p < 0.05 level of significance. Metacarpal descent of the 5th metacarpal of both hands was significantly greater for women, with a mean of 7 degree as compared with a mean of 4 degree for the men. This decrease in angle 'X' was significant for the right 5th metacarpal relaxed and fist position and the fist position on the left. In contrast, women showed no significant differences between the various age groups for any of the variables tested.There was no relationship between metacarpal descent and hand dominance.Difference in metacarpal descent between men and women is significant and must be kept in mind when hand function is evaluated in both genders to assess the outcome of treatment and rehabilitation. (author)

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

International Nuclear Information System (INIS)

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

2007-01-01

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

A Spectral Conjugate Gradient Method for Unconstrained Optimization

International Nuclear Information System (INIS)

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

2001-01-01

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

Entry, Descent, and Landing for Human Mars Missions

Science.gov (United States)

Munk, Michelle M.; DwyerCianciolo, Alicia M.

2012-01-01

One of the most challenging aspects of a human mission to Mars is landing safely on the Martian surface. Mars has such low atmospheric density that decelerating large masses (tens of metric tons) requires methods that have not yet been demonstrated, and are not yet planned in future Mars missions. To identify the most promising options for Mars entry, descent, and landing, and to plan development of the needed technologies, NASA's Human Architecture Team (HAT) has refined candidate methods for emplacing needed elements of the human Mars exploration architecture (such as ascent vehicles and habitats) on the Mars surface. This paper explains the detailed, optimized simulations that have been developed to define the mass needed at Mars arrival to accomplish the entry, descent, and landing functions. Based on previous work, technology options for hypersonic deceleration include rigid, mid-L/D (lift-to-drag ratio) aeroshells, and inflatable aerodynamic decelerators (IADs). The hypersonic IADs, or HIADs, are about 20% less massive than the rigid vehicles, but both have their technology development challenges. For the supersonic regime, supersonic retropropulsion (SRP) is an attractive option, since a propulsive stage must be carried for terminal descent and can be ignited at higher speeds. The use of SRP eliminates the need for an additional deceleration system, but SRP is at a low Technology Readiness Level (TRL) in that the interacting plumes are not well-characterized, and their effect on vehicle stability has not been studied, to date. These architecture-level assessments have been used to define the key performance parameters and a technology development strategy for achieving the challenging mission of landing large payloads on Mars.

Seasonal variability and descent of mid-latitude sporadic E layers at Arecibo

Directory of Open Access Journals (Sweden)

N. Christakis

2009-03-01

Full Text Available Sporadic E layers (Es follow regular daily patterns in variability and altitude descent, which are determined primarily by the vertical tidal wind shears in the lower thermosphere. In the present study a large set of sporadic E layer incoherent scatter radar (ISR measurements are analyzed. These were made at Arecibo (Geog. Lat. ~18° N; Magnetic Dip ~50° over many years with ISR runs lasting from several hours to several days, covering evenly all seasons. A new methodology is applied, in which both weak and strong layers are clearly traced by using the vertical electron density gradient as a function of altitude and time. Taking a time base equal to the 24-h local day, statistics were obtained on the seasonal behavior of the diurnal and semidiurnal tidal variability and altitude descent patterns of sporadic E at Arecibo. The diurnal tide, most likely the S(1,1 tide with a vertical wavelength around 25 km, controls fully the formation and descent of the metallic Es layers at low altitudes below 110 km. At higher altitudes, there are two prevailing layers formed presumably by vertical wind shears associated mainly with semidiurnal tides. These include: 1 a daytime layer starting at ~130 km around midday and descending down to 105 km by local midnight, and 2 a less frequent and weaker nighttime layer which starts prior to midnight at ~130 km, descending downwards at somewhat faster rate to reach 110 km by sunrise. The diurnal and semidiurnal-like pattern prevails, with some differences, in all seasons. The differences in occurrence, strength and descending speeds between the daytime and nighttime upper layers are not well understood from the present data alone and require further study.

Application of preconditioned conjugate gradient-like methods to reactor kinetics

International Nuclear Information System (INIS)

Yang, D.Y.; Chen, G.S.; Chou, H.P.

1993-01-01

Several conjugate gradient-like (CG-like) methods are applied to solve the nonsymmetric linear systems of equations derived from the time-dependent two-dimensional two-energy-group neutron diffusion equations by a finite difference approximation. The methods are: the generalized conjugate residual method; the generalized conjugate gradient least-square method; the generalized minimal residual method (GMRES); the conjugate gradient square method; and a variant of bi-conjugate gradient method (Bi-CGSTAB). In order to accelerate these methods, six preconditioning techniques are investigated. Two are based on pointwise incomplete factorization: the incomplete LU (ILU) and the modified incomplete LU (MILU) decompositions; two, based on the block tridiagonal structure of the coefficient matrix, are blockwise and modified blockwise incomplete factorizations, BILU and MBILU; two are the alternating-direction implicit and symmetric successive overrelaxation (SSOR) preconditioners, derived from the basic iterative schemes. Comparisons are made by using CG-like methods combined with different preconditioners to solve a sequence of time-step reactor transient problems. Numerical tests indicate that preconditioned BI-CGSTAB with the preconditioner MBILU requires less CPU time and fewer iterations than other methods. The preconditioned CG-like methods are less sensitive to the time-step size used than the Chebyshev semi-iteration method and line SOR method. The indication is that the CGS, Bi-CGSTAB and GMRES methods are, on average, better than the other methods in reactor kinetics computation and that a good preconditioner is more important than the choice of CG-like methods. The MILU decomposition based on the conventional row-sum criterion has difficulty yielding a convergent solution and an improved version is introduced. (author)

Integrated Targeting and Guidance for Powered Planetary Descent

Science.gov (United States)

Azimov, Dilmurat M.; Bishop, Robert H.

2018-02-01

This paper presents an on-board guidance and targeting design that enables explicit state and thrust vector control and on-board targeting for planetary descent and landing. These capabilities are developed utilizing a new closed-form solution for the constant thrust arc of the braking phase of the powered descent trajectory. The key elements of proven targeting and guidance architectures, including braking and approach phase quartics, are employed. It is demonstrated that implementation of the proposed solution avoids numerical simulation iterations, thereby facilitating on-board execution of targeting procedures during the descent. It is shown that the shape of the braking phase constant thrust arc is highly dependent on initial mass and propulsion system parameters. The analytic solution process is explicit in terms of targeting and guidance parameters, while remaining generic with respect to planetary body and descent trajectory design. These features increase the feasibility of extending the proposed integrated targeting and guidance design to future cargo and robotic landing missions.

A Modified Conjugacy Condition and Related Nonlinear Conjugate Gradient Method

Directory of Open Access Journals (Sweden)

Shengwei Yao

2014-01-01

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

A gradient activation method for direct methanol fuel cells

International Nuclear Information System (INIS)

Liu, Guicheng; Yang, Zhaoyi; Halim, Martin; Li, Xinyang; Wang, Manxiang; Kim, Ji Young; Mei, Qiwen; Wang, Xindong; Lee, Joong Kee

2017-01-01

Highlights: • A gradient activation method was reported firstly for direct methanol fuel cells. • The activity recovery of Pt-based catalyst was introduced into the novel activation process. • The new activation method led to prominent enhancement of DMFC performance. • DMFC performance was improved with the novel activation step by step within 7.5 h. - Abstract: To realize gradient activation effect and recover catalytic activity of catalyst in a short time, a gradient activation method has firstly been proposed for enhancing discharge performance and perfecting activation mechanism of the direct methanol fuel cell (DMFC). This method includes four steps, i.e. proton activation, activity recovery activation, H_2-O_2 mode activation and forced discharging activation. The results prove that the proposed method has gradually realized replenishment of water and protons, recovery of catalytic activity of catalyst, establishment of transfer channels for electrons, protons, and oxygen, and optimization of anode catalyst layer for methanol transfer in turn. Along with the novel activation process going on, the DMFC discharge performance has been improved, step by step, to more than 1.9 times higher than that of the original one within 7.5 h. This method provides a practicable activation way for the real application of single DMFCs and stacks.

Noise annoyance caused by continuous descent approaches compared to regular descent procedures

NARCIS (Netherlands)

White, K.; Arntzen, M.; Walker, F.; Waiyaki, F.M.; Meeter, M.; Bronkhorst, A.W.

2017-01-01

During Continuous Descent Approaches (CDAs) aircraft glide towards the runway resulting in reduced noise and fuel usage. Here, we investigated whether such landings cause less noise annoyance than a regular stepwise approach. Both landing types were compared in a controlled laboratory setting with a

Parente2: a fast and accurate method for detecting identity by descent

KAUST Repository

Rodriguez, Jesse M.

2014-10-01

Identity-by-descent (IBD) inference is the problem of establishing a genetic connection between two individuals through a genomic segment that is inherited by both individuals from a recent common ancestor. IBD inference is an important preceding step in a variety of population genomic studies, ranging from demographic studies to linking genomic variation with phenotype and disease. The problem of accurate IBD detection has become increasingly challenging with the availability of large collections of human genotypes and genomes: Given a cohort\\'s size, a quadratic number of pairwise genome comparisons must be performed. Therefore, computation time and the false discovery rate can also scale quadratically. To enable accurate and efficient large-scale IBD detection, we present Parente2, a novel method for detecting IBD segments. Parente2 is based on an embedded log-likelihood ratio and uses a model that accounts for linkage disequilibrium by explicitly modeling haplotype frequencies. Parente2 operates directly on genotype data without the need to phase data prior to IBD inference. We evaluate Parente2\\'s performance through extensive simulations using real data, and we show that it provides substantially higher accuracy compared to previous state-of-the-art methods while maintaining high computational efficiency.

Automation for Accommodating Fuel-Efficient Descents in Constrained Airspace

Science.gov (United States)

Coopenbarger, Richard A.

2010-01-01

Continuous descents at low engine power are desired to reduce fuel consumption, emissions and noise during arrival operations. The challenge is to allow airplanes to fly these types of efficient descents without interruption during busy traffic conditions. During busy conditions today, airplanes are commonly forced to fly inefficient, step-down descents as airtraffic controllers work to ensure separation and maximize throughput. NASA in collaboration with government and industry partners is developing new automation to help controllers accommodate continuous descents in the presence of complex traffic and airspace constraints. This automation relies on accurate trajectory predictions to compute strategic maneuver advisories. The talk will describe the concept behind this new automation and provide an overview of the simulations and flight testing used to develop and refine its underlying technology.

ExoMars entry, descent and landing science

OpenAIRE

Ferri, F.; Lewis, S. R.; Withers, P.; Aboudan, A.; Bettanini, C.; Colombatti, G.; Debei, S.; Golombek, M.; Harri, A. M.; Komatsu, G.; Leese, M. R.; Mäkinen, T.; Müller-Wodarg, I.; Ori, G. G.; Patel, M. R.

2011-01-01

The entry, descent and landing of ExoMars offer a rare (once-per-mission) opportunity to perform in situ investigation of the martian environment over a wide altitude range. Entry, Descent and Landing System (EDLS) measurements can provide essential data for atmospheric scientific investigations.\\ud \\ud We intend to perform atmospheric science measurements by exploiting data from EDLS engineering sensors and exploiting their readings beyond the expected engineering information.

Application of Conjugate Gradient methods to tidal simulation

Science.gov (United States)

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

1993-01-01

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

Design of automation tools for management of descent traffic

Science.gov (United States)

Erzberger, Heinz; Nedell, William

1988-01-01

The design of an automated air traffic control system based on a hierarchy of advisory tools for controllers is described. Compatibility of the tools with the human controller, a key objective of the design, is achieved by a judicious selection of tasks to be automated and careful attention to the design of the controller system interface. The design comprises three interconnected subsystems referred to as the Traffic Management Advisor, the Descent Advisor, and the Final Approach Spacing Tool. Each of these subsystems provides a collection of tools for specific controller positions and tasks. This paper focuses primarily on the Descent Advisor which provides automation tools for managing descent traffic. The algorithms, automation modes, and graphical interfaces incorporated in the design are described. Information generated by the Descent Advisor tools is integrated into a plan view traffic display consisting of a high-resolution color monitor. Estimated arrival times of aircraft are presented graphically on a time line, which is also used interactively in combination with a mouse input device to select and schedule arrival times. Other graphical markers indicate the location of the fuel-optimum top-of-descent point and the predicted separation distances of aircraft at a designated time-control point. Computer generated advisories provide speed and descent clearances which the controller can issue to aircraft to help them arrive at the feeder gate at the scheduled times or with specified separation distances. Two types of horizontal guidance modes, selectable by the controller, provide markers for managing the horizontal flightpaths of aircraft under various conditions. The entire system consisting of descent advisor algorithm, a library of aircraft performance models, national airspace system data bases, and interactive display software has been implemented on a workstation made by Sun Microsystems, Inc. It is planned to use this configuration in operational

RES: Regularized Stochastic BFGS Algorithm

Science.gov (United States)

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.

Correlation Between Echodefecography and 3-Dimensional Vaginal Ultrasonography in the Detection of Perineal Descent in Women With Constipation Symptoms.

Science.gov (United States)

Murad-Regadas, Sthela M; Pinheiro Regadas, Francisco Sergio; Rodrigues, Lusmar V; da Silva Vilarinho, Adjra; Buchen, Guilherme; Borges, Livia Olinda; Veras, Lara B; da Cruz, Mariana Murad

2016-12-01

Defecography is an established method of evaluating dynamic anorectal dysfunction, but conventional defecography does not allow for visualization of anatomic structures. The purpose of this study was to describe the use of dynamic 3-dimensional endovaginal ultrasonography for evaluating perineal descent in comparison with echodefecography (3-dimensional anorectal ultrasonography) and to study the relationship between perineal descent and symptoms and anatomic/functional abnormalities of the pelvic floor. This was a prospective study. The study was conducted at a large university tertiary care hospital. Consecutive female patients were eligible if they had pelvic floor dysfunction, obstructed defecation symptoms, and a score >6 on the Cleveland Clinic Florida Constipation Scale. Each patient underwent both echodefecography and dynamic 3-dimensional endovaginal ultrasonography to evaluate posterior pelvic floor dysfunction. Normal perineal descent was defined on echodefecography as puborectalis muscle displacement ≤2.5 cm; excessive perineal descent was defined as displacement >2.5 cm. Of 61 women, 29 (48%) had normal perineal descent; 32 (52%) had excessive perineal descent. Endovaginal ultrasonography identified 27 of the 29 patients in the normal group as having anorectal junction displacement ≤1 cm (mean = 0.6 cm; range, 0.1-1.0 cm) and a mean anorectal junction position of 0.6 cm (range, 0-2.3 cm) above the symphysis pubis during the Valsalva maneuver and correctly identified 30 of the 32 patients in the excessive perineal descent group. The κ statistic showed almost perfect agreement (κ = 0.86) between the 2 methods for categorization into the normal and excessive perineal descent groups. Perineal descent was not related to fecal or urinary incontinence or anatomic and functional factors (sphincter defects, pubovisceral muscle defects, levator hiatus area, grade II or III rectocele, intussusception, or anismus). The study did not include a

PRECONDITIONED BI-CONJUGATE GRADIENT METHOD FOR RADIATIVE TRANSFER IN SPHERICAL MEDIA

International Nuclear Information System (INIS)

Anusha, L. S.; Nagendra, K. N.; Paletou, F.; Leger, L.

2009-01-01

A robust numerical method called the Preconditioned Bi-Conjugate Gradient (Pre-BiCG) method is proposed for the solution of the radiative transfer equation in spherical geometry. A variant of this method called Stabilized Preconditioned Bi-Conjugate Gradient (Pre-BiCG-STAB) is also presented. These are iterative methods based on the construction of a set of bi-orthogonal vectors. The application of the Pre-BiCG method in some benchmark tests shows that the method is quite versatile, and can handle difficult problems that may arise in astrophysical radiative transfer theory.

Final descent for CMS

CERN Multimedia

The 15th and last section of the CMS detector was lowered on Tuesday 22 January. The YE-1 endcap (1430 tonnes) began its 100-metre descent at 7 am and arrived gently on the floor of the experiment hall at 5.30 pm.

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

Science.gov (United States)

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

2017-09-01

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

A hybrid optimization method for biplanar transverse gradient coil design

International Nuclear Information System (INIS)

Qi Feng; Tang Xin; Jin Zhe; Jiang Zhongde; Shen Yifei; Meng Bin; Zu Donglin; Wang Weimin

2007-01-01

The optimization of transverse gradient coils is one of the fundamental problems in designing magnetic resonance imaging gradient systems. A new approach is presented in this paper to optimize the transverse gradient coils' performance. First, in the traditional spherical harmonic target field method, high order coefficients, which are commonly ignored, are used in the first stage of the optimization process to give better homogeneity. Then, some cosine terms are introduced into the series expansion of stream function. These new terms provide simulated annealing optimization with new freedoms. Comparison between the traditional method and the optimized method shows that the inhomogeneity in the region of interest can be reduced from 5.03% to 1.39%, the coil efficiency increased from 3.83 to 6.31 mT m -1 A -1 and the minimum distance of these discrete coils raised from 1.54 to 3.16 mm

43 CFR 10.14 - Lineal descent and cultural affiliation.

Science.gov (United States)

2010-10-01

... Hawaiian organization and the human remains, funerary objects, sacred objects, or objects of cultural... 43 Public Lands: Interior 1 2010-10-01 2010-10-01 false Lineal descent and cultural affiliation... GRAVES PROTECTION AND REPATRIATION REGULATIONS General § 10.14 Lineal descent and cultural affiliation...

Methods for Fabricating Gradient Alloy Articles with Multi-Functional Properties

Science.gov (United States)

Hofmann, Douglas C. (Inventor); Borgonia, John Paul C. (Inventor); Dillon, Robert P. (Inventor); Suh, Eric J. (Inventor); Mulder, Jerry L. (Inventor); Gardner, Paul B. (Inventor)

2015-01-01

Systems and methods for fabricating multi-functional articles comprised of additively formed gradient materials are provided. The fabrication of multi-functional articles using the additive deposition of gradient alloys represents a paradigm shift from the traditional way that metal alloys and metal/metal alloy parts are fabricated. Since a gradient alloy that transitions from one metal to a different metal cannot be fabricated through any conventional metallurgy techniques, the technique presents many applications. Moreover, the embodiments described identify a broad range of properties and applications.

LA GRANDE DESCENTE

CERN Multimedia

The first endcap disc of CMS being lowered slowly and carefully 100 m underground into the experimental cavern. The disc is one of 15 large pieces to make the grand descent.  The uniquely shaped slice, 16 m high, about 50 cm thick weighs 400 tonnes. The two HF that were lowered earlier in November can also be seen in the foreground and background.  

Development and descent of the testis in relation to cryptorchidism

DEFF Research Database (Denmark)

Virtanen, Helena E; Cortes, Dina; Rajpert-De Meyts, Ewa

2007-01-01

The testis descends in two phases. Animal studies suggest, that the transabdominal descent of the testis depends on the insulin-like hormone 3 (INSL3). Androgens are important in the inguinoscrotal testicular descent in animals and humans. In general, the cause of cryptorchidism is unknown...... and the aetiology is possibly multifactorial. Histological changes in cryptorchid testes demonstrate disturbed development. Conclusion: Since testicular descent is regulated by testis-derived hormones, cryptorchidism may reflect a functional defect of the testis....

Long-Time Asymptotics for the Korteweg-de Vries Equation via Nonlinear Steepest Descent

International Nuclear Information System (INIS)

Grunert, Katrin; Teschl, Gerald

2009-01-01

We apply the method of nonlinear steepest descent to compute the long-time asymptotics of the Korteweg-de Vries equation for decaying initial data in the soliton and similarity region. This paper can be viewed as an expository introduction to this method

A unified framework of descent algorithms for nonlinear programs and variational inequalities

International Nuclear Information System (INIS)

Patriksson, M.

1993-01-01

We present a framework of algorithms for the solution of continuous optimization and variational inequality problems. In the general algorithm, a search direction finding auxiliary problems is obtained by replacing the original cost function with an approximating monotone cost function. The proposed framework encompasses algorithm classes presented earlier by Cohen, Dafermos, Migdalas, and Tseng, and includes numerous descent and successive approximation type methods, such as Newton methods, Jacobi and Gauss-Siedel type decomposition methods for problems defined over Cartesian product sets, and proximal point methods, among others. The auxiliary problem of the general algorithm also induces equivalent optimization reformulation and descent methods for asymmetric variational inequalities. We study the convergence properties of the general algorithm when applied to unconstrained optimization, nondifferentiable optimization, constrained differentiable optimization, and variational inequalities; the emphasis of the convergence analyses is placed on basic convergence results, convergence using different line search strategies and truncated subproblem solutions, and convergence rate results. This analysis offer a unification of known results; moreover, it provides strengthenings of convergence results for many existing algorithms, and indicates possible improvements of their realizations. 482 refs

Monte Carlo method for polarized radiative transfer in gradient-index media

International Nuclear Information System (INIS)

Zhao, J.M.; Tan, J.Y.; Liu, L.H.

2015-01-01

Light transfer in gradient-index media generally follows curved ray trajectories, which will cause light beam to converge or diverge during transfer and induce the rotation of polarization ellipse even when the medium is transparent. Furthermore, the combined process of scattering and transfer along curved ray path makes the problem more complex. In this paper, a Monte Carlo method is presented to simulate polarized radiative transfer in gradient-index media that only support planar ray trajectories. The ray equation is solved to the second order to address the effect induced by curved ray trajectories. Three types of test cases are presented to verify the performance of the method, which include transparent medium, Mie scattering medium with assumed gradient index distribution, and Rayleigh scattering with realistic atmosphere refractive index profile. It is demonstrated that the atmospheric refraction has significant effect for long distance polarized light transfer. - Highlights: • A Monte Carlo method for polarized radiative transfer in gradient index media. • Effect of curved ray paths on polarized radiative transfer is considered. • Importance of atmospheric refraction for polarized light transfer is demonstrated

Studies of the hormonal control of postnatal testicular descent in the rat.

Science.gov (United States)

Spencer, J R; Vaughan, E D; Imperato-McGinley, J

1993-03-01

Dihydrotestosterone is believed to control the transinguinal phase of testicular descent based on hormonal manipulation studies performed in postnatal rats. In the present study, these hormonal manipulation experiments were repeated, and the results were compared with those obtained using the antiandrogens flutamide and cyproterone acetate. 17 beta-estradiol completely blocked testicular descent, but testosterone and dihydrotestosterone were equally effective in reversing this inhibition. Neither flutamide nor cyproterone acetate prevented testicular descent in postnatal rats despite marked peripheral antiandrogenic action. Further analysis of the data revealed a correlation between testicular size and descent. Androgen receptor blockade did not produce a marked reduction in testicular size and consequently did not prevent testicular descent, whereas estradiol alone caused marked testicular atrophy and testicular maldescent. Reduction of the estradiol dosage or concomitant administration of androgens or human chorionic gonadotropin resulted in both increased testicular size and degree of descent. These data suggest that growth of the neonatal rat testis may contribute to its passage into the scrotum.

IMPROVEMENT OF RECOGNITION QUALITY IN DEEP LEARNING NETWORKS BY SIMULATED ANNEALING METHOD

Directory of Open Access Journals (Sweden)

A. S. Potapov

2014-09-01

Full Text Available The subject of this research is deep learning methods, in which automatic construction of feature transforms is taken place in tasks of pattern recognition. Multilayer autoencoders have been taken as the considered type of deep learning networks. Autoencoders perform nonlinear feature transform with logistic regression as an upper classification layer. In order to verify the hypothesis of possibility to improve recognition rate by global optimization of parameters for deep learning networks, which are traditionally trained layer-by-layer by gradient descent, a new method has been designed and implemented. The method applies simulated annealing for tuning connection weights of autoencoders while regression layer is simultaneously trained by stochastic gradient descent. Experiments held by means of standard MNIST handwritten digit database have shown the decrease of recognition error rate from 1.1 to 1.5 times in case of the modified method comparing to the traditional method, which is based on local optimization. Thus, overfitting effect doesn’t appear and the possibility to improve learning rate is confirmed in deep learning networks by global optimization methods (in terms of increasing recognition probability. Research results can be applied for improving the probability of pattern recognition in the fields, which require automatic construction of nonlinear feature transforms, in particular, in the image recognition. Keywords: pattern recognition, deep learning, autoencoder, logistic regression, simulated annealing.

A critical analysis of some popular methods for the discretisation of the gradient operator in finite volume methods

Science.gov (United States)

Syrakos, Alexandros; Varchanis, Stylianos; Dimakopoulos, Yannis; Goulas, Apostolos; Tsamopoulos, John

2017-12-01

Finite volume methods (FVMs) constitute a popular class of methods for the numerical simulation of fluid flows. Among the various components of these methods, the discretisation of the gradient operator has received less attention despite its fundamental importance with regards to the accuracy of the FVM. The most popular gradient schemes are the divergence theorem (DT) (or Green-Gauss) scheme and the least-squares (LS) scheme. Both are widely believed to be second-order accurate, but the present study shows that in fact the common variant of the DT gradient is second-order accurate only on structured meshes whereas it is zeroth-order accurate on general unstructured meshes, and the LS gradient is second-order and first-order accurate, respectively. This is explained through a theoretical analysis and is confirmed by numerical tests. The schemes are then used within a FVM to solve a simple diffusion equation on unstructured grids generated by several methods; the results reveal that the zeroth-order accuracy of the DT gradient is inherited by the FVM as a whole, and the discretisation error does not decrease with grid refinement. On the other hand, use of the LS gradient leads to second-order accurate results, as does the use of alternative, consistent, DT gradient schemes, including a new iterative scheme that makes the common DT gradient consistent at almost no extra cost. The numerical tests are performed using both an in-house code and the popular public domain partial differential equation solver OpenFOAM.

Method to stimulate dose gradient in liquid media

International Nuclear Information System (INIS)

Scarlat, F.

1993-01-01

The depth absorbed dose from electrons with energy higher than 10 MeV shows a distribution with a big-percentage absorbed dose at the entrance surface and a small dose gradient. This is due to the big distance between the virtual focus and irradiated liquid medium. In order to stimulate dose gradient and decrease the surface dose, this paper presents a method for obtaining the second focus by means of a magnetostatic planar wiggler. Preliminary calculations indicated that the absorbed dose rate increases two-three times at the reference plane in the irradiated liquid medium. (Author)

Controlled time of arrival windows for already initiated energy-neutral continuous descent operations

OpenAIRE

Dalmau Codina, Ramon; Prats Menéndez, Xavier

2017-01-01

Continuous descent operations with controlled times of arrival at one or several metering fixes could enable environmentally friendly procedures without compromising terminal airspace capacity. This paper focuses on controlled time of arrival updates once the descent has been already initiated, assessing the feasible time window (and associated fuel consumption) of continuous descent operations requiring neither thrust nor speed-brake usage along the whole descent (i.e. only elevator control ...

Entry, Descent, and Landing With Propulsive Deceleration

Science.gov (United States)

Palaszewski, Bryan

2012-01-01

The future exploration of the Solar System will require innovations in transportation and the use of entry, descent, and landing (EDL) systems at many planetary landing sites. The cost of space missions has always been prohibitive, and using the natural planetary and planet s moons atmospheres for entry, descent, and landing can reduce the cost, mass, and complexity of these missions. This paper will describe some of the EDL ideas for planetary entry and survey the overall technologies for EDL that may be attractive for future Solar System missions.

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

International Nuclear Information System (INIS)

Chen, G.S.

1997-01-01

We apply and compare the preconditioned generalized conjugate gradient methods to solve the linear system equation that arises in the two-dimensional neutron and photon transport equation in this paper. Several subroutines are developed on the basis of preconditioned generalized conjugate gradient methods for time-independent, two-dimensional neutron and photon transport equation in the transport theory. These generalized conjugate gradient methods are used. TFQMR (transpose free quasi-minimal residual algorithm), CGS (conjuage gradient square algorithm), Bi-CGSTAB (bi-conjugate gradient stabilized algorithm) and QMRCGSTAB (quasi-minimal residual variant of bi-conjugate gradient stabilized algorithm). These sub-routines are connected to computer program DORT. Several problems are tested on a personal computer with Intel Pentium CPU. (author)

Moving force identification based on modified preconditioned conjugate gradient method

Science.gov (United States)

Chen, Zhen; Chan, Tommy H. T.; Nguyen, Andy

2018-06-01

This paper develops a modified preconditioned conjugate gradient (M-PCG) method for moving force identification (MFI) by improving the conjugate gradient (CG) and preconditioned conjugate gradient (PCG) methods with a modified Gram-Schmidt algorithm. The method aims to obtain more accurate and more efficient identification results from the responses of bridge deck caused by vehicles passing by, which are known to be sensitive to ill-posed problems that exist in the inverse problem. A simply supported beam model with biaxial time-varying forces is used to generate numerical simulations with various analysis scenarios to assess the effectiveness of the method. Evaluation results show that regularization matrix L and number of iterations j are very important influence factors to identification accuracy and noise immunity of M-PCG. Compared with the conventional counterpart SVD embedded in the time domain method (TDM) and the standard form of CG, the M-PCG with proper regularization matrix has many advantages such as better adaptability and more robust to ill-posed problems. More importantly, it is shown that the average optimal numbers of iterations of M-PCG can be reduced by more than 70% compared with PCG and this apparently makes M-PCG a preferred choice for field MFI applications.

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

Science.gov (United States)

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

2007-01-01

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

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

International Nuclear Information System (INIS)

Xiao Yunhai; Hu Qingjie

2008-01-01

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

Evolutionary analyses of non-genealogical bonds produced by introgressive descent.

Science.gov (United States)

Bapteste, Eric; Lopez, Philippe; Bouchard, Frédéric; Baquero, Fernando; McInerney, James O; Burian, Richard M

2012-11-06

All evolutionary biologists are familiar with evolutionary units that evolve by vertical descent in a tree-like fashion in single lineages. However, many other kinds of processes contribute to evolutionary diversity. In vertical descent, the genetic material of a particular evolutionary unit is propagated by replication inside its own lineage. In what we call introgressive descent, the genetic material of a particular evolutionary unit propagates into different host structures and is replicated within these host structures. Thus, introgressive descent generates a variety of evolutionary units and leaves recognizable patterns in resemblance networks. We characterize six kinds of evolutionary units, of which five involve mosaic lineages generated by introgressive descent. To facilitate detection of these units in resemblance networks, we introduce terminology based on two notions, P3s (subgraphs of three nodes: A, B, and C) and mosaic P3s, and suggest an apparatus for systematic detection of introgressive descent. Mosaic P3s correspond to a distinct type of evolutionary bond that is orthogonal to the bonds of kinship and genealogy usually examined by evolutionary biologists. We argue that recognition of these evolutionary bonds stimulates radical rethinking of key questions in evolutionary biology (e.g., the relations among evolutionary players in very early phases of evolutionary history, the origin and emergence of novelties, and the production of new lineages). This line of research will expand the study of biological complexity beyond the usual genealogical bonds, revealing additional sources of biodiversity. It provides an important step to a more realistic pluralist treatment of evolutionary complexity.

Failure Bounding And Sensitivity Analysis Applied To Monte Carlo Entry, Descent, And Landing Simulations

Science.gov (United States)

Gaebler, John A.; Tolson, Robert H.

2010-01-01

In the study of entry, descent, and landing, Monte Carlo sampling methods are often employed to study the uncertainty in the designed trajectory. The large number of uncertain inputs and outputs, coupled with complicated non-linear models, can make interpretation of the results difficult. Three methods that provide statistical insights are applied to an entry, descent, and landing simulation. The advantages and disadvantages of each method are discussed in terms of the insights gained versus the computational cost. The first method investigated was failure domain bounding which aims to reduce the computational cost of assessing the failure probability. Next a variance-based sensitivity analysis was studied for the ability to identify which input variable uncertainty has the greatest impact on the uncertainty of an output. Finally, probabilistic sensitivity analysis is used to calculate certain sensitivities at a reduced computational cost. These methods produce valuable information that identifies critical mission parameters and needs for new technology, but generally at a significant computational cost.

Enumerating set partitions according to the number of descents of ...

Indian Academy of Sciences (India)

) according to the number of descents of size or more, where ≥ 1 is fixed. An explicit expression in terms of Stirling numbers of the second kind may be given for the total number of such descents in all the members of (,). We also ...

A density gradient theory based method for surface tension calculations

DEFF Research Database (Denmark)

Liang, Xiaodong; Michelsen, Michael Locht; Kontogeorgis, Georgios

2016-01-01

The density gradient theory has been becoming a widely used framework for calculating surface tension, within which the same equation of state is used for the interface and bulk phases, because it is a theoretically sound, consistent and computationally affordable approach. Based on the observation...... that the optimal density path from the geometric mean density gradient theory passes the saddle point of the tangent plane distance to the bulk phases, we propose to estimate surface tension with an approximate density path profile that goes through this saddle point. The linear density gradient theory, which...... assumes linearly distributed densities between the two bulk phases, has also been investigated. Numerical problems do not occur with these density path profiles. These two approximation methods together with the full density gradient theory have been used to calculate the surface tension of various...

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

International Nuclear Information System (INIS)

Chen, G.S.; Yang, D.Y.

1998-01-01

We apply and compare the preconditioned generalized conjugate gradient methods to solve the linear system equation that arises in the two-dimensional neutron and photon transport equation in this paper. Several subroutines are developed on the basis of preconditioned generalized conjugate gradient methods for time-independent, two-dimensional neutron and photon transport equation in the transport theory. These generalized conjugate gradient methods are used: TFQMR (transpose free quasi-minimal residual algorithm) CGS (conjugate gradient square algorithm), Bi-CGSTAB (bi-conjugate gradient stabilized algorithm) and QMRCGSTAB (quasi-minimal residual variant of bi-conjugate gradient stabilized algorithm). These subroutines are connected to computer program DORT. Several problems are tested on a personal computer with Intel Pentium CPU. The reasons to choose the generalized conjugate gradient methods are that the methods have better residual (equivalent to error) control procedures in the computation and have better convergent rate. The pointwise incomplete LU factorization ILU, modified pointwise incomplete LU factorization MILU, block incomplete factorization BILU and modified blockwise incomplete LU factorization MBILU are the preconditioning techniques used in the several testing problems. In Bi-CGSTAB, CGS, TFQMR and QMRCGSTAB method, we find that either CGS or Bi-CGSTAB method combined with preconditioner MBILU is the most efficient algorithm in these methods in the several testing problems. The numerical solution of flux by preconditioned CGS and Bi-CGSTAB methods has the same result as those from Cray computer, obtained by either the point successive relaxation method or the line successive relaxation method combined with Gaussian elimination

Testicular descent: INSL3, testosterone, genes and the intrauterine milieu

DEFF Research Database (Denmark)

Bay, Katrine; Main, Katharina M; Toppari, Jorma

2011-01-01

Complete testicular descent is a sign of, and a prerequisite for, normal testicular function in adult life. The process of testis descent is dependent on gubernacular growth and reorganization, which is regulated by the Leydig cell hormones insulin-like peptide 3 (INSL3) and testosterone. Investi...

An optimized target-field method for MRI transverse biplanar gradient coil design

International Nuclear Information System (INIS)

Zhang, Rui; Xu, Jing; Huang, Kefu; Zhang, Jue; Fang, Jing; Fu, Youyi; Li, Yangjing

2011-01-01

Gradient coils are essential components of magnetic resonance imaging (MRI) systems. In this paper, we present an optimized target-field method for designing a transverse biplanar gradient coil with high linearity, low inductance and small resistance, which can well satisfy the requirements of permanent-magnet MRI systems. In this new method, the current density is expressed by trigonometric basis functions with unknown coefficients in polar coordinates. Following the standard procedures, we construct an objective function with respect to the total square errors of the magnetic field at all target-field points with the penalty items associated with the stored magnetic energy and the dissipated power. By adjusting the two penalty factors and minimizing the objective function, the appropriate coefficients of the current density are determined. Applying the stream function method to the current density, the specific winding patterns on the planes can be obtained. A novel biplanar gradient coil has been designed using this method to operate in a permanent-magnet MRI system. In order to verify the validity of the proposed approach, the gradient magnetic field generated by the resulted current density has been calculated via the Biot–Savart law. The results have demonstrated the effectiveness and advantage of this proposed method

Deep kernel learning method for SAR image target recognition

Science.gov (United States)

Chen, Xiuyuan; Peng, Xiyuan; Duan, Ran; Li, Junbao

2017-10-01

With the development of deep learning, research on image target recognition has made great progress in recent years. Remote sensing detection urgently requires target recognition for military, geographic, and other scientific research. This paper aims to solve the synthetic aperture radar image target recognition problem by combining deep and kernel learning. The model, which has a multilayer multiple kernel structure, is optimized layer by layer with the parameters of Support Vector Machine and a gradient descent algorithm. This new deep kernel learning method improves accuracy and achieves competitive recognition results compared with other learning methods.

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

International Nuclear Information System (INIS)

Kershaw, D.S.

1978-01-01

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

Evaluation of vertical profiles to design continuous descent approach procedure

Science.gov (United States)

Pradeep, Priyank

The current research focuses on predictability, variability and operational feasibility aspect of Continuous Descent Approach (CDA), which is among the key concepts of the Next Generation Air Transportation System (NextGen). The idle-thrust CDA is a fuel economical, noise and emission abatement procedure, but requires increased separation to accommodate for variability and uncertainties in vertical and speed profiles of arriving aircraft. Although a considerable amount of researches have been devoted to the estimation of potential benefits of the CDA, only few have attempted to explain the predictability, variability and operational feasibility aspect of CDA. The analytical equations derived using flight dynamics and Base of Aircraft and Data (BADA) Total Energy Model (TEM) in this research gives insight into dependency of vertical profile of CDA on various factors like wind speed and gradient, weight, aircraft type and configuration, thrust settings, atmospheric factors (deviation from ISA (DISA), pressure and density of the air) and descent speed profile. Application of the derived equations to idle-thrust CDA gives an insight into sensitivity of its vertical profile to multiple factors. This suggests fixed geometric flight path angle (FPA) CDA has higher degree of predictability and lesser variability at the cost of non-idle and low thrust engine settings. However, with optimized design this impact can be overall minimized. The CDA simulations were performed using Future ATM Concept Evaluation Tool (FACET) based on radar-track and aircraft type data (BADA) of the real air-traffic to some of the busiest airports in the USA (ATL, SFO and New York Metroplex (JFK, EWR and LGA)). The statistical analysis of the vertical profiles of CDA shows 1) mean geometric FPAs derived from various simulated vertical profiles are consistently shallower than 3° glideslope angle and 2) high level of variability in vertical profiles of idle-thrust CDA even in absence of

Mars Exploration Rover Terminal Descent Mission Modeling and Simulation

Science.gov (United States)

Raiszadeh, Behzad; Queen, Eric M.

2004-01-01

Because of NASA's added reliance on simulation for successful interplanetary missions, the MER mission has developed a detailed EDL trajectory modeling and simulation. This paper summarizes how the MER EDL sequence of events are modeled, verification of the methods used, and the inputs. This simulation is built upon a multibody parachute trajectory simulation tool that has been developed in POST I1 that accurately simulates the trajectory of multiple vehicles in flight with interacting forces. In this model the parachute and the suspended bodies are treated as 6 Degree-of-Freedom (6 DOF) bodies. The terminal descent phase of the mission consists of several Entry, Descent, Landing (EDL) events, such as parachute deployment, heatshield separation, deployment of the lander from the backshell, deployment of the airbags, RAD firings, TIRS firings, etc. For an accurate, reliable simulation these events need to be modeled seamlessly and robustly so that the simulations will remain numerically stable during Monte-Carlo simulations. This paper also summarizes how the events have been modeled, the numerical issues, and modeling challenges.

Stereotypes of women of Asian descent in midwifery: some evidence.

Science.gov (United States)

Bowler, I M

1993-03-01

The subject of this paper is part of a larger study which investigated the delivery of maternity care to women of South Asian descent in Britain (Bowler, 1990). An ethnographic approach was used and the main method of data collection was non-participant observation in antenatal clinics, labour and postnatal wards in a teaching hospital maternity unit. These observations were supported by data from interviews with midwives. It was found that the midwives commonly use stereotypes of women in order to help them to provide care. These stereotypes are particularly likely to be used in situations where the midwife has difficulty (through pressure of time or other circumstances) in getting to know an individual woman. The stereotype of women of Asian descent contained four main themes: communication problems; failure to comply with care and service abuse; making a fuss about nothing; a lack of normal maternal instinct. Reasons for stereotyping are explored. Effects on service provision in the areas of family planning and breast feeding are highlighted.

INTEGRATED FUSION METHOD FOR MULTIPLE TEMPORAL-SPATIAL-SPECTRAL IMAGES

Directory of Open Access Journals (Sweden)

H. Shen

2012-08-01

Full Text Available Data fusion techniques have been widely researched and applied in remote sensing field. In this paper, an integrated fusion method for remotely sensed images is presented. Differently from the existed methods, the proposed method has the performance to integrate the complementary information in multiple temporal-spatial-spectral images. In order to represent and process the images in one unified framework, two general image observation models are firstly presented, and then the maximum a posteriori (MAP framework is used to set up the fusion model. The gradient descent method is employed to solve the fused image. The efficacy of the proposed method is validated using simulated images.

Application of the gradient method to Hartree-Fock-Bogoliubov theory

International Nuclear Information System (INIS)

Robledo, L. M.; Bertsch, G. F.

2011-01-01

A computer code is presented for solving the equations of the Hartree-Fock-Bogoliubov (HFB) theory by the gradient method, motivated by the need for efficient and robust codes to calculate the configurations required by extensions of the HFB theory, such as the generator coordinate method. The code is organized with a separation between the parts that are specific to the details of the Hamiltonian and the parts that are generic to the gradient method. This permits total flexibility in choosing the symmetries to be imposed on the HFB solutions. The code solves for both even and odd particle-number ground states, with the choice determined by the input data stream. Application is made to the nuclei in the sd shell using the universal sd-shell interaction B (USDB) shell-model Hamiltonian.

Accelerated gradient methods for constrained image deblurring

International Nuclear Information System (INIS)

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

2008-01-01

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

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

International Nuclear Information System (INIS)

King, J.B.; Domanus, H.

1987-01-01

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

Crosswind Shear Gradient Affect on Wake Vortices

Science.gov (United States)

Proctor, Fred H.; Ahmad, Nashat N.

2011-01-01

Parametric simulations with a Large Eddy Simulation (LES) model are used to explore the influence of crosswind shear on aircraft wake vortices. Previous studies based on field measurements, laboratory experiments, as well as LES, have shown that the vertical gradient of crosswind shear, i.e. the second vertical derivative of the environmental crosswind, can influence wake vortex transport. The presence of nonlinear vertical shear of the crosswind velocity can reduce the descent rate, causing a wake vortex pair to tilt and change in its lateral separation. The LES parametric studies confirm that the vertical gradient of crosswind shear does influence vortex trajectories. The parametric results also show that vortex decay from the effects of shear are complex since the crosswind shear, along with the vertical gradient of crosswind shear, can affect whether the lateral separation between wake vortices is increased or decreased. If the separation is decreased, the vortex linking time is decreased, and a more rapid decay of wake vortex circulation occurs. If the separation is increased, the time to link is increased, and at least one of the vortices of the vortex pair may have a longer life time than in the case without shear. In some cases, the wake vortices may never link.

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

International Nuclear Information System (INIS)

Suetomi, Eiichi; Sekimoto, Hiroshi

1989-01-01

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

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

NARCIS (Netherlands)

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

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

Landslide Occurrence Prediction Using Trainable Cascade Forward Network and Multilayer Perceptron

Directory of Open Access Journals (Sweden)

Mohammad Subhi Al-batah

2015-01-01

Full Text Available Landslides are one of the dangerous natural phenomena that hinder the development in Penang Island, Malaysia. Therefore, finding the reliable method to predict the occurrence of landslides is still the research of interest. In this paper, two models of artificial neural network, namely, Multilayer Perceptron (MLP and Cascade Forward Neural Network (CFNN, are introduced to predict the landslide hazard map of Penang Island. These two models were tested and compared using eleven machine learning algorithms, that is, Levenberg Marquardt, Broyden Fletcher Goldfarb, Resilient Back Propagation, Scaled Conjugate Gradient, Conjugate Gradient with Beale, Conjugate Gradient with Fletcher Reeves updates, Conjugate Gradient with Polakribiere updates, One Step Secant, Gradient Descent, Gradient Descent with Momentum and Adaptive Learning Rate, and Gradient Descent with Momentum algorithm. Often, the performance of the landslide prediction depends on the input factors beside the prediction method. In this research work, 14 input factors were used. The prediction accuracies of networks were verified using the Area under the Curve method for the Receiver Operating Characteristics. The results indicated that the best prediction accuracy of 82.89% was achieved using the CFNN network with the Levenberg Marquardt learning algorithm for the training data set and 81.62% for the testing data set.

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

International Nuclear Information System (INIS)

Faber, V.; Manteuffel, T.

1984-01-01

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

Hazard avoidance via descent images for safe landing

Science.gov (United States)

Yan, Ruicheng; Cao, Zhiguo; Zhu, Lei; Fang, Zhiwen

2013-10-01

In planetary or lunar landing missions, hazard avoidance is critical for landing safety. Therefore, it is very important to correctly detect hazards and effectively find a safe landing area during the last stage of descent. In this paper, we propose a passive sensing based HDA (hazard detection and avoidance) approach via descent images to lower the landing risk. In hazard detection stage, a statistical probability model on the basis of the hazard similarity is adopted to evaluate the image and detect hazardous areas, so that a binary hazard image can be generated. Afterwards, a safety coefficient, which jointly utilized the proportion of hazards in the local region and the inside hazard distribution, is proposed to find potential regions with less hazards in the binary hazard image. By using the safety coefficient in a coarse-to-fine procedure and combining it with the local ISD (intensity standard deviation) measure, the safe landing area is determined. The algorithm is evaluated and verified with many simulated descent downward looking images rendered from lunar orbital satellite images.

HIRFL-SSC trim coil currents calculation by conjugate gradients method

International Nuclear Information System (INIS)

Liu, W.

2005-01-01

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

THE GREAT DESCENT CONTINUES

CERN Document Server

    With precise coordination YE+1 was lowered into the cavern (9-Jan), soon joined by the ?rst barrel wheel YB+2 (19-Jan), then YB+1(4-Feb) and HB+ (13-Feb). The 1920 ton central barrel wheel YB0 rests brie?y on the pit-head cover in anticipation of a monumental descent (28-Feb) that will also trigger an intense campaign of installation of services and detectors underground.  

Accurate conjugate gradient methods for families of shifted systems

NARCIS (Netherlands)

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

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

Use of a preconditioned Bi-conjugate gradient method for hybrid plasma stability analysis

International Nuclear Information System (INIS)

Mikic, Z.; Morse, E.C.

1985-01-01

The numerical stability analysis of compact toroidal plasmas using implicit time differencing requires the solution of a set of coupled, 2-dimensional, elliptic partial differential equations for the field quantities at every timestep. When the equations are spatially finite-differenced and written in matrix form, the resulting matrix is large, sparse, complex, non-Hermitian, and indefinite. The use of the preconditioned bi-conjugate gradient method for solving these equations is discussed. The effect of block-diagonal preconditioning and incomplete block-LU preconditionig on the convergence of the method is investigated. For typical matrices arising in our studies, the eigenvalue spectra of the original and preconditioned matrices are calculated as an illustration of the effectiveness of the preconditioning. We show that the preconditioned bi-conjugate gradient method coverages more rapidly than the conjugate gradient method applied to the normal equations, and that it is an effective iterative method for the class of non-Hermitian, indefinite problems of interest

Dictionary Learning Based on Nonnegative Matrix Factorization Using Parallel Coordinate Descent

Directory of Open Access Journals (Sweden)

Zunyi Tang

2013-01-01

Full Text Available Sparse representation of signals via an overcomplete dictionary has recently received much attention as it has produced promising results in various applications. Since the nonnegativities of the signals and the dictionary are required in some applications, for example, multispectral data analysis, the conventional dictionary learning methods imposed simply with nonnegativity may become inapplicable. In this paper, we propose a novel method for learning a nonnegative, overcomplete dictionary for such a case. This is accomplished by posing the sparse representation of nonnegative signals as a problem of nonnegative matrix factorization (NMF with a sparsity constraint. By employing the coordinate descent strategy for optimization and extending it to multivariable case for processing in parallel, we develop a so-called parallel coordinate descent dictionary learning (PCDDL algorithm, which is structured by iteratively solving the two optimal problems, the learning process of the dictionary and the estimating process of the coefficients for constructing the signals. Numerical experiments demonstrate that the proposed algorithm performs better than the conventional nonnegative K-SVD (NN-KSVD algorithm and several other algorithms for comparison. What is more, its computational consumption is remarkably lower than that of the compared algorithms.

Propulsive Descent Technologies (PDT): Original Content Project

Data.gov (United States)

National Aeronautics and Space Administration — Future missions to Mars require landed mass that exceeds the capability of current entry, descent, and landing technology.  New technology and techniques are...

Sagagd method for the beam shaping of uniform illumination

International Nuclear Information System (INIS)

Li Yongping; Chen Dewei; Wang Wei

2002-01-01

The simulated annealing algorithm, the genetic and the gradient descent algorithm are retrospectively and successfully amalgamated to optimal design of pure phase element for uniform beams. The process of this method is divided into three steps, first the energy enhancement of the main lobe, then the process to make the top of the main lobe to be smooth and the fringe to be steep, at last the full optimization beam. After these three steps of optimization, the beam is good enough to be applied to ICF

Dictionary descent in optimization

OpenAIRE

Temlyakov, Vladimir

2015-01-01

The problem of convex optimization is studied. Usually in convex optimization the minimization is over a d-dimensional domain. Very often the convergence rate of an optimization algorithm depends on the dimension d. The algorithms studied in this paper utilize dictionaries instead of a canonical basis used in the coordinate descent algorithms. We show how this approach allows us to reduce dimensionality of the problem. Also, we investigate which properties of a dictionary are beneficial for t...

A detailed survey of numerical methods for unconstrained minimization. Pt. 1

International Nuclear Information System (INIS)

Mika, K.; Chaves, T.

1980-01-01

A detailed description of numerical methods for unconstrained minimization is presented. This first part surveys in particular conjugate direction and gradient methods, whereas variable metric methods will be the subject of the second part. Among the results of special interest we quote the following. The conjugate direction methods of Powell, Zangwill and Sutti can be best interpreted if the Smith approach is adopted. The conditions for quadratic termination of Powell's first procedure are analyzed. Numerical results based on nonlinear least squares problems are presented for the following conjugate direction codes: VA04AD from Harwell Subroutine Library and ZXPOW from IMSL, both implementations of Powell's second procedure, DFMND from IBM-SILMATH (Zangwill's method) and Brent's algorithm PRAXIS. VA04AD turns out to be superior in all cases, PRAXIS improves for high-dimensional problems. All codes clearly exhibit superlinear convergence. Akaike's result for the method of steepest descent is derived directly from a set of nonlinear recurrence relations. Numerical results obtained with the highly ill conditioned Hilbert function confirm the theoretical predictions. Several properties of the conjugate gradient method are presented and a new derivation of the equivalence of steepest descent partan and the CG method is given. A comparison of numerical results from the CG codes VA08AD (Fletcher-Reeves), DFMCG (the SSP version of the Fletcher-Reevens algorithm) and VA14AD (Powell's implementation of the Polak-Ribiere formula) reveals that VA14AD is clearly superior in all cases, but that the convergence rate of these codes is only weakly superlinear such that high accuracy solutions require extremely large numbers of function calls. (orig.)

Additive genetic variation in schizophrenia risk is shared by populations of African and European descent

NARCIS (Netherlands)

De Candia, T.r.; Lee, S.H.; Yang, J.; Browning, B.L.; Gejman, P. V.; Levinson, D. F.; Mowry, B. J.; Hewitt, J.K.; Goddard, M.E.; O'Donovan, M.C.; Purcell, S.M.; Posthuma, D.; Visscher, P. M.; Wray, N.R.; Keller, M. C.

2013-01-01

To investigate the extent to which the proportion of schizophrenia's additive genetic variation tagged by SNPs is shared by populations of European and African descent, we analyzed the largest combined African descent (AD [n = 2,142]) and European descent (ED [n = 4,990]) schizophrenia case-control

Gradient augmented level set method for phase change simulations

Science.gov (United States)

Anumolu, Lakshman; Trujillo, Mario F.

2018-01-01

A numerical method for the simulation of two-phase flow with phase change based on the Gradient-Augmented-Level-set (GALS) strategy is presented. Sharp capturing of the vaporization process is enabled by: i) identification of the vapor-liquid interface, Γ (t), at the subgrid level, ii) discontinuous treatment of thermal physical properties (except for μ), and iii) enforcement of mass, momentum, and energy jump conditions, where the gradients of the dependent variables are obtained at Γ (t) and are consistent with their analytical expression, i.e. no local averaging is applied. Treatment of the jump in velocity and pressure at Γ (t) is achieved using the Ghost Fluid Method. The solution of the energy equation employs the sub-grid knowledge of Γ (t) to discretize the temperature Laplacian using second-order one-sided differences, i.e. the numerical stencil completely resides within each respective phase. To carefully evaluate the benefits or disadvantages of the GALS approach, the standard level set method is implemented and compared against the GALS predictions. The results show the expected trend that interface identification and transport are predicted noticeably better with GALS over the standard level set. This benefit carries over to the prediction of the Laplacian and temperature gradients in the neighborhood of the interface, which are directly linked to the calculation of the vaporization rate. However, when combining the calculation of interface transport and reinitialization with two-phase momentum and energy, the benefits of GALS are to some extent neutralized, and the causes for this behavior are identified and analyzed. Overall the additional computational costs associated with GALS are almost the same as those using the standard level set technique.

Pixel-based OPC optimization based on conjugate gradients.

Science.gov (United States)

Ma, Xu; Arce, Gonzalo R

2011-01-31

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

Boundary layers affected by different pressure gradients investigated computationally by a zonal RANS-LES method

International Nuclear Information System (INIS)

Roidl, B.; Meinke, M.; Schröder, W.

2014-01-01

Highlights: • Reformulated synthetic turbulence generation method (RSTGM) is applied. • Zonal RANS-LES method is applied to boundary layers at pressure gradients. • Good agreement with the pure LES and other reference data is obtained. • The RSTGM is applicable to pressure gradient flows without modification. • RANS-to-LES boundary should be located where -1·10 6 6 is satisfied. -- Abstract: The reformulated synthetic turbulence generation (RSTG) method is used to compute by a fully coupled zonal RANS-LES approach turbulent non-zero-pressure gradient boundary layers. The quality of the RSTG method, which is based on the same shape functions and length scale distributions as in zero-pressure gradient flow, is discussed by comparing the zonal RANS-LES findings with pure LES, pure RANS, direct numerical simulation (DNS), and experimental data. For the favorable pressure gradient (FPG) simulation the RANS-to-LES transition occurs in the accelerated flow region and for the adverse pressure gradient (APG) case it is located in the decelerated flow region. The results of the time and spanwise averaged skin-friction distributions, velocity profiles, and Reynolds stress distributions of the zonal RANS-LES simulation show a satisfactory to good agreement with the pure LES, reference DNS, and experimental data. The quality of the findings shows that the rigorous formulation of the synthetic turbulence generation makes the RSTG method applicable without a priori knowledge of the flow properties but those determined by the RANS solution and without using additional control planes to regulate the shear stress budget to a wide range of Reynolds numbers and pressure gradients. The method is a promising approach to formulate embedded RANS-to-LES boundaries in flow regions where the Pohlhausen or acceleration parameter satisfies -1·10 -6 ⩽K⩽2·10 -6

Analysis of foot clearance in firefighters during ascent and descent of stairs.

Science.gov (United States)

Kesler, Richard M; Horn, Gavin P; Rosengren, Karl S; Hsiao-Wecksler, Elizabeth T

2016-01-01

Slips, trips, and falls are a leading cause of injury to firefighters with many injuries occurring while traversing stairs, possibly exaggerated by acute fatigue from firefighting activities and/or asymmetric load carriage. This study examined the effects that fatigue, induced by simulated firefighting activities, and hose load carriage have on foot clearance while traversing stairs. Landing and passing foot clearances for each stair during ascent and descent of a short staircase were investigated. Clearances decreased significantly (p < 0.05) post-exercise for nine of 12 ascent parameters and increased for two of eight descent parameters. Load carriage resulted in significantly decreased (p < 0.05) clearance over three ascent parameters, and one increase during descent. Decreased clearances during ascent caused by fatigue or load carriage may result in an increased trip risk. Increased clearances during descent may suggest use of a compensation strategy to ensure stair clearance or an increased risk of over-stepping during descent. Copyright © 2015 Elsevier Ltd and The Ergonomics Society. All rights reserved.

Boundedness and convergence of online gradient method with penalty for feedforward neural networks.

Science.gov (United States)

Zhang, Huisheng; Wu, Wei; Liu, Fei; Yao, Mingchen

2009-06-01

In this brief, we consider an online gradient method with penalty for training feedforward neural networks. Specifically, the penalty is a term proportional to the norm of the weights. Its roles in the method are to control the magnitude of the weights and to improve the generalization performance of the network. By proving that the weights are automatically bounded in the network training with penalty, we simplify the conditions that are required for convergence of online gradient method in literature. A numerical example is given to support the theoretical analysis.

An M-step preconditioned conjugate gradient method for parallel computation

Science.gov (United States)

Adams, L.

1983-01-01

This paper describes a preconditioned conjugate gradient method that can be effectively implemented on both vector machines and parallel arrays to solve sparse symmetric and positive definite systems of linear equations. The implementation on the CYBER 203/205 and on the Finite Element Machine is discussed and results obtained using the method on these machines are given.

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

Science.gov (United States)

Fessler, J A; Booth, S D

1999-01-01

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

Steepest descent approximations for accretive operator equations

International Nuclear Information System (INIS)

Chidume, C.E.

1993-03-01

A necessary and sufficient condition is established for the strong convergence of the steepest descent approximation to a solution of equations involving quasi-accretive operators defined on a uniformly smooth Banach space. (author). 49 refs

An Improved Local Gradient Method for Sea Surface Wind Direction Retrieval from SAR Imagery

Directory of Open Access Journals (Sweden)

Lizhang Zhou

2017-06-01

Full Text Available Sea surface wind affects the fluxes of energy, mass and momentum between the atmosphere and ocean, and therefore regional and global weather and climate. With various satellite microwave sensors, sea surface wind can be measured with large spatial coverage in almost all-weather conditions, day or night. Like any other remote sensing measurements, sea surface wind measurement is also indirect. Therefore, it is important to develop appropriate wind speed and direction retrieval models for different types of microwave instruments. In this paper, a new sea surface wind direction retrieval method from synthetic aperture radar (SAR imagery is developed. In the method, local gradients are computed in frequency domain by combining the operation of smoothing and computing local gradients in one step to simplify the process and avoid the difference approximation. This improved local gradients (ILG method is compared with the traditional two-dimensional fast Fourier transform (2D FFT method and local gradients (LG method, using interpolating wind directions from the European Centre for Medium-Range Weather Forecast (ECMWF reanalysis data and the Cross-Calibrated Multi-Platform (CCMP wind vector product. The sensitivities to the salt-and-pepper noise, the additive noise and the multiplicative noise are analyzed. The ILG method shows a better performance of retrieval wind directions than the other two methods.

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

Science.gov (United States)

Freund, Roland

1989-01-01

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

Ground reaction forces and frictional demands during stair descent: effects of age and illumination.

Science.gov (United States)

Christina, Kathryn A; Cavanagh, Peter R

2002-04-01

Stair descent is an inherently risky and demanding task that older adults often encounter in everyday life. It is believed that slip between the foot or shoe sole and the stair surface may play a role in stair related falls, however, there are no reports on slip resistance requirements for stair descent. The aim of this study was to determine the required coefficient of friction (RCOF) necessary for safe stair descent in 12 young and 12 older adults, under varied illuminance conditions. The RCOF during stair descent was found to be comparable in magnitude and time to that for overground walking, and thus, with adequate footwear and dry stair surfaces, friction does not appear to be a major determinant of stair safety. Illuminance level had little effect on the dependent variables quantified in this study. However, the older participants demonstrated safer strategies than the young during stair descent, as reflected by differences in the ground reaction forces and lower RCOF.

Frequency-domain full-waveform inversion with non-linear descent directions

Science.gov (United States)

Geng, Yu; Pan, Wenyong; Innanen, Kristopher A.

2018-05-01

Full-waveform inversion (FWI) is a highly non-linear inverse problem, normally solved iteratively, with each iteration involving an update constructed through linear operations on the residuals. Incorporating a flexible degree of non-linearity within each update may have important consequences for convergence rates, determination of low model wavenumbers and discrimination of parameters. We examine one approach for doing so, wherein higher order scattering terms are included within the sensitivity kernel during the construction of the descent direction, adjusting it away from that of the standard Gauss-Newton approach. These scattering terms are naturally admitted when we construct the sensitivity kernel by varying not the current but the to-be-updated model at each iteration. Linear and/or non-linear inverse scattering methodologies allow these additional sensitivity contributions to be computed from the current data residuals within any given update. We show that in the presence of pre-critical reflection data, the error in a second-order non-linear update to a background of s0 is, in our scheme, proportional to at most (Δs/s0)3 in the actual parameter jump Δs causing the reflection. In contrast, the error in a standard Gauss-Newton FWI update is proportional to (Δs/s0)2. For numerical implementation of more complex cases, we introduce a non-linear frequency-domain scheme, with an inner and an outer loop. A perturbation is determined from the data residuals within the inner loop, and a descent direction based on the resulting non-linear sensitivity kernel is computed in the outer loop. We examine the response of this non-linear FWI using acoustic single-parameter synthetics derived from the Marmousi model. The inverted results vary depending on data frequency ranges and initial models, but we conclude that the non-linear FWI has the capability to generate high-resolution model estimates in both shallow and deep regions, and to converge rapidly, relative to a

Inflammatory bowel disease in children of middle eastern descent.

Science.gov (United States)

Naidoo, Christina Mai Ying; Leach, Steven T; Day, Andrew S; Lemberg, Daniel A

2014-01-01

Increasing rates of inflammatory bowel disease (IBD) are now seen in populations where it was once uncommon. The pattern of IBD in children of Middle Eastern descent in Australia has never been reported. This study aimed to investigate the burden of IBD in children of Middle Eastern descent at the Sydney Children's Hospital, Randwick (SCHR). The SCHR IBD database was used to identify patients of self-reported Middle Eastern ethnicity diagnosed between 1987 and 2011. Demographic, diagnosis, and management data was collected for all Middle Eastern children and an age and gender matched non-Middle Eastern IBD control group. Twenty-four patients of Middle Eastern descent were identified. Middle Eastern Crohn's disease patients had higher disease activity at diagnosis, higher use of thiopurines, and less restricted colonic disease than controls. Although there were limitations with this dataset, we estimated a higher prevalence of IBD in Middle Eastern children and they had a different disease phenotype and behavior compared to the control group, with less disease restricted to the colon and likely a more active disease course.

Efficient two-level preconditionined conjugate gradient method on the GPU

NARCIS (Netherlands)

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

2011-01-01

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

Environmental effects on hormonal regulation of testicular descent

DEFF Research Database (Denmark)

Toppari, J; Virtanen, H E; Skakkebaek, N E

2006-01-01

cause some cases of undescended testis. Similarly, androgen insensitivity or androgen deficiency can cause cryptorchidism. Estrogens have been shown to down regulate INSL3 and thereby cause maldescent. Thus, a reduced androgen-estrogen ratio may disturb testicular descent. Environmental effects changing......Regulation of testicular descent is hormonally regulated, but the reasons for maldescent remain unknown in most cases. The main regulatory hormones are Leydig cell-derived testosterone and insulin-like factor 3 (INSL3). Luteinizing hormone (LH) stimulates the secretion of these hormones...... hypothesize that an exposure to a mixture of chemicals with anti-androgenic or estrogenic properties (either their own activity or their effect on androgen-estrogen ratio) may be involved in cryptorchidism....

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

NARCIS (Netherlands)

Tang, J.M.

2008-01-01

The Preconditioned Conjugate Gradient (PCG) method is one of the most popular iterative methods for solving large linear systems with a symmetric and positive semi-definite coefficient matrix. However, if the preconditioned coefficient matrix is ill-conditioned, the convergence of the PCG method

Whole-body angular momentum during stair ascent and descent.

Science.gov (United States)

Silverman, Anne K; Neptune, Richard R; Sinitski, Emily H; Wilken, Jason M

2014-04-01

The generation of whole-body angular momentum is essential in many locomotor tasks and must be regulated in order to maintain dynamic balance. However, angular momentum has not been investigated during stair walking, which is an activity that presents a biomechanical challenge for balance-impaired populations. We investigated three-dimensional whole-body angular momentum during stair ascent and descent and compared it to level walking. Three-dimensional body-segment kinematic and ground reaction force (GRF) data were collected from 30 healthy subjects. Angular momentum was calculated using a 13-segment whole-body model. GRFs, external moment arms and net joint moments were used to interpret the angular momentum results. The range of frontal plane angular momentum was greater for stair ascent relative to level walking. In the transverse and sagittal planes, the range of angular momentum was smaller in stair ascent and descent relative to level walking. Significant differences were also found in the ground reaction forces, external moment arms and net joint moments. The sagittal plane angular momentum results suggest that individuals alter angular momentum to effectively counteract potential trips during stair ascent, and reduce the range of angular momentum to avoid falling forward during stair descent. Further, significant differences in joint moments suggest potential neuromuscular mechanisms that account for the differences in angular momentum between walking conditions. These results provide a baseline for comparison to impaired populations that have difficulty maintaining dynamic balance, particularly during stair ascent and descent. Copyright © 2014 Elsevier B.V. All rights reserved.

A projection gradient method for computing ground state of spin-2 Bose–Einstein condensates

Energy Technology Data Exchange (ETDEWEB)

Wang, Hanquan, E-mail: hanquan.wang@gmail.com [School of Statistics and Mathematics, Yunnan University of Finance and Economics, Kunming, Yunnan Province, 650221 (China); Yunnan Tongchang Scientific Computing and Data Mining Research Center, Kunming, Yunnan Province, 650221 (China)

2014-10-01

In this paper, a projection gradient method is presented for computing ground state of spin-2 Bose–Einstein condensates (BEC). We first propose the general projection gradient method for solving energy functional minimization problem under multiple constraints, in which the energy functional takes real functions as independent variables. We next extend the method to solve a similar problem, where the energy functional now takes complex functions as independent variables. We finally employ the method into finding the ground state of spin-2 BEC. The key of our method is: by constructing continuous gradient flows (CGFs), the ground state of spin-2 BEC can be computed as the steady state solution of such CGFs. We discretized the CGFs by a conservative finite difference method along with a proper way to deal with the nonlinear terms. We show that the numerical discretization is normalization and magnetization conservative and energy diminishing. Numerical results of the ground state and their energy of spin-2 BEC are reported to demonstrate the effectiveness of the numerical method.

A projection gradient method for computing ground state of spin-2 Bose–Einstein condensates

International Nuclear Information System (INIS)

Wang, Hanquan

2014-01-01

In this paper, a projection gradient method is presented for computing ground state of spin-2 Bose–Einstein condensates (BEC). We first propose the general projection gradient method for solving energy functional minimization problem under multiple constraints, in which the energy functional takes real functions as independent variables. We next extend the method to solve a similar problem, where the energy functional now takes complex functions as independent variables. We finally employ the method into finding the ground state of spin-2 BEC. The key of our method is: by constructing continuous gradient flows (CGFs), the ground state of spin-2 BEC can be computed as the steady state solution of such CGFs. We discretized the CGFs by a conservative finite difference method along with a proper way to deal with the nonlinear terms. We show that the numerical discretization is normalization and magnetization conservative and energy diminishing. Numerical results of the ground state and their energy of spin-2 BEC are reported to demonstrate the effectiveness of the numerical method

Descent construction for GSpin groups

CERN Document Server

Hundley, Joseph

2016-01-01

In this paper the authors provide an extension of the theory of descent of Ginzburg-Rallis-Soudry to the context of essentially self-dual representations, that is, representations which are isomorphic to the twist of their own contragredient by some Hecke character. The authors' theory supplements the recent work of Asgari-Shahidi on the functorial lift from (split and quasisplit forms of) GSpin_{2n} to GL_{2n}.

Accelerated gradient methods for total-variation-based CT image reconstruction

DEFF Research Database (Denmark)

Jørgensen, Jakob Heide; Jensen, Tobias Lindstrøm; Hansen, Per Christian

2011-01-01

incorporates several heuristics from the optimization literature such as Barzilai-Borwein (BB) step size selection and nonmonotone line search. The latter uses a cleverly chosen sequence of auxiliary points to achieve a better convergence rate. The methods are memory efficient and equipped with a stopping...... reconstruction can in principle be found by any optimization method, but in practice the large scale of the systems arising in CT image reconstruction preclude the use of memory-demanding methods such as Newton’s method. The simple gradient method has much lower memory requirements, but exhibits slow convergence...

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

International Nuclear Information System (INIS)

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

1995-01-01

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

Assessing the ability to derive rates of polar middle-atmospheric descent using trace gas measurements from remote sensors

Science.gov (United States)

Ryan, Niall J.; Kinnison, Douglas E.; Garcia, Rolando R.; Hoffmann, Christoph G.; Palm, Mathias; Raffalski, Uwe; Notholt, Justus

2018-02-01

We investigate the reliability of using trace gas measurements from remote sensing instruments to infer polar atmospheric descent rates during winter within 46-86 km altitude. Using output from the Specified Dynamics Whole Atmosphere Community Climate Model (SD-WACCM) between 2008 and 2014, tendencies of carbon monoxide (CO) volume mixing ratios (VMRs) are used to assess a common assumption of dominant vertical advection of tracers during polar winter. The results show that dynamical processes other than vertical advection are not negligible, meaning that the transport rates derived from trace gas measurements do not represent the mean descent of the atmosphere. The relative importance of vertical advection is lessened, and exceeded by other processes, during periods directly before and after a sudden stratospheric warming, mainly due to an increase in eddy transport. It was also found that CO chemistry cannot be ignored in the mesosphere due to the night-time layer of OH at approximately 80 km altitude. CO VMR profiles from the Kiruna Microwave Radiometer and the Microwave Limb Sounder were compared to SD-WACCM output, and show good agreement on daily and seasonal timescales. SD-WACCM CO profiles are combined with the CO tendencies to estimate errors involved in calculating the mean descent of the atmosphere from remote sensing measurements. The results indicate errors on the same scale as the calculated descent rates, and that the method is prone to a misinterpretation of the direction of air motion. The true rate of atmospheric descent is seen to be masked by processes, other than vertical advection, that affect CO. We suggest an alternative definition of the rate calculated using remote sensing measurements: not as the mean descent of the atmosphere, but as an effective rate of vertical transport for the trace gas under observation.

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

NARCIS (Netherlands)

Verschoor, M.; Jalba, A.C.

2012-01-01

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

Convective descent simulations of drilling discharges on Georges and Sable Island banks

International Nuclear Information System (INIS)

Andrade, Y.; Loder, J.W.

1997-01-01

Factors affecting the fate of drilling mud discharges on Georges and Sable Island Banks were examined. The Koh and Chang jet discharge model was used to simulate the convective descent of a jet discharge of relatively dense materials at sites representing different hydrographic and depth regimes with a range of mud densities, and different discharge configurations, ocean currents and seasonal stratifications. The study revealed the dependence of the depth of descent and properties of the discharge plume on the discharge configuration and oceanographic conditions. The factors that affected the depth of descent were mud density, depth of release, initial downward volume flux of the discharge, current strength and ocean stratification. 22 refs., 3 tabs., 59 figs

Deflation in preconditioned conjugate gradient methods for Finite Element Problems

NARCIS (Netherlands)

Vermolen, F.J.; Vuik, C.; Segal, A.

2002-01-01

We investigate the influence of the value of deflation vectors at interfaces on the rate of convergence of preconditioned conjugate gradient methods applied to a Finite Element discretization for an elliptic equation. Our set-up is a Poisson problem in two dimensions with continuous or discontinuous

Gradient Calculation Methods on Arbitrary Polyhedral Unstructured Meshes for Cell-Centered CFD Solvers

Science.gov (United States)

Sozer, Emre; Brehm, Christoph; Kiris, Cetin C.

2014-01-01

A survey of gradient reconstruction methods for cell-centered data on unstructured meshes is conducted within the scope of accuracy assessment. Formal order of accuracy, as well as error magnitudes for each of the studied methods, are evaluated on a complex mesh of various cell types through consecutive local scaling of an analytical test function. The tests highlighted several gradient operator choices that can consistently achieve 1st order accuracy regardless of cell type and shape. The tests further offered error comparisons for given cell types, leading to the observation that the "ideal" gradient operator choice is not universal. Practical implications of the results are explored via CFD solutions of a 2D inviscid standing vortex, portraying the discretization error properties. A relatively naive, yet largely unexplored, approach of local curvilinear stencil transformation exhibited surprisingly favorable properties

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

Science.gov (United States)

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

2015-09-01

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

A nonsmooth nonlinear conjugate gradient method for interactive contact force problems

DEFF Research Database (Denmark)

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

2010-01-01

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

HNO3 fluxes to a deciduous forest derived using gradient and REA methods

DEFF Research Database (Denmark)

Pryor, S.C.; Barthelmie, R.J.; Jensen, B.

2002-01-01

Summertime nitric acid concentrations over a deciduous forest in the midwestern United States are reported, which range between 0.36 and 3.3 mug m(-3). Fluxes to the forest are computed using the relaxed eddy accumulation technique and gradient methods. In accord with previous studies, the results...... indicate substantial uncertainties in the gradient-based calculations. The relaxed eddy accumulation (REA) derived fluxes are physically reasonable and are shown to be of similar magnitude to dry deposition estimates from gradient sampling. The REA derived mean deposition velocity is approximately 3 cm s......(-1), which is also comparable to growing season estimates derived by Meyers et al. for a similar deciduous forest. Occasional inverted concentration gradients and fluxes are observed but most are not statistically significant. Data are also presented that indicate substantial through canopy...

$L_{0}$ Gradient Projection.

Science.gov (United States)

Ono, Shunsuke

2017-04-01

Minimizing L 0 gradient, the number of the non-zero gradients of an image, together with a quadratic data-fidelity to an input image has been recognized as a powerful edge-preserving filtering method. However, the L 0 gradient minimization has an inherent difficulty: a user-given parameter controlling the degree of flatness does not have a physical meaning since the parameter just balances the relative importance of the L 0 gradient term to the quadratic data-fidelity term. As a result, the setting of the parameter is a troublesome work in the L 0 gradient minimization. To circumvent the difficulty, we propose a new edge-preserving filtering method with a novel use of the L 0 gradient. Our method is formulated as the minimization of the quadratic data-fidelity subject to the hard constraint that the L 0 gradient is less than a user-given parameter α . This strategy is much more intuitive than the L 0 gradient minimization because the parameter α has a clear meaning: the L 0 gradient value of the output image itself, so that one can directly impose a desired degree of flatness by α . We also provide an efficient algorithm based on the so-called alternating direction method of multipliers for computing an approximate solution of the nonconvex problem, where we decompose it into two subproblems and derive closed-form solutions to them. The advantages of our method are demonstrated through extensive experiments.

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

International Nuclear Information System (INIS)

Al-Bayati, A.

2001-01-01

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

Immediate effects of a distal gait modification during stair descent in individuals with patellofemoral pain.

Science.gov (United States)

Aliberti, Sandra; Mezêncio, Bruno; Amadio, Alberto Carlos; Serrão, Julio Cerca; Mochizuki, Luis

2018-05-23

Knee pain during stair managing is a common complaint among individuals with PFP and can negatively affect their activities of daily living. Gait modification programs can be used to decrease patellofemoral pain. Immediate effects of a stair descent distal gait modification session that intended to emphasize forefoot landing during stair descent are described in this study. To analyze the immediate effects of a distal gait modification session on lower extremity movements and intensity of pain in women with patellofemoral pain during stair descent. Nonrandomized controlled trial. Sixteen women with patellofemoral pain were allocated into two groups: (1) Gait Modification Group (n = 8); and 2) Control Group (n = 8). The intensity of pain (visual analog scale) and kinematics of knee, ankle, and forefoot (multi-segmental foot model) during stair descent were assessed before and after the intervention. After the gait modification session, there was an increase of forefoot eversion and ankle plantarflexion as well as a decrease of knee flexion. An immediate decrease in patellofemoral pain intensity during stair descent was also observed. The distal gait modification session changed the lower extremity kinetic chain strategy of movement, increasing foot and ankle movement contribution and decreasing knee contribution to the task. An immediate decrease in patellofemoral pain intensity during stair descent was also observed. To emphasize forefoot landing may be a useful intervention to immediately relieve pain in patients with patellofemoral pain during stair descent. Clinical studies are needed to verify the gait modification session effects in medium and long terms.

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

Science.gov (United States)

Feng, Dexiang; Sun, Min; Wang, Xueyong

2017-01-01

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

Ascent, descent, nullity, defect, and related notions for linear relations in linear spaces

NARCIS (Netherlands)

Sandovici, Adrian; de Snoo, Henk; Winkler, Henrik

2007-01-01

For a linear relation in a linear space the concepts of ascent, descent, nullity, and defect are introduced and studied. It is shown that the results of A.E. Taylor and M.A. Kaashoek concerning the relationship between ascent, descent, nullity, and defect for the case of linear operators remain

Preconditioned steepest descent methods for some nonlinear elliptic equations involving p-Laplacian terms

Energy Technology Data Exchange (ETDEWEB)

Feng, Wenqiang, E-mail: wfeng1@vols.utk.edu [Department of Mathematics, The University of Tennessee, Knoxville, TN 37996 (United States); Salgado, Abner J., E-mail: asalgad1@utk.edu [Department of Mathematics, The University of Tennessee, Knoxville, TN 37996 (United States); Wang, Cheng, E-mail: cwang1@umassd.edu [Department of Mathematics, The University of Massachusetts, North Dartmouth, MA 02747 (United States); Wise, Steven M., E-mail: swise1@utk.edu [Department of Mathematics, The University of Tennessee, Knoxville, TN 37996 (United States)

2017-04-01

We describe and analyze preconditioned steepest descent (PSD) solvers for fourth and sixth-order nonlinear elliptic equations that include p-Laplacian terms on periodic domains in 2 and 3 dimensions. The highest and lowest order terms of the equations are constant-coefficient, positive linear operators, which suggests a natural preconditioning strategy. Such nonlinear elliptic equations often arise from time discretization of parabolic equations that model various biological and physical phenomena, in particular, liquid crystals, thin film epitaxial growth and phase transformations. The analyses of the schemes involve the characterization of the strictly convex energies associated with the equations. We first give a general framework for PSD in Hilbert spaces. Based on certain reasonable assumptions of the linear pre-conditioner, a geometric convergence rate is shown for the nonlinear PSD iteration. We then apply the general theory to the fourth and sixth-order problems of interest, making use of Sobolev embedding and regularity results to confirm the appropriateness of our pre-conditioners for the regularized p-Lapacian problems. Our results include a sharper theoretical convergence result for p-Laplacian systems compared to what may be found in existing works. We demonstrate rigorously how to apply the theory in the finite dimensional setting using finite difference discretization methods. Numerical simulations for some important physical application problems – including thin film epitaxy with slope selection and the square phase field crystal model – are carried out to verify the efficiency of the scheme.

Testicular descent: INSL3, testosterone, genes and the intrauterine milieu.

Science.gov (United States)

Bay, Katrine; Main, Katharina M; Toppari, Jorma; Skakkebæk, Niels E

2011-04-01

Complete testicular descent is a sign of, and a prerequisite for, normal testicular function in adult life. The process of testis descent is dependent on gubernacular growth and reorganization, which is regulated by the Leydig cell hormones insulin-like peptide 3 (INSL3) and testosterone. Investigation of the role of INSL3 and its receptor, relaxin-family peptide receptor 2 (RXFP2), has contributed substantially to our understanding of the hormonal control of testicular descent. Cryptorchidism is a common congenital malformation, which is seen in 2-9% of newborn boys, and confers an increased risk of infertility and testicular cancer in adulthood. Although some cases of isolated cryptorchidism in humans can be ascribed to known genetic defects, such as mutations in INSL3 or RXFP2, the cause of cryptorchidism remains unknown in most patients. Several animal and human studies are currently underway to test the hypothesis that in utero factors, including environmental and maternal lifestyle factors, may be involved in the etiology of cryptorchidism. Overall, the etiology of isolated cryptorchidism seems to be complex and multifactorial, involving both genetic and nongenetic components.

Attitudes towards and perceptions about contraceptive use among married refugee women of Somali descent living in Finland.

Science.gov (United States)

Degni, F; Koivusilta, L; Ojanlatva, A

2006-09-01

To assess attitudes towards and perceptions about contraceptive use among married refugee women of Somali descent living in Finland. A sample of 100 married refugee women of Somali descent (18-50 years of age) were invited to participate in a study on contraceptive use in Finland (30 women refused). Qualitative and quantitative methods were used to collect the data. Questionnaire of the first data set was written in the Somali language. Interviews were conducted in the Somali language. The attitudes and opinions of these women towards contraceptive use (73% did not use contraceptives, 27% did use them) were connected with religious beliefs and issues involving marital relations. Religious or gender issues did not seem to influence those who used contraception. The findings indicated that the majority of the married refugee women of Somali descent living in Finland did not use contraception. The process of starting the use of contraception was possible because of an access to good reproductive health care and family planning services, changes in life situations, and adaptations to Finnish social and cultural norms.

Impact of race on the professional lives of physicians of African descent.

Science.gov (United States)

Nunez-Smith, Marcella; Curry, Leslie A; Bigby, JudyAnn; Berg, David; Krumholz, Harlan M; Bradley, Elizabeth H

2007-01-02

Increasing the racial and ethnic diversity of the physician workforce is a national priority. However, insight into the professional experiences of minority physicians is limited. This knowledge is fundamental to developing effective strategies to recruit, retain, and support a diverse physician workforce. To characterize how physicians of African descent experience race in the workplace. Qualitative study based on in-person and in-depth racially concordant interviews using a standard discussion guide. The 6 New England states in the United States. 25 practicing physicians of African descent representing a diverse range of primary practice settings, specialties, and ages. Professional experiences of physicians of African descent. 1) Awareness of race permeates the experience of physicians of African descent in the health care workplace; 2) race-related experiences shape interpersonal interactions and define the institutional climate; 3) responses to perceived racism at work vary along a spectrum from minimization to confrontation; 4) the health care workplace is often silent on issues of race; and 5) collective race-related experiences can result in "racial fatigue," with personal and professional consequences for physicians. The study was restricted to New England and may not reflect the experiences of physicians in other geographic regions. The findings are meant to be hypothesis-generating and require additional follow-up studies. The issue of race remains a pervasive influence in the work lives of physicians of African descent. Without sufficient attention to the specific ways in which race shapes physicians' work experiences, health care organizations are unlikely to create environments that successfully foster and sustain a diverse physician workforce.

Counseling and Psychotherapy with Clients of Middle Eastern Descent: A Qualitative Inquiry

OpenAIRE

Boghosian, Sara

2011-01-01

It is becoming increasingly important for clinical and counseling psychologists to have multicultural competence skills for treating an increasingly diverse client population. The psychology literature related to culturally competent treatment with persons of Middle Eastern descent is currently limited. In this study, qualitative methodology was utilized to explore the mental health attitudes and psychotherapy experiences of clients of Middle Eastern descent. Participants described culturally...

Research on n-γ discrimination method based on spectrum gradient analysis of signals

International Nuclear Information System (INIS)

Luo Xiaoliang; Liu Guofu; Yang Jun; Wang Yueke

2013-01-01

Having discovered that there are distinct differences between the spectrum gradient of the output neutron and γ-ray signal from liquid scintillator detectors, this paper presented a n-γ discrimination method called spectrum gradient analysis (SGA) based on frequency-domain features of the pulse signals. The basic principle and feasibility of SGA method were discussed and the validity of n-γ discrimination results of SGA was verified by the associated particle neutron flight experiment. The discrimination performance of SGA was evaluated under different conditions of sampling rates ranging from 5 G/s to 250 M/s. The results show that SGA method exhibits insensitivity to noise, strong anti-interference ability, stable discrimination performance and lower amount of calculation in contrast with time-domain n-γ discrimination methods. (authors)

Entry, Descent and Landing Systems Analysis Study: Phase 1 Report

Science.gov (United States)

DwyerCianciolo, Alicia M.; Davis, Jody L.; Komar, David R.; Munk, Michelle M.; Samareh, Jamshid A.; Powell, Richard W.; Shidner, Jeremy D.; Stanley, Douglas O.; Wilhite, Alan W.; Kinney, David J.;

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

Directory of Open Access Journals (Sweden)

Dexiang Feng

2017-09-01

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

Pilling evaluation of patterned fabrics based on a gradient field method

Czech Academy of Sciences Publication Activity Database

Techniková, L.; Tunák, M.; Janáček, Jiří

2016-01-01

Roč. 41, č. 1 (2016), s. 97-101 ISSN 0971-0426 Institutional support: RVO:67985823 Keywords : 3D surface reconstruction * fabric pilling * gradient field method * patterned fabric * pills detection Subject RIV: JS - Reliability ; Quality Management, Testing Impact factor: 0.430, year: 2016

Global Patterns of Prostate Cancer Incidence, Aggressiveness, and Mortality in Men of African Descent

Directory of Open Access Journals (Sweden)

Timothy R. Rebbeck

2013-01-01

Full Text Available Prostate cancer (CaP is the leading cancer among men of African descent in the USA, Caribbean, and Sub-Saharan Africa (SSA. The estimated number of CaP deaths in SSA during 2008 was more than five times that among African Americans and is expected to double in Africa by 2030. We summarize publicly available CaP data and collected data from the men of African descent and Carcinoma of the Prostate (MADCaP Consortium and the African Caribbean Cancer Consortium (AC3 to evaluate CaP incidence and mortality in men of African descent worldwide. CaP incidence and mortality are highest in men of African descent in the USA and the Caribbean. Tumor stage and grade were highest in SSA. We report a higher proportion of T1 stage prostate tumors in countries with greater percent gross domestic product spent on health care and physicians per 100,000 persons. We also observed that regions with a higher proportion of advanced tumors reported lower mortality rates. This finding suggests that CaP is underdiagnosed and/or underreported in SSA men. Nonetheless, CaP incidence and mortality represent a significant public health problem in men of African descent around the world.

And still, a new beginning: the Galerkin least-squares gradient method

International Nuclear Information System (INIS)

Franca, L.P.; Carmo, E.G.D. do

1988-08-01

A finite element method is proposed to solve a scalar singular diffusion problem. The method is constructed by adding to the standard Galerkin a mesh-dependent term obtained by taking the gradient of the Euler-lagrange equation and multiplying it by its least-squares. For the one-dimensional homogeneous problem the method is designed to develop nodal exact solution. An error estimate shows that the method converges optimaly for any value of the singular parameter. Numerical results demonstrate the good stability and accuracy properties of the method. (author) [pt

Corrugated thimble tube for controlling control rod descent in nuclear reactor

International Nuclear Information System (INIS)

Luetzow, H.J.

1981-01-01

A thimble tube construction is described which will provide a controlled descent for a control rod while minimizing the reaction forces which must be absorbed by the thimble tube and reducing the possibility that a foreign particle could interfere with the free descent of a control rod. A thimble tube is formed with helically-corrugate internal walls which cooperate with a control rod contained in the tube in an emergency situation to provide a progressively-increasing hydraulic restraining force as each adjacent corrugation is encountered

Monomers and polymers in a centrifugal field : a new method to produce refractive-index gradients in polymers

NARCIS (Netherlands)

Duijnhoven, van F.G.H.; Bastiaansen, C.W.M.

1999-01-01

A new method is presented to generate and to fixate compositional gradients in blends of two miscible and amorphous polymers. A compositional gradient is introduced into a solution of a polymer in a monomer by use of a centrifugal field, and this gradient is subsequently fixated by polymerization of

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

Science.gov (United States)

Feng, Shuo; Ji, Jim

2014-04-01

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

The glucokinase mutation p.T206P is common among MODY patients of Jewish Ashkenazi descent.

Science.gov (United States)

Gozlan, Yael; Tenenbaum, Ariel; Shalitin, Shlomit; Lebenthal, Yael; Oron, Tal; Cohen, Ohad; Phillip, Moshe; Gat-Yablonski, Galia

2012-09-01

Maturity-onset diabetes of the young (MODY) is characterized by an autosomal dominant mode of inheritance; a primary defect in insulin secretion with non-ketotic hyperglycemia, age of onset under 25 yr; and lack of autoantibodies. Heterozygous mutations in glucokinase (GCK) are associated with mild fasting hyperglycemia and gestational diabetes mellitus while homozygous or compound heterozygous GCK mutations result in permanent neonatal diabetes mellitus. Given that both the Israeli-Arabic and the various Israeli-Jewish communities tend to maintain ethnic seclusion, we speculated that it would be possible to identify a relatively narrow spectrum of mutations in the Israeli population. To characterize the genetic basis of GCK-MODY in the different ethnic groups of the Israeli population. Patients with clinically identified GCK-MODY and their first degree family members. Molecular analysis of GCK was performed on genomic DNA using polymerase chain reaction, denaturing gradient gel electrophoresis (DGGE), and sequencing. Bioinformatic model was preformed using the NEST program. Mutations in GCK were identified in 25 families and were all family-specific, except c.616A>C. p.T206P. This mutation was identified in six unrelated families, all patients from a Jewish-Ashkenazi descent, thus indicating an ethno-genetic correlation. A simple, fast, and relatively cheap DGGE/restriction-digestion assay was developed. The high incidence of the mutant allele in GCK-MODY patients of Jewish-Ashkenazi descent suggests a founder effect. We propose that clinically identified GCK-MODY patients of Jewish-Ashkenazi origin be first tested for this mutation. © 2011 John Wiley & Sons A/S.

Asynchronous Gossip-Based Gradient-Free Method for Multiagent Optimization

OpenAIRE

Deming Yuan

2014-01-01

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

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

Science.gov (United States)

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.

Management and Nonlinear Analysis of Disinfection System of Water Distribution Networks Using Data Driven Methods

Directory of Open Access Journals (Sweden)

Mohammad Zounemat-Kermani

2018-03-01

Full Text Available Chlorination unit is widely used to supply safe drinking water and removal of pathogens from water distribution networks. Data-driven approach is one appropriate method for analyzing performance of chlorine in water supply network. In this study, multi-layer perceptron neural network (MLP with three training algorithms (gradient descent, conjugate gradient and BFGS and support vector machine (SVM with RBF kernel function were used to predict the concentration of residual chlorine in water supply networks of Ahmadabad Dafeh and Ahruiyeh villages in Kerman Province. Daily data including discharge (flow, chlorine consumption and residual chlorine were employed from the beginning of 1391 Hijri until the end of 1393 Hijri (for 3 years. To assess the performance of studied models, the criteria such as Nash-Sutcliffe efficiency (NS, root mean square error (RMSE, mean absolute percentage error (MAPE and correlation coefficient (CORR were used that in best modeling situation were 0.9484, 0.0255, 1.081, and 0.974 respectively which resulted from BFGS algorithm. The criteria indicated that MLP model with BFGS and conjugate gradient algorithms were better than all other models in 90 and 10 percent of cases respectively; while the MLP model based on gradient descent algorithm and the SVM model were better in none of the cases. According to the results of this study, proper management of chlorine concentration can be implemented by predicted values of residual chlorine in water supply network. Thus, decreased performance of perceptron network and support vector machine in water supply network of Ahruiyeh in comparison to Ahmadabad Dafeh can be inferred from improper management of chlorination.

The grand descent has begun for CMS

CERN Multimedia

2006-01-01

Until recently, the CMS experimental cavern looked relatively empty; its detector was assembled entirely at ground level, to be lowered underground in 15 sections. On 2 November, the first hadronic forward calorimeter led the way with a grand descent. The first section of the CMS detector (centre of photo) arriving from the vertical shaft, viewed from the cavern floor. There is something unusual about the construction of the CMS detector. Instead of being built in the experimental cavern, like all the other detectors in the LHC experiments, it was constructed at ground level. This was to allow for easy access during the assembly of the detector and to minimise the size of the excavated cavern. The slightly nerve-wracking task of lowering it safely into the cavern in separate sections came after the complete detector was successfully tested with a magnetic field at ground level. In the early morning of 2 November, the first section of the CMS detector began its eagerly awaited descent into the underground ca...

Ethnic Identity and Acculturative Stress as Mediators of Depression in Students of Asian Descent

Science.gov (United States)

Lantrip, Crystal; Mazzetti, Francesco; Grasso, Joseph; Gill, Sara; Miller, Janna; Haner, Morgynn; Rude, Stephanie; Awad, Germine

2015-01-01

This study underscored the importance of addressing the well-being of college students of Asian descent, because these students had higher rates of depression and lower positive feelings about their ethnic group compared with students of European descent, as measured by the Affirmation subscale of the Ethnic Identity Scale. Affirmation mediated…

Exploiting Elementary Landscapes for TSP, Vehicle Routing and Scheduling

Science.gov (United States)

2015-09-03

similar mathematical foundation to enable gradient descent methods for discrete combinatorial optimization problems. We are also generalizing our prior...research has exploited statistical and mathematical properties of elementary landscapes to develop new gradient methods for combinatorial optimization... mathematically methods to more automatically identify elementary landscapes. If a combinatorial optimization problem is a superposition of elemen

Cardiovascular disease, diabetes and established risk factors among populations of sub-Saharan African descent in Europe: a literature review

Directory of Open Access Journals (Sweden)

de Graft Aikins Ama

2009-08-01

Full Text Available Abstract Background Most European countries are ethnically and culturally diverse. Globally, cardiovascular disease (CVD is the leading cause of death. The major risk factors for CVD have been well established. This picture holds true for all regions of the world and in different ethnic groups. However, the prevalence of CVD and related risk factors vary among ethnic groups. Methods This article provides a review of current understanding of the epidemiology of vascular disease, principally coronary heart disease (CHD, stroke and related risk factors among populations of Sub-Sahara African descent (henceforth, African descent in comparison with the European populations in Europe. Results Compared with European populations, populations of African descent have an increased risk of stroke, whereas CHD is less common. They also have higher rates of hypertension and diabetes than European populations. Obesity is highly prevalent, but smoking rate is lower among African descent women. Older people of African descent have more favourable lipid profile and dietary habits than their European counterparts. Alcohol consumption is less common among populations of African descent. The rate of physical activity differs between European countries. Dutch African-Suriname men and women are less physically active than the White-Dutch whereas British African women are more physically active than women in the general population. Literature on psychosocial stress shows inconsistent results. Conclusion Hypertension and diabetes are highly prevalent among African populations, which may explain their high rate of stroke in Europe. The relatively low rate of CHD may be explained by the low rates of other risk factors including a more favourable lipid profile and the low prevalence of smoking. The risk factors are changing, and on the whole, getting worse especially among African women. Cohort studies and clinical trials are therefore needed among these groups to

A Projected Non-linear Conjugate Gradient Method for Interactive Inverse Kinematics

DEFF Research Database (Denmark)

Engell-Nørregård, Morten; Erleben, Kenny

2009-01-01

Inverse kinematics is the problem of posing an articulated figure to obtain a wanted goal, without regarding inertia and forces. Joint limits are modeled as bounds on individual degrees of freedom, leading to a box-constrained optimization problem. We present A projected Non-linear Conjugate...... Gradient optimization method suitable for box-constrained optimization problems for inverse kinematics. We show application on inverse kinematics positioning of a human figure. Performance is measured and compared to a traditional Jacobian Transpose method. Visual quality of the developed method...

Strong source heat transfer simulations based on a GalerKin/Gradient - least - squares method

International Nuclear Information System (INIS)

Franca, L.P.; Carmo, E.G.D. do.

1989-05-01

Heat conduction problems with temperature-dependent strong sources are modeled by an equation with a laplacian term, a linear term and a given source distribution term. When the linear-temperature-dependent source term is much larger than the laplacian term, we have a singular perturbation problem. In this case, boundary layers are formed to satisfy the Dirichlet boundary conditions. Although this is an elliptic equation, the standard Galerkin method solution is contaminated by spurious oscillations in the neighborhood of the boundary layers. Herein we employ a Galerkin/Gradient-least-squares method which eliminates all pathological phenomena of the Galerkin method. The method is constructed by adding to the Galerkin method a mesh-dependent term obtained by the least-squares form of the gradient of the Euler-Lagrange equation. Error estimates, numerical simulations in one-and multi-dimensions are given that attest the good stability and accuracy properties of the method [pt

Gadolinium burnable absorber optimization by the method of conjugate gradients

International Nuclear Information System (INIS)

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

1987-01-01

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

Lateral Temperature-Gradient Method for High-Throughput Characterization of Material Processing by Millisecond Laser Annealing.

Science.gov (United States)

Bell, Robert T; Jacobs, Alan G; Sorg, Victoria C; Jung, Byungki; Hill, Megan O; Treml, Benjamin E; Thompson, Michael O

2016-09-12

A high-throughput method for characterizing the temperature dependence of material properties following microsecond to millisecond thermal annealing, exploiting the temperature gradients created by a lateral gradient laser spike anneal (lgLSA), is presented. Laser scans generate spatial thermal gradients of up to 5 °C/μm with peak temperatures ranging from ambient to in excess of 1400 °C, limited only by laser power and materials thermal limits. Discrete spatial property measurements across the temperature gradient are then equivalent to independent measurements after varying temperature anneals. Accurate temperature calibrations, essential to quantitative analysis, are critical and methods for both peak temperature and spatial/temporal temperature profile characterization are presented. These include absolute temperature calibrations based on melting and thermal decomposition, and time-resolved profiles measured using platinum thermistors. A variety of spatially resolved measurement probes, ranging from point-like continuous profiling to large area sampling, are discussed. Examples from annealing of III-V semiconductors, CdSe quantum dots, low-κ dielectrics, and block copolymers are included to demonstrate the flexibility, high throughput, and precision of this technique.

A Gradient Weighted Moving Finite-Element Method with Polynomial Approximation of Any Degree

Directory of Open Access Journals (Sweden)

Ali R. Soheili

2009-01-01

Full Text Available A gradient weighted moving finite element method (GWMFE based on piecewise polynomial of any degree is developed to solve time-dependent problems in two space dimensions. Numerical experiments are employed to test the accuracy and effciency of the proposed method with nonlinear Burger equation.

Total variation superiorized conjugate gradient method for image reconstruction

Science.gov (United States)

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

2018-03-01

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

Three-dimensional sparse electromagnetic imaging accelerated by projected steepest descent

KAUST Repository

Desmal, Abdulla

2016-11-02

An efficient and accurate scheme for solving the nonlinear electromagnetic inverse scattering problem on three-dimensional sparse investigation domains is proposed. The minimization problem is constructed in such a way that the data misfit between measurements and scattered fields (which are expressed as a nonlinear function of the contrast) is constrained by the contrast\\'s first norm. The resulting minimization problem is solved using nonlinear Landweber iterations accelerated using a steepest descent algorithm. A projection operator is applied at every iteration to enforce the sparsity constraint by thresholding the result of that iteration. Steepest descent algorithm ensures accelerated and convergent solution by utilizing larger iteration steps selected based on a necessary B-condition.

Energy minimization in medical image analysis: Methodologies and applications.

Science.gov (United States)

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.

Improvement of GaN epilayer by gradient layer method with molecular-beam epitaxy

International Nuclear Information System (INIS)

Chen, Yen-Liang; Lo, Ikai; Gau, Ming-Hong; Hsieh, Chia-Ho; Sham, Meng-Wei; Pang, Wen-Yuan; Hsu, Yu-Chi; Tsai, Jenn-Kai; Schuber, Ralf; Schaadt, Daniel

2012-01-01

We demonstrated a molecular beam epitaxy method to resolve the dilemma between structural and morphological quality in growth of the GaN epilayer. A gradient buffer layer was grown in such a way that the N/Ga ratio was gradually changed from nitrogen-rich to gallium-rich. The GaN epitaxial layer was then grown on the gradient buffer layer. In the X-ray diffraction analysis of GaN(002) rocking curves, we found that the full width at half-maximum was improved from 531.69″ to 59.43″ for the sample with a gradient buffer layer as compared to a purely gallium-rich grown sample. Atomic force microscopy analysis showed that the root-mean-square roughness of the surface was improved from 18.28 nm to 1.62 nm over an area of 5 × 5 μm 2 with respect to a purely nitrogen-rich grown sample. Raman scattering showed the presence of a slightly tilted plane in the gradient layer. Furthermore we showed that the gradient layer can also slash the strain force caused by either Ga-rich GaN epitaxial layer or AlN buffer layer. - Highlights: ► The samples were grown by plasma-assisted molecular beam epitaxy. ► The GaN epilayer was grown on sapphire substrate. ► The samples were characterized by X-ray diffraction and atomic force microscopy. ► The sample quality was improved by gradient buffer layer.

A new characterization method of the microstructure by utilizing the macroscopic composition gradient in alloys

International Nuclear Information System (INIS)

Miyazaki, T.; Koyama, T.; Kobayashi, S.

1996-01-01

A new experimental method to determine the phase boundary and phase equilibrium is accomplished by - means of analytical transmission electron microscopy for alloys with a macroscopic composition gradient. The various phase boundaries, i.e. the coherent binodal and spinodal lines, incoherent binodal line and order/disorder transformation line are distinctly determined for the Cu-Ti alloy and the other alloy systems. Furthermore, the equilibrium compositions at the interface of precipitate/matrix can experimentally be obtained for various particle sizes, and thus the Gibbs-Thomson's relation is verified. It is expected that the composition gradient method proposed in the present will become an important experimental method of the microstructural characterization

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

Science.gov (United States)

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

2017-10-01

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

Analytical free energy gradient for the molecular Ornstein-Zernike self-consistent-field method

Directory of Open Access Journals (Sweden)

N.Yoshida

2007-09-01

Full Text Available An analytical free energy gradient for the molecular Ornstein-Zernike self-consistent-field (MOZ-SCF method is presented. MOZ-SCF theory is one of the theories to considering the solvent effects on the solute electronic structure in solution. [Yoshida N. et al., J. Chem. Phys., 2000, 113, 4974] Molecular geometries of water, formaldehyde, acetonitrile and acetone in water are optimized by analytical energy gradient formula. The results are compared with those from the polarizable continuum model (PCM, the reference interaction site model (RISM-SCF and the three dimensional (3D RISM-SCF.

Descent in buildings (AM-190)

CERN Document Server

Mühlherr, Bernhard; Weiss, Richard M

2015-01-01

Descent in Buildings begins with the resolution of a major open question about the local structure of Bruhat-Tits buildings. The authors then put their algebraic solution into a geometric context by developing a general fixed point theory for groups acting on buildings of arbitrary type, giving necessary and sufficient conditions for the residues fixed by a group to form a kind of subbuilding or "form" of the original building. At the center of this theory is the notion of a Tits index, a combinatorial version of the notion of an index in the relative theory of algebraic groups. These results

Optimized computational imaging methods for small-target sensing in lens-free holographic microscopy

Science.gov (United States)

Xiong, Zhen; Engle, Isaiah; Garan, Jacob; Melzer, Jeffrey E.; McLeod, Euan

2018-02-01

Lens-free holographic microscopy is a promising diagnostic approach because it is cost-effective, compact, and suitable for point-of-care applications, while providing high resolution together with an ultra-large field-of-view. It has been applied to biomedical sensing, where larger targets like eukaryotic cells, bacteria, or viruses can be directly imaged without labels, and smaller targets like proteins or DNA strands can be detected via scattering labels like micro- or nano-spheres. Automated image processing routines can count objects and infer target concentrations. In these sensing applications, sensitivity and specificity are critically affected by image resolution and signal-to-noise ratio (SNR). Pixel super-resolution approaches have been shown to boost resolution and SNR by synthesizing a high-resolution image from multiple, partially redundant, low-resolution images. However, there are several computational methods that can be used to synthesize the high-resolution image, and previously, it has been unclear which methods work best for the particular case of small-particle sensing. Here, we quantify the SNR achieved in small-particle sensing using regularized gradient-descent optimization method, where the regularization is based on cardinal-neighbor differences, Bayer-pattern noise reduction, or sparsity in the image. In particular, we find that gradient-descent with sparsity-based regularization works best for small-particle sensing. These computational approaches were evaluated on images acquired using a lens-free microscope that we assembled from an off-the-shelf LED array and color image sensor. Compared to other lens-free imaging systems, our hardware integration, calibration, and sample preparation are particularly simple. We believe our results will help to enable the best performance in lens-free holographic sensing.

Gradient waveform synthesis for magnetic propulsion using MRI gradient coils

International Nuclear Information System (INIS)

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

2008-01-01

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

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

Science.gov (United States)

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

2017-01-10

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

RITD - Adapting Mars Entry, Descent and Landing System for Earth

Science.gov (United States)

Haukka, H.; Heilimo, J.; Harri, A.-M.; Aleksashkin, S.; Koryanov, V.; Arruego, I.; Schmidt, W.; Finchenko, V.; Martynov, M.; Ponomarenko, A.; Kazakovtsev, V.; Martin, S.

2015-10-01

We have developed an atmospheric re-entry and descent system concept based on inflatable hypersonic decelerator techniques that were originally developed for Mars. The ultimate goal of this EU-funded RITD-project (Re-entry: Inflatable Technology Development) was to assess the benefits of this technology when deploying small payloads from low Earth orbits to the surface of the Earth with modest costs. The principal goal was to assess and develop a preliminary EDLS design for the entire relevant range of aerodynamic regimes expected to be encountered in Earth's atmosphere during entry, descent and landing. Low Earth Orbit (LEO) and even Lunar applications envisaged include the use of the EDLS approach in returning payloads of 4-8 kg down to the surface.

Reversible cerebral vasoconstriction syndrome precipitated by airplane descent: Case report.

Science.gov (United States)

Hiraga, Akiyuki; Aotsuka, Yuya; Koide, Kyosuke; Kuwabara, Satoshi

2017-10-01

Background Reversible cerebral vasoconstriction syndrome (RCVS) is characterized by segmental vasospasm. Vasoactive agents and childbirth have been reported as precipitating factors for RCVS; however, RCVS induced by altitude change or air travel has rarely been reported. Case We present a case of a 74-year-old woman who presented with thunderclap headache during airplane descent. Magnetic resonance angiography demonstrated segmental vasoconstriction that improved 9 days after onset. Conclusion These findings indicate that airplane descent may be a trigger of RCVS. The time course of headache in the present case was similar to that of prolonged headache attributed to airplane travel, indicating that RCVS during air travel may have previously been overlooked and that some headache attributed to airplane travel cases may represent a milder form of RCVS.

Entry, Descent and Landing Systems Analysis: Exploration Class Simulation Overview and Results

Science.gov (United States)

DwyerCianciolo, Alicia M.; Davis, Jody L.; Shidner, Jeremy D.; Powell, Richard W.

2010-01-01

NASA senior management commissioned the Entry, Descent and Landing Systems Analysis (EDL-SA) Study in 2008 to identify and roadmap the Entry, Descent and Landing (EDL) technology investments that the agency needed to make in order to successfully land large payloads at Mars for both robotic and exploration or human-scale missions. The year one exploration class mission activity considered technologies capable of delivering a 40-mt payload. This paper provides an overview of the exploration class mission study, including technologies considered, models developed and initial simulation results from the EDL-SA year one effort.

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

Science.gov (United States)

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

2017-05-01

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

Improvement of GaN epilayer by gradient layer method with molecular-beam epitaxy

Energy Technology Data Exchange (ETDEWEB)

Chen, Yen-Liang [Department of Physics, Institute of Material Science and Engineering, Center for Nanoscience and Nanotechnology, National Sun Yat-Sen University, Kaohsiung 80424, Taiwan, ROC (China); Lo, Ikai, E-mail: ikailo@mail.phys.nsysu.edu.tw [Department of Physics, Institute of Material Science and Engineering, Center for Nanoscience and Nanotechnology, National Sun Yat-Sen University, Kaohsiung 80424, Taiwan, ROC (China); Gau, Ming-Hong; Hsieh, Chia-Ho; Sham, Meng-Wei; Pang, Wen-Yuan; Hsu, Yu-Chi [Department of Physics, Institute of Material Science and Engineering, Center for Nanoscience and Nanotechnology, National Sun Yat-Sen University, Kaohsiung 80424, Taiwan, ROC (China); Tsai, Jenn-Kai [Department of Electronics Engineering, National Formosa University, Hu-Wei, Yun-Lin County 63208, Taiwan, ROC (China); Schuber, Ralf; Schaadt, Daniel [Institute of Applied Physics/DFG-Center for Functional Nanostructures (CFN), Karlsruhe Institute of Technology (KIT), Karlsruhe (Germany)

2012-07-31

We demonstrated a molecular beam epitaxy method to resolve the dilemma between structural and morphological quality in growth of the GaN epilayer. A gradient buffer layer was grown in such a way that the N/Ga ratio was gradually changed from nitrogen-rich to gallium-rich. The GaN epitaxial layer was then grown on the gradient buffer layer. In the X-ray diffraction analysis of GaN(002) rocking curves, we found that the full width at half-maximum was improved from 531.69 Double-Prime to 59.43 Double-Prime for the sample with a gradient buffer layer as compared to a purely gallium-rich grown sample. Atomic force microscopy analysis showed that the root-mean-square roughness of the surface was improved from 18.28 nm to 1.62 nm over an area of 5 Multiplication-Sign 5 {mu}m{sup 2} with respect to a purely nitrogen-rich grown sample. Raman scattering showed the presence of a slightly tilted plane in the gradient layer. Furthermore we showed that the gradient layer can also slash the strain force caused by either Ga-rich GaN epitaxial layer or AlN buffer layer. - Highlights: Black-Right-Pointing-Pointer The samples were grown by plasma-assisted molecular beam epitaxy. Black-Right-Pointing-Pointer The GaN epilayer was grown on sapphire substrate. Black-Right-Pointing-Pointer The samples were characterized by X-ray diffraction and atomic force microscopy. Black-Right-Pointing-Pointer The sample quality was improved by gradient buffer layer.

Gender differences of sagittal knee and ankle biomechanics during stair-to-ground descent transition.

Science.gov (United States)

Hong, Yoon No Gregory; Shin, Choongsoo S

2015-12-01

Falls on stairs often result in severe injury and occur twice as frequently in women. However, gender differences in kinetics and kinematics during stair descent are unknown. Thus, this study aimed to determine whether gender differences of knee and ankle biomechanics exist in the sagittal plane during the stair-to-ground descending transition. It was hypothesized that 1) women would reveal higher ground-toe-trochanter angle and lower ground-toe length during stair-to-ground descent transition than men; and 2) women would reveal lower peak knee extension moment during stair-to-ground descent transition than men. Fifteen men and fifteen women were recruited and performed a stair descent activity. Kinetic and kinematic data were obtained using a force plate and motion capture system. The women performed the stair descent with a lower peak knee extension moment and a peak knee power at the early weight acceptance phase. The women also revealed a higher ground-toe-trochanter angle and a lower ground-toe length, which indicated a more forward position of the lower extremity relative to the toe contact point at both the initial contact and at the time of peak kinematic and kinetic events. This study found that knee and ankle kinematics and kinetics differed significantly between the genders due to differences in ground-toe-trochanter angle. Women have a different stair descending strategy that reduces the demand of the lower extremity muscle function, but this strategy seems to increase the risk of falls. Copyright © 2015 Elsevier Ltd. All rights reserved.

Applicability of Stokes method for measuring viscosity of mixtures with concentration gradient

Directory of Open Access Journals (Sweden)

César Medina

2017-12-01

Full Text Available After measuring density and viscosity of a mixture of glycerin and water contained in a vertical pipe, a variation of these properties according to depth is observed. These gradients are typical of non-equilibrium states related to the lower density of water and the fact that relatively long times are necessary to achieve homogeneity. In the same pipe, the falling velocity of five little spheres is measured as a function of depth, and then a numerical fit is performed which agrees very well with experimental data. Based on the generalization of these results, the applicability of Stokes method is discussed for measuring viscosity of mixtures with a concentration gradient.

Revisiting fracture gradient: Comments on “A new approaching method to estimate fracture gradient by correcting Matthew–Kelly and Eaton's stress ratio”

KAUST Repository

Hakiki, Farizal

2017-07-25

A study performed by Marbun et al. [1] claimed that “A new methodology to predict fracture pressure from former calculations, Matthew–Kelly and Eaton are proposed.” Also, Marbun et al.\\'s paper stated that “A new value of Poisson\\'s and a stress ratio of the formation were generated and the accuracy of fracture gradient was improved.” We found those all statements are incorrect and some misleading concepts are revealed. An attempt to expose the method of fracture gradient determination from industry practice also appears to solidify that our arguments are acceptable to against improper Marbun et al.\\'s claims.

Machado-Joseph Disease in Pedigrees of Azorean descent is Linked to Chromosome 14

OpenAIRE

George-Hyslop, P. St; Rogaeva, E.; Huterer, J.; Tsuda, T.; Santos, J.; Haines, J. L.; Schlumpf, K.; Rogaev, E. I.; Liang, Y.; McLachlan, D. R. Crapper; Kennedy, J.; Weissenbach, J.; Billingsley, G. D.; Cox, D. W.; Lang, A. E.

1994-01-01

A locus for Machado-Joseph disease (MJD) has recently been mapped to a 30-cM region of chromosome 14q in five pedigrees of Japanese descent. MJD is a clinically pleomorphic neurodegenerative disease that was originally described in subjects of Azorean descent. In light of the nonallelic heterogeneity in other inherited spinocere-bellar ataxias, we were interested to determine if the MJD phenotype in Japanese and Azorean pedigrees arose from mutations at the same locus. We provide evidence tha...

Sparse Nonlinear Electromagnetic Imaging Accelerated With Projected Steepest Descent Algorithm

KAUST Repository

Desmal, Abdulla; Bagci, Hakan

2017-01-01

steepest descent algorithm. The algorithm uses a projection operator to enforce the sparsity constraint by thresholding the solution at every iteration. Thresholding level and iteration step are selected carefully to increase the efficiency without

Using nuclear methods for analyzing materials and determining concentration gradients

International Nuclear Information System (INIS)

Darras, R.

After reviewing the various type of nuclear chemical analysis methods, the possibilities of analysis by activation and direct observation of nuclear reactions are specifically described. These methods make it possible to effect analyses of trace-elements or impurities, even as traces, in materials, with selectivity, accuracy and great sensitivity. This latter property makes them advantageous too for determining major elements in small quantities of available matter. Furthermore, they lend themselves to carrying out superficial analyses and the determination of concentration gradients, given the careful choice of the nature and energy of the incident particles. The paper is illustrated with typical examples of analyses on steels, pure iron, refractory metals, etc [fr

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

Directory of Open Access Journals (Sweden)

Huan Ma

2015-01-01

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

Santos Basin Geological Structures Mapped by Cross-gradient Method

Science.gov (United States)

Jilinski, P.; Fontes, S. L.

2011-12-01

Introduction We mapped regional-scale geological structures localized in offshore zone Santos Basin, South-East Brazilian Coast. The region is dominated by transition zone from oceanic to continental crust. Our objective was to determine the imprint of deeper crustal structures from correlation between bathymetric, gravity and magnetic anomaly maps. The region is extensively studied for oil and gas deposits including large tectonic sub-salt traps. Our method is based on gradient directions and their magnitudes product. We calculate angular differences and cross-product and access correlation between properties and map structures. Theory and Method We used angular differences and cross-product to determine correlated region between bathymetric, free-air gravity and magnetic anomaly maps. This gradient based method focuses on borders of anomalies and uses its morphological properties to access correlation between their sources. We generated maps of angles and cross-product distribution to locate correlated regions. Regional scale potential fields maps of FA and MA are a reflection of the overlaying and overlapping effects of the adjacent structures. Our interest was in quantifying and characterizing the relation between shapes of magnetic anomalies and gravity anomalies. Results Resulting maps show strong correlation between bathymetry and gravity anomaly and bathymetry and magnetic anomaly for large strictures including Serra do Mar, shelf, continental slope and rise. All maps display the regional dominance of NE-SW geological structures alignment parallel to the shore. Special interest is presented by structures transgressing this tendency. Magnetic, gravity anomaly and bathymetry angles map show large correlated region over the shelf zone and smaller scale NE-SW banded structures over abyssal plane. From our interpretation the large band of inverse correlation adjacent to the shore is generated by the gravity effect of Serra do Mar. Disrupting structures including

Is prenatal urethral descent a risk factor for urinary incontinence during pregnancy and the postpartum period?

Science.gov (United States)

Pizzoferrato, Anne-Cécile; Fauconnier, Arnaud; Bader, Georges; de Tayrac, Renaud; Fort, Julie; Fritel, Xavier

2016-07-01

Obstetric trauma during childbirth is considered a major risk factor for postpartum urinary incontinence (UI), particularly stress urinary incontinence. Our aim was to investigate the relation between postpartum UI, mode of delivery, and urethral descent, and to define a group of women who are particularly at risk of postnatal UI. A total of 186 women were included their first pregnancy. Validated questionnaires about urinary symptoms during pregnancy, 2 and 12 months after delivery, were administered. Urethral descent was assessed clinically and by ultrasound at inclusion. Multivariate logistic regression analysis was used to determine the risk factors for UI during pregnancy, at 2 months and 1 year after first delivery. The prevalence of UI was 38.6, 46.5, 35.6, and 34.4 % at inclusion, late pregnancy, 2 months postpartum, and 1 year postpartum respectively. No significant association was found between UI at late pregnancy and urethral descent assessed clinically or by ultrasound. The only risk factor for UI at 2 months postpartum was UI at inclusion (OR 6.27 [95 % CI 2.70-14.6]). The risk factors for UI at 1 year postpartum were UI at inclusion (6.14 [2.22-16.9]), body mass index (BMI), and urethral descent at inclusion, assessed clinically (7.21 [2.20-23.7]) or by ultrasound. The mode of delivery was not associated with urethral descent. Prenatal urethral descent and UI during pregnancy are risk factors for UI at 1 year postpartum. These results indicate that postnatal UI is more strongly influenced by susceptibility factors existing before first delivery than by the mode of delivery.

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

Science.gov (United States)

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.

Local flow management/profile descent algorithm. Fuel-efficient, time-controlled profiles for the NASA TSRV airplane

Science.gov (United States)

Groce, J. L.; Izumi, K. H.; Markham, C. H.; Schwab, R. W.; Thompson, J. L.

1986-01-01

The Local Flow Management/Profile Descent (LFM/PD) algorithm designed for the NASA Transport System Research Vehicle program is described. The algorithm provides fuel-efficient altitude and airspeed profiles consistent with ATC restrictions in a time-based metering environment over a fixed ground track. The model design constraints include accommodation of both published profile descent procedures and unpublished profile descents, incorporation of fuel efficiency as a flight profile criterion, operation within the performance capabilities of the Boeing 737-100 airplane with JT8D-7 engines, and conformity to standard air traffic navigation and control procedures. Holding and path stretching capabilities are included for long delay situations.

Temperature gradient method for lipid phase diagram construction using time-resolved x-ray diffraction

International Nuclear Information System (INIS)

Caffrey, M.; Hing, F.S.

1987-01-01

A method that enables temperature-composition phase diagram construction at unprecedented rates is described and evaluated. The method involves establishing a known temperature gradient along the length of a metal rod. Samples of different compositions contained in long, thin-walled capillaries are positioned lengthwise on the rod and equilibrated such that the temperature gradient is communicated into the sample. The sample is then moved through a focused, monochromatic synchrotron-derived x-ray beam and the image-intensified diffraction pattern from the sample is recorded on videotape continuously in live-time as a function of position and, thus, temperature. The temperature at which the diffraction pattern changes corresponds to a phase boundary, and the phase(s) existing (coexisting) on either side of the boundary can be identified on the basis of the diffraction pattern. Repeating the measurement on samples covering the entire composition range completes the phase diagram. These additional samples can be conveniently placed at different locations around the perimeter of the cylindrical rod and rotated into position for diffraction measurement. Temperature-composition phase diagrams for the fully hydrated binary mixtures, dimyristoylphosphatidylcholine (DMPC)/dipalmitoylphosphatidylcholine (DPPC) and dipalmitoylphosphatidylethanolamine (DPPE)/DPPC, have been constructed using the new temperature gradient method. They agree well with and extend the results obtained by other techniques. In the DPPE/DPPC system structural parameters as a function of temperature in the various phases including the subgel phase are reported. The potential limitations of this steady-state method are discussed

Solvent effects in time-dependent self-consistent field methods. II. Variational formulations and analytical gradients

International Nuclear Information System (INIS)

Bjorgaard, J. A.; Velizhanin, K. A.; Tretiak, S.

2015-01-01

This study describes variational energy expressions and analytical excited state energy gradients for time-dependent self-consistent field methods with polarizable solvent effects. Linear response, vertical excitation, and state-specific solventmodels are examined. Enforcing a variational ground stateenergy expression in the state-specific model is found to reduce it to the vertical excitation model. Variational excited state energy expressions are then provided for the linear response and vertical excitation models and analytical gradients are formulated. Using semiempiricalmodel chemistry, the variational expressions are verified by numerical and analytical differentiation with respect to a static external electric field. Lastly, analytical gradients are further tested by performing microcanonical excited state molecular dynamics with p-nitroaniline

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

Science.gov (United States)

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.

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

International Nuclear Information System (INIS)

Kim, Hyun Keol; Charette, Andre

2007-01-01

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

Screening for homozygosity by descent in families with autosomal

Indian Academy of Sciences (India)

Home; Journals; Journal of Genetics; Volume 81; Issue 2 ... Perspectives Volume 81 Issue 2 August 2002 pp 59-63 ... disease locus in families with the recessive form of the disease, we used the approach of screening for homozygosity by descent in offspring of consanguineous and nonconsanguineous families with RP.

A novel method for the in situ determination of concentration gradients in the electrolyte of Li-ion Batteries

NARCIS (Netherlands)

Zhou, J.; Danilov, D.; Notten, P.H.L.

2006-01-01

An electrochemical method has been developed for the in situ determination of concentration gradients in the electrolyte of sealed Li-ion batteries by measuring the potential difference between microreference electrodes. Formulas relating the concentration gradient and the potential difference

Airborne Management of Traffic Conflicts in Descent With Arrival Constraints

Science.gov (United States)

Doble, Nathan A.; Barhydt, Richard; Krishnamurthy, Karthik

2005-01-01

NASA is studying far-term air traffic management concepts that may increase operational efficiency through a redistribution of decisionmaking authority among airborne and ground-based elements of the air transportation system. One component of this research, En Route Free Maneuvering, allows trained pilots of equipped autonomous aircraft to assume responsibility for traffic separation. Ground-based air traffic controllers would continue to separate traffic unequipped for autonomous operations and would issue flow management constraints to all aircraft. To evaluate En Route Free Maneuvering operations, a human-in-the-loop experiment was jointly conducted by the NASA Ames and Langley Research Centers. In this experiment, test subject pilots used desktop flight simulators to resolve conflicts in cruise and descent, and to adhere to air traffic flow constraints issued by test subject controllers. Simulators at NASA Langley were equipped with a prototype Autonomous Operations Planner (AOP) flight deck toolset to assist pilots with conflict management and constraint compliance tasks. Results from the experiment are presented, focusing specifically on operations during the initial descent into the terminal area. Airborne conflict resolution performance in descent, conformance to traffic flow management constraints, and the effects of conflicting traffic on constraint conformance are all presented. Subjective data from subject pilots are also presented, showing perceived levels of workload, safety, and acceptability of autonomous arrival operations. Finally, potential AOP functionality enhancements are discussed along with suggestions to improve arrival procedures.

Development of the CARS method for measurement of pressure and temperature gradients in centrifuges

International Nuclear Information System (INIS)

Zeltmann, A.H.; Valentini, J.J.

1983-12-01

These experiments evaluated the feasibility of applying the CARS technique to the measurement of UF 6 concentrations and pressure gradients in a gas centrifuge. The resultant CARS signals were properly related to system parameters as suggested by theory. The results have been used to guide design of an apparatus for making CARS measurements in a UF 6 gas centrifuge. Ease of measurement is expected for pressures as low as 0.1 torr. Temperature gradients can be measured by this technique with changes in the data acquisition method. 16 references, 8 figures, 2 tables

Intelligent Data Understanding for Architecture Analysis of Entry, Descent, and Landing

Data.gov (United States)

National Aeronautics and Space Administration — Because Entry, Descent and Landing (EDL) system validations are limited in Earth environments, these technologies rely heavily on models and analysis tools to...

Gravity gradient preprocessing at the GOCE HPF

Science.gov (United States)

Bouman, J.; Rispens, S.; Gruber, T.; Schrama, E.; Visser, P.; Tscherning, C. C.; Veicherts, M.

2009-04-01

One of the products derived from the GOCE observations are the gravity gradients. These gravity gradients are provided in the Gradiometer Reference Frame (GRF) and are calibrated in-flight using satellite shaking and star sensor data. In order to use these gravity gradients for application in Earth sciences and gravity field analysis, additional pre-processing needs to be done, including corrections for temporal gravity field signals to isolate the static gravity field part, screening for outliers, calibration by comparison with existing external gravity field information and error assessment. The temporal gravity gradient corrections consist of tidal and non-tidal corrections. These are all generally below the gravity gradient error level, which is predicted to show a 1/f behaviour for low frequencies. In the outlier detection the 1/f error is compensated for by subtracting a local median from the data, while the data error is assessed using the median absolute deviation. The local median acts as a high-pass filter and it is robust as is the median absolute deviation. Three different methods have been implemented for the calibration of the gravity gradients. All three methods use a high-pass filter to compensate for the 1/f gravity gradient error. The baseline method uses state-of-the-art global gravity field models and the most accurate results are obtained if star sensor misalignments are estimated along with the calibration parameters. A second calibration method uses GOCE GPS data to estimate a low degree gravity field model as well as gravity gradient scale factors. Both methods allow to estimate gravity gradient scale factors down to the 10-3 level. The third calibration method uses high accurate terrestrial gravity data in selected regions to validate the gravity gradient scale factors, focussing on the measurement band. Gravity gradient scale factors may be estimated down to the 10-2 level with this method.

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

Science.gov (United States)

Jiang, Hong; Yang, Weitao

2004-08-01

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

Reconstructing the Surface Permittivity Distribution from Data Measured by the CONSERT Instrument aboard Rosetta: Method and Simulations

Science.gov (United States)

Plettemeier, D.; Statz, C.; Hegler, S.; Herique, A.; Kofman, W. W.

2014-12-01

One of the main scientific objectives of the Comet Nucleus Sounding Experiment by Radiowave Transmission (CONSERT) aboard Rosetta is to perform a dielectric characterization of comet 67P/Chuyurmov-Gerasimenko's nucleus by means of a bi-static sounding between the lander Philae launched onto the comet's surface and the orbiter Rosetta. For the sounding, the lander part of CONSERT will receive and process the radio signal emitted by the orbiter part of the instrument and transmit a signal to the orbiter to be received by CONSERT. CONSERT will also be operated as bi-static RADAR during the descent of the lander Philae onto the comet's surface. From data measured during the descent, we aim at reconstructing a surface permittivity map of the comet at the landing site and along the path below the descent trajectory. This surface permittivity map will give information on the bulk material right below and around the landing site and the surface roughness in areas covered by the instrument along the descent. The proposed method to estimate the surface permittivity distribution is based on a least-squares based inversion approach in frequency domain. The direct problem of simulating the wave-propagation between lander and orbiter at line-of-sight and the signal reflected on the comet's surface is modelled using a dielectric physical optics approximation. Restrictions on the measurement positions by the descent orbitography and limitations on the instrument dynamic range will be dealt with by application of a regularization technique where the surface permittivity distribution and the gradient with regard to the permittivity is projected in a domain defined by a viable model of the spatial material and roughness distribution. The least-squares optimization step of the reconstruction is performed in such domain on a reduced set of parameters yielding stable results. The viability of the proposed method is demonstrated by reconstruction results based on simulated data.

Ti and N adatom descent pathways to the terrace from atop two-dimensional TiN/TiN(001) islands

Energy Technology Data Exchange (ETDEWEB)

Edström, D., E-mail: daned@ifm.liu.se [Department of Physics, Chemistry and Biology (IFM), Linköping University, SE-58183 Linköping (Sweden); Sangiovanni, D.G.; Hultman, L.; Chirita, V. [Department of Physics, Chemistry and Biology (IFM), Linköping University, SE-58183 Linköping (Sweden); Petrov, I.; Greene, J.E. [Department of Physics, Chemistry and Biology (IFM), Linköping University, SE-58183 Linköping (Sweden); Frederick Seitz Materials Research Laboratory and the Materials Science Department, University of Illinois at Urbana-Champaign, Urbana, IL 61801 (United States)

2014-05-02

We use classical molecular dynamics and the modified embedded atom method to determine residence times and descent pathways of Ti and N adatoms on square, single-atom-high, TiN islands on TiN(001). Simulations are carried out at 1000 K, which is within the optimal range for TiN(001) epitaxial growth. Results show that the frequency of descent events, and overall adatom residence times, depend strongly on both the TiN(001) diffusion barrier for each species as well as the adatom island-edge location immediately prior to descent. Ti adatoms, with a low diffusion barrier, rapidly move toward the island periphery, via funneling, where they diffuse along upper island edges. The primary descent mechanism for Ti adatoms is via push-out/exchange with Ti island-edge atoms, a process in which the adatom replaces an island edge atom by moving down while pushing the edge atom out onto the terrace to occupy an epitaxial position along the island edge. Double push-out events are also observed for Ti adatoms descending at N corner positions. N adatoms, with a considerably higher diffusion barrier on TiN(001), require much longer times to reach island edges and, consequently, have significantly longer residence times. N adatoms are found to descend onto the terrace by direct hopping over island edges and corner atoms, as well as by concerted push-out/exchange with N atoms adjacent to Ti corners. For both adspecies, we also observe several complex adatom/island interactions, before and after descent onto the terrace, including two instances of Ti island-atom ascent onto the island surface. - Highlights: • We use classical molecular dynamics to model Ti and N adatom migration on TiN(001) islands. • N adatoms remain on islands significantly longer than Ti adatoms. • Ti adatoms descend via push-out/exchange, N adatoms primarily by direct hops. • N adatoms act as precursors for multilayer formation and surface roughening.

Ti and N adatom descent pathways to the terrace from atop two-dimensional TiN/TiN(001) islands

International Nuclear Information System (INIS)

Edström, D.; Sangiovanni, D.G.; Hultman, L.; Chirita, V.; Petrov, I.; Greene, J.E.

2014-01-01

We use classical molecular dynamics and the modified embedded atom method to determine residence times and descent pathways of Ti and N adatoms on square, single-atom-high, TiN islands on TiN(001). Simulations are carried out at 1000 K, which is within the optimal range for TiN(001) epitaxial growth. Results show that the frequency of descent events, and overall adatom residence times, depend strongly on both the TiN(001) diffusion barrier for each species as well as the adatom island-edge location immediately prior to descent. Ti adatoms, with a low diffusion barrier, rapidly move toward the island periphery, via funneling, where they diffuse along upper island edges. The primary descent mechanism for Ti adatoms is via push-out/exchange with Ti island-edge atoms, a process in which the adatom replaces an island edge atom by moving down while pushing the edge atom out onto the terrace to occupy an epitaxial position along the island edge. Double push-out events are also observed for Ti adatoms descending at N corner positions. N adatoms, with a considerably higher diffusion barrier on TiN(001), require much longer times to reach island edges and, consequently, have significantly longer residence times. N adatoms are found to descend onto the terrace by direct hopping over island edges and corner atoms, as well as by concerted push-out/exchange with N atoms adjacent to Ti corners. For both adspecies, we also observe several complex adatom/island interactions, before and after descent onto the terrace, including two instances of Ti island-atom ascent onto the island surface. - Highlights: • We use classical molecular dynamics to model Ti and N adatom migration on TiN(001) islands. • N adatoms remain on islands significantly longer than Ti adatoms. • Ti adatoms descend via push-out/exchange, N adatoms primarily by direct hops. • N adatoms act as precursors for multilayer formation and surface roughening

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

Science.gov (United States)

Bernal, Javier; Torres-Jimenez, Jose

2015-01-01

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

NON–DESCENT VAGINAL HYSTERECTOMY FOR BENIGN GYNAECOLOGICAL DISEASE – A PROSPECTIVE STUDY

Directory of Open Access Journals (Sweden)

Thulasi

2016-04-01

Full Text Available OBJECTIVE To assess safety and feasibility of non-descent vaginal hysterectomy for benign gynaecological disease. METHODS A prospective study was conducted at the Department of Obstetrics and Gynaecology of P K Das Institute of Medical Sciences from January 2013 to December 2013. An effort was made to perform hysterectomies vaginally in women with benign or premalignant conditions in the absence of prolapse. A suspected adnexal pathology, endometriosis, immobility of uterus, uterus size more than 16 weeks was excluded from the study. Vaginal hysterectomy was done in usual manner. In bigger size uterus, morcellation techniques like bisection, debulking, coring, myomectomy, or combination of these were used to remove the uterus. Data regarding age, parity, uterine size, estimated blood loss, length of operation, intraoperative and postoperative complications and hospital stay were recorded. RESULTS A total of 100 cases were selected for non-descent vaginal hysterectomy. Among them, 97 cases successfully underwent nondescent vaginal hysterectomy. Majority of the patients (55% were in age group 40-45 yrs. Four patients were nulligravida and eight patients had previous LSCS. Uterine size was ≤ 12 weeks in 84 cases and > 12-16 weeks in 16 cases. Commonest indication was leiomyoma of uterus (43%. Mean duration of surgery was 70±20.5 minutes. Mean blood loss was 150±65 mL. Reasons for failure to perform NDVH was difficulty in opening pouch of Douglas in two cases because of adhesions and in one case there was difficulty in reaching the fundal myoma which prevented the uterine descent. Intra–operatively, one case had bladder injury (1% that had previous 2 LSCS. Postoperatively, complications were minimal which included postoperative fever (11%, UTI (8% and vaginal cuff infection was (4%. Mean hospital stay was 3.5 days. CONCLUSION Vaginal hysterectomy is safe, feasible in most of the women requiring hysterectomy for benign conditions with less

Representing Matrix Cracks Through Decomposition of the Deformation Gradient Tensor in Continuum Damage Mechanics Methods

Science.gov (United States)

Leone, Frank A., Jr.

2015-01-01

A method is presented to represent the large-deformation kinematics of intraply matrix cracks and delaminations in continuum damage mechanics (CDM) constitutive material models. The method involves the additive decomposition of the deformation gradient tensor into 'crack' and 'bulk material' components. The response of the intact bulk material is represented by a reduced deformation gradient tensor, and the opening of an embedded cohesive interface is represented by a normalized cohesive displacement-jump vector. The rotation of the embedded interface is tracked as the material deforms and as the crack opens. The distribution of the total local deformation between the bulk material and the cohesive interface components is determined by minimizing the difference between the cohesive stress and the bulk material stress projected onto the cohesive interface. The improvements to the accuracy of CDM models that incorporate the presented method over existing approaches are demonstrated for a single element subjected to simple shear deformation and for a finite element model of a unidirectional open-hole tension specimen. The material model is implemented as a VUMAT user subroutine for the Abaqus/Explicit finite element software. The presented deformation gradient decomposition method reduces the artificial load transfer across matrix cracks subjected to large shearing deformations, and avoids the spurious secondary failure modes that often occur in analyses based on conventional progressive damage models.

Spacecraft Trajectory Generation by Successive Approximation for Powered Descent and Cyclers

Science.gov (United States)

Casoliva, Jordi

Methods for spacecraft trajectory generation must be reliable. Complex nonlinear dynamics and constraints impede straightforward approaches. The approach pursued in this dissertation is to use successive approximation, which entails solving a sequence of problems, each one of which can be solved reliably, leading to the solution of the problem of interest. First, contractive sequential convex programming (CSCP) is developed and then applied to the problem of optimal powered descent landing in the presence of complex constraints, aerodynamic force and nonlinear engine performance. Second, numerical continuation is applied to the generation of cycler (periodic) spacecraft trajectories in the Earth-Moon system, the challenge here being the multiple scales of the three-body dynamics. The first-order necessary conditions for minimum-fuel powered descent are derived and interpreted. Both a point-mass model with throttle and thrust angle control and a rigid-body model with throttle and angular velocity control are considered, with a more complete analysis of the rigid-body case than previously available in the literature. The effects of boundary conditions on the thrust direction and finite bounds on the angular velocities are analyzed for the rigid-body case. Minimum-fuel solutions, obtained numerically, illustrate the optimal strategies. The optimal powered descent landing problem considered in the development of CSCP has a convex cost function, nonlinear dynamics, convex state constraints and nonlinear non-convex control constraints. The non-convexity in the control constraints is handled with the lossless convexification technique which consists of a convex relaxation on the control constraints. The novelty of CSCP is the ability to account for nonlinear dynamics and nonlinear control bounds in the optimal control problem and the use of interior-point methods for second-order cone programs which are guaranteed to find the optimal solution. CSCP solves a convergent

The Role of la Familia for Women of Mexican Descent Who Are Leaders in Higher Education

Science.gov (United States)

Elizondo, Sandra Gray

2012-01-01

The purpose of this qualitative case study was to describe the role of "la familia" for women of Mexican descent as it relates to their development as leaders and their leadership in academia. Purposeful sampling was utilized to reach the goal of 18 participants who were female academic leaders of Mexican descent teaching full time in…

Using a Gradient Vector to Find Multiple Periodic Oscillations in Suspension Bridge Models

Science.gov (United States)

Humphreys, L. D.; McKenna, P. J.

2005-01-01

This paper describes how the method of steepest descent can be used to find periodic solutions of differential equations. Applications to two suspension bridge models are discussed, and the method is used to find non-obvious large-amplitude solutions.

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

NARCIS (Netherlands)

Vermolen, F.J.; Vuik, C.

2001-01-01

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

A fast nonlinear conjugate gradient based method for 3D frictional contact problems

NARCIS (Netherlands)

Zhao, J.; Vollebregt, E.A.H.; Oosterlee, C.W.

2014-01-01

This paper presents a fast numerical solver for a nonlinear constrained optimization problem, arising from a 3D frictional contact problem. It incorporates an active set strategy with a nonlinear conjugate gradient method. One novelty is to consider the tractions of each slip element in a polar

Research on a wavefront aberration calculation method for a laser energy gradient attenuator

International Nuclear Information System (INIS)

Dong, Tingting; Han, Xu; Chen, Chi; Fu, Yuegang; Li, Ming

2013-01-01

When a laser energy gradient attenuator is working, there is an inhomogeneous temperature distribution in the whole of the glass because of the non-uniform light energy absorption. This will lead to optical performance reduction. An integrated opto-thermal–mechanical method is proposed to calculate the wavefront aberration for analysis of the thermal effect of the system. Non-sequential optical analysis is used for computing the absorbed energy distribution. The finite element analysis program solves the temperature distribution and the deformations of nodes on the surfaces. An interface routine is created to fit the surface shape and the index field, and extended Zernike polynomials are introduced to get a higher fitting precision. Finally, the parameters are imported to the CodeV optical design program automatically, and the user defined gradient index material is ray traced to obtain the wavefront aberration. The method can also be used in other optical systems for thermal effect analysis. (letter)

A Wind Tunnel Study on the Mars Pathfinder (MPF) Lander Descent Pressure Sensor

Science.gov (United States)

Soriano, J. Francisco; Coquilla, Rachael V.; Wilson, Gregory R.; Seiff, Alvin; Rivell, Tomas

2001-01-01

The primary focus of this study was to determine the accuracy of the Mars Pathfinder lander local pressure readings in accordance with the actual ambient atmospheric pressures of Mars during parachute descent. In order to obtain good measurements, the plane of the lander pressure sensor opening should ideally be situated so that it is parallel to the freestream. However, due to two unfavorable conditions, the sensor was positioned in locations where correction factors are required. One of these disadvantages is due to the fact that the parachute attachment point rotated the lander's center of gravity forcing the location of the pressure sensor opening to be off tangent to the freestream. The second and most troublesome factor was that the lander descends with slight oscillations that could vary the amplitude of the sensor readings. In order to accurately map the correction factors required at each sensor position, an experiment simulating the lander descent was conducted in the Martian Surface Wind Tunnel at NASA Ames Research Center. Using a 115 scale model at Earth ambient pressures, the test settings provided the necessary Reynolds number conditions in which the actual lander was possibly subjected to during the descent. In the analysis and results of this experiment, the readings from the lander sensor were converted to the form of pressure coefficients. With a contour map of pressure coefficients at each lander oscillatory position, this report will provide a guideline to determine the correction factors required for the Mars Pathfinder lander descent pressure sensor readings.

Combining Step Gradients and Linear Gradients in Density.

Science.gov (United States)

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

2015-06-16

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

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

Directory of Open Access Journals (Sweden)

Bo Wang

2016-04-01

Full Text Available 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.

Regularization of DT-MR images using a successive Fermat median filtering method.

Science.gov (United States)

Kwon, Kiwoon; Kim, Dongyoun; Kim, Sunghee; Park, Insung; Jeong, Jaewon; Kim, Taehwan; Hong, Cheolpyo; Han, Bongsoo

2008-05-21

Tractography using diffusion tensor magnetic resonance imaging (DT-MRI) is a method to determine the architecture of axonal fibers in the central nervous system by computing the direction of greatest diffusion in the white matter of the brain. To reduce the noise in DT-MRI measurements, a tensor-valued median filter, which is reported to be denoising and structure preserving in the tractography, is applied. In this paper, we proposed the successive Fermat (SF) method, successively using Fermat point theory for a triangle contained in the two-dimensional plane, as a median filtering method. We discussed the error analysis and numerical study about the SF method for phantom and experimental data. By considering the computing time and the image quality aspects of the numerical study simultaneously, we showed that the SF method is much more efficient than the simple median (SM) and gradient descents (GD) methods.

Regularization of DT-MR images using a successive Fermat median filtering method

International Nuclear Information System (INIS)

Kwon, Kiwoon; Kim, Dongyoun; Kim, Sunghee; Park, Insung; Jeong, Jaewon; Kim, Taehwan; Hong, Cheolpyo; Han, Bongsoo

2008-01-01

Tractography using diffusion tensor magnetic resonance imaging (DT-MRI) is a method to determine the architecture of axonal fibers in the central nervous system by computing the direction of greatest diffusion in the white matter of the brain. To reduce the noise in DT-MRI measurements, a tensor-valued median filter, which is reported to be denoising and structure preserving in the tractography, is applied. In this paper, we proposed the successive Fermat (SF) method, successively using Fermat point theory for a triangle contained in the two-dimensional plane, as a median filtering method. We discussed the error analysis and numerical study about the SF method for phantom and experimental data. By considering the computing time and the image quality aspects of the numerical study simultaneously, we showed that the SF method is much more efficient than the simple median (SM) and gradient descents (GD) methods

Regularization of DT-MR images using a successive Fermat median filtering method

Energy Technology Data Exchange (ETDEWEB)

Kwon, Kiwoon; Kim, Dongyoun; Kim, Sunghee; Park, Insung; Jeong, Jaewon; Kim, Taehwan [Department of Biomedical Engineering, Yonsei University, Wonju, 220-710 (Korea, Republic of); Hong, Cheolpyo; Han, Bongsoo [Department of Radiological Science, Yonsei University, Wonju, 220-710 (Korea, Republic of)], E-mail: bshan@yonsei.ac.kr

2008-05-21

Tractography using diffusion tensor magnetic resonance imaging (DT-MRI) is a method to determine the architecture of axonal fibers in the central nervous system by computing the direction of greatest diffusion in the white matter of the brain. To reduce the noise in DT-MRI measurements, a tensor-valued median filter, which is reported to be denoising and structure preserving in the tractography, is applied. In this paper, we proposed the successive Fermat (SF) method, successively using Fermat point theory for a triangle contained in the two-dimensional plane, as a median filtering method. We discussed the error analysis and numerical study about the SF method for phantom and experimental data. By considering the computing time and the image quality aspects of the numerical study simultaneously, we showed that the SF method is much more efficient than the simple median (SM) and gradient descents (GD) methods.

FUZZY-GENETIC CONTROL OF QUADROTOR UNMANNED AERIAL VEHICLES

Directory of Open Access Journals (Sweden)

Attila Nemes

2016-03-01

Full Text Available This article presents a novel fuzzy identification method for dynamic modelling of quadrotor unmanned aerial vehicles. The method is based on a special parameterization of the antecedent part of fuzzy systems that results in fuzzy-partitions for antecedents. This antecedent parameter representation method of fuzzy rules ensures upholding of predefined linguistic value ordering and ensures that fuzzy-partitions remain intact throughout an unconstrained hybrid evolutionary and gradient descent based optimization process. In the equations of motion the first order derivative component is calculated based on Christoffel symbols, the derivatives of fuzzy systems are used for modelling the Coriolis effects, gyroscopic and centrifugal terms. The non-linear parameters are subjected to an initial global evolutionary optimization scheme and fine tuning with gradient descent based local search. Simulation results of the proposed new quadrotor dynamic model identification method are promising.

Arachnid aloft: directed aerial descent in neotropical canopy spiders.

Science.gov (United States)

Yanoviak, Stephen P; Munk, Yonatan; Dudley, Robert

2015-09-06

The behaviour of directed aerial descent has been described for numerous taxa of wingless hexapods as they fall from the tropical rainforest canopy, but is not known in other terrestrial arthropods. Here, we describe similar controlled aerial behaviours for large arboreal spiders in the genus Selenops (Selenopidae). We dropped 59 such spiders from either canopy platforms or tree crowns in Panama and Peru; the majority (93%) directed their aerial trajectories towards and then landed upon nearby tree trunks. Following initial dorsoventral righting when necessary, falling spiders oriented themselves and then translated head-first towards targets; directional changes were correlated with bilaterally asymmetric motions of the anterolaterally extended forelegs. Aerial performance (i.e. the glide index) decreased with increasing body mass and wing loading, but not with projected surface area of the spider. Along with the occurrence of directed aerial descent in ants, jumping bristletails, and other wingless hexapods, this discovery of targeted gliding in selenopid spiders further indicates strong selective pressures against uncontrolled falls into the understory for arboreal taxa. © 2015 The Author(s).

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

Science.gov (United States)

Poole, E. L.

1986-01-01

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

Neuromuscular function during stair descent in meniscectomized patients and controls

DEFF Research Database (Denmark)

Thorlund, Jonas Bloch; Roos, Ewa M; Aagaard, Per

2011-01-01

The aim of this study was to identify differences in knee range of motion (ROM), movement speed, ground reaction forces (GRF) profile, neuromuscular activity, and muscle coactivation during the transition between stair descent and level walking in meniscectomized patients at high risk of knee...

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

International Nuclear Information System (INIS)

Li Pengju; Shi Shangming; Song Yanjie

2010-01-01

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

Experimental studies of the rotor flow downwash on the Stability of multi-rotor crafts in descent

Science.gov (United States)

Veismann, Marcel; Dougherty, Christopher; Gharib, Morteza

2017-11-01

All rotorcrafts, including helicopters and multicopters, have the inherent problem of entering rotor downwash during vertical descent. As a result, the craft is subject to highly unsteady flow, called vortex ring state (VRS), which leads to a loss of lift and reduced stability. To date, experimental efforts to investigate this phenomenon have been largely limited to analysis of a single, fixed rotor mounted in a horizontal wind tunnel. Our current work aims to understand the interaction of multiple rotors in vertical descent by mounting a multi-rotor craft in a low speed, vertical wind tunnel. Experiments were performed with a fixed and rotationally free mounting; the latter allowing us to better capture the dynamics of a free flying drone. The effect of rotor separation on stability, generated thrust, and rotor wake interaction was characterized using force gauge data and PIV analysis for various descent velocities. The results obtained help us better understand fluid-craft interactions of drones in vertical descent and identify possible sources of instability. The presented material is based upon work supported by the Center for Autonomous Systems and Technologies (CAST) at the Graduate Aerospace Laboratories of the California Institute of Technology (GALCIT).

Study of Boundary Layer Convective Heat Transfer with Low Pressure Gradient Over a Flat Plate Via He's Homotopy Perturbation Method

International Nuclear Information System (INIS)

Fathizadeh, M.; Aroujalian, A.

2012-01-01

The boundary layer convective heat transfer equations with low pressure gradient over a flat plate are solved using Homotopy Perturbation Method, which is one of the semi-exact methods. The nonlinear equations of momentum and energy solved simultaneously via Homotopy Perturbation Method are in good agreement with results obtained from numerical methods. Using this method, a general equation in terms of Pr number and pressure gradient (λ) is derived which can be used to investigate velocity and temperature profiles in the boundary layer.

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

Energy Technology Data Exchange (ETDEWEB)

Ledermüller, Katrin; Schütz, Martin, E-mail: martin.schuetz@chemie.uni-regensburg.de [Institute of Physical and Theoretical Chemistry, University of Regensburg, Universitätsstraße 31, D-93040 Regensburg (Germany)

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.

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

Science.gov (United States)

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.

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

International Nuclear Information System (INIS)

Ledermüller, Katrin; Schütz, Martin

2014-01-01

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

In situ synthesis of bilayered gradient poly(vinyl alcohol)/hydroxyapatite composite hydrogel by directional freezing-thawing and electrophoresis method.

Science.gov (United States)

Su, Cui; Su, Yunlan; Li, Zhiyong; Haq, Muhammad Abdul; Zhou, Yong; Wang, Dujin

2017-08-01

Bilayered poly(vinyl alcohol) (PVA)/hydroxyapatite (HA) composite hydrogels with anisotropic and gradient mechanical properties were prepared by the combination of directional freezing-thawing (DFT) and electrophoresis method. Firstly, PVA hydrogels with aligned channel structure were prepared by the DFT method. Then, HA nanoparticles were in situ synthesized within the PVA hydrogels via electrophoresis. By controlling the time of the electrophoresis process, a bilayered gradient hydrogel containing HA particles in only half of the gel region was obtained. The PVA/HA composite hydrogel exhibited gradient mechanical strength depending on the distance to the cathode. The gradient initial tensile modulus ranging from 0.18MPa to 0.27MPa and the gradient initial compressive modulus from 0.33MPa to 0.51MPa were achieved. The binding strength of the two regions was relatively high and no apparent internal stress or defect was observed at the boundary. The two regions of the bilayered hydrogel also showed different osteoblast cell adhesion properties. Copyright © 2017 Elsevier B.V. All rights reserved.

Dose gradient analyses in linac-based intracranial stereotactic radiosurgery using paddick's gradient index. Consideration of the optimal method for plan evaluation

International Nuclear Information System (INIS)

Ohtakara, Kazuhiro; Hayashi, Shinya; Hoshi, Hiroaki

2011-01-01

The objective of our study was to describe the dose gradient characteristics of Linac-based stereotactic radiosurgery using Paddick's gradient index (GI) and to elucidate the factors influencing the GI value. Seventy-three plans for brain metastases using the dynamic conformal arcs were reviewed. The GI values were calculated at the 80% and 90% isodose surfaces (IDSs) and at the different target coverage IDSs (D99, D95, D90, and D85). The GI values significantly decreased as the target coverage of the reference IDS increased (the percentage of the IDS decreased). There was a significant inverse correlation between the GI values and target volume. The plans generated with the addition of a 1-mm leaf margin had worse GI values both at the D99 and D95 relative to those without leaf margin. The number and arrangement of arcs also affected the GI value. The GI values are highly sensitive to the IDS selection variability for dose prescription or evaluation, the target volume, and the planning method. To objectively compare the quality of dose gradient between rival plans, it would be preferable to employ the GI defined at the reference IDS indicating the specific target coverage (exempli gratia (e.g.), D95), irrespective of the intended marginal dose. The modified GI (mGI), defined in this study, substituting the denominator of the original GI with the target volume, would be useful to compensate for the false superior GI value in cases of target over-coverage with the reference IDS and to objectively evaluate the dose gradient outside the target boundary. (author)

Minimum-fuel turning climbout and descent guidance of transport jets

Science.gov (United States)

Neuman, F.; Kreindler, E.

1983-01-01

The complete flightpath optimization problem for minimum fuel consumption from takeoff to landing including the initial and final turns from and to the runway heading is solved. However, only the initial and final segments which contain the turns are treated, since the straight-line climbout, cruise, and descent problems have already been solved. The paths are derived by generating fields of extremals, using the necessary conditions of optimal control together with singular arcs and state constraints. Results show that the speed profiles for straight flight and turning flight are essentially identical except for the final horizontal accelerating or decelerating turns. The optimal turns require no abrupt maneuvers, and an approximation of the optimal turns could be easily integrated with present straight-line climb-cruise-descent fuel-optimization algorithms. Climbout at the optimal IAS rather than the 250-knot terminal-area speed limit would save 36 lb of fuel for the 727-100 aircraft.

Acceleration of monte Carlo solution by conjugate gradient method

International Nuclear Information System (INIS)

Toshihisa, Yamamoto

2005-01-01

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

Entry, Descent, and Landing Performance for a Mid-Lift-to-Drag Ratio Vehicle at Mars

Science.gov (United States)

Johnson, Breanna J.; Braden, Ellen M.; Sostaric, Ronald R.; Cerimele, Christopher J.; Lu, Ping

2018-01-01

In an effort to mature the design of the Mid-Lift-to-Drag ratio Rigid Vehicle (MRV) candidate of the NASA Evolvable Mars Campaign (EMC) architecture study, end-to-end six-degree-of-freedom (6DOF) simulations are needed to ensure a successful entry, descent, and landing (EDL) design. The EMC study is assessing different vehicle and mission architectures to determine which candidate would be best to deliver a 20 metric ton payload to the surface of Mars. Due to the large mass payload and the relatively low atmospheric density of Mars, all candidates of the EMC study propose to use Supersonic Retro-Propulsion (SRP) throughout the descent and landing phase, as opposed to parachutes, in order to decelerate to a subsonic touchdown. This paper presents a 6DOF entry-to-landing performance and controllability study with sensitivities to dispersions, particularly in the powered descent and landing phases.

Electric field gradients in metals

International Nuclear Information System (INIS)

Schatz, G.

1979-01-01

A review of the recent works on electric field gradient in metals is given. The main emphasis is put on the temperature dependence of the electric field gradient in nonmagnetic metals. Some methods of investigation of this effect using nuclear probes are described. One of them is nuclear accoustic resonance method. (S.B.)

Bioassessment tools in novel habitats: an evaluation of indices and sampling methods in low-gradient streams in California.

Science.gov (United States)

Mazor, Raphael D; Schiff, Kenneth; Ritter, Kerry; Rehn, Andy; Ode, Peter

2010-08-01

Biomonitoring programs are often required to assess streams for which assessment tools have not been developed. For example, low-gradient streams (slopeindices in the state were developed in high-gradient systems. This study evaluated the performance of three sampling methods [targeted riffle composite (TRC), reach-wide benthos (RWB), and the margin-center-margin modification of RWB (MCM)] and two indices [the Southern California Index of Biotic Integrity (SCIBI) and the ratio of observed to expected taxa (O/E)] in low-gradient streams in California for application in this habitat type. Performance was evaluated in terms of efficacy (i.e., ability to collect enough individuals for index calculation), comparability (i.e., similarity of assemblages and index scores), sensitivity (i.e., responsiveness to disturbance), and precision (i.e., ability to detect small differences in index scores). The sampling methods varied in the degree to which they targeted macroinvertebrate-rich microhabitats, such as riffles and vegetated margins, which may be naturally scarce in low-gradient streams. The RWB method failed to collect sufficient numbers of individuals (i.e., >or=450) to calculate the SCIBI in 28 of 45 samples and often collected fewer than 100 individuals, suggesting it is inappropriate for low-gradient streams in California; failures for the other methods were less common (TRC, 16 samples; MCM, 11 samples). Within-site precision, measured as the minimum detectable difference (MDD) was poor but similar across methods for the SCIBI (ranging from 19 to 22). However, RWB had the lowest MDD for O/E scores (0.20 versus 0.24 and 0.28 for MCM and TRC, respectively). Mantel correlations showed that assemblages were more similar within sites among methods than within methods among sites, suggesting that the sampling methods were collecting similar assemblages of organisms. Statistically significant disagreements among methods were not detected, although O/E scores were higher

Algorithms for Mathematical Programming with Emphasis on Bi-level Models

Energy Technology Data Exchange (ETDEWEB)

Goldfarb, Donald [Columbia University; Iyengar, Garud [Columbia University

2014-05-22

The research supported by this grant was focused primarily on first-order methods for solving large scale and structured convex optimization problems and convex relaxations of nonconvex problems. These include optimal gradient methods, operator and variable splitting methods, alternating direction augmented Lagrangian methods, and block coordinate descent methods.

Machado-Joseph disease in pedigrees of Azorean descent is linked to chromosome 14.

Science.gov (United States)

St George-Hyslop, P; Rogaeva, E; Huterer, J; Tsuda, T; Santos, J; Haines, J L; Schlumpf, K; Rogaev, E I; Liang, Y; McLachlan, D R

1994-07-01

A locus for Machado-Joseph disease (MJD) has recently been mapped to a 30-cM region of chromosome 14q in five pedigrees of Japanese descent. MJD is a clinically pleomorphic neurodegenerative disease that was originally described in subjects of Azorean descent. In light of the nonallelic heterogeneity in other inherited spinocerebellar ataxias, we were interested to determine if the MJD phenotype in Japanese and Azorean pedigrees arose from mutations at the same locus. We provide evidence that MJD in five pedigrees of Azorean descent is also linked to chromosome 14q in an 18-cM region between the markers D14S67 and AACT (multipoint lod score +7.00 near D14S81). We also report molecular evidence for homozygosity at the MJD locus in an MJD-affected subject with severe, early-onset symptoms. These observations confirm the initial report of linkage of MJD to chromosome 14; suggest that MJD in Japanese and Azorean subjects may represent allelic or identical mutations at the same locus; and provide one possible explanation (MJD gene dosage) for the observed phenotypic heterogeneity in this disease.

A fast nonlinear conjugate gradient based method for 3D concentrated frictional contact problems

NARCIS (Netherlands)

J. Zhao (Jing); E.A.H. Vollebregt (Edwin); C.W. Oosterlee (Cornelis)

2015-01-01

htmlabstractThis paper presents a fast numerical solver for a nonlinear constrained optimization problem, arising from 3D concentrated frictional shift and rolling contact problems with dry Coulomb friction. The solver combines an active set strategy with a nonlinear conjugate gradient method. One

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

International Nuclear Information System (INIS)

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

2011-01-01

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

The orthogonal gradients method: A radial basis functions method for solving partial differential equations on arbitrary surfaces

KAUST Repository

Piret, Cécile

2012-05-01

Much work has been done on reconstructing arbitrary surfaces using the radial basis function (RBF) method, but one can hardly find any work done on the use of RBFs to solve partial differential equations (PDEs) on arbitrary surfaces. In this paper, we investigate methods to solve PDEs on arbitrary stationary surfaces embedded in . R3 using the RBF method. We present three RBF-based methods that easily discretize surface differential operators. We take advantage of the meshfree character of RBFs, which give us a high accuracy and the flexibility to represent the most complex geometries in any dimension. Two out of the three methods, which we call the orthogonal gradients (OGr) methods are the result of our work and are hereby presented for the first time. © 2012 Elsevier Inc.

Generalized conjugate-gradient methods for the Navier-Stokes equations

Science.gov (United States)

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

1991-01-01

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

A Novel Ship Detection Method Based on Gradient and Integral Feature for Single-Polarization Synthetic Aperture Radar Imagery

Directory of Open Access Journals (Sweden)

Hao Shi

2018-02-01

Full Text Available With the rapid development of remote sensing technologies, SAR satellites like China’s Gaofen-3 satellite have more imaging modes and higher resolution. With the availability of high-resolution SAR images, automatic ship target detection has become an important topic in maritime research. In this paper, a novel ship detection method based on gradient and integral features is proposed. This method is mainly composed of three steps. First, in the preprocessing step, a filter is employed to smooth the clutters and the smoothing effect can be adaptive adjusted according to the statistics information of the sub-window. Thus, it can retain details while achieving noise suppression. Second, in the candidate area extraction, a sea-land segmentation method based on gradient enhancement is presented. The integral image method is employed to accelerate computation. Finally, in the ship target identification step, a feature extraction strategy based on Haar-like gradient information and a Radon transform is proposed. This strategy decreases the number of templates found in traditional Haar-like methods. Experiments were performed using Gaofen-3 single-polarization SAR images, and the results showed that the proposed method has high detection accuracy and rapid computational efficiency. In addition, this method has the potential for on-board processing.

Additive preservers of the ascent, descent and related subsets

Czech Academy of Sciences Publication Activity Database

Mbekhta, M.; Müller, Vladimír; Oudghiri, M.

2014-01-01

Roč. 71, č. 1 (2014), s. 63-83 ISSN 0379-4024 R&D Projects: GA ČR GA201/09/0473; GA AV ČR IAA100190903 Institutional support: RVO:67985840 Keywords : additive preservers * ascent * descent Subject RIV: BA - General Mathematics Impact factor: 0.550, year: 2014 http://www.mathjournals.org/jot/2014-071-001/2014-071-001-004.html

Analytic energy gradients for the coupled-cluster singles and doubles method with the density-fitting approximation

International Nuclear Information System (INIS)

Bozkaya, Uğur; Sherrill, C. David

2016-01-01

An efficient implementation is presented for analytic gradients of the coupled-cluster singles and doubles (CCSD) method with the density-fitting approximation, denoted DF-CCSD. Frozen core terms are also included. When applied to a set of alkanes, the DF-CCSD analytic gradients are significantly accelerated compared to conventional CCSD for larger molecules. The efficiency of our DF-CCSD algorithm arises from the acceleration of several different terms, which are designated as the “gradient terms”: computation of particle density matrices (PDMs), generalized Fock-matrix (GFM), solution of the Z-vector equation, formation of the relaxed PDMs and GFM, back-transformation of PDMs and GFM to the atomic orbital (AO) basis, and evaluation of gradients in the AO basis. For the largest member of the alkane set (C 10 H 22 ), the computational times for the gradient terms (with the cc-pVTZ basis set) are 2582.6 (CCSD) and 310.7 (DF-CCSD) min, respectively, a speed up of more than 8-folds. For gradient related terms, the DF approach avoids the usage of four-index electron repulsion integrals. Based on our previous study [U. Bozkaya, J. Chem. Phys. 141, 124108 (2014)], our formalism completely avoids construction or storage of the 4-index two-particle density matrix (TPDM), using instead 2- and 3-index TPDMs. The DF approach introduces negligible errors for equilibrium bond lengths and harmonic vibrational frequencies.

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

International Nuclear Information System (INIS)

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

1975-01-01

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

Technical Note: FreeCT_ICD: An Open Source Implementation of a Model-Based Iterative Reconstruction Method using Coordinate Descent Optimization for CT Imaging Investigations.

Science.gov (United States)

Hoffman, John M; Noo, Frédéric; Young, Stefano; Hsieh, Scott S; McNitt-Gray, Michael

2018-06-01

To facilitate investigations into the impacts of acquisition and reconstruction parameters on quantitative imaging, radiomics and CAD using CT imaging, we previously released an open source implementation of a conventional weighted filtered backprojection reconstruction called FreeCT_wFBP. Our purpose was to extend that work by providing an open-source implementation of a model-based iterative reconstruction method using coordinate descent optimization, called FreeCT_ICD. Model-based iterative reconstruction offers the potential for substantial radiation dose reduction, but can impose substantial computational processing and storage requirements. FreeCT_ICD is an open source implementation of a model-based iterative reconstruction method that provides a reasonable tradeoff between these requirements. This was accomplished by adapting a previously proposed method that allows the system matrix to be stored with a reasonable memory requirement. The method amounts to describing the attenuation coefficient using rotating slices that follow the helical geometry. In the initially-proposed version, the rotating slices are themselves described using blobs. We have replaced this description by a unique model that relies on tri-linear interpolation together with the principles of Joseph's method. This model offers an improvement in memory requirement while still allowing highly accurate reconstruction for conventional CT geometries. The system matrix is stored column-wise and combined with an iterative coordinate descent (ICD) optimization. The result is FreeCT_ICD, which is a reconstruction program developed on the Linux platform using C++ libraries and the open source GNU GPL v2.0 license. The software is capable of reconstructing raw projection data of helical CT scans. In this work, the software has been described and evaluated by reconstructing datasets exported from a clinical scanner which consisted of an ACR accreditation phantom dataset and a clinical pediatric

U-tube steam generator empirical model development and validation using neural networks

International Nuclear Information System (INIS)

Parlos, A.G.; Chong, K.T.; Atiya, A.

1992-01-01

Empirical modeling techniques that use model structures motivated from neural networks research have proven effective in identifying complex process dynamics. A recurrent multilayer perception (RMLP) network was developed as a nonlinear state-space model structure along with a static learning algorithm for estimating the parameter associated with it. The methods developed were demonstrated by identifying two submodels of a U-tube steam generator (UTSG), each valid around an operating power level. A significant drawback of this approach is the long off-line training times required for the development of even a simplified model of a UTSG. Subsequently, a dynamic gradient descent-based learning algorithm was developed as an accelerated alternative to train an RMLP network for use in empirical modeling of power plants. The two main advantages of this learning algorithm are its ability to consider past error gradient information for future use and the two forward passes associated with its implementation. The enhanced learning capabilities provided by the dynamic gradient descent-based learning algorithm were demonstrated via the case study of a simple steam boiler power plant. In this paper, the dynamic gradient descent-based learning algorithm is used for the development and validation of a complete UTSG empirical model

Cosmic Microwave Background Mapmaking with a Messenger Field

Science.gov (United States)

Huffenberger, Kevin M.; Næss, Sigurd K.

2018-01-01

We apply a messenger field method to solve the linear minimum-variance mapmaking equation in the context of Cosmic Microwave Background (CMB) observations. In simulations, the method produces sky maps that converge significantly faster than those from a conjugate gradient descent algorithm with a diagonal preconditioner, even though the computational cost per iteration is similar. The messenger method recovers large scales in the map better than conjugate gradient descent, and yields a lower overall χ2. In the single, pencil beam approximation, each iteration of the messenger mapmaking procedure produces an unbiased map, and the iterations become more optimal as they proceed. A variant of the method can handle differential data or perform deconvolution mapmaking. The messenger method requires no preconditioner, but a high-quality solution needs a cooling parameter to control the convergence. We study the convergence properties of this new method and discuss how the algorithm is feasible for the large data sets of current and future CMB experiments.

Aerodynamic shape optimization using preconditioned conjugate gradient methods

Science.gov (United States)

Burgreen, Greg W.; Baysal, Oktay

1993-01-01

In an effort to further improve upon the latest advancements made in aerodynamic shape optimization procedures, a systematic study is performed to examine several current solution methodologies as applied to various aspects of the optimization procedure. It is demonstrated that preconditioned conjugate gradient-like methodologies dramatically decrease the computational efforts required for such procedures. The design problem investigated is the shape optimization of the upper and lower surfaces of an initially symmetric (NACA-012) airfoil in inviscid transonic flow and at zero degree angle-of-attack. The complete surface shape is represented using a Bezier-Bernstein polynomial. The present optimization method then automatically obtains supercritical airfoil shapes over a variety of freestream Mach numbers. Furthermore, the best optimization strategy examined resulted in a factor of 8 decrease in computational time as well as a factor of 4 decrease in memory over the most efficient strategies in current use.

Testing the limits of gradient sensing.

Directory of Open Access Journals (Sweden)

Vinal Lakhani

2017-02-01

Full Text Available The ability to detect a chemical gradient is fundamental to many cellular processes. In multicellular organisms gradient sensing plays an important role in many physiological processes such as wound healing and development. Unicellular organisms use gradient sensing to move (chemotaxis or grow (chemotropism towards a favorable environment. Some cells are capable of detecting extremely shallow gradients, even in the presence of significant molecular-level noise. For example, yeast have been reported to detect pheromone gradients as shallow as 0.1 nM/μm. Noise reduction mechanisms, such as time-averaging and the internalization of pheromone molecules, have been proposed to explain how yeast cells filter fluctuations and detect shallow gradients. Here, we use a Particle-Based Reaction-Diffusion model of ligand-receptor dynamics to test the effectiveness of these mechanisms and to determine the limits of gradient sensing. In particular, we develop novel simulation methods for establishing chemical gradients that not only allow us to study gradient sensing under steady-state conditions, but also take into account transient effects as the gradient forms. Based on reported measurements of reaction rates, our results indicate neither time-averaging nor receptor endocytosis significantly improves the cell's accuracy in detecting gradients over time scales associated with the initiation of polarized growth. Additionally, our results demonstrate the physical barrier of the cell membrane sharpens chemical gradients across the cell. While our studies are motivated by the mating response of yeast, we believe our results and simulation methods will find applications in many different contexts.

A combinatorial and probabilistic study of initial and end heights of descents in samples of geometrically distributed random variables and in permutations

Directory of Open Access Journals (Sweden)

Helmut Prodinger

2007-01-01

Full Text Available In words, generated by independent geometrically distributed random variables, we study the l th descent, which is, roughly speaking, the l th occurrence of a neighbouring pair ab with a>b. The value a is called the initial height, and b the end height. We study these two random variables (and some similar ones by combinatorial and probabilistic tools. We find in all instances a generating function Ψ(v,u, where the coefficient of v j u i refers to the j th descent (ascent, and i to the initial (end height. From this, various conclusions can be drawn, in particular expected values. In the probabilistic part, a Markov chain model is used, which allows to get explicit expressions for the heights of the second descent. In principle, one could go further, but the complexity of the results forbids it. This is extended to permutations of a large number of elements. Methods from q-analysis are used to simplify the expressions. This is the reason that we confine ourselves to the geometric distribution only. For general discrete distributions, no such tools are available.

Planetary entry, descent, and landing technologies

Science.gov (United States)

Pichkhadze, K.; Vorontsov, V.; Polyakov, A.; Ivankov, A.; Taalas, P.; Pellinen, R.; Harri, A.-M.; Linkin, V.

2003-04-01

Martian meteorological lander (MML) is intended for landing on the Martian surface in order to monitor the atmosphere at landing point for one Martian year. MMLs shall become the basic elements of a global network of meteorological mini-landers, observing the dynamics of changes of the atmospheric parameters on the Red Planet. The MML main scientific tasks are as follows: (1) Study of vertical structure of the Martian atmosphere throughout the MML descent; (2) On-surface meteorological observations for one Martian year. One of the essential factors influencing the lander's design is its entry, descent, and landing (EDL) sequence. During Phase A of the MML development, five different options for the lander's design were carefully analyzed. All of these options ensure the accomplishment of the above-mentioned scientific tasks with high effectiveness. CONCEPT A (conventional approach): Two lander options (with a parachute system + airbag and an inflatable airbrake + airbag) were analyzed. They are similar in terms of fulfilling braking phases and completely analogous in landing by means of airbags. CONCEPT B (innovative approach): Three lander options were analyzed. The distinguishing feature is the presence of inflatable braking units (IBU) in their configurations. SELECTED OPTION (innovative approach): Incorporating a unique design approach and modern technologies, the selected option of the lander represents a combination of the options analyzed in the framework of Concept B study. Currently, the selected lander option undergoes systems testing (Phase D1). Several MMLs can be delivered to Mars in frameworks of various missions as primary or piggybacking payload: (1) USA-led "Mars Scout" (2007); (2) France-led "NetLander" (2007/2009); (3) Russia-led "Mars-Deimos-Phobos sample return" (2007); (4) Independent mission (currently under preliminary study); etc.

Projection and nested force-gradient methods for quantum field theories

Energy Technology Data Exchange (ETDEWEB)

Shcherbakov, Dmitry

2017-07-26

For the Hybrid Monte Carlo algorithm (HMC), often used to study the fundamental quantum field theory of quarks and gluons, quantum chromodynamics (QCD), on the lattice, one is interested in efficient numerical time integration schemes which preserve geometric properties of the flow and are optimal in terms of computational costs per trajectory for a given acceptance rate. High order numerical methods allow the use of larger step sizes, but demand a larger computational effort per step; low order schemes do not require such large computational costs per step, but need more steps per trajectory. So there is a need to balance these opposing effects. In this work we introduce novel geometric numerical time integrators, namely, projection and nested force-gradient methods in order to improve the efficiency of the HMC algorithm in application to the problems of quantum field theories.

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

International Nuclear Information System (INIS)

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

2007-01-01

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

Implementing the Mars Science Laboratory Terminal Descent Sensor Field Test Campaign

Science.gov (United States)

Montgomery, James F.; Bodie, James H.; Brown, Joseph D.; Chen, Allen; Chen, Curtis W.; Essmiller, John C.; Fisher, Charles D.; Goldberg, Hannah R.; Lee, Steven W.; Shaffer, Scott J.

2012-01-01

The Mars Science Laboratory (MSL) will deliver a 900 kg rover to the surface of Mars in August 2012. MSL will utilize a new pulse-Doppler landing radar, the Terminal Descent Sensor (TDS). The TDS employs six narrow-beam antennas to provide unprecedented slant range and velocity performance at Mars to enable soft touchdown of the MSL rover using a unique sky crane Entry, De-scent, and Landing (EDL) technique. Prior to use on MSL, the TDS was put through a rigorous verification and validation (V&V) process. A key element of this V&V was operating the TDS over a series of field tests, using flight-like profiles expected during the descent and landing of MSL over Mars-like terrain on Earth. Limits of TDS performance were characterized with additional testing meant to stress operational modes outside of the expected EDL flight profiles. The flight envelope over which the TDS must operate on Mars encompasses such a large range of altitudes and velocities that a variety of venues were neces-sary to cover the test space. These venues included an F/A-18 high performance aircraft, a Eurocopter AS350 AStar helicopter and 100-meter tall Echo Towers at the China Lake Naval Air Warfare Center. Testing was carried out over a five year period from July 2006 to June 2011. TDS performance was shown, in gen-eral, to be excellent over all venues. This paper describes the planning, design, and implementation of the field test campaign plus results and lessons learned.

Development and test results of a flight management algorithm for fuel conservative descents in a time-based metered traffic environment

Science.gov (United States)

Knox, C. E.; Cannon, D. G.

1980-01-01

A simple flight management descent algorithm designed to improve the accuracy of delivering an airplane in a fuel-conservative manner to a metering fix at a time designated by air traffic control was developed and flight tested. This algorithm provides a three dimensional path with terminal area time constraints (four dimensional) for an airplane to make an idle thrust, clean configured (landing gear up, flaps zero, and speed brakes retracted) descent to arrive at the metering fix at a predetermined time, altitude, and airspeed. The descent path was calculated for a constant Mach/airspeed schedule from linear approximations of airplane performance with considerations given for gross weight, wind, and nonstandard pressure and temperature effects. The flight management descent algorithm is described. The results of the flight tests flown with the Terminal Configured Vehicle airplane are presented.

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

OpenAIRE

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

2015-01-01

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

A Cockpit Comfort Level of the Descent Capsule-Shaped Vehicles

Directory of Open Access Journals (Sweden)

V. E. Minenko

2017-01-01

Full Text Available The article formulates the task of selecting a design-layout pattern for a transport spacecraft, in terms of reaching a proper comfort level for the crew to have appropriate functioning. Using the example of a domestic spacecraft and an American one, it has been shown that the type of launch vehicle, the launch specifics, the operational overloads, and the overall mass restrictions have a dramatic impact on the choice of the design-layout pattern of the spacecraft. The free volume of the pressure cockpit per each member of the crew is considered as the main characteristic to show a level of the spacecraft comfort. Using the average statistical data on the layout density of different equipment, the article estimates the possible increase of this characteristic for the cutting-edge descent vehicles. Using the example of the descent vehicles of Soyuz and Apollo class, the article shows a dependence of the raising weight of a descent vehicle on the free volume of its pressure cockpit. Attention is drawn to the fact that the limit of increasing free space of the spacecraft compartments to achieve maximum comfort should correspond to a set of functions that the crew performs in the compartments considered. Otherwise, the increase in the spacecraft mass will prove to be unjustified. The results stated in the article can be useful to developers of manned spacecraft, as well as to teachers and students. In the long term it is worthwhile adding the article material with the mass and volume indicators, as well as with the estimate results of the comfort level of modern manned spacecrafts being under design in Russia and USA, such as PTK NP (“Federation”, “Orion”, “Dragon V2”.

British Standard method for determination of ISO speed and average gradient of direct-exposure medical and dental radiographic film/process combinations

International Nuclear Information System (INIS)

1983-01-01

Under the direction of the Cinematography and Photography Standards Committee, a British Standard method has been prepared for determining ISO speed and average gradient of direct-exposure medical and dental radiographic film/film-process combinations. The method determines the speed and gradient, i.e. contrast, of the X-ray films processed according to their manufacturer's recommendations. (U.K.)

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

International Nuclear Information System (INIS)

Kuo-Petravic, G.; Petravic, M.

1978-04-01

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

NONLINEAR FILTER METHOD OF GPS DYNAMIC POSITIONING BASED ON BANCROFT ALGORITHM

Institute of Scientific and Technical Information of China (English)

ZHANGQin; TAOBen-zao; ZHAOChao-ying; WANGLi

2005-01-01

Because of the ignored items after linearization, the extended Kalman filter (EKF) becomes a form of suboptimal gradient descent algorithm. The emanative tendency exists in GPS solution when the filter equations are ill-posed. The deviation in the estimation cannot be avoided. Furthermore, the true solution may be lost in pseudorange positioning because the linearized pseudorange equations are partial solutions. To solve the above problems in GPS dynamic positioning by using EKF, a closed-form Kalman filter method called the two-stage algorithm is presented for the nonlinear algebraic solution of GPS dynamic positioning based on the global nonlinear least squares closed algorithm--Bancroft numerical algorithm of American. The method separates the spatial parts from temporal parts during processing the GPS filter problems, and solves the nonlinear GPS dynamic positioning, thus getting stable and reliable dynamic positioning solutions.

Patterns of macromycete community assemblage along an elevation gradient: options for fungal gradient and metacommunity analyse

Science.gov (United States)

Marko Gómez-Hernández; Guadalupe Williams-Linera; Roger Guevara; D. Jean Lodge

2012-01-01

Gradient analysis is rarely used in studies of fungal communities. Data on macromycetes from eight sites along an elevation gradient in central Veracruz, Mexico, were used to demonstrate methods for gradient analysis that can be applied to studies of communities of fungi. Selected sites from 100 to 3,500 m altitude represent tropical dry forest, tropical montane cloud...

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

Science.gov (United States)

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

2002-09-01

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

Gradient Boosting Machines, A Tutorial

Directory of Open Access Journals (Sweden)

Alexey eNatekin

2013-12-01

Full Text Available Gradient boosting machines are a family of powerful machine-learning techniques that have shown considerable success in a wide range of practical applications. They are highly customizable to the particular needs of the application, like being learned with respect to different loss functions. This article gives a tutorial introduction into the methodology of gradient boosting methods. A theoretical information is complemented with many descriptive examples and illustrations which cover all the stages of the gradient boosting model design. Considerations on handling the model complexity are discussed. A set of practical examples of gradient boosting applications are presented and comprehensively analyzed.

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

Czech Academy of Sciences Publication Activity Database

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

2002-01-01

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

Are pregnant women of non-Northern European descent more anaemic than women of Northern European descent? A study into the prevalence of anaemia in pregnant women in Amsterdam.

NARCIS (Netherlands)

Jans, S.M.; Daemers, D.O.A.; Vos, R.; Lagro-Janssen, A.L.M.

2009-01-01

OBJECTIVES: to investigate the prevalence of anaemia in pregnancy according to the cut-off points used in the national clinical guideline 'Anaemia in Primary Care Midwifery Practice', and to investigate a possible difference in prevalence between pregnant women of Northern European descent compared

Gradient pre-emphasis to counteract first-order concomitant fields on asymmetric MRI gradient systems.

Science.gov (United States)

Tao, Shengzhen; Weavers, Paul T; Trzasko, Joshua D; Shu, Yunhong; Huston, John; Lee, Seung-Kyun; Frigo, Louis M; Bernstein, Matt A

2017-06-01

To develop a gradient pre-emphasis scheme that prospectively counteracts the effects of the first-order concomitant fields for any arbitrary gradient waveform played on asymmetric gradient systems, and to demonstrate the effectiveness of this approach using a real-time implementation on a compact gradient system. After reviewing the first-order concomitant fields that are present on asymmetric gradients, we developed a generalized gradient pre-emphasis model assuming arbitrary gradient waveforms to counteract their effects. A numerically straightforward, easily implemented approximate solution to this pre-emphasis problem was derived that was compatible with the current hardware infrastructure of conventional MRI scanners for eddy current compensation. The proposed method was implemented on the gradient driver subsystem, and its real-time use was tested using a series of phantom and in vivo data acquired from two-dimensional Cartesian phase-difference, echo-planar imaging, and spiral acquisitions. The phantom and in vivo results demonstrated that unless accounted for, first-order concomitant fields introduce considerable phase estimation error into the measured data and result in images with spatially dependent blurring/distortion. The resulting artifacts were effectively prevented using the proposed gradient pre-emphasis. We have developed an efficient and effective gradient pre-emphasis framework to counteract the effects of first-order concomitant fields of asymmetric gradient systems. Magn Reson Med 77:2250-2262, 2017. © 2016 International Society for Magnetic Resonance in Medicine. © 2016 International Society for Magnetic Resonance in Medicine.

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

Science.gov (United States)

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.

Active semi-supervised learning method with hybrid deep belief networks.

Science.gov (United States)

Zhou, Shusen; Chen, Qingcai; Wang, Xiaolong

2014-01-01

In this paper, we develop a novel semi-supervised learning algorithm called active hybrid deep belief networks (AHD), to address the semi-supervised sentiment classification problem with deep learning. First, we construct the previous several hidden layers using restricted Boltzmann machines (RBM), which can reduce the dimension and abstract the information of the reviews quickly. Second, we construct the following hidden layers using convolutional restricted Boltzmann machines (CRBM), which can abstract the information of reviews effectively. Third, the constructed deep architecture is fine-tuned by gradient-descent based supervised learning with an exponential loss function. Finally, active learning method is combined based on the proposed deep architecture. We did several experiments on five sentiment classification datasets, and show that AHD is competitive with previous semi-supervised learning algorithm. Experiments are also conducted to verify the effectiveness of our proposed method with different number of labeled reviews and unlabeled reviews respectively.

Method and means for a spatial and temporal probe for laser-generated plumes based on density gradients

Science.gov (United States)

Yeung, E.S.; Chen, G.

1990-05-01

A method and means are disclosed for a spatial and temporal probe for laser generated plumes based on density gradients includes generation of a plume of vaporized material from a surface by an energy source. The probe laser beam is positioned so that the plume passes through the probe laser beam. Movement of the probe laser beam caused by refraction from the density gradient of the plume is monitored. Spatial and temporal information, correlated to one another, is then derived. 15 figs.

Dose gradient curve: A new tool for evaluating dose gradient.

Science.gov (United States)

Sung, KiHoon; Choi, Young Eun

2018-01-01

Stereotactic radiotherapy, which delivers an ablative high radiation dose to a target volume for maximum local tumor control, requires a rapid dose fall-off outside the target volume to prevent extensive damage to nearby normal tissue. Currently, there is no tool to comprehensively evaluate the dose gradient near the target volume. We propose the dose gradient curve (DGC) as a new tool to evaluate the quality of a treatment plan with respect to the dose fall-off characteristics. The average distance between two isodose surfaces was represented by the dose gradient index (DGI) estimated by a simple equation using the volume and surface area of isodose levels. The surface area was calculated by mesh generation and surface triangulation. The DGC was defined as a plot of the DGI of each dose interval as a function of the dose. Two types of DGCs, differential and cumulative, were generated. The performance of the DGC was evaluated using stereotactic radiosurgery plans for virtual targets. Over the range of dose distributions, the dose gradient of each dose interval was well-characterized by the DGC in an easily understandable graph format. Significant changes in the DGC were observed reflecting the differences in planning situations and various prescription doses. The DGC is a rational method for visualizing the dose gradient as the average distance between two isodose surfaces; the shorter the distance, the steeper the dose gradient. By combining the DGC with the dose-volume histogram (DVH) in a single plot, the DGC can be utilized to evaluate not only the dose gradient but also the target coverage in routine clinical practice.

Rapid Gradient-Echo Imaging

Science.gov (United States)

Hargreaves, Brian

2012-01-01

Gradient echo sequences are widely used in magnetic resonance imaging (MRI) for numerous applications ranging from angiography to perfusion to functional MRI. Compared with spin-echo techniques, the very short repetition times of gradient-echo methods enable very rapid 2D and 3D imaging, but also lead to complicated “steady states.” Signal and contrast behavior can be described graphically and mathematically, and depends strongly on the type of spoiling: fully balanced (no spoiling), gradient spoiling, or RF-spoiling. These spoiling options trade off between high signal and pure T1 contrast while the flip angle also affects image contrast in all cases, both of which can be demonstrated theoretically and in image examples. As with spin-echo sequences, magnetization preparation can be added to gradient-echo sequences to alter image contrast. Gradient echo sequences are widely used for numerous applications such as 3D perfusion imaging, functional MRI, cardiac imaging and MR angiography. PMID:23097185

Comparative analysis of gradient-field-based orientation estimation methods and regularized singular-value decomposition for fringe pattern processing.

Science.gov (United States)

Sun, Qi; Fu, Shujun

2017-09-20

Fringe orientation is an important feature of fringe patterns and has a wide range of applications such as guiding fringe pattern filtering, phase unwrapping, and abstraction. Estimating fringe orientation is a basic task for subsequent processing of fringe patterns. However, various noise, singular and obscure points, and orientation data degeneration lead to inaccurate calculations of fringe orientation. Thus, to deepen the understanding of orientation estimation and to better guide orientation estimation in fringe pattern processing, some advanced gradient-field-based orientation estimation methods are compared and analyzed. At the same time, following the ideas of smoothing regularization and computing of bigger gradient fields, a regularized singular-value decomposition (RSVD) technique is proposed for fringe orientation estimation. To compare the performance of these gradient-field-based methods, quantitative results and visual effect maps of orientation estimation are given on simulated and real fringe patterns that demonstrate that the RSVD produces the best estimation results at a cost of relatively less time.

Strain gradient effects on cyclic plasticity

DEFF Research Database (Denmark)

Niordson, Christian Frithiof; Legarth, Brian Nyvang

2010-01-01

Size effects on the cyclic shear response are studied numerically using a recent higher order strain gradient visco-plasticity theory accounting for both dissipative and energetic gradient hardening. Numerical investigations of the response under cyclic pure shear and shear of a finite slab between...... rigid platens have been carried out, using the finite element method. It is shown for elastic–perfectly plastic solids how dissipative gradient effects lead to increased yield strength, whereas energetic gradient contributions lead to increased hardening as well as a Bauschinger effect. For linearly...... hardening materials it is quantified how dissipative and energetic gradient effects promote hardening above that of conventional predictions. Usually, increased hardening is attributed to energetic gradient effects, but here it is found that also dissipative gradient effects lead to additional hardening...

A New Interpolation Approach for Linearly Constrained Convex Optimization

KAUST Repository

Espinoza, Francisco

2012-08-01

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

Empirical analysis of the effect of descent flight path angle on primary gaseous emissions of commercial aircraft.

Science.gov (United States)

Turgut, Enis T; Usanmaz, Oznur; Rosen, Marc A

2018-05-01

In this study, the effects of descent flight path angle (between 1.25° and 4.25°) on aircraft gaseous emissions (carbon monoxide, total hydrocarbons and nitrogen oxides) are explored using actual flight data from aircraft flight data recording system and emissions indices from the International Civil Aviation Organization. All emissions parameters are corrected to flight conditions using Boeing Fuel Flow Method2, where the ambient air pressure, temperature and humidity data are obtained from long-term radiosonde data measured close to the arrival airport. The main findings highlight that the higher the flight path angle, the higher the emission indices of CO and HC, whereas the lower the emissions index of NO x and fuel consumption. Furthermore, during a descent, a heavier aircraft tends to emit less CO and HC, and more NO x . For a five-tonne aircraft mass increase, the average change in emissions indices are found to be -4.1% and -5.7% (CO), -5.4% and -8.2% (HC), and +1.1% and +1.6% (NO x ) for high and low flight path angle groups, respectively. The average emissions indices for CO, HC and NO x during descent are calculated to be 24.5, 1.7 and 5.6 g/kg of fuel, whereas the average emissions for descending from 32,000 ft (9.7 km) and 24,000 ft (7.3 km) are calculated to be 7-8 kg (CO), ∼0.5 kg (HC) and ∼3 kg (NO x ). Copyright © 2018 Elsevier Ltd. All rights reserved.

Are pregnant women of non-Northern European descent more anaemic than women of Northern European descent? A study into the prevalence of anaemia in pregnant women in Amsterdam

NARCIS (Netherlands)

Jans, S. M. P. J.; Daemers, D. O. A.; de Vos, R.; Lagro-Jansen, A. L. M.

2009-01-01

to investigate the prevalence of anaemia in pregnancy according to the cut-off points used in the national clinical guideline 'Anaemia in Primary Care Midwifery Practice', and to investigate a possible difference in prevalence between pregnant women of Northern European descent compared with women

Are pregnant women of non-Northern European descent more anaemic than women of Northern European descent? A study into the prevalence of anaemia in pregnant women in Amsterdam

NARCIS (Netherlands)

Jans, S.M.P.J.; Daemers, D.O.A.; Vos, R. de; Lagro-Janssen, A.L.M.

2009-01-01

Objectives - to investigate the prevalence of anaemia in pregnancy according to the cut-off points used in the national clinical guideline ‘Anaemia in Primary Care Midwifery Practice’, and to investigate a possible difference in prevalence between pregnant women of Northern European descent compared

Cultivo de células mesenquimais do sangue de cordão umbilical com e sem uso do gradiente de densidade Ficoll-Paque Blood mesenchymal stem cell culture from the umbilical cord with and without Ficoll-Paque density gradient method

Directory of Open Access Journals (Sweden)

Rosa Sayoko Kawasaki-Oyama

2008-03-01

Ficoll-Paque gradient density method (d=1.077g/ml. METHODS: Ten samples of the umbilical cord blood obtained from full-term deliveries were submitted to two different procedures of mesenchymal stem cell culture: a Method without the Ficoll-Paque density gradient, which concentrates all nucleated cells; b Method with the Ficoll-Paque density gradient, which selects only low-density mononuclear cells. Cells were initially plated into 25 cm² cultures flasks at a density of 1x10(7 nucleated cells/cm² and 1x10(6 mononuclear cells/cm². RESULTS: It was obtained 2-13x10(7 (median = 2.35x10(7 nucleated cells/cm² by the method without the Ficoll-Paque gradient density, and 3.7-15.7x10(6 (median = 7.2x10(6 mononuclear cells/cm² by the method with the Ficoll-Paque gradient density. In all cultures adherent cells were observed 24 hours after being cultured. Cells presented fibroblastoid and epithelioid morphology. In most of the cultures, cell proliferation occurred in the first week, but after the second week only some cultures - derived from the method without the Ficoll-Paque gradient density - maintained the growth rate reaching confluence. Those cultures were submitted to trypsinization with 0.25% trypsin/EDTA solution and cultured for two to three months. CONCLUSION: In the samples analyzed, cell separation and mesenchymal stem cell culture techniques from human umbilical cord blood by the method without the Ficoll-Paque density gradient was more efficient than the method with the Ficoll-Paque density gradient.

Natural selection and the distribution of identity-by-descent in the human genome

DEFF Research Database (Denmark)

Albrechtsen, Anders; Moltke, Ida; Nielsen, Rasmus

2010-01-01

There has recently been considerable interest in detecting natural selection in the human genome. Selection will usually tend to increase identity-by-descent (IBD) among individuals in a population, and many methods for detecting recent and ongoing positive selection indirectly take advantage...... of this. In this article we show that excess IBD sharing is a general property of natural selection and we show that this fact makes it possible to detect several types of selection including a type that is otherwise difficult to detect: selection acting on standing genetic variation. Motivated by this......, we use a recently developed method for identifying IBD sharing among individuals from genome-wide data to scan populations from the new HapMap phase 3 project for regions with excess IBD sharing in order to identify regions in the human genome that have been under strong, very recent selection...

Anticipatory kinematics and muscle activity preceding transitions from level-ground walking to stair ascent and descent.

Science.gov (United States)

Peng, Joshua; Fey, Nicholas P; Kuiken, Todd A; Hargrove, Levi J

2016-02-29

The majority of fall-related accidents are during stair ambulation-occurring commonly at the top and bottom stairs of each flight, locations in which individuals are transitioning to stairs. Little is known about how individuals adjust their biomechanics in anticipation of walking-stair transitions. We identified the anticipatory stride mechanics of nine able-bodied individuals as they approached transitions from level ground walking to stair ascent and descent. Unlike prior investigations of stair ambulation, we analyzed two consecutive "anticipation" strides preceding the transitions strides to stairs, and tested a comprehensive set of kinematic and electromyographic (EMG) data from both the leading and trailing legs. Subjects completed ten trials of baseline overground walking and ten trials of walking to stair ascent and descent. Deviations relative to baseline were assessed. Significant changes in mechanics and EMG occurred in the earliest anticipation strides analyzed for both ascent and descent transitions. For stair descent, these changes were consistent with observed reductions in walking speed, which occurred in all anticipation strides tested. For stair ascent, subjects maintained their speed until the swing phase of the latest anticipation stride, and changes were found that would normally be observed for decreasing speed. Given the timing and nature of the observed changes, this study has implications for enhancing intent recognition systems and evaluating fall-prone or disabled individuals, by testing their abilities to sense upcoming transitions and decelerate during locomotion. Copyright © 2016 Elsevier Ltd. All rights reserved.

Probability density function method for variable-density pressure-gradient-driven turbulence and mixing

International Nuclear Information System (INIS)

Bakosi, Jozsef; Ristorcelli, Raymond J.

2010-01-01

Probability density function (PDF) methods are extended to variable-density pressure-gradient-driven turbulence. We apply the new method to compute the joint PDF of density and velocity in a non-premixed binary mixture of different-density molecularly mixing fluids under gravity. The full time-evolution of the joint PDF is captured in the highly non-equilibrium flow: starting from a quiescent state, transitioning to fully developed turbulence and finally dissipated by molecular diffusion. High-Atwood-number effects (as distinguished from the Boussinesq case) are accounted for: both hydrodynamic turbulence and material mixing are treated at arbitrary density ratios, with the specific volume, mass flux and all their correlations in closed form. An extension of the generalized Langevin model, originally developed for the Lagrangian fluid particle velocity in constant-density shear-driven turbulence, is constructed for variable-density pressure-gradient-driven flows. The persistent small-scale anisotropy, a fundamentally 'non-Kolmogorovian' feature of flows under external acceleration forces, is captured by a tensorial diffusion term based on the external body force. The material mixing model for the fluid density, an active scalar, is developed based on the beta distribution. The beta-PDF is shown to be capable of capturing the mixing asymmetry and that it can accurately represent the density through transition, in fully developed turbulence and in the decay process. The joint model for hydrodynamics and active material mixing yields a time-accurate evolution of the turbulent kinetic energy and Reynolds stress anisotropy without resorting to gradient diffusion hypotheses, and represents the mixing state by the density PDF itself, eliminating the need for dubious mixing measures. Direct numerical simulations of the homogeneous Rayleigh-Taylor instability are used for model validation.

Nurses of African descent and career advancement.

Science.gov (United States)

Wesley, Yvonne; Dobal, May T

2009-01-01

The purpose of this article is to evaluate a leadership institute designed to promote career advancement and leadership in administration, education, and research among nurses of African descent. Government reports indicate that Black Americans receive lower quality health care than other racial groups even when insurance and income are equal. Moreover, the literature suggests that less than 10% of practicing professional nurses in America are Black-and of these, less than 1% are in senior executive leadership positions. However, the literature lacks detailed discussion of the effectiveness of leadership programs. This article provides an in-depth look at a leadership institute for Black nurses and outlines the impact of the program.

Comparison of gradient methods for gain tuning of a PD controller applied on a quadrotor system

Science.gov (United States)

Kim, Jinho; Wilkerson, Stephen A.; Gadsden, S. Andrew

2016-05-01

Many mechanical and electrical systems have utilized the proportional-integral-derivative (PID) control strategy. The concept of PID control is a classical approach but it is easy to implement and yields a very good tracking performance. Unmanned aerial vehicles (UAVs) are currently experiencing a significant growth in popularity. Due to the advantages of PID controllers, UAVs are implementing PID controllers for improved stability and performance. An important consideration for the system is the selection of PID gain values in order to achieve a safe flight and successful mission. There are a number of different algorithms that can be used for real-time tuning of gains. This paper presents two algorithms for gain tuning, and are based on the method of steepest descent and Newton's minimization of an objective function. This paper compares the results of applying these two gain tuning algorithms in conjunction with a PD controller on a quadrotor system.

Frequency Analysis of Gradient Estimators in Volume Rendering

NARCIS (Netherlands)

Bentum, Marinus Jan; Lichtenbelt, Barthold B.A.; Malzbender, Tom

1996-01-01

Gradient information is used in volume rendering to classify and color samples along a ray. In this paper, we present an analysis of the theoretically ideal gradient estimator and compare it to some commonly used gradient estimators. A new method is presented to calculate the gradient at arbitrary

On Equivalence between Optimality Criteria and Projected Gradient Methods with Application to Topology Optimization Problem

OpenAIRE

Ananiev, Sergey

2006-01-01

The paper demonstrates the equivalence between the optimality criteria (OC) method, initially proposed by Bendsoe & Kikuchi for topology optimization problem, and the projected gradient method. The equivalence is shown using Hestenes definition of Lagrange multipliers. Based on this development, an alternative formulation of the Karush-Kuhn-Tucker (KKT) condition is suggested. Such reformulation has some advantages, which will be also discussed in the paper. For verification purposes the modi...

What Is the Best Way to Contour Lung Tumors on PET Scans? Multiobserver Validation of a Gradient-Based Method Using a NSCLC Digital PET Phantom

Energy Technology Data Exchange (ETDEWEB)

Werner-Wasik, Maria, E-mail: Maria.Werner-wasik@jeffersonhospital.org [Department of Radiation Oncology, Thomas Jefferson University Hospital, Philadelphia, PA (United States); Nelson, Arden D. [MIM Software Inc., Cleveland, OH (United States); Choi, Walter [Department of Radiation Oncology, UPMC Health Systems, Pittsburgh, PA (United States); Arai, Yoshio [Department of Radiation Oncology, Beth Israel Medical Center, New York, NY (Israel); Faulhaber, Peter F. [University Hospitals Case Medical Center, Cleveland, OH (United States); Kang, Patrick [Department of Radiology, Beth Israel Medical Center, New York, NY (Israel); Almeida, Fabio D. [Division of Nuclear Medicine, University of Arizona Health Sciences Center, Tucson, AZ (United States); Xiao, Ying; Ohri, Nitin [Department of Radiation Oncology, Thomas Jefferson University Hospital, Philadelphia, PA (United States); Brockway, Kristin D.; Piper, Jonathan W.; Nelson, Aaron S. [MIM Software Inc., Cleveland, OH (United States)

2012-03-01

Purpose: To evaluate the accuracy and consistency of a gradient-based positron emission tomography (PET) segmentation method, GRADIENT, compared with manual (MANUAL) and constant threshold (THRESHOLD) methods. Methods and Materials: Contouring accuracy was evaluated with sphere phantoms and clinically realistic Monte Carlo PET phantoms of the thorax. The sphere phantoms were 10-37 mm in diameter and were acquired at five institutions emulating clinical conditions. One institution also acquired a sphere phantom with multiple source-to-background ratios of 2:1, 5:1, 10:1, 20:1, and 70:1. One observer segmented (contoured) each sphere with GRADIENT and THRESHOLD from 25% to 50% at 5% increments. Subsequently, seven physicians segmented 31 lesions (7-264 mL) from 25 digital thorax phantoms using GRADIENT, THRESHOLD, and MANUAL. Results: For spheres <20 mm in diameter, GRADIENT was the most accurate with a mean absolute % error in diameter of 8.15% (10.2% SD) compared with 49.2% (51.1% SD) for 45% THRESHOLD (p < 0.005). For larger spheres, the methods were statistically equivalent. For varying source-to-background ratios, GRADIENT was the most accurate for spheres >20 mm (p < 0.065) and <20 mm (p < 0.015). For digital thorax phantoms, GRADIENT was the most accurate (p < 0.01), with a mean absolute % error in volume of 10.99% (11.9% SD), followed by 25% THRESHOLD at 17.5% (29.4% SD), and MANUAL at 19.5% (17.2% SD). GRADIENT had the least systematic bias, with a mean % error in volume of -0.05% (16.2% SD) compared with 25% THRESHOLD at -2.1% (34.2% SD) and MANUAL at -16.3% (20.2% SD; p value <0.01). Interobserver variability was reduced using GRADIENT compared with both 25% THRESHOLD and MANUAL (p value <0.01, Levene's test). Conclusion: GRADIENT was the most accurate and consistent technique for target volume contouring. GRADIENT was also the most robust for varying imaging conditions. GRADIENT has the potential to play an important role for tumor delineation in

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

International Nuclear Information System (INIS)

Dinh Nho Hao; Nguyen Trung Thanh; Sahli, Hichem

2008-01-01

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

Atmospheric Mars Entry and Landing Investigations & Analysis (AMELIA) by ExoMars 2016 Schiaparelli Entry Descent Module

Science.gov (United States)

Ferri, F.; Karatekin, O.; Aboudan, A.; VanHove, B.; Colombatti, C.; Bettanini, C.; Debei, S.; Lewis, S.; Forget, F.

2017-09-01

On the 19th October 2016, Schiaparelli, the Entry Demonstrator Module (EDM) of the ESA ExoMars Program entered into the martian atmosphere. Although it did not complete a safe landing on Mars, it transmitted data throughout its descent to the surface, until the loss of signal at 1 minute before the expected touch-down on Mars' surface. From the flight data, we reconstruct the actual dynamics of the vehicle during its descent towards Mars's surface and retrieve the atmospheric profile, in terms of density, pressure and temperature, along its trajectory for atmospheric investigations.

Two-way regularization for MEG source reconstruction via multilevel coordinate descent

KAUST Repository

Siva Tian, Tian

2013-12-01

Magnetoencephalography (MEG) source reconstruction refers to the inverse problem of recovering the neural activity from the MEG time course measurements. A spatiotemporal two-way regularization (TWR) method was recently proposed by Tian et al. to solve this inverse problem and was shown to outperform several one-way regularization methods and spatiotemporal methods. This TWR method is a two-stage procedure that first obtains a raw estimate of the source signals and then refines the raw estimate to ensure spatial focality and temporal smoothness using spatiotemporal regularized matrix decomposition. Although proven to be effective, the performance of two-stage TWR depends on the quality of the raw estimate. In this paper we directly solve the MEG source reconstruction problem using a multivariate penalized regression where the number of variables is much larger than the number of cases. A special feature of this regression is that the regression coefficient matrix has a spatiotemporal two-way structure that naturally invites a two-way penalty. Making use of this structure, we develop a computationally efficient multilevel coordinate descent algorithm to implement the method. This new one-stage TWR method has shown its superiority to the two-stage TWR method in three simulation studies with different levels of complexity and a real-world MEG data analysis. © 2013 Wiley Periodicals, Inc., A Wiley Company.

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

Science.gov (United States)

Freund, Roland

1988-01-01

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

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

Science.gov (United States)

Saxena, N. K.

1974-01-01

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

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

Science.gov (United States)

Paletou, F.; Anterrieu, E.

2009-12-01

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

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

Science.gov (United States)

Dorri, Fatemeh; Azmi, Paeiz; Dorri, Faezeh

2012-02-01

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

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

International Nuclear Information System (INIS)

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

1994-01-01

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

Collisional transport in a plasma with steep gradients

International Nuclear Information System (INIS)

Wang, W.; Okamoto, M.; Nakajima, N.; Murakami, S.

1999-06-01

The validity is given to the newly proposed two δf method for neoclassical transport calculation, which can be solve the drift kinetic equation considering effects of steep plasma gradients, large radial electric field, finite banana width, and an orbit topology near the axis. The new method is applied to the study of ion transport with steep plasma gradients. It is found that the ion thermal diffusivity decreases as the scale length of density gradient decreases, while the ion particle flux due to ion-ion self collisions increases with increasing gradient. (author)

A self-reference PRF-shift MR thermometry method utilizing the phase gradient

International Nuclear Information System (INIS)

Langley, Jason; Potter, William; Phipps, Corey; Zhao Qun; Huang Feng

2011-01-01

In magnetic resonance (MR) imaging, the most widely used and accurate method for measuring temperature is based on the shift in proton resonance frequency (PRF). However, inter-scan motion and bulk magnetic field shifts can lead to inaccurate temperature measurements in the PRF-shift MR thermometry method. The self-reference PRF-shift MR thermometry method was introduced to overcome such problems by deriving a reference image from the heated or treated image, and approximates the reference phase map with low-order polynomial functions. In this note, a new approach is presented to calculate the baseline phase map in self-reference PRF-shift MR thermometry. The proposed method utilizes the phase gradient to remove the phase unwrapping step inherent to other self-reference PRF-shift MR thermometry methods. The performance of the proposed method was evaluated using numerical simulations with temperature distributions following a two-dimensional Gaussian function as well as phantom and in vivo experimental data sets. The results from both the numerical simulations and experimental data show that the proposed method is a promising technique for measuring temperature. (note)

Learning Unknown Structure in CRFs via Adaptive Gradient Projection Method

Directory of Open Access Journals (Sweden)

Wei Xue

2016-08-01

Full Text Available We study the problem of fitting probabilistic graphical models to the given data when the structure is not known. More specifically, we focus on learning unknown structure in conditional random fields, especially learning both the structure and parameters of a conditional random field model simultaneously. To do this, we first formulate the learning problem as a convex minimization problem by adding an l_2-regularization to the node parameters and a group l_1-regularization to the edge parameters, and then a gradient-based projection method is proposed to solve it which combines an adaptive stepsize selection strategy with a nonmonotone line search. Extensive simulation experiments are presented to show the performance of our approach in solving unknown structure learning problems.

Trajectory Guidance for Mars Robotic Precursors: Aerocapture, Entry, Descent, and Landing

Science.gov (United States)

Sostaric, Ronald R.; Zumwalt, Carlie; Garcia-Llama, Eduardo; Powell, Richard; Shidner, Jeremy

2011-01-01

Future crewed missions to Mars require improvements in landed mass capability beyond that which is possible using state-of-the-art Mars Entry, Descent, and Landing (EDL) systems. Current systems are capable of an estimated maximum landed mass of 1-1.5 metric tons (MT), while human Mars studies require 20-40 MT. A set of technologies were investigated by the EDL Systems Analysis (SA) project to assess the performance of candidate EDL architectures. A single architecture was selected for the design of a robotic precursor mission, entitled Exploration Feed Forward (EFF), whose objective is to demonstrate these technologies. In particular, inflatable aerodynamic decelerators (IADs) and supersonic retro-propulsion (SRP) have been shown to have the greatest mass benefit and extensibility to future exploration missions. In order to evaluate these technologies and develop the mission, candidate guidance algorithms have been coded into the simulation for the purposes of studying system performance. These guidance algorithms include aerocapture, entry, and powered descent. The performance of the algorithms for each of these phases in the presence of dispersions has been assessed using a Monte Carlo technique.

Changes in labial capillary density on ascent to and descent from high altitude [version 1; referees: 2 approved

Directory of Open Access Journals (Sweden)

Edward Gilbert-Kawai

2016-08-01

Full Text Available Present knowledge of how the microcirculation is altered by prolonged exposure to hypoxia at high altitude is incomplete and modification of existing analytical techniques may improve our knowledge considerably. We set out to use a novel simplified method of measuring in vivo capillary density during an expedition to high altitude using a CytoCam incident dark field imaging video-microscope. The simplified method of data capture involved recording one-second images of the mucosal surface of the inner lip to reveal data about microvasculature density in ten individuals. This was done on ascent to, and descent from, high altitude. Analysis was conducted offline by two independent investigators blinded to the participant identity, testing conditions and the imaging site.  Additionally we monitored haemoglobin concentration and haematocrit data to see if we could support or refute mechanisms of altered density relating to vessel recruitment. Repeated sets of paired values were compared using Kruskall Wallis Analysis of Variance tests, whilst comparisons of values between sites was by related samples Wilcoxon Signed Rank Test. Correlation between different variables was performed using Spearman’s rank correlation coefficient, and concordance between analysing investigators using intra-class correlation coefficient. There was a significant increase in capillary density from London on ascent to high altitude; median capillaries per field of view area increased from 22.8 to 25.3 (p=0.021. There was a further increase in vessel density during the six weeks spent at altitude (25.3 to 32.5, p=0.017. Moreover, vessel density remained high on descent to Kathmandu (31.0 capillaries per field of view area, despite a significant decrease in haemoglobin concentration and haematocrit. Using a simplified technique, we have demonstrated an increase in capillary density on early and sustained exposure to hypobaric hypoxia at thigh altitude, and that this remains

'The full has never been told': building a theory of sexual health for heterosexual Black men of Caribbean descent.

Science.gov (United States)

Crowell, Candice N; Delgado-Romero, Edward A; Mosley, Della V; Huynh, Sophia

2016-08-01

Research on Black sexual health often fails to represent the heterogeneity of Black ethnic groups. For people of Caribbean descent in the USA, ethnicity is a salient cultural factor that influences definitions and experiences of sexual health. Most research on people of Caribbean descent focuses on the relatively high rate of STIs, but sexual health is defined more broadly than STI prevalence. Psychological and emotional indicators and the voice of participants are important to consider when exploring the sexual health of a minority culture. The purpose of this study was to qualitatively explore how heterosexual Black men of Caribbean descent define and understand sexual health for themselves. Eleven men who self-identified as Black, Caribbean and heterosexual participated in three focus groups and were asked to define sexual health, critique behaviours expertly identified as healthy and address what encourages and discourages sexual health in their lives. Findings point to six dimensions of sexual health for heterosexual Black men of Caribbean descent. These include: heterosexually privileged, protective, contextual, interpersonal, cultural and pleasurable dimensions. There were some notable departures from current expert definitions of sexual health. Recommendations for further theory development are provided.

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

Directory of Open Access Journals (Sweden)

Wang YaLin

2009-01-01

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

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

International Nuclear Information System (INIS)

Biffle, J.H.

1991-01-01

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

Gradients estimation from random points with volumetric tensor in turbulence

Science.gov (United States)

Watanabe, Tomoaki; Nagata, Koji

2017-12-01

We present an estimation method of fully-resolved/coarse-grained gradients from randomly distributed points in turbulence. The method is based on a linear approximation of spatial gradients expressed with the volumetric tensor, which is a 3 × 3 matrix determined by a geometric distribution of the points. The coarse grained gradient can be considered as a low pass filtered gradient, whose cutoff is estimated with the eigenvalues of the volumetric tensor. The present method, the volumetric tensor approximation, is tested for velocity and passive scalar gradients in incompressible planar jet and mixing layer. Comparison with a finite difference approximation on a Cartesian grid shows that the volumetric tensor approximation computes the coarse grained gradients fairly well at a moderate computational cost under various conditions of spatial distributions of points. We also show that imposing the solenoidal condition improves the accuracy of the present method for solenoidal vectors, such as a velocity vector in incompressible flows, especially when the number of the points is not large. The volumetric tensor approximation with 4 points poorly estimates the gradient because of anisotropic distribution of the points. Increasing the number of points from 4 significantly improves the accuracy. Although the coarse grained gradient changes with the cutoff length, the volumetric tensor approximation yields the coarse grained gradient whose magnitude is close to the one obtained by the finite difference. We also show that the velocity gradient estimated with the present method well captures the turbulence characteristics such as local flow topology, amplification of enstrophy and strain, and energy transfer across scales.

A Robust Gradient Based Method for Building Extraction from LiDAR and Photogrammetric Imagery

Directory of Open Access Journals (Sweden)

Fasahat Ullah Siddiqui

2016-07-01

Full Text Available Existing automatic building extraction methods are not effective in extracting buildings which are small in size and have transparent roofs. The application of large area threshold prohibits detection of small buildings and the use of ground points in generating the building mask prevents detection of transparent buildings. In addition, the existing methods use numerous parameters to extract buildings in complex environments, e.g., hilly area and high vegetation. However, the empirical tuning of large number of parameters reduces the robustness of building extraction methods. This paper proposes a novel Gradient-based Building Extraction (GBE method to address these limitations. The proposed method transforms the Light Detection And Ranging (LiDAR height information into intensity image without interpolation of point heights and then analyses the gradient information in the image. Generally, building roof planes have a constant height change along the slope of a roof plane whereas trees have a random height change. With such an analysis, buildings of a greater range of sizes with a transparent or opaque roof can be extracted. In addition, a local colour matching approach is introduced as a post-processing stage to eliminate trees. This stage of our proposed method does not require any manual setting and all parameters are set automatically from the data. The other post processing stages including variance, point density and shadow elimination are also applied to verify the extracted buildings, where comparatively fewer empirically set parameters are used. The performance of the proposed GBE method is evaluated on two benchmark data sets by using the object and pixel based metrics (completeness, correctness and quality. Our experimental results show the effectiveness of the proposed method in eliminating trees, extracting buildings of all sizes, and extracting buildings with and without transparent roof. When compared with current state

Gradient algorithm applied to laboratory quantum control

International Nuclear Information System (INIS)

Roslund, Jonathan; Rabitz, Herschel

2009-01-01

The exploration of a quantum control landscape, which is the physical observable as a function of the control variables, is fundamental for understanding the ability to perform observable optimization in the laboratory. For high control variable dimensions, trajectory-based methods provide a means for performing such systematic explorations by exploiting the measured gradient of the observable with respect to the control variables. This paper presents a practical, robust, easily implemented statistical method for obtaining the gradient on a general quantum control landscape in the presence of noise. In order to demonstrate the method's utility, the experimentally measured gradient is utilized as input in steepest-ascent trajectories on the landscapes of three model quantum control problems: spectrally filtered and integrated second harmonic generation as well as excitation of atomic rubidium. The gradient algorithm achieves efficiency gains of up to approximately three times that of the standard genetic algorithm and, as such, is a promising tool for meeting quantum control optimization goals as well as landscape analyses. The landscape trajectories directed by the gradient should aid in the continued investigation and understanding of controlled quantum phenomena.

Predictive Modeling for NASA Entry, Descent and Landing Missions

Science.gov (United States)

Wright, Michael

2016-01-01

Entry, Descent and Landing (EDL) Modeling and Simulation (MS) is an enabling capability for complex NASA entry missions such as MSL and Orion. MS is used in every mission phase to define mission concepts, select appropriate architectures, design EDL systems, quantify margin and risk, ensure correct system operation, and analyze data returned from the entry. In an environment where it is impossible to fully test EDL concepts on the ground prior to use, accurate MS capability is required to extrapolate ground test results to expected flight performance.

What Is the Best Way to Contour Lung Tumors on PET Scans? Multiobserver Validation of a Gradient-Based Method Using a NSCLC Digital PET Phantom

International Nuclear Information System (INIS)

Werner-Wasik, Maria; Nelson, Arden D.; Choi, Walter; Arai, Yoshio; Faulhaber, Peter F.; Kang, Patrick; Almeida, Fabio D.; Xiao, Ying; Ohri, Nitin; Brockway, Kristin D.; Piper, Jonathan W.; Nelson, Aaron S.

2012-01-01

Purpose: To evaluate the accuracy and consistency of a gradient-based positron emission tomography (PET) segmentation method, GRADIENT, compared with manual (MANUAL) and constant threshold (THRESHOLD) methods. Methods and Materials: Contouring accuracy was evaluated with sphere phantoms and clinically realistic Monte Carlo PET phantoms of the thorax. The sphere phantoms were 10–37 mm in diameter and were acquired at five institutions emulating clinical conditions. One institution also acquired a sphere phantom with multiple source-to-background ratios of 2:1, 5:1, 10:1, 20:1, and 70:1. One observer segmented (contoured) each sphere with GRADIENT and THRESHOLD from 25% to 50% at 5% increments. Subsequently, seven physicians segmented 31 lesions (7–264 mL) from 25 digital thorax phantoms using GRADIENT, THRESHOLD, and MANUAL. Results: For spheres 20 mm (p < 0.065) and <20 mm (p < 0.015). For digital thorax phantoms, GRADIENT was the most accurate (p < 0.01), with a mean absolute % error in volume of 10.99% (11.9% SD), followed by 25% THRESHOLD at 17.5% (29.4% SD), and MANUAL at 19.5% (17.2% SD). GRADIENT had the least systematic bias, with a mean % error in volume of –0.05% (16.2% SD) compared with 25% THRESHOLD at –2.1% (34.2% SD) and MANUAL at –16.3% (20.2% SD; p value <0.01). Interobserver variability was reduced using GRADIENT compared with both 25% THRESHOLD and MANUAL (p value <0.01, Levene’s test). Conclusion: GRADIENT was the most accurate and consistent technique for target volume contouring. GRADIENT was also the most robust for varying imaging conditions. GRADIENT has the potential to play an important role for tumor delineation in radiation therapy planning and response assessment.

Bone marrow-derived cells for cardiovascular cell therapy: an optimized GMP method based on low-density gradient improves cell purity and function.

Science.gov (United States)

Radrizzani, Marina; Lo Cicero, Viviana; Soncin, Sabrina; Bolis, Sara; Sürder, Daniel; Torre, Tiziano; Siclari, Francesco; Moccetti, Tiziano; Vassalli, Giuseppe; Turchetto, Lucia

2014-09-27

Cardiovascular cell therapy represents a promising field, with several approaches currently being tested. The advanced therapy medicinal product (ATMP) for the ongoing METHOD clinical study ("Bone marrow derived cell therapy in the stable phase of chronic ischemic heart disease") consists of fresh mononuclear cells (MNC) isolated from autologous bone marrow (BM) through density gradient centrifugation on standard Ficoll-Paque. Cells are tested for safety (sterility, endotoxin), identity/potency (cell count, CD45/CD34/CD133, viability) and purity (contaminant granulocytes and platelets). BM-MNC were isolated by density gradient centrifugation on Ficoll-Paque. The following process parameters were optimized throughout the study: gradient medium density; gradient centrifugation speed and duration; washing conditions. A new manufacturing method was set up, based on gradient centrifugation on low density Ficoll-Paque, followed by 2 washing steps, of which the second one at low speed. It led to significantly higher removal of contaminant granulocytes and platelets, improving product purity; the frequencies of CD34+ cells, CD133+ cells and functional hematopoietic and mesenchymal precursors were significantly increased. The methodological optimization described here resulted in a significant improvement of ATMP quality, a crucial issue to clinical applications in cardiovascular cell therapy.

Equivalence of velocity-level and acceleration-level redundancy-resolution of manipulators

International Nuclear Information System (INIS)

Cai Binghuang; Zhang Yunong

2009-01-01

The equivalence of velocity-level and acceleration-level redundancy resolution of robot manipulators is investigated in this Letter. Theoretical analysis based on gradient-descent method and computer simulations based on PUMA560 robot manipulator both demonstrate the equivalence of redundancy-resolution schemes at different levels.

Kinematic analyses during stair descent in young women with patellofemoral pain.

Science.gov (United States)

Grenholm, Anton; Stensdotter, Ann-Katrin; Häger-Ross, Charlotte

2009-01-01

Compensatory movement strategies may develop in response to pain to avoid stress on the affected area. Patellofemoral pain is characterised by intermittent periods of pain and the present study addresses whether long-term pain leads to compensatory movement strategies that remain even when the pain is absent. Lower extremity kinematics in three dimensions was studied in stair descent in 17 women with patellofemoral and in 17 matched controls. A two-dimensional geometric model was constructed to normalise kinematic data for subjects with varying anthropometrics when negotiating stairs of fixed proportions. There were minor differences in movement patterns between groups. Knee joint angular velocity in the stance leg at foot contact was lower and the movement trajectory tended to be jerkier in the patellofemoral group. The two-dimensional model showed greater plantar flexion in the swing leg in preparation for foot placement in the patellofemoral group. The results indicate that an altered stair descent strategy in the patellofemoral group may remain also in the absence of pain. The biomechanical interpretation presumes that the strategy is aimed to reduce knee joint loading by less knee joint moment and lower impact force.

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

Directory of Open Access Journals (Sweden)

Shoubin Wang

2017-01-01

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

Vertical Descent and Landing Tests of a 0.13-Scale Model of the Convair XFY-1 Vertically Rising Airplane in Still Air, TED No. NACA DE 368

Science.gov (United States)

Smith, Charlee C., Jr.; Lovell, Powell M., Jr.

1954-01-01

An investigation is being conducted to determine the dynamic stability and control characteristics of a 0.13-scale flying model of Convair XFY-1 vertically rising airplane. This paper presents the results of flight and force tests to determine the stability and control characteristics of the model in vertical descent and landings in still air. The tests indicated that landings, including vertical descent from altitudes representing up to 400 feet for the full-scale airplane and at rates of descent up to 15 or 20 feet per second (full scale), can be performed satisfactorily. Sustained vertical descent in still air probably will be more difficult to perform because of large random trim changes that become greater as the descent velocity is increased. A slight steady head wind or cross wind might be sufficient to eliminate the random trim changes.

Conjugate gradient algorithms using multiple recursions

Energy Technology Data Exchange (ETDEWEB)

Barth, T.; Manteuffel, T.

1996-12-31

Much is already known about when a conjugate gradient method can be implemented with short recursions for the direction vectors. The work done in 1984 by Faber and Manteuffel gave necessary and sufficient conditions on the iteration matrix A, in order for a conjugate gradient method to be implemented with a single recursion of a certain form. However, this form does not take into account all possible recursions. This became evident when Jagels and Reichel used an algorithm of Gragg for unitary matrices to demonstrate that the class of matrices for which a practical conjugate gradient algorithm exists can be extended to include unitary and shifted unitary matrices. The implementation uses short double recursions for the direction vectors. This motivates the study of multiple recursion algorithms.

Vehicle Staging Analysis of the Transition to Supersonic Retropropulsion During Mars Entry, Descent, and Landing

Data.gov (United States)

National Aeronautics and Space Administration — The landing of the Mars Science Laboratory represents the upper limit of current Entry, Descent, and Landing (EDL) capabilities for Mars exploration. The succession...

An adaptive finite element method for simulating surface tension with the gradient theory of fluid interfaces

KAUST Repository

Kou, Jisheng; Sun, Shuyu

2014-01-01

The gradient theory for the surface tension of simple fluids and mixtures is rigorously analyzed based on mathematical theory. The finite element approximation of surface tension is developed and analyzed, and moreover, an adaptive finite element method based on a physical-based estimator is proposed and it can be coupled efficiently with Newton's method as well. The numerical tests are carried out both to verify the proposed theory and to demonstrate the efficiency of the proposed method. © 2013 Elsevier B.V. All rights reserved.

An adaptive finite element method for simulating surface tension with the gradient theory of fluid interfaces

KAUST Repository

Kou, Jisheng

2014-01-01

The gradient theory for the surface tension of simple fluids and mixtures is rigorously analyzed based on mathematical theory. The finite element approximation of surface tension is developed and analyzed, and moreover, an adaptive finite element method based on a physical-based estimator is proposed and it can be coupled efficiently with Newton\\'s method as well. The numerical tests are carried out both to verify the proposed theory and to demonstrate the efficiency of the proposed method. © 2013 Elsevier B.V. All rights reserved.

Scaling Up Coordinate Descent Algorithms for Large ℓ1 Regularization Problems

Energy Technology Data Exchange (ETDEWEB)

Scherrer, Chad; Halappanavar, Mahantesh; Tewari, Ambuj; Haglin, David J.

2012-07-03

We present a generic framework for parallel coordinate descent (CD) algorithms that has as special cases the original sequential algorithms of Cyclic CD and Stochastic CD, as well as the recent parallel Shotgun algorithm of Bradley et al. We introduce two novel parallel algorithms that are also special cases---Thread-Greedy CD and Coloring-Based CD---and give performance measurements for an OpenMP implementation of these.

A cell-centred finite volume method for the Poisson problem on non-graded quadtrees with second order accurate gradients

Science.gov (United States)

Batty, Christopher

2017-02-01

This paper introduces a two-dimensional cell-centred finite volume discretization of the Poisson problem on adaptive Cartesian quadtree grids which exhibits second order accuracy in both the solution and its gradients, and requires no grading condition between adjacent cells. At T-junction configurations, which occur wherever resolution differs between neighboring cells, use of the standard centred difference gradient stencil requires that ghost values be constructed by interpolation. To properly recover second order accuracy in the resulting numerical gradients, prior work addressing block-structured grids and graded trees has shown that quadratic, rather than linear, interpolation is required; the gradients otherwise exhibit only first order convergence, which limits potential applications such as fluid flow. However, previous schemes fail or lose accuracy in the presence of the more complex T-junction geometries arising in the case of general non-graded quadtrees, which place no restrictions on the resolution of neighboring cells. We therefore propose novel quadratic interpolant constructions for this case that enable second order convergence by relying on stencils oriented diagonally and applied recursively as needed. The method handles complex tree topologies and large resolution jumps between neighboring cells, even along the domain boundary, and both Dirichlet and Neumann boundary conditions are supported. Numerical experiments confirm the overall second order accuracy of the method in the L∞ norm.

Optimization of OT-MACH Filter Generation for Target Recognition

Science.gov (United States)

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.

Directional phytoscreening: contaminant gradients in trees for plume delineation.

Science.gov (United States)

Limmer, Matt A; Shetty, Mikhil K; Markus, Samantha; Kroeker, Ryan; Parker, Beth L; Martinez, Camilo; Burken, Joel G

2013-08-20

Tree sampling methods have been used in phytoscreening applications to delineate contaminated soil and groundwater, augmenting traditional investigative methods that are time-consuming, resource-intensive, invasive, and costly. In the past decade, contaminant concentrations in tree tissues have been shown to reflect the extent and intensity of subsurface contamination. This paper investigates a new phytoscreening tool: directional tree coring, a concept originating from field data that indicated azimuthal concentrations in tree trunks reflected the concentration gradients in the groundwater around the tree. To experimentally test this hypothesis, large diameter trees were subjected to subsurface contaminant concentration gradients in a greenhouse study. These trees were then analyzed for azimuthal concentration gradients in aboveground tree tissues, revealing contaminant centroids located on the side of the tree nearest the most contaminated groundwater. Tree coring at three field sites revealed sufficiently steep contaminant gradients in trees reflected nearby groundwater contaminant gradients. In practice, trees possessing steep contaminant gradients are indicators of steep subsurface contaminant gradients, providing compass-like information about the contaminant gradient, pointing investigators toward higher concentration regions of the plume.

Entry, Descent, and Landing Communications for the 2011 Mars Science Laboratory

Science.gov (United States)

Abilleira, Fernando; Shidner, Jeremy D.

2012-01-01

The Mars Science Laboratory (MSL), established as the most advanced rover to land on the surface of Mars to date, launched on November 26th, 2011 and arrived to the Martian Gale Crater during the night of August 5th, 2012 (PDT). MSL will investigate whether the landing region was ever suitable to support carbon-based life, and examine rocks, soil, and the atmosphere with a sophisticated suite of tools. This paper addresses the flight system requirement by which the vehicle transmitted indications of the following events using both X-band tones and UHF telemetry to allow identification of probable root causes should a mission anomaly have occurred: Heat-Rejection System (HRS) venting, completion of the cruise stage separation, turn to entry attitude, atmospheric deceleration, bank angle reversal commanded, parachute deployment, heatshield separation, radar ground acquisition, powered descent initiation, rover separation from the descent stage, and rover release. During Entry, Descent, and Landing (EDL), the flight system transmitted a UHF telemetry stream adequate to determine the state of the spacecraft (including the presence of faults) at 8 kbps initiating from cruise stage separation through at least one minute after positive indication of rover release on the surface of Mars. The flight system also transmitted X-band semaphore tones from Entry to Landing plus one minute although since MSL was occulted, as predicted, by Mars as seen from the Earth, Direct-To-Earth (DTE) communications were interrupted at approximately is approx. 5 min after Entry ( approximately 130 prior to Landing). The primary data return paths were through the Deep Space Network (DSN) for DTE and the existing Mars network of orbiting assets for UHF, which included the Mars Reconnaissance Orbiter (MRO), Mars Odyssey (ODY), and Mars Express (MEX) elements. These orbiters recorded the telemetry data stream and returned it back to Earth via the DSN. The paper also discusses the total power

Modelling the descent of nitric oxide during the elevated stratopause event of January 2013

Science.gov (United States)

Orsolini, Yvan J.; Limpasuvan, Varavut; Pérot, Kristell; Espy, Patrick; Hibbins, Robert; Lossow, Stefan; Raaholt Larsson, Katarina; Murtagh, Donal

2017-03-01

Using simulations with a whole-atmosphere chemistry-climate model nudged by meteorological analyses, global satellite observations of nitrogen oxide (NO) and water vapour by the Sub-Millimetre Radiometer instrument (SMR), of temperature by the Microwave Limb Sounder (MLS), as well as local radar observations, this study examines the recent major stratospheric sudden warming accompanied by an elevated stratopause event (ESE) that occurred in January 2013. We examine dynamical processes during the ESE, including the role of planetary wave, gravity wave and tidal forcing on the initiation of the descent in the mesosphere-lower thermosphere (MLT) and its continuation throughout the mesosphere and stratosphere, as well as the impact of model eddy diffusion. We analyse the transport of NO and find the model underestimates the large descent of NO compared to SMR observations. We demonstrate that the discrepancy arises abruptly in the MLT region at a time when the resolved wave forcing and the planetary wave activity increase, just before the elevated stratopause reforms. The discrepancy persists despite doubling the model eddy diffusion. While the simulations reproduce an enhancement of the semi-diurnal tide following the onset of the 2013 SSW, corroborating new meteor radar observations at high northern latitudes over Trondheim (63.4°N), the modelled tidal contribution to the forcing of the mean meridional circulation and to the descent is a small portion of the resolved wave forcing, and lags it by about ten days.

Structural and compositional gradients: basic idea, preparation, applications

International Nuclear Information System (INIS)

Ilschner, B.

1993-01-01

The term gradient materials refers to gradients of chemical composition and/or microstructural parameters which are intentionally introduced into components of any kind of homogeneous or heterogeneous materials, including metallic alloys, ceramics, glasses, polymers, and composites. After a short review of the development of the gradient materials technology since 1972, some fundamental aspects concerning the effects of such gradients on physical or mechanical properties are discussed. A selection of technical applications which have been discussed recently is presented. Finally, different methods for the preparation of gradients from gaseous, liquid or powder precursors are reviewed. (orig.)

Entry, Descent and Landing Systems Analysis: Exploration Feed Forward Internal Peer Review Slide Package

Science.gov (United States)

Dwyer Cianciolo, Alicia M. (Editor)

2011-01-01

NASA senior management commissioned the Entry, Descent and Landing Systems Analysis (EDL-SA) Study in 2008 to identify and roadmap the Entry, Descent and Landing (EDL) technology investments that the agency needed to successfully land large payloads at Mars for both robotic and human-scale missions. Year 1 of the study focused on technologies required for Exploration-class missions to land payloads of 10 to 50 mt. Inflatable decelerators, rigid aeroshell and supersonic retro-propulsion emerged as the top candidate technologies. In Year 2 of the study, low TRL technologies identified in Year 1, inflatables aeroshells and supersonic retropropulsion, were combined to create a demonstration precursor robotic mission. This part of the EDL-SA Year 2 effort, called Exploration Feed Forward (EFF), took much of the systems analysis simulation and component model development from Year 1 to the next level of detail.

Spatial gradient tuning in metamaterials

Science.gov (United States)

Driscoll, Tom; Goldflam, Michael; Jokerst, Nan; Basov, Dimitri; Smith, David

2011-03-01

Gradient Index (GRIN) metamaterials have been used to create devices inspired by, but often surpassing the potential of, conventional GRIN optics. The unit-cell nature of metamaterials presents the opportunity to exert much greater control over spatial gradients than is possible in natural materials. This is true not only during the design phase but also offers the potential for real-time reconfiguration of the metamaterial gradient. This ability fits nicely into the picture of transformation-optics, in which spatial gradients can enable an impressive suite of innovative devices. We discuss methods to exert control over metamaterial response, focusing on our recent demonstrations using Vanadium Dioxide. We give special attention to role of memristance and mem-capacitance observed in Vanadium Dioxide, which simplify the demands of stimuli and addressing, as well as intersecting metamaterials with the field of memory-materials.

Atmospheric Risk Assessment for the Mars Science Laboratory Entry, Descent, and Landing System

Science.gov (United States)

Chen, Allen; Vasavada, Ashwin; Cianciolo, Alicia; Barnes, Jeff; Tyler, Dan; Hinson, David; Lewis, Stephen

2010-01-01

In 2012, the Mars Science Laboratory (MSL) mission will pioneer the next generation of robotic Entry, Descent, and Landing (EDL) systems, by delivering the largest and most capable rover to date to the surface of Mars. As with previous Mars landers, atmospheric conditions during entry, descent, and landing directly impact the performance of MSL's EDL system. While the vehicle's novel guided entry system allows it to "fly out" a range of atmospheric uncertainties, its trajectory through the atmosphere creates a variety of atmospheric sensitivities not present on previous Mars entry systems and landers. Given the mission's stringent landing capability requirements, understanding the atmosphere state and spacecraft sensitivities takes on heightened importance. MSL's guided entry trajectory differs significantly from recent Mars landers and includes events that generate different atmospheric sensitivities than past missions. The existence of these sensitivities and general advancement in the state of Mars atmospheric knowledge has led the MSL team to employ new atmosphere modeling techniques in addition to past practices. A joint EDL engineering and Mars atmosphere science and modeling team has been created to identify the key system sensitivities, gather available atmospheric data sets, develop relevant atmosphere models, and formulate methods to integrate atmosphere information into EDL performance assessments. The team consists of EDL engineers, project science staff, and Mars atmospheric scientists from a variety of institutions. This paper provides an overview of the system performance sensitivities that have driven the atmosphere modeling approach, discusses the atmosphere data sets and models employed by the team as a result of the identified sensitivities, and introduces the tools used to translate atmospheric knowledge into quantitative EDL performance assessments.

Total variation regularization for seismic waveform inversion using an adaptive primal dual hybrid gradient method

Science.gov (United States)

Yong, Peng; Liao, Wenyuan; Huang, Jianping; Li, Zhenchuan

2018-04-01

Full waveform inversion is an effective tool for recovering the properties of the Earth from seismograms. However, it suffers from local minima caused mainly by the limited accuracy of the starting model and the lack of a low-frequency component in the seismic data. Because of the high velocity contrast between salt and sediment, the relation between the waveform and velocity perturbation is strongly nonlinear. Therefore, salt inversion can easily get trapped in the local minima. Since the velocity of salt is nearly constant, we can make the most of this characteristic with total variation regularization to mitigate the local minima. In this paper, we develop an adaptive primal dual hybrid gradient method to implement total variation regularization by projecting the solution onto a total variation norm constrained convex set, through which the total variation norm constraint is satisfied at every model iteration. The smooth background velocities are first inverted and the perturbations are gradually obtained by successively relaxing the total variation norm constraints. Numerical experiment of the projection of the BP model onto the intersection of the total variation norm and box constraints has demonstrated the accuracy and efficiency of our adaptive primal dual hybrid gradient method. A workflow is designed to recover complex salt structures in the BP 2004 model and the 2D SEG/EAGE salt model, starting from a linear gradient model without using low-frequency data below 3 Hz. The salt inversion processes demonstrate that wavefield reconstruction inversion with a total variation norm and box constraints is able to overcome local minima and inverts the complex salt velocity layer by layer.

Development and application of the analytical energy gradient for the normalized elimination of the small component method

NARCIS (Netherlands)

Zou, Wenli; Filatov, Michael; Cremer, Dieter

2011-01-01

The analytical energy gradient of the normalized elimination of the small component (NESC) method is derived for the first time and implemented for the routine calculation of NESC geometries and other first order molecular properties. Essential for the derivation is the correct calculation of the

Preprocessing of gravity gradients at the GOCE high-level processing facility

Science.gov (United States)

Bouman, Johannes; Rispens, Sietse; Gruber, Thomas; Koop, Radboud; Schrama, Ernst; Visser, Pieter; Tscherning, Carl Christian; Veicherts, Martin

2009-07-01

One of the products derived from the gravity field and steady-state ocean circulation explorer (GOCE) observations are the gravity gradients. These gravity gradients are provided in the gradiometer reference frame (GRF) and are calibrated in-flight using satellite shaking and star sensor data. To use these gravity gradients for application in Earth scienes and gravity field analysis, additional preprocessing needs to be done, including corrections for temporal gravity field signals to isolate the static gravity field part, screening for outliers, calibration by comparison with existing external gravity field information and error assessment. The temporal gravity gradient corrections consist of tidal and nontidal corrections. These are all generally below the gravity gradient error level, which is predicted to show a 1/ f behaviour for low frequencies. In the outlier detection, the 1/ f error is compensated for by subtracting a local median from the data, while the data error is assessed using the median absolute deviation. The local median acts as a high-pass filter and it is robust as is the median absolute deviation. Three different methods have been implemented for the calibration of the gravity gradients. All three methods use a high-pass filter to compensate for the 1/ f gravity gradient error. The baseline method uses state-of-the-art global gravity field models and the most accurate results are obtained if star sensor misalignments are estimated along with the calibration parameters. A second calibration method uses GOCE GPS data to estimate a low-degree gravity field model as well as gravity gradient scale factors. Both methods allow to estimate gravity gradient scale factors down to the 10-3 level. The third calibration method uses high accurate terrestrial gravity data in selected regions to validate the gravity gradient scale factors, focussing on the measurement band. Gravity gradient scale factors may be estimated down to the 10-2 level with this

The molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory: The DEC-RI-MP2 gradient

Energy Technology Data Exchange (ETDEWEB)

Bykov, Dmytro; Kristensen, Kasper; Kjærgaard, Thomas [Department of Chemistry, qLeap Center for Theoretical Chemistry, University of Aarhus, DK-8000 Århus C (Denmark)

2016-07-14

We report an implementation of the molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory (DEC-RI-MP2). The new DEC-RI-MP2 gradient method combines the precision control as well as the linear-scaling and massively parallel features of the DEC scheme with efficient evaluations of the gradient contributions using the RI approximation. We further demonstrate that the DEC-RI-MP2 gradient method is capable of calculating molecular gradients for very large molecular systems. A test set of supramolecular complexes containing up to 158 atoms and 1960 contracted basis functions has been employed to demonstrate the general applicability of the DEC-RI-MP2 method and to analyze the errors of the DEC approximation. Moreover, the test set contains molecules of complicated electronic structures and is thus deliberately chosen to stress test the DEC-RI-MP2 gradient implementation. Additionally, as a showcase example the full molecular gradient for insulin (787 atoms and 7604 contracted basis functions) has been evaluated.

The molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory: The DEC-RI-MP2 gradient

International Nuclear Information System (INIS)

Bykov, Dmytro; Kristensen, Kasper; Kjærgaard, Thomas

2016-01-01

We report an implementation of the molecular gradient using the divide-expand-consolidate resolution of the identity second-order Møller-Plesset perturbation theory (DEC-RI-MP2). The new DEC-RI-MP2 gradient method combines the precision control as well as the linear-scaling and massively parallel features of the DEC scheme with efficient evaluations of the gradient contributions using the RI approximation. We further demonstrate that the DEC-RI-MP2 gradient method is capable of calculating molecular gradients for very large molecular systems. A test set of supramolecular complexes containing up to 158 atoms and 1960 contracted basis functions has been employed to demonstrate the general applicability of the DEC-RI-MP2 method and to analyze the errors of the DEC approximation. Moreover, the test set contains molecules of complicated electronic structures and is thus deliberately chosen to stress test the DEC-RI-MP2 gradient implementation. Additionally, as a showcase example the full molecular gradient for insulin (787 atoms and 7604 contracted basis functions) has been evaluated.

Gradient Dynamics and Entropy Production Maximization

Science.gov (United States)

Janečka, Adam; Pavelka, Michal

2018-01-01

We compare two methods for modeling dissipative processes, namely gradient dynamics and entropy production maximization. Both methods require similar physical inputs-how energy (or entropy) is stored and how it is dissipated. Gradient dynamics describes irreversible evolution by means of dissipation potential and entropy, it automatically satisfies Onsager reciprocal relations as well as their nonlinear generalization (Maxwell-Onsager relations), and it has statistical interpretation. Entropy production maximization is based on knowledge of free energy (or another thermodynamic potential) and entropy production. It also leads to the linear Onsager reciprocal relations and it has proven successful in thermodynamics of complex materials. Both methods are thermodynamically sound as they ensure approach to equilibrium, and we compare them and discuss their advantages and shortcomings. In particular, conditions under which the two approaches coincide and are capable of providing the same constitutive relations are identified. Besides, a commonly used but not often mentioned step in the entropy production maximization is pinpointed and the condition of incompressibility is incorporated into gradient dynamics.