Science.gov

Sample records for quadratic programming algorithm

  1. Large-scale sequential quadratic programming algorithms

    SciTech Connect

    Eldersveld, S.K.

    1992-09-01

    The problem addressed is the general nonlinear programming problem: finding a local minimizer for a nonlinear function subject to a mixture of nonlinear equality and inequality constraints. The methods studied are in the class of sequential quadratic programming (SQP) algorithms, which have previously proved successful for problems of moderate size. Our goal is to devise an SQP algorithm that is applicable to large-scale optimization problems, using sparse data structures and storing less curvature information but maintaining the property of superlinear convergence. The main features are: 1. The use of a quasi-Newton approximation to the reduced Hessian of the Lagrangian function. Only an estimate of the reduced Hessian matrix is required by our algorithm. The impact of not having available the full Hessian approximation is studied and alternative estimates are constructed. 2. The use of a transformation matrix Q. This allows the QP gradient to be computed easily when only the reduced Hessian approximation is maintained. 3. The use of a reduced-gradient form of the basis for the null space of the working set. This choice of basis is more practical than an orthogonal null-space basis for large-scale problems. The continuity condition for this choice is proven. 4. The use of incomplete solutions of quadratic programming subproblems. Certain iterates generated by an active-set method for the QP subproblem are used in place of the QP minimizer to define the search direction for the nonlinear problem. An implementation of the new algorithm has been obtained by modifying the code MINOS. Results and comparisons with MINOS and NPSOL are given for the new algorithm on a set of 92 test problems.

  2. Some Randomized Algorithms for Convex Quadratic Programming

    SciTech Connect

    Goldbach, R.

    1999-01-15

    We adapt some randomized algorithms of Clarkson [3] for linear programming to the framework of so-called LP-type problems, which was introduced by Sharir and Welzl [10]. This framework is quite general and allows a unified and elegant presentation and analysis. We also show that LP-type problems include minimization of a convex quadratic function subject to convex quadratic constraints as a special case, for which the algorithms can be implemented efficiently, if only linear constraints are present. We show that the expected running times depend only linearly on the number of constraints, and illustrate this by some numerical results. Even though the framework of LP-type problems may appear rather abstract at first, application of the methods considered in this paper to a given problem of that type is easy and efficient. Moreover, our proofs are in fact rather simple, since many technical details of more explicit problem representations are handled in a uniform manner by our approach. In particular, we do not assume boundedness of the feasible set as required in related methods.

  3. Sequential Quadratic Programming Algorithms for Optimization

    DTIC Science & Technology

    1989-08-01

    brief history of the evolution of SQP algorithms. Surveys for this area can be found in [GMWSl]. (Po831 or fGNISW𔄂 ,] for example. The origins Ihe...0) S (TnI(P(O) K __jnfl’flj)j 2 < 0. lhe adjust uncut of thleslack variables. s in step (Ii) oft he algorith (-ii a ii only lvad to a fu rt her red

  4. Memetic algorithms for the unconstrained binary quadratic programming problem.

    PubMed

    Merz, Peter; Katayama, Kengo

    2004-12-01

    This paper presents a memetic algorithm, a highly effective evolutionary algorithm incorporating local search for solving the unconstrained binary quadratic programming problem (BQP). To justify the approach, a fitness landscape analysis is conducted experimentally for several instances of the BQP. The results of the analysis show that recombination-based variation operators are well suited for the evolutionary algorithms with local search. Therefore, the proposed approach includes--besides a highly effective randomized k-opt local search--a new variation operator that has been tailored specially for the application in the hybrid evolutionary framework. The operator is called innovative variation and is fundamentally different from traditional crossover operators, since new genetic material is included in the offspring which is not contained in one of the parents. The evolutionary heuristic is tested on 35 publicly available BQP instances, and it is shown experimentally that the algorithm is capable of finding best-known solutions to large BQPs in a short time and with a high frequency. In comparison to other approaches for the BQP, the approach appears to be much more effective, particularly for large instances of 1000 or 2500 binary variables.

  5. Sensitivity Analysis of Linear Programming and Quadratic Programming Algorithms for Control Allocation

    NASA Technical Reports Server (NTRS)

    Frost, Susan A.; Bodson, Marc; Acosta, Diana M.

    2009-01-01

    The Next Generation (NextGen) transport aircraft configurations being investigated as part of the NASA Aeronautics Subsonic Fixed Wing Project have more control surfaces, or control effectors, than existing transport aircraft configurations. Conventional flight control is achieved through two symmetric elevators, two antisymmetric ailerons, and a rudder. The five effectors, reduced to three command variables, produce moments along the three main axes of the aircraft and enable the pilot to control the attitude and flight path of the aircraft. The NextGen aircraft will have additional redundant control effectors to control the three moments, creating a situation where the aircraft is over-actuated and where a simple relationship does not exist anymore between the required effector deflections and the desired moments. NextGen flight controllers will incorporate control allocation algorithms to determine the optimal effector commands and attain the desired moments, taking into account the effector limits. Approaches to solving the problem using linear programming and quadratic programming algorithms have been proposed and tested. It is of great interest to understand their relative advantages and disadvantages and how design parameters may affect their properties. In this paper, we investigate the sensitivity of the effector commands with respect to the desired moments and show on some examples that the solutions provided using the l2 norm of quadratic programming are less sensitive than those using the l1 norm of linear programming.

  6. A sequential quadratic programming algorithm using an incomplete solution of the subproblem

    SciTech Connect

    Murray, W.; Prieto, F.J.

    1993-05-01

    We analyze sequential quadratic programming (SQP) methods to solve nonlinear constrained optimization problems that are more flexible in their definition than standard SQP methods. The type of flexibility introduced is motivated by the necessity to deviate from the standard approach when solving large problems. Specifically we no longer require a minimizer of the QP subproblem to be determined or particular Lagrange multiplier estimates to be used. Our main focus is on an SQP algorithm that uses a particular augmented Lagrangian merit function. New results are derived for this algorithm under weaker conditions than previously assumed; in particular, it is not assumed that the iterates lie on a compact set.

  7. Sequential quadratic programming-based fast path planning algorithm subject to no-fly zone constraints

    NASA Astrophysics Data System (ADS)

    Liu, Wei; Ma, Shunjian; Sun, Mingwei; Yi, Haidong; Wang, Zenghui; Chen, Zengqiang

    2016-08-01

    Path planning plays an important role in aircraft guided systems. Multiple no-fly zones in the flight area make path planning a constrained nonlinear optimization problem. It is necessary to obtain a feasible optimal solution in real time. In this article, the flight path is specified to be composed of alternate line segments and circular arcs, in order to reformulate the problem into a static optimization one in terms of the waypoints. For the commonly used circular and polygonal no-fly zones, geometric conditions are established to determine whether or not the path intersects with them, and these can be readily programmed. Then, the original problem is transformed into a form that can be solved by the sequential quadratic programming method. The solution can be obtained quickly using the Sparse Nonlinear OPTimizer (SNOPT) package. Mathematical simulations are used to verify the effectiveness and rapidity of the proposed algorithm.

  8. Phosphorescence lifetime analysis with a quadratic programming algorithm for determining quencher distributions in heterogeneous systems.

    PubMed Central

    Vinogradov, S A; Wilson, D F

    1994-01-01

    A new method for analysis of phosphorescence lifetime distributions in heterogeneous systems has been developed. This method is based on decomposition of the data vector to a linearly independent set of exponentials and uses quadratic programming principles for x2 minimization. Solution of the resulting algorithm requires a finite number of calculations (it is not iterative) and is computationally fast and robust. The algorithm has been tested on various simulated decays and for analysis of phosphorescence measurements of experimental systems with descrete distributions of lifetimes. Critical analysis of the effect of signal-to-noise on the resolving capability of the algorithm is presented. This technique is recommended for resolution of the distributions of quencher concentration in heterogeneous samples, of which oxygen distributions in tissue is an important example. Phosphors of practical importance for biological oxygen measurements: Pd-meso-tetra (4-carboxyphenyl) porphyrin (PdTCPP) and Pd-meso-porphyrin (PdMP) have been used to provide experimental test of the algorithm. PMID:7858142

  9. A Sequential Quadratically Constrained Quadratic Programming Method of Feasible Directions

    SciTech Connect

    Jian Jinbao Hu Qingjie; Tang Chunming; Zheng Haiyan

    2007-12-15

    In this paper, a sequential quadratically constrained quadratic programming method of feasible directions is proposed for the optimization problems with nonlinear inequality constraints. At each iteration of the proposed algorithm, a feasible direction of descent is obtained by solving only one subproblem which consist of a convex quadratic objective function and simple quadratic inequality constraints without the second derivatives of the functions of the discussed problems, and such a subproblem can be formulated as a second-order cone programming which can be solved by interior point methods. To overcome the Maratos effect, an efficient higher-order correction direction is obtained by only one explicit computation formula. The algorithm is proved to be globally convergent and superlinearly convergent under some mild conditions without the strict complementarity. Finally, some preliminary numerical results are reported.

  10. Partial discharge localization in power transformers based on the sequential quadratic programming-genetic algorithm adopting acoustic emission techniques

    NASA Astrophysics Data System (ADS)

    Liu, Hua-Long; Liu, Hua-Dong

    2014-10-01

    Partial discharge (PD) in power transformers is one of the prime reasons resulting in insulation degradation and power faults. Hence, it is of great importance to study the techniques of the detection and localization of PD in theory and practice. The detection and localization of PD employing acoustic emission (AE) techniques, as a kind of non-destructive testing, plus due to the advantages of powerful capability of locating and high precision, have been paid more and more attention. The localization algorithm is the key factor to decide the localization accuracy in AE localization of PD. Many kinds of localization algorithms exist for the PD source localization adopting AE techniques including intelligent and non-intelligent algorithms. However, the existed algorithms possess some defects such as the premature convergence phenomenon, poor local optimization ability and unsuitability for the field applications. To overcome the poor local optimization ability and easily caused premature convergence phenomenon of the fundamental genetic algorithm (GA), a new kind of improved GA is proposed, namely the sequence quadratic programming-genetic algorithm (SQP-GA). For the hybrid optimization algorithm, SQP-GA, the sequence quadratic programming (SQP) algorithm which is used as a basic operator is integrated into the fundamental GA, so the local searching ability of the fundamental GA is improved effectively and the premature convergence phenomenon is overcome. Experimental results of the numerical simulations of benchmark functions show that the hybrid optimization algorithm, SQP-GA, is better than the fundamental GA in the convergence speed and optimization precision, and the proposed algorithm in this paper has outstanding optimization effect. At the same time, the presented SQP-GA in the paper is applied to solve the ultrasonic localization problem of PD in transformers, then the ultrasonic localization method of PD in transformers based on the SQP-GA is proposed. And

  11. A duality theorem-based algorithm for inexact quadratic programming problems: Application to waste management under uncertainty

    NASA Astrophysics Data System (ADS)

    Kong, X. M.; Huang, G. H.; Fan, Y. R.; Li, Y. P.

    2016-04-01

    In this study, a duality theorem-based algorithm (DTA) for inexact quadratic programming (IQP) is developed for municipal solid waste (MSW) management under uncertainty. It improves upon the existing numerical solution method for IQP problems. The comparison between DTA and derivative algorithm (DAM) shows that the DTA method provides better solutions than DAM with lower computational complexity. It is not necessary to identify the uncertain relationship between the objective function and decision variables, which is required for the solution process of DAM. The developed method is applied to a case study of MSW management and planning. The results indicate that reasonable solutions have been generated for supporting long-term MSW management and planning. They could provide more information as well as enable managers to make better decisions to identify desired MSW management policies in association with minimized cost under uncertainty.

  12. A Sequential Quadratic Programming Algorithm Using an Incomplete Solution of the Subproblem

    DTIC Science & Technology

    1990-09-01

    KKT point of NP. Such points are feasible and satisfy the following conditions : VF(x*) = Vc(x*)TA*, A*ci(x*) = 0 i = 1,...,m for some nonnegative...the same as the one for which the multiplier was obtained. The following conditions on Ilk are sufficient to ensure that the algorithm has the desired...It is shown in [Pr89] that there exists a constant M such that if Pk > M, condition MC2 is sufficient . Theorem 4.1. Under assumptions Al-AT, and

  13. Quadratic Programming for Allocating Control Effort

    NASA Technical Reports Server (NTRS)

    Singh, Gurkirpal

    2005-01-01

    A computer program calculates an optimal allocation of control effort in a system that includes redundant control actuators. The program implements an iterative (but otherwise single-stage) algorithm of the quadratic-programming type. In general, in the quadratic-programming problem, one seeks the values of a set of variables that minimize a quadratic cost function, subject to a set of linear equality and inequality constraints. In this program, the cost function combines control effort (typically quantified in terms of energy or fuel consumed) and control residuals (differences between commanded and sensed values of variables to be controlled). In comparison with prior control-allocation software, this program offers approximately equal accuracy but much greater computational efficiency. In addition, this program offers flexibility, robustness to actuation failures, and a capability for selective enforcement of control requirements. The computational efficiency of this program makes it suitable for such complex, real-time applications as controlling redundant aircraft actuators or redundant spacecraft thrusters. The program is written in the C language for execution in a UNIX operating system.

  14. Degenerate nonlinear programming with a quadratic growth condition.

    SciTech Connect

    Anitescu, M.; Mathematics and Computer Science

    2000-01-01

    We show that the quadratic growth condition and the Mangasarian-Fromovitz constraint qualification (MFCQ) imply that local minima of nonlinear programs are isolated stationary points. As a result, when started sufficiently close to such points, an L1 exact penalty sequential quadratic programming algorithm will induce at least R-linear convergence of the iterates to such a local minimum. We construct an example of a degenerate nonlinear program with a unique local minimum satisfying the quadratic growth and the MFCQ but for which no positive semidefinite augmented Lagrangian exists. We present numerical results obtained using several nonlinear programming packages on this example and discuss its implications for some algorithms.

  15. Fast Approximate Quadratic Programming for Graph Matching

    PubMed Central

    Vogelstein, Joshua T.; Conroy, John M.; Lyzinski, Vince; Podrazik, Louis J.; Kratzer, Steven G.; Harley, Eric T.; Fishkind, Donniell E.; Vogelstein, R. Jacob; Priebe, Carey E.

    2015-01-01

    Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance. PMID:25886624

  16. Fast approximate quadratic programming for graph matching.

    PubMed

    Vogelstein, Joshua T; Conroy, John M; Lyzinski, Vince; Podrazik, Louis J; Kratzer, Steven G; Harley, Eric T; Fishkind, Donniell E; Vogelstein, R Jacob; Priebe, Carey E

    2015-01-01

    Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance.

  17. PSQP -- Puzzle Solving by Quadratic Programming.

    PubMed

    Andalo, Fernanda; Taubin, Gabriel; Goldenstein, Siome

    2016-03-25

    In this article we present the first effective global method for the reconstruction of image puzzles comprising rectangle pieces - Puzzle Solving by Quadratic Programming (PSQP). The proposed novel mathematical formulation reduces the problem to the maximization of a constrained quadratic function, which is solved via a gradient ascent approach. The proposed method is deterministic and can deal with arbitrary identical rectangular pieces. We provide experimental results showing its effectiveness when compared to state-of-the-art approaches. Although the method was developed to solve image puzzles, we also show how to apply it to the reconstruction of simulated strip-shredded documents, broadening its applicability.

  18. PSQP: Puzzle Solving by Quadratic Programming.

    PubMed

    Andalo, Fernanda A; Taubin, Gabriel; Goldenstein, Siome

    2017-02-01

    In this article we present the first effective method based on global optimization for the reconstruction of image puzzles comprising rectangle pieces-Puzzle Solving by Quadratic Programming (PSQP). The proposed novel mathematical formulation reduces the problem to the maximization of a constrained quadratic function, which is solved via a gradient ascent approach. The proposed method is deterministic and can deal with arbitrary identical rectangular pieces. We provide experimental results showing its effectiveness when compared to state-of-the-art approaches. Although the method was developed to solve image puzzles, we also show how to apply it to the reconstruction of simulated strip-shredded documents, broadening its applicability.

  19. Convergence properties of the softassign quadratic assignment algorithm.

    PubMed

    Rangarajan, A; Vuille, A; Mjolsness, E

    1999-08-15

    The softassign quadratic assignment algorithm is a discrete-time, continuous-state, synchronous updating optimizing neural network. While its effectiveness has been shown in the traveling salesman problem, graph matching, and graph partitioning in thousands of simulations, its convergence properties have not been studied. Here, we construct discrete-time Lyapunov functions for the cases of exact and approximate doubly stochastic constraint satisfaction, which show convergence to a fixed point. The combination of good convergence properties and experimental success makes the softassign algorithm an excellent choice for neural quadratic assignment optimization.

  20. Clustered Self Organising Migrating Algorithm for the Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Davendra, Donald; Zelinka, Ivan; Senkerik, Roman

    2009-08-01

    An approach of population dynamics and clustering for permutative problems is presented in this paper. Diversity indicators are created from solution ordering and its mapping is shown as an advantage for population control in metaheuristics. Self Organising Migrating Algorithm (SOMA) is modified using this approach and vetted with the Quadratic Assignment Problem (QAP). Extensive experimentation is conducted on benchmark problems in this area.

  1. Digital image restoration using quadratic programming.

    PubMed

    Abdelmalek, N N; Kasvand, T

    1980-10-01

    The problem of digital image restoration is considered by obtaining an approximate solution to the Fredholm integral equation of the first kind in two variables. The system of linear equations resulting from the discretization of the integral equation is converted to a consistent system of linear equations. The problem is then solved as a quadratic programming problem with bounded variables where the unknown solution is minimized in the L(2) norm. In this method minimum computer storage is needed, and the repeated solutions are obtained in an efficient way. Also the rank of the consistent system which gives a best or near best solution is estimated. Computer simulated examples using spatially separable pointspread functions are presented. Comments and conclusion are given.

  2. Restart-Based Genetic Algorithm for the Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Misevicius, Alfonsas

    The power of genetic algorithms (GAs) has been demonstrated for various domains of the computer science, including combinatorial optimization. In this paper, we propose a new conceptual modification of the genetic algorithm entitled a "restart-based genetic algorithm" (RGA). An effective implementation of RGA for a well-known combinatorial optimization problem, the quadratic assignment problem (QAP), is discussed. The results obtained from the computational experiments on the QAP instances from the publicly available library QAPLIB show excellent performance of RGA. This is especially true for the real-life like QAPs.

  3. Nonlinear equality constraints in feasible sequential quadratic programming

    SciTech Connect

    Lawrence, C.; Tits, A.

    1994-12-31

    In this talk we show that convergence of a feasible sequential quadratic programming algorithm modified to handle smooth nonlinear equality constraints. The modification of the algorithm to incorporate equality constraints is based on a scheme proposed by Mayne and Polak and is implemented in fsqp/cfsqp, an optimization package that generates feasible iterates. Nonlinear equality constraints are treated as {open_quotes}{<=}-type constraints to be satisfied by all iterates, thus precluding any positive value, and an exact penalty term is added to the objective function which penalizes negative values. For example, the problem minimize f(x) s.t. h(x) = 0, with h(x) a scalar, is replaced by minimize f(x) - ch(x) s.t. h(x) {<=} 0. The modified problem is equivalent to the original problem when c is large enough (but finite). Such a value is determined automatically via iterative adjustments.

  4. Consultant-Guided Search Algorithms for the Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Iordache, Serban

    Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based on advice received from consultants. Until now, CGS has been successfully applied to the Traveling Salesman Problem. Because a good metaheuristic should be able to tackle efficiently a large variety of problems, it is important to see how CGS behaves when applied to other classes of problems. In this paper, we propose an algorithm for the Quadratic Assignment Problem (QAP), which hybridizes CGS with a local search procedure. Our experimental results show that CGS is able to compete in terms of solution quality with one of the best Ant Colony Optimization algorithms, the MAX-MIN Ant System.

  5. Reduced order parameter estimation using quasilinearization and quadratic programming

    NASA Astrophysics Data System (ADS)

    Siade, Adam J.; Putti, Mario; Yeh, William W.-G.

    2012-06-01

    The ability of a particular model to accurately predict how a system responds to forcing is predicated on various model parameters that must be appropriately identified. There are many algorithms whose purpose is to solve this inverse problem, which is often computationally intensive. In this study, we propose a new algorithm that significantly reduces the computational burden associated with parameter identification. The algorithm is an extension of the quasilinearization approach where the governing system of differential equations is linearized with respect to the parameters. The resulting inverse problem therefore becomes a linear regression or quadratic programming problem (QP) for minimizing the sum of squared residuals; the solution becomes an update on the parameter set. This process of linearization and regression is repeated until convergence takes place. This algorithm has not received much attention, as the QPs can become quite large, often infeasible for real-world systems. To alleviate this drawback, proper orthogonal decomposition is applied to reduce the size of the linearized model, thereby reducing the computational burden of solving each QP. In fact, this study shows that the snapshots need only be calculated once at the very beginning of the algorithm, after which no further calculations of the reduced-model subspace are required. The proposed algorithm therefore only requires one linearized full-model run per parameter at the first iteration followed by a series of reduced-order QPs. The method is applied to a groundwater model with about 30,000 computation nodes where as many as 15 zones of hydraulic conductivity are estimated.

  6. Blind deconvolution estimation of fluorescence measurements through quadratic programming

    NASA Astrophysics Data System (ADS)

    Campos-Delgado, Daniel U.; Gutierrez-Navarro, Omar; Arce-Santana, Edgar R.; Skala, Melissa C.; Walsh, Alex J.; Jo, Javier A.

    2015-07-01

    Time-deconvolution of the instrument response from fluorescence lifetime imaging microscopy (FLIM) data is usually necessary for accurate fluorescence lifetime estimation. In many applications, however, the instrument response is not available. In such cases, a blind deconvolution approach is required. An iterative methodology is proposed to address the blind deconvolution problem departing from a dataset of FLIM measurements. A linear combination of a base conformed by Laguerre functions models the fluorescence impulse response of the sample at each spatial point in our formulation. Our blind deconvolution estimation (BDE) algorithm is formulated as a quadratic approximation problem, where the decision variables are the samples of the instrument response and the scaling coefficients of the basis functions. In the approximation cost function, there is a bilinear dependence on the decision variables. Hence, due to the nonlinear nature of the estimation process, an alternating least-squares scheme iteratively solves the approximation problem. Our proposal searches for the samples of the instrument response with a global perspective, and the scaling coefficients of the basis functions locally at each spatial point. First, the iterative methodology relies on a least-squares solution for the instrument response, and quadratic programming for the scaling coefficients applied just to a subset of the measured fluorescence decays to initially estimate the instrument response to speed up the convergence. After convergence, the final stage computes the fluorescence impulse response at all spatial points. A comprehensive validation stage considers synthetic and experimental FLIM datasets of ex vivo atherosclerotic plaques and human breast cancer cell samples that highlight the advantages of the proposed BDE algorithm under different noise and initial conditions in the iterative scheme and parameters of the proposal.

  7. Variational viewpoint of the quadratic Markov measure field models: theory and algorithms.

    PubMed

    Rivera, Mariano; Dalmau, Oscar

    2012-03-01

    We present a framework for image segmentation based on quadratic programming, i.e., by minimization of a quadratic regularized energy linearly constrained. In particular, we present a new variational derivation of the quadratic Markov measure field (QMMF) models, which can be understood as a procedure for regularizing model preferences (memberships or likelihoods). We also present efficient optimization algorithms. In the QMMFs, the uncertainty in the computed regularized probability measure field is controlled by penalizing Gini's coefficient, and hence, it affects the convexity of the quadratic programming problem. The convex case is reduced to the solution of a positive definite linear system, and for that case, an efficient Gauss-Seidel (GS) scheme is presented. On the other hand, we present an efficient projected GS with subspace minimization for optimizing the nonconvex case. We demonstrate the proposal capabilities by experiments and numerical comparisons with interactive two-class segmentation, as well as the simultaneous estimation of segmentation and (parametric and nonparametric) generative models. We present extensions to the original formulation for including color and texture clues, as well as imprecise user scribbles in an interactive framework.

  8. Detection of code spread OFDM based on 0-1 integer quadratic programming

    NASA Astrophysics Data System (ADS)

    Elghariani, Ali; Zoltowski, Michael D.

    2012-05-01

    In this paper we introduce Integer Quadratic Programming (MIQP) approach to optimally detect QPSK Code Spread OFDM (CS-OFDM) by formulating the problem as a combinatorial optimization problem. The Branch and Bound (BB) algorithm is utilized to solve this integer quadratic programming problem. Furthermore, we propose combined preprocessing steps that can be applied prior to BB so that the computational complexity of the optimum receiver is reduced. The first step in this combination is to detect as much as possible symbols using procedures presented in [9], which is basically based on the gradient of quadratic function. The second step detects the undetected symbols from the first step using MMSE estimator. The result of the latter step will be used to predict the initial upper bound of the BB algorithm. Simulation results show that the proposed preprocessing combination when applied prior to BB provides optimal performance with a significantly reduced computational complexity.

  9. Solving quadratic programming problems by delayed projection neural network.

    PubMed

    Yang, Yongqing; Cao, Jinde

    2006-11-01

    In this letter, the delayed projection neural network for solving convex quadratic programming problems is proposed. The neural network is proved to be globally exponentially stable and can converge to an optimal solution of the optimization problem. Three examples show the effectiveness of the proposed network.

  10. An application of nonlinear programming to the design of regulators of a linear-quadratic formulation

    NASA Technical Reports Server (NTRS)

    Fleming, P.

    1983-01-01

    A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a nonlinear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer. One concerns helicopter longitudinal dynamics and the other the flight dynamics of an aerodynamically unstable aircraft.

  11. Large-Scale Sequential Quadratic Programming Algorithms

    DTIC Science & Technology

    1992-09-01

    KKT conditions for the QP subproblem shows that Pk(gk) = pk(VL). To see why, note that the KKT necessary and sufficient conditions ...number of active functional constraints at x*). Let Z* be a basis for the null space of A* (so that A*Z* = 0). The KKT necessary conditions for (x*, A... optimal (i.e. when the working set has identified the active set). Let g* FkP* +9k and omit the subscript k. Consider the first-order KKT conditions for

  12. Assessment Guidelines for Ant Colony Algorithms when Solving Quadratic Assignment Problems

    NASA Astrophysics Data System (ADS)

    See, Phen Chiak; Yew Wong, Kuan; Komarudin, Komarudin

    2009-08-01

    To date, no consensus exists on how to evaluate the performance of a new Ant Colony Optimization (ACO) algorithm when solving Quadratic Assignment Problems (QAPs). Different performance measures and problems sets are used by researchers to evaluate their algorithms. This paper is aimed to provide a recapitulation of the relevant issues and suggest some guidelines for assessing the performance of new ACO algorithms.

  13. Projection-free parallel quadratic programming for linear model predictive control

    NASA Astrophysics Data System (ADS)

    Di Cairano, S.; Brand, M.; Bortoff, S. A.

    2013-08-01

    A key component in enabling the application of model predictive control (MPC) in fields such as automotive, aerospace, and factory automation is the availability of low-complexity fast optimisation algorithms to solve the MPC finite horizon optimal control problem in architectures with reduced computational capabilities. In this paper, we introduce a projection-free iterative optimisation algorithm and discuss its application to linear MPC. The algorithm, originally developed by Brand for non-negative quadratic programs, is based on a multiplicative update rule and it is shown to converge to a fixed point which is the optimum. An acceleration technique based on a projection-free line search is also introduced, to speed-up the convergence to the optimum. The algorithm is applied to MPC through the dual of the quadratic program (QP) formulated from the MPC finite time optimal control problem. We discuss how termination conditions with guaranteed degree of suboptimality can be enforced, and how the algorithm performance can be optimised by pre-computing the matrices in a parametric form. We show computational results of the algorithm in three common case studies and we compare such results with the results obtained by other available free and commercial QP solvers.

  14. Primal-Dual Interior Methods for Quadratic Programming

    NASA Astrophysics Data System (ADS)

    Shustrova, Anna

    Interior methods are a class of computational methods for solving a con- strained optimization problem. Interior methods follow a continuous path to the solution that passes through the interior of the feasible region (i.e., the set of points that satisfy the constraints). Interior-point methods may also be viewed as methods that replace the constrained problem by a sequence of unconstrained problems in which the objective function is augmented by a weighted "barrier" term that is infinite at the boundary of the feasible region. Convergence to a solution of the constrained problem is achieved by solving a sequence of unconstrained problems in which the weight on the barrier term is steadily reduced to zero. This thesis concerns the formulation and analysis of interior methods for the solution of a quadratic programming (QP) problem, which is an optimization problem with a quadratic objective function and linear constraints. The linear constraints may include an arbitrary mixture of equality and inequality constraints, where the inequality constraints may be subject to lower and/or upper bounds. QP problems arise in a wide variety of applications. An important application is in sequential quadratic programming methods for nonlinear optimization, which involve minimizing a sequence of QP subproblems based on a quadratic approximation of the nonlinear objective function and a set of linearized nonlinear constraints. Two new interior methods for QP are proposed. Each is based on the properties of a barrier function defined in terms of both the primal and dual variables. The first method is suitable for a QP with all inequality constraints. At each iteration, the Newton equations for minimizing a quadratic model of the primal-dual barrier function are reformulated in terms of a symmetric indefinite system of equations that is solved using an inertia controlling factorization. This factorization provides an effective method for the detection and convexification of

  15. Evolving evolutionary algorithms using linear genetic programming.

    PubMed

    Oltean, Mihai

    2005-01-01

    A new model for evolving Evolutionary Algorithms is proposed in this paper. The model is based on the Linear Genetic Programming (LGP) technique. Every LGP chromosome encodes an EA which is used for solving a particular problem. Several Evolutionary Algorithms for function optimization, the Traveling Salesman Problem and the Quadratic Assignment Problem are evolved by using the considered model. Numerical experiments show that the evolved Evolutionary Algorithms perform similarly and sometimes even better than standard approaches for several well-known benchmarking problems.

  16. A Dynamical Systems Analysis of Semidefinite Programming with Application to Quadratic Optimization with Pure Quadratic Equality Constraints

    SciTech Connect

    Orsi, R. J.; Mahony, R. E.; Moore, J. B.

    1999-09-15

    This paper considers the problem of minimizing a quadratic cost subject to purely quadratic equality constraints. This problem is tackled by first relating it to a standard semidefinite programming problem. The approach taken leads to a dynamical systems analysis of semidefinite programming and the formulation of a gradient descent flow which can be used to solve semidefinite programming problems. Though the reformulation of the initial problem as a semidefinite pro- gramming problem does not in general lead directly to a solution of the original problem, the initial problem is solved by using a modified flow incorporating a penalty function.

  17. Neural network for solving convex quadratic bilevel programming problems.

    PubMed

    He, Xing; Li, Chuandong; Huang, Tingwen; Li, Chaojie

    2014-03-01

    In this paper, using the idea of successive approximation, we propose a neural network to solve convex quadratic bilevel programming problems (CQBPPs), which is modeled by a nonautonomous differential inclusion. Different from the existing neural network for CQBPP, the model has the least number of state variables and simple structure. Based on the theory of nonsmooth analysis, differential inclusions and Lyapunov-like method, the limit equilibrium points sequence of the proposed neural networks can approximately converge to an optimal solution of CQBPP under certain conditions. Finally, simulation results on two numerical examples and the portfolio selection problem show the effectiveness and performance of the proposed neural network.

  18. A quadratic-tensor model algorithm for nonlinear least-squares problems with linear constraints

    NASA Technical Reports Server (NTRS)

    Hanson, R. J.; Krogh, Fred T.

    1992-01-01

    A new algorithm for solving nonlinear least-squares and nonlinear equation problems is proposed which is based on approximating the nonlinear functions using the quadratic-tensor model by Schnabel and Frank. The algorithm uses a trust region defined by a box containing the current values of the unknowns. The algorithm is found to be effective for problems with linear constraints and dense Jacobian matrices.

  19. Fast parallel DNA-based algorithms for molecular computation: quadratic congruence and factoring integers.

    PubMed

    Chang, Weng-Long

    2012-03-01

    Assume that n is a positive integer. If there is an integer such that M (2) ≡ C (mod n), i.e., the congruence has a solution, then C is said to be a quadratic congruence (mod n). If the congruence does not have a solution, then C is said to be a quadratic noncongruence (mod n). The task of solving the problem is central to many important applications, the most obvious being cryptography. In this article, we describe a DNA-based algorithm for solving quadratic congruence and factoring integers. In additional to this novel contribution, we also show the utility of our encoding scheme, and of the algorithm's submodules. We demonstrate how a variety of arithmetic, shifted and comparative operations, namely bitwise and full addition, subtraction, left shifter and comparison perhaps are performed using strands of DNA.

  20. CAD of control systems: Application of nonlinear programming to a linear quadratic formulation

    NASA Technical Reports Server (NTRS)

    Fleming, P.

    1983-01-01

    The familiar suboptimal regulator design approach is recast as a constrained optimization problem and incorporated in a Computer Aided Design (CAD) package where both design objective and constraints are quadratic cost functions. This formulation permits the separate consideration of, for example, model following errors, sensitivity measures and control energy as objectives to be minimized or limits to be observed. Efficient techniques for computing the interrelated cost functions and their gradients are utilized in conjunction with a nonlinear programming algorithm. The effectiveness of the approach and the degree of insight into the problem which it affords is illustrated in a helicopter regulation design example.

  1. Longitudinal force distribution using quadratically constrained linear programming

    NASA Astrophysics Data System (ADS)

    Klomp, M.

    2011-12-01

    In this paper, a new method is presented for the optimisation of force distribution for combined traction/braking and cornering. In order to provide a general, simple and flexible problem formulation, the optimisation is addressed as a quadratically constrained linear programming (QCLP) problem. Apart from fast numerical solutions, different driveline configurations can be included in the QCLP problem in a very straightforward fashion. The optimisation of the distribution of the individual wheel forces using the quasi-steady-state assumption is known to be useful for the study of the influence of particular driveline configurations on the combined lateral and longitudinal grip envelope of a particular vehicle-driveline configuration. The addition of the QCLP problem formulation makes another powerful tool available to the vehicle dynamics analyst to perform such studies.

  2. A quadratic programming framework for constrained and robust jet engine health monitoring

    NASA Astrophysics Data System (ADS)

    Borguet, S.; Léonard, O.

    2009-09-01

    Kalman filters are largely used in the jet engine community for condition monitoring purpose. This algorithm gives a good estimate of the engine condition provided that the residuals between the model prediction and the measurements are zero-mean, Gaussian random variables. In the case of sensor faults, this assumption does not hold anymore and consequently, the diagnosis is spoiled. This contribution presents a recursive estimation algorithm based on a Quadratic Programming (QP) formulation which provides robustness against sensor faults and allows constraints on the health parameters to be specified. The improvements in estimation accuracy brought by this new algorithm are illustrated on a series of typical test-cases that may be encountered on current turbofan engines.

  3. MM Algorithms for Geometric and Signomial Programming.

    PubMed

    Lange, Kenneth; Zhou, Hua

    2014-02-01

    This paper derives new algorithms for signomial programming, a generalization of geometric programming. The algorithms are based on a generic principle for optimization called the MM algorithm. In this setting, one can apply the geometric-arithmetic mean inequality and a supporting hyperplane inequality to create a surrogate function with parameters separated. Thus, unconstrained signomial programming reduces to a sequence of one-dimensional minimization problems. Simple examples demonstrate that the MM algorithm derived can converge to a boundary point or to one point of a continuum of minimum points. Conditions under which the minimum point is unique or occurs in the interior of parameter space are proved for geometric programming. Convergence to an interior point occurs at a linear rate. Finally, the MM framework easily accommodates equality and inequality constraints of signomial type. For the most important special case, constrained quadratic programming, the MM algorithm involves very simple updates.

  4. A Neurodynamic Optimization Approach to Bilevel Quadratic Programming.

    PubMed

    Qin, Sitian; Le, Xinyi; Wang, Jun

    2016-08-19

    This paper presents a neurodynamic optimization approach to bilevel quadratic programming (BQP). Based on the Karush-Kuhn-Tucker (KKT) theorem, the BQP problem is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). It is proved that the global solution of the MPCC is the minimal one of the optimal solutions to multiple convex optimization subproblems. A recurrent neural network is developed for solving these convex optimization subproblems. From any initial state, the state of the proposed neural network is convergent to an equilibrium point of the neural network, which is just the optimal solution of the convex optimization subproblem. Compared with existing recurrent neural networks for BQP, the proposed neural network is guaranteed for delivering the exact optimal solutions to any convex BQP problems. Moreover, it is proved that the proposed neural network for bilevel linear programming is convergent to an equilibrium point in finite time. Finally, three numerical examples are elaborated to substantiate the efficacy of the proposed approach.

  5. A non-linear programming approach to the computer-aided design of regulators using a linear-quadratic formulation

    NASA Technical Reports Server (NTRS)

    Fleming, P.

    1985-01-01

    A design technique is proposed for linear regulators in which a feedback controller of fixed structure is chosen to minimize an integral quadratic objective function subject to the satisfaction of integral quadratic constraint functions. Application of a non-linear programming algorithm to this mathematically tractable formulation results in an efficient and useful computer-aided design tool. Particular attention is paid to computational efficiency and various recommendations are made. Two design examples illustrate the flexibility of the approach and highlight the special insight afforded to the designer.

  6. IFSM fractal image compression with entropy and sparsity constraints: A sequential quadratic programming approach

    NASA Astrophysics Data System (ADS)

    Kunze, Herb; La Torre, Davide; Lin, Jianyi

    2017-01-01

    We consider the inverse problem associated with IFSM: Given a target function f , find an IFSM, such that its fixed point f ¯ is sufficiently close to f in the Lp distance. Forte and Vrscay [1] showed how to reduce this problem to a quadratic optimization model. In this paper, we extend the collage-based method developed by Kunze, La Torre and Vrscay ([2][3][4]), by proposing the minimization of the 1-norm instead of the 0-norm. In fact, optimization problems involving the 0-norm are combinatorial in nature, and hence in general NP-hard. To overcome these difficulties, we introduce the 1-norm and propose a Sequential Quadratic Programming algorithm to solve the corresponding inverse problem. As in Kunze, La Torre and Vrscay [3] in our formulation, the minimization of collage error is treated as a multi-criteria problem that includes three different and conflicting criteria i.e., collage error, entropy and sparsity. This multi-criteria program is solved by means of a scalarization technique which reduces the model to a single-criterion program by combining all objective functions with different trade-off weights. The results of some numerical computations are presented.

  7. Sequential Quadratic Programming (SQP) for optimal control in direct numerical simulation of turbulent flow

    NASA Astrophysics Data System (ADS)

    Badreddine, Hassan; Vandewalle, Stefan; Meyers, Johan

    2014-01-01

    The current work focuses on the development and application of an efficient algorithm for optimization of three-dimensional turbulent flows, simulated using Direct Numerical Simulation (DNS) or Large-Eddy Simulations, and further characterized by large-dimensional optimization-parameter spaces. The optimization algorithm is based on Sequential Quadratic Programming (SQP) in combination with a damped formulation of the limited-memory BFGS method. The latter is suitable for solving large-scale constrained optimization problems whose Hessian matrices cannot be computed and stored at a reasonable cost. We combine the algorithm with a line-search merit function based on an L1-norm to enforce the convergence from any remote point. It is first shown that the proposed form of the damped L-BFGS algorithm is suitable for solving equality constrained Rosenbrock type functions. Then, we apply the algorithm to an optimal-control test problem that consists of finding the optimal initial perturbations to a turbulent temporal mixing layer such that mixing is improved at the end of a simulation time horizon T. The controls are further subject to a non-linear equality constraint on the total control energy. DNSs are used to resolve all turbulent scales of motion, and a continuous adjoint formulation is employed to calculate the gradient of the cost functionals. We compare the convergence speed of the SQP L-BFGS algorithm to a conventional non-linear conjugate-gradient method (i.e. the current standard in DNS-based optimal control), and find that the SQP algorithm is more than an order of magnitude faster than the conjugate-gradient method.

  8. CFSQP: A C code for feasible sequential quadratic programming

    SciTech Connect

    Lawrence, C.; Tits, A.

    1994-12-31

    cfsqp is a set of C functions for the minimization of the maximum of a set of smooth objective functions (possibly a single one) subject to smooth equality and inequality constraints. cfsqp has many distinguishing features. First, the generated iterates satisfy all inequality and linear equality constraints (after an initial feasible point has been automatically constructed). Second, nonlinear equality constraints are relaxed into {open_quotes}{<=}{close_quotes}-type constraints to be satisfied by all iterates, thus precluding any positive value, and the maximum of the objective functions is replaced by an exact penalty function penalizing negative values. Third, the user has the option of requiring that the maximum of the objective functions (penalty function if nonlinear equality constraints are present) decrease at each iteration (monotone line search), or that it decrease within at most four iterations (nonmonotone line search). Recently, a new enhancement was added to cfsqp that is useful when solving problems with many sequentially related constraints (or objectives), such as discretized semi-infinite programming (SIP) problems. cfsqp gives the user the option to greatly reduce computational effort by using an algorithm that more efficiently handles large groups of objectives or constraints. In this talk we will review the cfsqp algorithm and implementation, as well as discuss numerical results obtained on various problems.

  9. Development of C++ Application Program for Solving Quadratic Equation in Elementary School in Nigeria

    ERIC Educational Resources Information Center

    Bandele, Samuel Oye; Adekunle, Adeyemi Suraju

    2015-01-01

    The study was conducted to design, develop and test a c++ application program CAP-QUAD for solving quadratic equation in elementary school in Nigeria. The package was developed in c++ using object-oriented programming language, other computer program that were also utilized during the development process is DevC++ compiler, it was used for…

  10. Item Pool Construction Using Mixed Integer Quadratic Programming (MIQP). GMAC® Research Report RR-14-01

    ERIC Educational Resources Information Center

    Han, Kyung T.; Rudner, Lawrence M.

    2014-01-01

    This study uses mixed integer quadratic programming (MIQP) to construct multiple highly equivalent item pools simultaneously, and compares the results from mixed integer programming (MIP). Three different MIP/MIQP models were implemented and evaluated using real CAT item pool data with 23 different content areas and a goal of equal information…

  11. Kinetic parameters estimation in an anaerobic digestion process using successive quadratic programming.

    PubMed

    Aceves-Lara, C A; Aguilar-Garnica, E; Alcaraz-González, V; González-Reynoso, O; Steyer, J P; Dominguez-Beltran, J L; González-Alvarez, V

    2005-01-01

    In this work, an optimization method is implemented in an anaerobic digestion model to estimate its kinetic parameters and yield coefficients. This method combines the use of advanced state estimation schemes and powerful nonlinear programming techniques to yield fast and accurate estimates of the aforementioned parameters. In this method, we first implement an asymptotic observer to provide estimates of the non-measured variables (such as biomass concentration) and good guesses for the initial conditions of the parameter estimation algorithm. These results are then used by the successive quadratic programming (SQP) technique to calculate the kinetic parameters and yield coefficients of the anaerobic digestion process. The model, provided with the estimated parameters, is tested with experimental data from a pilot-scale fixed bed reactor treating raw industrial wine distillery wastewater. It is shown that SQP reaches a fast and accurate estimation of the kinetic parameters despite highly noise corrupted experimental data and time varying inputs variables. A statistical analysis is also performed to validate the combined estimation method. Finally, a comparison between the proposed method and the traditional Marquardt technique shows that both yield similar results; however, the calculation time of the traditional technique is considerable higher than that of the proposed method.

  12. Application of Sequential Quadratic Programming to Minimize Smart Active Flap Rotor Hub Loads

    NASA Technical Reports Server (NTRS)

    Kottapalli, Sesi; Leyland, Jane

    2014-01-01

    In an analytical study, SMART active flap rotor hub loads have been minimized using nonlinear programming constrained optimization methodology. The recently developed NLPQLP system (Schittkowski, 2010) that employs Sequential Quadratic Programming (SQP) as its core algorithm was embedded into a driver code (NLP10x10) specifically designed to minimize active flap rotor hub loads (Leyland, 2014). Three types of practical constraints on the flap deflections have been considered. To validate the current application, two other optimization methods have been used: i) the standard, linear unconstrained method, and ii) the nonlinear Generalized Reduced Gradient (GRG) method with constraints. The new software code NLP10x10 has been systematically checked out. It has been verified that NLP10x10 is functioning as desired. The following are briefly covered in this paper: relevant optimization theory; implementation of the capability of minimizing a metric of all, or a subset, of the hub loads as well as the capability of using all, or a subset, of the flap harmonics; and finally, solutions for the SMART rotor. The eventual goal is to implement NLP10x10 in a real-time wind tunnel environment.

  13. A new one-layer neural network for linear and quadratic programming.

    PubMed

    Gao, Xingbao; Liao, Li-Zhi

    2010-06-01

    In this paper, we present a new neural network for solving linear and quadratic programming problems in real time by introducing some new vectors. The proposed neural network is stable in the sense of Lyapunov and can converge to an exact optimal solution of the original problem when the objective function is convex on the set defined by equality constraints. Compared with existing one-layer neural networks for quadratic programming problems, the proposed neural network has the least neurons and requires weak stability conditions. The validity and transient behavior of the proposed neural network are demonstrated by some simulation results.

  14. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem.

    PubMed

    Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

    2016-01-01

    The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them.

  15. A Biogeography-Based Optimization Algorithm Hybridized with Tabu Search for the Quadratic Assignment Problem

    PubMed Central

    Lim, Wee Loon; Wibowo, Antoni; Desa, Mohammad Ishak; Haron, Habibollah

    2016-01-01

    The quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-based optimization (BBO), a relatively new optimization technique based on the biogeography concept, uses the idea of migration strategy of species to derive algorithm for solving optimization problems. It has been shown that BBO provides performance on a par with other optimization methods. A classical BBO algorithm employs the mutation operator as its diversification strategy. However, this process will often ruin the quality of solutions in QAP. In this paper, we propose a hybrid technique to overcome the weakness of classical BBO algorithm to solve QAP, by replacing the mutation operator with a tabu search procedure. Our experiments using the benchmark instances from QAPLIB show that the proposed hybrid method is able to find good solutions for them within reasonable computational times. Out of 61 benchmark instances tested, the proposed method is able to obtain the best known solutions for 57 of them. PMID:26819585

  16. Optimal piecewise linear schedules for LSGP- and LPGS-decomposed array processors via quadratic programming

    NASA Astrophysics Data System (ADS)

    Zimmermann, Karl-Heinz; Achtziger, Wolfgang

    2001-09-01

    The size of a systolic array synthesized from a uniform recurrence equation, whose computations are mapped by a linear function to the processors, matches the problem size. In practice, however, there exist several limiting factors on the array size. There are two dual schemes available to derive arrays of smaller size from large-size systolic arrays based on the partitioning of the large-size arrays into subarrays. In LSGP, the subarrays are clustered one-to-one into the processors of a small-size array, while in LPGS, the subarrays are serially assigned to a reduced-size array. In this paper, we propose a common methodology for both LSGP and LPGS based on polyhedral partitionings of large-size k-dimensional systolic arrays which are synthesized from n-dimensional uniform recurrences by linear mappings for allocation and timing. In particular, we address the optimization problem of finding optimal piecewise linear timing functions for small-size arrays. These are mappings composed of linear timing functions for the computations of the subarrays. We study a continuous approximation of this problem by passing from piecewise linear to piecewise quasi-linear timing functions. The resultant problem formulation is then a quadratic programming problem which can be solved by standard algorithms for nonlinear optimization problems.

  17. A Genetic Algorithm with the Improved 2-opt Method for Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Matayoshi, Mitsukuni; Nakamura, Morikazu; Miyagi, Hayao

    We propose a new 2-opt base method as a local search approach used with Genetic Algorithms (GAs) in Memetic Algorithm. We got a hint from the fast 2-opt method and devised the new 2-opt method. The main different point is such that our method exchanges genes by using histories of contributions to fitness value improvement. The contribution level is represented by the value `Priority’. In computer experiment, Quadratic Assignment Problem (QAP) instances are solved by GA with the 2-opt method(First Admissible Move Strategy, the Best Admissible Move Strategy), the fast 2-opt, and our proposed method for comparative evaluation. The results showed that our improved method obtained better solutions at ealier generation of the GA and our method required less computation time than the others at some upper bound value of appropriate `Priority’ setting values. Specially, at the average elapsed time of the fast 2-opt method’s 1000th generation, the exact solution findings of ours is more than the others. In further experiment, we observe that the searching capability depends on the number of levels of `Priority’. The ratio between two different Priority level sets becomes 1.59 in computation time in solving problem instance “char25a". This characteristic is shown to be statistically significant in ten instances among eleven.

  18. Quadratic phase error compensation algorithm based on phase cancellation for ISAIL

    NASA Astrophysics Data System (ADS)

    Zang, Bo; Li, Qi; Ji, Hong-Bing; Tang, Yu

    2013-09-01

    As a product combining inverse synthetic aperture technology with coherent laser technology, Inverse Synthetic Aperture Imaging Ladar (ISAIL) overcomes the diffraction limit of the telescope's aperture, while it supplies a much better range resolution which will not get worse at long range when the diameter telescope optics becomes smaller. Compared with traditional microwave imaging radar, SAIL can provide a much higher-resolution image because of shorter wavelength, and its shorter imaging time for coherent integration takes a great part in practical application. The rotational motion of target generates Migration through Range Cells (MTRC) because of the ultra-high resolution of ISAIL. Quadratic Phase Error (QPE) caused by Migration through Range Cells (MTRC) during the imaging time makes ISAIL image smeared. It is difficult to estimate the QPE through traditional motion compensation algorithm. To solve this problem in the case of uniform rotation rate, a novel QPE compensation method, based on Phase Cancellation (PC), is proposed. Firstly, a rough range of QPE coefficient related to the wave-length, length of the target, and the rotating angle is estimated. Then, through 1-D search, the QPE coefficient is obtained exactly. Finally, the QPE compensation is achieved. The ISAIL imaging experiments with numerical data validate the feasibility and effectiveness of the proposed algorithm.

  19. Evaluation of a photovoltaic energy mechatronics system with a built-in quadratic maximum power point tracking algorithm

    SciTech Connect

    Chao, R.M.; Ko, S.H.; Lin, I.H.; Pai, F.S.; Chang, C.C.

    2009-12-15

    The historically high cost of crude oil price is stimulating research into solar (green) energy as an alternative energy source. In general, applications with large solar energy output require a maximum power point tracking (MPPT) algorithm to optimize the power generated by the photovoltaic effect. This work aims to provide a stand-alone solution for solar energy applications by integrating a DC/DC buck converter to a newly developed quadratic MPPT algorithm along with its appropriate software and hardware. The quadratic MPPT method utilizes three previously used duty cycles with their corresponding power outputs. It approaches the maximum value by using a second order polynomial formula, which converges faster than the existing MPPT algorithm. The hardware implementation takes advantage of the real-time controller system from National Instruments, USA. Experimental results have shown that the proposed solar mechatronics system can correctly and effectively track the maximum power point without any difficulties. (author)

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

    PubMed

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

    2015-01-01

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

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

    PubMed Central

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

    2015-01-01

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

  2. A new gradient-based neural network for solving linear and quadratic programming problems.

    PubMed

    Leung, Y; Chen, K Z; Jiao, Y C; Gao, X B; Leung, K S

    2001-01-01

    A new gradient-based neural network is constructed on the basis of the duality theory, optimization theory, convex analysis theory, Lyapunov stability theory, and LaSalle invariance principle to solve linear and quadratic programming problems. In particular, a new function F(x, y) is introduced into the energy function E(x, y) such that the function E(x, y) is convex and differentiable, and the resulting network is more efficient. This network involves all the relevant necessary and sufficient optimality conditions for convex quadratic programming problems. For linear programming and quadratic programming (QP) problems with unique and infinite number of solutions, we have proven strictly that for any initial point, every trajectory of the neural network converges to an optimal solution of the QP and its dual problem. The proposed network is different from the existing networks which use the penalty method or Lagrange method, and the inequality constraints are properly handled. The simulation results show that the proposed neural network is feasible and efficient.

  3. Fitting timeseries by continuous-time Markov chains: A quadratic programming approach

    SciTech Connect

    Crommelin, D.T. . E-mail: crommelin@cims.nyu.edu; Vanden-Eijnden, E. . E-mail: eve2@cims.nyu.edu

    2006-09-20

    Construction of stochastic models that describe the effective dynamics of observables of interest is an useful instrument in various fields of application, such as physics, climate science, and finance. We present a new technique for the construction of such models. From the timeseries of an observable, we construct a discrete-in-time Markov chain and calculate the eigenspectrum of its transition probability (or stochastic) matrix. As a next step we aim to find the generator of a continuous-time Markov chain whose eigenspectrum resembles the observed eigenspectrum as closely as possible, using an appropriate norm. The generator is found by solving a minimization problem: the norm is chosen such that the object function is quadratic and convex, so that the minimization problem can be solved using quadratic programming techniques. The technique is illustrated on various toy problems as well as on datasets stemming from simulations of molecular dynamics and of atmospheric flows.

  4. Fitting timeseries by continuous-time Markov chains: A quadratic programming approach

    NASA Astrophysics Data System (ADS)

    Crommelin, D. T.; Vanden-Eijnden, E.

    2006-09-01

    Construction of stochastic models that describe the effective dynamics of observables of interest is an useful instrument in various fields of application, such as physics, climate science, and finance. We present a new technique for the construction of such models. From the timeseries of an observable, we construct a discrete-in-time Markov chain and calculate the eigenspectrum of its transition probability (or stochastic) matrix. As a next step we aim to find the generator of a continuous-time Markov chain whose eigenspectrum resembles the observed eigenspectrum as closely as possible, using an appropriate norm. The generator is found by solving a minimization problem: the norm is chosen such that the object function is quadratic and convex, so that the minimization problem can be solved using quadratic programming techniques. The technique is illustrated on various toy problems as well as on datasets stemming from simulations of molecular dynamics and of atmospheric flows.

  5. A combined parametric quadratic programming and precise integration method based dynamic analysis of elastic-plastic hardening/softening problems

    NASA Astrophysics Data System (ADS)

    Hongwu, Zhang; Xinwei, Zhang

    2002-12-01

    The objective of the paper is to develop a new algorithm for numerical solution of dynamic elastic-plastic strain hardening/softening problems. The gradient dependent model is adopted in the numerical model to overcome the result mesh-sensitivity problem in the dynamic strain softening or strain localization analysis. The equations for the dynamic elastic-plastic problems are derived in terms of the parametric variational principle, which is valid for associated, non-associated and strain softening plastic constitutive models in the finite element analysis. The precise integration method, which has been widely used for discretization in time domain of the linear problems, is introduced for the solution of dynamic nonlinear equations. The new algorithm proposed is based on the combination of the parametric quadratic programming method and the precise integration method and has all the advantages in both of the algorithms. Results of numerical examples demonstrate not only the validity, but also the advantages of the algorithm proposed for the numerical solution of nonlinear dynamic problems.

  6. An algorithm for the solution of dynamic linear programs

    NASA Technical Reports Server (NTRS)

    Psiaki, Mark L.

    1989-01-01

    The algorithm's objective is to efficiently solve Dynamic Linear Programs (DLP) by taking advantage of their special staircase structure. This algorithm constitutes a stepping stone to an improved algorithm for solving Dynamic Quadratic Programs, which, in turn, would make the nonlinear programming method of Successive Quadratic Programs more practical for solving trajectory optimization problems. The ultimate goal is to being trajectory optimization solution speeds into the realm of real-time control. The algorithm exploits the staircase nature of the large constraint matrix of the equality-constrained DLPs encountered when solving inequality-constrained DLPs by an active set approach. A numerically-stable, staircase QL factorization of the staircase constraint matrix is carried out starting from its last rows and columns. The resulting recursion is like the time-varying Riccati equation from multi-stage LQR theory. The resulting factorization increases the efficiency of all of the typical LP solution operations over that of a dense matrix LP code. At the same time numerical stability is ensured. The algorithm also takes advantage of dynamic programming ideas about the cost-to-go by relaxing active pseudo constraints in a backwards sweeping process. This further decreases the cost per update of the LP rank-1 updating procedure, although it may result in more changes of the active set that if pseudo constraints were relaxed in a non-stagewise fashion. The usual stability of closed-loop Linear/Quadratic optimally-controlled systems, if it carries over to strictly linear cost functions, implies that the saving due to reduced factor update effort may outweigh the cost of an increased number of updates. An aerospace example is presented in which a ground-to-ground rocket's distance is maximized. This example demonstrates the applicability of this class of algorithms to aerospace guidance. It also sheds light on the efficacy of the proposed pseudo constraint relaxation

  7. Identify five kinds of simple super-secondary structures with quadratic discriminant algorithm based on the chemical shifts.

    PubMed

    Kou, Gaoshan; Feng, Yonge

    2015-09-07

    The biological function of protein is largely determined by its spatial structure. The research on the relationship between structure and function is the basis of protein structure prediction. However, the prediction of super secondary structure is an important step in the prediction of protein spatial structure. Many algorithms have been proposed for the prediction of protein super secondary structure. However, the parameters used by these methods were primarily based on amino acid sequences. In this paper, we proposed a novel model for predicting five kinds of protein super secondary structures based on the chemical shifts (CSs). Firstly, we analyzed the statistical distribution of chemical shifts of six nuclei in five kinds of protein super secondary structures by using the analysis of variance (ANOVA). Secondly, we used chemical shifts of six nuclei as features, and combined with quadratic discriminant analysis (QDA) to predict five kinds of protein super secondary structures. Finally, we achieved the averaged sensitivity, specificity and the overall accuracy of 81.8%, 95.19%, 82.91%, respectively in seven-fold cross-validation. Moreover, we have performed the prediction by combining the five different chemical shifts as features, the maximum overall accuracy up to 89.87% by using the C,Cα,Cβ,N,Hα of Hα chemical shifts, which are clearly superior to that of the quadratic discriminant analysis (QDA) algorithm by using 20 amino acid compositions (AAC) as feature in the seven-fold cross-validation. These results demonstrated that chemical shifts (CSs) are indeed an outstanding parameter for the prediction of five kinds of super secondary structures. In addition, we compared the prediction of the quadratic discriminant analysis (QDA) with that of support vector machine (SVM) by using the same six CSs as features. The result suggested that the quadratic discriminant analysis method by using chemical shifts as features is a good predictor for protein super

  8. A plasticity integration algorithm motivated by analytical integration of a generalized quadratic function

    SciTech Connect

    Becker, R

    2006-03-03

    The goal is to examine the dependence of the plastic flow direction as a function of strain increment for a generalized quadratic flow potential; and from that, extract a scheme for constructing a plastic flow direction for a more general class of yield and flow surfaces.

  9. Algorithmic advances in stochastic programming

    SciTech Connect

    Morton, D.P.

    1993-07-01

    Practical planning problems with deterministic forecasts of inherently uncertain parameters often yield unsatisfactory solutions. Stochastic programming formulations allow uncertain parameters to be modeled as random variables with known distributions, but the size of the resulting mathematical programs can be formidable. Decomposition-based algorithms take advantage of special structure and provide an attractive approach to such problems. We consider two classes of decomposition-based stochastic programming algorithms. The first type of algorithm addresses problems with a ``manageable`` number of scenarios. The second class incorporates Monte Carlo sampling within a decomposition algorithm. We develop and empirically study an enhanced Benders decomposition algorithm for solving multistage stochastic linear programs within a prespecified tolerance. The enhancements include warm start basis selection, preliminary cut generation, the multicut procedure, and decision tree traversing strategies. Computational results are presented for a collection of ``real-world`` multistage stochastic hydroelectric scheduling problems. Recently, there has been an increased focus on decomposition-based algorithms that use sampling within the optimization framework. These approaches hold much promise for solving stochastic programs with many scenarios. A critical component of such algorithms is a stopping criterion to ensure the quality of the solution. With this as motivation, we develop a stopping rule theory for algorithms in which bounds on the optimal objective function value are estimated by sampling. Rules are provided for selecting sample sizes and terminating the algorithm under which asymptotic validity of confidence interval statements for the quality of the proposed solution can be verified. Issues associated with the application of this theory to two sampling-based algorithms are considered, and preliminary empirical coverage results are presented.

  10. A Hybrid Evolutionary Algorithm to Quadratic Three-Dimensional Assignment Problem with Local Search for Many-Core Graphics Processors

    NASA Astrophysics Data System (ADS)

    Lipinski, Piotr

    This paper concerns the quadratic three-dimensional assignment problem (Q3AP), an extension of the quadratic assignment problem (QAP), and proposes an efficient hybrid evolutionary algorithm combining stochastic optimization and local search with a number of crossover operators, a number of mutation operators and an auto-adaptation mechanism. Auto-adaptation manages the pool of evolutionary operators applying different operators in different computation phases to better explore the search space and to avoid premature convergence. Local search additionally optimizes populations of candidate solutions and accelerates evolutionary search. It uses a many-core graphics processor to optimize a number of solutions in parallel, which enables its incorporation into the evolutionary algorithm without excessive increases in the computation time. Experiments performed on benchmark Q3AP instances derived from the classic QAP instances proposed by Nugent et al. confirmed that the proposed algorithm is able to find optimal solutions to Q3AP in a reasonable time and outperforms best known results found in the literature.

  11. An Augmented Lagrangian Method for a Class of Inverse Quadratic Programming Problems

    SciTech Connect

    Zhang Jianzhong; Zhang Liwei

    2010-02-15

    We consider an inverse quadratic programming (QP) problem in which the parameters in the objective function of a given QP problem are adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a minimization problem with a positive semidefinite cone constraint and its dual is a linearly constrained semismoothly differentiable (SC{sup 1}) convex programming problem with fewer variables than the original one. We demonstrate the global convergence of the augmented Lagrangian method for the dual problem and prove that the convergence rate of primal iterates, generated by the augmented Lagrange method, is proportional to 1/r, and the rate of multiplier iterates is proportional to 1/{radical}r, where r is the penalty parameter in the augmented Lagrangian. As the objective function of the dual problem is a SC{sup 1} function involving the projection operator onto the cone of symmetrically semi-definite matrices, the analysis requires extensive tools such as the singular value decomposition of matrices, an implicit function theorem for semismooth functions, and properties of the projection operator in the symmetric-matrix space. Furthermore, the semismooth Newton method with Armijo line search is applied to solve the subproblems in the augmented Lagrange approach, which is proven to have global convergence and local quadratic rate. Finally numerical results, implemented by the augmented Lagrangian method, are reported.

  12. Programming the gradient projection algorithm

    NASA Technical Reports Server (NTRS)

    Hargrove, A.

    1983-01-01

    The gradient projection method of numerical optimization which is applied to problems having linear constraints but nonlinear objective functions is described and analyzed. The algorithm is found to be efficient and thorough for small systems, but requires the addition of auxiliary methods and programming for large scale systems with severe nonlinearities. In order to verify the theoretical results a digital computer is used to simulate the algorithm.

  13. Quadratic programming-based approach for autonomous vehicle path planning in space

    NASA Astrophysics Data System (ADS)

    Chen, Yang; Han, Jianda; Wu, Huaiyu

    2012-07-01

    Path planning for space vehicles is still a challenging problem although considerable progress has been made over the past decades. The major difficulties are that most of existing methods only adapt to static environment instead of dynamic one, and also can not solve the inherent constraints arising from the robot body and the exterior environment. To address these difficulties, this research aims to provide a feasible trajectory based on quadratic programming(QP) for path planning in three-dimensional space where an autonomous vehicle is requested to pursue a target while avoiding static or dynamic obstacles. First, the objective function is derived from the pursuit task which is defined in terms of the relative distance to the target, as well as the angle between the velocity and the position in the relative velocity coordinates(RVCs). The optimization is in quadratic polynomial form according to QP formulation. Then, the avoidance task is modeled with linear constraints in RVCs. Some other constraints, such as kinematics, dynamics, and sensor range, are included. Last, simulations with typical multiple obstacles are carried out, including in static and dynamic environments and one of human-in-the-loop. The results indicate that the optimal trajectories of the autonomous robot in three-dimensional space satisfy the required performances. Therefore, the QP model proposed in this paper not only adapts to dynamic environment with uncertainty, but also can satisfy all kinds of constraints, and it provides an efficient approach to solve the problems of path planning in three-dimensional space.

  14. AESOP: An interactive computer program for the design of linear quadratic regulators and Kalman filters

    NASA Technical Reports Server (NTRS)

    Lehtinen, B.; Geyser, L. C.

    1984-01-01

    AESOP is a computer program for use in designing feedback controls and state estimators for linear multivariable systems. AESOP is meant to be used in an interactive manner. Each design task that the program performs is assigned a "function" number. The user accesses these functions either (1) by inputting a list of desired function numbers or (2) by inputting a single function number. In the latter case the choice of the function will in general depend on the results obtained by the previously executed function. The most important of the AESOP functions are those that design,linear quadratic regulators and Kalman filters. The user interacts with the program when using these design functions by inputting design weighting parameters and by viewing graphic displays of designed system responses. Supporting functions are provided that obtain system transient and frequency responses, transfer functions, and covariance matrices. The program can also compute open-loop system information such as stability (eigenvalues), eigenvectors, controllability, and observability. The program is written in ANSI-66 FORTRAN for use on an IBM 3033 using TSS 370. Descriptions of all subroutines and results of two test cases are included in the appendixes.

  15. An efficient ensemble of radial basis functions method based on quadratic programming

    NASA Astrophysics Data System (ADS)

    Shi, Renhe; Liu, Li; Long, Teng; Liu, Jian

    2016-07-01

    Radial basis function (RBF) surrogate models have been widely applied in engineering design optimization problems to approximate computationally expensive simulations. Ensemble of radial basis functions (ERBF) using the weighted sum of stand-alone RBFs improves the approximation performance. To achieve a good trade-off between the accuracy and efficiency of the modelling process, this article presents a novel efficient ERBF method to determine the weights through solving a quadratic programming subproblem, denoted ERBF-QP. Several numerical benchmark functions are utilized to test the performance of the proposed ERBF-QP method. The results show that ERBF-QP can significantly improve the modelling efficiency compared with several existing ERBF methods. Moreover, ERBF-QP also provides satisfactory performance in terms of approximation accuracy. Finally, the ERBF-QP method is applied to a satellite multidisciplinary design optimization problem to illustrate its practicality and effectiveness for real-world engineering applications.

  16. Using convex quadratic programming to model random media with Gaussian random fields

    SciTech Connect

    Quintanilla, John A.; Jones, W. Max

    2007-04-15

    Excursion sets of Gaussian random fields (GRFs) have been frequently used in the literature to model two-phase random media with measurable phase autocorrelation functions. The goal of successful modeling is finding the optimal field autocorrelation function that best approximates the prescribed phase autocorrelation function. In this paper, we present a technique which uses convex quadratic programming to find the best admissible field autocorrelation function under a prescribed discretization. Unlike previous methods, this technique efficiently optimizes over all admissible field autocorrelation functions, instead of optimizing only over a predetermined parametrized family. The results from using this technique indicate that the GRF model is significantly more versatile than observed in previous studies. An application to modeling a base-catalyzed tetraethoxysilane aerogel system given small-angle neutron scattering data is also presented.

  17. SEMI-DEFINITE PROGRAMMING TECHNIQUES FOR STRUCTURED QUADRATIC INVERSE EIGENVALUE PROBLEMS

    PubMed Central

    LIN, MATTHEW M.; DONG, BO; CHU, MOODY T.

    2014-01-01

    In the past decade or so, semi-definite programming (SDP) has emerged as a powerful tool capable of handling a remarkably wide range of problems. This article describes an innovative application of SDP techniques to quadratic inverse eigenvalue problems (QIEPs). The notion of QIEPs is of fundamental importance because its ultimate goal of constructing or updating a vibration system from some observed or desirable dynamical behaviors while respecting some inherent feasibility constraints well suits many engineering applications. Thus far, however, QIEPs have remained challenging both theoretically and computationally due to the great variations of structural constraints that must be addressed. Of notable interest and significance are the uniformity and the simplicity in the SDP formulation that solves effectively many otherwise very difficult QIEPs. PMID:25392603

  18. Quadratic eigenvalue problems.

    SciTech Connect

    Walsh, Timothy Francis; Day, David Minot

    2007-04-01

    In this report we will describe some nonlinear eigenvalue problems that arise in the areas of solid mechanics, acoustics, and coupled structural acoustics. We will focus mostly on quadratic eigenvalue problems, which are a special case of nonlinear eigenvalue problems. Algorithms for solving the quadratic eigenvalue problem will be presented, along with some example calculations.

  19. A Linear Quadratic Regulator Weight Selection Algorithm for Robust Pole Assignment

    DTIC Science & Technology

    1990-12-01

    MATLAB . Five test cases are run with the algorithm. First and second order systems that can be solved in closed form are compared with the algorithm poles...The MATLAB "m"-file used to solve the second order SISO system is included in appendix A. Run time on the Compaq 286 was 4 minutes. Table I! Second...poles but it should get close. When this system 3 was run on MATLAB with the algorithm m-files, the achievable poles were found to be -2.096 z 2.389j

  20. Unified development of multiplicative algorithms for linear and quadratic nonnegative matrix factorization.

    PubMed

    Yang, Zhirong; Oja, Erkki

    2011-12-01

    Multiplicative updates have been widely used in approximative nonnegative matrix factorization (NMF) optimization because they are convenient to deploy. Their convergence proof is usually based on the minimization of an auxiliary upper-bounding function, the construction of which however remains specific and only available for limited types of dissimilarity measures. Here we make significant progress in developing convergent multiplicative algorithms for NMF. First, we propose a general approach to derive the auxiliary function for a wide variety of NMF problems, as long as the approximation objective can be expressed as a finite sum of monomials with real exponents. Multiplicative algorithms with theoretical guarantee of monotonically decreasing objective function sequence can thus be obtained. The solutions of NMF based on most commonly used dissimilarity measures such as α- and β-divergence as well as many other more comprehensive divergences can be derived by the new unified principle. Second, our method is extended to a nonseparable case that includes e.g., γ-divergence and Rényi divergence. Third, we develop multiplicative algorithms for NMF using second-order approximative factorizations, in which each factorizing matrix may appear twice. Preliminary numerical experiments demonstrate that the multiplicative algorithms developed using the proposed procedure can achieve satisfactory Karush-Kuhn-Tucker optimality. We also demonstrate NMF problems where algorithms by the conventional method fail to guarantee descent at each iteration but those by our principle are immune to such violation.

  1. Enhanced algorithms for stochastic programming

    SciTech Connect

    Krishna, A.S.

    1993-09-01

    In this dissertation, we present some of the recent advances made in solving two-stage stochastic linear programming problems of large size and complexity. Decomposition and sampling are two fundamental components of techniques to solve stochastic optimization problems. We describe improvements to the current techniques in both these areas. We studied different ways of using importance sampling techniques in the context of Stochastic programming, by varying the choice of approximation functions used in this method. We have concluded that approximating the recourse function by a computationally inexpensive piecewise-linear function is highly efficient. This reduced the problem from finding the mean of a computationally expensive functions to finding that of a computationally inexpensive function. Then we implemented various variance reduction techniques to estimate the mean of a piecewise-linear function. This method achieved similar variance reductions in orders of magnitude less time than, when we directly applied variance-reduction techniques directly on the given problem. In solving a stochastic linear program, the expected value problem is usually solved before a stochastic solution and also to speed-up the algorithm by making use of the information obtained from the solution of the expected value problem. We have devised a new decomposition scheme to improve the convergence of this algorithm.

  2. Trigonometric quadratic B-spline subdomain Galerkin algorithm for the Burgers' equation

    NASA Astrophysics Data System (ADS)

    Ay, Buket; Dag, Idris; Gorgulu, Melis Zorsahin

    2015-12-01

    A variant of the subdomain Galerkin method has been set up to find numerical solutions of the Burgers' equation. Approximate function consists of the combination of the trigonometric B-splines. Integration of Burgers' equation has been achived by aid of the subdomain Galerkin method based on the trigonometric B-splines as an approximate functions. The resulting first order ordinary differential system has been converted into an iterative algebraic equation by use of the Crank-Nicolson method at successive two time levels. The suggested algorithm is tested on somewell-known problems for the Burgers' equation.

  3. Quadratic Damping

    ERIC Educational Resources Information Center

    Fay, Temple H.

    2012-01-01

    Quadratic friction involves a discontinuous damping term in equations of motion in order that the frictional force always opposes the direction of the motion. Perhaps for this reason this topic is usually omitted from beginning texts in differential equations and physics. However, quadratic damping is more realistic than viscous damping in many…

  4. A new algorithm for quadratic sample entropy optimization for very short biomedical signals: application to blood pressure records.

    PubMed

    Cirugeda-Roldán, E M; Cuesta-Frau, D; Miró-Martínez, P; Oltra-Crespo, S; Vigil-Medina, L; Varela-Entrecanales, M

    2014-05-01

    This paper describes a new method to optimize the computation of the quadratic sample entropy (QSE) metric. The objective is to enhance its segmentation capability between pathological and healthy subjects for short and unevenly sampled biomedical records, like those obtained using ambulatory blood pressure monitoring (ABPM). In ABPM, blood pressure is measured every 20-30 min during 24h while patients undergo normal daily activities. ABPM is indicated for a number of applications such as white-coat, suspected, borderline, or masked hypertension. Hypertension is a very important clinical issue that can lead to serious health implications, and therefore its identification and characterization is of paramount importance. Nonlinear processing of signals by means of entropy calculation algorithms has been used in many medical applications to distinguish among signal classes. However, most of these methods do not perform well if the records are not long enough and/or not uniformly sampled. That is the case for ABPM records. These signals are extremely short and scattered with outliers or missing/resampled data. This is why ABPM Blood pressure signal screening using nonlinear methods is a quite unexplored field. We propose an additional stage for the computation of QSE independently of its parameter r and the input signal length. This enabled us to apply a segmentation process to ABPM records successfully. The experimental dataset consisted of 61 blood pressure data records of control and pathological subjects with only 52 samples per time series. The entropy estimation values obtained led to the segmentation of the two groups, while other standard nonlinear methods failed.

  5. A Comparative Analysis of DBSCAN, K-Means, and Quadratic Variation Algorithms for Automatic Identification of Swallows from Swallowing Accelerometry Signals

    PubMed Central

    Dudik, Joshua M.; Kurosu, Atsuko; Coyle, James L

    2015-01-01

    Background Cervical auscultation with high resolution sensors is currently under consideration as a method of automatically screening for specific swallowing abnormalities. To be clinically useful without human involvement, any devices based on cervical auscultation should be able to detect specified swallowing events in an automatic manner. Methods In this paper, we comparatively analyze the density-based spatial clustering of applications with noise algorithm (DBSCAN), a k-means based algorithm, and an algorithm based on quadratic variation as methods of differentiating periods of swallowing activity from periods of time without swallows. These algorithms utilized swallowing vibration data exclusively and compared the results to a gold standard measure of swallowing duration. Data was collected from 23 subjects that were actively suffering from swallowing difficulties. Results Comparing the performance of the DBSCAN algorithm with a proven segmentation algorithm that utilizes k-means clustering demonstrated that the DBSCAN algorithm had a higher sensitivity and correctly segmented more swallows. Comparing its performance with a threshold-based algorithm that utilized the quadratic variation of the signal showed that the DBSCAN algorithm offered no direct increase in performance. However, it offered several other benefits including a faster run time and more consistent performance between patients. All algorithms showed noticeable differen-tiation from the endpoints provided by a videofluoroscopy examination as well as reduced sensitivity. Conclusions In summary, we showed that the DBSCAN algorithm is a viable method for detecting the occurrence of a swallowing event using cervical auscultation signals, but significant work must be done to improve its performance before it can be implemented in an unsupervised manner. PMID:25658505

  6. KENO-VI: A Monte Carlo Criticality Program with generalized quadratic geometry

    SciTech Connect

    Hollenbach, D.F.; Petrie, L.M.; Landers, N.F.

    1993-07-01

    This report discusses KENO-VI which is a new version of the KENO monte Carlo Criticality Safety developed at Oak Ridge National Laboratory. The purpose of KENO-VI is to provide a criticality safety code similar to KENO-V.a that possesses a more general and flexible geometry package. KENO-VI constructs and processes geometry data as sets of quadratic equations. A lengthy set of simple, easy-to-use geometric functions, similar to those provided in KENO-V.a., and the ability to build more complex geometric shapes represented by sets of quadratic equations are the heart of the geometry package in KENO-VI. The code`s flexibility is increased by allowing intersecting geometry regions, hexagonal as well as cuboidal arrays, and the ability to specify an array boundary that intersects the array.

  7. Application’s Method of Quadratic Programming for Optimization of Portfolio Selection

    NASA Astrophysics Data System (ADS)

    Kawamoto, Shigeru; Takamoto, Masanori; Kobayashi, Yasuhiro

    Investors or fund-managers face with optimization of portfolio selection, which means that determine the kind and the quantity of investment among several brands. We have developed a method to obtain optimal stock’s portfolio more rapidly from twice to three times than conventional method with efficient universal optimization. The method is characterized by quadratic matrix of utility function and constrained matrices divided into several sub-matrices by focusing on structure of these matrices.

  8. Genetic algorithms as discovery programs

    SciTech Connect

    Hilliard, M.R.; Liepins, G.

    1986-01-01

    Genetic algorithms are mathematical counterparts to natural selection and gene recombination. As such, they have provided one of the few significant breakthroughs in machine learning. Used with appropriate reward functions and apportionment of credit, they have been successfully applied to gas pipeline operation, x-ray registration and mathematical optimization problems. This paper discusses the basics of genetic algorithms, describes a few successes, and reports on current progress at Oak Ridge National Laboratory in applications to set covering and simulated robots.

  9. Integration of a Decentralized Linear-Quadratic-Gaussian Control into GSFC's Universal 3-D Autonomous Formation Flying Algorithm

    NASA Technical Reports Server (NTRS)

    Folta, David C.; Carpenter, J. Russell

    1999-01-01

    A decentralized control is investigated for applicability to the autonomous formation flying control algorithm developed by GSFC for the New Millenium Program Earth Observer-1 (EO-1) mission. This decentralized framework has the following characteristics: The approach is non-hierarchical, and coordination by a central supervisor is not required; Detected failures degrade the system performance gracefully; Each node in the decentralized network processes only its own measurement data, in parallel with the other nodes; Although the total computational burden over the entire network is greater than it would be for a single, centralized controller, fewer computations are required locally at each node; Requirements for data transmission between nodes are limited to only the dimension of the control vector, at the cost of maintaining a local additional data vector. The data vector compresses all past measurement history from all the nodes into a single vector of the dimension of the state; and The approach is optimal with respect to standard cost functions. The current approach is valid for linear time-invariant systems only. Similar to the GSFC formation flying algorithm, the extension to linear LQG time-varying systems requires that each node propagate its filter covariance forward (navigation) and controller Riccati matrix backward (guidance) at each time step. Extension of the GSFC algorithm to non-linear systems can also be accomplished via linearization about a reference trajectory in the standard fashion, or linearization about the current state estimate as with the extended Kalman filter. To investigate the feasibility of the decentralized integration with the GSFC algorithm, an existing centralized LQG design for a single spacecraft orbit control problem is adapted to the decentralized framework while using the GSFC algorithm's state transition matrices and framework. The existing GSFC design uses both reference trajectories of each spacecraft in formation and

  10. AQMAN; linear and quadratic programming matrix generator using two-dimensional ground-water flow simulation for aquifer management modeling

    USGS Publications Warehouse

    Lefkoff, L.J.; Gorelick, S.M.

    1987-01-01

    A FORTRAN-77 computer program code that helps solve a variety of aquifer management problems involving the control of groundwater hydraulics. It is intended for use with any standard mathematical programming package that uses Mathematical Programming System input format. The computer program creates the input files to be used by the optimization program. These files contain all the hydrologic information and management objectives needed to solve the management problem. Used in conjunction with a mathematical programming code, the computer program identifies the pumping or recharge strategy that achieves a user 's management objective while maintaining groundwater hydraulic conditions within desired limits. The objective may be linear or quadratic, and may involve the minimization of pumping and recharge rates or of variable pumping costs. The problem may contain constraints on groundwater heads, gradients, and velocities for a complex, transient hydrologic system. Linear superposition of solutions to the transient, two-dimensional groundwater flow equation is used by the computer program in conjunction with the response matrix optimization method. A unit stress is applied at each decision well and transient responses at all control locations are computed using a modified version of the U.S. Geological Survey two dimensional aquifer simulation model. The program also computes discounted cost coefficients for the objective function and accounts for transient aquifer conditions. (Author 's abstract)

  11. Taylor O(h³) Discretization of ZNN Models for Dynamic Equality-Constrained Quadratic Programming With Application to Manipulators.

    PubMed

    Liao, Bolin; Zhang, Yunong; Jin, Long

    2016-02-01

    In this paper, a new Taylor-type numerical differentiation formula is first presented to discretize the continuous-time Zhang neural network (ZNN), and obtain higher computational accuracy. Based on the Taylor-type formula, two Taylor-type discrete-time ZNN models (termed Taylor-type discrete-time ZNNK and Taylor-type discrete-time ZNNU models) are then proposed and discussed to perform online dynamic equality-constrained quadratic programming. For comparison, Euler-type discrete-time ZNN models (called Euler-type discrete-time ZNNK and Euler-type discrete-time ZNNU models) and Newton iteration, with interesting links being found, are also presented. It is proved herein that the steady-state residual errors of the proposed Taylor-type discrete-time ZNN models, Euler-type discrete-time ZNN models, and Newton iteration have the patterns of O(h(3)), O(h(2)), and O(h), respectively, with h denoting the sampling gap. Numerical experiments, including the application examples, are carried out, of which the results further substantiate the theoretical findings and the efficacy of Taylor-type discrete-time ZNN models. Finally, the comparisons with Taylor-type discrete-time derivative model and other Lagrange-type discrete-time ZNN models for dynamic equality-constrained quadratic programming substantiate the superiority of the proposed Taylor-type discrete-time ZNN models once again.

  12. A new numerical approach to solve Thomas-Fermi model of an atom using bio-inspired heuristics integrated with sequential quadratic programming.

    PubMed

    Raja, Muhammad Asif Zahoor; Zameer, Aneela; Khan, Aziz Ullah; Wazwaz, Abdul Majid

    2016-01-01

    In this study, a novel bio-inspired computing approach is developed to analyze the dynamics of nonlinear singular Thomas-Fermi equation (TFE) arising in potential and charge density models of an atom by exploiting the strength of finite difference scheme (FDS) for discretization and optimization through genetic algorithms (GAs) hybrid with sequential quadratic programming. The FDS procedures are used to transform the TFE differential equations into a system of nonlinear equations. A fitness function is constructed based on the residual error of constituent equations in the mean square sense and is formulated as the minimization problem. Optimization of parameters for the system is carried out with GAs, used as a tool for viable global search integrated with SQP algorithm for rapid refinement of the results. The design scheme is applied to solve TFE for five different scenarios by taking various step sizes and different input intervals. Comparison of the proposed results with the state of the art numerical and analytical solutions reveals that the worth of our scheme in terms of accuracy and convergence. The reliability and effectiveness of the proposed scheme are validated through consistently getting optimal values of statistical performance indices calculated for a sufficiently large number of independent runs to establish its significance.

  13. A class of finite-time dual neural networks for solving quadratic programming problems and its k-winners-take-all application.

    PubMed

    Li, Shuai; Li, Yangming; Wang, Zheng

    2013-03-01

    This paper presents a class of recurrent neural networks to solve quadratic programming problems. Different from most existing recurrent neural networks for solving quadratic programming problems, the proposed neural network model converges in finite time and the activation function is not required to be a hard-limiting function for finite convergence time. The stability, finite-time convergence property and the optimality of the proposed neural network for solving the original quadratic programming problem are proven in theory. Extensive simulations are performed to evaluate the performance of the neural network with different parameters. In addition, the proposed neural network is applied to solving the k-winner-take-all (k-WTA) problem. Both theoretical analysis and numerical simulations validate the effectiveness of our method for solving the k-WTA problem.

  14. Evolving a Nelder-Mead Algorithm for Optimization with Genetic Programming.

    PubMed

    Fajfar, Iztok; Puhan, Janez; Bűrmen, Árpád

    2016-01-25

    We used genetic programming to evolve a direct search optimization algorithm, similar to that of the standard downhill simplex optimization method proposed by Nelder and Mead (1965). In the training process, we used several ten-dimensional quadratic functions with randomly displaced parameters and different randomly generated starting simplices. The genetically obtained optimization algorithm showed overall better performance than the original Nelder-Mead method on a standard set of test functions. We observed that many parts of the genetically produced algorithm were seldom or never executed, which allowed us to greatly simplify the algorithm by removing the redundant parts. The resulting algorithm turns out to be considerably simpler than the original Nelder-Mead method while still performing better than the original method.

  15. Quantum Algorithm for Linear Programming Problems

    NASA Astrophysics Data System (ADS)

    Joag, Pramod; Mehendale, Dhananjay

    The quantum algorithm (PRL 103, 150502, 2009) solves a system of linear equations with exponential speedup over existing classical algorithms. We show that the above algorithm can be readily adopted in the iterative algorithms for solving linear programming (LP) problems. The first iterative algorithm that we suggest for LP problem follows from duality theory. It consists of finding nonnegative solution of the equation forduality condition; forconstraints imposed by the given primal problem and for constraints imposed by its corresponding dual problem. This problem is called the problem of nonnegative least squares, or simply the NNLS problem. We use a well known method for solving the problem of NNLS due to Lawson and Hanson. This algorithm essentially consists of solving in each iterative step a new system of linear equations . The other iterative algorithms that can be used are those based on interior point methods. The same technique can be adopted for solving network flow problems as these problems can be readily formulated as LP problems. The suggested quantum algorithm cansolveLP problems and Network Flow problems of very large size involving millions of variables.

  16. Seven Wonders of the Ancient and Modern Quadratic World.

    ERIC Educational Resources Information Center

    Taylor, Sharon E.; Mittag, Kathleen Cage

    2001-01-01

    Presents four methods for solving a quadratic equation using graphing calculator technology: (1) graphing with the CALC feature; (2) quadratic formula program; (3) table; and (4) solver. Includes a worksheet for a lab activity on factoring quadratic equations. (KHR)

  17. A Polynomial Primal-Dual Interior Point Method for Convex Programming with Quadratic Constraints

    DTIC Science & Technology

    1993-04-01

    Delft Un~versity of Technology, Delft, Netherlands. [3H Bazaraa , M. S., J. J. Jarvis, and H. D. Sh’rali. 199a Linar Pgrammning a" N]tdiwk Flow, John... Bazaraa , M. S., J. J. Jarvis, and H. D. Sherali. 1990. IjnW Programming and Network Flw, John Wiley and Sons, New York. [4] Charnes, A., and K. 0. Kortanek...often used in linear programming. For a detailed discussion of that 90 application, see Bazaraa . Jarvis. and Sherali(1990). Given J£, let T denote the

  18. Simulation of superconducting tapes and coils with convex quadratic programming method

    NASA Astrophysics Data System (ADS)

    Zhang, Yan; Song, Yuntao; Wang, Lei; Liu, Xufeng

    2015-08-01

    Second-generation (2G) high-temperature superconducting coated conductors are playing an increasingly important role in power applications due to their large current density under high magnetic fields. In this paper, we conclude and explore the ability and possible potential of J formulation from the mathematical modeling point of view. An equivalent matrix form of J formulation has been presented and a relation between electromagnetic quantities and Karush-Kuhn-Tucker (KKT) conditions in optimization theory has been discovered. The use of the latest formulae to calculate inductance in a coil system and the primal-dual interior-point method algorithm is a trial to make the process of modeling stylized and build a bridge to commercial optimization solvers. Two different dependences of the critical current density on the magnetic field have been used in order to make a comparison with those published papers.

  19. A Limited-Memory BFGS Algorithm Based on a Trust-Region Quadratic Model for Large-Scale Nonlinear Equations

    PubMed Central

    Li, Yong; Yuan, Gonglin; Wei, Zengxin

    2015-01-01

    In this paper, a trust-region algorithm is proposed for large-scale nonlinear equations, where the limited-memory BFGS (L-M-BFGS) update matrix is used in the trust-region subproblem to improve the effectiveness of the algorithm for large-scale problems. The global convergence of the presented method is established under suitable conditions. The numerical results of the test problems show that the method is competitive with the norm method. PMID:25950725

  20. An Algorithm for Linearly Constrained Nonlinear Programming Programming Problems.

    DTIC Science & Technology

    1980-01-01

    ALGORITHM FOR LINEARLY CONSTRAINED NONLINEAR PROGRAMMING PROBLEMS Mokhtar S. Bazaraa and Jamie J. Goode In this paper an algorithm for solving a linearly...distance pro- gramr.ing, as in the works of Bazaraa and Goode 12], and Wolfe [16 can be used for solving this problem. Special methods that take advantage of...34 Pacific Journal of Mathematics, Volume 16, pp. 1-3, 1966. 2. M. S. Bazaraa and J. j. Goode, "An Algorithm for Finding the Shortest Element of a

  1. A Sequential Quadratic Programming Algorithm Using An Incomplete Solution of the Subproblem

    DTIC Science & Technology

    1993-05-01

    SQP) methods to solve non - linear constrained optimization problems that are more flexible in their def- inition than standard SQP methods. The type...the first-order KKT conditions for NP is the best that can be achieved. Such points are feasible and satisfy the following conditions : VF(x*) = Vc(x*)T... conditions on p0 are sufficient to ensure our objective. - For some constant OP > C, IIpII • 3plic-Ii and gTpo T /PO lc-II. (2.18) "* A sequence of

  2. Numerical Solution of the Electron Heat Transport Equation and Physics-Constrained Modeling of the Thermal Conductivity via Sequential Quadratic Programming Optimization in Nuclear Fusion Plasmas

    NASA Astrophysics Data System (ADS)

    Paloma, Cynthia S.

    The plasma electron temperature (Te) plays a critical role in a tokamak nu- clear fusion reactor since temperatures on the order of 108K are required to achieve fusion conditions. Many plasma properties in a tokamak nuclear fusion reactor are modeled by partial differential equations (PDE's) because they depend not only on time but also on space. In particular, the dynamics of the electron temperature is governed by a PDE referred to as the Electron Heat Transport Equation (EHTE). In this work, a numerical method is developed to solve the EHTE based on a custom finite-difference technique. The solution of the EHTE is compared to temperature profiles obtained by using TRANSP, a sophisticated plasma transport code, for specific discharges from the DIII-D tokamak, located at the DIII-D National Fusion Facility in San Diego, CA. The thermal conductivity (also called thermal diffusivity) of the electrons (Xe) is a plasma parameter that plays a critical role in the EHTE since it indicates how the electron temperature diffusion varies across the minor effective radius of the tokamak. TRANSP approximates Xe through a curve-fitting technique to match experimentally measured electron temperature profiles. While complex physics-based model have been proposed for Xe, there is a lack of a simple mathematical model for the thermal diffusivity that could be used for control design. In this work, a model for Xe is proposed based on a scaling law involving key plasma variables such as the electron temperature (Te), the electron density (ne), and the safety factor (q). An optimization algorithm is developed based on the Sequential Quadratic Programming (SQP) technique to optimize the scaling factors appearing in the proposed model so that the predicted electron temperature and magnetic flux profiles match predefined target profiles in the best possible way. A simulation study summarizing the outcomes of the optimization procedure is presented to illustrate the potential of the

  3. An improved dual neural network for solving a class of quadratic programming problems and its k-winners-take-all application.

    PubMed

    Hu, Xiaolin; Wang, Jun

    2008-12-01

    This paper presents a novel recurrent neural network for solving a class of convex quadratic programming (QP) problems, in which the quadratic term in the objective function is the square of the Euclidean norm of the variable. This special structure leads to a set of simple optimality conditions for the problem, based on which the neural network model is formulated. Compared with existing neural networks for general convex QP, the new model is simpler in structure and easier to implement. The new model can be regarded as an improved version of the dual neural network in the literature. Based on the new model, a simple neural network capable of solving the k-winners-take-all ( k-WTA) problem is formulated. The stability and global convergence of the proposed neural network is proved rigorously and substantiated by simulation results.

  4. Self-Replicating Quadratics

    ERIC Educational Resources Information Center

    Withers, Christopher S.; Nadarajah, Saralees

    2012-01-01

    We show that there are exactly four quadratic polynomials, Q(x) = x [superscript 2] + ax + b, such that (x[superscript 2] + ax + b) (x[superscript 2] - ax + b) = (x[superscript 4] + ax[superscript 2] + b). For n = 1, 2, ..., these quadratic polynomials can be written as the product of N = 2[superscript n] quadratic polynomials in x[superscript…

  5. A new recurrent neural network for solving convex quadratic programming problems with an application to the k-winners-take-all problem.

    PubMed

    Hu, Xiaolin; Zhang, Bo

    2009-04-01

    In this paper, a new recurrent neural network is proposed for solving convex quadratic programming (QP) problems. Compared with existing neural networks, the proposed one features global convergence property under weak conditions, low structural complexity, and no calculation of matrix inverse. It serves as a competitive alternative in the neural network family for solving linear or quadratic programming problems. In addition, it is found that by some variable substitution, the proposed network turns out to be an existing model for solving minimax problems. In this sense, it can be also viewed as a special case of the minimax neural network. Based on this scheme, a k-winners-take-all ( k-WTA) network with O(n) complexity is designed, which is characterized by simple structure, global convergence, and capability to deal with some ill cases. Numerical simulations are provided to validate the theoretical results obtained. More importantly, the network design method proposed in this paper has great potential to inspire other competitive inventions along the same line.

  6. Synthesizing Dynamic Programming Algorithms from Linear Temporal Logic Formulae

    NASA Technical Reports Server (NTRS)

    Rosu, Grigore; Havelund, Klaus

    2001-01-01

    The problem of testing a linear temporal logic (LTL) formula on a finite execution trace of events, generated by an executing program, occurs naturally in runtime analysis of software. We present an algorithm which takes an LTL formula and generates an efficient dynamic programming algorithm. The generated algorithm tests whether the LTL formula is satisfied by a finite trace of events given as input. The generated algorithm runs in linear time, its constant depending on the size of the LTL formula. The memory needed is constant, also depending on the size of the formula.

  7. Algorithm Improvement Program Nuclide Identification Algorithm Scoring Criteria And Scoring Application - DNDO.

    SciTech Connect

    Enghauser, Michael

    2015-02-01

    The goal of the Domestic Nuclear Detection Office (DNDO) Algorithm Improvement Program (AIP) is to facilitate gamma-radiation detector nuclide identification algorithm development, improvement, and validation. Accordingly, scoring criteria have been developed to objectively assess the performance of nuclide identification algorithms. In addition, a Microsoft Excel spreadsheet application for automated nuclide identification scoring has been developed. This report provides an overview of the equations, nuclide weighting factors, nuclide equivalencies, and configuration weighting factors used by the application for scoring nuclide identification algorithm performance. Furthermore, this report presents a general overview of the nuclide identification algorithm scoring application including illustrative examples.

  8. Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows.

    PubMed

    Wang, Di; Kleinberg, Robert D

    2009-11-28

    Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n {0, 1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C(2), C(3), C(4),…. It is known that C(2) can be computed by solving a maximum-flow problem, whereas the only previously known algorithms for computing C(k) (k > 2) require solving a linear program. In this paper we prove that C(3) can be computed by solving a maximum multicommodity flow problem in a graph constructed from the quadratic function. In addition to providing a lower bound on the minimum value of the quadratic function on {0, 1}(n), this multicommodity flow problem also provides some information about the coordinates of the point where this minimum is achieved. By looking at the edges that are never saturated in any maximum multicommodity flow, we can identify relational persistencies: pairs of variables that must have the same or different values in any minimizing assignment. We furthermore show that all of these persistencies can be detected by solving single-commodity flow problems in the same network.

  9. A Partitioning and Bounded Variable Algorithm for Linear Programming

    ERIC Educational Resources Information Center

    Sheskin, Theodore J.

    2006-01-01

    An interesting new partitioning and bounded variable algorithm (PBVA) is proposed for solving linear programming problems. The PBVA is a variant of the simplex algorithm which uses a modified form of the simplex method followed by the dual simplex method for bounded variables. In contrast to the two-phase method and the big M method, the PBVA does…

  10. Earth Tide Algorithms for the OMNIS Computer Program System.

    DTIC Science & Technology

    1986-04-01

    This report presents five computer algorithms that jointly specify the gravitational action by which the tidal redistributions of the Earth’s masses...routine is a simplified version of the fourth and is provided for use during computer program verification. All computer algorithms express the tidal

  11. WHAT IS A SATISFACTORY QUADRATIC EQUATION SOLVER?

    DTIC Science & Technology

    The report discusses precise requirements for a satisfactory computer program to solve a quadratic equation with floating - point coefficients. The principal practical problem is coping with overflow and underflow.

  12. On a programming language for graph algorithms

    NASA Technical Reports Server (NTRS)

    Rheinboldt, W. C.; Basili, V. R.; Mesztenyi, C. K.

    1971-01-01

    An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.

  13. A scalable parallel algorithm for multiple objective linear programs

    NASA Technical Reports Server (NTRS)

    Wiecek, Malgorzata M.; Zhang, Hong

    1994-01-01

    This paper presents an ADBASE-based parallel algorithm for solving multiple objective linear programs (MOLP's). Job balance, speedup and scalability are of primary interest in evaluating efficiency of the new algorithm. Implementation results on Intel iPSC/2 and Paragon multiprocessors show that the algorithm significantly speeds up the process of solving MOLP's, which is understood as generating all or some efficient extreme points and unbounded efficient edges. The algorithm gives specially good results for large and very large problems. Motivation and justification for solving such large MOLP's are also included.

  14. Quantum algorithms for the ordered search problem via semidefinite programming

    SciTech Connect

    Childs, Andrew M.; Landahl, Andrew J.; Parrilo, Pablo A.

    2007-03-15

    One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log{sub 2} N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for the ordered search problem in terms of a semidefinite program, we find quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log{sub 605} N{approx_equal}0.433 log{sub 2} N queries, which improves upon the previously best known exact algorithm.

  15. Stochastic Semidefinite Programming: Applications and Algorithms

    DTIC Science & Technology

    2012-03-03

    doi: 2011/09/07 13:38:21 13 TOTAL: 1 Number of Papers published in non peer-reviewed journals: Baha M. Alzalg and K. A. Ariyawansa, Stochastic...symmetric programming over integers. International Conference on Scientific Computing, Las Vegas, Nevada, July 18--21, 2011. Baha M. Alzalg. On recent...Proceeding publications (other than abstracts): PaperReceived Baha M. Alzalg, K. A. Ariyawansa. Stochastic mixed integer second-order cone programming

  16. US-VISIT Identity Matching Algorithm Evaluation Program: ADIS Algorithm Evaluation Project Plan Update

    SciTech Connect

    Grant, C W; Lenderman, J S; Gansemer, J D

    2011-02-24

    This document is an update to the 'ADIS Algorithm Evaluation Project Plan' specified in the Statement of Work for the US-VISIT Identity Matching Algorithm Evaluation Program, as deliverable II.D.1. The original plan was delivered in August 2010. This document modifies the plan to reflect modified deliverables reflecting delays in obtaining a database refresh. This document describes the revised schedule of the program deliverables. The detailed description of the processes used, the statistical analysis processes and the results of the statistical analysis will be described fully in the program deliverables. The US-VISIT Identity Matching Algorithm Evaluation Program is work performed by Lawrence Livermore National Laboratory (LLNL) under IAA HSHQVT-07-X-00002 P00004 from the Department of Homeland Security (DHS).

  17. Simplified partial digest problem: enumerative and dynamic programming algorithms.

    PubMed

    Blazewicz, Jacek; Burke, Edmund; Kasprzak, Marta; Kovalev, Alexandr; Kovalyov, Mikhail

    2007-01-01

    We study the Simplified Partial Digest Problem (SPDP), which is a mathematical model for a new simplified partial digest method of genome mapping. This method is easy for laboratory implementation and robust with respect to the experimental errors. SPDP is NP-hard in the strong sense. We present an $O(n2;n)$ time enumerative algorithm and an O(n(2q)) time dynamic programming algorithm for the error-free SPDP, where $n$ is the number of restriction sites and n is the number of distinct intersite distances. We also give examples of the problem, in which there are 2(n+2)/(3)-1 non-congruent solutions. These examples partially answer a question recently posed in the literature about the number of solutions of SPDP. We adapt our enumerative algorithm for handling SPDP with imprecise input data. Finally, we describe and discuss the results of the computer experiments with our algorithms.

  18. An Approach to the Programming of Biased Regression Algorithms.

    DTIC Science & Technology

    1978-11-01

    Due to the near nonexistence of computer algorithms for calculating estimators and ancillary statistics that are needed for biased regression methodologies, many users of these methodologies are forced to write their own programs. Brute-force coding of such programs can result in a great waste of computer core and computing time, as well as inefficient and inaccurate computing techniques. This article proposes some guides to more efficient programming by taking advantage of mathematical similarities among several of the more popular biased regression estimators.

  19. Quadratic spline subroutine package

    USGS Publications Warehouse

    Rasmussen, Lowell A.

    1982-01-01

    A continuous piecewise quadratic function with continuous first derivative is devised for approximating a single-valued, but unknown, function represented by a set of discrete points. The quadratic is proposed as a treatment intermediate between using the angular (but reliable, easily constructed and manipulated) piecewise linear function and using the smoother (but occasionally erratic) cubic spline. Neither iteration nor the solution of a system of simultaneous equations is necessary to determining the coefficients. Several properties of the quadratic function are given. A set of five short FORTRAN subroutines is provided for generating the coefficients (QSC), finding function value and derivatives (QSY), integrating (QSI), finding extrema (QSE), and computing arc length and the curvature-squared integral (QSK). (USGS)

  20. Decomposition algorithms for stochastic programming on a computational grid.

    SciTech Connect

    Linderoth, J.; Wright, S.; Mathematics and Computer Science; Axioma Inc.

    2003-01-01

    We describe algorithms for two-stage stochastic linear programming with recourse and their implementation on a grid computing platform. In particular, we examine serial and asynchronous versions of the L-shaped method and a trust-region method. The parallel platform of choice is the dynamic, heterogeneous, opportunistic platform provided by the Condor system. The algorithms are of master-worker type (with the workers being used to solve second-stage problems), and the MW runtime support library (which supports master-worker computations) is key to the implementation. Computational results are presented on large sample-average approximations of problems from the literature.

  1. Projected sequential quadratic programming methods

    SciTech Connect

    Heinkenschloss, M.

    1994-12-31

    In this talk we investigate projected SQP methods for the solution of min f(y, u). s.t. c(y, u) = 0 a {<=} u {<=} b. These methods combine the ideas of (reduced) SQP methods and projected Newton methods. The problem formulation and the design of these solution methods is motivated by optimal control problems. In this case y and u are the state and the control, respectively, and c(y, u) = 0 represents the state equation. Projected SQP methods use the simple projection onto the set {l_brace}a {<=} u {<=} b{r_brace} and maintain feasibility with respect to the inequality constraints. In each iteration only linearized constraint equations need to be solved. Global convergence of the method is enforced using a constrained merit function and an Armijo-like line search. We discuss global and local convergence properties of these methods, the identification of active indices, and implementation details for optimal control problems. Numerical examples of projected SQP methods applied to optimal control problems are presented.

  2. The Mystical "Quadratic Formula."

    ERIC Educational Resources Information Center

    March, Robert H.

    1993-01-01

    Uses projectile motion to explain the two roots found when using the quadratic formula. An example is provided for finding the time of flight for a projectile which has a negative root implying a negative time of flight. This negative time of flight also has a useful physical meaning. (MVL)

  3. A Quadratic Spring Equation

    ERIC Educational Resources Information Center

    Fay, Temple H.

    2010-01-01

    Through numerical investigations, we study examples of the forced quadratic spring equation [image omitted]. By performing trial-and-error numerical experiments, we demonstrate the existence of stability boundaries in the phase plane indicating initial conditions yielding bounded solutions, investigate the resonance boundary in the [omega]…

  4. EVOLVING RETRIEVAL ALGORITHMS WITH A GENETIC PROGRAMMING SCHEME

    SciTech Connect

    J. THEILER; ET AL

    1999-06-01

    The retrieval of scene properties (surface temperature, material type, vegetation health, etc.) from remotely sensed data is the ultimate goal of many earth observing satellites. The algorithms that have been developed for these retrievals are informed by physical models of how the raw data were generated. This includes models of radiation as emitted and/or rejected by the scene, propagated through the atmosphere, collected by the optics, detected by the sensor, and digitized by the electronics. To some extent, the retrieval is the inverse of this ''forward'' modeling problem. But in contrast to this forward modeling, the practical task of making inferences about the original scene usually requires some ad hoc assumptions, good physical intuition, and a healthy dose of trial and error. The standard MTI data processing pipeline will employ algorithms developed with this traditional approach. But we will discuss some preliminary research on the use of a genetic programming scheme to ''evolve'' retrieval algorithms. Such a scheme cannot compete with the physical intuition of a remote sensing scientist, but it may be able to automate some of the trial and error. In this scenario, a training set is used, which consists of multispectral image data and the associated ''ground truth;'' that is, a registered map of the desired retrieval quantity. The genetic programming scheme attempts to combine a core set of image processing primitives to produce an IDL (Interactive Data Language) program which estimates this retrieval quantity from the raw data.

  5. The Psychopharmacology Algorithm Project at the Harvard South Shore Program: An Algorithm for Generalized Anxiety Disorder.

    PubMed

    Abejuela, Harmony Raylen; Osser, David N

    2016-01-01

    This revision of previous algorithms for the pharmacotherapy of generalized anxiety disorder was developed by the Psychopharmacology Algorithm Project at the Harvard South Shore Program. Algorithms from 1999 and 2010 and associated references were reevaluated. Newer studies and reviews published from 2008-14 were obtained from PubMed and analyzed with a focus on their potential to justify changes in the recommendations. Exceptions to the main algorithm for special patient populations, such as women of childbearing potential, pregnant women, the elderly, and those with common medical and psychiatric comorbidities, were considered. Selective serotonin reuptake inhibitors (SSRIs) are still the basic first-line medication. Early alternatives include duloxetine, buspirone, hydroxyzine, pregabalin, or bupropion, in that order. If response is inadequate, then the second recommendation is to try a different SSRI. Additional alternatives now include benzodiazepines, venlafaxine, kava, and agomelatine. If the response to the second SSRI is unsatisfactory, then the recommendation is to try a serotonin-norepinephrine reuptake inhibitor (SNRI). Other alternatives to SSRIs and SNRIs for treatment-resistant or treatment-intolerant patients include tricyclic antidepressants, second-generation antipsychotics, and valproate. This revision of the GAD algorithm responds to issues raised by new treatments under development (such as pregabalin) and organizes the evidence systematically for practical clinical application.

  6. Performance characterization of the dynamic programming obstacle detection algorithm.

    PubMed

    Gandhi, Tarak; Yang, Mau-Tsuen; Kasturi, Rangachar; Camps, Octavia I; Coraor, Lee D; McCandless, Jeffrey

    2006-05-01

    A computer vision-based system using images from an airborne aircraft can increase flight safety by aiding the pilot to detect obstacles in the flight path so as to avoid mid-air collisions. Such a system fits naturally with the development of an external vision system proposed by NASA for use in high-speed civil transport aircraft with limited cockpit visibility. The detection techniques should provide high detection probability for obstacles that can vary from subpixels to a few pixels in size, while maintaining a low false alarm probability in the presence of noise and severe background clutter. Furthermore, the detection algorithms must be able to report such obstacles in a timely fashion, imposing severe constraints on their execution time. For this purpose, we have implemented a number of algorithms to detect airborne obstacles using image sequences obtained from a camera mounted on an aircraft. This paper describes the methodology used for characterizing the performance of the dynamic programming obstacle detection algorithm and its special cases. The experimental results were obtained using several types of image sequences, with simulated and real backgrounds. The approximate performance of the algorithm is also theoretically derived using principles of statistical analysis in terms of the signal-to-noise ration (SNR) required for the probabilities of false alarms and misdetections to be lower than prespecified values. The theoretical and experimental performance are compared in terms of the required SNR.

  7. Performance of a community detection algorithm based on semidefinite programming

    NASA Astrophysics Data System (ADS)

    Ricci-Tersenghi, Federico; Javanmard, Adel; Montanari, Andrea

    2016-03-01

    The problem of detecting communities in a graph is maybe one the most studied inference problems, given its simplicity and widespread diffusion among several disciplines. A very common benchmark for this problem is the stochastic block model or planted partition problem, where a phase transition takes place in the detection of the planted partition by changing the signal-to-noise ratio. Optimal algorithms for the detection exist which are based on spectral methods, but we show these are extremely sensible to slight modification in the generative model. Recently Javanmard, Montanari and Ricci-Tersenghi [1] have used statistical physics arguments, and numerical simulations to show that finding communities in the stochastic block model via semidefinite programming is quasi optimal. Further, the resulting semidefinite relaxation can be solved efficiently, and is very robust with respect to changes in the generative model. In this paper we study in detail several practical aspects of this new algorithm based on semidefinite programming for the detection of the planted partition. The algorithm turns out to be very fast, allowing the solution of problems with O(105) variables in few second on a laptop computer.

  8. The psychopharmacology algorithm project at the Harvard South Shore Program: an algorithm for acute mania.

    PubMed

    Mohammad, Othman; Osser, David N

    2014-01-01

    This new algorithm for the pharmacotherapy of acute mania was developed by the Psychopharmacology Algorithm Project at the Harvard South Shore Program. The authors conducted a literature search in PubMed and reviewed key studies, other algorithms and guidelines, and their references. Treatments were prioritized considering three main considerations: (1) effectiveness in treating the current episode, (2) preventing potential relapses to depression, and (3) minimizing side effects over the short and long term. The algorithm presupposes that clinicians have made an accurate diagnosis, decided how to manage contributing medical causes (including substance misuse), discontinued antidepressants, and considered the patient's childbearing potential. We propose different algorithms for mixed and nonmixed mania. Patients with mixed mania may be treated first with a second-generation antipsychotic, of which the first choice is quetiapine because of its greater efficacy for depressive symptoms and episodes in bipolar disorder. Valproate and then either lithium or carbamazepine may be added. For nonmixed mania, lithium is the first-line recommendation. A second-generation antipsychotic can be added. Again, quetiapine is favored, but if quetiapine is unacceptable, risperidone is the next choice. Olanzapine is not considered a first-line treatment due to its long-term side effects, but it could be second-line. If the patient, whether mixed or nonmixed, is still refractory to the above medications, then depending on what has already been tried, consider carbamazepine, haloperidol, olanzapine, risperidone, and valproate first tier; aripiprazole, asenapine, and ziprasidone second tier; and clozapine third tier (because of its weaker evidence base and greater side effects). Electroconvulsive therapy may be considered at any point in the algorithm if the patient has a history of positive response or is intolerant of medications.

  9. Solution of quadratic matrix equations for free vibration analysis of structures.

    NASA Technical Reports Server (NTRS)

    Gupta, K. K.

    1973-01-01

    An efficient digital computer procedure and the related numerical algorithm are presented herein for the solution of quadratic matrix equations associated with free vibration analysis of structures. Such a procedure enables accurate and economical analysis of natural frequencies and associated modes of discretized structures. The numerically stable algorithm is based on the Sturm sequence method, which fully exploits the banded form of associated stiffness and mass matrices. The related computer program written in FORTRAN V for the JPL UNIVAC 1108 computer proves to be substantially more accurate and economical than other existing procedures of such analysis. Numerical examples are presented for two structures - a cantilever beam and a semicircular arch.

  10. Testing the race model inequality: an algorithm and computer programs.

    PubMed

    Ulrich, Rolf; Miller, Jeff; Schröter, Hannes

    2007-05-01

    In divided-attention tasks, responses are faster when two target stimuli are presented, and thus one is redundant, than when only a single target stimulus is presented. Raab (1962) suggested an account of this redundant-targets effect in terms of a race model in which the response to redundant target stimuli is initiated by the faster of two separate target detection processes. Such models make a prediction about the probability distributions of reaction times that is often called the race model inequality, and it is often of interest to test this prediction. In this article, we describe a precise algorithm that can be used to test the race model inequality and present MATLAB routines and a Pascal program that implement this algorithm.

  11. An Algorithm for Solving Interval Linear Programming Problems

    DTIC Science & Technology

    1974-11-01

    34regularized" a lä Chames -Cooper so that infeasibility is determined at optimal solution if that is the case. If I(x*(v)) - 0 then x*(v) is an... Chames and Cooper J3]) may be used to compute the new inverse. Theorem 2 The algorithm described above terminates in a finite number of steps...I J 19- REFERENCES 1) A. Ben-Israel and A. Chames , "An Explicit Solution of A Special Class of Linear Programming Problems", Operations

  12. Dynamic programming and graph algorithms in computer vision.

    PubMed

    Felzenszwalb, Pedro F; Zabih, Ramin

    2011-04-01

    Optimization is a powerful paradigm for expressing and solving problems in a wide range of areas, and has been successfully applied to many vision problems. Discrete optimization techniques are especially interesting since, by carefully exploiting problem structure, they often provide nontrivial guarantees concerning solution quality. In this paper, we review dynamic programming and graph algorithms, and discuss representative examples of how these discrete optimization techniques have been applied to some classical vision problems. We focus on the low-level vision problem of stereo, the mid-level problem of interactive object segmentation, and the high-level problem of model-based recognition.

  13. Finite pure integer programming algorithms employing only hyperspherically deduced cuts

    NASA Technical Reports Server (NTRS)

    Young, R. D.

    1971-01-01

    Three algorithms are developed that may be based exclusively on hyperspherically deduced cuts. The algorithms only apply, therefore, to problems structured so that these cuts are valid. The algorithms are shown to be finite.

  14. Integer programming model for optimizing bus timetable using genetic algorithm

    NASA Astrophysics Data System (ADS)

    Wihartiko, F. D.; Buono, A.; Silalahi, B. P.

    2017-01-01

    Bus timetable gave an information for passengers to ensure the availability of bus services. Timetable optimal condition happened when bus trips frequency could adapt and suit with passenger demand. In the peak time, the number of bus trips would be larger than the off-peak time. If the number of bus trips were more frequent than the optimal condition, it would make a high operating cost for bus operator. Conversely, if the number of trip was less than optimal condition, it would make a bad quality service for passengers. In this paper, the bus timetabling problem would be solved by integer programming model with modified genetic algorithm. Modification was placed in the chromosomes design, initial population recovery technique, chromosomes reconstruction and chromosomes extermination on specific generation. The result of this model gave the optimal solution with accuracy 99.1%.

  15. Students' Understanding of Quadratic Equations

    ERIC Educational Resources Information Center

    López, Jonathan; Robles, Izraim; Martínez-Planell, Rafael

    2016-01-01

    Action-Process-Object-Schema theory (APOS) was applied to study student understanding of quadratic equations in one variable. This required proposing a detailed conjecture (called a genetic decomposition) of mental constructions students may do to understand quadratic equations. The genetic decomposition which was proposed can contribute to help…

  16. Award DE-FG02-04ER52655 Final Technical Report: Interior Point Algorithms for Optimization Problems

    SciTech Connect

    O'Leary, Dianne P.; Tits, Andre

    2014-04-03

    Over the period of this award we developed an algorithmic framework for constraint reduction in linear programming (LP) and convex quadratic programming (QP), proved convergence of our algorithms, and applied them to a variety of applications, including entropy-based moment closure in gas dynamics.

  17. Dynamic programming.

    PubMed

    Nalbantoğlu, Ö Ufuk

    2014-01-01

    Independent scoring of the aligned sections to determine the quality of biological sequence alignments enables recursive definitions of the overall alignment score. This property is not only biologically meaningful but it also provides the opportunity to find the optimal alignments using dynamic programming-based algorithms. Dynamic programming is an efficient problem solving technique for a class of problems that can be solved by dividing into overlapping subproblems. Pairwise sequence alignment techniques such as Needleman-Wunsch and Smith-Waterman algorithms are applications of dynamic programming on pairwise sequence alignment problems. These algorithms offer polynomial time and space solutions. In this chapter, we introduce the basic dynamic programming solutions for global, semi-global, and local alignment problems. Algorithmic improvements offering quadratic-time and linear-space programs and approximate solutions with space-reduction and seeding heuristics are discussed. We finally introduce the application of these techniques on multiple sequence alignment briefly.

  18. The Comparison Study of Quadratic Infinite Beam Program on Optimization Instensity Modulated Radiation Therapy Treatment Planning (IMRTP) between Threshold and Exponential Scatter Method with CERR® In The Case of Lung Cancer

    NASA Astrophysics Data System (ADS)

    Hardiyanti, Y.; Haekal, M.; Waris, A.; Haryanto, F.

    2016-08-01

    This research compares the quadratic optimization program on Intensity Modulated Radiation Therapy Treatment Planning (IMRTP) with the Computational Environment for Radiotherapy Research (CERR) software. We assumed that the number of beams used for the treatment planner was about 9 and 13 beams. The case used the energy of 6 MV with Source Skin Distance (SSD) of 100 cm from target volume. Dose calculation used Quadratic Infinite beam (QIB) from CERR. CERR was used in the comparison study between Gauss Primary threshold method and Gauss Primary exponential method. In the case of lung cancer, the threshold variation of 0.01, and 0.004 was used. The output of the dose was distributed using an analysis in the form of DVH from CERR. The maximum dose distributions obtained were on the target volume (PTV) Planning Target Volume, (CTV) Clinical Target Volume, (GTV) Gross Tumor Volume, liver, and skin. It was obtained that if the dose calculation method used exponential and the number of beam 9. When the dose calculation method used the threshold and the number of beam 13, the maximum dose distributions obtained were on the target volume PTV, GTV, heart, and skin.

  19. Algorithms and programming tools for image processing on the MPP, introduction. Thesis

    NASA Technical Reports Server (NTRS)

    1985-01-01

    The programming tools and parallel algorithms created for the Massively Parallel Processor (MPP) located at the NASA Goddard Space Center are discussed. A user-friendly environment for high level language parallel algorithm development was developed. The issues involved in implementing certain algorithms on the MPP were researched. The expected results were compared with the actual results.

  20. Quadratic Generalized Scale Invariance

    NASA Astrophysics Data System (ADS)

    Lovejoy, S.; Schertzer, D.; Addor, J. B.

    Nearly twenty years ago, two of us argued that in order to account for the scaling strat- ification of the atmosphere, that an anisotropic "unified scaling model" of the atmo- sphere was required with elliptical dimension 23/9=2.555... "in between" the standard 3-D (small scale) and 2-D large scale model. This model was based on the formal- ism of generalized scale invariance (GSI). Physically, GSI is justified by arguing that various conserved fluxes (energy, buoyancy force variance etc.) should define the ap- propriate notion of scale. In a recent large scale satellite cloud image analysis, we directly confirmed this model by studying the isotropic (angle averaged) horizontal cloud statistics. Mathematically, GSI is based on a a group of scale changing opera- tors and their generators but to date, both analyses (primarily of cloud images) and nu- merical (multifractal) simulations, have been limited to the special case of linear GSI. This has shown that cloud texture can plausibly be associated with local linearizations. However realistic morphologies involve spatially avarying textures; the full non linear GSI is clearly necessary. In this talk, we first show that the observed angle averaged (multi)scaling statistics only give a realtively weak constraint on the nonlinear gner- ator: that the latter can be expressed by self-similar (isotropic) part, and a deviatoric part described (in two dimensions) by an arbitrary scalar potential which contains all the information about the cloud morphology. We then show (using a theorem due to Poincaré) how to reduce nonlinear GSI to linear GSI plus a nonlinear coordinate trans- formation numerically, using this to take multifractal GSI modelling to the next level of approximation: quadratic GSI. We show many examples of the coresponding simu- lations which include transitions from various morphologies (including cyclones) and we discuss the results in relation to satellite cloud images.

  1. A Program Complexity Metric Based on Variable Usage for Algorithmic Thinking Education of Novice Learners

    ERIC Educational Resources Information Center

    Fuwa, Minori; Kayama, Mizue; Kunimune, Hisayoshi; Hashimoto, Masami; Asano, David K.

    2015-01-01

    We have explored educational methods for algorithmic thinking for novices and implemented a block programming editor and a simple learning management system. In this paper, we propose a program/algorithm complexity metric specified for novice learners. This metric is based on the variable usage in arithmetic and relational formulas in learner's…

  2. The Impact of Online Algorithm Visualization on ICT Students' Achievements in Introduction to Programming Course

    ERIC Educational Resources Information Center

    Saltan, Fatih

    2017-01-01

    Online Algorithm Visualization (OAV) is one of the recent developments in the instructional technology field that aims to help students handle difficulties faced when they begin to learn programming. This study aims to investigate the effect of online algorithm visualization on students' achievement in the introduction to programming course. To…

  3. Block clustering based on difference of convex functions (DC) programming and DC algorithms.

    PubMed

    Le, Hoai Minh; Le Thi, Hoai An; Dinh, Tao Pham; Huynh, Van Ngai

    2013-10-01

    We investigate difference of convex functions (DC) programming and the DC algorithm (DCA) to solve the block clustering problem in the continuous framework, which traditionally requires solving a hard combinatorial optimization problem. DC reformulation techniques and exact penalty in DC programming are developed to build an appropriate equivalent DC program of the block clustering problem. They lead to an elegant and explicit DCA scheme for the resulting DC program. Computational experiments show the robustness and efficiency of the proposed algorithm and its superiority over standard algorithms such as two-mode K-means, two-mode fuzzy clustering, and block classification EM.

  4. Motion Cueing Algorithm Development: New Motion Cueing Program Implementation and Tuning

    NASA Technical Reports Server (NTRS)

    Houck, Jacob A. (Technical Monitor); Telban, Robert J.; Cardullo, Frank M.; Kelly, Lon C.

    2005-01-01

    A computer program has been developed for the purpose of driving the NASA Langley Research Center Visual Motion Simulator (VMS). This program includes two new motion cueing algorithms, the optimal algorithm and the nonlinear algorithm. A general description of the program is given along with a description and flowcharts for each cueing algorithm, and also descriptions and flowcharts for subroutines used with the algorithms. Common block variable listings and a program listing are also provided. The new cueing algorithms have a nonlinear gain algorithm implemented that scales each aircraft degree-of-freedom input with a third-order polynomial. A description of the nonlinear gain algorithm is given along with past tuning experience and procedures for tuning the gain coefficient sets for each degree-of-freedom to produce the desired piloted performance. This algorithm tuning will be needed when the nonlinear motion cueing algorithm is implemented on a new motion system in the Cockpit Motion Facility (CMF) at the NASA Langley Research Center.

  5. SSME structural computer program development: BOPACE theoretical manual, addendum. [algorithms

    NASA Technical Reports Server (NTRS)

    1975-01-01

    An algorithm developed and incorporated into BOPACE for improving the convergence and accuracy of the inelastic stress-strain calculations is discussed. The implementation of separation of strains in the residual-force iterative procedure is defined. The elastic-plastic quantities used in the strain-space algorithm are defined and compared with previous quantities.

  6. Research on Knowledge Based Programming and Algorithm Design.

    DTIC Science & Technology

    1981-08-01

    34prime finding" (including the Sieve of Eratosthenes and linear time prime finding). This research is described in sections 6,7,8, and 9. 4 ii. Summary of...algorithm and several variants on prime finding including the Sieve of Eratosthenes and a more sophisticated linear-time algorithm. In these additional

  7. A Functional Programming Approach to AI Search Algorithms

    ERIC Educational Resources Information Center

    Panovics, Janos

    2012-01-01

    The theory and practice of search algorithms related to state-space represented problems form the major part of the introductory course of Artificial Intelligence at most of the universities and colleges offering a degree in the area of computer science. Students usually meet these algorithms only in some imperative or object-oriented language…

  8. Algorithms and programming tools for image processing on the MPP

    NASA Technical Reports Server (NTRS)

    Reeves, A. P.

    1985-01-01

    Topics addressed include: data mapping and rotational algorithms for the Massively Parallel Processor (MPP); Parallel Pascal language; documentation for the Parallel Pascal Development system; and a description of the Parallel Pascal language used on the MPP.

  9. Students' understanding of quadratic equations

    NASA Astrophysics Data System (ADS)

    López, Jonathan; Robles, Izraim; Martínez-Planell, Rafael

    2016-05-01

    Action-Process-Object-Schema theory (APOS) was applied to study student understanding of quadratic equations in one variable. This required proposing a detailed conjecture (called a genetic decomposition) of mental constructions students may do to understand quadratic equations. The genetic decomposition which was proposed can contribute to help students achieve an understanding of quadratic equations with improved interrelation of ideas and more flexible application of solution methods. Semi-structured interviews with eight beginning undergraduate students explored which of the mental constructions conjectured in the genetic decomposition students could do, and which they had difficulty doing. Two of the mental constructions that form part of the genetic decomposition are highlighted and corresponding further data were obtained from the written work of 121 undergraduate science and engineering students taking a multivariable calculus course. The results suggest the importance of explicitly considering these two highlighted mental constructions.

  10. Solving the Quadratic Capacitated Facilities Location Problem by Computer.

    ERIC Educational Resources Information Center

    Cote, Leon C.; Smith, Wayland P.

    Several computer programs were developed to solve various versions of the quadratic capacitated facilities location problem. Matrices, which represent various business costs, are defined for the factors of sites, facilities, customers, commodities, and production units. The objective of the program is to find an optimization matrix for the lowest…

  11. Testing Algorithmic Skills in Traditional and Non-Traditional Programming Environments

    ERIC Educational Resources Information Center

    Csernoch, Mária; Biró, Piroska; Máth, János; Abari, Kálmán

    2015-01-01

    The Testing Algorithmic and Application Skills (TAaAS) project was launched in the 2011/2012 academic year to test first year students of Informatics, focusing on their algorithmic skills in traditional and non-traditional programming environments, and on the transference of their knowledge of Informatics from secondary to tertiary education. The…

  12. Minimum time acceleration of aircraft turbofan engines by using an algorithm based on nonlinear programming

    NASA Technical Reports Server (NTRS)

    Teren, F.

    1977-01-01

    Minimum time accelerations of aircraft turbofan engines are presented. The calculation of these accelerations was made by using a piecewise linear engine model, and an algorithm based on nonlinear programming. Use of this model and algorithm allows such trajectories to be readily calculated on a digital computer with a minimal expenditure of computer time.

  13. CALIBRATION, OPTIMIZATION, AND SENSITIVITY AND UNCERTAINTY ALGORITHMS APPLICATION PROGRAMMING INTERFACE (COSU-API)

    EPA Science Inventory

    The Application Programming Interface (API) for Uncertainty Analysis, Sensitivity Analysis, and Parameter Estimation (UA/SA/PE API) tool development, here fore referred to as the Calibration, Optimization, and Sensitivity and Uncertainty Algorithms API (COSU-API), was initially d...

  14. Linear state feedback, quadratic weights, and closed loop eigenstructures. M.S. Thesis

    NASA Technical Reports Server (NTRS)

    Thompson, P. M.

    1979-01-01

    Results are given on the relationships between closed loop eigenstructures, state feedback gain matrices of the linear state feedback problem, and quadratic weights of the linear quadratic regulator. Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used for the first time to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalues and the directional derivatives of closed loop eigenvectors (with respect to a scalar multiplying the feedback gain matrix or the quadratic control weight). An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, sufficient conditions to be in it are given, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties.

  15. Some basic data structures and algorithms for chemical generic programming.

    PubMed

    Zhang, Wei; Hou, Tingjun; Qiao, Xuebin; Xu, Xiaojie

    2004-01-01

    Here, we report a template library used for molecular operation, the Molecular Handling Template Library (MHTL). The library includes some generic data structures and generic algorithms, and the two parts are associated with each other by two concepts: Properties and Molecule. The concept Properties describes the interface to access objects' properties, and the concept Molecule describes the minimum requirement for a molecular class. Data structures include seven models of Properties, each using a different method to access properties, and two models of molecular classes. Algorithms include molecular file manipulation subroutines, SMARTS language interpreter and matcher functions, and molecular OpenGL rendering functions.

  16. Computer program for fast Karhunen Loeve transform algorithm

    NASA Technical Reports Server (NTRS)

    Jain, A. K.

    1976-01-01

    The fast KL transform algorithm was applied for data compression of a set of four ERTS multispectral images and its performance was compared with other techniques previously studied on the same image data. The performance criteria used here are mean square error and signal to noise ratio. The results obtained show a superior performance of the fast KL transform coding algorithm on the data set used with respect to the above stated perfomance criteria. A summary of the results is given in Chapter I and details of comparisons and discussion on conclusions are given in Chapter IV.

  17. Concretising Factorisation of Quadratic Expressions

    ERIC Educational Resources Information Center

    Hoong, Leong Yew; Fwe, Yap Sook; Yvonne, Teo Mei Lin; Subramaniam, Thilagam d/o; Zaini, Irni Karen Bte Mohd; Chiew, Quek Eng; Karen, Tan Kang Ling

    2010-01-01

    The way quadratic factorisation was usually taught to students in Bukit View Secondary was through the familiar "cross-method." However, some teachers felt that a significant number of students could not use the method effectively even after careful demonstration through repeated examples. In addition, many secondary mathematics teachers…

  18. A vehicle scheduling algorithm using non-serial discrete dynamic programming with space shuttle applications

    NASA Technical Reports Server (NTRS)

    Dupnick, E.

    1973-01-01

    Description of the development and operation of a vehicle-scheduling algorithm which has applications to the NASA problem of assigning payloads to space delivery vehicles. The algorithm is based on a discrete, integer-valued, nonserial, dynamic-programming solution to the classical problem of developing resource utilization plans with limited resources. The algorithm places special emphasis on incorporating interpayload (precedence) relationships; maintaining optimal alternate schedule definitions (a unique feature of dynamic programming) in the event of contingencies (namely, resource inventory changes) without problem resolution; and, by using a special information storage technique, reducing the computational complexity of solving realistic problems.

  19. Improved dynamic-programming-based algorithms for segmentation of masses in mammograms

    SciTech Connect

    Dominguez, Alfonso Rojas; Nandi, Asoke K.

    2007-11-15

    In this paper, two new boundary tracing algorithms for segmentation of breast masses are presented. These new algorithms are based on the dynamic programming-based boundary tracing (DPBT) algorithm proposed in Timp and Karssemeijer, [S. Timp and N. Karssemeijer, Med. Phys. 31, 958-971 (2004)] The DPBT algorithm contains two main steps: (1) construction of a local cost function, and (2) application of dynamic programming to the selection of the optimal boundary based on the local cost function. The validity of some assumptions used in the design of the DPBT algorithm is tested in this paper using a set of 349 mammographic images. Based on the results of the tests, modifications to the computation of the local cost function have been designed and have resulted in the Improved-DPBT (IDPBT) algorithm. A procedure for the dynamic selection of the strength of the components of the local cost function is presented that makes these parameters independent of the image dataset. Incorporation of this dynamic selection procedure has produced another new algorithm which we have called ID{sup 2}PBT. Methods for the determination of some other parameters of the DPBT algorithm that were not covered in the original paper are presented as well. The merits of the new IDPBT and ID{sup 2}PBT algorithms are demonstrated experimentally by comparison against the DPBT algorithm. The segmentation results are evaluated with base on the area overlap measure and other segmentation metrics. Both of the new algorithms outperform the original DPBT; the improvements in the algorithms performance are more noticeable around the values of the segmentation metrics corresponding to the highest segmentation accuracy, i.e., the new algorithms produce more optimally segmented regions, rather than a pronounced increase in the average quality of all the segmented regions.

  20. APL simulation of Grover's algorithm

    NASA Astrophysics Data System (ADS)

    Lipovaca, Samir

    2012-02-01

    Grover's algorithm is a fast quantum search algorithm. Classically, to solve the search problem for a search space of size N we need approximately N operations. Grover's algorithm offers a quadratic speedup. Since present quantum computers are not robust enough for code writing and execution, to experiment with Grover's algorithm, we will simulate it using the APL programming language. The APL programming language is especially suited for this task. For example, to compute Walsh-Hadamard transformation matrix for N quantum states via a tensor product of N Hadamard matrices we need to iterate N-1 times only one line of the code. Initial study indicates the quantum mechanical amplitude of the solution is almost independent of the search space size and rapidly reaches 0.999 values with slight variations at higher decimal places.

  1. The new image segmentation algorithm using adaptive evolutionary programming and fuzzy c-means clustering

    NASA Astrophysics Data System (ADS)

    Liu, Fang

    2011-06-01

    Image segmentation remains one of the major challenges in image analysis and computer vision. Fuzzy clustering, as a soft segmentation method, has been widely studied and successfully applied in mage clustering and segmentation. The fuzzy c-means (FCM) algorithm is the most popular method used in mage segmentation. However, most clustering algorithms such as the k-means and the FCM clustering algorithms search for the final clusters values based on the predetermined initial centers. The FCM clustering algorithms does not consider the space information of pixels and is sensitive to noise. In the paper, presents a new fuzzy c-means (FCM) algorithm with adaptive evolutionary programming that provides image clustering. The features of this algorithm are: 1) firstly, it need not predetermined initial centers. Evolutionary programming will help FCM search for better center and escape bad centers at local minima. Secondly, the spatial distance and the Euclidean distance is also considered in the FCM clustering. So this algorithm is more robust to the noises. Thirdly, the adaptive evolutionary programming is proposed. The mutation rule is adaptively changed with learning the useful knowledge in the evolving process. Experiment results shows that the new image segmentation algorithm is effective. It is providing robustness to noisy images.

  2. Application of a Dynamic Programming Algorithm for Weapon Target Assignment

    DTIC Science & Technology

    2016-02-01

    targets. To assist with the ever more complex and rapidly changing combat environment, warfighters require access to real-time decision aids based on...for specific use in maritime combat scenarios. After successful testing, the WTA algorithm could potentially be used as a training aid , a concept...DST-Group-TR-3221 21 UNCLASSIFIED The DDP WTA example analyses were initially described with the aid of decision tree diagrams and EXCEL

  3. Security analysis of quadratic phase based cryptography

    NASA Astrophysics Data System (ADS)

    Muniraj, Inbarasan; Guo, Changliang; Malallah, Ra'ed; Healy, John J.; Sheridan, John T.

    2016-09-01

    The linear canonical transform (LCT) is essential in modeling a coherent light field propagation through first-order optical systems. Recently, a generic optical system, known as a Quadratic Phase Encoding System (QPES), for encrypting a two-dimensional (2D) image has been reported. It has been reported together with two phase keys the individual LCT parameters serve as keys of the cryptosystem. However, it is important that such the encryption systems also satisfies some dynamic security properties. Therefore, in this work, we examine some cryptographic evaluation methods, such as Avalanche Criterion and Bit Independence, which indicates the degree of security of the cryptographic algorithms on QPES. We compare our simulation results with the conventional Fourier and the Fresnel transform based DRPE systems. The results show that the LCT based DRPE has an excellent avalanche and bit independence characteristics than that of using the conventional Fourier and Fresnel based encryption systems.

  4. A program and data base for evaluating SMMR algorithms

    NASA Technical Reports Server (NTRS)

    1979-01-01

    A program (PARAM) is described which enables a user to compare the values of meteorological parameters derived from data obtained by the scanning multichannel microwave radiometer (SMMR) instrument on NIMBUS 7 with surface observations made over the ocean. The input to this program is a data base, also described, which contains the surface observations and coincident SMMR data. The evaluation of meteorological parameters using SMMR data is done by a user supplied subroutine. Instruments are given for executing the program and writing the subroutine.

  5. Programming and Proving Correctness of the Scanning Algorithm with Backtrack,

    DTIC Science & Technology

    1980-09-19

    order for us to be able to use the method of intermittent asser- tions, we must generally look through each cycle of the program at the validity of any...lemmas that describe the effect of that cycle and imply ( generally in combination with other ler as) the validity of the main theorem which explains...in the set of candidates A are explicitly given (we are not aware of the order or how they are generated ), the preceding program for universal

  6. Application and implementation of transient algorithms in computer programs

    NASA Technical Reports Server (NTRS)

    Benson, David J.

    1989-01-01

    A brief introduction is given to the nonlinear finite element programs developed at Lawrence Livermore National Laboratory. The four programs are DYNA3D and DYNA2D, which are explicit hydrocodes, and NIKE3D and NIKE2D, which are implicit programs. The main emphasis is on DYNA3D with asides about the other programs. During the past year several new features were added to DYNA3D, and major improvements were made in the computational efficiency of the shell and beam elements. Most of these new features and improvements will eventually make their way into the other programs. The emphasis in the computational mechanics effort was always, and continues to be, efficiency. To get the most out of the supercomputers, all Crays, the programs were vectorized where possible. Several of the more interesting capabilities of DYNA3D will be described and the impact on efficiency will be discussed. Some of the recent work on NIKE3D and NIKE2D will also be presented. In the belief that a single example is worth a thousand equations, the theory is skipped entirely and the examples presented.

  7. Artificial intelligence programming with LabVIEW: genetic algorithms for instrumentation control and optimization.

    PubMed

    Moore, J H

    1995-06-01

    A genetic algorithm for instrumentation control and optimization was developed using the LabVIEW graphical programming environment. The usefulness of this methodology for the optimization of a closed loop control instrument is demonstrated with minimal complexity and the programming is presented in detail to facilitate its adaptation to other LabVIEW applications. Closed loop control instruments have variety of applications in the biomedical sciences including the regulation of physiological processes such as blood pressure. The program presented here should provide a useful starting point for those wishing to incorporate genetic algorithm approaches to LabVIEW mediated optimization of closed loop control instruments.

  8. Algorithm for constructing the programmed motion of a bounding vehicle for the flight phase

    NASA Technical Reports Server (NTRS)

    Lapshin, V. V.

    1979-01-01

    The construction of the programmed motion of a multileg bounding vehicle in the flight was studied. An algorithm is given for solving the boundary value problem for constructing this programmed motion. If the motion is shown to be symmetrical, a simplified use of the algorithm can be applied. A method is proposed for nonimpact of the legs during lift-off of the vehicle, and for softness at touchdown. Tables are utilized to construct this programmed motion over a broad set of standard motion conditions.

  9. Radar Rainfall Estimation using a Quadratic Z-R equation

    NASA Astrophysics Data System (ADS)

    Hall, Will; Rico-Ramirez, Miguel Angel; Kramer, Stefan

    2016-04-01

    The aim of this work is to test a method that enables the input of event based drop size distributions to alter a quadratic reflectivity (Z) to rainfall (R) equation that is limited by fixed upper and lower points. Results will be compared to the Marshall-Palmer Z-R relation outputs and validated by a network of gauges and a single polarisation weather radar located close to Essen, Germany. The time window over which the drop size distribution measurements will be collected is varied to note any effect on the generated quadratic Z-R relation. The new quadratic algorithm shows some distinct improvement over the Marshall-Palmer relationship through multiple events. The inclusion of a minimum number of Z-R points helped to decrease the associated error by defaulting back to the Marshall-Palmer equation if the limit was not reached. More research will be done to discover why the quadratic performs poorly in some events as there appears to be little correlation between number of drops or mean rainfall amount and the associated error. In some cases it seems the spatial distribution of the disdrometers has a significant effect as a large percentage of the rain bands pass to the north of two of the three disdrometers, frequently in a slightly north-easterly direction. However during widespread precipitation events the new algorithm works very well with reductions compared to the Marshall-Palmer relation.

  10. Approximate Graph Edit Distance in Quadratic Time.

    PubMed

    Riesen, Kaspar; Ferrer, Miquel; Bunke, Horst

    2015-09-14

    Graph edit distance is one of the most flexible and general graph matching models available. The major drawback of graph edit distance, however, is its computational complexity that restricts its applicability to graphs of rather small size. Recently the authors of the present paper introduced a general approximation framework for the graph edit distance problem. The basic idea of this specific algorithm is to first compute an optimal assignment of independent local graph structures (including substitutions, deletions, and insertions of nodes and edges). This optimal assignment is complete and consistent with respect to the involved nodes of both graphs and can thus be used to instantly derive an admissible (yet suboptimal) solution for the original graph edit distance problem in O(n3) time. For large scale graphs or graph sets, however, the cubic time complexity may still be too high. Therefore, we propose to use suboptimal algorithms with quadratic rather than cubic time for solving the basic assignment problem. In particular, the present paper introduces five different greedy assignment algorithms in the context of graph edit distance approximation. In an experimental evaluation we show that these methods have great potential for further speeding up the computation of graph edit distance while the approximated distances remain sufficiently accurate for graph based pattern classification.

  11. Genetic-program-based data mining for hybrid decision-theoretic algorithms and theories

    NASA Astrophysics Data System (ADS)

    Smith, James F., III

    2005-03-01

    A genetic program (GP) based data mining (DM) procedure has been developed that automatically creates decision theoretic algorithms. A GP is an algorithm that uses the theory of evolution to automatically evolve other computer programs or mathematical expressions. The output of the GP is a computer program or mathematical expression that is optimal in the sense that it maximizes a fitness function. The decision theoretic algorithms created by the DM algorithm are typically designed for making real-time decisions about the behavior of systems. The database that is mined by the DM typically consists of many scenarios characterized by sensor output and labeled by experts as to the status of the scenario. The DM procedure will call a GP as a data mining function. The GP incorporates the database and expert"s rules into its fitness function to evolve an optimal decision theoretic algorithm. A decision theoretic algorithm created through this process will be discussed as well as validation efforts showing the utility of the decision theoretic algorithm created by the DM process. GP based data mining to determine equations related to scientific theories and automatic simplification methods based on computer algebra will also be discussed.

  12. Implementing embedded artificial intelligence rules within algorithmic programming languages

    NASA Technical Reports Server (NTRS)

    Feyock, Stefan

    1988-01-01

    Most integrations of artificial intelligence (AI) capabilities with non-AI (usually FORTRAN-based) application programs require the latter to execute separately to run as a subprogram or, at best, as a coroutine, of the AI system. In many cases, this organization is unacceptable; instead, the requirement is for an AI facility that runs in embedded mode; i.e., is called as subprogram by the application program. The design and implementation of a Prolog-based AI capability that can be invoked in embedded mode are described. The significance of this system is twofold: Provision of Prolog-based symbol-manipulation and deduction facilities makes a powerful symbolic reasoning mechanism available to applications programs written in non-AI languages. The power of the deductive and non-procedural descriptive capabilities of Prolog, which allow the user to describe the problem to be solved, rather than the solution, is to a large extent vitiated by the absence of the standard control structures provided by other languages. Embedding invocations of Prolog rule bases in programs written in non-AI languages makes it possible to put Prolog calls inside DO loops and similar control constructs. The resulting merger of non-AI and AI languages thus results in a symbiotic system in which the advantages of both programming systems are retained, and their deficiencies largely remedied.

  13. Orthogonality preserving infinite dimensional quadratic stochastic operators

    SciTech Connect

    Akın, Hasan; Mukhamedov, Farrukh

    2015-09-18

    In the present paper, we consider a notion of orthogonal preserving nonlinear operators. We introduce π-Volterra quadratic operators finite and infinite dimensional settings. It is proved that any orthogonal preserving quadratic operator on finite dimensional simplex is π-Volterra quadratic operator. In infinite dimensional setting, we describe all π-Volterra operators in terms orthogonal preserving operators.

  14. Dynamic Programming Algorithms and Analyses for Nonserial Networks. Part I.

    DTIC Science & Technology

    1983-01-01

    Journal of Mathematical Analysis and Applications , Vol...Multistage Systems," Journal of Mathematical Analysis and Applications , Vol. 21, 1968, pp. 426-430. 4. Bellman, R.E.,A.O. Esogbue, and I. Nabeshima...the Secondary Optimization Problem in Nonserial Dynamic Programming," Journal of Mathematical Analysis and Applications , Vol. 27, 1969, pp. 565-574.

  15. A comparison of various optimization algorithms of protein-ligand docking programs by fitness accuracy.

    PubMed

    Guo, Liyong; Yan, Zhiqiang; Zheng, Xiliang; Hu, Liang; Yang, Yongliang; Wang, Jin

    2014-07-01

    In protein-ligand docking, an optimization algorithm is used to find the best binding pose of a ligand against a protein target. This algorithm plays a vital role in determining the docking accuracy. To evaluate the relative performance of different optimization algorithms and provide guidance for real applications, we performed a comparative study on six efficient optimization algorithms, containing two evolutionary algorithm (EA)-based optimizers (LGA, DockDE) and four particle swarm optimization (PSO)-based optimizers (SODock, varCPSO, varCPSO-ls, FIPSDock), which were implemented into the protein-ligand docking program AutoDock. We unified the objective functions by applying the same scoring function, and built a new fitness accuracy as the evaluation criterion that incorporates optimization accuracy, robustness, and efficiency. The varCPSO and varCPSO-ls algorithms show high efficiency with fast convergence speed. However, their accuracy is not optimal, as they cannot reach very low energies. SODock has the highest accuracy and robustness. In addition, SODock shows good performance in efficiency when optimizing drug-like ligands with less than ten rotatable bonds. FIPSDock shows excellent robustness and is close to SODock in accuracy and efficiency. In general, the four PSO-based algorithms show superior performance than the two EA-based algorithms, especially for highly flexible ligands. Our method can be regarded as a reference for the validation of new optimization algorithms in protein-ligand docking.

  16. Algorithm for obtaining angular fluxes in a cell for the LUCKY and LUCKY{sub C} multiprocessor programs

    SciTech Connect

    Moryakov, A. V.

    2012-12-15

    Basic formulas for solving the transport equation in a cell are presented. The algorithm has been implemented in the LUCKY and LUCKY{sub C} programs. The advantages of the proposed algorithm are described.

  17. Algorithm for obtaining angular fluxes in a cell for the LUCKY and LUCKY_C multiprocessor programs

    NASA Astrophysics Data System (ADS)

    Moryakov, A. V.

    2012-12-01

    Basic formulas for solving the transport equation in a cell are presented. The algorithm has been implemented in the LUCKY and LUCKY_C programs. The advantages of the proposed algorithm are described.

  18. Properties of surjective real quadratic maps

    NASA Astrophysics Data System (ADS)

    Arutyunov, A. V.; Zhukovskiy, S. E.

    2016-09-01

    The properties of surjective real quadratic maps are investigated. Sufficient conditions for the property of surjectivity to be stable under various perturbations are obtained. Examples of surjective quadratic maps whose surjectivity breaks down after an arbitrarily small perturbation are constructed. Sufficient conditions for quadratic maps to have nontrivial zeros are obtained. For a smooth even map in a neighbourhood of the origin an inverse function theorem in terms of the degree of the corresponding quadratic map is obtained. A canonical form of surjective quadratic maps from {R}^3 to {R}^3 is constructed. Bibliography: 27 titles.

  19. A Projection Neural Network for Constrained Quadratic Minimax Optimization.

    PubMed

    Liu, Qingshan; Wang, Jun

    2015-11-01

    This paper presents a projection neural network described by a dynamic system for solving constrained quadratic minimax programming problems. Sufficient conditions based on a linear matrix inequality are provided for global convergence of the proposed neural network. Compared with some of the existing neural networks for quadratic minimax optimization, the proposed neural network in this paper is capable of solving more general constrained quadratic minimax optimization problems, and the designed neural network does not include any parameter. Moreover, the neural network has lower model complexities, the number of state variables of which is equal to that of the dimension of the optimization problems. The simulation results on numerical examples are discussed to demonstrate the effectiveness and characteristics of the proposed neural network.

  20. The generalized quadratic knapsack problem. A neuronal network approach.

    PubMed

    Talaván, Pedro M; Yáñez, Javier

    2006-05-01

    The solution of an optimization problem through the continuous Hopfield network (CHN) is based on some energy or Lyapunov function, which decreases as the system evolves until a local minimum value is attained. A new energy function is proposed in this paper so that any 0-1 linear constrains programming with quadratic objective function can be solved. This problem, denoted as the generalized quadratic knapsack problem (GQKP), includes as particular cases well-known problems such as the traveling salesman problem (TSP) and the quadratic assignment problem (QAP). This new energy function generalizes those proposed by other authors. Through this energy function, any GQKP can be solved with an appropriate parameter setting procedure, which is detailed in this paper. As a particular case, and in order to test this generalized energy function, some computational experiments solving the traveling salesman problem are also included.

  1. Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs

    DOE PAGES

    Gade, Dinakar; Hackebeil, Gabriel; Ryan, Sarah M.; ...

    2016-04-02

    We present a method for computing lower bounds in the progressive hedging algorithm (PHA) for two-stage and multi-stage stochastic mixed-integer programs. Computing lower bounds in the PHA allows one to assess the quality of the solutions generated by the algorithm contemporaneously. The lower bounds can be computed in any iteration of the algorithm by using dual prices that are calculated during execution of the standard PHA. In conclusion, we report computational results on stochastic unit commitment and stochastic server location problem instances, and explore the relationship between key PHA parameters and the quality of the resulting lower bounds.

  2. A cutting plane algorithm for semi-definite programming problems with applications to failure discriminant analysis

    NASA Astrophysics Data System (ADS)

    Konno, Hiroshi; Gotoh, Jun-Ya; Uno, Takeaki; Yuki, Atsushi

    2002-09-01

    We will propose a new cutting plane algorithm for solving a class of semi-definite programming problems (SDP) with a small number of variables and a large number of constraints. Problems of this type appear when we try to classify a large number of multi-dimensional data into two groups by a hyper-ellipsoidal surface. Among such examples are cancer diagnosis, failure discrimination of enterprises. Also, a certain class of option pricing problems can be formulated as this type of problem. We will show that the cutting plane algorithm is much more efficient than the standard interior point algorithms for solving SDP.

  3. An Atmospheric Guidance Algorithm Testbed for the Mars Surveyor Program 2001 Orbiter and Lander

    NASA Technical Reports Server (NTRS)

    Striepe, Scott A.; Queen, Eric M.; Powell, Richard W.; Braun, Robert D.; Cheatwood, F. McNeil; Aguirre, John T.; Sachi, Laura A.; Lyons, Daniel T.

    1998-01-01

    An Atmospheric Flight Team was formed by the Mars Surveyor Program '01 mission office to develop aerocapture and precision landing testbed simulations and candidate guidance algorithms. Three- and six-degree-of-freedom Mars atmospheric flight simulations have been developed for testing, evaluation, and analysis of candidate guidance algorithms for the Mars Surveyor Program 2001 Orbiter and Lander. These simulations are built around the Program to Optimize Simulated Trajectories. Subroutines were supplied by Atmospheric Flight Team members for modeling the Mars atmosphere, spacecraft control system, aeroshell aerodynamic characteristics, and other Mars 2001 mission specific models. This paper describes these models and their perturbations applied during Monte Carlo analyses to develop, test, and characterize candidate guidance algorithms.

  4. Concurrent extensions to the FORTRAN language for parallel programming of computational fluid dynamics algorithms

    NASA Technical Reports Server (NTRS)

    Weeks, Cindy Lou

    1986-01-01

    Experiments were conducted at NASA Ames Research Center to define multi-tasking software requirements for multiple-instruction, multiple-data stream (MIMD) computer architectures. The focus was on specifying solutions for algorithms in the field of computational fluid dynamics (CFD). The program objectives were to allow researchers to produce usable parallel application software as soon as possible after acquiring MIMD computer equipment, to provide researchers with an easy-to-learn and easy-to-use parallel software language which could be implemented on several different MIMD machines, and to enable researchers to list preferred design specifications for future MIMD computer architectures. Analysis of CFD algorithms indicated that extensions of an existing programming language, adaptable to new computer architectures, provided the best solution to meeting program objectives. The CoFORTRAN Language was written in response to these objectives and to provide researchers a means to experiment with parallel software solutions to CFD algorithms on machines with parallel architectures.

  5. AI-BL1.0: a program for automatic on-line beamline optimization using the evolutionary algorithm.

    PubMed

    Xi, Shibo; Borgna, Lucas Santiago; Zheng, Lirong; Du, Yonghua; Hu, Tiandou

    2017-01-01

    In this report, AI-BL1.0, an open-source Labview-based program for automatic on-line beamline optimization, is presented. The optimization algorithms used in the program are Genetic Algorithm and Differential Evolution. Efficiency was improved by use of a strategy known as Observer Mode for Evolutionary Algorithm. The program was constructed and validated at the XAFCA beamline of the Singapore Synchrotron Light Source and 1W1B beamline of the Beijing Synchrotron Radiation Facility.

  6. Asymptotic Normality of Quadratic Estimators.

    PubMed

    Robins, James; Li, Lingling; Tchetgen, Eric; van der Vaart, Aad

    2016-12-01

    We prove conditional asymptotic normality of a class of quadratic U-statistics that are dominated by their degenerate second order part and have kernels that change with the number of observations. These statistics arise in the construction of estimators in high-dimensional semi- and non-parametric models, and in the construction of nonparametric confidence sets. This is illustrated by estimation of the integral of a square of a density or regression function, and estimation of the mean response with missing data. We show that estimators are asymptotically normal even in the case that the rate is slower than the square root of the observations.

  7. Chimeric alignment by dynamic programming: Algorithm and biological uses

    SciTech Connect

    Komatsoulis, G.A.; Waterman, M.S.

    1997-12-01

    A new nearest-neighbor method for detecting chimeric 16S rRNA artifacts generated during PCR amplification from mixed populations has been developed. The method uses dynamic programming to generate an optimal chimeric alignment, defined as the highest scoring alignment between a query and a concatenation of a 5{prime} and a 3{prime} segment from two separate entries from a database of related sequences. Chimeras are detected by studying the scores and form of the chimeric and global sequence alignments. The chimeric alignment method was found to be marginally more effective than k-tuple based nearest-neighbor methods in simulation studies, but its most effective use is in concert with k-tuple methods. 15 refs., 3 figs., 1 tab.

  8. Algorithm Building and Learning Programming Languages Using a New Educational Paradigm

    NASA Astrophysics Data System (ADS)

    Jain, Anshul K.; Singhal, Manik; Gupta, Manu Sheel

    2011-08-01

    This research paper presents a new concept of using a single tool to associate syntax of various programming languages, algorithms and basic coding techniques. A simple framework has been programmed in Python that helps students learn skills to develop algorithms, and implement them in various programming languages. The tool provides an innovative and a unified graphical user interface for development of multimedia objects, educational games and applications. It also aids collaborative learning amongst students and teachers through an integrated mechanism based on Remote Procedure Calls. The paper also elucidates an innovative method for code generation to enable students to learn the basics of programming languages using drag-n-drop methods for image objects.

  9. Algorithms and programming tools for image processing on the MPP:3

    NASA Technical Reports Server (NTRS)

    Reeves, Anthony P.

    1987-01-01

    This is the third and final report on the work done for NASA Grant 5-403 on Algorithms and Programming Tools for Image Processing on the MPP:3. All the work done for this grant is summarized in the introduction. Work done since August 1986 is reported in detail. Research for this grant falls under the following headings: (1) fundamental algorithms for the MPP; (2) programming utilities for the MPP; (3) the Parallel Pascal Development System; and (4) performance analysis. In this report, the results of two efforts are reported: region growing, and performance analysis of important characteristic algorithms. In each case, timing results from MPP implementations are included. A paper is included in which parallel algorithms for region growing on the MPP is discussed. These algorithms permit different sized regions to be merged in parallel. Details on the implementation and peformance of several important MPP algorithms are given. These include a number of standard permutations, the FFT, convolution, arbitrary data mappings, image warping, and pyramid operations, all of which have been implemented on the MPP. The permutation and image warping functions have been included in the standard development system library.

  10. A parallel dynamic programming algorithm for multi-reservoir system optimization

    NASA Astrophysics Data System (ADS)

    Li, Xiang; Wei, Jiahua; Li, Tiejian; Wang, Guangqian; Yeh, William W.-G.

    2014-05-01

    This paper develops a parallel dynamic programming algorithm to optimize the joint operation of a multi-reservoir system. First, a multi-dimensional dynamic programming (DP) model is formulated for a multi-reservoir system. Second, the DP algorithm is parallelized using a peer-to-peer parallel paradigm. The parallelization is based on the distributed memory architecture and the message passing interface (MPI) protocol. We consider both the distributed computing and distributed computer memory in the parallelization. The parallel paradigm aims at reducing the computation time as well as alleviating the computer memory requirement associated with running a multi-dimensional DP model. Next, we test the parallel DP algorithm on the classic, benchmark four-reservoir problem on a high-performance computing (HPC) system with up to 350 cores. Results indicate that the parallel DP algorithm exhibits good performance in parallel efficiency; the parallel DP algorithm is scalable and will not be restricted by the number of cores. Finally, the parallel DP algorithm is applied to a real-world, five-reservoir system in China. The results demonstrate the parallel efficiency and practical utility of the proposed methodology.

  11. Error bounds of adaptive dynamic programming algorithms for solving undiscounted optimal control problems.

    PubMed

    Liu, Derong; Li, Hongliang; Wang, Ding

    2015-06-01

    In this paper, we establish error bounds of adaptive dynamic programming algorithms for solving undiscounted infinite-horizon optimal control problems of discrete-time deterministic nonlinear systems. We consider approximation errors in the update equations of both value function and control policy. We utilize a new assumption instead of the contraction assumption in discounted optimal control problems. We establish the error bounds for approximate value iteration based on a new error condition. Furthermore, we also establish the error bounds for approximate policy iteration and approximate optimistic policy iteration algorithms. It is shown that the iterative approximate value function can converge to a finite neighborhood of the optimal value function under some conditions. To implement the developed algorithms, critic and action neural networks are used to approximate the value function and control policy, respectively. Finally, a simulation example is given to demonstrate the effectiveness of the developed algorithms.

  12. A Survey of Successful Evaluations of Program Visualization and Algorithm Animation Systems

    ERIC Educational Resources Information Center

    Urquiza-Fuentes, Jaime; Velazquez-Iturbide, J. Angel

    2009-01-01

    This article reviews successful educational experiences in using program and algorithm visualizations (PAVs). First, we survey a total of 18 PAV systems that were subject to 33 evaluations. We found that half of the systems have only been tested for usability, and those were shallow inspections. The rest were evaluated with respect to their…

  13. An Optimal Algorithm towards Successive Location Privacy in Sensor Networks with Dynamic Programming

    NASA Astrophysics Data System (ADS)

    Zhao, Baokang; Wang, Dan; Shao, Zili; Cao, Jiannong; Chan, Keith C. C.; Su, Jinshu

    In wireless sensor networks, preserving location privacy under successive inference attacks is extremely critical. Although this problem is NP-complete in general cases, we propose a dynamic programming based algorithm and prove it is optimal in special cases where the correlation only exists between p immediate adjacent observations.

  14. The Random Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Paul, Gerald; Shao, Jia; Stanley, H. Eugene

    2011-11-01

    The quadratic assignment problem, QAP, is one of the most difficult of all combinatorial optimization problems. Here, we use an abbreviated application of the statistical mechanics replica method to study the asymptotic behavior of instances in which the entries of at least one of the two matrices that specify the problem are chosen from a random distribution P. Surprisingly, the QAP has not been studied before using the replica method despite the fact that the QAP was first proposed over 50 years ago and the replica method was developed over 30 years ago. We find simple forms for C min and C max , the costs of the minimal and maximum solutions respectively. Notable features of our results are the symmetry of the results for C min and C max and their dependence on P only through its mean and standard deviation, independent of the details of P.

  15. Single-photon quadratic optomechanics

    PubMed Central

    Liao, Jie-Qiao; Nori, Franco

    2014-01-01

    We present exact analytical solutions to study the coherent interaction between a single photon and the mechanical motion of a membrane in quadratic optomechanics. We consider single-photon emission and scattering when the photon is initially inside the cavity and in the fields outside the cavity, respectively. Using our solutions, we calculate the single-photon emission and scattering spectra, and find relations between the spectral features and the system's inherent parameters, such as: the optomechanical coupling strength, the mechanical frequency, and the cavity-field decay rate. In particular, we clarify the conditions for the phonon sidebands to be visible. We also study the photon-phonon entanglement for the long-time emission and scattering states. The linear entropy is employed to characterize this entanglement by treating it as a bipartite one between a single mode of phonons and a single photon. PMID:25200128

  16. Enhancements on the Convex Programming Based Powered Descent Guidance Algorithm for Mars Landing

    NASA Technical Reports Server (NTRS)

    Acikmese, Behcet; Blackmore, Lars; Scharf, Daniel P.; Wolf, Aron

    2008-01-01

    In this paper, we present enhancements on the powered descent guidance algorithm developed for Mars pinpoint landing. The guidance algorithm solves the powered descent minimum fuel trajectory optimization problem via a direct numerical method. Our main contribution is to formulate the trajectory optimization problem, which has nonconvex control constraints, as a finite dimensional convex optimization problem, specifically as a finite dimensional second order cone programming (SOCP) problem. SOCP is a subclass of convex programming, and there are efficient SOCP solvers with deterministic convergence properties. Hence, the resulting guidance algorithm can potentially be implemented onboard a spacecraft for real-time applications. Particularly, this paper discusses the algorithmic improvements obtained by: (i) Using an efficient approach to choose the optimal time-of-flight; (ii) Using a computationally inexpensive way to detect the feasibility/ infeasibility of the problem due to the thrust-to-weight constraint; (iii) Incorporating the rotation rate of the planet into the problem formulation; (iv) Developing additional constraints on the position and velocity to guarantee no-subsurface flight between the time samples of the temporal discretization; (v) Developing a fuel-limited targeting algorithm; (vi) Initial result on developing an onboard table lookup method to obtain almost fuel optimal solutions in real-time.

  17. Algorithms and programming tools for image processing on the MPP, part 2

    NASA Technical Reports Server (NTRS)

    Reeves, Anthony P.

    1986-01-01

    A number of algorithms were developed for image warping and pyramid image filtering. Techniques were investigated for the parallel processing of a large number of independent irregular shaped regions on the MPP. In addition some utilities for dealing with very long vectors and for sorting were developed. Documentation pages for the algorithms which are available for distribution are given. The performance of the MPP for a number of basic data manipulations was determined. From these results it is possible to predict the efficiency of the MPP for a number of algorithms and applications. The Parallel Pascal development system, which is a portable programming environment for the MPP, was improved and better documentation including a tutorial was written. This environment allows programs for the MPP to be developed on any conventional computer system; it consists of a set of system programs and a library of general purpose Parallel Pascal functions. The algorithms were tested on the MPP and a presentation on the development system was made to the MPP users group. The UNIX version of the Parallel Pascal System was distributed to a number of new sites.

  18. A Dynamic Programming Algorithm For (1,2)-Exemplar Breakpoint Distance.

    PubMed

    Wei, Zhexue; Zhu, Daming; Wang, Lusheng

    2015-07-01

    The exemplar breakpoint distance problem is motivated by finding conserved sets of genes between two genomes. It asks to find respective exemplars in two genomes to minimize the breakpoint distance between them. If one genome has no repeated gene (called trivial genome) and the other has genes repeating at most twice, it is referred to as the (1, 2)-exemplar breakpoint distance problem, EBD(1, 2) for short. Little has been done on algorithm design for this problem by now. In this article, we propose a parameter to describe the maximum physical span between two copies of a gene in a genome, and based on it, design a fixed-parameter algorithm for EBD(1, 2). Using a dynamic programming approach, our algorithm can take O(4(s)n(2)) time and O(4(s)n) space to solve an EBD(1, 2) instance that has two genomes of n genes where the second genome has each two copies of a gene spanning at most s copies of the genes. Our algorithm can also be used to compute the maximum adjacencies between two genomes. The algorithm has been implemented in C++. Simulations on randomly generated data have verified the effectiveness of our algorithm. The software package is available from the authors.

  19. Correlation signatures of wet soils and snows. [algorithm development and computer programming

    NASA Technical Reports Server (NTRS)

    Phillips, M. R.

    1972-01-01

    Interpretation, analysis, and development of algorithms have provided the necessary computational programming tools for soil data processing, data handling and analysis. Algorithms that have been developed thus far, are adequate and have been proven successful for several preliminary and fundamental applications such as software interfacing capabilities, probability distributions, grey level print plotting, contour plotting, isometric data displays, joint probability distributions, boundary mapping, channel registration and ground scene classification. A description of an Earth Resources Flight Data Processor, (ERFDP), which handles and processes earth resources data under a users control is provided.

  20. Optimization with quadratic support functions in nonconvex smooth optimization

    NASA Astrophysics Data System (ADS)

    Khamisov, O. V.

    2016-10-01

    Problem of global minimization of twice continuously differentiable function with Lipschitz second derivatives over a polytope is considered. We suggest a branch and bound method with polytopes as partition elements. Due to the Lipschitz property of the objective function we can construct a quadratic support minorant at each point of the feasible set. Global minimum of of this minorant provides a lower bound of the objective over given partition subset. The main advantage of the suggested method consists in the following. First quadratic minorants usually are nonconvex and we have to solve auxiliary global optimization problem. This problem is reduced to a mixed 0-1 linear programming problem and can be solved by an advanced 0-1 solver. Then we show that the quadratic minorants are getting convex as soon as partition elements are getting smaller in diameter. Hence, at the final steps of the branch and bound method we solve convex auxiliary quadratic problems. Therefore, the method accelerates when we are close to the global minimum of the initial problem.

  1. On Quantization of Quadratic Poisson Structures

    NASA Astrophysics Data System (ADS)

    Manchon, D.; Masmoudi, M.; Roux, A.

    Any classical r-matrix on the Lie algebra of linear operators on a real vector space V gives rise to a quadratic Poisson structure on V which admits a deformation quantization stemming from the construction of V. Drinfel'd [Dr], [Gr]. We exhibit in this article an example of quadratic Poisson structure which does not arise this way.

  2. Applying new optimization algorithms to more predictive control

    SciTech Connect

    Wright, S.J.

    1996-03-01

    The connections between optimization and control theory have been explored by many researchers and optimization algorithms have been applied with success to optimal control. The rapid pace of developments in model predictive control has given rise to a host of new problems to which optimization has yet to be applied. Concurrently, developments in optimization, and especially in interior-point methods, have produced a new set of algorithms that may be especially helpful in this context. In this paper, we reexamine the relatively simple problem of control of linear processes subject to quadratic objectives and general linear constraints. We show how new algorithms for quadratic programming can be applied efficiently to this problem. The approach extends to several more general problems in straightforward ways.

  3. Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semi-Infinite Minimax Problems

    DTIC Science & Technology

    2011-06-01

    minimax and min-max-min problems and their efficiency. Phd thesis , Naval Postgraduate School, Monterey, California, 2011. [25] J.H. Jung, D.P. O’Leary, and...California, USA. Corresponding author, email: joroyset@nps.edu ‡Principal Analyst, Operations Analysis and Simulation, Defence Science and Technology ...quadratic programming (SQP) algorithm in [11] and the Pshenichnyi-Pironneau-Polak ( PPP ) algorithm [8, Section 2.4] for solving finite minimax problems

  4. Solving the Quadratic Assignment Problems using Parallel ACO with Symmetric Multi Processing

    NASA Astrophysics Data System (ADS)

    Tsutsui, Shigeyoshi

    In this paper, we propose several types of parallel ant colony optimization algorithms with symmetric multi processing for solving the quadratic assignment problem (QAP). These models include the master-slave models and the island models. As a base ant colony optimization algorithm, we used the cunning Ant System (cAS) which showed promising performance our in previous studies. We evaluated each parallel algorithm with a condition that the run time for each parallel algorithm and the base sequential algorithm are the same. The results suggest that using the master-slave model with increased iteration of ant colony optimization algorithms is promising in solving quadratic assignment problems for real or real-like instances.

  5. Class Notes: Programming Parallel Algorithms CS 15-840B (Fall 1992)

    DTIC Science & Technology

    1993-02-01

    840: Programming Parallel Algorithms Lecture #15 Scribe: Bob Wheeler Thursday, 6 Nov 92 Overview * Connected components (continued). * Minimum spanning...Sriram Sethuraman Singular value decomposition Ken Tew EEG analysis Eric Thayer Speech recognition Xuemei Wang & Bob Wheeler Matrix operations Matt...Computing, 14(4):862-874, 1985. [33] L. W. Tucker, C. R. Feynman , and D. M. Fritzsche. Object recognition using the Connection Machine. Proceedings CVPR 󈨜

  6. OpenACC programs of the Swendsen-Wang multi-cluster spin flip algorithm

    NASA Astrophysics Data System (ADS)

    Komura, Yukihiro

    2015-12-01

    We present sample OpenACC programs of the Swendsen-Wang multi-cluster spin flip algorithm. OpenACC is a directive-based programming model for accelerators without requiring modification to the underlying CPU code itself. In this paper, we deal with the classical spin models as with the sample CUDA programs (Komura and Okabe, 2014), that is, two-dimensional (2D) Ising model, three-dimensional (3D) Ising model, 2D Potts model, 3D Potts model, 2D XY model and 3D XY model. We explain the details of sample OpenACC programs and compare the performance of the present OpenACC implementations with that of the CUDA implementations for the 2D and 3D Ising models and the 2D and 3D XY models.

  7. An interior point method for semidefinite programming

    SciTech Connect

    Helmberg, C.; Rendl, F.; Vanderbei, R.J.; Wolkowicz, H.

    1994-12-31

    Semidefinite programming is of rising importance in min-max eigenvalue problems and relaxations for NP-complete problems. We present a new interior point algorithm based on the linearization XZ {minus} {mu}I which is very successful in linear programming. We show that, although the original {Delta}X is not symmetric, by using the symmetric part of {Delta}X convergence can be guaranteed. The algorithm works for arbitrary combinations of equalities and inequalities and, contrary to linearizations such as XZ + ZX {minus} {mu}I, does not make use of Kronecker products. In numerical experiments the algorithm exhibits fast quadratic convergence.

  8. ALGORITHMS AND PROGRAMS FOR STRONG GRAVITATIONAL LENSING IN KERR SPACE-TIME INCLUDING POLARIZATION

    SciTech Connect

    Chen, Bin; Maddumage, Prasad; Kantowski, Ronald; Dai, Xinyu; Baron, Eddie

    2015-05-15

    Active galactic nuclei (AGNs) and quasars are important astrophysical objects to understand. Recently, microlensing observations have constrained the size of the quasar X-ray emission region to be of the order of 10 gravitational radii of the central supermassive black hole. For distances within a few gravitational radii, light paths are strongly bent by the strong gravity field of the central black hole. If the central black hole has nonzero angular momentum (spin), then a photon’s polarization plane will be rotated by the gravitational Faraday effect. The observed X-ray flux and polarization will then be influenced significantly by the strong gravity field near the source. Consequently, linear gravitational lensing theory is inadequate for such extreme circumstances. We present simple algorithms computing the strong lensing effects of Kerr black holes, including the effects on polarization. Our algorithms are realized in a program “KERTAP” in two versions: MATLAB and Python. The key ingredients of KERTAP are a graphic user interface, a backward ray-tracing algorithm, a polarization propagator dealing with gravitational Faraday rotation, and algorithms computing observables such as flux magnification and polarization angles. Our algorithms can be easily realized in other programming languages such as FORTRAN, C, and C++. The MATLAB version of KERTAP is parallelized using the MATLAB Parallel Computing Toolbox and the Distributed Computing Server. The Python code was sped up using Cython and supports full implementation of MPI using the “mpi4py” package. As an example, we investigate the inclination angle dependence of the observed polarization and the strong lensing magnification of AGN X-ray emission. We conclude that it is possible to perform complex numerical-relativity related computations using interpreted languages such as MATLAB and Python.

  9. Algorithms and Programs for Strong Gravitational Lensing In Kerr Space-time Including Polarization

    NASA Astrophysics Data System (ADS)

    Chen, Bin; Kantowski, Ronald; Dai, Xinyu; Baron, Eddie; Maddumage, Prasad

    2015-05-01

    Active galactic nuclei (AGNs) and quasars are important astrophysical objects to understand. Recently, microlensing observations have constrained the size of the quasar X-ray emission region to be of the order of 10 gravitational radii of the central supermassive black hole. For distances within a few gravitational radii, light paths are strongly bent by the strong gravity field of the central black hole. If the central black hole has nonzero angular momentum (spin), then a photon’s polarization plane will be rotated by the gravitational Faraday effect. The observed X-ray flux and polarization will then be influenced significantly by the strong gravity field near the source. Consequently, linear gravitational lensing theory is inadequate for such extreme circumstances. We present simple algorithms computing the strong lensing effects of Kerr black holes, including the effects on polarization. Our algorithms are realized in a program “KERTAP” in two versions: MATLAB and Python. The key ingredients of KERTAP are a graphic user interface, a backward ray-tracing algorithm, a polarization propagator dealing with gravitational Faraday rotation, and algorithms computing observables such as flux magnification and polarization angles. Our algorithms can be easily realized in other programming languages such as FORTRAN, C, and C++. The MATLAB version of KERTAP is parallelized using the MATLAB Parallel Computing Toolbox and the Distributed Computing Server. The Python code was sped up using Cython and supports full implementation of MPI using the “mpi4py” package. As an example, we investigate the inclination angle dependence of the observed polarization and the strong lensing magnification of AGN X-ray emission. We conclude that it is possible to perform complex numerical-relativity related computations using interpreted languages such as MATLAB and Python.

  10. Solving the quadratic assignment problem with clues from nature.

    PubMed

    Nissen, V

    1994-01-01

    This paper describes a new evolutionary approach to solving quadratic assignment problems. The proposed technique is based loosely on a class of search and optimization algorithms known as evolution strategies (ES). These methods are inspired by the mechanics of biological evolution and have been applied successfully to a variety of difficult problems, particularly in continuous optimization. The combinatorial variant of ES presented here performs very well on the given test problems as compared with the standard 2-Opt heuristic and results with simulated annealing and tabu search. Extensions for practical applications in factory layout are described.

  11. Models of performance of evolutionary program induction algorithms based on indicators of problem difficulty.

    PubMed

    Graff, Mario; Poli, Riccardo; Flores, Juan J

    2013-01-01

    Modeling the behavior of algorithms is the realm of evolutionary algorithm theory. From a practitioner's point of view, theory must provide some guidelines regarding which algorithm/parameters to use in order to solve a particular problem. Unfortunately, most theoretical models of evolutionary algorithms are difficult to apply to realistic situations. However, in recent work (Graff and Poli, 2008, 2010), where we developed a method to practically estimate the performance of evolutionary program-induction algorithms (EPAs), we started addressing this issue. The method was quite general; however, it suffered from some limitations: it required the identification of a set of reference problems, it required hand picking a distance measure in each particular domain, and the resulting models were opaque, typically being linear combinations of 100 features or more. In this paper, we propose a significant improvement of this technique that overcomes the three limitations of our previous method. We achieve this through the use of a novel set of features for assessing problem difficulty for EPAs which are very general, essentially based on the notion of finite difference. To show the capabilities or our technique and to compare it with our previous performance models, we create models for the same two important classes of problems-symbolic regression on rational functions and Boolean function induction-used in our previous work. We model a variety of EPAs. The comparison showed that for the majority of the algorithms and problem classes, the new method produced much simpler and more accurate models than before. To further illustrate the practicality of the technique and its generality (beyond EPAs), we have also used it to predict the performance of both autoregressive models and EPAs on the problem of wind speed forecasting, obtaining simpler and more accurate models that outperform in all cases our previous performance models.

  12. The Joint Polar Satellite System (JPSS) Program's Algorithm Change Process (ACP): Past, Present and Future

    NASA Technical Reports Server (NTRS)

    Griffin, Ashley

    2017-01-01

    The Joint Polar Satellite System (JPSS) Program Office is the supporting organization for the Suomi National Polar Orbiting Partnership (S-NPP) and JPSS-1 satellites. S-NPP carries the following sensors: VIIRS, CrIS, ATMS, OMPS, and CERES with instruments that ultimately produce over 25 data products that cover the Earths weather, oceans, and atmosphere. A team of scientists and engineers from all over the United States document, monitor and fix errors in operational software code or documentation with the algorithm change process (ACP) to ensure the success of the S-NPP and JPSS 1 missions by maintaining quality and accuracy of the data products the scientific community relies on. This poster will outline the programs algorithm change process (ACP), identify the various users and scientific applications of our operational data products and highlight changes that have been made to the ACP to accommodate operating system upgrades to the JPSS programs Interface Data Processing Segment (IDPS), so that the program is ready for the transition to the 2017 JPSS-1 satellite mission and beyond.

  13. Program for the analysis of time series. [by means of fast Fourier transform algorithm

    NASA Technical Reports Server (NTRS)

    Brown, T. J.; Brown, C. G.; Hardin, J. C.

    1974-01-01

    A digital computer program for the Fourier analysis of discrete time data is described. The program was designed to handle multiple channels of digitized data on general purpose computer systems. It is written, primarily, in a version of FORTRAN 2 currently in use on CDC 6000 series computers. Some small portions are written in CDC COMPASS, an assembler level code. However, functional descriptions of these portions are provided so that the program may be adapted for use on any facility possessing a FORTRAN compiler and random-access capability. Properly formatted digital data are windowed and analyzed by means of a fast Fourier transform algorithm to generate the following functions: (1) auto and/or cross power spectra, (2) autocorrelations and/or cross correlations, (3) Fourier coefficients, (4) coherence functions, (5) transfer functions, and (6) histograms.

  14. Design and Evaluation of a Dynamic Programming Flight Routing Algorithm Using the Convective Weather Avoidance Model

    NASA Technical Reports Server (NTRS)

    Ng, Hok K.; Grabbe, Shon; Mukherjee, Avijit

    2010-01-01

    The optimization of traffic flows in congested airspace with varying convective weather is a challenging problem. One approach is to generate shortest routes between origins and destinations while meeting airspace capacity constraint in the presence of uncertainties, such as weather and airspace demand. This study focuses on development of an optimal flight path search algorithm that optimizes national airspace system throughput and efficiency in the presence of uncertainties. The algorithm is based on dynamic programming and utilizes the predicted probability that an aircraft will deviate around convective weather. It is shown that the running time of the algorithm increases linearly with the total number of links between all stages. The optimal routes minimize a combination of fuel cost and expected cost of route deviation due to convective weather. They are considered as alternatives to the set of coded departure routes which are predefined by FAA to reroute pre-departure flights around weather or air traffic constraints. A formula, which calculates predicted probability of deviation from a given flight path, is also derived. The predicted probability of deviation is calculated for all path candidates. Routes with the best probability are selected as optimal. The predicted probability of deviation serves as a computable measure of reliability in pre-departure rerouting. The algorithm can also be extended to automatically adjust its design parameters to satisfy the desired level of reliability.

  15. Schur Stability Regions for Complex Quadratic Polynomials

    ERIC Educational Resources Information Center

    Cheng, Sui Sun; Huang, Shao Yuan

    2010-01-01

    Given a quadratic polynomial with complex coefficients, necessary and sufficient conditions are found in terms of the coefficients such that all its roots have absolute values less than 1. (Contains 3 figures.)

  16. Linear quadratic optimal control for symmetric systems

    NASA Technical Reports Server (NTRS)

    Lewis, J. H.; Martin, C. F.

    1983-01-01

    Special symmetries are present in many control problems. This paper addresses the problem of determining linear-quadratic optimal control problems whose solutions preserve the symmetry of the initial linear control system.

  17. Test spaces and characterizations of quadratic spaces

    NASA Astrophysics Data System (ADS)

    Dvurečenskij, Anatolij

    1996-10-01

    We show that a test space consisting of nonzero vectors of a quadratic space E and of the set all maximal orthogonal systems in E is algebraic iff E is Dacey or, equivalently, iff E is orthomodular. In addition, we present another orthomodularity criteria of quadratic spaces, and using the result of Solèr, we show that they can imply that E is a real, complex, or quaternionic Hilbert space.

  18. Combining classifiers generated by multi-gene genetic programming for protein fold recognition using genetic algorithm.

    PubMed

    Bardsiri, Mahshid Khatibi; Eftekhari, Mahdi; Mousavi, Reza

    2015-01-01

    In this study the problem of protein fold recognition, that is a classification task, is solved via a hybrid of evolutionary algorithms namely multi-gene Genetic Programming (GP) and Genetic Algorithm (GA). Our proposed method consists of two main stages and is performed on three datasets taken from the literature. Each dataset contains different feature groups and classes. In the first step, multi-gene GP is used for producing binary classifiers based on various feature groups for each class. Then, different classifiers obtained for each class are combined via weighted voting so that the weights are determined through GA. At the end of the first step, there is a separate binary classifier for each class. In the second stage, the obtained binary classifiers are combined via GA weighting in order to generate the overall classifier. The final obtained classifier is superior to the previous works found in the literature in terms of classification accuracy.

  19. Modified Cholesky factorizations in interior-point algorithms for linear programming.

    SciTech Connect

    Wright, S.; Mathematics and Computer Science

    1999-01-01

    We investigate a modified Cholesky algorithm typical of those used in most interior-point codes for linear programming. Cholesky-based interior-point codes are popular for three reasons: their implementation requires only minimal changes to standard sparse Cholesky algorithms (allowing us to take full advantage of software written by specialists in that area); they tend to be more efficient than competing approaches that use alternative factorizations; and they perform robustly on most practical problems, yielding good interior-point steps even when the coefficient matrix of the main linear system to be solved for the step components is ill conditioned. We investigate this surprisingly robust performance by using analytical tools from matrix perturbation theory and error analysis, illustrating our results with computational experiments. Finally, we point out the potential limitations of this approach.

  20. Programming environment for parallel-vision algorithms. Final technical report, February 1988-December 1989

    SciTech Connect

    Brown, C.

    1990-04-11

    This contract developed and disseminated papers, ideas, algorithms, analysis, software, applications, and implementations for parallel programming environments for computer vision and for vision applications. The work has been widely reported and highly influential. The most significant work centered on the Butterfly Parallel Processor, the MaxVideo pipelined parallel image processor, and the development of the real-time computer vision laboratory. For the Butterfly, the Psyche multi-model operating system was developed and the CONSUL autoparallelizing compiler was designed. Much basic and influential performance monitoring and debugging work was completed, resulting in working systems and novel algorithms. There was also significant research in systems and applications using other parallel architectures in the laboratory, such as the MaxVideo parallel pipelined image processor. The contract developed a heterogeneous parallel architecture involving pipelined and MIMD parallelism and integrated it with a robot head.

  1. Skil: An imperative language with algorithmic skeletons for efficient distributed programming

    SciTech Connect

    Botorog, G.H.; Kuchen, H.

    1996-12-31

    In this paper we present Skil, an imperative language enhanced with higher-order functions and currying, as well as with a polymorphic type system. The high level of Skil allows the integration of algorithmic skeletons, i.e. of higher-order functions representing parallel computation patterns. At the same time, the language can be efficiently implemented. After describing a series of skeletons which work with distributed arrays, we give two examples of parallel programs implemented on the basis of skeletons, namely shortest paths in graphs and Gaussian elimination. Runtime measurements show that we approach the efficiency of message-passing C up to a factor between 1 and 2.5.

  2. A Semi-Infinite Programming based algorithm for determining T-optimum designs for model discrimination.

    PubMed

    Duarte, Belmiro P M; Wong, Weng Kee; Atkinson, Anthony C

    2015-03-01

    T-optimum designs for model discrimination are notoriously difficult to find because of the computational difficulty involved in solving an optimization problem that involves two layers of optimization. Only a handful of analytical T-optimal designs are available for the simplest problems; the rest in the literature are found using specialized numerical procedures for a specific problem. We propose a potentially more systematic and general way for finding T-optimal designs using a Semi-Infinite Programming (SIP) approach. The strategy requires that we first reformulate the original minimax or maximin optimization problem into an equivalent semi-infinite program and solve it using an exchange-based method where lower and upper bounds produced by solving the outer and the inner programs, are iterated to convergence. A global Nonlinear Programming (NLP) solver is used to handle the subproblems, thus finding the optimal design and the least favorable parametric configuration that minimizes the residual sum of squares from the alternative or test models. We also use a nonlinear program to check the global optimality of the SIP-generated design and automate the construction of globally optimal designs. The algorithm is successfully used to produce results that coincide with several T-optimal designs reported in the literature for various types of model discrimination problems with normally distributed errors. However, our method is more general, merely requiring that the parameters of the model be estimated by a numerical optimization.

  3. Scalable Effective Approaches for Quadratic Assignment Problems Based on Conic Optimization and Applications

    DTIC Science & Technology

    2012-02-09

    several optimization models and algorithm design for problems from computer vision and learning , research on sparse solutions in quadratic optimization...following papers: [9] L. Mukherjee, V. Singh, J. Peng and C. Hinrichs. Learning kernels for variants of normalized cuts: Convex relaxations and...are very small gaps compared to state-of-the-art knowledge in comunications . Table 1. Bounds for adjacency matrix

  4. The Factorability of Quadratics: Motivation for More Techniques

    ERIC Educational Resources Information Center

    Bosse, Michael J.; Nandakumar, N. R.

    2005-01-01

    Typically, secondary and college algebra students attempt to utilize either completing the square or the quadratic formula as techniques to solve a quadratic equation only after frustration with factoring has arisen. While both completing the square and the quadratic formula are techniques which can determine solutions for all quadratic equations,…

  5. Discovering link communities in complex networks by an integer programming model and a genetic algorithm.

    PubMed

    Li, Zhenping; Zhang, Xiang-Sun; Wang, Rui-Sheng; Liu, Hongwei; Zhang, Shihua

    2013-01-01

    Identification of communities in complex networks is an important topic and issue in many fields such as sociology, biology, and computer science. Communities are often defined as groups of related nodes or links that correspond to functional subunits in the corresponding complex systems. While most conventional approaches have focused on discovering communities of nodes, some recent studies start partitioning links to find overlapping communities straightforwardly. In this paper, we propose a new quantity function for link community identification in complex networks. Based on this quantity function we formulate the link community partition problem into an integer programming model which allows us to partition a complex network into overlapping communities. We further propose a genetic algorithm for link community detection which can partition a network into overlapping communities without knowing the number of communities. We test our model and algorithm on both artificial networks and real-world networks. The results demonstrate that the model and algorithm are efficient in detecting overlapping community structure in complex networks.

  6. Inversion of oceanic constituents in case I and II waters with genetic programming algorithms.

    PubMed

    Chami, Malik; Robilliard, Denis

    2002-10-20

    A stochastic inverse technique based on agenetic programming (GP) algorithm was developed toinvert oceanic constituents from simulated data for case I and case II water applications. The simulations were carried out with the Ordre Successifs Ocean Atmosphere (OSOA) radiative transfer model. They include the effects of oceanic substances such as algal-related chlorophyll, nonchlorophyllous suspended matter, and dissolved organic matter. The synthetic data set also takes into account the directional effects of particles through a variation of their phase function that makes the simulated data realistic. It is shown that GP can be successfully applied to the inverse problem with acceptable stability in the presence of realistic noise in the data. GP is compared with neural network methodology for case I waters; GP exhibits similar retrieval accuracy, which is greater than for traditional techniques such as band ratio algorithms. The application of GP to real satellite data [a Sea-viewing Wide Field-of-view Sensor (SeaWiFS)] was also carried out for case I waters as a validation. Good agreement was obtained when GP results were compared with the SeaWiFS empirical algorithm. For case II waters the accuracy of GP is less than 33%, which remains satisfactory, at the present time, for remote-sensing purposes.

  7. Detection of spatial variations in temporal trends with a quadratic function.

    PubMed

    Moraga, Paula; Kulldorff, Martin

    2016-08-01

    Methods for the assessment of spatial variations in temporal trends (SVTT) are important tools for disease surveillance, which can help governments to formulate programs to prevent diseases, and measure the progress, impact, and efficacy of preventive efforts already in operation. The linear SVTT method is designed to detect areas with unusual different disease linear trends. In some situations, however, its estimation trend procedure can lead to wrong conclusions. In this article, the quadratic SVTT method is proposed as alternative of the linear SVTT method. The quadratic method provides better estimates of the real trends, and increases the power of detection in situations where the linear SVTT method fails. A performance comparison between the linear and quadratic methods is provided to help illustrate their respective properties. The quadratic method is applied to detect unusual different cervical cancer trends in white women in the United States, over the period 1969 to 1995.

  8. Haar wavelet operational matrix method for solving constrained nonlinear quadratic optimal control problem

    NASA Astrophysics Data System (ADS)

    Swaidan, Waleeda; Hussin, Amran

    2015-10-01

    Most direct methods solve finite time horizon optimal control problems with nonlinear programming solver. In this paper, we propose a numerical method for solving nonlinear optimal control problem with state and control inequality constraints. This method used quasilinearization technique and Haar wavelet operational matrix to convert the nonlinear optimal control problem into a quadratic programming problem. The linear inequality constraints for trajectories variables are converted to quadratic programming constraint by using Haar wavelet collocation method. The proposed method has been applied to solve Optimal Control of Multi-Item Inventory Model. The accuracy of the states, controls and cost can be improved by increasing the Haar wavelet resolution.

  9. Transition Marshall Space Flight Center Wind Profiler Splicing Algorithm to Launch Services Program Upper Winds Tool

    NASA Technical Reports Server (NTRS)

    Bauman, William H., III

    2014-01-01

    NASAs LSP customers and the future SLS program rely on observations of upper-level winds for steering, loads, and trajectory calculations for the launch vehicles flight. On the day of launch, the 45th Weather Squadron (45 WS) Launch Weather Officers (LWOs) monitor the upper-level winds and provide forecasts to the launch team via the AMU-developed LSP Upper Winds tool for launches at Kennedy Space Center (KSC) and Cape Canaveral Air Force Station. This tool displays wind speed and direction profiles from rawinsondes released during launch operations, the 45th Space Wing 915-MHz Doppler Radar Wind Profilers (DRWPs) and KSC 50-MHz DRWP, and output from numerical weather prediction models.The goal of this task was to splice the wind speed and direction profiles from the 45th Space Wing (45 SW) 915-MHz Doppler radar Wind Profilers (DRWPs) and KSC 50-MHz DRWP at altitudes where the wind profiles overlap to create a smooth profile. In the first version of the LSP Upper Winds tool, the top of the 915-MHz DRWP wind profile and the bottom of the 50-MHz DRWP were not spliced, sometimes creating a discontinuity in the profile. The Marshall Space Flight Center (MSFC) Natural Environments Branch (NE) created algorithms to splice the wind profiles from the two sensors to generate an archive of vertically complete wind profiles for the SLS program. The AMU worked with MSFC NE personnel to implement these algorithms in the LSP Upper Winds tool to provide a continuous spliced wind profile.The AMU transitioned the MSFC NE algorithms to interpolate and fill data gaps in the data, implement a Gaussian weighting function to produce 50-m altitude intervals in each sensor, and splice the data together from both DRWPs. They did so by porting the MSFC NE code written with MATLAB software into Microsoft Excel Visual Basic for Applications (VBA). After testing the new algorithms in stand-alone VBA modules, the AMU replaced the existing VBA code in the LSP Upper Winds tool with the new

  10. Performance evaluation of Warshall algorithm and dynamic programming for Markov chain in local sequence alignment.

    PubMed

    Khan, Mohammad Ibrahim; Kamal, Md Sarwar

    2015-03-01

    Markov Chain is very effective in prediction basically in long data set. In DNA sequencing it is always very important to find the existence of certain nucleotides based on the previous history of the data set. We imposed the Chapman Kolmogorov equation to accomplish the task of Markov Chain. Chapman Kolmogorov equation is the key to help the address the proper places of the DNA chain and this is very powerful tools in mathematics as well as in any other prediction based research. It incorporates the score of DNA sequences calculated by various techniques. Our research utilize the fundamentals of Warshall Algorithm (WA) and Dynamic Programming (DP) to measures the score of DNA segments. The outcomes of the experiment are that Warshall Algorithm is good for small DNA sequences on the other hand Dynamic Programming are good for long DNA sequences. On the top of above findings, it is very important to measure the risk factors of local sequencing during the matching of local sequence alignments whatever the length.

  11. A graph-based evolutionary algorithm: Genetic Network Programming (GNP) and its extension using reinforcement learning.

    PubMed

    Mabu, Shingo; Hirasawa, Kotaro; Hu, Jinglu

    2007-01-01

    This paper proposes a graph-based evolutionary algorithm called Genetic Network Programming (GNP). Our goal is to develop GNP, which can deal with dynamic environments efficiently and effectively, based on the distinguished expression ability of the graph (network) structure. The characteristics of GNP are as follows. 1) GNP programs are composed of a number of nodes which execute simple judgment/processing, and these nodes are connected by directed links to each other. 2) The graph structure enables GNP to re-use nodes, thus the structure can be very compact. 3) The node transition of GNP is executed according to its node connections without any terminal nodes, thus the past history of the node transition affects the current node to be used and this characteristic works as an implicit memory function. These structural characteristics are useful for dealing with dynamic environments. Furthermore, we propose an extended algorithm, "GNP with Reinforcement Learning (GNPRL)" which combines evolution and reinforcement learning in order to create effective graph structures and obtain better results in dynamic environments. In this paper, we applied GNP to the problem of determining agents' behavior to evaluate its effectiveness. Tileworld was used as the simulation environment. The results show some advantages for GNP over conventional methods.

  12. Limit cycles near hyperbolas in quadratic systems

    NASA Astrophysics Data System (ADS)

    Artés, Joan C.; Dumortier, Freddy; Llibre, Jaume

    In this paper we introduce the notion of infinity strip and strip of hyperbolas as organizing centers of limit cycles in polynomial differential systems on the plane. We study a strip of hyperbolas occurring in some quadratic systems. We deal with the cyclicity of the degenerate graphics DI2a from the programme, set up in [F. Dumortier, R. Roussarie, C. Rousseau, Hilbert's 16th problem for quadratic vector fields, J. Differential Equations 110 (1994) 86-133], to solve the finiteness part of Hilbert's 16th problem for quadratic systems. Techniques from geometric singular perturbation theory are combined with the use of the Bautin ideal. We also rely on the theory of Darboux integrability.

  13. Algorithms and theory for the design and programming of industrial control systems materialized with PLC's

    NASA Astrophysics Data System (ADS)

    Montoya Villena, Rafael

    According to its title, the general objective of the Thesis consists in developing a clear, simple and systematic methodology for programming type PLC devices. With this aim in mind, we will use the following elements: Codification of all variables types. This section is very important since it allows us working with little information. The necessary rules are given to codify all type of phrases produced in industrial processes. An algorithm that describes process evolution and that has been called process D.F. This is one of the most important contributions, since it will allow us, together with information codification, representing the process evolution in a graphic way and with any design theory used. Theory selection. Evidently, the use of some kind of design method is necessary to obtain logic equations. For this particular case, we will use binodal theory, an ideal theory for wired technologies, since it can obtain highly reduced schemas for relatively simple automatisms, which means a minimum number of components used. User program outline algorithm (D.F.P.). This is another necessary contribution and perhaps the most important one, since logic equations resulting from binodal theory are compatible with process evolution if wired technology is used, whether it is electric, electronic, pneumatic, etc. On the other hand, PLC devices performance characteristics force the program instructions order to validate or not the automatism, as we have proven in different articles and lectures at congresses both national and international. Therefore, we will codify any information concerning the automating process, graphically represent its temporal evolution and, applying binodal theory and D.F.P (previously adapted), succeed in making logic equations compatible with the process to be automated and the device in which they will be implemented (PLC in our case)

  14. A Branch and Bound Based Heuristic for Solving the Quadratic Assignment Problem,

    DTIC Science & Technology

    1981-10-01

    the Quadratic Assignment Problem M. S. Bazaraa and 0. Kirca FDRC-81-13 V Contract N~o. N00014-8O-k-0709 A Branch and Bound Based Heuristic for...Solving the Quadratic Assignment Problem M. S. Bazaraa and 0. Kirca Abstract I\\ .... In this paper a branch and bound algorithm is proposed for solving the...concept of branch and bound or im- plicit enumeration, as in the works of Gilmore (1962), Lawler (1963), Craves and Whinston (1970), Bazaraa and Elshafei

  15. Quintessence with quadratic coupling to dark matter

    SciTech Connect

    Boehmer, Christian G.; Chan, Nyein; Caldera-Cabral, Gabriela; Lazkoz, Ruth; Maartens, Roy

    2010-04-15

    We introduce a new form of coupling between dark energy and dark matter that is quadratic in their energy densities. Then we investigate the background dynamics when dark energy is in the form of exponential quintessence. The three types of quadratic coupling all admit late-time accelerating critical points, but these are not scaling solutions. We also show that two types of coupling allow for a suitable matter era at early times and acceleration at late times, while the third type of coupling does not admit a suitable matter era.

  16. Guises and disguises of quadratic divergences

    SciTech Connect

    Cherchiglia, A.L.; Vieira, A.R.; Hiller, Brigitte; Baêta Scarpelli, A.P.; Sampaio, Marcos

    2014-12-15

    In this contribution, we present a new perspective on the control of quadratic divergences in quantum field theory, in general, and in the Higgs naturalness problem, in particular. Our discussion is essentially based on an approach where UV divergences are parameterized, after being reduced to basic divergent integrals (BDI) in one internal momentum, as functions of a cutoff and a renormalization group scale λ. We illustrate our proposal with well-known examples, such as the gluon vacuum self energy of QCD and the Higgs decay in two photons within this approach. We also discuss frameworks in effective low-energy QCD models, where quadratic divergences are indeed fundamental.

  17. Guises and disguises of quadratic divergences

    NASA Astrophysics Data System (ADS)

    Cherchiglia, A. L.; Vieira, A. R.; Hiller, Brigitte; Baêta Scarpelli, A. P.; Sampaio, Marcos

    2014-12-01

    In this contribution, we present a new perspective on the control of quadratic divergences in quantum field theory, in general, and in the Higgs naturalness problem, in particular. Our discussion is essentially based on an approach where UV divergences are parameterized, after being reduced to basic divergent integrals (BDI) in one internal momentum, as functions of a cutoff and a renormalization group scale λ. We illustrate our proposal with well-known examples, such as the gluon vacuum self energy of QCD and the Higgs decay in two photons within this approach. We also discuss frameworks in effective low-energy QCD models, where quadratic divergences are indeed fundamental.

  18. On orthogonality preserving quadratic stochastic operators

    SciTech Connect

    Mukhamedov, Farrukh; Taha, Muhammad Hafizuddin Mohd

    2015-05-15

    A quadratic stochastic operator (in short QSO) is usually used to present the time evolution of differing species in biology. Some quadratic stochastic operators have been studied by Lotka and Volterra. In the present paper, we first give a simple characterization of Volterra QSO in terms of absolutely continuity of discrete measures. Further, we introduce a notion of orthogonal preserving QSO, and describe such kind of operators defined on two dimensional simplex. It turns out that orthogonal preserving QSOs are permutations of Volterra QSO. The associativity of genetic algebras generated by orthogonal preserving QSO is studied too.

  19. Linear state feedback, quadratic weights, and closed loop eigenstructures. M.S. Thesis. Final Report

    NASA Technical Reports Server (NTRS)

    Thompson, P. M.

    1980-01-01

    Equations are derived for the angles of general multivariable root loci and linear quadratic optimal root loci, including angles of departure and approach. The generalized eigenvalue problem is used to compute angles of approach. Equations are also derived to find the sensitivity of closed loop eigenvalue and the directional derivatives of closed loop eigenvectors. An equivalence class of quadratic weights that produce the same asymptotic eigenstructure is defined, a canonical element is defined, and an algorithm to find it is given. The behavior of the optimal root locus in the nonasymptotic region is shown to be different for quadratic weights with the same asymptotic properties. An algorithm is presented that can be used to select a feedback gain matrix for the linear state feedback problem which produces a specified asymptotic eigenstructure. Another algorithm is given to compute the asymptotic eigenstructure properties inherent in a given set of quadratic weights. Finally, it is shown that optimal root loci for nongeneric problems can be approximated by generic ones in the nonasymptotic region.

  20. A memory-efficient dynamic programming algorithm for optimal alignment of a sequence to an RNA secondary structure

    PubMed Central

    2002-01-01

    Background Covariance models (CMs) are probabilistic models of RNA secondary structure, analogous to profile hidden Markov models of linear sequence. The dynamic programming algorithm for aligning a CM to an RNA sequence of length N is O(N3) in memory. This is only practical for small RNAs. Results I describe a divide and conquer variant of the alignment algorithm that is analogous to memory-efficient Myers/Miller dynamic programming algorithms for linear sequence alignment. The new algorithm has an O(N2 log N) memory complexity, at the expense of a small constant factor in time. Conclusions Optimal ribosomal RNA structural alignments that previously required up to 150 GB of memory now require less than 270 MB. PMID:12095421

  1. A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization

    SciTech Connect

    Mehrotra, Sanjay; Papp, Dávid

    2014-01-01

    We present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as nonpolynomial moments, can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum and stochastic programming at the other. Although our primary motivation is to solve distributionally robust optimization problems with moment uncertainty, the cutting surface method for general semi-infinite convex programs is also of independent interest. The proposed method is applicable to problems with nondifferentiable semi-infinite constraints indexed by an infinite dimensional index set. Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of our algorithm even in the solution of traditional semi-infinite convex programming problems, whose constraints are differentiable, and are indexed by an index set of low dimension. After the rate of convergence analysis of the cutting surface algorithm, we extend the authors' moment matching scenario generation algorithm to a probabilistic algorithm that finds optimal probability distributions subject to moment constraints. The combination of this distribution optimization method and the central cutting surface algorithm yields a solution to a family of distributionally robust optimization problems that are considerably more general than the ones proposed to date.

  2. A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization

    DOE PAGES

    Mehrotra, Sanjay; Papp, Dávid

    2014-01-01

    We present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as nonpolynomial moments, can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum and stochastic programming at the other. Although our primary motivation is to solve distributionally robustmore » optimization problems with moment uncertainty, the cutting surface method for general semi-infinite convex programs is also of independent interest. The proposed method is applicable to problems with nondifferentiable semi-infinite constraints indexed by an infinite dimensional index set. Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of our algorithm even in the solution of traditional semi-infinite convex programming problems, whose constraints are differentiable, and are indexed by an index set of low dimension. After the rate of convergence analysis of the cutting surface algorithm, we extend the authors' moment matching scenario generation algorithm to a probabilistic algorithm that finds optimal probability distributions subject to moment constraints. The combination of this distribution optimization method and the central cutting surface algorithm yields a solution to a family of distributionally robust optimization problems that are considerably more general than the ones proposed to date.« less

  3. Efficient dynamic programming algorithm with prior knowledge for protein β-strand alignment.

    PubMed

    Sabzekar, Mostafa; Naghibzadeh, Mahmoud; Sadri, Javad

    2017-03-21

    One of the main tasks towards the prediction of protein β-sheet structure is to predict the native alignment of β-strands. The alignment of two β-strands defines similar regions that may reflect functional, structural, or evolutionary relationships between them. Therefore, any improvement in β-strands alignment not only reduces the computational search space but also improves β-sheet structure prediction accuracy. To define the alignment scores, previous studies utilized predicted residue-residue contacts (contact maps). However, there are two serious problems using them. First, the precision of contact map prediction techniques, especially for long-range contacts (i.e., β-residues), is still not satisfactory. Second, the residue-residue contact predictors usually utilize general properties of amino acids and disregard the structural features of β-residues. In this paper, we consider β-structure information, which is estimated from protein β-sheet data sets, as alignment scores. However, the predicted contact maps are used as a prior knowledge about residues. They are used for strengthening or weakening the alignment scores in our algorithm. Thus, we can utilize both β-residues and β-structure information in alignment of β-strands. The structure of dynamic programming of the alignment algorithm is changed in order to work with our prior knowledge. Moreover, the Four Russians method is applied to the proposed alignment algorithm in order to reduce the time complexity of the problem. For evaluating the proposed method, we applied it to the state-of-the-art β-sheet structure prediction methods. The experimental results on the BetaSheet916 data set showed significant improvements in the execution time, the accuracy of β-strands' alignment and consequently β-sheet structure prediction accuracy. The results are available at http://conceptsgate.com/BetaSheet.

  4. Efficient linear programming algorithm to generate the densest lattice sphere packings.

    PubMed

    Marcotte, Étienne; Torquato, Salvatore

    2013-06-01

    Finding the densest sphere packing in d-dimensional Euclidean space R(d) is an outstanding fundamental problem with relevance in many fields, including the ground states of molecular systems, colloidal crystal structures, coding theory, discrete geometry, number theory, and biological systems. Numerically generating the densest sphere packings becomes very challenging in high dimensions due to an exponentially increasing number of possible sphere contacts and sphere configurations, even for the restricted problem of finding the densest lattice sphere packings. In this paper we apply the Torquato-Jiao packing algorithm, which is a method based on solving a sequence of linear programs, to robustly reproduce the densest known lattice sphere packings for dimensions 2 through 19. We show that the TJ algorithm is appreciably more efficient at solving these problems than previously published methods. Indeed, in some dimensions, the former procedure can be as much as three orders of magnitude faster at finding the optimal solutions than earlier ones. We also study the suboptimal local density-maxima solutions (inherent structures or "extreme" lattices) to gain insight about the nature of the topography of the "density" landscape.

  5. The psychopharmacology algorithm project at the Harvard South Shore Program: an update on schizophrenia.

    PubMed

    Osser, David N; Roudsari, Mohsen Jalali; Manschreck, Theo

    2013-01-01

    This article is an update of the algorithm for schizophrenia from the Psychopharmacology Algorithm Project at the Harvard South Shore Program. A literature review was conducted focusing on new data since the last published version (1999-2001). The first-line treatment recommendation for new-onset schizophrenia is with amisulpride, aripiprazole, risperidone, or ziprasidone for four to six weeks. In some settings the trial could be shorter, considering that evidence of clear improvement with antipsychotics usually occurs within the first two weeks. If the trial of the first antipsychotic cannot be completed due to intolerance, try another until one of the four is tolerated and given an adequate trial. There should be evidence of bioavailability. If the response to this adequate trial is unsatisfactory, try a second monotherapy. If the response to this second adequate trial is also unsatisfactory, and if at least one of the first two trials was with risperidone, olanzapine, or a first-generation (typical) antipsychotic, then clozapine is recommended for the third trial. If neither trial was with any these three options, a third trial prior to clozapine should occur, using one of those three. If the response to monotherapy with clozapine (with dose adjusted by using plasma levels) is unsatisfactory, consider adding risperidone, lamotrigine, or ECT. Beyond that point, there is little solid evidence to support further psychopharmacological treatment choices, though we do review possible options.

  6. Branching process deconvolution algorithm reveals a detailed cell-cycle transcription program.

    PubMed

    Guo, Xin; Bernard, Allister; Orlando, David A; Haase, Steven B; Hartemink, Alexander J

    2013-03-05

    Due to cell-to-cell variability and asymmetric cell division, cells in a synchronized population lose synchrony over time. As a result, time-series measurements from synchronized cell populations do not reflect the underlying dynamics of cell-cycle processes. Here, we present a branching process deconvolution algorithm that learns a more accurate view of dynamic cell-cycle processes, free from the convolution effects associated with imperfect cell synchronization. Through wavelet-basis regularization, our method sharpens signal without sharpening noise and can remarkably increase both the dynamic range and the temporal resolution of time-series data. Although applicable to any such data, we demonstrate the utility of our method by applying it to a recent cell-cycle transcription time course in the eukaryote Saccharomyces cerevisiae. Our method more sensitively detects cell-cycle-regulated transcription and reveals subtle timing differences that are masked in the original population measurements. Our algorithm also explicitly learns distinct transcription programs for mother and daughter cells, enabling us to identify 82 genes transcribed almost entirely in early G1 in a daughter-specific manner.

  7. Frequent word section extraction in a presentation speech by an effective dynamic programming algorithm

    NASA Astrophysics Data System (ADS)

    Itoh, Yoshiaki; Tanaka, Kazuyo

    2004-08-01

    Word frequency in a document has often been utilized in text searching and summarization. Similarly, identifying frequent words or phrases in a speech data set for searching and summarization would also be meaningful. However, obtaining word frequency in a speech data set is difficult, because frequent words are often special terms in the speech and cannot be recognized by a general speech recognizer. This paper proposes another approach that is effective for automatic extraction of such frequent word sections in a speech data set. The proposed method is applicable to any domain of monologue speech, because no language models or specific terms are required in advance. The extracted sections can be regarded as speech labels of some kind or a digest of the speech presentation. The frequent word sections are determined by detecting similar sections, which are sections of audio data that represent the same word or phrase. The similar sections are detected by an efficient algorithm, called Shift Continuous Dynamic Programming (Shift CDP), which realizes fast matching between arbitrary sections in the reference speech pattern and those in the input speech, and enables frame-synchronous extraction of similar sections. In experiments, the algorithm is applied to extract the repeated sections in oral presentation speeches recorded in academic conferences in Japan. The results show that Shift CDP successfully detects similar sections and identifies the frequent word sections in individual presentation speeches, without prior domain knowledge, such as language models and terms.

  8. A Full-Newton Step Infeasible Interior-Point Algorithm for Linear Programming Based on a Kernel Function

    SciTech Connect

    Liu Zhongyi Sun, Wenyu Tian Fangbao

    2009-10-15

    This paper proposes an infeasible interior-point algorithm with full-Newton step for linear programming, which is an extension of the work of Roos (SIAM J. Optim. 16(4):1110-1136, 2006). The main iteration of the algorithm consists of a feasibility step and several centrality steps. We introduce a kernel function in the algorithm to induce the feasibility step. For parameter p element of [0,1], the polynomial complexity can be proved and the result coincides with the best result for infeasible interior-point methods, that is, O(nlog n/{epsilon})

  9. Advances in methods and algorithms in a modern quantum chemistry program package.

    PubMed

    Shao, Yihan; Molnar, Laszlo Fusti; Jung, Yousung; Kussmann, Jörg; Ochsenfeld, Christian; Brown, Shawn T; Gilbert, Andrew T B; Slipchenko, Lyudmila V; Levchenko, Sergey V; O'Neill, Darragh P; DiStasio, Robert A; Lochan, Rohini C; Wang, Tao; Beran, Gregory J O; Besley, Nicholas A; Herbert, John M; Lin, Ching Yeh; Van Voorhis, Troy; Chien, Siu Hung; Sodt, Alex; Steele, Ryan P; Rassolov, Vitaly A; Maslen, Paul E; Korambath, Prakashan P; Adamson, Ross D; Austin, Brian; Baker, Jon; Byrd, Edward F C; Dachsel, Holger; Doerksen, Robert J; Dreuw, Andreas; Dunietz, Barry D; Dutoi, Anthony D; Furlani, Thomas R; Gwaltney, Steven R; Heyden, Andreas; Hirata, So; Hsu, Chao-Ping; Kedziora, Gary; Khalliulin, Rustam Z; Klunzinger, Phil; Lee, Aaron M; Lee, Michael S; Liang, Wanzhen; Lotan, Itay; Nair, Nikhil; Peters, Baron; Proynov, Emil I; Pieniazek, Piotr A; Rhee, Young Min; Ritchie, Jim; Rosta, Edina; Sherrill, C David; Simmonett, Andrew C; Subotnik, Joseph E; Woodcock, H Lee; Zhang, Weimin; Bell, Alexis T; Chakraborty, Arup K; Chipman, Daniel M; Keil, Frerich J; Warshel, Arieh; Hehre, Warren J; Schaefer, Henry F; Kong, Jing; Krylov, Anna I; Gill, Peter M W; Head-Gordon, Martin

    2006-07-21

    Advances in theory and algorithms for electronic structure calculations must be incorporated into program packages to enable them to become routinely used by the broader chemical community. This work reviews advances made over the past five years or so that constitute the major improvements contained in a new release of the Q-Chem quantum chemistry package, together with illustrative timings and applications. Specific developments discussed include fast methods for density functional theory calculations, linear scaling evaluation of energies, NMR chemical shifts and electric properties, fast auxiliary basis function methods for correlated energies and gradients, equation-of-motion coupled cluster methods for ground and excited states, geminal wavefunctions, embedding methods and techniques for exploring potential energy surfaces.

  10. Investigating Students' Mathematical Difficulties with Quadratic Equations

    ERIC Educational Resources Information Center

    O'Connor, Bronwyn Reid; Norton, Stephen

    2016-01-01

    This paper examines the factors that hinder students' success in working with and understanding the mathematics of quadratic equations using a case study analysis of student error patterns. Twenty-five Year 11 students were administered a written test to examine their understanding of concepts and procedures associated with this topic. The…

  11. Target manifold formation using a quadratic SDF

    NASA Astrophysics Data System (ADS)

    Hester, Charles F.; Risko, Kelly K. D.

    2013-05-01

    Synthetic Discriminant Function (SDF) formulation of correlation filters provides constraints for forming target subspaces for a target set. In this paper we extend the SDF formulation to include quadratic constraints and use this solution to form nonlinear manifolds in the target space. The theory for forming these manifolds will be developed and demonstrated with data.

  12. Curious Consequences of a Miscopied Quadratic

    ERIC Educational Resources Information Center

    Poet, Jeffrey L.; Vestal, Donald L., Jr.

    2005-01-01

    The starting point of this article is a search for pairs of quadratic polynomials x[superscript 2] + bx plus or minus c with the property that they both factor over the integers. The search leads quickly to some number theory in the form of primitive Pythagorean triples, and this paper develops the connection between these two topics.

  13. New approaches to linear and nonlinear programming

    SciTech Connect

    Murray, W.; Saunders, M.A.

    1990-03-01

    During the last twelve months, research has concentrated on barrier- function methods for linear programming (LP) and quadratic programming (QP). Some ground-work for the application of barrier methods to nonlinearly constrained problems has also begun. In our previous progress report we drew attention to the difficulty of developing robust implementations of barrier methods for LP. We have continued to refine both the primal algorithm and the dual algorithm. We still do not claim that the barrier algorithms are as robust as the simplex method; however, the dual algorithm has solved all the problems in our extensive test set. We have also gained some experience with using the algorithms to solve aircrew scheduling problems.

  14. Geometric Approaches to Quadratic Equations from Other Times and Places.

    ERIC Educational Resources Information Center

    Allaire, Patricia R.; Bradley, Robert E.

    2001-01-01

    Focuses on geometric solutions of quadratic problems. Presents a collection of geometric techniques from ancient Babylonia, classical Greece, medieval Arabia, and early modern Europe to enhance the quadratic equation portion of an algebra course. (KHR)

  15. Use of quadratic components for buckling calculations

    SciTech Connect

    Dohrmann, C.R.; Segalman, D.J.

    1996-12-31

    A buckling calculation procedure based on the method of quadratic components is presented. Recently developed for simulating the motion of rotating flexible structures, the method of quadratic components is shown to be applicable to buckling problems with either conservative or nonconservative loads. For conservative loads, stability follows from the positive definiteness of the system`s stiffness matrix. For nonconservative loads, stability is determined by solving a nonsymmetric eigenvalue problem, which depends on both the stiffness and mass distribution of the system. Buckling calculations presented for a cantilevered beam are shown to compare favorably with classical results. Although the example problem is fairly simple and well-understood, the procedure can be used in conjunction with a general-purpose finite element code for buckling calculations of more complex systems.

  16. Bifurcations in biparametric quadratic potentials. II.

    PubMed

    Lanchares, V.; Elipe, A.

    1995-09-01

    Quadratic Hamiltonians with the phase space on the S (2) sphere represent numerous dynamical systems. There are only two classes of quadratic Hamiltonians depending on two parameters. We analyze the occurrence of bifurcations and we obtain the bifurcation lines in the parameter plane for one of these classes, thus complementing the work done in a previous paper where the other class was analyzed. As the parameters evolve, the appearance-disappearance of homoclinic orbits in the phase portrait is governed by four types of bifurcations: namely the pitchfork, the butterfly, the oyster and the pentadent bifurcations. We find also values where the system is degenerate, that is, there are nonisolated equilibria. (c) 1995 American Institute of Physics.

  17. An Implementation of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm in the C Programming Language

    SciTech Connect

    CAMPBELL, PHILIP L.

    1999-08-01

    This report presents an implementation of the Berlekamp-Massey linear feedback shift-register (LFSR) synthesis algorithm in the C programming language. Two pseudo-code versions of the code are given, the operation of LFSRs is explained, C-version of the pseudo-code versions is presented, and the output of the code, when run on two input samples, is shown.

  18. Graphical Solution of the Monic Quadratic Equation with Complex Coefficients

    ERIC Educational Resources Information Center

    Laine, A. D.

    2015-01-01

    There are many geometrical approaches to the solution of the quadratic equation with real coefficients. In this article it is shown that the monic quadratic equation with complex coefficients can also be solved graphically, by the intersection of two hyperbolas; one hyperbola being derived from the real part of the quadratic equation and one from…

  19. THE EFFECTIVENESS OF QUADRATS FOR MEASURING VASCULAR PLANT DIVERSITY

    EPA Science Inventory

    Quadrats are widely used for measuring characteristics of vascular plant communities. It is well recognized that quadrat size affects measurements of frequency and cover. The ability of quadrats of varying sizes to adequately measure diversity has not been established. An exha...

  20. Communications circuit including a linear quadratic estimator

    DOEpatents

    Ferguson, Dennis D.

    2015-07-07

    A circuit includes a linear quadratic estimator (LQE) configured to receive a plurality of measurements a signal. The LQE is configured to weight the measurements based on their respective uncertainties to produce weighted averages. The circuit further includes a controller coupled to the LQE and configured to selectively adjust at least one data link parameter associated with a communication channel in response to receiving the weighted averages.

  1. Characterization of a Quadratic Function in Rn

    ERIC Educational Resources Information Center

    Xu, Conway

    2010-01-01

    It is proved that a scalar-valued function "f"(x) defined in "n"-dimensional space must be quadratic, if the intersection of tangent planes at x[subscript 1] and x[subscript 2] always contains the midpoint of the line joining x[subscript 1] and x[subscript 2]. This is the converse of a result of Stenlund proved in this JOURNAL in 2001.

  2. Monotone and convex quadratic spline interpolation

    NASA Technical Reports Server (NTRS)

    Lam, Maria H.

    1990-01-01

    A method for producing interpolants that preserve the monotonicity and convexity of discrete data is described. It utilizes the quadratic spline proposed by Schumaker (1983) which was subsequently characterized by De Vore and Yan (1986). The selection of first order derivatives at the given data points is essential to this spline. An observation made by De Vore and Yan is generalized, and an improved method to select these derivatives is proposed. The resulting spline is completely local, efficient, and simple to implement.

  3. Stochastic Linear Quadratic Optimal Control Problems

    SciTech Connect

    Chen, S.; Yong, J.

    2001-07-01

    This paper is concerned with the stochastic linear quadratic optimal control problem (LQ problem, for short) for which the coefficients are allowed to be random and the cost functional is allowed to have a negative weight on the square of the control variable. Some intrinsic relations among the LQ problem, the stochastic maximum principle, and the (linear) forward-backward stochastic differential equations are established. Some results involving Riccati equation are discussed as well.

  4. Quadratic optimization in ill-posed problems

    NASA Astrophysics Data System (ADS)

    Ben Belgacem, F.; Kaber, S.-M.

    2008-10-01

    Ill-posed quadratic optimization frequently occurs in control and inverse problems and is not covered by the Lax-Milgram-Riesz theory. Typically, small changes in the input data can produce very large oscillations on the output. We investigate the conditions under which the minimum value of the cost function is finite and we explore the 'hidden connection' between the optimization problem and the least-squares method. Eventually, we address some examples coming from optimal control and data completion, showing how relevant our contribution is in the knowledge of what happens for various ill-posed problems. The results we state bring a substantial improvement to the analysis of the regularization methods applied to the ill-posed quadratic optimization problems. Indeed, for the cost quadratic functions bounded from below the Lavrentiev method is just the Tikhonov regularization for the 'hidden least-squares' problem. As a straightforward result, Lavrentiev's regularization exhibits better regularization and convergence results than expected at first glance.

  5. The Equivalence of Dantzig’s Self-Dual Parametric Algorithm for Linear Programs to Lemke’s Algorithm for Linear Complementarity Problems Applied to Linear Programs.

    DTIC Science & Technology

    1987-05-01

    Laboratory •U The Equivmluce of Dentig’$ Self-Dual Parametric Algorithm for Linemr Progame to Lems Ngorithm fur Lse Cemllusemtawt Problems Appled to Umer...agement Science 11, pp. 681-689. Lemke, C.E. (1970). "Recent results on complementarity problems," in Nonlinear pro- gramming (J.B. Rosen, O.L

  6. Final Report for Award #DE-SC3956 Separating Algorithm and Implementation via programming Model Injection (SAIMI)

    SciTech Connect

    Strout, Michelle

    2015-08-15

    Programming parallel machines is fraught with difficulties: the obfuscation of algorithms due to implementation details such as communication and synchronization, the need for transparency between language constructs and performance, the difficulty of performing program analysis to enable automatic parallelization techniques, and the existence of important "dusty deck" codes. The SAIMI project developed abstractions that enable the orthogonal specification of algorithms and implementation details within the context of existing DOE applications. The main idea is to enable the injection of small programming models such as expressions involving transcendental functions, polyhedral iteration spaces with sparse constraints, and task graphs into full programs through the use of pragmas. These smaller, more restricted programming models enable orthogonal specification of many implementation details such as how to map the computation on to parallel processors, how to schedule the computation, and how to allocation storage for the computation. At the same time, these small programming models enable the expression of the most computationally intense and communication heavy portions in many scientific simulations. The ability to orthogonally manipulate the implementation for such computations will significantly ease performance programming efforts and expose transformation possibilities and parameter to automated approaches such as autotuning. At Colorado State University, the SAIMI project was supported through DOE grant DE-SC3956 from April 2010 through August 2015. The SAIMI project has contributed a number of important results to programming abstractions that enable the orthogonal specification of implementation details in scientific codes. This final report summarizes the research that was funded by the SAIMI project.

  7. F100 Multivariable Control Synthesis Program. Computer Implementation of the F100 Multivariable Control Algorithm

    NASA Technical Reports Server (NTRS)

    Soeder, J. F.

    1983-01-01

    As turbofan engines become more complex, the development of controls necessitate the use of multivariable control techniques. A control developed for the F100-PW-100(3) turbofan engine by using linear quadratic regulator theory and other modern multivariable control synthesis techniques is described. The assembly language implementation of this control on an SEL 810B minicomputer is described. This implementation was then evaluated by using a real-time hybrid simulation of the engine. The control software was modified to run with a real engine. These modifications, in the form of sensor and actuator failure checks and control executive sequencing, are discussed. Finally recommendations for control software implementations are presented.

  8. The updated algorithm of the Energy Consumption Program (ECP): A computer model simulating heating and cooling energy loads in buildings

    NASA Technical Reports Server (NTRS)

    Lansing, F. L.; Strain, D. M.; Chai, V. W.; Higgins, S.

    1979-01-01

    The energy Comsumption Computer Program was developed to simulate building heating and cooling loads and compute thermal and electric energy consumption and cost. This article reports on the new additional algorithms and modifications made in an effort to widen the areas of application. The program structure was rewritten accordingly to refine and advance the building model and to further reduce the processing time and cost. The program is noted for its very low cost and ease of use compared to other available codes. The accuracy of computations is not sacrificed however, since the results are expected to lie within + or - 10% of actual energy meter readings.

  9. Insulin algorithms in the self-management of insulin-dependent diabetes: the interactive 'Apple Juice' program.

    PubMed

    Williams, A G

    1996-01-01

    The 'Apple Juice' program is an interactive diabetes self-management program which runs on a lap-top Macintosh Powerbook 100 computer. The dose-by-dose insulin advisory program was initially designed for children with insulin-dependent (type 1) diabetes mellitus. It utilizes several different insulin algorithms, measurement formulae, and compensation factors for meals, activity, medication and the dawn phenomenon. It was developed to assist the individual with diabetes and/or care providers, in determining specific insulin dosage recommendations throughout a 24 h period. Information technology functions include, but are not limited to automated record keeping, data recall, event reminders, data trend/pattern analyses and education. This paper highlights issues, observations and recommendations surrounding the use of the current version of the software, along with a detailed description of the insulin algorithms and measurement formulae applied successfully with the author's daughter over a six year period.

  10. Policy iteration adaptive dynamic programming algorithm for discrete-time nonlinear systems.

    PubMed

    Liu, Derong; Wei, Qinglai

    2014-03-01

    This paper is concerned with a new discrete-time policy iteration adaptive dynamic programming (ADP) method for solving the infinite horizon optimal control problem of nonlinear systems. The idea is to use an iterative ADP technique to obtain the iterative control law, which optimizes the iterative performance index function. The main contribution of this paper is to analyze the convergence and stability properties of policy iteration method for discrete-time nonlinear systems for the first time. It shows that the iterative performance index function is nonincreasingly convergent to the optimal solution of the Hamilton-Jacobi-Bellman equation. It is also proven that any of the iterative control laws can stabilize the nonlinear systems. Neural networks are used to approximate the performance index function and compute the optimal control law, respectively, for facilitating the implementation of the iterative ADP algorithm, where the convergence of the weight matrices is analyzed. Finally, the numerical results and analysis are presented to illustrate the performance of the developed method.

  11. Method of expanding hyperspheres - an interior algorithm for linear programming problems

    SciTech Connect

    Chandrupatla, T.

    1994-12-31

    A new interior algorithm using some properties of hyperspheres is proposed for the solution of linear programming problems with inequality constraints: maximize c{sup T} x subject to Ax {<=} b where c and rows of A are normalized in the Euclidean sense such that {parallel} c {parallel} = {radical}c{sup T}c = 1 {parallel} a{sub i} {parallel} {radical} A{sub i}A{sub i}{sup T} = 1 for i = 1 to m. The feasible region in the polytope bounded by the constraint planes. We start from an interior point. We pass a plane normal to c until it touches a constraint plane. Then the sphere is expanded so that it keeps contact with the previously touched planes and the expansion proceeds till it touches another plane. The procedure is continued till the sphere touches the c-plane and n constraint planes. We move to the center of the sphere and repeat the process. The interior maximum is reached when the radius of the expanded sphere is less than a critical value say {epsilon}. Problems of direction finding, determination of incoming constraint, sphere jamming, and evaluation of the initial feasible point are discussed.

  12. Optimal Path Planning Program for Autonomous Speed Sprayer in Orchard Using Order-Picking Algorithm

    NASA Astrophysics Data System (ADS)

    Park, T. S.; Park, S. J.; Hwang, K. Y.; Cho, S. I.

    This study was conducted to develop a software program which computes optimal path for autonomous navigation in orchard, especially for speed sprayer. Possibilities of autonomous navigation in orchard were shown by other researches which have minimized distance error between planned path and performed path. But, research of planning an optimal path for speed sprayer in orchard is hardly founded. In this study, a digital map and a database for orchard which contains GPS coordinate information (coordinates of trees and boundary of orchard) and entity information (heights and widths of trees, radius of main stem of trees, disease of trees) was designed. An orderpicking algorithm which has been used for management of warehouse was used to calculate optimum path based on the digital map. Database for digital map was created by using Microsoft Access and graphic interface for database was made by using Microsoft Visual C++ 6.0. It was possible to search and display information about boundary of an orchard, locations of trees, daily plan for scattering chemicals and plan optimal path on different orchard based on digital map, on each circumstance (starting speed sprayer in different location, scattering chemicals for only selected trees).

  13. Optimization of Water Distribution and Water Quality by Genetic Algorithm and Nonlinear Programming

    NASA Astrophysics Data System (ADS)

    Tu, M.; Tsai, F. T.; Yeh, W. W.

    2001-12-01

    When managing a regional water distribution system, it is not only important to optimize water allocation but also to meet the desired water quality requirements. This paper develops a multicommodity flow model that can be used to optimize water distribution and water quality in a regional water supply system. Waters from different sources with different quality are considered as distinct commodities, which concurrently share a single water distribution system. Volumetric water blend is used to represent water quality in the proposed model. The multicommodity model is capable of handling two-way flow pipes, as represented undirectional arcs, and the perfect mixing condition. Additionally, blending requirements are specified at certain control nodes within the water distribution system to ensure that downstream users receive the desired water quality. The developed multicommodity flow model is imbedded in a nonlinear optimization model. To reduce nonlinearity and to improve convergence, GA is combined with a gradient-based-algorithm to solve the nonlinearly constrained optimization model in that GA is used to search for the optimal direction for all undirectional arcs in the system and iteratively linked with a nonlinear programming solver. The proposed methodology was first tested and verified on a simplified hypothetical system and then applied to the regional water distribution system of the Metropolitan Water District of Southern California. The results obtained indicate that the optimization model can efficiently allocate waters from different sources with different quality to satisfy the blending requirements, the perfect mixing and two-way flow conditions.

  14. Fuzzy bilevel programming with multiple non-cooperative followers: model, algorithm and application

    NASA Astrophysics Data System (ADS)

    Ke, Hua; Huang, Hu; Ralescu, Dan A.; Wang, Lei

    2016-04-01

    In centralized decision problems, it is not complicated for decision-makers to make modelling technique selections under uncertainty. When a decentralized decision problem is considered, however, choosing appropriate models is no longer easy due to the difficulty in estimating the other decision-makers' inconclusive decision criteria. These decision criteria may vary with different decision-makers because of their special risk tolerances and management requirements. Considering the general differences among the decision-makers in decentralized systems, we propose a general framework of fuzzy bilevel programming including hybrid models (integrated with different modelling methods in different levels). Specially, we discuss two of these models which may have wide applications in many fields. Furthermore, we apply the proposed two models to formulate a pricing decision problem in a decentralized supply chain with fuzzy coefficients. In order to solve these models, a hybrid intelligent algorithm integrating fuzzy simulation, neural network and particle swarm optimization based on penalty function approach is designed. Some suggestions on the applications of these models are also presented.

  15. Finite element simulation of articular contact mechanics with quadratic tetrahedral elements.

    PubMed

    Maas, Steve A; Ellis, Benjamin J; Rawlins, David S; Weiss, Jeffrey A

    2016-03-21

    Although it is easier to generate finite element discretizations with tetrahedral elements, trilinear hexahedral (HEX8) elements are more often used in simulations of articular contact mechanics. This is due to numerical shortcomings of linear tetrahedral (TET4) elements, limited availability of quadratic tetrahedron elements in combination with effective contact algorithms, and the perceived increased computational expense of quadratic finite elements. In this study we implemented both ten-node (TET10) and fifteen-node (TET15) quadratic tetrahedral elements in FEBio (www.febio.org) and compared their accuracy, robustness in terms of convergence behavior and computational cost for simulations relevant to articular contact mechanics. Suitable volume integration and surface integration rules were determined by comparing the results of several benchmark contact problems. The results demonstrated that the surface integration rule used to evaluate the contact integrals for quadratic elements affected both convergence behavior and accuracy of predicted stresses. The computational expense and robustness of both quadratic tetrahedral formulations compared favorably to the HEX8 models. Of note, the TET15 element demonstrated superior convergence behavior and lower computational cost than both the TET10 and HEX8 elements for meshes with similar numbers of degrees of freedom in the contact problems that we examined. Finally, the excellent accuracy and relative efficiency of these quadratic tetrahedral elements was illustrated by comparing their predictions with those for a HEX8 mesh for simulation of articular contact in a fully validated model of the hip. These results demonstrate that TET10 and TET15 elements provide viable alternatives to HEX8 elements for simulation of articular contact mechanics.

  16. Numerical Roll Reversal Predictor Corrector Aerocapture and Precision Landing Guidance Algorithms for the Mars Surveyor Program 2001 Missions

    NASA Technical Reports Server (NTRS)

    Powell, Richard W.

    1998-01-01

    This paper describes the development and evaluation of a numerical roll reversal predictor-corrector guidance algorithm for the atmospheric flight portion of the Mars Surveyor Program 2001 Orbiter and Lander missions. The Lander mission utilizes direct entry and has a demanding requirement to deploy its parachute within 10 km of the target deployment point. The Orbiter mission utilizes aerocapture to achieve a precise captured orbit with a single atmospheric pass. Detailed descriptions of these predictor-corrector algorithms are given. Also, results of three and six degree-of-freedom Monte Carlo simulations which include navigation, aerodynamics, mass properties and atmospheric density uncertainties are presented.

  17. Application of Heisenberg's S matrix program to the angular scattering of the H + D2(v(i) = 0, j(i) = 0) → HD(v(f) = 3, j(f) = 0) + D reaction: piecewise S matrix elements using linear, quadratic, step-function, and top-hat parametrizations.

    PubMed

    Shan, Xiao; Connor, J N L

    2012-11-26

    A previous paper by Shan and Connor (Phys. Chem. Chem. Phys. 2011, 13, 8392) reported the surprising result that four simple parametrized S matrices can reproduce the forward-angle glory scattering of the H + D(2)(v(i)=0,j(i)=0) → HD(v(f)=3,j(f)=0) + D reaction, whose differential cross section (DCS) had been computed in a state-of-the-art scattering calculation for a state-of-the-art potential energy surface. Here, v and j are vibrational and rotational quantum numbers, respectively, and the translational energy is 1.81 eV. This paper asks the question: Can we replace the analytic functions (of class C(ω)) used by Shan-Connor with simpler mathematical functions and still reproduce the forward-angle glory scattering? We first construct S matrix elements (of class C(0)) using a quadratic phase and a piecewise-continuous pre-exponential factor consisting of three pieces. Two of the pieces are constants, with one taking the value N (a real normalization constant) at small values of the total angular momentum number, J; the other piece has the value 0 at large J. These two pieces are joined at intermediate values of J by either a straight line, giving rise to the linear parametrization (denoted param L), or a quadratic curve, which defines the quadratic parametrization (param Q). We find that both param L and param Q can reproduce the glory scattering for center-of-mass reactive scattering angles, θ(R) ≲ 30°. Second, we use a piecewise-discontinuous pre-exponential factor and a quadratic phase, giving rise to a step-function parametrization (param SF) and a top-hat parametrization (param TH). We find that both param SF and param TH can reproduce the forward-angle scattering, even though these class C(-1) parametrizations are usually considered too simplistic to be useful for calculations of DCSs. We find that an ultrasimplistic param THz, which is param TH with a phase of zero, can also reproduce the glory scattering at forward angles. The S matrix elements for

  18. Constrained neural approaches to quadratic assignment problems.

    PubMed

    Ishii, S; Sato, M

    1998-08-01

    In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches. Since only a few strong heuristics for QAP have been known to date, our approaches are good alternatives, capable of obtaining fairly good solutions in a short period of time. Some of them can also be applied to large-scale problems, say of size N>/=300.

  19. Quadratic finite elements and incompressible viscous flows.

    SciTech Connect

    Dohrmann, Clark R.; Gartling, David K.

    2005-01-01

    Pressure stabilization methods are applied to higher-order velocity finite elements for application to viscous incompressible flows. Both a standard pressure stabilizing Petrov-Galerkin (PSPG) method and a new polynomial pressure projection stabilization (PPPS) method have been implemented and tested for various quadratic elements in two dimensions. A preconditioner based on relaxing the incompressibility constraint is also tested for the iterative solution of saddle point problems arising from mixed Galerkin finite element approximations to the Navier-Stokes equations. The preconditioner is demonstrated for BB stable elements with discontinuous pressure approximations in two and three dimensions.

  20. A quadratic analog-to-digital converter

    NASA Technical Reports Server (NTRS)

    Harrison, D. C.; Staples, M. H.

    1980-01-01

    An analog-to-digital converter with a square root transfer function has been developed for use with a pair of CCD imaging detectors in the White Light Coronagraph/X-ray XUV Telescope experiment to be flown as part of the Internal Solar Polar Mission. It is shown that in background-noise-limited instrumentation systems a quadratic analog-to-digital converter will allow a maximum dynamic range with a fixed number of data bits. Low power dissipation, moderately fast conversion time, and reliability are achieved in the proposed design using standard components and avoiding nonlinear elements.

  1. Discrete-Time Nonzero-Sum Games for Multiplayer Using Policy-Iteration-Based Adaptive Dynamic Programming Algorithms.

    PubMed

    Zhang, Huaguang; Jiang, He; Luo, Chaomin; Xiao, Geyang

    2016-10-03

    In this paper, we investigate the nonzero-sum games for a class of discrete-time (DT) nonlinear systems by using a novel policy iteration (PI) adaptive dynamic programming (ADP) method. The main idea of our proposed PI scheme is to utilize the iterative ADP algorithm to obtain the iterative control policies, which not only ensure the system to achieve stability but also minimize the performance index function for each player. This paper integrates game theory, optimal control theory, and reinforcement learning technique to formulate and handle the DT nonzero-sum games for multiplayer. First, we design three actor-critic algorithms, an offline one and two online ones, for the PI scheme. Subsequently, neural networks are employed to implement these algorithms and the corresponding stability analysis is also provided via the Lyapunov theory. Finally, a numerical simulation example is presented to demonstrate the effectiveness of our proposed approach.

  2. A parallel algorithm for the eigenvalues and eigenvectors for a general complex matrix

    NASA Technical Reports Server (NTRS)

    Shroff, Gautam

    1989-01-01

    A new parallel Jacobi-like algorithm is developed for computing the eigenvalues of a general complex matrix. Most parallel methods for this parallel typically display only linear convergence. Sequential norm-reducing algorithms also exit and they display quadratic convergence in most cases. The new algorithm is a parallel form of the norm-reducing algorithm due to Eberlein. It is proven that the asymptotic convergence rate of this algorithm is quadratic. Numerical experiments are presented which demonstrate the quadratic convergence of the algorithm and certain situations where the convergence is slow are also identified. The algorithm promises to be very competitive on a variety of parallel architectures.

  3. BWM*: A Novel, Provable, Ensemble-based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design.

    PubMed

    Jou, Jonathan D; Jain, Swati; Georgiev, Ivelin S; Donald, Bruce R

    2016-06-01

    Sparse energy functions that ignore long range interactions between residue pairs are frequently used by protein design algorithms to reduce computational cost. Current dynamic programming algorithms that fully exploit the optimal substructure produced by these energy functions only compute the GMEC. This disproportionately favors the sequence of a single, static conformation and overlooks better binding sequences with multiple low-energy conformations. Provable, ensemble-based algorithms such as A* avoid this problem, but A* cannot guarantee better performance than exhaustive enumeration. We propose a novel, provable, dynamic programming algorithm called Branch-Width Minimization* (BWM*) to enumerate a gap-free ensemble of conformations in order of increasing energy. Given a branch-decomposition of branch-width w for an n-residue protein design with at most q discrete side-chain conformations per residue, BWM* returns the sparse GMEC in O([Formula: see text]) time and enumerates each additional conformation in merely O([Formula: see text]) time. We define a new measure, Total Effective Search Space (TESS), which can be computed efficiently a priori before BWM* or A* is run. We ran BWM* on 67 protein design problems and found that TESS discriminated between BWM*-efficient and A*-efficient cases with 100% accuracy. As predicted by TESS and validated experimentally, BWM* outperforms A* in 73% of the cases and computes the full ensemble or a close approximation faster than A*, enumerating each additional conformation in milliseconds. Unlike A*, the performance of BWM* can be predicted in polynomial time before running the algorithm, which gives protein designers the power to choose the most efficient algorithm for their particular design problem.

  4. Using quadratic simplicial elements for hierarchical approximation and visualization

    NASA Astrophysics Data System (ADS)

    Wiley, David F.; Childs, Henry R.; Hamann, Bernd; Joy, Kenneth I.; Max, Nelson

    2002-03-01

    Best quadratic simplicial spline approximations can be computed, using quadratic Bernstein-Bezier basis functions, by identifying and bisecting simplicial elements with largest errors. Our method begins with an initial triangulation of the domain; a best quadratic spline approximation is computed; errors are computed for all simplices; and simplices of maximal error are subdivided. This process is repeated until a user-specified global error tolerance is met. The initial approximations for the unit square and cube are given by two quadratic triangles and five quadratic tetrahedra, respectively. Our more complex triangulation and approximation method that respects field discontinuities and geometrical features allows us to better approximate data. Data is visualized by using the hierarchy of increasingly better quadratic approximations generated by this process. Many visualization problems arise for quadratic elements. First tessellating quadratic elements with smaller linear ones and then rendering the smaller linear elements is one way to visualize quadratic elements. Our results show a significant reduction in the number of simplices required to approximate data sets when using quadratic elements as compared to using linear elements.

  5. An interactive approach based on a discrete differential evolution algorithm for a class of integer bilevel programming problems

    NASA Astrophysics Data System (ADS)

    Li, Hong; Zhang, Li; Jiao, Yong-Chang

    2016-07-01

    This paper presents an interactive approach based on a discrete differential evolution algorithm to solve a class of integer bilevel programming problems, in which integer decision variables are controlled by an upper-level decision maker and real-value or continuous decision variables are controlled by a lower-level decision maker. Using the Karush--Kuhn-Tucker optimality conditions in the lower-level programming, the original discrete bilevel formulation can be converted into a discrete single-level nonlinear programming problem with the complementarity constraints, and then the smoothing technique is applied to deal with the complementarity constraints. Finally, a discrete single-level nonlinear programming problem is obtained, and solved by an interactive approach. In each iteration, for each given upper-level discrete variable, a system of nonlinear equations including the lower-level variables and Lagrange multipliers is solved first, and then a discrete nonlinear programming problem only with inequality constraints is handled by using a discrete differential evolution algorithm. Simulation results show the effectiveness of the proposed approach.

  6. Status report: Data management program algorithm evaluation activity at Marshall Space Flight Center

    NASA Technical Reports Server (NTRS)

    Jayroe, R. R., Jr.

    1977-01-01

    An algorithm evaluation activity was initiated to study the problems associated with image processing by assessing the independent and interdependent effects of registration, compression, and classification techniques on LANDSAT data for several discipline applications. The objective of the activity was to make recommendations on selected applicable image processing algorithms in terms of accuracy, cost, and timeliness or to propose alternative ways of processing the data. As a means of accomplishing this objective, an Image Coding Panel was established. The conduct of the algorithm evaluation is described.

  7. Dynamic programming algorithms for comparing multineuronal spike trains via cost-based metrics and alignments.

    PubMed

    Victor, Jonathan D; Goldberg, David H; Gardner, Daniel

    2007-04-15

    Cost-based metrics formalize notions of distance, or dissimilarity, between two spike trains, and are applicable to single- and multineuronal responses. As such, these metrics have been used to characterize neural variability and neural coding. By examining the structure of an efficient algorithm [Aronov D, 2003. Fast algorithm for the metric-space analysis of simultaneous responses of multiple single neurons. J Neurosci Methods 124(2), 175-79] implementing a metric for multineuronal responses, we determine criteria for its generalization, and identify additional efficiencies that are applicable when related dissimilarity measures are computed in parallel. The generalized algorithm provides the means to test a wide range of coding hypotheses.

  8. Algorithmic Bricks: A Tangible Robot Programming Tool for Elementary School Students

    ERIC Educational Resources Information Center

    Kwon, D.-Y.; Kim, H.-S.; Shim, J.-K.; Lee, W.-G.

    2012-01-01

    Tangible programming tools enable children to easily learn the programming process, previously considered to be difficult for them. While various tangible programming tools have been developed, there is still a lack of available tools to help students experience the general programming process. This study therefore developed a tool called…

  9. Integrating Evolution Algorithms with Linear Programming to the Conjunctive Use of Surface and Subsurface Water

    NASA Astrophysics Data System (ADS)

    Chang, L.; Chen, Y.; Pan, C.

    2009-12-01

    Surface water resources are strongly influenced by hydrological conditions, and using only surface water resources as water supplies may have higher shortage risk than before because of the climate change caused by the global warming. Conjunctive use of surface and subsurface water is one of the most effective water resource practices to increase water supply reliability with minimal cost and environmental impact. Therefore, this paper presents a novel stepwise optimization model for optimizing the conjunctive use of surface and subsurface water resources management. At each time step, a two level decomposition approach was proposed to divide the nonlinear optimal conjunctive use problem into a linear surface water subproblem and a nonlinear groundwater subproblem. Because of the two level decomposition approach, a hybrid framework is used for the implementation of the conjunctive use model. In the hybrid framework, evolution algorithms, Genetic Algorithm (GA) and Artificial Neural Network (ANN), and Linear Programming (LP) are used for model solving. GA and LP are respectively used for determining the optimal pumping quantities and reservoir allocation, and ANN is used for the groundwater simulation. In the groundwater simulation, this study uses an ANN to simulate groundwater response and greatly reduce computational loading for unconfined aquifers, unlike conventional “response matrix method” or “embedding method”. Because of the very high performance of LP, the usage of LP for the linear surface water subproblem can significantly decrease the computational burden of entire model. In this study, four cases have been demonstrated. Case #1 is a pure surface water case and others are conjunctive use cases. In Case #2, “surface water supply firstly” is the supply principle between surface water. In Case #3 and #4, the “Index Balance” theory is the supply principle and different operation curves used in different cases respectively. The case result

  10. Acute Myocardial Infarction Complicated by Cardiogenic Shock: An Algorithm-Based Extracorporeal Membrane Oxygenation Program Can Improve Clinical Outcomes.

    PubMed

    Unai, Shinya; Tanaka, Daizo; Ruggiero, Nicholas; Hirose, Hitoshi; Cavarocchi, Nicholas C

    2016-03-01

    Extracorporeal membrane oxygenation (ECMO) in our institution resulted in near total mortality prior to the establishment of an algorithm-based program in July 2010. We hypothesized that an algorithm-based ECMO program improves the outcome of patients with acute myocardial infarction complicated with cardiogenic shock. Between March 2003 and July 2013, 29 patients underwent emergent catheterization for acute myocardial infarction due to left main or proximal left anterior descending artery occlusion complicated with cardiogenic shock (defined as systolic blood pressure <90 mm Hg despite multiple inotropes, with or without intra-aortic balloon pump, lactic acidosis). Of 29 patients, 15 patients were treated before July 2010 (Group 1, old program), and 14 patients were treated after July 2010 (Group 2, new program). There were no significant differences in the baseline characteristics, including age, sex, coronary risk factors, and left ventricular ejection fraction between the two groups. Cardiopulmonary resuscitation prior to ECMO was performed in two cases (13%) in Group 1 and four cases (29%) in Group 2. ECMO support was performed in one case (6.7%) in Group 1 and six cases (43%) in Group 2. The 30-day survival of Group 1 versus Group 2 was 40 versus 79% (P = 0.03), and 1-year survival rate was 20 versus 56% (P = 0.01). The survival rate for patients who underwent ECMO was 0% in Group 1 versus 83% in Group 2 (P = 0.09). In Group 2, the mean duration on ECMO was 9.8 ± 5.9 days. Of the six patients who required ECMO in Group 2, 100% were successfully weaned off ECMO or were bridged to ventricular assist device implantation. Initiation of an algorithm-based ECMO program improved the outcomes in patients with acute myocardial infarction complicated by cardiogenic shock.

  11. Some Aspects of Quadratic Generalized White Noise Functionals

    NASA Astrophysics Data System (ADS)

    Si, Si; Hida, Takeyuki

    2009-02-01

    We shall discuss some particular roles of quadratic generalized white noise functionals. First observation is made from the viewpoint of the so-called "la passage du fini à l'infini". We then come to a dual pairing of spaces formed by quadratic generalized white noise functionals. In this line, we can further discuss quadratic forms of differential operators acting on the space of white noise functionals.

  12. An optimal approach for the critical node problem using semidefinite programming

    NASA Astrophysics Data System (ADS)

    Jiang, Cheng; Liu, Zhonghua; Wang, Juyun; Yu, Hua; Guo, Xiaoling

    2017-04-01

    Detecting critical nodes in complex networks (CNP) has great theoretical and practical significance in many disciplines. The existing formulations for CNP are mostly, as we know, based on the integer linear programming model. However, we observed that, these formulations only considered the sizes but neglected the cohesiveness properties of the connected components in the induced network. To solve the problem and improve the performance of CNP solutions, we construct a novel nonconvex quadratically constrained quadratic programming (QCQP) model and derive its approximation solutions via semidefinite programming (SDP) technique and heuristic algorithms. Various types of synthesized and real-world networks, in the context of different connectivity patterns, are used to validate and verify the effectiveness of the proposed model and algorithm. Experimental results show that our method improved the state of the art of the CNP.

  13. Programming Non-Trivial Algorithms in the Measurement Based Quantum Computation Model

    SciTech Connect

    Alsing, Paul; Fanto, Michael; Lott, Capt. Gordon; Tison, Christoper C.

    2014-01-01

    We provide a set of prescriptions for implementing a quantum circuit model algorithm as measurement based quantum computing (MBQC) algorithm1, 2 via a large cluster state. As means of illustration we draw upon our numerical modeling experience to describe a large graph state capable of searching a logical 8 element list (a non-trivial version of Grover's algorithm3 with feedforward). We develop several prescriptions based on analytic evaluation of cluster states and graph state equations which can be generalized into any circuit model operations. Such a resulting cluster state will be able to carry out the desired operation with appropriate measurements and feed forward error correction. We also discuss the physical implementation and the analysis of the principal 3-qubit entangling gate (Toffoli) required for a non-trivial feedforward realization of an 8-element Grover search algorithm.

  14. On Coupled Rate Equations with Quadratic Nonlinearities

    PubMed Central

    Montroll, Elliott W.

    1972-01-01

    Rate equations with quadratic nonlinearities appear in many fields, such as chemical kinetics, population dynamics, transport theory, hydrodynamics, etc. Such equations, which may arise from basic principles or which may be phenomenological, are generally solved by linearization and application of perturbation theory. Here, a somewhat different strategy is emphasized. Alternative nonlinear models that can be solved exactly and whose solutions have the qualitative character expected from the original equations are first searched for. Then, the original equations are treated as perturbations of those of the solvable model. Hence, the function of the perturbation theory is to improve numerical accuracy of solutions, rather than to furnish the basic qualitative behavior of the solutions of the equations. PMID:16592013

  15. Compact stars with quadratic equation of state

    NASA Astrophysics Data System (ADS)

    Ngubelanga, Sifiso A.; Maharaj, Sunil D.; Ray, Subharthi

    2015-05-01

    We provide new exact solutions to the Einstein-Maxwell system of equations for matter configurations with anisotropy and charge. The spacetime is static and spherically symmetric. A quadratic equation of state is utilised for the matter distribution. By specifying a particular form for one of the gravitational potentials and the electric field intensity we obtain new exact solutions in isotropic coordinates. In our general class of models, an earlier model with a linear equation of state is regained. For particular choices of parameters we regain the masses of the stars PSR J1614-2230, 4U 1608-52, PSR J1903+0327, EXO 1745-248 and SAX J1808.4-3658. A comprehensive physical analysis for the star PSR J1903+0327 reveals that our model is reasonable.

  16. Forced oscillations in quadratically damped systems

    NASA Technical Reports Server (NTRS)

    Bayliss, A.

    1978-01-01

    Bayliss (1975) has studied the question whether in the case of linear differential equations the relationship between the stability of the homogeneous equations and the existence of almost periodic solutions to the inhomogeneous equation is preserved by finite difference approximations. In the current investigation analogous properties are considered for the case in which the damping is quadratic rather than linear. The properties of the considered equation for arbitrary forcing terms are examined and the validity is proved of a theorem concerning the characteristics of the unique solution. By using the Lipschitz continuity of the mapping and the contracting mapping principle, almost periodic solutions can be found for perturbations of the considered equation. Attention is also given to the Lipschitz continuity of the solution operator and the results of numerical tests which have been conducted to test the discussed theory.

  17. Reconstruction of quadratic curves in 3D using two or more perspective views: simulation studies

    NASA Astrophysics Data System (ADS)

    Kumar, Sanjeev; Sukavanam, N.; Balasubramanian, R.

    2006-01-01

    The shapes of many natural and man-made objects have planar and curvilinear surfaces. The images of such curves usually do not have sufficient distinctive features to apply conventional feature-based reconstruction algorithms. In this paper, we describe a method of reconstruction of a quadratic curve in 3-D space as an intersection of two cones containing the respective projected curve images. The correspondence between this pair of projections of the curve is assumed to be established in this work. Using least-square curve fitting, the parameters of a curve in 2-D space are found. From this we are reconstructing the 3-D quadratic curve. Relevant mathematical formulations and analytical solutions for obtaining the equation of reconstructed curve are given. The result of the described reconstruction methodology are studied by simulation studies. This reconstruction methodology is applicable to LBW decision in cricket, path of the missile, Robotic Vision, path lanning etc.

  18. Learning control for minimizing a quadratic cost during repetitions of a task

    NASA Technical Reports Server (NTRS)

    Longman, Richard W.; Chang, Chi-Kuang

    1990-01-01

    In many applications, control systems are asked to perform the same task repeatedly. Learning control laws have been developed over the last few years that allow the controller to improve its performance each repetition, and to converge to zero error in tracking a desired trajectory. This paper generates a new type of learning control law that learns to minimize a quadratic cost function for tracking. Besides being of interest in its own right, this objective alleviates the need to specify a desired trajectory that can actually be performed by the system. The approach used here is to adapt appropriate methods from numerical optimization theory in order to produce learning control algorithms that adjust the system command from repetition to repetition in order to converge to the quadratic cost optimal trajectory.

  19. Elastic Model Transitions Using Quadratic Inequality Constrained Least Squares

    NASA Technical Reports Server (NTRS)

    Orr, Jeb S.

    2012-01-01

    A technique is presented for initializing multiple discrete finite element model (FEM) mode sets for certain types of flight dynamics formulations that rely on superposition of orthogonal modes for modeling the elastic response. Such approaches are commonly used for modeling launch vehicle dynamics, and challenges arise due to the rapidly time-varying nature of the rigid-body and elastic characteristics. By way of an energy argument, a quadratic inequality constrained least squares (LSQI) algorithm is employed to e ect a smooth transition from one set of FEM eigenvectors to another with no requirement that the models be of similar dimension or that the eigenvectors be correlated in any particular way. The physically unrealistic and controversial method of eigenvector interpolation is completely avoided, and the discrete solution approximates that of the continuously varying system. The real-time computational burden is shown to be negligible due to convenient features of the solution method. Simulation results are presented, and applications to staging and other discontinuous mass changes are discussed

  20. A Dynamic Programming Algorithm for Finding the Optimal Placement of a Secondary Structure Topology in Cryo-EM Data.

    PubMed

    Biswas, Abhishek; Ranjan, Desh; Zubair, Mohammad; He, Jing

    2015-09-01

    The determination of secondary structure topology is a critical step in deriving the atomic structures from the protein density maps obtained from electron cryomicroscopy technique. This step often relies on matching the secondary structure traces detected from the protein density map to the secondary structure sequence segments predicted from the amino acid sequence. Due to inaccuracies in both sources of information, a pool of possible secondary structure positions needs to be sampled. One way to approach the problem is to first derive a small number of possible topologies using existing matching algorithms, and then find the optimal placement for each possible topology. We present a dynamic programming method of Θ(Nq(2)h) to find the optimal placement for a secondary structure topology. We show that our algorithm requires significantly less computational time than the brute force method that is in the order of Θ(q(N) h).

  1. Efficient Sparse Matrix Algorithm to Speed Up the Calculation of the Ladder Term in Coupled Cluster Programs.

    PubMed

    Pillió, Zoltán; Tajti, Attila; Szalay, Péter G

    2012-09-11

    A new algorithm is presented for the calculation of the ladder-type term of the coupled cluster singles and doubles (CCSD) equations using two-electron integrals in atomic orbital (AO) basis. The method is based on an orbital grouping scheme, which results in an optimal partitioning of the AO integral matrix into sparse and dense blocks allowing efficient matrix multiplication. Carefully chosen numerical tests have been performed to analyze the performance of all aspects of the new algorithm. It is shown that the suggested scheme allows an efficient utilization of modern highly parallel architectures and devices in CCSD calculations. Details of the implementation in the development version of CFOUR quantum chemical program package are also presented.

  2. LIFT: a nested decomposition algorithm for solving lower block triangular linear programs. Report AMD-859. [In PL/I for IBM 370

    SciTech Connect

    Ament, D; Ho, J; Loute, E; Remmelswaal, M

    1980-06-01

    Nested decomposition of linear programs is the result of a multilevel, hierarchical application of the Dantzig-Wolfe decomposition principle. The general structure is called lower block-triangular, and permits direct accounting of long-term effects of investment, service life, etc. LIFT, an algorithm for solving lower block triangular linear programs, is based on state-of-the-art modular LP software. The algorithmic and software aspects of LIFT are outlined, and computational results are presented. 5 figures, 6 tables. (RWR)

  3. Geometric quadratic stochastic operator on countable infinite set

    SciTech Connect

    Ganikhodjaev, Nasir; Hamzah, Nur Zatul Akmar

    2015-02-03

    In this paper we construct the family of Geometric quadratic stochastic operators defined on the countable sample space of nonnegative integers and investigate their trajectory behavior. Such operators can be reinterpreted in terms of of evolutionary operator of free population. We show that Geometric quadratic stochastic operators are regular transformations.

  4. Tangent Lines without Derivatives for Quadratic and Cubic Equations

    ERIC Educational Resources Information Center

    Carroll, William J.

    2009-01-01

    In the quadratic equation, y = ax[superscript 2] + bx + c, the equation y = bx + c is identified as the equation of the line tangent to the parabola at its y-intercept. This is extended to give a convenient method of graphing tangent lines at any point on the graph of a quadratic or a cubic equation. (Contains 5 figures.)

  5. Some Paradoxical Results for the Quadratically Weighted Kappa

    ERIC Educational Resources Information Center

    Warrens, Matthijs J.

    2012-01-01

    The quadratically weighted kappa is the most commonly used weighted kappa statistic for summarizing interrater agreement on an ordinal scale. The paper presents several properties of the quadratically weighted kappa that are paradoxical. For agreement tables with an odd number of categories "n" it is shown that if one of the raters uses the same…

  6. Visualising the Roots of Quadratic Equations with Complex Coefficients

    ERIC Educational Resources Information Center

    Bardell, Nicholas S.

    2014-01-01

    This paper is a natural extension of the root visualisation techniques first presented by Bardell (2012) for quadratic equations with real coefficients. Consideration is now given to the familiar quadratic equation "y = ax[superscript 2] + bx + c" in which the coefficients "a," "b," "c" are generally…

  7. Convexity preserving C2 rational quadratic trigonometric spline

    NASA Astrophysics Data System (ADS)

    Dube, Mridula; Tiwari, Preeti

    2012-09-01

    A C2 rational quadratic trigonometric spline interpolation has been studied using two kind of rational quadratic trigonometric splines. It is shown that under some natural conditions the solution of the problem exits and is unique. The necessary and sufficient condition that constrain the interpolation curves to be convex in the interpolating interval or subinterval are derived.

  8. Sketching the General Quadratic Equation Using Dynamic Geometry Software

    ERIC Educational Resources Information Center

    Stols, G. H.

    2005-01-01

    This paper explores a geometrical way to sketch graphs of the general quadratic in two variables with Geometer's Sketchpad. To do this, a geometric procedure as described by De Temple is used, bearing in mind that this general quadratic equation (1) represents all the possible conics (conics sections), and the fact that five points (no three of…

  9. Analysis of Students' Error in Learning of Quadratic Equations

    ERIC Educational Resources Information Center

    Zakaria, Effandi; Ibrahim; Maat, Siti Mistima

    2010-01-01

    The purpose of the study was to determine the students' error in learning quadratic equation. The samples were 30 form three students from a secondary school in Jambi, Indonesia. Diagnostic test was used as the instrument of this study that included three components: factorization, completing the square and quadratic formula. Diagnostic interview…

  10. Comparing, optimizing, and benchmarking quantum-control algorithms in a unifying programming framework

    SciTech Connect

    Machnes, S.; Sander, U.; Glaser, S. J.; Schulte-Herbrueggen, T.; Fouquieres, P. de; Gruslys, A.; Schirmer, S.

    2011-08-15

    For paving the way to novel applications in quantum simulation, computation, and technology, increasingly large quantum systems have to be steered with high precision. It is a typical task amenable to numerical optimal control to turn the time course of pulses, i.e., piecewise constant control amplitudes, iteratively into an optimized shape. Here, we present a comparative study of optimal-control algorithms for a wide range of finite-dimensional applications. We focus on the most commonly used algorithms: GRAPE methods which update all controls concurrently, and Krotov-type methods which do so sequentially. Guidelines for their use are given and open research questions are pointed out. Moreover, we introduce a unifying algorithmic framework, DYNAMO (dynamic optimization platform), designed to provide the quantum-technology community with a convenient matlab-based tool set for optimal control. In addition, it gives researchers in optimal-control techniques a framework for benchmarking and comparing newly proposed algorithms with the state of the art. It allows a mix-and-match approach with various types of gradients, update and step-size methods as well as subspace choices. Open-source code including examples is made available at http://qlib.info.

  11. Effect of Algorithms' Multiple Representations in the Context of Programming Education

    ERIC Educational Resources Information Center

    Siozou, Stefania; Tselios, Nikolaos; Komis, Vassilis

    2008-01-01

    Purpose: The purpose of this paper is to compare the effect of different representations while teaching basic algorithmic concepts to novice programmers. Design/methodology/approach: A learning activity was designed and mediated with two conceptually different learning environments, each one used by a different group. The first group used the…

  12. Quadratic algebras for three-dimensional superintegrable systems

    SciTech Connect

    Daskaloyannis, C. Tanoudis, Y.

    2010-02-15

    The three-dimensional superintegrable systems with quadratic integrals of motion have five functionally independent integrals, one among them is the Hamiltonian. Kalnins, Kress, and Miller have proved that in the case of nondegenerate potentials with quadratic integrals of motion there is a sixth quadratic integral, which is linearly independent of the other integrals. The existence of this sixth integral implies that the integrals of motion form a ternary parafermionic-like quadratic Poisson algebra with five generators. In this contribution we investigate the structure of this algebra. We show that in all the nondegenerate cases there is at least one subalgebra of three integrals having a Poisson quadratic algebra structure, which is similar to the two-dimensional case.

  13. Evaluation of a particle swarm algorithm for biomechanical optimization.

    PubMed

    Schutte, Jaco F; Koh, Byung-Il; Reinbolt, Jeffrey A; Haftka, Raphael T; George, Alan D; Fregly, Benjamin J

    2005-06-01

    Optimization is frequently employed in biomechanics research to solve system identification problems, predict human movement, or estimate muscle or other internal forces that cannot be measured directly. Unfortunately, biomechanical optimization problems often possess multiple local minima, making it difficult to find the best solution. Furthermore, convergence in gradient-based algorithms can be affected by scaling to account for design variables with different length scales or units. In this study we evaluate a recently-developed version of the particle swarm optimization (PSO) algorithm to address these problems. The algorithm's global search capabilities were investigated using a suite of difficult analytical test problems, while its scale-independent nature was proven mathematically and verified using a biomechanical test problem. For comparison, all test problems were also solved with three off-the-shelf optimization algorithms--a global genetic algorithm (GA) and multistart gradient-based sequential quadratic programming (SQP) and quasi-Newton (BFGS) algorithms. For the analytical test problems, only the PSO algorithm was successful on the majority of the problems. When compared to previously published results for the same problems, PSO was more robust than a global simulated annealing algorithm but less robust than a different, more complex genetic algorithm. For the biomechanical test problem, only the PSO algorithm was insensitive to design variable scaling, with the GA algorithm being mildly sensitive and the SQP and BFGS algorithms being highly sensitive. The proposed PSO algorithm provides a new off-the-shelf global optimization option for difficult biomechanical problems, especially those utilizing design variables with different length scales or units.

  14. SPARSE REPRESENTATIONS WITH DATA FIDELITY TERM VIA AN ITERATIVELY REWEIGHTED LEAST SQUARES ALGORITHM

    SciTech Connect

    WOHLBERG, BRENDT; RODRIGUEZ, PAUL

    2007-01-08

    Basis Pursuit and Basis Pursuit Denoising, well established techniques for computing sparse representations, minimize an {ell}{sup 2} data fidelity term subject to an {ell}{sup 1} sparsity constraint or regularization term on the solution by mapping the problem to a linear or quadratic program. Basis Pursuit Denoising with an {ell}{sup 1} data fidelity term has recently been proposed, also implemented via a mapping to a linear program. They introduce an alternative approach via an iteratively Reweighted Least Squares algorithm, providing greater flexibility in the choice of data fidelity term norm, and computational advantages in certain circumstances.

  15. Analysis of the Multi Strategy Goal Programming for Micro-Grid Based on Dynamic ant Genetic Algorithm

    NASA Astrophysics Data System (ADS)

    Qiu, J. P.; Niu, D. X.

    Micro-grid is one of the key technologies of the future energy supplies. Take economic planning. reliability, and environmental protection of micro grid as a basis for the analysis of multi-strategy objective programming problems for micro grid which contains wind power, solar power, and battery and micro gas turbine. Establish the mathematical model of each power generation characteristics and energy dissipation. and change micro grid planning multi-objective function under different operating strategies to a single objective model based on AHP method. Example analysis shows that in combination with dynamic ant mixed genetic algorithm can get the optimal power output of this model.

  16. Scheduling language and algorithm development study. Volume 2, phase 2: Introduction to plans programming. [user guide

    NASA Technical Reports Server (NTRS)

    Cochran, D. R.; Ishikawa, M. K.; Paulson, R. E.; Ramsey, H. R.

    1975-01-01

    A user guide for the Programming Language for Allocation and Network Scheduling (PLANS) is presented. Information is included for the construction of PLANS programs. The basic philosophy of PLANS is discussed, and access and update reference techniques are described along with the use of tree structures.

  17. Extremal Optimization for Quadratic Unconstrained Binary Problems

    NASA Astrophysics Data System (ADS)

    Boettcher, S.

    We present an implementation of τ-EO for quadratic unconstrained binary optimization (QUBO) problems. To this end, we transform modify QUBO from its conventional Boolean presentation into a spin glass with a random external field on each site. These fields tend to be rather large compared to the typical coupling, presenting EO with a challenging two-scale problem, exploring smaller differences in couplings effectively while sufficiently aligning with those strong external fields. However, we also find a simple solution to that problem that indicates that those external fields apparently tilt the energy landscape to a such a degree such that global minima become more easy to find than those of spin glasses without (or very small) fields. We explore the impact of the weight distribution of the QUBO formulation in the operations research literature and analyze their meaning in a spin-glass language. This is significant because QUBO problems are considered among the main contenders for NP-hard problems that could be solved efficiently on a quantum computer such as D-Wave.

  18. A Multiobjective Interval Programming Model for Wind-Hydrothermal Power System Dispatching Using 2-Step Optimization Algorithm

    PubMed Central

    Jihong, Qu

    2014-01-01

    Wind-hydrothermal power system dispatching has received intensive attention in recent years because it can help develop various reasonable plans to schedule the power generation efficiency. But future data such as wind power output and power load would not be accurately predicted and the nonlinear nature involved in the complex multiobjective scheduling model; therefore, to achieve accurate solution to such complex problem is a very difficult task. This paper presents an interval programming model with 2-step optimization algorithm to solve multiobjective dispatching. Initially, we represented the future data into interval numbers and simplified the object function to a linear programming problem to search the feasible and preliminary solutions to construct the Pareto set. Then the simulated annealing method was used to search the optimal solution of initial model. Thorough experimental results suggest that the proposed method performed reasonably well in terms of both operating efficiency and precision. PMID:24895663

  19. A multiobjective interval programming model for wind-hydrothermal power system dispatching using 2-step optimization algorithm.

    PubMed

    Ren, Kun; Jihong, Qu

    2014-01-01

    Wind-hydrothermal power system dispatching has received intensive attention in recent years because it can help develop various reasonable plans to schedule the power generation efficiency. But future data such as wind power output and power load would not be accurately predicted and the nonlinear nature involved in the complex multiobjective scheduling model; therefore, to achieve accurate solution to such complex problem is a very difficult task. This paper presents an interval programming model with 2-step optimization algorithm to solve multiobjective dispatching. Initially, we represented the future data into interval numbers and simplified the object function to a linear programming problem to search the feasible and preliminary solutions to construct the Pareto set. Then the simulated annealing method was used to search the optimal solution of initial model. Thorough experimental results suggest that the proposed method performed reasonably well in terms of both operating efficiency and precision.

  20. Software For Genetic Algorithms

    NASA Technical Reports Server (NTRS)

    Wang, Lui; Bayer, Steve E.

    1992-01-01

    SPLICER computer program is genetic-algorithm software tool used to solve search and optimization problems. Provides underlying framework and structure for building genetic-algorithm application program. Written in Think C.

  1. Sequential quadratic programming with step control using the Lagrange function

    SciTech Connect

    Danilin, Yu.M.

    1995-01-01

    This article examines some methods of solving the problem min f (x), x {epsilon} S {contained_in} E{sup n}, S = (x:g{sub j}(x) = O,j = 1,...,t). These methods construct the iterative sequence x{sub k}+1 = x{sub k} + {alpha}{sub k}p{sub k}, k = 0, 1,..., where the vector p{sub k} is the solution of the problem min [ + 1/2 ], g{sub j}(x{sub k}) + < g{sub j}{prime}(x{sub k}), p > = O, j = 1,...,t, and the multiplier {alpha}{sub k} is chosen as the maximum value of the parameter {alpha} {le} 1 obtained by splitting such that F(x{sub k} + {alpha}p{sub k}, {lambda}{sub k}{sub i} + 1, R{sub k}{sub i}){le}{epsilon} {alpha} < F{prime} {sub x}(x{sub k},{lambda}{sub k}{sub i} + 1, R{sub k}{sub i}), p{sub k} >, O < {epsilon} < 1.

  2. Multireference correlation in long molecules with the quadratic scaling density matrix renormalization group

    NASA Astrophysics Data System (ADS)

    Hachmann, Johannes; Cardoen, Wim; Chan, Garnet Kin-Lic

    2006-10-01

    We have devised a local ab initio density matrix renormalization group algorithm to describe multireference correlations in large systems. For long molecules that are extended in one of their spatial dimensions, we can obtain an exact characterization of correlation, in the given basis, with a cost that scales only quadratically with the size of the system. The reduced scaling is achieved solely through integral screening and without the construction of correlation domains. We demonstrate the scaling, convergence, and robustness of the algorithm in polyenes and hydrogen chains. We converge to exact correlation energies (in the sense of full configuration interaction, with 1-10μEh precision) in all cases and correlate up to 100 electrons in 100 active orbitals. We further use our algorithm to obtain exact energies for the metal-insulator transition in hydrogen chains and compare and contrast our results with those from conventional quantum chemical methods.

  3. A General Program for Item-Response Analysis That Employs the Stabilized Newton-Raphson Algorithm. Research Report. ETS RR-13-32

    ERIC Educational Resources Information Center

    Haberman, Shelby J.

    2013-01-01

    A general program for item-response analysis is described that uses the stabilized Newton-Raphson algorithm. This program is written to be compliant with Fortran 2003 standards and is sufficiently general to handle independent variables, multidimensional ability parameters, and matrix sampling. The ability variables may be either polytomous or…

  4. Thermal algorithms analysis. [programming tasks supporting the development of a thermal model of the Earth's surface

    NASA Technical Reports Server (NTRS)

    Lien, T.

    1981-01-01

    The programming and analysis methods to support the development of a thermal model of the Earth's surface from detailed analysis of day/night registered data sets from the Heat Capacity Mapping Mission satellite are briefly described.

  5. Algorithmic Approximation of Optimal Value Differential Stability Bounds in Nonlinear Programming,

    DTIC Science & Technology

    1981-08-01

    NCLASSIFIED RANO/PA6659 N IN *~4 112.0.0 ~11111,.. I32 111 IIIII 111111.25 MICROCOPY RESOLUTION TESI CHART NATIOt AL BJRLAU Of SIANDARD 1964 A * LEVEL 00 o pm...Sensitivity Analysis in Parametric Nonlinear Programming, Doctoral Dissertation, School of Engineering and Applied Science, The George Washington University...Differential Stability of the Optimal Value Function in Constrained Nonlinear Programing, Doctoral Disser- tation, School of Engineering and Applied

  6. An analysis of spectral envelope-reduction via quadratic assignment problems

    NASA Technical Reports Server (NTRS)

    George, Alan; Pothen, Alex

    1994-01-01

    A new spectral algorithm for reordering a sparse symmetric matrix to reduce its envelope size was described. The ordering is computed by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. In this paper, we provide an analysis of the spectral envelope reduction algorithm. We described related 1- and 2-sum problems; the former is related to the envelope size, while the latter is related to an upper bound on the work involved in an envelope Cholesky factorization scheme. We formulate the latter two problems as quadratic assignment problems, and then study the 2-sum problem in more detail. We obtain lower bounds on the 2-sum by considering a projected quadratic assignment problem, and then show that finding a permutation matrix closest to an orthogonal matrix attaining one of the lower bounds justifies the spectral envelope reduction algorithm. The lower bound on the 2-sum is seen to be tight for reasonably 'uniform' finite element meshes. We also obtain asymptotically tight lower bounds for the envelope size for certain classes of meshes.

  7. Parallel and serial variational inequality decomposition algorithms for multicommodity market equilibrium problems

    SciTech Connect

    Nagurney, A.; Kim, D.S.

    1989-01-01

    The authors have applied parallel and serial variational inequality (VI) diagonal decomposition algorithms to large-scale multicommodity market equilibrium problems. These decomposition algorithms resolve the VI problems into single commodity problems, which are then solved as quadratic programming problems. The algorithms are implemented on an IBM 3090-600E, and randomly generated linear and nonlinear problems with as many as 100 markets and 12 commodities are solved. The computational results demonstrate that the parallel diagonal decomposition scheme is amenable to parallelization. This is the first time that multicommodity equilibrium problems of this scale and level of generality have been solved. Furthermore, this is the first study to compare the efficiencies of parallel and serial VI decomposition algorithms. Although the authors have selected as a prototype an equilibrium problem in economics, virtually any equilibrium problem can be formulated and studied as a variational inequality problem. Hence, their results are not limited to applications in economics and operations research.

  8. Ray-tracing simulation method using piecewise quadratic interpolant for aspheric optical systems.

    PubMed

    Morita, Shin-Ya; Nishidate, Yohei; Nagata, Takashi; Yamagata, Yutaka; Teodosiu, Cristian

    2010-06-20

    We present a new method for precise ray-tracing simulation considering form errors in the fabrication process of aspheric lenses. The Nagata patch, a quadratic interpolant for surface meshes using normal vectors, is adopted for representing the lens geometry with mid-spectral frequencies of surface profile errors. Several improvements in the ray-patch intersection calculation and its acceleration technique are also proposed. The developed algorithm is applied to ray-tracing simulation of optical disk pick-up aspheric objectives, and this technique requires 10(5) to 10(9) times fewer patches than a polygonal approximation. The simulation takes only several seconds on a standard PC.

  9. HOW DO YOU SOLVE A QUADRATIC EQUATION

    DTIC Science & Technology

    The nature of the floating - point number system of digital computers is explained to a reader whose university mathematical background is very limited...The possibly large errors in using mathematical algorithms blindly with floating - point computation are illustrated by the formula for solving a

  10. Graph Modeling for Quadratic Assignment Problems Associated with the Hypercube

    NASA Astrophysics Data System (ADS)

    Mittelmann, Hans; Peng, Jiming; Wu, Xiaolin

    2009-07-01

    In the paper we consider the quadratic assignment problem arising from channel coding in communications where one coefficient matrix is the adjacency matrix of a hypercube in a finite dimensional space. By using the geometric structure of the hypercube, we first show that there exist at least n different optimal solutions to the underlying QAPs. Moreover, the inherent symmetries in the associated hypercube allow us to obtain partial information regarding the optimal solutions and thus shrink the search space and improve all the existing QAP solvers for the underlying QAPs. Secondly, we use graph modeling technique to derive a new integer linear program (ILP) models for the underlying QAPs. The new ILP model has n(n-1) binary variables and O(n3 log(n)) linear constraints. This yields the smallest known number of binary variables for the ILP reformulation of QAPs. Various relaxations of the new ILP model are obtained based on the graphical characterization of the hypercube, and the lower bounds provided by the LP relaxations of the new model are analyzed and compared with what provided by several classical LP relaxations of QAPs in the literature.

  11. A quantum Algorithm for the Moebius Function

    NASA Astrophysics Data System (ADS)

    Love, Peter

    We give an efficient quantum algorithm for the Moebius function from the natural numbers to -1,0,1. The cost of the algorithm is asymptotically quadratic in log n and does not require the computation of the prime factorization of n as an intermediate step.

  12. Models and Algorithms Involving Very Large Scale Stochastic Mixed-Integer Programs

    DTIC Science & Technology

    2011-02-28

    give rise to a non - convex and discontinuous recourse function that may be difficult to optimize . As a result of this project, there have been... convex , the master problem in (3.1.6)-(3.1.9) is a non - convex mixed-integer program, and as indicated in [C.1], this approach is not scalable without...the first stage would result in a Benders’ master program which is non - convex , leading to a problem that is not any easier than (3.1.5). Nevertheless

  13. A decentralized linear quadratic control design method for flexible structures

    NASA Technical Reports Server (NTRS)

    Su, Tzu-Jeng; Craig, Roy R., Jr.

    1990-01-01

    A decentralized suboptimal linear quadratic control design procedure which combines substructural synthesis, model reduction, decentralized control design, subcontroller synthesis, and controller reduction is proposed for the design of reduced-order controllers for flexible structures. The procedure starts with a definition of the continuum structure to be controlled. An evaluation model of finite dimension is obtained by the finite element method. Then, the finite element model is decomposed into several substructures by using a natural decomposition called substructuring decomposition. Each substructure, at this point, still has too large a dimension and must be reduced to a size that is Riccati-solvable. Model reduction of each substructure can be performed by using any existing model reduction method, e.g., modal truncation, balanced reduction, Krylov model reduction, or mixed-mode method. Then, based on the reduced substructure model, a subcontroller is designed by an LQ optimal control method for each substructure independently. After all subcontrollers are designed, a controller synthesis method called substructural controller synthesis is employed to synthesize all subcontrollers into a global controller. The assembling scheme used is the same as that employed for the structure matrices. Finally, a controller reduction scheme, called the equivalent impulse response energy controller (EIREC) reduction algorithm, is used to reduce the global controller to a reasonable size for implementation. The EIREC reduced controller preserves the impulse response energy of the full-order controller and has the property of matching low-frequency moments and low-frequency power moments. An advantage of the substructural controller synthesis method is that it relieves the computational burden associated with dimensionality. Besides that, the SCS design scheme is also a highly adaptable controller synthesis method for structures with varying configuration, or varying mass

  14. Genetic algorithms and genetic programming for multiscale modeling: Applications in materials science and chemistry and advances in scalability

    NASA Astrophysics Data System (ADS)

    Sastry, Kumara Narasimha

    2007-03-01

    Effective and efficient rnultiscale modeling is essential to advance both the science and synthesis in a, wide array of fields such as physics, chemistry, materials science; biology, biotechnology and pharmacology. This study investigates the efficacy and potential of rising genetic algorithms for rnultiscale materials modeling and addresses some of the challenges involved in designing competent algorithms that solve hard problems quickly, reliably and accurately. In particular, this thesis demonstrates the use of genetic algorithms (GAs) and genetic programming (GP) in multiscale modeling with the help of two non-trivial case studies in materials science and chemistry. The first case study explores the utility of genetic programming (GP) in multi-timescaling alloy kinetics simulations. In essence, GP is used to bridge molecular dynamics and kinetic Monte Carlo methods to span orders-of-magnitude in simulation time. Specifically, GP is used to regress symbolically an inline barrier function from a limited set of molecular dynamics simulations to enable kinetic Monte Carlo that simulate seconds of real time. Results on a non-trivial example of vacancy-assisted migration on a surface of a face-centered cubic (fcc) Copper-Cobalt (CuxCo 1-x) alloy show that GP predicts all barriers with 0.1% error from calculations for less than 3% of active configurations, independent of type of potentials used to obtain the learning set of barriers via molecular dynamics. The resulting method enables 2--9 orders-of-magnitude increase in real-time dynamics simulations taking 4--7 orders-of-magnitude less CPU time. The second case study presents the application of multiobjective genetic algorithms (MOGAs) in multiscaling quantum chemistry simulations. Specifically, MOGAs are used to bridge high-level quantum chemistry and semiempirical methods to provide accurate representation of complex molecular excited-state and ground-state behavior. Results on ethylene and benzene---two common

  15. Solving Bilevel Programming Problems Using a Neural Network Approach and Its Application to Power System Environment

    NASA Astrophysics Data System (ADS)

    Yaakob, Shamshul Bahar; Watada, Junzo

    In this paper, a hybrid neural network approach to solve mixed integer quadratic bilevel programming problems is proposed. Bilevel programming problems arise when one optimization problem, the upper problem, is constrained by another optimization, the lower problem. The mixed integer quadratic bilevel programming problem is transformed into a double-layered neural network. The combination of a genetic algorithm (GA) and a meta-controlled Boltzmann machine (BM) enables us to formulate a hybrid neural network approach to solving bilevel programming problems. The GA is used to generate the feasible partial solutions of the upper level and to provide the parameters for the lower level. The meta-controlled BM is employed to cope with the lower level problem. The lower level solution is transmitted to the upper level. This procedure enables us to obtain the whole upper level solution. The iterative processes can converge on the complete solution of this problem to generate an optimal one. The proposed method leads the mixed integer quadratic bilevel programming problem to a global optimal solution. Finally, a numerical example is used to illustrate the application of the method in a power system environment, which shows that the algorithm is feasible and advantageous.

  16. Solving mixed integer nonlinear programming problems using spiral dynamics optimization algorithm

    NASA Astrophysics Data System (ADS)

    Kania, Adhe; Sidarto, Kuntjoro Adji

    2016-02-01

    Many engineering and practical problem can be modeled by mixed integer nonlinear programming. This paper proposes to solve the problem with modified spiral dynamics inspired optimization method of Tamura and Yasuda. Four test cases have been examined, including problem in engineering and sport. This method succeeds in obtaining the optimal result in all test cases.

  17. AdS waves as exact solutions to quadratic gravity

    SciTech Connect

    Guellue, Ibrahim; Sisman, Tahsin Cagri; Tekin, Bayram; Guerses, Metin

    2011-04-15

    We give an exact solution of the quadratic gravity in D dimensions. The solution is a plane-fronted wave metric with a cosmological constant. This metric solves not only the full quadratic gravity field equations but also the linearized ones which include the linearized equations of the recently found critical gravity. A subset of the solutions change the asymptotic structure of the anti-de Sitter space due to their logarithmic behavior.

  18. Chaos synchronization based on quadratic optimum regulation and control

    NASA Astrophysics Data System (ADS)

    Gong, Lihua

    2005-03-01

    Based on the method of the quadratic optimum control, a quadratic optimal regulator used for synchronizing chaotic systems is constructed to realize chaos synchronization. The synchronization method can maintain the least error with less control energy, and then realize the optimization on both sides of energy and error synthetically. In addition, the control cost can also be reduced by using this method intermittently. The simulation results of the chaotic Chua's circuit and the Rossler chaos system prove that the method is effective.

  19. Quadratic bulk viscosity and the topology of space time.

    NASA Astrophysics Data System (ADS)

    Wolf, C.

    1997-12-01

    By considering a homogeneous isotropic universe admitting quadratic bulk viscosity the author shows that if the bulk viscosity coefficient is large the effective topology of space time attains an antiintuitive interpretation in the sense that a positive curvature space time is ever-expanding. This is true for all cosmologies studied except in the case of small quadratic bulk viscosity (3γ+1-kβ ≥ 0, 3γ+1 > 0).

  20. An inertia-free filter line-search algorithm for large-scale nonlinear programming

    SciTech Connect

    Chiang, Nai-Yuan; Zavala, Victor M.

    2016-02-15

    We present a filter line-search algorithm that does not require inertia information of the linear system. This feature enables the use of a wide range of linear algebra strategies and libraries, which is essential to tackle large-scale problems on modern computing architectures. The proposed approach performs curvature tests along the search step to detect negative curvature and to trigger convexification. We prove that the approach is globally convergent and we implement the approach within a parallel interior-point framework to solve large-scale and highly nonlinear problems. Our numerical tests demonstrate that the inertia-free approach is as efficient as inertia detection via symmetric indefinite factorizations. We also demonstrate that the inertia-free approach can lead to reductions in solution time because it reduces the amount of convexification needed.

  1. New approaches to linear and nonlinear programming. Final technical report, January 1, 1987--December 31, 1989

    SciTech Connect

    Murray, W.; Saunders, M.A.

    1990-03-01

    During the last twelve months, research has concentrated on barrier- function methods for linear programming (LP) and quadratic programming (QP). Some ground-work for the application of barrier methods to nonlinearly constrained problems has also begun. In our previous progress report we drew attention to the difficulty of developing robust implementations of barrier methods for LP. We have continued to refine both the primal algorithm and the dual algorithm. We still do not claim that the barrier algorithms are as robust as the simplex method; however, the dual algorithm has solved all the problems in our extensive test set. We have also gained some experience with using the algorithms to solve aircrew scheduling problems.

  2. Validation Data for Mechanical System Algorithms Used in Building Energy Analysis Programs.

    DTIC Science & Technology

    1982-02-01

    Research Laboratory (CERL). The following per- sons contributed substantially to this work: Larry Brand , Jim Weiner, Bruce Drolin, Chang Shon, Don...costs, the uncertain availability of some energy sources, and the political overtones of the world energy market have created a need for building owners...validating building energy analysis programs and presents the strategy of the validation effort described in this report. Chapter 2 describes the design and

  3. Linearly convergent inexact proximal point algorithm for minimization. Revision 1

    SciTech Connect

    Zhu, C.

    1993-08-01

    In this paper, we propose a linearly convergent inexact PPA for minimization, where the inner loop stops when the relative reduction on the residue (defined as the objective value minus the optimal value) of the inner loop subproblem meets some preassigned constant. This inner loop stopping criterion can be achieved in a fixed number of iterations if the inner loop algorithm has a linear rate on the regularized subproblems. Therefore the algorithm is able to avoid the computationally expensive process of solving the inner loop subproblems exactly or asymptotically accurately; a process required by most of the other linearly convergent PPAs. As applications of this inexact PPA, we develop linearly convergent iteration schemes for minimizing functions with singular Hessian matrices, and for solving hemiquadratic extended linear-quadratic programming problems. We also prove that Correa-Lemarechal`s ``implementable form`` of PPA converges linearly under mild conditions.

  4. An optimization approach for minimum norm and robust partial quadratic eigenvalue assignment problems for vibrating structures

    NASA Astrophysics Data System (ADS)

    Brahma, Sanjoy; Datta, Biswa

    2009-07-01

    The partial quadratic eigenvalue assignment problem (PQEVAP) concerns the reassignment of a small number of undesirable eigenvalues of a quadratic matrix pencil, while leaving the remaining large number of eigenvalues and the corresponding eigenvectors unchanged. The problem arises in controlling undesirable resonance in vibrating structures and in stabilizing control systems. The solution of this problem requires computations of a pair of feedback matrices. For practical effectiveness, these feedback matrices must be computed in such a way that their norms and the condition number of the closed-loop eigenvector matrix are as small as possible. These considerations give rise to the minimum norm partial quadratic eigenvalue assignment problem (MNPQEVAP) and the robust partial quadratic eigenvalue assignment problem (RPQEVAP), respectively. In this paper we propose new optimization based algorithms for solving these problems. The problems are solved directly in a second-order setting without resorting to a standard first-order formulation so as to avoid the inversion of a possibly ill-conditioned matrix and the loss of exploitable structures of the original model. The algorithms require the knowledge of only the open-loop eigenvalues to be replaced and their corresponding eigenvectors. The remaining open-loop eigenvalues and their corresponding eigenvectors are kept unchanged. The invariance of the large number of eigenvalues and eigenvectors under feedback is guaranteed by a proven mathematical result. Furthermore, the gradient formulas needed to solve the problems by using the quasi-Newton optimization technique employed are computed in terms of the known quantities only. Above all, the proposed methods do not require the reduction of the model order or the order of the controller, even when the underlying finite element model has a very large degree of freedom. These attractive features, coupled with minimal computational requirements, such as solutions of small

  5. Implementation and testing of a real-time 3-component phase picking program for Earthworm using the CECM algorithm

    NASA Astrophysics Data System (ADS)

    Baker, B. I.; Friberg, P. A.

    2014-12-01

    Modern seismic networks typically deploy three component (3C) sensors, but still fail to utilize all of the information available in the seismograms when performing automated phase picking for real-time event location. In most cases a variation on a short term over long term average threshold detector is used for picking and then an association program is used to assign phase types to the picks. However, the 3C waveforms from an earthquake contain an abundance of information related to the P and S phases in both their polarization and energy partitioning. An approach that has been overlooked and has demonstrated encouraging results is the Component Energy Comparison Method (CECM) by Nagano et al. as published in Geophysics 1989. CECM is well suited to being used in real-time because the calculation is not computationally intensive. Furthermore, the CECM method has fewer tuning variables (3) than traditional pickers in Earthworm such as the Rex Allen algorithm (N=18) or even the Anthony Lomax Filter Picker module (N=5). In addition to computing the CECM detector we study the detector sensitivity by rotating the signal into principle components as well as estimating the P phase onset from a curvature function describing the CECM as opposed to the CECM itself. We present our results implementing this algorithm in a real-time module for Earthworm and show the improved phase picks as compared to the traditional single component pickers using Earthworm.

  6. Dynamic Programming Algorithms for Planning and Robotics in Continuous Domains and the Hamilton-Jacobi Equation

    DTIC Science & Technology

    2008-09-22

    of British Columbia 15 Dynamic Programming Principle • Value function ϑ(x) is “cost to go” from x to the nearest target • Value ϑ(x) at a point x is...the minimum over all points y in the neighborhood N(x) of the sum of – the value ϑ(y) at point y – the cost c(x) to travel through x • Dynamic...corresponding to edges leading to neighboring states • Interpolation of actions to points that are not grid nodes may not lead to actions optimal

  7. Algorithm Animation with Galant.

    PubMed

    Stallmann, Matthias F

    2017-01-01

    Although surveys suggest positive student attitudes toward the use of algorithm animations, it is not clear that they improve learning outcomes. The Graph Algorithm Animation Tool, or Galant, challenges and motivates students to engage more deeply with algorithm concepts, without distracting them with programming language details or GUIs. Even though Galant is specifically designed for graph algorithms, it has also been used to animate other algorithms, most notably sorting algorithms.

  8. Robust algorithm to generate a diverse class of dense disordered and ordered sphere packings via linear programming.

    PubMed

    Torquato, S; Jiao, Y

    2010-12-01

    We have formulated the problem of generating dense packings of nonoverlapping, nontiling nonspherical particles within an adaptive fundamental cell subject to periodic boundary conditions as an optimization problem called the adaptive-shrinking cell (ASC) formulation [S. Torquato and Y. Jiao, Phys. Rev. E 80, 041104 (2009)]. Because the objective function and impenetrability constraints can be exactly linearized for sphere packings with a size distribution in d-dimensional Euclidean space R(d), it is most suitable and natural to solve the corresponding ASC optimization problem using sequential-linear-programming (SLP) techniques. We implement an SLP solution to produce robustly a wide spectrum of jammed sphere packings in R(d) for d=2, 3, 4, 5, and 6 with a diversity of disorder and densities up to the respective maximal densities. A novel feature of this deterministic algorithm is that it can produce a broad range of inherent structures (locally maximally dense and mechanically stable packings), besides the usual disordered ones (such as the maximally random jammed state), with very small computational cost compared to that of the best known packing algorithms by tuning the radius of the influence sphere. For example, in three dimensions, we show that it can produce with high probability a variety of strictly jammed packings with a packing density anywhere in the wide range [0.6, 0.7408...], where π/√18 = 0.7408... corresponds to the density of the densest packing. We also apply the algorithm to generate various disordered packings as well as the maximally dense packings for d=2, 4, 5, and 6. Our jammed sphere packings are characterized and compared to the corresponding packings generated by the well-known Lubachevsky-Stillinger (LS) molecular-dynamics packing algorithm. Compared to the LS procedure, our SLP protocol is able to ensure that the final packings are truly jammed, produces disordered jammed packings with anomalously low densities, and is appreciably

  9. Improved CUDA programs for GPU computing of Swendsen-Wang multi-cluster spin flip algorithm: 2D and 3D Ising, Potts, and XY models

    NASA Astrophysics Data System (ADS)

    Komura, Yukihiro; Okabe, Yutaka

    2016-03-01

    We present new versions of sample CUDA programs for the GPU computing of the Swendsen-Wang multi-cluster spin flip algorithm. In this update, we add the method of GPU-based cluster-labeling algorithm without the use of conventional iteration (Komura, 2015) to those programs. For high-precision calculations, we also add a random-number generator in the cuRAND library. Moreover, we fix several bugs and remove the extra usage of shared memory in the kernel functions.

  10. Approximating the linear quadratic optimal control law for hereditary systems with delays in the control

    NASA Technical Reports Server (NTRS)

    Milman, Mark H.

    1988-01-01

    The fundamental control synthesis issue of establishing a priori convergence rates of approximation schemes for feedback controllers for a class of distributed parameter systems is addressed within the context of hereditary schemes. Specifically, a factorization approach is presented for deriving approximations to the optimal feedback gains for the linear regulator-quadratic cost problem associated with time-varying functional differential equations with control delays. The approach is based on a discretization of the state penalty which leads to a simple structure for the feedback control law. General properties of the Volterra factors of Hilbert-Schmidt operators are then used to obtain convergence results for the controls, trajectories and feedback kernels. Two algorithms are derived from the basic approximation scheme, including a fast algorithm, in the time-invariant case. A numerical example is also considered.

  11. The double-assignment method for the exponential chaotic tabu search in quadratic assignment problems

    NASA Astrophysics Data System (ADS)

    Shibata, Kazuaki; Horio, Yoshihiko; Aihara, Kazuyuki

    The quadratic assignment problem (QAP) is one of the NP-hard combinatorial optimization problems. An exponential chaotic tabu search using a 2-opt algorithm driven by chaotic neuro-dynamics has been proposed as one heuristic method for solving QAPs. In this paper we first propose a new local search, the double-assignment method, suitable for the exponential chaotic tabu search, which adopts features of the Lin-Kernighan algorithm. We then introduce chaotic neuro-dynamics into the double-assignment method to propose a novel exponential chaotic tabu search. We further improve the proposed exponential chaotic tabu search with the double-assignment method by enhancing the effect of chaotic neuro-dynamics.

  12. Approximating the linear quadratic optimal control law for hereditary systems with delays in the control

    NASA Technical Reports Server (NTRS)

    Milman, Mark H.

    1987-01-01

    The fundamental control synthesis issue of establishing a priori convergence rates of approximation schemes for feedback controllers for a class of distributed parameter systems is addressed within the context of hereditary systems. Specifically, a factorization approach is presented for deriving approximations to the optimal feedback gains for the linear regulator-quadratic cost problem associated with time-varying functional differential equations with control delays. The approach is based on a discretization of the state penalty which leads to a simple structure for the feedback control law. General properties of the Volterra factors of Hilbert-Schmidt operators are then used to obtain convergence results for the controls, trajectories and feedback kernels. Two algorithms are derived from the basic approximation scheme, including a fast algorithm, in the time-invariant case. A numerical example is also considered.

  13. Study on MAX-MIN Ant System with Random Selection in Quadratic Assignment Problem

    NASA Astrophysics Data System (ADS)

    Iimura, Ichiro; Yoshida, Kenji; Ishibashi, Ken; Nakayama, Shigeru

    Ant Colony Optimization (ACO), which is a type of swarm intelligence inspired by ants' foraging behavior, has been studied extensively and its effectiveness has been shown by many researchers. The previous studies have reported that MAX-MIN Ant System (MMAS) is one of effective ACO algorithms. The MMAS maintains the balance of intensification and diversification concerning pheromone by limiting the quantity of pheromone to the range of minimum and maximum values. In this paper, we propose MAX-MIN Ant System with Random Selection (MMASRS) for improving the search performance even further. The MMASRS is a new ACO algorithm that is MMAS into which random selection was newly introduced. The random selection is one of the edgechoosing methods by agents (ants). In our experimental evaluation using ten quadratic assignment problems, we have proved that the proposed MMASRS with the random selection is superior to the conventional MMAS without the random selection in the viewpoint of the search performance.

  14. Support Vector Machine algorithm for regression and classification

    SciTech Connect

    Yu, Chenggang; Zavaljevski, Nela

    2001-08-01

    The software is an implementation of the Support Vector Machine (SVM) algorithm that was invented and developed by Vladimir Vapnik and his co-workers at AT&T Bell Laboratories. The specific implementation reported here is an Active Set method for solving a quadratic optimization problem that forms the major part of any SVM program. The implementation is tuned to specific constraints generated in the SVM learning. Thus, it is more efficient than general-purpose quadratic optimization programs. A decomposition method has been implemented in the software that enables processing large data sets. The size of the learning data is virtually unlimited by the capacity of the computer physical memory. The software is flexible and extensible. Two upper bounds are implemented to regulate the SVM learning for classification, which allow users to adjust the false positive and false negative rates. The software can be used either as a standalone, general-purpose SVM regression or classification program, or be embedded into a larger software system.

  15. A transient, quadratic nodal method for triangular-Z geometry

    SciTech Connect

    DeLorey, T.F.

    1993-06-01

    Many systematically-derived nodal methods have been developed for Cartesian geometry due to the extensive interest in Light Water Reactors. These methods typically model the transverse-integrated flux as either an analytic or low order polynomial function of position within the node. Recently, quadratic nodal methods have been developed for R-Z and hexagonal geometry. A static and transient quadratic nodal method is developed for triangular-Z geometry. This development is particularly challenging because the quadratic expansion in each node must be performed between the node faces and the triangular points. As a consequence, in the 2-D plane, the flux and current at the points of the triangles must be treated. Quadratic nodal equations are solved using a non-linear iteration scheme, which utilizes the corrected, mesh-centered finite difference equations, and forces these equations to match the quadratic equations by computing discontinuity factors during the solution. Transient nodal equations are solved using the improved quasi-static method, which has been shown to be a very efficient solution method for transient problems. Several static problems are used to compare the quadratic nodal method to the Coarse Mesh Finite Difference (CMFD) method. The quadratic method is shown to give more accurate node-averaged fluxes. However, it appears that the method has difficulty predicting node leakages near reactor boundaries and severe material interfaces. The consequence is that the eigenvalue may be poorly predicted for certain reactor configurations. The transient methods are tested using a simple analytic test problem, a heterogeneous heavy water reactor benchmark problem, and three thermal hydraulic test problems. Results indicate that the transient methods have been implemented correctly.

  16. McVol - a program for calculating protein volumes and identifying cavities by a Monte Carlo algorithm.

    PubMed

    Till, Mirco S; Ullmann, G Matthias

    2010-03-01

    In this paper, we describe a Monte Carlo method for determining the volume of a molecule. A molecule is considered to consist of hard, overlapping spheres. The surface of the molecule is defined by rolling a probe sphere over the surface of the spheres. To determine the volume of the molecule, random points are placed in a three-dimensional box, which encloses the whole molecule. The volume of the molecule in relation to the volume of the box is estimated by calculating the ratio of the random points placed inside the molecule and the total number of random points that were placed. For computational efficiency, we use a grid-cell based neighbor list to determine whether a random point is placed inside the molecule or not. This method in combination with a graph-theoretical algorithm is used to detect internal cavities and surface clefts of molecules. Since cavities and clefts are potential water binding sites, we place water molecules in the cavities. The potential water positions can be used in molecular dynamics calculations as well as in other molecular calculations. We apply this method to several proteins and demonstrate the usefulness of the program. The described methods are all implemented in the program McVol, which is available free of charge from our website at http://www.bisb.uni-bayreuth.de/software.html .

  17. Stable sequential Kuhn-Tucker theorem in iterative form or a regularized Uzawa algorithm in a regular nonlinear programming problem

    NASA Astrophysics Data System (ADS)

    Sumin, M. I.

    2015-06-01

    A parametric nonlinear programming problem in a metric space with an operator equality constraint in a Hilbert space is studied assuming that its lower semicontinuous value function at a chosen individual parameter value has certain subdifferentiability properties in the sense of nonlinear (nonsmooth) analysis. Such subdifferentiability can be understood as the existence of a proximal subgradient or a Fréchet subdifferential. In other words, an individual problem has a corresponding generalized Kuhn-Tucker vector. Under this assumption, a stable sequential Kuhn-Tucker theorem in nondifferential iterative form is proved and discussed in terms of minimizing sequences on the basis of the dual regularization method. This theorem provides necessary and sufficient conditions for the stable construction of a minimizing approximate solution in the sense of Warga in the considered problem, whose initial data can be approximately specified. A substantial difference of the proved theorem from its classical same-named analogue is that the former takes into account the possible instability of the problem in the case of perturbed initial data and, as a consequence, allows for the inherited instability of classical optimality conditions. This theorem can be treated as a regularized generalization of the classical Uzawa algorithm to nonlinear programming problems. Finally, the theorem is applied to the "simplest" nonlinear optimal control problem, namely, to a time-optimal control problem.

  18. Effects of classroom instruction on students' understanding of quadratic equations

    NASA Astrophysics Data System (ADS)

    Vaiyavutjamai, Pongchawee; Clements, M. A. (Ken)

    2006-05-01

    Two hundred and thirty-one students in six Grade 9 classes in two government secondary schools located near Chiang Mai, Thailand, attempted to solve the same 18 quadratic equations before and after participating in 11 lessons on quadratic equations. Data from the students' written responses to the equations, together with data in the form of transcripts of 36 interviews with 18 interviewees (a high performer, a medium performer, and a low performer from each of the six classes), were analysed. Using a rubric for assessing students' understanding, the analysis revealed that at the post-teaching stage students improved their performance on quadratic equations and had a better understanding of associated concepts than they had at the pre-teaching stage. However, many were still confused about the concepts of a variable and of a "solution" to a quadratic equation. After the lessons, most students had acquired neither an instrumental nor a relational understanding of the mathematics associated with solving elementary quadratic equations.

  19. On Volterra quadratic stochastic operators with continual state space

    SciTech Connect

    Ganikhodjaev, Nasir; Hamzah, Nur Zatul Akmar

    2015-05-15

    Let (X,F) be a measurable space, and S(X,F) be the set of all probability measures on (X,F) where X is a state space and F is σ - algebraon X. We consider a nonlinear transformation (quadratic stochastic operator) defined by (Vλ)(A) = ∫{sub X}∫{sub X}P(x,y,A)dλ(x)dλ(y), where P(x, y, A) is regarded as a function of two variables x and y with fixed A ∈ F . A quadratic stochastic operator V is called a regular, if for any initial measure the strong limit lim{sub n→∞} V{sup n }(λ) is exists. In this paper, we construct a family of quadratic stochastic operators defined on the segment X = [0,1] with Borel σ - algebra F on X , prove their regularity and show that the limit measure is a Dirac measure.

  20. Symmetric quadratic Hamiltonians with pseudo-Hermitian matrix representation

    SciTech Connect

    Fernández, Francisco M.

    2016-06-15

    We prove that any symmetric Hamiltonian that is a quadratic function of the coordinates and momenta has a pseudo-Hermitian adjoint or regular matrix representation. The eigenvalues of the latter matrix are the natural frequencies of the Hamiltonian operator. When all the eigenvalues of the matrix are real, then the spectrum of the symmetric Hamiltonian is real and the operator is Hermitian. As illustrative examples we choose the quadratic Hamiltonians that model a pair of coupled resonators with balanced gain and loss, the electromagnetic self-force on an oscillating charged particle and an active LRC circuit. -- Highlights: •Symmetric quadratic operators are useful models for many physical applications. •Any such operator exhibits a pseudo-Hermitian matrix representation. •Its eigenvalues are the natural frequencies of the Hamiltonian operator. •The eigenvalues may be real or complex and describe a phase transition.

  1. Algorithms and Algorithmic Languages.

    ERIC Educational Resources Information Center

    Veselov, V. M.; Koprov, V. M.

    This paper is intended as an introduction to a number of problems connected with the description of algorithms and algorithmic languages, particularly the syntaxes and semantics of algorithmic languages. The terms "letter, word, alphabet" are defined and described. The concept of the algorithm is defined and the relation between the algorithm and…

  2. Singular linear quadratic control problem for systems with linear and constant delay

    NASA Astrophysics Data System (ADS)

    Sesekin, A. N.; Andreeva, I. Yu.; Shlyakhov, A. S.

    2016-12-01

    This article is devoted to the singular linear-quadratic optimization problem on the trajectories of the linear non-autonomous system of differential equations with linear and constant delay. It should be noted that such task does not solve the class of integrable controls, so to ensure the existence of a solution is needed to expand the class of controls to include the control impulse components. For the problem under consideration, we have built program control containing impulse components in the initial and final moments time. This is done under certain assumptions on the functional and the right side of the control system.

  3. A user oriented microcomputer facility for designing linear quadratic Gaussian feedback compensators

    NASA Technical Reports Server (NTRS)

    Houpt, P. K.; Wahid, J.; Johnson, T. L.; Ward, S. A.

    1978-01-01

    A laboratory design facility for digital microprocessor implementation of linear-quadratic-Gaussian feedback compensators is described. Outputs from user interactive programs for solving infinite time horizon LQ regulator and Kalman filter problems were conditioned for implementation on the laboratory microcomputer system. The software consisted of two parts: an offline high-level program for solving the LQ Ricatti equations and generating associated feedback and filter gains and a cross compiler/macro assembler which generates object code for the target microprocessor system. A PDP 11/70 with a UNIX operating system was used for all high level program and data management, and the target microprocessor system is an Intel MDS (8080-based processor). Application to the control of a two dimensional inverted pendulum is presented and issues in expanding the design/prototyping system to other target machine architectures are discussed.

  4. A Model for Quadratic Outliers in Linear Regression.

    ERIC Educational Resources Information Center

    Elashoff, Janet Dixon; Elashoff, Robert M.

    This paper introduces a model for describing outliers (observations which are extreme in some sense or violate the apparent pattern of other observations) in linear regression which can be viewed as a mixture of a quadratic and a linear regression. The maximum likelihood estimators of the parameters in the model are derived and their asymptotic…

  5. Unravelling Student Challenges with Quadratics: A Cognitive Approach

    ERIC Educational Resources Information Center

    Kotsopoulos, Donna

    2007-01-01

    The author's secondary school mathematics students have often reported to her that quadratic relations are one of the most conceptually challenging aspects of the high school curriculum. From her own classroom experiences there seemed to be several aspects to the students' challenges. Many students, even in their early secondary education, have…

  6. Tuning a fuzzy controller using quadratic response surfaces

    NASA Technical Reports Server (NTRS)

    Schott, Brian; Whalen, Thomas

    1992-01-01

    Response surface methodology, an alternative method to traditional tuning of a fuzzy controller, is described. An example based on a simulated inverted pendulum 'plant' shows that with (only) 15 trial runs, the controller can be calibrated using a quadratic form to approximate the response surface.

  7. Confidence set interference with a prior quadratic bound. [in geophysics

    NASA Technical Reports Server (NTRS)

    Backus, George E.

    1989-01-01

    Neyman's (1937) theory of confidence sets is developed as a replacement for Bayesian interference (BI) and stochastic inversion (SI) when the prior information is a hard quadratic bound. It is recommended that BI and SI be replaced by confidence set interference (CSI) only in certain circumstances. The geomagnetic problem is used to illustrate the general theory of CSI.

  8. Entanglement entropy of fermionic quadratic band touching model

    NASA Astrophysics Data System (ADS)

    Chen, Xiao; Cho, Gil Young; Fradkin, Eduardo

    2014-03-01

    The entanglement entropy has been proven to be a useful tool to diagnose and characterize strongly correlated systems such as topologically ordered phases and some critical points. Motivated by the successes, we study the entanglement entropy (EE) of a fermionic quadratic band touching model in (2 + 1) dimension. This is a fermionic ``spinor'' model with a finite DOS at k=0 and infinitesimal instabilities. The calculation on two-point correlation functions shows that a Dirac fermion model and the quadratic band touching model both have the asymptotically identical behavior in the long distance limit. This implies that EE for the quadratic band touching model also has an area law as the Dirac fermion. This is in contradiction with the expectation that dense fermi systems with a finite DOS should exhibit LlogL violations to the area law of entanglement entropy (L is the length of the boundary of the sub-region) by analogy with the Fermi surface. We performed numerical calculations of entanglement entropies on a torus of the lattice models for the quadratic band touching point and the Dirac fermion to confirm this. The numerical calculation shows that EE for both cases satisfy the area law. We further verify this result by the analytic calculation on the torus geometry. This work was supported in part by the NSF grant DMR-1064319.

  9. Visualising the Complex Roots of Quadratic Equations with Real Coefficients

    ERIC Educational Resources Information Center

    Bardell, Nicholas S.

    2012-01-01

    The roots of the general quadratic equation y = ax[superscript 2] + bx + c (real a, b, c) are known to occur in the following sets: (i) real and distinct; (ii) real and coincident; and (iii) a complex conjugate pair. Case (iii), which provides the focus for this investigation, can only occur when the values of the real coefficients a, b, and c are…

  10. Evaluating the Contributions of Individual Variables to a Quadratic Form.

    PubMed

    Garthwaite, Paul H; Koch, Inge

    2016-03-01

    Quadratic forms capture multivariate information in a single number, making them useful, for example, in hypothesis testing. When a quadratic form is large and hence interesting, it might be informative to partition the quadratic form into contributions of individual variables. In this paper it is argued that meaningful partitions can be formed, though the precise partition that is determined will depend on the criterion used to select it. An intuitively reasonable criterion is proposed and the partition to which it leads is determined. The partition is based on a transformation that maximises the sum of the correlations between individual variables and the variables to which they transform under a constraint. Properties of the partition, including optimality properties, are examined. The contributions of individual variables to a quadratic form are less clear-cut when variables are collinear, and forming new variables through rotation can lead to greater transparency. The transformation is adapted so that it has an invariance property under such rotation, whereby the assessed contributions are unchanged for variables that the rotation does not affect directly. Application of the partition to Hotelling's one- and two-sample test statistics, Mahalanobis distance and discriminant analysis is described and illustrated through examples. It is shown that bootstrap confidence intervals for the contributions of individual variables to a partition are readily obtained.

  11. Analysis of Quadratic Diophantine Equations with Fibonacci Number Solutions

    ERIC Educational Resources Information Center

    Leyendekkers, J. V.; Shannon, A. G.

    2004-01-01

    An analysis is made of the role of Fibonacci numbers in some quadratic Diophantine equations. A general solution is obtained for finding factors in sums of Fibonacci numbers. Interpretation of the results is facilitated by the use of a modular ring which also permits extension of the analysis.

  12. Beam steering and routing in quadratic nonlinear media

    SciTech Connect

    Aceves, A.B.; Santos, M.C.; Torner, L.

    1997-04-01

    We show how the spatial phase modulation of weak second-harmonic signals controls the overall direction of propagation of spatial solitons in quadratic nonlinear media. We investigate numerically such a process and discuss its applications to all-optical beam routing. 5 refs., 3 figs.

  13. Finding the Best Quadratic Approximation of a Function

    ERIC Educational Resources Information Center

    Yang, Yajun; Gordon, Sheldon P.

    2011-01-01

    This article examines the question of finding the best quadratic function to approximate a given function on an interval. The prototypical function considered is f(x) = e[superscript x]. Two approaches are considered, one based on Taylor polynomial approximations at various points in the interval under consideration, the other based on the fact…

  14. On the cost of approximating and recognizing a noise perturbed straight line or a quadratic curve segment in the plane. [central processing units

    NASA Technical Reports Server (NTRS)

    Cooper, D. B.; Yalabik, N.

    1975-01-01

    Approximation of noisy data in the plane by straight lines or elliptic or single-branch hyperbolic curve segments arises in pattern recognition, data compaction, and other problems. The efficient search for and approximation of data by such curves were examined. Recursive least-squares linear curve-fitting was used, and ellipses and hyperbolas are parameterized as quadratic functions in x and y. The error minimized by the algorithm is interpreted, and central processing unit (CPU) times for estimating parameters for fitting straight lines and quadratic curves were determined and compared. CPU time for data search was also determined for the case of straight line fitting. Quadratic curve fitting is shown to require about six times as much CPU time as does straight line fitting, and curves relating CPU time and fitting error were determined for straight line fitting. Results are derived on early sequential determination of whether or not the underlying curve is a straight line.

  15. Quadratic Blind Linear Unmixing: A Graphical User Interface for Tissue Characterization

    PubMed Central

    Gutierrez-Navarro, O.; Campos-Delgado, D.U.; Arce-Santana, E. R.; Jo, Javier A.

    2016-01-01

    Spectral unmixing is the process of breaking down data from a sample into its basic components and their abundances. Previous work has been focused on blind unmixing of multi-spectral fluorescence lifetime imaging microscopy (m-FLIM) datasets under a linear mixture model and quadratic approximations. This method provides a fast linear decomposition and can work without a limitation in the maximum number of components or end-members. Hence this work presents an interactive software which implements our blind end-member and abundance extraction (BEAE) and quadratic blind linear unmixing (QBLU) algorithms in Matlab. The options and capabilities of our proposed software are described in detail. When the number of components is known, our software can estimate the constitutive end-members and their abundances. When no prior knowledge is available, the software can provide a completely blind solution to estimate the number of components, the end-members and their abundances. The characterization of three case studies validates the performance of the new software: ex-vivo human coronary arteries, human breast cancer cell samples, and in-vivo hamster oral mucosa. The software is freely available in a hosted webpage by one of the developing institutions, and allows the user a quick, easy-to-use and efficient tool for multi/hyper-spectral data decomposition. PMID:26589467

  16. Quadratic blind linear unmixing: A graphical user interface for tissue characterization.

    PubMed

    Gutierrez-Navarro, O; Campos-Delgado, D U; Arce-Santana, E R; Jo, Javier A

    2016-02-01

    Spectral unmixing is the process of breaking down data from a sample into its basic components and their abundances. Previous work has been focused on blind unmixing of multi-spectral fluorescence lifetime imaging microscopy (m-FLIM) datasets under a linear mixture model and quadratic approximations. This method provides a fast linear decomposition and can work without a limitation in the maximum number of components or end-members. Hence this work presents an interactive software which implements our blind end-member and abundance extraction (BEAE) and quadratic blind linear unmixing (QBLU) algorithms in Matlab. The options and capabilities of our proposed software are described in detail. When the number of components is known, our software can estimate the constitutive end-members and their abundances. When no prior knowledge is available, the software can provide a completely blind solution to estimate the number of components, the end-members and their abundances. The characterization of three case studies validates the performance of the new software: ex-vivo human coronary arteries, human breast cancer cell samples, and in-vivo hamster oral mucosa. The software is freely available in a hosted webpage by one of the developing institutions, and allows the user a quick, easy-to-use and efficient tool for multi/hyper-spectral data decomposition.

  17. ACCEPT: a three-dimensional finite element program for large deformation elastic-plastic-creep analysis of pressurized tubes (LWBR/AWBA Development Program)

    SciTech Connect

    Hutula, D.N.; Wiancko, B.E.

    1980-03-01

    ACCEPT is a three-dimensional finite element computer program for analysis of large-deformation elastic-plastic-creep response of Zircaloy tubes subjected to temperature, surface pressures, and axial force. A twenty-mode, tri-quadratic, isoparametric element is used along with a Zircaloy materials model. A linear time-incremental procedure with residual force correction is used to solve for the time-dependent response. The program features an algorithm which automatically chooses the time step sizes to control the accuracy and numerical stability of the solution. A contact-separation capability allows modeling of interaction of reactor fuel rod cladding with fuel pellets or external supports.

  18. Robust reinforcement learning control using integral quadratic constraints for recurrent neural networks.

    PubMed

    Anderson, Charles W; Young, Peter Michael; Buehner, Michael R; Knight, James N; Bush, Keith A; Hittle, Douglas C

    2007-07-01

    The applicability of machine learning techniques for feedback control systems is limited by a lack of stability guarantees. Robust control theory offers a framework for analyzing the stability of feedback control loops, but for the integral quadratic constraint (IQC) framework used here, all components are required to be represented as linear, time-invariant systems plus uncertainties with, for IQCs used here, bounded gain. In this paper, the stability of a control loop including a recurrent neural network (NN) is analyzed by replacing the nonlinear and time-varying components of the NN with IQCs on their gain. As a result, a range of the NN's weights is found within which stability is guaranteed. An algorithm is demonstrated for training the recurrent NN using reinforcement learning and guaranteeing stability while learning.

  19. Internal combustion engine control for series hybrid electric vehicles by parallel and distributed genetic programming/multiobjective genetic algorithms

    NASA Astrophysics Data System (ADS)

    Gladwin, D.; Stewart, P.; Stewart, J.

    2011-02-01

    This article addresses the problem of maintaining a stable rectified DC output from the three-phase AC generator in a series-hybrid vehicle powertrain. The series-hybrid prime power source generally comprises an internal combustion (IC) engine driving a three-phase permanent magnet generator whose output is rectified to DC. A recent development has been to control the engine/generator combination by an electronically actuated throttle. This system can be represented as a nonlinear system with significant time delay. Previously, voltage control of the generator output has been achieved by model predictive methods such as the Smith Predictor. These methods rely on the incorporation of an accurate system model and time delay into the control algorithm, with a consequent increase in computational complexity in the real-time controller, and as a necessity relies to some extent on the accuracy of the models. Two complementary performance objectives exist for the control system. Firstly, to maintain the IC engine at its optimal operating point, and secondly, to supply a stable DC supply to the traction drive inverters. Achievement of these goals minimises the transient energy storage requirements at the DC link, with a consequent reduction in both weight and cost. These objectives imply constant velocity operation of the IC engine under external load disturbances and changes in both operating conditions and vehicle speed set-points. In order to achieve these objectives, and reduce the complexity of implementation, in this article a controller is designed by the use of Genetic Programming methods in the Simulink modelling environment, with the aim of obtaining a relatively simple controller for the time-delay system which does not rely on the implementation of real time system models or time delay approximations in the controller. A methodology is presented to utilise the miriad of existing control blocks in the Simulink libraries to automatically evolve optimal control

  20. Managing Algorithmic Skeleton Nesting Requirements in Realistic Image Processing Applications: The Case of the SKiPPER-II Parallel Programming Environment's Operating Model

    NASA Astrophysics Data System (ADS)

    Coudarcher, Rémi; Duculty, Florent; Serot, Jocelyn; Jurie, Frédéric; Derutin, Jean-Pierre; Dhome, Michel

    2005-12-01

    SKiPPER is a SKeleton-based Parallel Programming EnviRonment being developed since 1996 and running at LASMEA Laboratory, the Blaise-Pascal University, France. The main goal of the project was to demonstrate the applicability of skeleton-based parallel programming techniques to the fast prototyping of reactive vision applications. This paper deals with the special features embedded in the latest version of the project: algorithmic skeleton nesting capabilities and a fully dynamic operating model. Throughout the case study of a complete and realistic image processing application, in which we have pointed out the requirement for skeleton nesting, we are presenting the operating model of this feature. The work described here is one of the few reported experiments showing the application of skeleton nesting facilities for the parallelisation of a realistic application, especially in the area of image processing. The image processing application we have chosen is a 3D face-tracking algorithm from appearance.

  1. On the convergence of inexact Uzawa algorithms

    SciTech Connect

    Welfert, B.D.

    1994-12-31

    The author considers the solution of symmetric indefinite systems which can be cast in matrix block form, where diagonal blocks A and C are symmetric positive definite and semi-definite, respectively. Systems of this type arise frequently in quadratic minimization problems, as well as mixed finite element discretizations of fluid flow equation. The author uses the Uzawa algorithm to precondition the matrix equations.

  2. Solution of monotone complementarity and general convex programming problems using a modified potential reduction interior point method

    SciTech Connect

    Huang, Kuo -Ling; Mehrotra, Sanjay

    2016-11-08

    We present a homogeneous algorithm equipped with a modified potential function for the monotone complementarity problem. We show that this potential function is reduced by at least a constant amount if a scaled Lipschitz condition (SLC) is satisfied. A practical algorithm based on this potential function is implemented in a software package named iOptimize. The implementation in iOptimize maintains global linear and polynomial time convergence properties, while achieving practical performance. It either successfully solves the problem, or concludes that the SLC is not satisfied. When compared with the mature software package MOSEK (barrier solver version 6.0.0.106), iOptimize solves convex quadratic programming problems, convex quadratically constrained quadratic programming problems, and general convex programming problems in fewer iterations. Moreover, several problems for which MOSEK fails are solved to optimality. In addition, we also find that iOptimize detects infeasibility more reliably than the general nonlinear solvers Ipopt (version 3.9.2) and Knitro (version 8.0).

  3. NASA team algorithm for sea ice concentration retrieval from Defense Meteorological Satellite Program special sensor microwave imager - Comparison with Landsat satellite imagery

    NASA Technical Reports Server (NTRS)

    Steffen, Konrad; Schweiger, Axel

    1991-01-01

    The present study describes the validation of the the NASA team algorithm for the determination of sea ice concentrations from the Defense Meteorological Satellite Program special sensor microwave imager (SSM/I). A total of 28 cloud-free Landsat scenes were selected to permit validation of the passive microwave ice concentration algorithm for a range of ice concentrations and ice types. The sensitivity of the NASA team algorithm to the selection of locally and seasonally adjusted algorithm parameters is discussed. Mean absolute differences between SSM/I and Landsat ice concentrations are within 1 percent during fall using local and global tie points (standard deviations of the difference are +/-3.1 and +/-6.2 percent, respectively). In areas with greater amounts of nilas and young ice, the NASA team algorithm was found to underestimate ice concentrations by as much as 9 percent. It is inferred that the standard deviation between SSM/I and Landsat ice concentrations decreases from +/-7 to +/-5 percent with local tie points compared to the global ones for spring and fall.

  4. Dual format algorithm for monostatic SAR

    NASA Astrophysics Data System (ADS)

    Gorham, LeRoy A.; Rigling, Brian D.

    2010-04-01

    The polar format algorithm for monostatic synthetic aperture radar imaging is based on a linear approximation of the differential range to a scatterer, which leads to spatially-variant distortion and defocus in the resultant image. While approximate corrections may be applied to compensate for these effects, these corrections are ad-hoc in nature. Here, we introduce an alternative imaging algorithm called the Dual Format Algorithm (DFA) that provides better isolation of the defocus effects and reduces distortion. Quadratic phase errors are isolated along a single dimension by allowing image formation to an arbitrary grid instead of a Cartesian grid. This provides an opportunity for more efficient phase error corrections. We provide a description of the arbitrary image grid and we show the quadratic phase error correction derived from a second-order Taylor series approximation of the differential range. The algorithm is demonstrated with a point target simulation.

  5. Generic Optimization Program User Manual Version 3.0.0

    SciTech Connect

    Wetter, Michael

    2009-05-11

    GenOpt is an optimization program for the minimization of a cost function that is evaluated by an external simulation program. It has been developed for optimization problems where the cost function is computationally expensive and its derivatives are not available or may not even exist. GenOpt can be coupled to any simulation program that reads its input from text files and writes its output to text files. The independent variables can be continuous variables (possibly with lower and upper bounds), discrete variables, or both, continuous and discrete variables. Constraints on dependent variables can be implemented using penalty or barrier functions. GenOpt uses parallel computing to evaluate the simulations. GenOpt has a library with local and global multi-dimensional and one-dimensional optimization algorithms, and algorithms for doing parametric runs. An algorithm interface allows adding new minimization algorithms without knowing the details of the program structure. GenOpt is written in Java so that it is platform independent. The platform independence and the general interface make GenOpt applicable to a wide range of optimization problems. GenOpt has not been designed for linear programming problems, quadratic programming problems, and problems where the gradient of the cost function is available. For such problems, as well as for other problems, special tailored software exists that is more efficient.

  6. Interactive application of quadratic expansion of chi-square statistic to nonlinear curve fitting

    NASA Technical Reports Server (NTRS)

    Badavi, F. F.; Everhart, Joel L.

    1987-01-01

    This report contains a detailed theoretical description of an all-purpose, interactive curve-fitting routine that is based on P. R. Bevington's description of the quadratic expansion of the Chi-Square statistic. The method is implemented in the associated interactive, graphics-based computer program. Taylor's expansion of Chi-Square is first introduced, and justifications for retaining only the first term are presented. From the expansion, a set of n simultaneous linear equations is derived, then solved by matrix algebra. A brief description of the code is presented along with a limited number of changes that are required to customize the program of a particular task. To evaluate the performance of the method and the goodness of nonlinear curve fitting, two typical engineering problems are examined and the graphical and tabular output of each is discussed. A complete listing of the entire package is included as an appendix.

  7. QUADRATIC SERENDIPITY FINITE ELEMENTS ON POLYGONS USING GENERALIZED BARYCENTRIC COORDINATES.

    PubMed

    Rand, Alexander; Gillette, Andrew; Bajaj, Chandrajit

    2014-01-01

    We introduce a finite element construction for use on the class of convex, planar polygons and show it obtains a quadratic error convergence estimate. On a convex n-gon, our construction produces 2n basis functions, associated in a Lagrange-like fashion to each vertex and each edge midpoint, by transforming and combining a set of n(n + 1)/2 basis functions known to obtain quadratic convergence. The technique broadens the scope of the so-called 'serendipity' elements, previously studied only for quadrilateral and regular hexahedral meshes, by employing the theory of generalized barycentric coordinates. Uniform a priori error estimates are established over the class of convex quadrilaterals with bounded aspect ratio as well as over the class of convex planar polygons satisfying additional shape regularity conditions to exclude large interior angles and short edges. Numerical evidence is provided on a trapezoidal quadrilateral mesh, previously not amenable to serendipity constructions, and applications to adaptive meshing are discussed.

  8. Gravitomagnetic effects in quadratic gravity with a scalar field

    NASA Astrophysics Data System (ADS)

    Finch, Andrew; Said, Jackson Levi

    2016-10-01

    The two gravitomagnetic effects which influence bodies orbiting around a gravitational source are the geodetic effect and the Lense-Thirring effect. The former describes the precession angle of the axis of a spinning gyroscope while in orbit around a nonrotating gravitational source whereas the latter provides a correction for this angle in the case of a spinning source. In this paper we derive the relevant equations in quadratic gravity and relate them to their equivalents in general relativity. Starting with an investigation into Kepler's third law in quadratic gravity with a scalar field, the effects of an axisymmetric and rotating gravitational source on an orbiting body in a circular, equatorial orbit are introduced.

  9. Quadratic nonlinear Klein-Gordon equation in one dimension

    NASA Astrophysics Data System (ADS)

    Hayashi, Nakao; Naumkin, Pavel I.

    2012-10-01

    We study the initial value problem for the quadratic nonlinear Klein-Gordon equation vtt + v - vxx = λv2, t ∈ R, x ∈ R, with initial conditions v(0, x) = v0(x), vt(0, x) = v1(x), x ∈ R, where v0 and v1 are real-valued functions, λ ∈ R. Using the method of normal forms of Shatah ["Normal forms and quadratic nonlinear Klein-Gordon equations," Commun. Pure Appl. Math. 38, 685-696 (1985)], we obtain a sharp asymptotic behavior of small solutions without the condition of a compact support on the initial data, which was assumed in the previous work of J.-M. Delort ["Existence globale et comportement asymptotique pour l'équation de Klein-Gordon quasi-linéaire á données petites en dimension 1," Ann. Sci. Ec. Normale Super. 34(4), 1-61 (2001)].

  10. A generalized quadratic flow law for sheet metals

    NASA Astrophysics Data System (ADS)

    Jones, S. E.; Gillis, P. P.

    1984-01-01

    A planar quadratic flow law is proposed for anisotropic sheet materials. This law is similar to the anisotropic strength criterion of Tsai and Wu. It has six experimentally determinable coefficients as compared to four in Hill’s flow law and, thus, allows more experimental information to be accommodated. However, the resulting strain increment vector, while unique, is not necessarily normal to the flow surface.

  11. Quadratic and Cubic Nonlinear Oscillators with Damping and Their Applications

    NASA Astrophysics Data System (ADS)

    Li, Jibin; Feng, Zhaosheng

    We apply the qualitative theory of dynamical systems to study exact solutions and the dynamics of quadratic and cubic nonlinear oscillators with damping. Under certain parametric conditions, we also consider the van der Waals normal form, Chaffee-Infante equation, compound Burgers-KdV equation and Burgers-KdV equation for explicit representations of kink-profile wave solutions and unbounded traveling wave solutions.

  12. Quantum integrals of motion for variable quadratic Hamiltonians

    SciTech Connect

    Cordero-Soto, Ricardo; Suazo, Erwin; Suslov, Sergei K.

    2010-09-15

    We construct integrals of motion for several models of the quantum damped oscillators in a framework of a general approach to the time-dependent Schroedinger equation with variable quadratic Hamiltonians. An extension of the Lewis-Riesenfeld dynamical invariant is given. The time-evolution of the expectation values of the energy-related positive operators is determined for the oscillators under consideration. A proof of uniqueness of the corresponding Cauchy initial value problem is discussed as an application.

  13. Observers for Systems with Nonlinearities Satisfying an Incremental Quadratic Inequality

    NASA Technical Reports Server (NTRS)

    Acikmese, Ahmet Behcet; Corless, Martin

    2004-01-01

    We consider the problem of state estimation for nonlinear time-varying systems whose nonlinearities satisfy an incremental quadratic inequality. These observer results unifies earlier results in the literature; and extend it to some additional classes of nonlinearities. Observers are presented which guarantee that the state estimation error exponentially converges to zero. Observer design involves solving linear matrix inequalities for the observer gain matrices. Results are illustrated by application to a simple model of an underwater.

  14. Design of Linear Quadratic Regulators and Kalman Filters

    NASA Technical Reports Server (NTRS)

    Lehtinen, B.; Geyser, L.

    1986-01-01

    AESOP solves problems associated with design of controls and state estimators for linear time-invariant systems. Systems considered are modeled in state-variable form by set of linear differential and algebraic equations with constant coefficients. Two key problems solved by AESOP are linear quadratic regulator (LQR) design problem and steady-state Kalman filter design problem. AESOP is interactive. User solves design problems and analyzes solutions in single interactive session. Both numerical and graphical information available to user during the session.

  15. Quadratic performance index generation for optimal regular design.

    NASA Technical Reports Server (NTRS)

    Bullock, T. E.; Elder, J. M.

    1971-01-01

    Application of optimal control theory to practical problems has been limited by the difficulty of prescribing a performance index which accurately reflects design requirements. The task of deriving equivalent performance indices is considered in the present paper for a plant that is a completely controllable, scalar linear system with state feedback. A quadratic index is developed which leads to an optimal design performance satisfying some of the classical performance criteria.

  16. A computational algorithm for spacecraft control and momentum management

    NASA Technical Reports Server (NTRS)

    Dzielski, John; Bergmann, Edward; Paradiso, Joseph

    1990-01-01

    Developments in the area of nonlinear control theory have shown how coordinate changes in the state and input spaces of a dynamical system can be used to transform certain nonlinear differential equations into equivalent linear equations. These techniques are applied to the control of a spacecraft equipped with momentum exchange devices. An optimal control problem is formulated that incorporates a nonlinear spacecraft model. An algorithm is developed for solving the optimization problem using feedback linearization to transform to an equivalent problem involving a linear dynamical constraint and a functional approximation technique to solve for the linear dynamics in terms of the control. The original problem is transformed into an unconstrained nonlinear quadratic program that yields an approximate solution to the original problem. Two examples are presented to illustrate the results.

  17. Measurement of quadratic electrogyration effect in castor oil

    NASA Astrophysics Data System (ADS)

    Izdebski, Marek; Ledzion, Rafał; Górski, Piotr

    2015-07-01

    This work presents a detailed analysis of electrogyration measurement in liquids with the usage of an optical polarimetric technique. Theoretical analysis of the optical response to an applied electric field is illustrated by experimental data for castor oil which exhibits natural optical activity, quadratic electro-optic effect and quadratic electrogyration effect. Moreover, the experimental data show that interaction of the oil with a pair of flat electrodes induces a significant dichroism and natural linear birefringence. The combination of these effects occurring at the same time complicates the procedure of measurements. It has been found that a single measurement is insufficient to separate the contribution of the electrogyration effect, but it is possible on the basis of several measurements performed with various orientations of the polarizer and the analyser. The obtained average values of the quadratic electrogyration coefficient β13 in castor oil at room temperature are from - 0.92 ×10-22 to - 1.44 ×10-22m2V-2 depending on the origin of the oil. Although this study is focused on measurements in castor oil, the presented analysis is much more general.

  18. Analysis of Parallel Algorithms on SMP Node and Cluster of Workstations Using Parallel Programming Models with New Tile-based Method for Large Biological Datasets

    PubMed Central

    Shrimankar, D. D.; Sathe, S. R.

    2016-01-01

    Sequence alignment is an important tool for describing the relationships between DNA sequences. Many sequence alignment algorithms exist, differing in efficiency, in their models of the sequences, and in the relationship between sequences. The focus of this study is to obtain an optimal alignment between two sequences of biological data, particularly DNA sequences. The algorithm is discussed with particular emphasis on time, speedup, and efficiency optimizations. Parallel programming presents a number of critical challenges to application developers. Today’s supercomputer often consists of clusters of SMP nodes. Programming paradigms such as OpenMP and MPI are used to write parallel codes for such architectures. However, the OpenMP programs cannot be scaled for more than a single SMP node. However, programs written in MPI can have more than single SMP nodes. But such a programming paradigm has an overhead of internode communication. In this work, we explore the tradeoffs between using OpenMP and MPI. We demonstrate that the communication overhead incurs significantly even in OpenMP loop execution and increases with the number of cores participating. We also demonstrate a communication model to approximate the overhead from communication in OpenMP loops. Our results are astonishing and interesting to a large variety of input data files. We have developed our own load balancing and cache optimization technique for message passing model. Our experimental results show that our own developed techniques give optimum performance of our parallel algorithm for various sizes of input parameter, such as sequence size and tile size, on a wide variety of multicore architectures. PMID:27932868

  19. Analysis of Parallel Algorithms on SMP Node and Cluster of Workstations Using Parallel Programming Models with New Tile-based Method for Large Biological Datasets.

    PubMed

    Shrimankar, D D; Sathe, S R

    2016-01-01

    Sequence alignment is an important tool for describing the relationships between DNA sequences. Many sequence alignment algorithms exist, differing in efficiency, in their models of the sequences, and in the relationship between sequences. The focus of this study is to obtain an optimal alignment between two sequences of biological data, particularly DNA sequences. The algorithm is discussed with particular emphasis on time, speedup, and efficiency optimizations. Parallel programming presents a number of critical challenges to application developers. Today's supercomputer often consists of clusters of SMP nodes. Programming paradigms such as OpenMP and MPI are used to write parallel codes for such architectures. However, the OpenMP programs cannot be scaled for more than a single SMP node. However, programs written in MPI can have more than single SMP nodes. But such a programming paradigm has an overhead of internode communication. In this work, we explore the tradeoffs between using OpenMP and MPI. We demonstrate that the communication overhead incurs significantly even in OpenMP loop execution and increases with the number of cores participating. We also demonstrate a communication model to approximate the overhead from communication in OpenMP loops. Our results are astonishing and interesting to a large variety of input data files. We have developed our own load balancing and cache optimization technique for message passing model. Our experimental results show that our own developed techniques give optimum performance of our parallel algorithm for various sizes of input parameter, such as sequence size and tile size, on a wide variety of multicore architectures.

  20. Deceptiveness and genetic algorithm dynamics

    SciTech Connect

    Liepins, G.E. ); Vose, M.D. )

    1990-01-01

    We address deceptiveness, one of at least four reasons genetic algorithms can fail to converge to function optima. We construct fully deceptive functions and other functions of intermediate deceptiveness. For the fully deceptive functions of our construction, we generate linear transformations that induce changes of representation to render the functions fully easy. We further model genetic algorithm selection recombination as the interleaving of linear and quadratic operators. Spectral analysis of the underlying matrices allows us to draw preliminary conclusions about fixed points and their stability. We also obtain an explicit formula relating the nonuniform Walsh transform to the dynamics of genetic search. 21 refs.

  1. Developing an Understanding of Quadratics through the Use of Concrete Manipulatives: A Case Study Analysis of the Metacognitive Development of a High School Student with Learning Disabilities

    ERIC Educational Resources Information Center

    Strickland, Tricia K.

    2014-01-01

    This case study analyzed the impact of a concrete manipulative program on the understanding of quadratic expressions for a high school student with a learning disability. The manipulatives were utilized as part of the Concrete-Representational-Abstract Integration (CRA-I) intervention in which participants engaged in tasks requiring them to…

  2. Deformable modeling using a 3D boundary representation with quadratic constraints on the branching structure of the Blum skeleton.

    PubMed

    Yushkevich, Paul A; Zhang, Hui Gary

    2013-01-01

    We propose a new approach for statistical shape analysis of 3D anatomical objects based on features extracted from skeletons. Like prior work on medial representations, the approach involves deforming a template to target shapes in a way that preserves the branching structure of the skeleton and provides intersubject correspondence. However, unlike medial representations, which parameterize the skeleton surfaces explicitly, our representation is boundary-centric, and the skeleton is implicit. Similar to prior constrained modeling methods developed 2D objects or tube-like 3D objects, we impose symmetry constraints on tuples of boundary points in a way that guarantees the preservation of the skeleton's topology under deformation. Once discretized, the problem of deforming a template to a target shape is formulated as a quadratically constrained quadratic programming problem. The new technique is evaluated in terms of its ability to capture the shape of the corpus callosum tract extracted from diffusion-weighted MRI.

  3. PIFCGT: A PIF autopilot design program for general aviation aircraft

    NASA Technical Reports Server (NTRS)

    Broussard, J. R.

    1983-01-01

    This report documents the PIFCGT computer program. In FORTRAN, PIFCGT is a computer design aid for determing Proportional-Integral-Filter (PIF) control laws for aircraft autopilots implemented with a Command Generator Tracker (CGT). The program uses Linear-Quadratic-Regulator synthesis algorithms to determine feedback gains, and includes software to solve the feedforward matrix equation which is useful in determining the command generator tracker feedforward gains. The program accepts aerodynamic stability derivatives and computes the corresponding aerodynamic linear model. The nine autopilot modes that can be designed include four maneuver modes (ROLL SEL, PITCH SEL, HDG SEL, ALT SEL), four final approach models (APR GS, APR LOCI, APR LOCR, APR LOCP), and a BETA HOLD mode. The program has been compiled and executed on a CDC computer.

  4. Linear Programming and Genetic Algorithm Based Optimization for the Weighting Scheme of a Value Focused Thinking Hierarchy

    DTIC Science & Technology

    2007-11-02

    scarce resources ( Bazaraa vii). The modeling capabilities linear programming provides has made it a success in many fields of study. Since the...Planning and Programming of Facility Construction Projects. 12 May 1994. Bazaraa , Mokhtar S., John J Jarvis and Hanif D. Sherali. Linear Programming

  5. Mass Conservation and Positivity Preservation with Ensemble-type Kalman Filter Algorithms

    NASA Technical Reports Server (NTRS)

    Janjic, Tijana; McLaughlin, Dennis B.; Cohn, Stephen E.; Verlaan, Martin

    2013-01-01

    Maintaining conservative physical laws numerically has long been recognized as being important in the development of numerical weather prediction (NWP) models. In the broader context of data assimilation, concerted efforts to maintain conservation laws numerically and to understand the significance of doing so have begun only recently. In order to enforce physically based conservation laws of total mass and positivity in the ensemble Kalman filter, we incorporate constraints to ensure that the filter ensemble members and the ensemble mean conserve mass and remain nonnegative through measurement updates. We show that the analysis steps of ensemble transform Kalman filter (ETKF) algorithm and ensemble Kalman filter algorithm (EnKF) can conserve the mass integral, but do not preserve positivity. Further, if localization is applied or if negative values are simply set to zero, then the total mass is not conserved either. In order to ensure mass conservation, a projection matrix that corrects for localization effects is constructed. In order to maintain both mass conservation and positivity preservation through the analysis step, we construct a data assimilation algorithms based on quadratic programming and ensemble Kalman filtering. Mass and positivity are both preserved by formulating the filter update as a set of quadratic programming problems that incorporate constraints. Some simple numerical experiments indicate that this approach can have a significant positive impact on the posterior ensemble distribution, giving results that are more physically plausible both for individual ensemble members and for the ensemble mean. The results show clear improvements in both analyses and forecasts, particularly in the presence of localized features. Behavior of the algorithm is also tested in presence of model error.

  6. A Generalized National Planning Approach for Admission Capacity in Higher Education: A Nonlinear Integer Goal Programming Model with a Novel Differential Evolution Algorithm

    PubMed Central

    El-Qulity, Said Ali; Mohamed, Ali Wagdy

    2016-01-01

    This paper proposes a nonlinear integer goal programming model (NIGPM) for solving the general problem of admission capacity planning in a country as a whole. The work aims to satisfy most of the required key objectives of a country related to the enrollment problem for higher education. The system general outlines are developed along with the solution methodology for application to the time horizon in a given plan. The up-to-date data for Saudi Arabia is used as a case study and a novel evolutionary algorithm based on modified differential evolution (DE) algorithm is used to solve the complexity of the NIGPM generated for different goal priorities. The experimental results presented in this paper show their effectiveness in solving the admission capacity for higher education in terms of final solution quality and robustness. PMID:26819583

  7. A Generalized National Planning Approach for Admission Capacity in Higher Education: A Nonlinear Integer Goal Programming Model with a Novel Differential Evolution Algorithm.

    PubMed

    El-Qulity, Said Ali; Mohamed, Ali Wagdy

    2016-01-01

    This paper proposes a nonlinear integer goal programming model (NIGPM) for solving the general problem of admission capacity planning in a country as a whole. The work aims to satisfy most of the required key objectives of a country related to the enrollment problem for higher education. The system general outlines are developed along with the solution methodology for application to the time horizon in a given plan. The up-to-date data for Saudi Arabia is used as a case study and a novel evolutionary algorithm based on modified differential evolution (DE) algorithm is used to solve the complexity of the NIGPM generated for different goal priorities. The experimental results presented in this paper show their effectiveness in solving the admission capacity for higher education in terms of final solution quality and robustness.

  8. Meta-Heuristic Combining Prior Online and Offline Information for the Quadratic Assignment Problem.

    PubMed

    Sun, Jianyong; Zhang, Qingfu; Yao, Xin

    2014-03-01

    The construction of promising solutions for NP-hard combinatorial optimization problems (COPs) in meta-heuristics is usually based on three types of information, namely a priori information, a posteriori information learned from visited solutions during the search procedure, and online information collected in the solution construction process. Prior information reflects our domain knowledge about the COPs. Extensive domain knowledge can surely make the search effective, yet it is not always available. Posterior information could guide the meta-heuristics to globally explore promising search areas, but it lacks local guidance capability. On the contrary, online information can capture local structures, and its application can help exploit the search space. In this paper, we studied the effects of using this information on metaheuristic's algorithmic performances for the COPs. The study was illustrated by a set of heuristic algorithms developed for the quadratic assignment problem. We first proposed an improved scheme to extract online local information, then developed a unified framework under which all types of information can be combined readily. Finally, we studied the benefits of the three types of information to meta-heuristics. Conclusions were drawn from the comprehensive study, which can be used as principles to guide the design of effective meta-heuristic in the future.

  9. ORACLS: A system for linear-quadratic-Gaussian control law design

    NASA Technical Reports Server (NTRS)

    Armstrong, E. S.

    1978-01-01

    A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

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

    PubMed Central

    Kupinski, M. K.; Clarkson, E.

    2015-01-01

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

  11. Complex complete quadratic combination method for damped system with repeated eigenvalues

    NASA Astrophysics Data System (ADS)

    Yu, Ruifang; Zhou, Xiyuan; Abduwaris, Abduwahit

    2016-09-01

    A new response-spectrum mode superposition method, entirely in real value form, is developed to analyze the maximum structural response under earthquake ground motion for generally damped linear systems with repeated eigenvalues and defective eigenvectors. This algorithm has clear physical concepts and is similar to the complex complete quadratic combination (CCQC) method previously established. Since it can consider the effect of repeated eigenvalues, it is called the CCQC-R method, in which the correlation coefficients of high-order modal responses are enclosed in addition to the correlation coefficients in the normal CCQC method. As a result, the formulas for calculating the correlation coefficients of high-order modal responses are deduced in this study, including displacement, velocity and velocity-displacement correlation coefficients. Furthermore, the relationship between high-order displacement and velocity covariance is derived to make the CCQC-R algorithm only relevant to the high-order displacement response spectrum. Finally, a practical step-by-step integration procedure for calculating high-order displacement response spectrum is obtained by changing the earthquake ground motion input, which is evaluated by comparing it to the theory solution under the sine-wave input. The method derived here is suitable for generally linear systems with classical or non-classical damping.

  12. Asymmetric Simple Exclusion Process with Open Boundaries and Quadratic Harnesses

    NASA Astrophysics Data System (ADS)

    Bryc, Włodek; Wesołowski, Jacek

    2017-02-01

    We show that the joint probability generating function of the stationary measure of a finite state asymmetric exclusion process with open boundaries can be expressed in terms of joint moments of Markov processes called quadratic harnesses. We use our representation to prove the large deviations principle for the total number of particles in the system. We use the generator of the Markov process to show how explicit formulas for the average occupancy of a site arise for special choices of parameters. We also give similar representations for limits of stationary measures as the number of sites tends to infinity.

  13. Rigorous performance bounds for quadratic and nested dynamical decoupling

    SciTech Connect

    Xia, Yuhou; Uhrig, Goetz S.; Lidar, Daniel A.

    2011-12-15

    We present rigorous performance bounds for the quadratic dynamical decoupling pulse sequence which protects a qubit from general decoherence, and for its nested generalization to an arbitrary number of qubits. Our bounds apply under the assumptions of instantaneous pulses and of bounded perturbing environment and qubit-environment Hamiltonians such as those realized by baths of nuclear spins in quantum dots. We prove that if the total sequence time is fixed then the trace-norm distance between the unperturbed and protected system states can be made arbitrarily small by increasing the number of applied pulses.

  14. Reaction Wheel Control Design Using Linear Quadratic Controller

    NASA Astrophysics Data System (ADS)

    Nubli Muhamad, Nur; Susanto, Erwin; Syihabuddin, Budi; Prasetya Dwi Wibawa, Ig.

    2016-01-01

    This paper studies the design of active attitude control system of a nanosatellite in a single axis. In this paper, we consider dc motor based reaction wheel as an actuator, because of its pointing accuracy. However, the power consumption of the dc motor is often relatively large and needed to be optimized. Linear quadratic controller is supposed to have an ability to minimize power consumption and able to enhance the system performance. To show the advantage of this method, simulation result of attitude response, state trajectory, and trajectory of DC motor voltage are presented.

  15. On a quadratic transformation due to Kummer and its generalizations

    NASA Astrophysics Data System (ADS)

    Shekhawat, Nidhi; Rathie, Arjun K.; Prakash, Om

    2016-05-01

    The aim of this paper is to obtain explicit expressions of (1-x ) -a2F1[a ,b 2 b +j ; -2/x 1 -x ] for j = 0, ±1,…, ±9. For j = 0, we have a well-known quadratic transformations formula of Kummer. The results are obtained by using the known hypergeometric identities available in the literature. Several known results obtained earlier by Kim, et al. follow special cases of our main findings. The results derived in this paper are simple, interesting and potentially useful in the applicable sciences.

  16. On stability of the Kasner solution in quadratic gravity

    NASA Astrophysics Data System (ADS)

    Toporensky, A.; Müller, D.

    2017-01-01

    We consider the dynamics of a flat anisotropic Universe filled by a perfect fluid near a cosmological singularity in quadratic gravity. Two possible regimes are described—the Kasner anisotropic solution and an isotropic "vacuum radiation" solution which has three sub cases depending on whether the equation of state parameter w is bigger, smaller or equals to 1 / 3. Initial conditions for numerical integrations have been chosen near a General Relativity anisotropic solution with matter (Jacobs solution). We have found that for such initial conditions there is a range of values of the coupling constants so that the resulting cosmological singularity is isotropic.

  17. Compact stellar models obeying quadratic equation of state

    NASA Astrophysics Data System (ADS)

    Bhar, Piyali; Singh, Ksh. Newton; Pant, Neeraj

    2016-10-01

    In present paper we obtain a new model of compact star by considering quadratic equation of state for the matter distribution and assuming a physically reasonable choice for metric coefficient g_{rr}. The solution is singularity free and well behaved inside the stellar interior. Several features are described analytically as well as graphically. From our analysis we have shown that our model is compatible with the observational data of the compact stars. We have discussed a detail analysis of neutron star PSR J1614-2230 via different graphs after determining all the constant parameters from boundary conditions.

  18. Singular linear-quadratic control problem for systems with linear delay

    SciTech Connect

    Sesekin, A. N.

    2013-12-18

    A singular linear-quadratic optimization problem on the trajectories of non-autonomous linear differential equations with linear delay is considered. The peculiarity of this problem is the fact that this problem has no solution in the class of integrable controls. To ensure the existence of solutions is required to expand the class of controls including controls with impulse components. Dynamical systems with linear delay are used to describe the motion of pantograph from the current collector with electric traction, biology, etc. It should be noted that for practical problems fact singularity criterion of quality is quite commonly occurring, and therefore the study of these problems is surely important. For the problem under discussion optimal programming control contained impulse components at the initial and final moments of time is constructed under certain assumptions on the functional and the right side of the control system.

  19. Discrete approximations of detonation flows with structured detonation reaction zones by discontinuous front models: A program burn algorithm based on detonation shock dynamics

    SciTech Connect

    Bdzil, J.B.; Jackson, T.L.; Stewart, D.S.

    1999-02-02

    In the design of explosive systems the generic problem that one must consider is the propagation of a well-developed detonation wave sweeping through an explosive charge with a complex shape. At a given instant of time the lead detonation shock is a surface that occupies a region of the explosive and has a dimension that is characteristic of the explosive device, typically on the scale of meters. The detonation shock is powered by a detonation reaction zone, sitting immediately behind the shock, which is on the scale of 1 millimeter or less. Thus, the ratio of the reaction zone thickness to the device dimension is of the order of 1/1,000 or less. This scale disparity can lead to great difficulties in computing three-dimensional detonation dynamics. An attack on the dilemma for the computation of detonation systems has lead to the invention of sub-scale models for a propagating detonation front that they refer to herein as program burn models. The program burn model seeks not to resolve the fine scale of the reaction zone in the sense of a DNS simulation. The goal of a program burn simulation is to resolve the hydrodynamics in the inert product gases on a grid much coarser than that required to resolve a physical reaction zone. The authors first show that traditional program burn algorithms for detonation hydrocodes used for explosive design are inconsistent and yield incorrect shock dynamic behavior. To overcome these inconsistencies, they are developing a new class of program burn models based on detonation shock dynamic (DSD) theory. It is hoped that this new class will yield a consistent and robust algorithm which reflects the correct shock dynamic behavior.

  20. Verifying a Computer Algorithm Mathematically.

    ERIC Educational Resources Information Center

    Olson, Alton T.

    1986-01-01

    Presents an example of mathematics from an algorithmic point of view, with emphasis on the design and verification of this algorithm. The program involves finding roots for algebraic equations using the half-interval search algorithm. The program listing is included. (JN)

  1. Hidden and Nonstandard Bifurcation Diagram of an Alternate Quadratic System

    NASA Astrophysics Data System (ADS)

    Pastor, G.; Romera, M.; Danca, M.-F.; Martin, A.; Orue, A. B.; Montoya, F.; Encinas, L. Hernández

    Alternate quadratic systems A : xn+1 = 1 - axn2,if n is even 1 - a∗xn2,if n is odd andB : xn+1 = 1 - a∗xn2,if n is even 1 - axn2, if n is odd, where a and a∗ are different parameters, seem to be interval maps in a range of the parameter values. However, after a careful graphical analysis of their bifurcation diagrams we conclude that this is true only for system B, but not for system A. In system A we find a hidden and nonstandard bifurcation diagram (“hidden” because it is not visible at normal resolution and “nonstandard” because the bifurcation diagram is empty for some ranges of the parameter values). The different behavior of the underlying critical polynomial in the range of parameter values in both alternate quadratic systems explains why the hidden and nonstandard bifurcation diagram is present in system A and not in system B. The analysis of the Lyapunov exponent also shows both the existence and the different behavior of the hidden bifurcation diagram of system A.

  2. Quadratic Reciprocity and the Group Orders of Particle States

    SciTech Connect

    DAI,YANG; BORISOV,ALEXEY B.; LONGWORTH,JAMES W.; BOYER,KEITH; RHODES,CHARLES K.

    2001-06-01

    The construction of inverse states in a finite field F{sub P{sub P{alpha}}} enables the organization of the mass scale by associating particle states with residue class designations. With the assumption of perfect flatness ({Omega}total = 1.0), this approach leads to the derivation of a cosmic seesaw congruence which unifies the concepts of space and mass. The law of quadratic reciprocity profoundly constrains the subgroup structure of the multiplicative group of units F{sub P{sub {alpha}}}* defined by the field. Four specific outcomes of this organization are (1) a reduction in the computational complexity of the mass state distribution by a factor of {approximately}10{sup 30}, (2) the extension of the genetic divisor concept to the classification of subgroup orders, (3) the derivation of a simple numerical test for any prospective mass number based on the order of the integer, and (4) the identification of direct biological analogies to taxonomy and regulatory networks characteristic of cellular metabolism, tumor suppression, immunology, and evolution. It is generally concluded that the organizing principle legislated by the alliance of quadratic reciprocity with the cosmic seesaw creates a universal optimized structure that functions in the regulation of a broad range of complex phenomena.

  3. Wave propagation in elastic medium with heterogeneous quadratic nonlinearity

    SciTech Connect

    Tang Guangxin; Jacobs, Laurence J.; Qu Jianmin

    2011-06-23

    This paper studies the one-dimensional wave propagation in an elastic medium with spatially non-uniform quadratic nonlinearity. Two problems are solved analytically. One is for a time-harmonic wave propagating in a half-space where the displacement is prescribed on the surface of the half-space. It is found that spatial non-uniformity of the material nonlinearity causes backscattering of the second order harmonic, which when combined with the forward propagating waves generates a standing wave in steady-state wave motion. The second problem solved is the reflection from and transmission through a layer of finite thickness embedded in an otherwise linearly elastic medium of infinite extent, where it is assumed that the layer has a spatially non-uniform quadratic nonlinearity. The results show that the transmission coefficient for the second order harmonic is proportional to the spatial average of the nonlinearity across the thickness of the layer, independent of the spatial distribution of the nonlinearity. On the other hand, the coefficient of reflection is proportional to a weighted average of the nonlinearity across the layer thickness. The weight function in this weighted average is related to the propagating phase, thus making the coefficient of reflection dependent on the spatial distribution of the nonlinearity. Finally, the paper concludes with some discussions on how to use the reflected and transmitted second harmonic waves to evaluate the variance and autocorrelation length of nonlinear parameter {beta} when the nonlinearity distribution in the layer is a stochastic process.

  4. An Instability Index Theory for Quadratic Pencils and Applications

    NASA Astrophysics Data System (ADS)

    Bronski, Jared; Johnson, Mathew A.; Kapitula, Todd

    2014-04-01

    Primarily motivated by the stability analysis of nonlinear waves in second-order in time Hamiltonian systems, in this paper we develop an instability index theory for quadratic operator pencils acting on a Hilbert space. In an extension of the known theory for linear pencils, explicit connections are made between the number of eigenvalues of a given quadratic operator pencil with positive real parts to spectral information about the individual operators comprising the coefficients of the spectral parameter in the pencil. As an application, we apply the general theory developed here to yield spectral and nonlinear stability/instability results for abstract second-order in time wave equations. More specifically, we consider the problem of the existence and stability of spatially periodic waves for the "good" Boussinesq equation. In the analysis our instability index theory provides an explicit, and somewhat surprising, connection between the stability of a given periodic traveling wave solution of the "good" Boussinesq equation and the stability of the same periodic profile, but with different wavespeed, in the nonlinear dynamics of a related generalized Korteweg-de Vries equation.

  5. Confidence set inference with a prior quadratic bound

    NASA Technical Reports Server (NTRS)

    Backus, George E.

    1989-01-01

    In the uniqueness part of a geophysical inverse problem, the observer wants to predict all likely values of P unknown numerical properties z=(z sub 1,...,z sub p) of the earth from measurement of D other numerical properties y (sup 0) = (y (sub 1) (sup 0), ..., y (sub D (sup 0)), using full or partial knowledge of the statistical distribution of the random errors in y (sup 0). The data space Y containing y(sup 0) is D-dimensional, so when the model space X is infinite-dimensional the linear uniqueness problem usually is insoluble without prior information about the correct earth model x. If that information is a quadratic bound on x, Bayesian inference (BI) and stochastic inversion (SI) inject spurious structure into x, implied by neither the data nor the quadratic bound. Confidence set inference (CSI) provides an alternative inversion technique free of this objection. Confidence set inference is illustrated in the problem of estimating the geomagnetic field B at the core-mantle boundary (CMB) from components of B measured on or above the earth's surface.

  6. Electric current quadratic in an applied electric field

    NASA Astrophysics Data System (ADS)

    Deyo, Eric

    The theory of the photogalvanic effect in a low frequency electric field is developed. We complete the semiclassical theory of the effect in bulk samples lacking inversion symmetry, taking into account contributions from the asymmetry of scattering, the shift current, and the effect of Berry's phase. We consider the effect in such samples both in the presence and absence of a constant magnetic field. It is found that by experimentally measuring this effect, that Berry's curvature and the average shift of the center of mass of an electron during a scattering event can be extracted. We also investigate the magnetic field dependence of the part of the electrical current which is quadratic in voltage in mesoscopic conductors. We find that the part of the current which is quadratic in bias voltage, and linear in an applied magnetic field can be related to the effective electron-electron interaction strength. We also find that in the case when the magnetic field is oriented parallel to the plane of a two dimensional sample, that the spin-orbit scattering rate can be measured.

  7. Measuring Students' Acceptance and Confidence in Algorithms and Programming: The Impact of Engagement with CS on Greek Secondary Education

    ERIC Educational Resources Information Center

    Doukakis, Spyros; Giannakos, Michail N.; Koilias, Christos; Vlamos, Panayiotis

    2013-01-01

    This paper presents results of a questionnaire focused on investigating students' confidence and behavioral intention in the area of programming, particularly that of structures, problem solving, and programming commands (Conditional--Loop). Responses from 116 1st year students regarding informatics were used. The results indicate that the…

  8. ORACLS - A modern control theory design package. [Optimal Regulator Algorithms for Control of Linear Systems computer program

    NASA Technical Reports Server (NTRS)

    Armstrong, E. S.

    1975-01-01

    A digital computer program (ORACLS) for implementing the optimal regulator theory approach to the design of controllers for linear time-invariant systems is described. The user-oriented program employs the latest numerical techniques and is applicable to both the digital and continuous control problems.

  9. An efficient and accurate solution methodology for bilevel multi-objective programming problems using a hybrid evolutionary-local-search algorithm.

    PubMed

    Deb, Kalyanmoy; Sinha, Ankur

    2010-01-01

    Bilevel optimization problems involve two optimization tasks (upper and lower level), in which every feasible upper level solution must correspond to an optimal solution to a lower level optimization problem. These problems commonly appear in many practical problem solving tasks including optimal control, process optimization, game-playing strategy developments, transportation problems, and others. However, they are commonly converted into a single level optimization problem by using an approximate solution procedure to replace the lower level optimization task. Although there exist a number of theoretical, numerical, and evolutionary optimization studies involving single-objective bilevel programming problems, not many studies look at the context of multiple conflicting objectives in each level of a bilevel programming problem. In this paper, we address certain intricate issues related to solving multi-objective bilevel programming problems, present challenging test problems, and propose a viable and hybrid evolutionary-cum-local-search based algorithm as a solution methodology. The hybrid approach performs better than a number of existing methodologies and scales well up to 40-variable difficult test problems used in this study. The population sizing and termination criteria are made self-adaptive, so that no additional parameters need to be supplied by the user. The study indicates a clear niche of evolutionary algorithms in solving such difficult problems of practical importance compared to their usual solution by a computationally expensive nested procedure. The study opens up many issues related to multi-objective bilevel programming and hopefully this study will motivate EMO and other researchers to pay more attention to this important and difficult problem solving activity.

  10. Effects of quadratic and cubic nonlinearities on a perfectly tuned parametric amplifier

    NASA Astrophysics Data System (ADS)

    Neumeyer, S.; Sorokin, V. S.; Thomsen, J. J.

    2017-01-01

    We consider the performance of a parametric amplifier with perfect tuning (two-to-one ratio between the parametric and direct excitation frequencies) and quadratic and cubic nonlinearities. A forced Duffing-Mathieu equation with appended quadratic nonlinearity is considered as the model system, and approximate analytical steady-state solutions and corresponding stabilities are obtained by the method of varying amplitudes. Some general effects of pure quadratic, and mixed quadratic and cubic nonlinearities on parametric amplification are shown. In particular, the effects of mixed quadratic and cubic nonlinearities may generate additional amplitude-frequency solutions. In this case an increased response and a more phase sensitive amplitude (phase between excitation frequencies) is obtained, as compared to the case with either pure quadratic or cubic nonlinearity. Furthermore, jumps and bi-stability in the amplitude-phase characteristics are predicted, supporting previously reported experimental observations.

  11. Performance Trend of Different Algorithms for Structural Design Optimization

    NASA Technical Reports Server (NTRS)

    Patnaik, Surya N.; Coroneos, Rula M.; Guptill, James D.; Hopkins, Dale A.

    1996-01-01

    Nonlinear programming algorithms play an important role in structural design optimization. Fortunately, several algorithms with computer codes are available. At NASA Lewis Research Center, a project was initiated to assess performance of different optimizers through the development of a computer code CometBoards. This paper summarizes the conclusions of that research. CometBoards was employed to solve sets of small, medium and large structural problems, using different optimizers on a Cray-YMP8E/8128 computer. The reliability and efficiency of the optimizers were determined from the performance of these problems. For small problems, the performance of most of the optimizers could be considered adequate. For large problems however, three optimizers (two sequential quadratic programming routines, DNCONG of IMSL and SQP of IDESIGN, along with the sequential unconstrained minimizations technique SUMT) outperformed others. At optimum, most optimizers captured an identical number of active displacement and frequency constraints but the number of active stress constraints differed among the optimizers. This discrepancy can be attributed to singularity conditions in the optimization and the alleviation of this discrepancy can improve the efficiency of optimizers.

  12. Comparative Evaluation of Different Optimization Algorithms for Structural Design Applications

    NASA Technical Reports Server (NTRS)

    Patnaik, Surya N.; Coroneos, Rula M.; Guptill, James D.; Hopkins, Dale A.

    1996-01-01

    Non-linear programming algorithms play an important role in structural design optimization. Fortunately, several algorithms with computer codes are available. At NASA Lewis Research Centre, a project was initiated to assess the performance of eight different optimizers through the development of a computer code CometBoards. This paper summarizes the conclusions of that research. CometBoards was employed to solve sets of small, medium and large structural problems, using the eight different optimizers on a Cray-YMP8E/8128 computer. The reliability and efficiency of the optimizers were determined from the performance of these problems. For small problems, the performance of most of the optimizers could be considered adequate. For large problems, however, three optimizers (two sequential quadratic programming routines, DNCONG of IMSL and SQP of IDESIGN, along with Sequential Unconstrained Minimizations Technique SUMT) outperformed others. At optimum, most optimizers captured an identical number of active displacement and frequency constraints but the number of active stress constraints differed among the optimizers. This discrepancy can be attributed to singularity conditions in the optimization and the alleviation of this discrepancy can improve the efficiency of optimizers.

  13. Dual format algorithm implementation with gotcha data

    NASA Astrophysics Data System (ADS)

    Gorham, LeRoy A.; Rigling, Brian D.

    2012-05-01

    The Dual Format Algorithm (DFA) is an alternative to the Polar Format Algorithm (PFA) where the image is formed first to an arbitrary grid instead of a Cartesian grid. The arbitrary grid is specifically chosen to allow for more efficient application of defocus and distortion corrections that occur due to range curvature. We provide a description of the arbitrary image grid and show that the quadratic phase errors are isolated along a single dimension of the image. We describe an application of the DFA to circular SAR data and analyze the image focus. For an example SAR dataset, the DFA doubles the focused image size of the PFA algorithm with post imaging corrections.

  14. Minimal marker: an algorithm and computer program for the identification of minimal sets of discriminating DNA markers for efficient variety identification.

    PubMed

    Fujii, Hiroshi; Ogata, Tatsushi; Shimada, Takehiko; Endo, Tomoko; Iketani, Hiroyuki; Shimizu, Tokurou; Yamamoto, Toshiya; Omura, Mitsuo

    2013-04-01

    DNA markers are frequently used to analyze crop varieties, with the coded marker data summarized in a computer-generated table. Such summary tables often provide extraneous data about individual crop genotypes, needlessly complicating and prolonging DNA-based differentiation between crop varieties. At present, it is difficult to identify minimal marker sets--the smallest sets that can distinguish between all crop varieties listed in a marker-summary table--due to the absence of algorithms capable of such characterization. Here, we describe the development of just such an algorithm and MinimalMarker, its accompanying Perl-based computer program. MinimalMarker has been validated in variety identification of fruit trees using published datasets and is available for use with both dominant and co-dominant markers, regardless of the number of alleles, including SSR markers with numeric notation. We expect that this program will prove useful not only to genomics researchers but also to government agencies that use DNA markers to support a variety of food-inspection and -labeling regulations.

  15. Rarity-weighted richness: a simple and reliable alternative to integer programming and heuristic algorithms for minimum set and maximum coverage problems in conservation planning.

    PubMed

    Albuquerque, Fabio; Beier, Paul

    2015-01-01

    Here we report that prioritizing sites in order of rarity-weighted richness (RWR) is a simple, reliable way to identify sites that represent all species in the fewest number of sites (minimum set problem) or to identify sites that represent the largest number of species within a given number of sites (maximum coverage problem). We compared the number of species represented in sites prioritized by RWR to numbers of species represented in sites prioritized by the Zonation software package for 11 datasets in which the size of individual planning units (sites) ranged from <1 ha to 2,500 km2. On average, RWR solutions were more efficient than Zonation solutions. Integer programming remains the only guaranteed way find an optimal solution, and heuristic algorithms remain superior for conservation prioritizations that consider compactness and multiple near-optimal solutions in addition to species representation. But because RWR can be implemented easily and quickly in R or a spreadsheet, it is an attractive alternative to integer programming or heuristic algorithms in some conservation prioritization contexts.

  16. Rarity-Weighted Richness: A Simple and Reliable Alternative to Integer Programming and Heuristic Algorithms for Minimum Set and Maximum Coverage Problems in Conservation Planning

    PubMed Central

    Albuquerque, Fabio; Beier, Paul

    2015-01-01

    Here we report that prioritizing sites in order of rarity-weighted richness (RWR) is a simple, reliable way to identify sites that represent all species in the fewest number of sites (minimum set problem) or to identify sites that represent the largest number of species within a given number of sites (maximum coverage problem). We compared the number of species represented in sites prioritized by RWR to numbers of species represented in sites prioritized by the Zonation software package for 11 datasets in which the size of individual planning units (sites) ranged from <1 ha to 2,500 km2. On average, RWR solutions were more efficient than Zonation solutions. Integer programming remains the only guaranteed way find an optimal solution, and heuristic algorithms remain superior for conservation prioritizations that consider compactness and multiple near-optimal solutions in addition to species representation. But because RWR can be implemented easily and quickly in R or a spreadsheet, it is an attractive alternative to integer programming or heuristic algorithms in some conservation prioritization contexts. PMID:25780930

  17. Optimal Modeling of Urban Ambient Air Ozone Concentration Based on Its Precursors' Concentrations and Temperature, Employing Genetic Programming and Genetic Algorithm.

    PubMed

    Mousavi, Seyed Mahmoud; Husseinzadeh, Danial; Alikhani, Sadegh

    2014-04-01

    Efficient models are required to predict the optimum values of ozone concentration in different levels of its precursors' concentrations and temperatures. A novel model based on the application of a genetic programming (GP) optimization is presented in this article. Ozone precursors' concentrations and run time average temperature have been chosen as model's parameters. Generalization performances of two different homemade models based on genetic programming and genetic algorithm (GA), which can be used for calculating theoretical ozone concentration, are compared with conventional semi-empirical model performance. Experimental data of Mashhad city ambient air have been employed to investigate the prediction ability of properly trained GP, GA, and conventional semi-empirical models. It is clearly demonstrated that the in-house algorithm which is used for the model based on GP, provides better generalization performance over the model optimized with GA and the conventional semi-empirical ones. The proposed model is found accurate enough and can be used for urban air ozone concentration prediction.

  18. Digital program for solving the linear stochastic optimal control and estimation problem

    NASA Technical Reports Server (NTRS)

    Geyser, L. C.; Lehtinen, B.

    1975-01-01

    A computer program is described which solves the linear stochastic optimal control and estimation (LSOCE) problem by using a time-domain formulation. The LSOCE problem is defined as that of designing controls for a linear time-invariant system which is disturbed by white noise in such a way as to minimize a performance index which is quadratic in state and control variables. The LSOCE problem and solution are outlined; brief descriptions are given of the solution algorithms, and complete descriptions of each subroutine, including usage information and digital listings, are provided. A test case is included, as well as information on the IBM 7090-7094 DCS time and storage requirements.

  19. Integrability of Quadratic Non-autonomous Quantum Linear Systems

    NASA Astrophysics Data System (ADS)

    Lopez, Raquel

    The Quantum Harmonic Oscillator is one of the most important models in Quantum Mechanics. Analogous to the classical mass vibrating back and forth on a spring, the quantum oscillator system has attracted substantial attention over the years because of its importance in many advanced and difficult quantum problems. This dissertation deals with solving generalized models of the time-dependent Schrodinger equation which are called generalized quantum harmonic oscillators, and these are characterized by an arbitrary quadratic Hamiltonian of linear momentum and position operators. The primary challenge in this work is that most quantum models with timedependence are not solvable explicitly, yet this challenge became the driving motivation for this work. In this dissertation, the methods used to solve the time-dependent Schrodinger equation are the fundamental singularity (or Green's function) and the Fourier (eigenfunction expansion) methods. Certain Riccati- and Ermakov-type systems arise, and these systems are highlighted and investigated. The overall aims of this dissertation are to show that quadratic Hamiltonian systems are completely integrable systems, and to provide explicit approaches to solving the time-dependent Schr¨odinger equation governed by an arbitrary quadratic Hamiltonian operator. The methods and results established in the dissertation are not yet well recognized in the literature, yet hold for high promise for further future research. Finally, the most recent results in the dissertation correspond to the harmonic oscillator group and its symmetries. A simple derivation of the maximum kinematical invariance groups of the free particle and quantum harmonic oscillator is constructed from the view point of the Riccati- and Ermakov-type systems, which shows an alternative to the traditional Lie Algebra approach. To conclude, a missing class of solutions of the time-dependent Schrodinger equation for the simple harmonic oscillator in one dimension is

  20. CUDA programs for the GPU computing of the Swendsen-Wang multi-cluster spin flip algorithm: 2D and 3D Ising, Potts, and XY models

    NASA Astrophysics Data System (ADS)

    Komura, Yukihiro; Okabe, Yutaka

    2014-03-01

    We present sample CUDA programs for the GPU computing of the Swendsen-Wang multi-cluster spin flip algorithm. We deal with the classical spin models; the Ising model, the q-state Potts model, and the classical XY model. As for the lattice, both the 2D (square) lattice and the 3D (simple cubic) lattice are treated. We already reported the idea of the GPU implementation for 2D models (Komura and Okabe, 2012). We here explain the details of sample programs, and discuss the performance of the present GPU implementation for the 3D Ising and XY models. We also show the calculated results of the moment ratio for these models, and discuss phase transitions. Catalogue identifier: AERM_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AERM_v1_0.html Program obtainable from: CPC Program Library, Queen’s University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 5632 No. of bytes in distributed program, including test data, etc.: 14688 Distribution format: tar.gz Programming language: C, CUDA. Computer: System with an NVIDIA CUDA enabled GPU. Operating system: System with an NVIDIA CUDA enabled GPU. Classification: 23. External routines: NVIDIA CUDA Toolkit 3.0 or newer Nature of problem: Monte Carlo simulation of classical spin systems. Ising, q-state Potts model, and the classical XY model are treated for both two-dimensional and three-dimensional lattices. Solution method: GPU-based Swendsen-Wang multi-cluster spin flip Monte Carlo method. The CUDA implementation for the cluster-labeling is based on the work by Hawick et al. [1] and that by Kalentev et al. [2]. Restrictions: The system size is limited depending on the memory of a GPU. Running time: For the parameters used in the sample programs, it takes about a minute for each program. Of course, it depends on the system size, the number of Monte Carlo steps, etc. References: [1] K

  1. Scaling Laws for the Multidimensional Burgers Equation with Quadratic External Potential

    NASA Astrophysics Data System (ADS)

    Leonenko, N. N.; Ruiz-Medina, M. D.

    2006-07-01

    The reordering of the multidimensional exponential quadratic operator in coordinate-momentum space (see X. Wang, C.H. Oh and L.C. Kwek (1998). J. Phys. A.: Math. Gen. 31:4329-4336) is applied to derive an explicit formulation of the solution to the multidimensional heat equation with quadratic external potential and random initial conditions. The solution to the multidimensional Burgers equation with quadratic external potential under Gaussian strongly dependent scenarios is also obtained via the Hopf-Cole transformation. The limiting distributions of scaling solutions to the multidimensional heat and Burgers equations with quadratic external potential are then obtained under such scenarios.

  2. Conservation of Mass and Preservation of Positivity with Ensemble-Type Kalman Filter Algorithms

    NASA Technical Reports Server (NTRS)

    Janjic, Tijana; Mclaughlin, Dennis; Cohn, Stephen E.; Verlaan, Martin

    2014-01-01

    This paper considers the incorporation of constraints to enforce physically based conservation laws in the ensemble Kalman filter. In particular, constraints are used to ensure that the ensemble members and the ensemble mean conserve mass and remain nonnegative through measurement updates. In certain situations filtering algorithms such as the ensemble Kalman filter (EnKF) and ensemble transform Kalman filter (ETKF) yield updated ensembles that conserve mass but are negative, even though the actual states must be nonnegative. In such situations if negative values are set to zero, or a log transform is introduced, the total mass will not be conserved. In this study, mass and positivity are both preserved by formulating the filter update as a set of quadratic programming problems that incorporate non-negativity constraints. Simple numerical experiments indicate that this approach can have a significant positive impact on the posterior ensemble distribution, giving results that are more physically plausible both for individual ensemble members and for the ensemble mean. In two examples, an update that includes a non-negativity constraint is able to properly describe the transport of a sharp feature (e.g., a triangle or cone). A number of implementation questions still need to be addressed, particularly the need to develop a computationally efficient quadratic programming update for large ensemble.

  3. [Interpretation of pair diagnosis with the Giessen test. An algorithm and a computer program to determine types].

    PubMed

    Kubinger, K D; Wagner, M M; Alexandrowicz, R

    1999-07-01

    An algorithm is given in order to quantify the similarity of a couple's test profile in the Giessen-Test as concerns that 16 typical test profiles discovered by Brähler and Brähler (1993). The German Giessen-Test is a personality-inventory based on psychoanalysis. The Euklidian distance was chosen as a measuring unit. The identification of that typical test profile to which any couple belongs succeeds very easily, a task which is otherwise only possible with difficulty. However, any allocation is merely for reasons of description, not based on statistical decisions. As a special service, the respective computer programme is placed at everyone's disposal.

  4. AN INTRODUCTION TO THE APPLICATION OF DYNAMIC PROGRAMMING TO LINEAR CONTROL SYSTEMS

    DTIC Science & Technology

    DYNAMIC PROGRAMMING APPLIED TO OPTIMIZE LINEAR CONTROL SYSTEMS WITH QUADRATIC PERFORMANCE MEASURES. MATHEMATICAL METHODS WHICH MAY BE APPLIED TO SPACE VEHICLE AND RELATED GUIDANCE AND CONTROL PROBLEMS.

  5. Schwarz and multilevel methods for quadratic spline collocation

    SciTech Connect

    Christara, C.C.; Smith, B.

    1994-12-31

    Smooth spline collocation methods offer an alternative to Galerkin finite element methods, as well as to Hermite spline collocation methods, for the solution of linear elliptic Partial Differential Equations (PDEs). Recently, optimal order of convergence spline collocation methods have been developed for certain degree splines. Convergence proofs for smooth spline collocation methods are generally more difficult than for Galerkin finite elements or Hermite spline collocation, and they require stronger assumptions and more restrictions. However, numerical tests indicate that spline collocation methods are applicable to a wider class of problems, than the analysis requires, and are very competitive to finite element methods, with respect to efficiency. The authors will discuss Schwarz and multilevel methods for the solution of elliptic PDEs using quadratic spline collocation, and compare these with domain decomposition methods using substructuring. Numerical tests on a variety of parallel machines will also be presented. In addition, preliminary convergence analysis using Schwarz and/or maximum principle techniques will be presented.

  6. A quadratic-shaped-finger comb parametric resonator

    NASA Astrophysics Data System (ADS)

    Guo, Congzhong; Fedder, Gary K.

    2013-09-01

    A large-stroke (8 µm) parametric resonator excited by an in-plane ‘shaped-finger’ electrostatic comb drive is fabricated using a 15 µm thick silicon-on-insulator microelectromechanical systems (SOI-MEMS) process. A quadratic capacitance-engagement response is synthesized by engineering a custom-shaped comb finger profile. A folded-flexure suspension allows lateral motion while constraining rotational modes. The excitation of the nonlinear parametric resonance is realized by selecting an appropriate combination of the linear and cubic electrostatic stiffness coefficients through a specific varying-gap comb-finger design. The large-amplitude parametric resonance promotes high signal-to-noise ratio for potential use in sensitive chemical gravimetric sensors, strain gauges, and mode-matched gyroscope applications.

  7. Renormalisation of correlations in a barrier billiard: Quadratic irrational trajectories

    NASA Astrophysics Data System (ADS)

    Adamson, L. N. C.; Osbaldestin, A. H.

    2014-03-01

    We present an analysis of autocorrelation functions in symmetric barrier billiards using a renormalisation approach for quadratic irrational trajectories. Depending on the nature of the barrier, this leads to either self-similar or chaotic behaviour. In the self-similar case we give an analysis of the half barrier and present a detailed calculation of the locations, asymptotic heights and signs of the main peaks in the autocorrelation function. Then we consider arbitrary barriers, illustrating that typically these give rise to chaotic correlations of the autocorrelation function which we further represent by showing the invariant sets associated with these correlations. Our main ingredient here is a functional recurrence which has been previously derived and used in work on the Harper equation, strange non-chaotic attractors and a quasi-periodically forced two-level system.

  8. Absence of the Gribov ambiguity in a quadratic gauge

    NASA Astrophysics Data System (ADS)

    Raval, Haresh

    2016-05-01

    The Gribov ambiguity exists in various gauges. Algebraic gauges are likely to be ambiguity free. However, algebraic gauges are not Lorentz invariant, which is their fundamental flaw. In addition, they are not generally compatible with the boundary conditions on the gauge fields, which are needed to compactify the space i.e., the ambiguity continues to exist on a compact manifold. Here we discuss a quadratic gauge fixing, which is Lorentz invariant. We consider an example of a spherically symmetric gauge field configuration in which we prove that this Lorentz invariant gauge removes the ambiguity on a compact manifold {S}^3, when a proper boundary condition on the gauge configuration is taken into account. Thus, we provide one example where the ambiguity is absent on a compact manifold in the algebraic gauge. We also show that the BRST invariance is preserved in this gauge.

  9. Repopulation Kinetics and the Linear-Quadratic Model

    NASA Astrophysics Data System (ADS)

    O'Rourke, S. F. C.; McAneney, H.; Starrett, C.; O'Sullivan, J. M.

    2009-08-01

    The standard Linear-Quadratic (LQ) survival model for radiotherapy is used to investigate different schedules of radiation treatment planning for advanced head and neck cancer. We explore how these treament protocols may be affected by different tumour repopulation kinetics between treatments. The laws for tumour cell repopulation include the logistic and Gompertz models and this extends the work of Wheldon et al. [1], which was concerned with the case of exponential repopulation between treatments. Treatment schedules investigated include standarized and accelerated fractionation. Calculations based on the present work show, that even with growth laws scaled to ensure that the repopulation kinetics for advanced head and neck cancer are comparable, considerable variation in the survival fraction to orders of magnitude emerged. Calculations show that application of the Gompertz model results in a significantly poorer prognosis for tumour eradication. Gaps in treatment also highlight the differences in the LQ model with the effect of repopulation kinetics included.

  10. Wind turbine power tracking using an improved multimodel quadratic approach.

    PubMed

    Khezami, Nadhira; Benhadj Braiek, Naceur; Guillaud, Xavier

    2010-07-01

    In this paper, an improved multimodel optimal quadratic control structure for variable speed, pitch regulated wind turbines (operating at high wind speeds) is proposed in order to integrate high levels of wind power to actively provide a primary reserve for frequency control. On the basis of the nonlinear model of the studied plant, and taking into account the wind speed fluctuations, and the electrical power variation, a multimodel linear description is derived for the wind turbine, and is used for the synthesis of an optimal control law involving a state feedback, an integral action and an output reference model. This new control structure allows a rapid transition of the wind turbine generated power between different desired set values. This electrical power tracking is ensured with a high-performance behavior for all other state variables: turbine and generator rotational speeds and mechanical shaft torque; and smooth and adequate evolution of the control variables.

  11. Cosmology for quadratic gravity in generalized Weyl geometry

    SciTech Connect

    Jiménez, Jose Beltrán; Heisenberg, Lavinia; Koivisto, Tomi S.

    2016-04-26

    A class of vector-tensor theories arises naturally in the framework of quadratic gravity in spacetimes with linear vector distortion. Requiring the absence of ghosts for the vector field imposes an interesting condition on the allowed connections with vector distortion: the resulting one-parameter family of connections generalises the usual Weyl geometry with polar torsion. The cosmology of this class of theories is studied, focusing on isotropic solutions wherein the vector field is dominated by the temporal component. De Sitter attractors are found and inhomogeneous perturbations around such backgrounds are analysed. In particular, further constraints on the models are imposed by excluding pathologies in the scalar, vector and tensor fluctuations. Various exact background solutions are presented, describing a constant and an evolving dark energy, a bounce and a self-tuning de Sitter phase. However, the latter two scenarios are not viable under a closer scrutiny.

  12. Qualitative analysis of certain generalized classes of quadratic oscillator systems

    SciTech Connect

    Bagchi, Bijan Ghosh, Samiran Pal, Barnali Poria, Swarup

    2016-02-15

    We carry out a systematic qualitative analysis of the two quadratic schemes of generalized oscillators recently proposed by Quesne [J. Math. Phys. 56, 012903 (2015)]. By performing a local analysis of the governing potentials, we demonstrate that while the first potential admits a pair of equilibrium points one of which is typically a center for both signs of the coupling strength λ, the other points to a centre for λ < 0 but a saddle λ > 0. On the other hand, the second potential reveals only a center for both the signs of λ from a linear stability analysis. We carry out our study by extending Quesne’s scheme to include the effects of a linear dissipative term. An important outcome is that we run into a remarkable transition to chaos in the presence of a periodic force term fcosωt.

  13. Adiabatic theory, Liapunov exponents, and rotation number for quadratic Hamiltonians

    NASA Astrophysics Data System (ADS)

    Delyon, François; Foulon, Patrick

    1987-11-01

    We consider the adiabatic problem for general time-dependent quadratic Hamiltonians and develop a method quite different from WKB. In particular, we apply our results to the Schrödinger equation in a strip. We show that there exists a first regular step (avoiding resonance problems) providing one adiabatic invariant, bounds on the Liapunov exponents, and estimates on the rotation number at any order of the perturbation theory. The further step is shown to be equivalent to a quantum adiabatic problem, which, by the usual adiabatic techniques, provides the other possible adiabatic invariants. In the special case of the Schrödinger equation our method is simpler and more powerful than the WKB techniques.

  14. Confidence set inference with a prior quadratic bound

    NASA Technical Reports Server (NTRS)

    Backus, George E.

    1988-01-01

    In the uniqueness part of a geophysical inverse problem, the observer wants to predict all likely values of P unknown numerical properties z = (z sub 1,...,z sub p) of the earth from measurement of D other numerical properties y(0)=(y sub 1(0),...,y sub D(0)) knowledge of the statistical distribution of the random errors in y(0). The data space Y containing y(0) is D-dimensional, so when the model space X is infinite-dimensional the linear uniqueness problem usually is insoluble without prior information about the correct earth model x. If that information is a quadratic bound on x (e.g., energy or dissipation rate), Bayesian inference (BI) and stochastic inversion (SI) inject spurious structure into x, implied by neither the data nor the quadratic bound. Confidence set inference (CSI) provides an alternative inversion technique free of this objection. CSI is illustrated in the problem of estimating the geomagnetic field B at the core-mantle boundary (CMB) from components of B measured on or above the earth's surface. Neither the heat flow nor the energy bound is strong enough to permit estimation of B(r) at single points on the CMB, but the heat flow bound permits estimation of uniform averages of B(r) over discs on the CMB, and both bounds permit weighted disc-averages with continous weighting kernels. Both bounds also permit estimation of low-degree Gauss coefficients at the CMB. The heat flow bound resolves them up to degree 8 if the crustal field at satellite altitudes must be treated as a systematic error, but can resolve to degree 11 under the most favorable statistical treatment of the crust. These two limits produce circles of confusion on the CMB with diameters of 25 deg and 19 deg respectively.

  15. Spectroscopy of one-dimensionally inhomogeneous media with quadratic nonlinearity

    SciTech Connect

    Golubkov, A A; Makarov, Vladimir A

    2011-11-30

    We present a brief review of the results of fifty years of development efforts in spectroscopy of one-dimensionally inhomogeneous media with quadratic nonlinearity. The recent original results obtained by the authors show the fundamental possibility of determining, from experimental data, the coordinate dependences of complex quadratic susceptibility tensor components of a onedimensionally inhomogeneous (along the z axis) medium with an arbitrary frequency dispersion, if the linear dielectric properties of the medium also vary along the z axis and are described by a diagonal tensor of the linear dielectric constant. It is assumed that the medium in question has the form of a plane-parallel plate, whose surfaces are perpendicular to the direction of the inhomogeneity. Using the example of several components of the tensors X{sup (2)}(z, {omega}{sub 1} {+-} {omega}{sub 2}; {omega}{sub 1}, {+-} {omega}{sub 2}), we describe two methods for finding their spatial profiles, which differ in the interaction geometry of plane monochromatic fundamental waves with frequencies {omega}{sub 1} and {omega}{sub 2}. The both methods are based on assessing the intensity of the waves propagating from the plate at the sum or difference frequency and require measurements over a range of angles of incidence of the fundamental waves. Such measurements include two series of additional estimates of the intensities of the waves generated under special conditions by using the test and additional reference plates, which eliminates the need for complicated phase measurements of the complex amplitudes of the waves at the sum (difference) frequency.

  16. Diagnostic Algorithm Benchmarking

    NASA Technical Reports Server (NTRS)

    Poll, Scott

    2011-01-01

    A poster for the NASA Aviation Safety Program Annual Technical Meeting. It describes empirical benchmarking on diagnostic algorithms using data from the ADAPT Electrical Power System testbed and a diagnostic software framework.

  17. Novel algorithm and MATLAB-based program for automated power law analysis of single particle, time-dependent mean-square displacement

    NASA Astrophysics Data System (ADS)

    Umansky, Moti; Weihs, Daphne

    2012-08-01

    In many physical and biophysical studies, single-particle tracking is utilized to reveal interactions, diffusion coefficients, active modes of driving motion, dynamic local structure, micromechanics, and microrheology. The basic analysis applied to those data is to determine the time-dependent mean-square displacement (MSD) of particle trajectories and perform time- and ensemble-averaging of similar motions. The motion of particles typically exhibits time-dependent power-law scaling, and only trajectories with qualitatively and quantitatively comparable MSD should be ensembled. Ensemble averaging trajectories that arise from different mechanisms, e.g., actively driven and diffusive, is incorrect and can result inaccurate correlations between structure, mechanics, and activity. We have developed an algorithm to automatically and accurately determine power-law scaling of experimentally measured single-particle MSD. Trajectories can then categorized and grouped according to user defined cutoffs of time, amplitudes, scaling exponent values, or combinations. Power-law fits are then provided for each trajectory alongside categorized groups of trajectories, histograms of power laws, and the ensemble-averaged MSD of each group. The codes are designed to be easily incorporated into existing user codes. We expect that this algorithm and program will be invaluable to anyone performing single-particle tracking, be it in physical or biophysical systems. Catalogue identifier: AEMD_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEMD_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 25 892 No. of bytes in distributed program, including test data, etc.: 5 572 780 Distribution format: tar.gz Programming language: MATLAB (MathWorks Inc.) version 7.11 (2010b) or higher, program

  18. Solutions of the Schrödinger equation with inversely quadratic Hellmann plus inversely quadratic potential using Nikiforov-Uvarov method

    NASA Astrophysics Data System (ADS)

    Ita, B. I.; Ehi-Eromosele, C. O.; Edobor-Osoh, A.; Ikeuba, A. I.

    2014-11-01

    By using the Nikiforov-Uvarov (NU) method, the Schrödinger equation has been solved for the interaction of inversely quadratic Hellmann (IQHP) and inversely quadratic potential (IQP) for any angular momentum quantum number, l. The energy eigenvalues and their corresponding eigenfunctions have been obtained in terms of Laguerre polynomials. Special cases of the sum of these potentials have been considered and their energy eigenvalues also obtained.

  19. Spacecraft Formation Flying Maneuvers Using Linear Quadratic Regulation With No Radial Axis Inputs

    NASA Technical Reports Server (NTRS)

    Starin, Scott R.; Yedavalli, R. K.; Sparks, Andrew G.; Bauer, Frank H. (Technical Monitor)

    2001-01-01

    Regarding multiple spacecraft formation flying, the observation has been made that control thrust need only be applied coplanar to the local horizon to achieve complete controllability of a two-satellite (leader-follower) formation. A formulation of orbital dynamics using the state of one satellite relative to another is used. Without the need for thrust along the radial (zenith-nadir) axis of the relative reference frame, propulsion system simplifications and weight reduction may be accomplished. This work focuses on the validation of this control system on its own merits, and in comparison to a related system which does provide thrust along the radial axis of the relative frame. Maneuver simulations are performed using commercial ODE solvers to propagate the Keplerian dynamics of a controlled satellite relative to an uncontrolled leader. These short maneuver simulations demonstrate the capacity of the controller to perform changes from one formation geometry to another. Control algorithm performance is evaluated based on measures such as the fuel required to complete a maneuver and the maximum acceleration required by the controller. Based on this evaluation, the exclusion of the radial axis of control still allows enough control authority to use Linear Quadratic Regulator (LQR) techniques to design a gain matrix of adequate performance over finite maneuvers. Additional simulations are conducted including perturbations and using no radial control inputs. A major conclusion presented is that control inputs along the three axes have significantly different relationships to the governing orbital dynamics that may be exploited using LQR.

  20. a General Algorithm for the Generation of Quasilattices by Means of the Cut and Projection Method Using the SIMPLEX Method of Linear Programming and the Moore-Penrose Generalized Inverse

    NASA Astrophysics Data System (ADS)

    Aragón, J. L.; Vázquez Polo, G.; Gómez, A.

    A computational algorithm for the generation of quasiperiodic tiles based on the cut and projection method is presented. The algorithm is capable of projecting any type of lattice embedded in any euclidean space onto any subspace making it possible to generate quasiperiodic tiles with any desired symmetry. The simplex method of linear programming and the Moore-Penrose generalized inverse are used to construct the cut (strip) in the higher dimensional space which is to be projected.

  1. Revealing Ozgur's Thoughts of a Quadratic Function with a Clinical Interview: Concepts and Their Underlying Reasons

    ERIC Educational Resources Information Center

    Ozaltun Celik, Aytug; Bukova Guzel, Esra

    2017-01-01

    The quadratic function is an important concept for calculus but the students at high school have many difficulties related to this concept. It is important that the teaching of the quadratic function is realized considering the students' thinking. In this context, the aim of this study conducted through a qualitative case study is to reveal the…

  2. Computing the Partial Fraction Decomposition of Rational Functions with Irreducible Quadratic Factors in the Denominators

    ERIC Educational Resources Information Center

    Man, Yiu-Kwong

    2012-01-01

    In this note, a new method for computing the partial fraction decomposition of rational functions with irreducible quadratic factors in the denominators is presented. This method involves polynomial divisions and substitutions only, without having to solve for the complex roots of the irreducible quadratic polynomial or to solve a system of linear…

  3. Hidden Lessons: How a Focus on Slope-Like Properties of Quadratic Functions Encouraged Unexpected Generalizations

    ERIC Educational Resources Information Center

    Ellis, Amy B.; Grinstead, Paul

    2008-01-01

    This article presents secondary students' generalizations about the connections between algebraic and graphical representations of quadratic functions, focusing specifically on the roles of the parameters a, b, and c in the general form of a quadratic function, y = ax[superscript 2] + bx + c. Students' generalizations about these connections led…

  4. Exploration of Quadratic Expressions through Multiple Representations for Students with Mathematics Difficulties

    ERIC Educational Resources Information Center

    Strickland, Tricia K.; Maccini, Paula

    2013-01-01

    The current study focuses on the effects of incorporating multiple visual representations on students' conceptual understanding of quadratic expressions embedded within area word problems and students' procedural fluency of transforming quadratic expressions in standard form to factored-form and vice versa. The intervention included the…

  5. A visual basic program for ridge axis picking on DEM data using the profile-recognition and polygon-breaking algorithm

    NASA Astrophysics Data System (ADS)

    Chang, Yet-Chung; Sinha, Gaurav

    2007-02-01

    For many scientists working with digital topographic data, extracting lineaments or linear features is an important step in structuring and analyzing raw data. A ridge axis, which represents the top a mountain ridge, is one of the most important topographic features used in a wide variety of applications. Algorithms and software for automating the extraction of ridges or ridge axes from DEMs are, however, still not easily available or not widely acceptable. In this paper, we present a user-friendly Visual Basic program that automates the extraction of the ridge axis system from DEM data, based on the profile-recognition and polygon-breaking algorithm (PPA). An important feature of PPA is that it takes a global approach, as opposed to the local neighborhood operators used in many other algorithms. Each segment detected by PPA considers not only relations with contiguous neighboring grid points, but also strives to preserve the continuity of the global trend. This is an attempt to simulate human operators, who always factor in the overall trend of the lineament before delineating its local parts. PPA starts by connecting all points in a neighborhood that can possibly lie on the ridge axis, thus forming a belt of polygons in the first step. Next, a polygon breaking process eliminates unwanted segments according to the assumption that a ridge segment cannot be the side of any closed polygon, and that the result should be a purely dendritic line pattern. Finally, a branch-reduction process is executed to eliminate all parallel false ridges that remained due to the conservative approach taken in the first step. Results indicate that PPA is reasonably successful in picking out ridges that would have been identified manually by experts. In addition to providing a detailed user interface for executing PPA, several modifications were made to significantly improve the computational efficiency of PPA, as compared to the original version published in 1998. The source codes are

  6. PIPS-SBB: A Parallel Distributed-Memory Branch-and-Bound Algorithm for Stochastic Mixed-Integer Programs

    SciTech Connect

    Munguia, Lluis-Miquel; Oxberry, Geoffrey; Rajan, Deepak

    2016-05-01

    Stochastic mixed-integer programs (SMIPs) deal with optimization under uncertainty at many levels of the decision-making process. When solved as extensive formulation mixed- integer programs, problem instances can exceed available memory on a single workstation. In order to overcome this limitation, we present PIPS-SBB: a distributed-memory parallel stochastic MIP solver that takes advantage of parallelism at multiple levels of the optimization process. We also show promising results on the SIPLIB benchmark by combining methods known for accelerating Branch and Bound (B&B) methods with new ideas that leverage the structure of SMIPs. Finally, we expect the performance of PIPS-SBB to improve further as more functionality is added in the future.

  7. PIPS-SBB: A Parallel Distributed-Memory Branch-and-Bound Algorithm for Stochastic Mixed-Integer Programs

    DOE PAGES

    Munguia, Lluis-Miquel; Oxberry, Geoffrey; Rajan, Deepak

    2016-05-01

    Stochastic mixed-integer programs (SMIPs) deal with optimization under uncertainty at many levels of the decision-making process. When solved as extensive formulation mixed- integer programs, problem instances can exceed available memory on a single workstation. In order to overcome this limitation, we present PIPS-SBB: a distributed-memory parallel stochastic MIP solver that takes advantage of parallelism at multiple levels of the optimization process. We also show promising results on the SIPLIB benchmark by combining methods known for accelerating Branch and Bound (B&B) methods with new ideas that leverage the structure of SMIPs. Finally, we expect the performance of PIPS-SBB to improve furthermore » as more functionality is added in the future.« less

  8. Comparison of two non-convex mixed-integer nonlinear programming algorithms applied to autoregressive moving average model structure and parameter estimation

    NASA Astrophysics Data System (ADS)

    Uilhoorn, F. E.

    2016-10-01

    In this article, the stochastic modelling approach proposed by Box and Jenkins is treated as a mixed-integer nonlinear programming (MINLP) problem solved with a mesh adaptive direct search and a real-coded genetic class of algorithms. The aim is to estimate the real-valued parameters and non-negative integer, correlated structure of stationary autoregressive moving average (ARMA) processes. The maximum likelihood function of the stationary ARMA process is embedded in Akaike's information criterion and the Bayesian information criterion, whereas the estimation procedure is based on Kalman filter recursions. The constraints imposed on the objective function enforce stability and invertibility. The best ARMA model is regarded as the global minimum of the non-convex MINLP problem. The robustness and computational performance of the MINLP solvers are compared with brute-force enumeration. Numerical experiments are done for existing time series and one new data set.

  9. Distributed Minimum Hop Algorithms

    DTIC Science & Technology

    1982-01-01

    acknowledgement), node d starts iteration i+1, and otherwise the algorithm terminates. A detailed description of the algorithm is given in pidgin algol...precise behavior of the algorithm under these circumstances is described by the pidgin algol program in the appendix which is executed by each node. The...l) < N!(2) for each neighbor j, and thus by induction,J -1 N!(2-1) < n-i + (Z-1) + N!(Z-1), completing the proof. Algorithm Dl in Pidgin Algol It is

  10. Stability and monotone convergence of generalised policy iteration for discrete-time linear quadratic regulations

    NASA Astrophysics Data System (ADS)

    Chun, Tae Yoon; Lee, Jae Young; Park, Jin Bae; Choi, Yoon Ho

    2016-03-01

    In this paper, we analyse the convergence and stability properties of generalised policy iteration (GPI) applied to discrete-time linear quadratic regulation problems. GPI is one kind of the generalised adaptive dynamic programming methods used for solving optimal control problems, and is composed of policy evaluation and policy improvement steps. To analyse the convergence and stability of GPI, the dynamic programming (DP) operator is defined. Then, GPI and its equivalent formulas are presented based on the notation of DP operator. The convergence of the approximate value function to the exact one in policy evaluation is proven based on the equivalent formulas. Furthermore, the positive semi-definiteness, stability, and the monotone convergence (PI-mode and VI-mode convergence) of GPI are presented under certain conditions on the initial value function. The online least square method is also presented for the implementation of GPI. Finally, some numerical simulations are carried out to verify the effectiveness of GPI as well as to further investigate the convergence and stability properties.

  11. Fast Quantum Algorithms for Numerical Integrals and Stochastic Processes

    NASA Technical Reports Server (NTRS)

    Abrams, D.; Williams, C.

    1999-01-01

    We discuss quantum algorithms that calculate numerical integrals and descriptive statistics of stochastic processes. With either of two distinct approaches, one obtains an exponential speed increase in comparison to the fastest known classical deterministic algotithms and a quadratic speed increase incomparison to classical Monte Carlo methods.

  12. Neural-genetic synthesis for state-space controllers based on linear quadratic regulator design for eigenstructure assignment.

    PubMed

    da Fonseca Neto, João Viana; Abreu, Ivanildo Silva; da Silva, Fábio Nogueira

    2010-04-01

    Toward the synthesis of state-space controllers, a neural-genetic model based on the linear quadratic regulator design for the eigenstructure assignment of multivariable dynamic systems is presented. The neural-genetic model represents a fusion of a genetic algorithm and a recurrent neural network (RNN) to perform the selection of the weighting matrices and the algebraic Riccati equation solution, respectively. A fourth-order electric circuit model is used to evaluate the convergence of the computational intelligence paradigms and the control design method performance. The genetic search convergence evaluation is performed in terms of the fitness function statistics and the RNN convergence, which is evaluated by landscapes of the energy and norm, as a function of the parameter deviations. The control problem solution is evaluated in the time and frequency domains by the impulse response, singular values, and modal analysis.

  13. On the computational cost of approximating and recognizing noise-perturbed straight lines and quadratic arcs in the plane

    NASA Technical Reports Server (NTRS)

    Cooper, D. B.; Yalabik, N.

    1976-01-01

    Recognition of underlying straight lines and quadratic arcs in line drawings, and approximation of very noisy data by such line/curve segments, is addressed as a subproblem of the more general problem of optimum recognition of complicated line/curve drawings. Some specific algorithms are presented with extensions and interpretations for more complicated applications, and a data generation model is developed for the problem. Data are generated as a perturbation of a single underlying straight line or an elliptic or hyperbolic arc. Recursive estimation techniques, minimization of central processing unit time, decision making with controlled error probabilities, and modeling and recognition of pictures consisting of noisy curves are dealt with. Applications envisaged include: picture data compression, contour line representation in maps, intelligent data searches, and ballistic missile decoy tracking.

  14. Linear versus quadratic portfolio optimization model with transaction cost

    NASA Astrophysics Data System (ADS)

    Razak, Norhidayah Bt Ab; Kamil, Karmila Hanim; Elias, Siti Masitah

    2014-06-01

    Optimization model is introduced to become one of the decision making tools in investment. Hence, it is always a big challenge for investors to select the best model that could fulfill their goal in investment with respect to risk and return. In this paper we aims to discuss and compare the portfolio allocation and performance generated by quadratic and linear portfolio optimization models namely of Markowitz and Maximin model respectively. The application of these models has been proven to be significant and popular among others. However transaction cost has been debated as one of the important aspects that should be considered for portfolio reallocation as portfolio return could be significantly reduced when transaction cost is taken into consideration. Therefore, recognizing the importance to consider transaction cost value when calculating portfolio' return, we formulate this paper by using data from Shariah compliant securities listed in Bursa Malaysia. It is expected that, results from this paper will effectively justify the advantage of one model to another and shed some lights in quest to find the best decision making tools in investment for individual investors.

  15. Linear quadratic optimal controller for cable-driven parallel robots

    NASA Astrophysics Data System (ADS)

    Abdolshah, Saeed; Shojaei Barjuei, Erfan

    2015-12-01

    In recent years, various cable-driven parallel robots have been investigated for their advantages, such as low structural weight, high acceleration, and large work-space, over serial and conventional parallel systems. However, the use of cables lowers the stiffness of these robots, which in turn may decrease motion accuracy. A linear quadratic (LQ) optimal controller can provide all the states of a system for the feedback, such as position and velocity. Thus, the application of such an optimal controller in cable-driven parallel robots can result in more efficient and accurate motion compared to the performance of classical controllers such as the proportional- integral-derivative controller. This paper presents an approach to apply the LQ optimal controller on cable-driven parallel robots. To employ the optimal control theory, the static and dynamic modeling of a 3-DOF planar cable-driven parallel robot (Feriba-3) is developed. The synthesis of the LQ optimal control is described, and the significant experimental results are presented and discussed.

  16. Quadratic Fermi node in a 3D strongly correlated semimetal

    DOE PAGES

    Kondo, Takeshi; Nakayama, M.; Chen, R.; ...

    2015-12-07

    We report that strong spin–orbit coupling fosters exotic electronic states such as topological insulators and superconductors, but the combination of strong spin–orbit and strong electron–electron interactions is just beginning to be understood. Central to this emerging area are the 5d transition metal iridium oxides. Here, in the pyrochlore iridate Pr2Ir2O7, we identify a non-trivial state with a single-point Fermi node protected by cubic and time-reversal symmetries, using a combination of angle-resolved photoemission spectroscopy and first-principles calculations. Owing to its quadratic dispersion, the unique coincidence of four degenerate states at the Fermi energy, and strong Coulomb interactions, non-Fermi liquid behaviour ismore » predicted, for which we observe some evidence. Lastly, our discovery implies that Pr2Ir2O7 is a parent state that can be manipulated to produce other strongly correlated topological phases, such as topological Mott insulator, Weyl semimetal, and quantum spin and anomalous Hall states.« less

  17. Quadratic Optimization in the Problems of Active Control of Sound

    NASA Technical Reports Server (NTRS)

    Loncaric, J.; Tsynkov, S. V.; Bushnell, Dennis M. (Technical Monitor)

    2002-01-01

    We analyze the problem of suppressing the unwanted component of a time-harmonic acoustic field (noise) on a predetermined region of interest. The suppression is rendered by active means, i.e., by introducing the additional acoustic sources called controls that generate the appropriate anti-sound. Previously, we have obtained general solutions for active controls in both continuous and discrete formulations of the problem. We have also obtained optimal solutions that minimize the overall absolute acoustic source strength of active control sources. These optimal solutions happen to be particular layers of monopoles on the perimeter of the protected region. Mathematically, minimization of acoustic source strength is equivalent to minimization in the sense of L(sub 1). By contrast. in the current paper we formulate and study optimization problems that involve quadratic functions of merit. Specifically, we minimize the L(sub 2) norm of the control sources, and we consider both the unconstrained and constrained minimization. The unconstrained L(sub 2) minimization is certainly the easiest problem to address numerically. On the other hand, the constrained approach allows one to analyze sophisticated geometries. In a special case, we call compare our finite-difference optimal solutions to the continuous optimal solutions obtained previously using a semi-analytic technique. We also show that the optima obtained in the sense of L(sub 2) differ drastically from those obtained in the sense of L(sub 1).

  18. Two simple approximations to the distributions of quadratic forms.

    PubMed

    Yuan, Ke-Hai; Bentler, Peter M

    2010-05-01

    Many test statistics are asymptotically equivalent to quadratic forms of normal variables, which are further equivalent to T = sigma(d)(i=1) lambda(i)z(i)(2) with z(i) being independent and following N(0,1). Two approximations to the distribution of T have been implemented in popular software and are widely used in evaluating various models. It is important to know how accurate these approximations are when compared to each other and to the exact distribution of T. The paper systematically studies the quality of the two approximations and examines the effect of the lambda(i) and the degrees of freedom d by analysis and Monte Carlo. The results imply that the adjusted distribution for T can be as good as knowing its exact distribution. When the coefficient of variation of the lambda(i) is small, the rescaled statistic T(R) = dT/(sigma(d)(i=1) lambda(i)) is also adequate for practical model inference. But comparing T(R) against chi2(d) will inflate type I errors when substantial differences exist among the lambda(i), especially, when d is also large.

  19. The Quadratic Spinor Lagrangian, Axial Torsion Current and Generalizations

    NASA Astrophysics Data System (ADS)

    Da Rocha, R.; Pereira, J. G.

    We show that the Einstein-Hilbert, the Einstein-Palatini, and the Holst actions can be derived from the Quadratic Spinor Lagrangian (QSL), when the three classes of Dirac spinor fields, under Lounesto spinor field classification, are considered. To each one of these classes, there corresponds an unique kind of action for a covariant gravity theory. In other words, it is shown to exist a one-to-one correspondence between the three classes of non-equivalent solutions of the Dirac equation, and Einstein-Hilbert, Einstein-Palatini, and Holst actions. Furthermore, it arises naturally, from Lounesto spinor field classification, that any other class of spinor field — Weyl, Majorana, flagpole, or flag-dipole spinor fields — yields a trivial (zero) QSL, up to a boundary term. To investigate this boundary term, we do not impose any constraint on the Dirac spinor field, and consequently we obtain new terms in the boundary component of the QSL. In the particular case of a teleparallel connection, an axial torsion one-form current density is obtained. New terms are also obtained in the corresponding Hamiltonian formalism. We then discuss how these new terms could shed new light on more general investigations.

  20. Bright nonlocal quadratic solitons induced by boundary confinement

    NASA Astrophysics Data System (ADS)

    Zheng, Yizhou; Gao, Yan; Wang, Jing; Lv, Fang; Lu, Daquan; Hu, Wei

    2017-01-01

    Under the Dirichlet boundary conditions, a family of bright quadratic solitons exists in the regime where the second harmonic can be regarded as the refractive index of the fundamental wave with an oscillatory nonlocal response. By simplifying the governing equations into the Snyder-Mitchell mode, the approximate analytical solutions are obtained. Taking them as the initial guess and using a numerical code, we found two branches of bright solitons, of which the beam width increases (branch I) and decreases (branch II) with the increase of the sample size, respectively. If the nonlocality is fixed and the sample size is varied, the soliton width varies piecewise and approximately periodically. In each period, solitons only exist in a small range of sample size. Single-hump fundamental wave solitons with the same beam width in narrower samples can be, if the second harmonics are connected smoothly, jointed to be a multihump soliton in a wider sample whose size is the sum of those for the narrower ones. The dynamical simulation shows that the found solitons are unstable.

  1. Monitoring bioeroding sponges: using rubble, Quadrat, or intercept surveys?

    PubMed

    Schönberg, C H L

    2015-04-01

    Relating to recent environmental changes, bioerosion rates of calcium carbonate materials appear to be increasing worldwide, often driven by sponges that cause bioerosion and are recognized bioindicators for coral reef health. Various field methods were compared to encourage more vigorous research on bioeroding sponges and their inclusion in major monitoring projects. The rubble technique developed by Holmes et al. (2000) had drawbacks often due to small specimen sizes: it was time-costly, generated large variation, and created a biased impression about dominant species. Quadrat surveys were most rapid but overestimated cover of small specimens. Line intercepts are recommended as easiest, least spatially biased, and most accurate, especially when comparing results from different observers. Intercepts required fewer samples and provided the best statistical efficiency, evidenced by better significances and test power. Bioeroding sponge abundances and biodiversities are influenced by water depth, sediment quality, and most importantly by availability of suitable attached substrate. Any related data should thus be standardized to amount of suitable substrate to allow comparison between different environments, concentrating on dominant, easily recognized species to avoid bias due to experience of observers.

  2. GR angular momentum in the quadratic spinor Lagrangian formulation

    NASA Astrophysics Data System (ADS)

    Li, Siao-Jing

    2016-08-01

    We inquire into the question of whether the quadratic spinor Lagrangian (QSL) formulation can describe the angular momentum for a general-relativistic system. The QSL Hamiltonian has previously been shown to be able to yield an energy-momentum quasilocalization which brings a proof of the positive gravitational energy when the spinor satisfies the conformal Witten equation. After inspection, we find that, under the constraint that the spinor on the asymptotic boundary is a constant, the QSL Hamiltonian is successful in giving an angular momentum quasilocalization. We also make certain the spinor in the Hamiltonian plays the role of a gauge field, a warrant of our permission to impose constraints on the spinor. Then, by some adjustment of the QSL Hamiltonian, we gain a covariant center-of-mass moment quasilocalization only under the condition that the displacement on the asymptotic boundary is a Killing boost vector. We expect the spinor expression will bring a proof of some connection between the gravitational energy and angular momentum.

  3. Quadratic Fermi node in a 3D strongly correlated semimetal

    SciTech Connect

    Kondo, Takeshi; Nakayama, M.; Chen, R.; Ishikawa, J. J.; Moon, E. -G.; Yamamoto, T.; Ota, Y.; Malaeb, W.; Kanai, H.; Nakashima, Y.; Ishida, Y.; Yoshida, R.; Yamamoto, H.; Matsunami, M.; Kimura, S.; Inami, N.; Ono, K.; Kumigashira, H.; Nakatsuji, S.; Balents, L.; Shin, S.

    2015-12-07

    We report that strong spin–orbit coupling fosters exotic electronic states such as topological insulators and superconductors, but the combination of strong spin–orbit and strong electron–electron interactions is just beginning to be understood. Central to this emerging area are the 5d transition metal iridium oxides. Here, in the pyrochlore iridate Pr2Ir2O7, we identify a non-trivial state with a single-point Fermi node protected by cubic and time-reversal symmetries, using a combination of angle-resolved photoemission spectroscopy and first-principles calculations. Owing to its quadratic dispersion, the unique coincidence of four degenerate states at the Fermi energy, and strong Coulomb interactions, non-Fermi liquid behaviour is predicted, for which we observe some evidence. Lastly, our discovery implies that Pr2Ir2O7 is a parent state that can be manipulated to produce other strongly correlated topological phases, such as topological Mott insulator, Weyl semimetal, and quantum spin and anomalous Hall states.

  4. Junction conditions in quadratic gravity: thin shells and double layers

    NASA Astrophysics Data System (ADS)

    Reina, Borja; Senovilla, José M. M.; Vera, Raül

    2016-05-01

    The junction conditions for the most general gravitational theory with a Lagrangian containing terms quadratic in the curvature are derived. We include the cases with a possible concentration of matter on the joining hypersurface—termed as thin shells, domain walls or braneworlds in the literature—as well as the proper matching conditions where only finite jumps of the energy-momentum tensor are allowed. In the latter case we prove that the matching conditions are more demanding than in general relativity. In the former case, we show that generically the shells/domain walls are of a new kind because they possess, in addition to the standard energy-momentum tensor, a double layer energy-momentum contribution which actually induces an external energy flux vector and an external scalar pressure/tension on the shell. We prove that all these contributions are necessary to make the entire energy-momentum tensor divergence-free, and we present the field equations satisfied by these energy-momentum quantities. The consequences of all these results are briefly analyzed.

  5. Mechanical cooling in single-photon optomechanics with quadratic nonlinearity

    NASA Astrophysics Data System (ADS)

    Gu, Wen-ju; Yi, Zhen; Sun, Li-hui; Xu, Da-hai

    2015-08-01

    In the paper we study the nonlinear mechanical cooling processes in an intrinsic quadratically optomechanical coupling system without linearizing the optomechanical interaction. We apply scattering theory to calculate the transition rates between different mechanical Fock states using the resolvent of the Hamiltonian, which allows for a direct identification of the underlying physical processes, where only even-phonon transitions are permitted and odd-phonon transitions are forbidden. We verify the feasibility of the approach by comparing the steady-state mean phonon number obtained from transition rates with the simulation of the full quantum master equation, and also discuss the analytical results in the weak coupling limit that coincide with two-phonon mechanical cooling processes. Furthermore, to evaluate the statistical properties of steady mechanical state, we respectively apply the Mandel Q parameter to show that the oscillator can be in nonclassical mechanical states, and the phonon number fluctuations F to display that the even-phonon transitions favor suppressing the phonon number fluctuations compared to the linear coupling optomechanical system.

  6. Quadratic Fermi node in a 3D strongly correlated semimetal

    PubMed Central

    Kondo, Takeshi; Nakayama, M.; Chen, R.; Ishikawa, J. J.; Moon, E.-G.; Yamamoto, T.; Ota, Y.; Malaeb, W.; Kanai, H.; Nakashima, Y.; Ishida, Y.; Yoshida, R.; Yamamoto, H.; Matsunami, M.; Kimura, S.; Inami, N.; Ono, K.; Kumigashira, H.; Nakatsuji, S.; Balents, L.; Shin, S.

    2015-01-01

    Strong spin–orbit coupling fosters exotic electronic states such as topological insulators and superconductors, but the combination of strong spin–orbit and strong electron–electron interactions is just beginning to be understood. Central to this emerging area are the 5d transition metal iridium oxides. Here, in the pyrochlore iridate Pr2Ir2O7, we identify a non-trivial state with a single-point Fermi node protected by cubic and time-reversal symmetries, using a combination of angle-resolved photoemission spectroscopy and first-principles calculations. Owing to its quadratic dispersion, the unique coincidence of four degenerate states at the Fermi energy, and strong Coulomb interactions, non-Fermi liquid behaviour is predicted, for which we observe some evidence. Our discovery implies that Pr2Ir2O7 is a parent state that can be manipulated to produce other strongly correlated topological phases, such as topological Mott insulator, Weyl semimetal, and quantum spin and anomalous Hall states. PMID:26640114

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

    NASA Technical Reports Server (NTRS)

    Ortiz, Francisco

    2004-01-01

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

  8. Generalized SMO algorithm for SVM-based multitask learning.

    PubMed

    Cai, Feng; Cherkassky, Vladimir

    2012-06-01

    Exploiting additional information to improve traditional inductive learning is an active research area in machine learning. In many supervised-learning applications, training data can be naturally separated into several groups, and incorporating this group information into learning may improve generalization. Recently, Vapnik proposed a general approach to formalizing such problems, known as "learning with structured data" and its support vector machine (SVM) based optimization formulation called SVM+. Liang and Cherkassky showed the connection between SVM+ and multitask learning (MTL) approaches in machine learning, and proposed an SVM-based formulation for MTL called SVM+MTL for classification. Training the SVM+MTL classifier requires the solution of a large quadratic programming optimization problem which scales as O(n(3)) with sample size n. So there is a need to develop computationally efficient algorithms for implementing SVM+MTL. This brief generalizes Platt's sequential minimal optimization (SMO) algorithm to the SVM+MTL setting. Empirical results show that, for typical SVM+MTL problems, the proposed generalized SMO achieves over 100 times speed-up, in comparison with general-purpose optimization routines.

  9. Algorithm for Constructing Contour Plots

    NASA Technical Reports Server (NTRS)

    Johnson, W.; Silva, F.

    1984-01-01

    General computer algorithm developed for construction of contour plots. algorithm accepts as input data values at set of points irregularly distributed over plane. Algorithm based on interpolation scheme: points in plane connected by straight-line segments to form set of triangles. Program written in FORTRAN IV.

  10. Grammar Rules as Computer Algorithms.

    ERIC Educational Resources Information Center

    Rieber, Lloyd

    1992-01-01

    One college writing teacher engaged his class in the revision of a computer program to check grammar, focusing on improvement of the algorithms for identifying inappropriate uses of the passive voice. Process and problems of constructing new algorithms, effects on student writing, and other algorithm applications are discussed. (MSE)

  11. Study of sequential optimal control algorithm smart isolation structure based on Simulink-S function

    NASA Astrophysics Data System (ADS)

    Liu, Xiaohuan; Liu, Yanhui

    2017-01-01

    The study of this paper focuses on smart isolation structure, a method for realizing structural vibration control by using Simulink simulation is proposed according to the proposed sequential optimal control algorithm. In the Simulink simulation environment, A smart isolation structure is used to compare the control effect of three algorithms, i.e., classical optimal control algorithm, linear quadratic gaussian control algorithm and sequential optimal control algorithm under the condition of sensor contaminated with noise. Simulation results show that this method can be applied to the simulation of sequential optimal control algorithm and the proposed sequential optimal control algorithm has a good ability of resisting the noise and better control efficiency.

  12. Algorithm for solving of two-level hierarchical minimax program control problem in discrete-time dynamical system with incomplete information

    NASA Astrophysics Data System (ADS)

    Shorikov, A. F.

    2016-12-01

    This article discusses the discrete-time dynamical system consisting from two controlled objects and described by a linear recurrent vector equations in the presence of uncertain perturbations. This dynamical system has two levels of a control: dominant level (the first level or the level I) and subordinate level (the second level or the level II) and both have different linear terminal criterions of functioning and united a priori by determined information and control connections. It is assumed that the sets constraining all a priori undefined parameters are known and they are a finite sets or convex, closed and bounded polyhedrons in the corresponding finite-dimensional vector spaces. For the dynamical system in question, we propose a mathematical formalization in the form of solving two-level hierarchical minimax program control problem with incomplete information. In this article for solving of the investigated problem is proposed the algorithm that has a form of a recurrent procedure of solving a linear programming and a finite optimization problems. The results obtained in this article can be used for computer simulation of an actual dynamical processes and for designing controlling and navigation systems.

  13. The freetext matching algorithm: a computer program to extract diagnoses and causes of death from unstructured text in electronic health records

    PubMed Central

    2012-01-01

    Background Electronic health records are invaluable for medical research, but much information is stored as free text rather than in a coded form. For example, in the UK General Practice Research Database (GPRD), causes of death and test results are sometimes recorded only in free text. Free text can be difficult to use for research if it requires time-consuming manual review. Our aim was to develop an automated method for extracting coded information from free text in electronic patient records. Methods We reviewed the electronic patient records in GPRD of a random sample of 3310 patients who died in 2001, to identify the cause of death. We developed a computer program called the Freetext Matching Algorithm (FMA) to map diagnoses in text to the Read Clinical Terminology. The program uses lookup tables of synonyms and phrase patterns to identify diagnoses, dates and selected test results. We tested it on two random samples of free text from GPRD (1000 texts associated with death in 2001, and 1000 general texts from cases and controls in a coronary artery disease study), comparing the output to the U.S. National Library of Medicine’s MetaMap program and the gold standard of manual review. Results Among 3310 patients registered in the GPRD who died in 2001, the cause of death was recorded in coded form in 38.1% of patients, and in the free text alone in 19.4%. On the 1000 texts associated with death, FMA coded 683 of the 735 positive diagnoses, with precision (positive predictive value) 98.4% (95% confidence interval (CI) 97.2, 99.2) and recall (sensitivity) 92.9% (95% CI 90.8, 94.7). On the general sample, FMA detected 346 of the 447 positive diagnoses, with precision 91.5% (95% CI 88.3, 94.1) and recall 77.4% (95% CI 73.2, 81.2), which was similar to MetaMap. Conclusions We have developed an algorithm to extract coded information from free text in GP records with good precision. It may facilitate research using free text in electronic patient records

  14. Elastic Model Transitions: a Hybrid Approach Utilizing Quadratic Inequality Constrained Least Squares (LSQI) and Direct Shape Mapping (DSM)

    NASA Technical Reports Server (NTRS)

    Jurenko, Robert J.; Bush, T. Jason; Ottander, John A.

    2014-01-01

    A method for transitioning linear time invariant (LTI) models in time varying simulation is proposed that utilizes both quadratically constrained least squares (LSQI) and Direct Shape Mapping (DSM) algorithms to determine physical displacements. This approach is applicable to the simulation of the elastic behavior of launch vehicles and other structures that utilize multiple LTI finite element model (FEM) derived mode sets that are propagated throughout time. The time invariant nature of the elastic data for discrete segments of the launch vehicle trajectory presents a problem of how to properly transition between models while preserving motion across the transition. In addition, energy may vary between flex models when using a truncated mode set. The LSQI-DSM algorithm can accommodate significant changes in energy between FEM models and carries elastic motion across FEM model transitions. Compared with previous approaches, the LSQI-DSM algorithm shows improvements ranging from a significant reduction to a complete removal of transients across FEM model transitions as well as maintaining elastic motion from the prior state.

  15. Resistive Wall Mode feedback on DIII-D using Linear Quadratic Gaussian control and a GPU powered control system

    NASA Astrophysics Data System (ADS)

    Clement, M. D.; Navratil, G. A.; Hanson, J. M.; Bialek, J.; Piglowski, D. A.; Penaflor, B. G.

    2015-11-01

    A Graphics Processing Unit (GPU) based control system has been installed on the DIII-D tokamak for Resistive Wall Mode (RWM) control similar to one implemented at the HBT-EP tokamak. DIII-D can excite RWMs, which are strong, locked or nearly locked kink modes whose rotation frequencies do not evolve quickly and are slow compared to their growth rates. Simulations have predicted that modern control techniques like Linear Quadratic Gaussian (LQG) control will perform better than classical control techniques when using control coils external to the vacuum vessel. An LQG control algorithm based on the VALEN model for the RWM has been developed and tested on this system. Early tests have shown the algorithm is able to track and suppress with external control coils the plasma response of an n=1 perturbation driven by internal control coils. An overview of the control hardware, VALEN model, control algorithm and initial results will be presented. Supported by the US DOE under DE-FG02-04ER54761 and DE-FC02-04ER54698.

  16. Genetic algorithms

    NASA Technical Reports Server (NTRS)

    Wang, Lui; Bayer, Steven E.

    1991-01-01

    Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.

  17. Two linear time, low overhead algorithms for graph layout

    SciTech Connect

    Wylie, Brian; Baumes, Jeff

    2008-01-10

    The software comprises two algorithms designed to perform a 2D layout of a graph structure in time linear with respect to the vertices and edges in the graph, whereas most other layout algorithms have a running time that is quadratic with respect to the number of vertices or greater. Although these layout algorithms run in a fraction of the time as their competitors, they provide competitive results when applied to most real-world graphs. These algorithms also have a low constant running time and small memory footprint, making them useful for small to large graphs.

  18. Inverse synthetic aperture radar imaging of targets with complex motions based on modified chirp rate-quadratic chirp rate distribution for cubic phase signal

    NASA Astrophysics Data System (ADS)

    Yanyan, Li; Tao, Su; Jibin, Zheng

    2015-01-01

    For targets with complex motions, the time-varying Doppler frequency deteriorates inverse synthetic aperture radar (ISAR) images. After range alignment and phase adjustment, azimuth echoes in a range cell can be modeled as multicomponent cubic phase signals (CPSs). The chirp rate and the quadratic chirp rate of the CPS are identified as the causes of the time-varying Doppler frequency; thus, it is necessary to estimate these two parameters correctly to obtain a well-focused ISAR image. The parameter-estimation algorithm based on the modified chirp rate-quadratic chirp rate distribution (M-CRQCRD) is proposed for the CPS and applied to the ISAR imaging of targets with complex motions. The computational cost of M-CRQCRD is low, because it can be implemented by the fast Fourier transform (FFT) and the nonuniform FFT easily. Compared to two representative parameter-estimation algorithms, the M-CRQCRD can acquire a higher antinoise performance due to the introduction of an optimal lag-time. Through simulations and analyses for the synthetic radar data, the effectiveness of the M-CRQCRD and the imaging algorithm based on the M-CRQCRD are verified.

  19. Algorithm Calculates Cumulative Poisson Distribution

    NASA Technical Reports Server (NTRS)

    Bowerman, Paul N.; Nolty, Robert C.; Scheuer, Ernest M.

    1992-01-01

    Algorithm calculates accurate values of cumulative Poisson distribution under conditions where other algorithms fail because numbers are so small (underflow) or so large (overflow) that computer cannot process them. Factors inserted temporarily to prevent underflow and overflow. Implemented in CUMPOIS computer program described in "Cumulative Poisson Distribution Program" (NPO-17714).

  20. An integrated portfolio optimisation procedure based on data envelopment analysis, artificial bee colony algorithm and genetic programming

    NASA Astrophysics Data System (ADS)

    Hsu, Chih-Ming

    2014-12-01

    Portfolio optimisation is an important issue in the field of investment/financial decision-making and has received considerable attention from both researchers and practitioners. However, besides portfolio optimisation, a complete investment procedure should also include the selection of profitable investment targets and determine the optimal timing for buying/selling the investment targets. In this study, an integrated procedure using data envelopment analysis (DEA), artificial bee colony (ABC) and genetic programming (GP) is proposed to resolve a portfolio optimisation problem. The proposed procedure is evaluated through a case study on investing in stocks in the semiconductor sub-section of the Taiwan stock market for 4 years. The potential average 6-month return on investment of 9.31% from 1 November 2007 to 31 October 2011 indicates that the proposed procedure can be considered a feasible and effective tool for making outstanding investment plans, and thus making profits in the Taiwan stock market. Moreover, it is a strategy that can help investors to make profits even when the overall stock market suffers a loss.