An efficient inverse radiotherapy planning method for VMAT using quadratic programming optimization.

PubMed

Hoegele, W; Loeschel, R; Merkle, N; Zygmanski, P

2012-01-01

The purpose of this study is to investigate the feasibility of an inverse planning optimization approach for the Volumetric Modulated Arc Therapy (VMAT) based on quadratic programming and the projection method. The performance of this method is evaluated against a reference commercial planning system (eclipse(TM) for rapidarc(TM)) for clinically relevant cases. The inverse problem is posed in terms of a linear combination of basis functions representing arclet dose contributions and their respective linear coefficients as degrees of freedom. MLC motion is decomposed into basic motion patterns in an intuitive manner leading to a system of equations with a relatively small number of equations and unknowns. These equations are solved using quadratic programming under certain limiting physical conditions for the solution, such as the avoidance of negative dose during optimization and Monitor Unit reduction. The modeling by the projection method assures a unique treatment plan with beneficial properties, such as the explicit relation between organ weightings and the final dose distribution. Clinical cases studied include prostate and spine treatments. The optimized plans are evaluated by comparing isodose lines, DVH profiles for target and normal organs, and Monitor Units to those obtained by the clinical treatment planning system eclipse(TM). The resulting dose distributions for a prostate (with rectum and bladder as organs at risk), and for a spine case (with kidneys, liver, lung and heart as organs at risk) are presented. Overall, the results indicate that similar plan qualities for quadratic programming (QP) and rapidarc(TM) could be achieved at significantly more efficient computational and planning effort using QP. Additionally, results for the quasimodo phantom [Bohsung et al., "IMRT treatment planning: A comparative inter-system and inter-centre planning exercise of the estro quasimodo group," Radiother. Oncol. 76(3), 354-361 (2005)] are presented as an example

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.

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.

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.

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

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

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 notmore » assumed that the iterates lie on a compact set.« less

Quadrat Data for Fermilab Prairie Plant Survey

Science.gov Websites

Quadrat Data 2012 Quadrat Data 2013 Quadrat Data None taken by volunteers in 2014 due to weather problems . 2015 Quadrat Data 2016 Quadrat Data None taken by volunteers in 2017 due to weather and other problems

A Factorization Approach to the Linear Regulator Quadratic Cost Problem

NASA Technical Reports Server (NTRS)

Milman, M. H.

1985-01-01

A factorization approach to the linear regulator quadratic cost problem is developed. This approach makes some new connections between optimal control, factorization, Riccati equations and certain Wiener-Hopf operator equations. Applications of the theory to systems describable by evolution equations in Hilbert space and differential delay equations in Euclidean space are presented.

Quadratic Optimisation with One Quadratic Equality Constraint

DTIC Science & Technology

2010-06-01

This report presents a theoretical framework for minimising a quadratic objective function subject to a quadratic equality constraint. The first part of the report gives a detailed algorithm which computes the global minimiser without calling special nonlinear optimisation solvers. The second part of the report shows how the developed theory can be applied to solve the time of arrival geolocation problem.

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.

A time-domain decomposition iterative method for the solution of distributed linear quadratic optimal control problems

NASA Astrophysics Data System (ADS)

Heinkenschloss, Matthias

2005-01-01

We study a class of time-domain decomposition-based methods for the numerical solution of large-scale linear quadratic optimal control problems. Our methods are based on a multiple shooting reformulation of the linear quadratic optimal control problem as a discrete-time optimal control (DTOC) problem. The optimality conditions for this DTOC problem lead to a linear block tridiagonal system. The diagonal blocks are invertible and are related to the original linear quadratic optimal control problem restricted to smaller time-subintervals. This motivates the application of block Gauss-Seidel (GS)-type methods for the solution of the block tridiagonal systems. Numerical experiments show that the spectral radii of the block GS iteration matrices are larger than one for typical applications, but that the eigenvalues of the iteration matrices decay to zero fast. Hence, while the GS method is not expected to convergence for typical applications, it can be effective as a preconditioner for Krylov-subspace methods. This is confirmed by our numerical tests.A byproduct of this research is the insight that certain instantaneous control techniques can be viewed as the application of one step of the forward block GS method applied to the DTOC optimality system.

Improved Evolutionary Programming with Various Crossover Techniques for Optimal Power Flow Problem

NASA Astrophysics Data System (ADS)

Tangpatiphan, Kritsana; Yokoyama, Akihiko

This paper presents an Improved Evolutionary Programming (IEP) for solving the Optimal Power Flow (OPF) problem, which is considered as a non-linear, non-smooth, and multimodal optimization problem in power system operation. The total generator fuel cost is regarded as an objective function to be minimized. The proposed method is an Evolutionary Programming (EP)-based algorithm with making use of various crossover techniques, normally applied in Real Coded Genetic Algorithm (RCGA). The effectiveness of the proposed approach is investigated on the IEEE 30-bus system with three different types of fuel cost functions; namely the quadratic cost curve, the piecewise quadratic cost curve, and the quadratic cost curve superimposed by sine component. These three cost curves represent the generator fuel cost functions with a simplified model and more accurate models of a combined-cycle generating unit and a thermal unit with value-point loading effect respectively. The OPF solutions by the proposed method and Pure Evolutionary Programming (PEP) are observed and compared. The simulation results indicate that IEP requires less computing time than PEP with better solutions in some cases. Moreover, the influences of important IEP parameters on the OPF solution are described in details.

Discrete Time McKean–Vlasov Control Problem: A Dynamic Programming Approach

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

Pham, Huyên, E-mail: pham@math.univ-paris-diderot.fr; Wei, Xiaoli, E-mail: tyswxl@gmail.com

We consider the stochastic optimal control problem of nonlinear mean-field systems in discrete time. We reformulate the problem into a deterministic control problem with marginal distribution as controlled state variable, and prove that dynamic programming principle holds in its general form. We apply our method for solving explicitly the mean-variance portfolio selection and the multivariate linear-quadratic McKean–Vlasov control problem.

Some insights on hard quadratic assignment problem instances

NASA Astrophysics Data System (ADS)

Hussin, Mohamed Saifullah

2017-11-01

Since the formal introduction of metaheuristics, a huge number Quadratic Assignment Problem (QAP) instances have been introduced. Those instances however are loosely-structured, and therefore made it difficult to perform any systematic analysis. The QAPLIB for example, is a library that contains a huge number of QAP benchmark instances that consists of instances with different size and structure, but with a very limited availability for every instance type. This prevents researchers from performing organized study on those instances, such as parameter tuning and testing. In this paper, we will discuss several hard instances that have been introduced over the years, and algorithms that have been used for solving them.

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.

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

DOE PAGES

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 quadraticmore » 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).« less

Local classifier weighting by quadratic programming.

PubMed

Cevikalp, Hakan; Polikar, Robi

2008-10-01

It has been widely accepted that the classification accuracy can be improved by combining outputs of multiple classifiers. However, how to combine multiple classifiers with various (potentially conflicting) decisions is still an open problem. A rich collection of classifier combination procedures -- many of which are heuristic in nature -- have been developed for this goal. In this brief, we describe a dynamic approach to combine classifiers that have expertise in different regions of the input space. To this end, we use local classifier accuracy estimates to weight classifier outputs. Specifically, we estimate local recognition accuracies of classifiers near a query sample by utilizing its nearest neighbors, and then use these estimates to find the best weights of classifiers to label the query. The problem is formulated as a convex quadratic optimization problem, which returns optimal nonnegative classifier weights with respect to the chosen objective function, and the weights ensure that locally most accurate classifiers are weighted more heavily for labeling the query sample. Experimental results on several data sets indicate that the proposed weighting scheme outperforms other popular classifier combination schemes, particularly on problems with complex decision boundaries. Hence, the results indicate that local classification-accuracy-based combination techniques are well suited for decision making when the classifiers are trained by focusing on different regions of the input space.

Conic Sampling: An Efficient Method for Solving Linear and Quadratic Programming by Randomly Linking Constraints within the Interior

PubMed Central

Serang, Oliver

2012-01-01

Linear programming (LP) problems are commonly used in analysis and resource allocation, frequently surfacing as approximations to more difficult problems. Existing approaches to LP have been dominated by a small group of methods, and randomized algorithms have not enjoyed popularity in practice. This paper introduces a novel randomized method of solving LP problems by moving along the facets and within the interior of the polytope along rays randomly sampled from the polyhedral cones defined by the bounding constraints. This conic sampling method is then applied to randomly sampled LPs, and its runtime performance is shown to compare favorably to the simplex and primal affine-scaling algorithms, especially on polytopes with certain characteristics. The conic sampling method is then adapted and applied to solve a certain quadratic program, which compute a projection onto a polytope; the proposed method is shown to outperform the proprietary software Mathematica on large, sparse QP problems constructed from mass spectometry-based proteomics. PMID:22952741

Estimation of positive semidefinite correlation matrices by using convex quadratic semidefinite programming.

PubMed

Fushiki, Tadayoshi

2009-07-01

The correlation matrix is a fundamental statistic that is used in many fields. For example, GroupLens, a collaborative filtering system, uses the correlation between users for predictive purposes. Since the correlation is a natural similarity measure between users, the correlation matrix may be used in the Gram matrix in kernel methods. However, the estimated correlation matrix sometimes has a serious defect: although the correlation matrix is originally positive semidefinite, the estimated one may not be positive semidefinite when not all ratings are observed. To obtain a positive semidefinite correlation matrix, the nearest correlation matrix problem has recently been studied in the fields of numerical analysis and optimization. However, statistical properties are not explicitly used in such studies. To obtain a positive semidefinite correlation matrix, we assume the approximate model. By using the model, an estimate is obtained as the optimal point of an optimization problem formulated with information on the variances of the estimated correlation coefficients. The problem is solved by a convex quadratic semidefinite program. A penalized likelihood approach is also examined. The MovieLens data set is used to test our approach.

Linear quadratic tracking problems in Hilbert space - Application to optimal active noise suppression

NASA Technical Reports Server (NTRS)

Banks, H. T.; Silcox, R. J.; Keeling, S. L.; Wang, C.

1989-01-01

A unified treatment of the linear quadratic tracking (LQT) problem, in which a control system's dynamics are modeled by a linear evolution equation with a nonhomogeneous component that is linearly dependent on the control function u, is presented; the treatment proceeds from the theoretical formulation to a numerical approximation framework. Attention is given to two categories of LQT problems in an infinite time interval: the finite energy and the finite average energy. The behavior of the optimal solution for finite time-interval problems as the length of the interval tends to infinity is discussed. Also presented are the formulations and properties of LQT problems in a finite time interval.

Optimization strategies based on sequential quadratic programming applied for a fermentation process for butanol production.

PubMed

Pinto Mariano, Adriano; Bastos Borba Costa, Caliane; de Franceschi de Angelis, Dejanira; Maugeri Filho, Francisco; Pires Atala, Daniel Ibraim; Wolf Maciel, Maria Regina; Maciel Filho, Rubens

2009-11-01

In this work, the mathematical optimization of a continuous flash fermentation process for the production of biobutanol was studied. The process consists of three interconnected units, as follows: fermentor, cell-retention system (tangential microfiltration), and vacuum flash vessel (responsible for the continuous recovery of butanol from the broth). The objective of the optimization was to maximize butanol productivity for a desired substrate conversion. Two strategies were compared for the optimization of the process. In one of them, the process was represented by a deterministic model with kinetic parameters determined experimentally and, in the other, by a statistical model obtained using the factorial design technique combined with simulation. For both strategies, the problem was written as a nonlinear programming problem and was solved with the sequential quadratic programming technique. The results showed that despite the very similar solutions obtained with both strategies, the problems found with the strategy using the deterministic model, such as lack of convergence and high computational time, make the use of the optimization strategy with the statistical model, which showed to be robust and fast, more suitable for the flash fermentation process, being recommended for real-time applications coupling optimization and control.

Robustness in linear quadratic feedback design with application to an aircraft control problem

NASA Technical Reports Server (NTRS)

Patel, R. V.; Sridhar, B.; Toda, M.

1977-01-01

Some new results concerning robustness and asymptotic properties of error bounds of a linear quadratic feedback design are applied to an aircraft control problem. An autopilot for the flare control of the Augmentor Wing Jet STOL Research Aircraft (AWJSRA) is designed based on Linear Quadratic (LQ) theory and the results developed in this paper. The variation of the error bounds to changes in the weighting matrices in the LQ design is studied by computer simulations, and appropriate weighting matrices are chosen to obtain a reasonable error bound for variations in the system matrix and at the same time meet the practical constraints for the flare maneuver of the AWJSRA. Results from the computer simulation of a satisfactory autopilot design for the flare control of the AWJSRA are presented.

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…

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)

Development of Quadratic Programming Algorithm Based on Interior Point Method with Estimation Mechanism of Active Constraints

NASA Astrophysics Data System (ADS)

Hashimoto, Hiroyuki; Takaguchi, Yusuke; Nakamura, Shizuka

Instability of calculation process and increase of calculation time caused by increasing size of continuous optimization problem remain the major issues to be solved to apply the technique to practical industrial systems. This paper proposes an enhanced quadratic programming algorithm based on interior point method mainly for improvement of calculation stability. The proposed method has dynamic estimation mechanism of active constraints on variables, which fixes the variables getting closer to the upper/lower limit on them and afterwards releases the fixed ones as needed during the optimization process. It is considered as algorithm-level integration of the solution strategy of active-set method into the interior point method framework. We describe some numerical results on commonly-used bench-mark problems called “CUTEr” to show the effectiveness of the proposed method. Furthermore, the test results on large-sized ELD problem (Economic Load Dispatching problems in electric power supply scheduling) are also described as a practical industrial application.

Numerical approximation for the infinite-dimensional discrete-time optimal linear-quadratic regulator problem

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Rosen, I. G.

1986-01-01

An abstract approximation framework is developed for the finite and infinite time horizon discrete-time linear-quadratic regulator problem for systems whose state dynamics are described by a linear semigroup of operators on an infinite dimensional Hilbert space. The schemes included the framework yield finite dimensional approximations to the linear state feedback gains which determine the optimal control law. Convergence arguments are given. Examples involving hereditary and parabolic systems and the vibration of a flexible beam are considered. Spline-based finite element schemes for these classes of problems, together with numerical results, are presented and discussed.

A Sequential Linear Quadratic Approach for Constrained Nonlinear Optimal Control with Adaptive Time Discretization and Application to Higher Elevation Mars Landing Problem

NASA Astrophysics Data System (ADS)

Sandhu, Amit

A sequential quadratic programming method is proposed for solving nonlinear optimal control problems subject to general path constraints including mixed state-control and state only constraints. The proposed algorithm further develops on the approach proposed in [1] with objective to eliminate the use of a high number of time intervals for arriving at an optimal solution. This is done by introducing an adaptive time discretization to allow formation of a desirable control profile without utilizing a lot of intervals. The use of fewer time intervals reduces the computation time considerably. This algorithm is further used in this thesis to solve a trajectory planning problem for higher elevation Mars landing.

Constrained multiple indicator kriging using sequential quadratic programming

NASA Astrophysics Data System (ADS)

Soltani-Mohammadi, Saeed; Erhan Tercan, A.

2012-11-01

Multiple indicator kriging (MIK) is a nonparametric method used to estimate conditional cumulative distribution functions (CCDF). Indicator estimates produced by MIK may not satisfy the order relations of a valid CCDF which is ordered and bounded between 0 and 1. In this paper a new method has been presented that guarantees the order relations of the cumulative distribution functions estimated by multiple indicator kriging. The method is based on minimizing the sum of kriging variances for each cutoff under unbiasedness and order relations constraints and solving constrained indicator kriging system by sequential quadratic programming. A computer code is written in the Matlab environment to implement the developed algorithm and the method is applied to the thickness data.

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…

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)

Inverse Scattering Problem For The Schrödinger Equation With An Additional Quadratic Potential On The Entire Axis

NASA Astrophysics Data System (ADS)

Guseinov, I. M.; Khanmamedov, A. Kh.; Mamedova, A. F.

2018-04-01

We consider the Schrödinger equation with an additional quadratic potential on the entire axis and use the transformation operator method to study the direct and inverse problems of the scattering theory. We obtain the main integral equations of the inverse problem and prove that the basic equations are uniquely solvable.

Application of the sequential quadratic programming algorithm for reconstructing the distribution of optical parameters based on the time-domain radiative transfer equation.

PubMed

Qi, Hong; Qiao, Yao-Bin; Ren, Ya-Tao; Shi, Jing-Wen; Zhang, Ze-Yu; Ruan, Li-Ming

2016-10-17

Sequential quadratic programming (SQP) is used as an optimization algorithm to reconstruct the optical parameters based on the time-domain radiative transfer equation (TD-RTE). Numerous time-resolved measurement signals are obtained using the TD-RTE as forward model. For a high computational efficiency, the gradient of objective function is calculated using an adjoint equation technique. SQP algorithm is employed to solve the inverse problem and the regularization term based on the generalized Gaussian Markov random field (GGMRF) model is used to overcome the ill-posed problem. Simulated results show that the proposed reconstruction scheme performs efficiently and accurately.

The reduced space Sequential Quadratic Programming (SQP) method for calculating the worst resonance response of nonlinear systems

NASA Astrophysics Data System (ADS)

Liao, Haitao; Wu, Wenwang; Fang, Daining

2018-07-01

A coupled approach combining the reduced space Sequential Quadratic Programming (SQP) method with the harmonic balance condensation technique for finding the worst resonance response is developed. The nonlinear equality constraints of the optimization problem are imposed on the condensed harmonic balance equations. Making use of the null space decomposition technique, the original optimization formulation in the full space is mathematically simplified, and solved in the reduced space by means of the reduced SQP method. The transformation matrix that maps the full space to the null space of the constrained optimization problem is constructed via the coordinate basis scheme. The removal of the nonlinear equality constraints is accomplished, resulting in a simple optimization problem subject to bound constraints. Moreover, second order correction technique is introduced to overcome Maratos effect. The combination application of the reduced SQP method and condensation technique permits a large reduction of the computational cost. Finally, the effectiveness and applicability of the proposed methodology is demonstrated by two numerical examples.

Legendre-tau approximation for functional differential equations. II - The linear quadratic optimal control problem

NASA Technical Reports Server (NTRS)

Ito, Kazufumi; Teglas, Russell

1987-01-01

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

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

Convergence of neural networks for programming problems via a nonsmooth Lojasiewicz inequality.

PubMed

Forti, Mauro; Nistri, Paolo; Quincampoix, Marc

2006-11-01

This paper considers a class of neural networks (NNs) for solving linear programming (LP) problems, convex quadratic programming (QP) problems, and nonconvex QP problems where an indefinite quadratic objective function is subject to a set of affine constraints. The NNs are characterized by constraint neurons modeled by ideal diodes with vertical segments in their characteristic, which enable to implement an exact penalty method. A new method is exploited to address convergence of trajectories, which is based on a nonsmooth Lojasiewicz inequality for the generalized gradient vector field describing the NN dynamics. The method permits to prove that each forward trajectory of the NN has finite length, and as a consequence it converges toward a singleton. Furthermore, by means of a quantitative evaluation of the Lojasiewicz exponent at the equilibrium points, the following results on convergence rate of trajectories are established: (1) for nonconvex QP problems, each trajectory is either exponentially convergent, or convergent in finite time, toward a singleton belonging to the set of constrained critical points; (2) for convex QP problems, the same result as in (1) holds; moreover, the singleton belongs to the set of global minimizers; and (3) for LP problems, each trajectory converges in finite time to a singleton belonging to the set of global minimizers. These results, which improve previous results obtained via the Lyapunov approach, are true independently of the nature of the set of equilibrium points, and in particular they hold even when the NN possesses infinitely many nonisolated equilibrium points.

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.

Closed-form solutions for a class of optimal quadratic regulator problems with terminal constraints

NASA Technical Reports Server (NTRS)

Juang, J.-N.; Turner, J. D.; Chun, H. M.

1984-01-01

Closed-form solutions are derived for coupled Riccati-like matrix differential equations describing the solution of a class of optimal finite time quadratic regulator problems with terminal constraints. Analytical solutions are obtained for the feedback gains and the closed-loop response trajectory. A computational procedure is presented which introduces new variables for efficient computation of the terminal control law. Two examples are given to illustrate the validity and usefulness of the theory.

Permutation flow-shop scheduling problem to optimize a quadratic objective function

NASA Astrophysics Data System (ADS)

Ren, Tao; Zhao, Peng; Zhang, Da; Liu, Bingqian; Yuan, Huawei; Bai, Danyu

2017-09-01

A flow-shop scheduling model enables appropriate sequencing for each job and for processing on a set of machines in compliance with identical processing orders. The objective is to achieve a feasible schedule for optimizing a given criterion. Permutation is a special setting of the model in which the processing order of the jobs on the machines is identical for each subsequent step of processing. This article addresses the permutation flow-shop scheduling problem to minimize the criterion of total weighted quadratic completion time. With a probability hypothesis, the asymptotic optimality of the weighted shortest processing time schedule under a consistency condition (WSPT-CC) is proven for sufficiently large-scale problems. However, the worst case performance ratio of the WSPT-CC schedule is the square of the number of machines in certain situations. A discrete differential evolution algorithm, where a new crossover method with multiple-point insertion is used to improve the final outcome, is presented to obtain high-quality solutions for moderate-scale problems. A sequence-independent lower bound is designed for pruning in a branch-and-bound algorithm for small-scale problems. A set of random experiments demonstrates the performance of the lower bound and the effectiveness of the proposed algorithms.

Legendre-tau approximation for functional differential equations. Part 2: The linear quadratic optimal control problem

NASA Technical Reports Server (NTRS)

Ito, K.; Teglas, R.

1984-01-01

The numerical scheme based on the Legendre-tau approximation is proposed to approximate the feedback solution to the linear quadratic optimal control problem for hereditary differential systems. The convergence property is established using Trotter ideas. The method yields very good approximations at low orders and provides an approximation technique for computing closed-loop eigenvalues of the feedback system. A comparison with existing methods (based on averaging and spline approximations) is made.

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.

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.

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)

Homotopy approach to optimal, linear quadratic, fixed architecture compensation

NASA Technical Reports Server (NTRS)

Mercadal, Mathieu

1991-01-01

Optimal linear quadratic Gaussian compensators with constrained architecture are a sensible way to generate good multivariable feedback systems meeting strict implementation requirements. The optimality conditions obtained from the constrained linear quadratic Gaussian are a set of highly coupled matrix equations that cannot be solved algebraically except when the compensator is centralized and full order. An alternative to the use of general parameter optimization methods for solving the problem is to use homotopy. The benefit of the method is that it uses the solution to a simplified problem as a starting point and the final solution is then obtained by solving a simple differential equation. This paper investigates the convergence properties and the limitation of such an approach and sheds some light on the nature and the number of solutions of the constrained linear quadratic Gaussian problem. It also demonstrates the usefulness of homotopy on an example of an optimal decentralized compensator.

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.

A case study in programming a quantum annealer for hard operational planning problems

NASA Astrophysics Data System (ADS)

Rieffel, Eleanor G.; Venturelli, Davide; O'Gorman, Bryan; Do, Minh B.; Prystay, Elicia M.; Smelyanskiy, Vadim N.

2015-01-01

We report on a case study in programming an early quantum annealer to attack optimization problems related to operational planning. While a number of studies have looked at the performance of quantum annealers on problems native to their architecture, and others have examined performance of select problems stemming from an application area, ours is one of the first studies of a quantum annealer's performance on parametrized families of hard problems from a practical domain. We explore two different general mappings of planning problems to quadratic unconstrained binary optimization (QUBO) problems, and apply them to two parametrized families of planning problems, navigation-type and scheduling-type. We also examine two more compact, but problem-type specific, mappings to QUBO, one for the navigation-type planning problems and one for the scheduling-type planning problems. We study embedding properties and parameter setting and examine their effect on the efficiency with which the quantum annealer solves these problems. From these results, we derive insights useful for the programming and design of future quantum annealers: problem choice, the mapping used, the properties of the embedding, and the annealing profile all matter, each significantly affecting the performance.

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

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.

Quadratic constrained mixed discrete optimization with an adiabatic quantum optimizer

NASA Astrophysics Data System (ADS)

Chandra, Rishabh; Jacobson, N. Tobias; Moussa, Jonathan E.; Frankel, Steven H.; Kais, Sabre

2014-07-01

We extend the family of problems that may be implemented on an adiabatic quantum optimizer (AQO). When a quadratic optimization problem has at least one set of discrete controls and the constraints are linear, we call this a quadratic constrained mixed discrete optimization (QCMDO) problem. QCMDO problems are NP-hard, and no efficient classical algorithm for their solution is known. Included in the class of QCMDO problems are combinatorial optimization problems constrained by a linear partial differential equation (PDE) or system of linear PDEs. An essential complication commonly encountered in solving this type of problem is that the linear constraint may introduce many intermediate continuous variables into the optimization while the computational cost grows exponentially with problem size. We resolve this difficulty by developing a constructive mapping from QCMDO to quadratic unconstrained binary optimization (QUBO) such that the size of the QUBO problem depends only on the number of discrete control variables. With a suitable embedding, taking into account the physical constraints of the realizable coupling graph, the resulting QUBO problem can be implemented on an existing AQO. The mapping itself is efficient, scaling cubically with the number of continuous variables in the general case and linearly in the PDE case if an efficient preconditioner is available.

A mixed analog/digital chaotic neuro-computer system for quadratic assignment problems.

PubMed

Horio, Yoshihiko; Ikeguchi, Tohru; Aihara, Kazuyuki

2005-01-01

We construct a mixed analog/digital chaotic neuro-computer prototype system for quadratic assignment problems (QAPs). The QAP is one of the difficult NP-hard problems, and includes several real-world applications. Chaotic neural networks have been used to solve combinatorial optimization problems through chaotic search dynamics, which efficiently searches optimal or near optimal solutions. However, preliminary experiments have shown that, although it obtained good feasible solutions, the Hopfield-type chaotic neuro-computer hardware system could not obtain the optimal solution of the QAP. Therefore, in the present study, we improve the system performance by adopting a solution construction method, which constructs a feasible solution using the analog internal state values of the chaotic neurons at each iteration. In order to include the construction method into our hardware, we install a multi-channel analog-to-digital conversion system to observe the internal states of the chaotic neurons. We show experimentally that a great improvement in the system performance over the original Hopfield-type chaotic neuro-computer is obtained. That is, we obtain the optimal solution for the size-10 QAP in less than 1000 iterations. In addition, we propose a guideline for parameter tuning of the chaotic neuro-computer system according to the observation of the internal states of several chaotic neurons in the network.

Shifting the closed-loop spectrum in the optimal linear quadratic regulator problem for hereditary systems

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Rosen, I. G.

1985-01-01

In the optimal linear quadratic regulator problem for finite dimensional systems, the method known as an alpha-shift can be used to produce a closed-loop system whose spectrum lies to the left of some specified vertical line; that is, a closed-loop system with a prescribed degree of stability. This paper treats the extension of the alpha-shift to hereditary systems. As infinite dimensions, the shift can be accomplished by adding alpha times the identity to the open-loop semigroup generator and then solving an optimal regulator problem. However, this approach does not work with a new approximation scheme for hereditary control problems recently developed by Kappel and Salamon. Since this scheme is among the best to date for the numerical solution of the linear regulator problem for hereditary systems, an alternative method for shifting the closed-loop spectrum is needed. An alpha-shift technique that can be used with the Kappel-Salamon approximation scheme is developed. Both the continuous-time and discrete-time problems are considered. A numerical example which demonstrates the feasibility of the method is included.

Shifting the closed-loop spectrum in the optimal linear quadratic regulator problem for hereditary systems

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Rosen, I. G.

1987-01-01

In the optimal linear quadratic regulator problem for finite dimensional systems, the method known as an alpha-shift can be used to produce a closed-loop system whose spectrum lies to the left of some specified vertical line; that is, a closed-loop system with a prescribed degree of stability. This paper treats the extension of the alpha-shift to hereditary systems. As infinite dimensions, the shift can be accomplished by adding alpha times the identity to the open-loop semigroup generator and then solving an optimal regulator problem. However, this approach does not work with a new approximation scheme for hereditary control problems recently developed by Kappel and Salamon. Since this scheme is among the best to date for the numerical solution of the linear regulator problem for hereditary systems, an alternative method for shifting the closed-loop spectrum is needed. An alpha-shift technique that can be used with the Kappel-Salamon approximation scheme is developed. Both the continuous-time and discrete-time problems are considered. A numerical example which demonstrates the feasibility of the method is included.

AESOP- INTERACTIVE DESIGN OF LINEAR QUADRATIC REGULATORS AND KALMAN FILTERS

NASA Technical Reports Server (NTRS)

Lehtinen, B.

1994-01-01

AESOP was developed to solve a number of problems associated with the design of controls and state estimators for linear time-invariant systems. The systems considered are modeled in state-variable form by a set of linear differential and algebraic equations with constant coefficients. Two key problems solved by AESOP are the linear quadratic regulator (LQR) design problem and the steady-state Kalman filter design problem. AESOP is designed to be used in an interactive manner. The user can solve design problems and analyze the solutions in a single interactive session. Both numerical and graphical information are available to the user during the session. The AESOP program is structured around a list of predefined functions. Each function performs a single computation associated with control, estimation, or system response determination. AESOP contains over sixty functions and permits the easy inclusion of user defined functions. The user accesses these functions either by inputting a list of desired functions in the order they are to be performed, or by specifying a single function to be performed. The latter case is used when the choice of function and function order depends on the results of previous functions. The available AESOP functions are divided into several general areas including: 1) program control, 2) matrix input and revision, 3) matrix formation, 4) open-loop system analysis, 5) frequency response, 6) transient response, 7) transient function zeros, 8) LQR and Kalman filter design, 9) eigenvalues and eigenvectors, 10) covariances, and 11) user-defined functions. The most important functions are those that design linear quadratic regulators and Kalman filters. The user interacts with AESOP when using these functions by inputting design weighting parameters and by viewing displays of designed system response. Support functions obtain system transient and frequency responses, transfer functions, and covariance matrices. AESOP can also provide the user

Linear quadratic optimization for positive LTI system

NASA Astrophysics Data System (ADS)

Muhafzan, Yenti, Syafrida Wirma; Zulakmal

2017-05-01

Nowaday the linear quadratic optimization subject to positive linear time invariant (LTI) system constitute an interesting study considering it can become a mathematical model of variety of real problem whose variables have to nonnegative and trajectories generated by these variables must be nonnegative. In this paper we propose a method to generate an optimal control of linear quadratic optimization subject to positive linear time invariant (LTI) system. A sufficient condition that guarantee the existence of such optimal control is discussed.

Linear Matrix Inequality Method for a Quadratic Performance Index Minimization Problem with a class of Bilinear Matrix Inequality Conditions

NASA Astrophysics Data System (ADS)

Tanemura, M.; Chida, Y.

2016-09-01

There are a lot of design problems of control system which are expressed as a performance index minimization under BMI conditions. However, a minimization problem expressed as LMIs can be easily solved because of the convex property of LMIs. Therefore, many researchers have been studying transforming a variety of control design problems into convex minimization problems expressed as LMIs. This paper proposes an LMI method for a quadratic performance index minimization problem with a class of BMI conditions. The minimization problem treated in this paper includes design problems of state-feedback gain for switched system and so on. The effectiveness of the proposed method is verified through a state-feedback gain design for switched systems and a numerical simulation using the designed feedback gains.

Adaptive dynamic programming for discrete-time linear quadratic regulation based on multirate generalised policy iteration

NASA Astrophysics Data System (ADS)

Chun, Tae Yoon; Lee, Jae Young; Park, Jin Bae; Choi, Yoon Ho

2018-06-01

In this paper, we propose two multirate generalised policy iteration (GPI) algorithms applied to discrete-time linear quadratic regulation problems. The proposed algorithms are extensions of the existing GPI algorithm that consists of the approximate policy evaluation and policy improvement steps. The two proposed schemes, named heuristic dynamic programming (HDP) and dual HDP (DHP), based on multirate GPI, use multi-step estimation (M-step Bellman equation) at the approximate policy evaluation step for estimating the value function and its gradient called costate, respectively. Then, we show that these two methods with the same update horizon can be considered equivalent in the iteration domain. Furthermore, monotonically increasing and decreasing convergences, so called value iteration (VI)-mode and policy iteration (PI)-mode convergences, are proved to hold for the proposed multirate GPIs. Further, general convergence properties in terms of eigenvalues are also studied. The data-driven online implementation methods for the proposed HDP and DHP are demonstrated and finally, we present the results of numerical simulations performed to verify the effectiveness of the proposed methods.

Extended Decentralized Linear-Quadratic-Gaussian Control

NASA Technical Reports Server (NTRS)

Carpenter, J. Russell

2000-01-01

A straightforward extension of a solution to the decentralized linear-Quadratic-Gaussian problem is proposed that allows its use for commonly encountered classes of problems that are currently solved with the extended Kalman filter. This extension allows the system to be partitioned in such a way as to exclude the nonlinearities from the essential algebraic relationships that allow the estimation and control to be optimally decentralized.

A numerical algorithm for optimal feedback gains in high dimensional linear quadratic regulator problems

NASA Technical Reports Server (NTRS)

Banks, H. T.; Ito, K.

1991-01-01

A hybrid method for computing the feedback gains in linear quadratic regulator problem is proposed. The method, which combines use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite-dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). Computational advantages of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed, and numerical evidence of the efficacy of these ideas is presented.

Expected value based fuzzy programming approach to solve integrated supplier selection and inventory control problem with fuzzy demand

NASA Astrophysics Data System (ADS)

Sutrisno; Widowati; Sunarsih; Kartono

2018-01-01

In this paper, a mathematical model in quadratic programming with fuzzy parameter is proposed to determine the optimal strategy for integrated inventory control and supplier selection problem with fuzzy demand. To solve the corresponding optimization problem, we use the expected value based fuzzy programming. Numerical examples are performed to evaluate the model. From the results, the optimal amount of each product that have to be purchased from each supplier for each time period and the optimal amount of each product that have to be stored in the inventory for each time period were determined with minimum total cost and the inventory level was sufficiently closed to the reference level.

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…

Frequency modulation indicator, Arnold’s web and diffusion in the Stark Quadratic-Zeeman problem

NASA Astrophysics Data System (ADS)

Cordani, Bruno

2008-11-01

We notice that the fundamental frequencies of a slightly perturbed integrable Hamiltonian system are not time-constant inside a resonance but frequency modulated, as is evident from pendulum models and wavelet analysis. Exploiting an intrinsic imprecision inherent to the numerical frequency analysis algorithm itself, hence transforming a drawback into an opportunity, we define the Frequency Modulation Indicator, a very sensitive tool in detecting where fundamental frequencies are modulated, localizing so the resonances without having to resort, as in other methods, to the integration of variational equations. For the Kepler problem, the space of the orbits with a fixed energy has the topology of the product of two 2-spheres. The perturbation Hamiltonian, averaged over the mean anomaly, has surely a maximum and a minimum, to which correspond two periodic orbits in physical space. Studying the neighbourhood of these two elliptic stable points, we are able to define adapted action-angle variables, for example, the usual but “SO(4)-rotated” Delaunay variables. The procedure, implemented in the program KEPLER, is performed transparently for the user, providing a general scheme suited for generic perturbation. The method is then applied to the Stark-Quadratic-Zeeman problem, displaying very clearly the Arnold web of the resonances. Sectioning transversely one of the resonance strips so highlighted and performing a numerical frequency analysis, one is able to locate with great precision the thin stochastic layer surrounding a separatrix. Another very long (10 8 revolutions) frequency analysis on an orbit starting here reveals, as expected, a well defined pattern, which ensures that the integration errors do not eject the point out of the layer, and moreover a very slow drift in the frequency values, clearly due to Arnold diffusion.

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…

Quadratic soliton self-reflection at a quadratically nonlinear interface

NASA Astrophysics Data System (ADS)

Jankovic, Ladislav; Kim, Hongki; Stegeman, George; Carrasco, Silvia; Torner, Lluis; Katz, Mordechai

2003-11-01

The reflection of bulk quadratic solutions incident onto a quadratically nonlinear interface in periodically poled potassium titanyl phosphate was observed. The interface consisted of the boundary between two quasi-phase-matched regions displaced from each other by a half-period. At high intensities and small angles of incidence the soliton is reflected.

On the continuous dependence with respect to sampling of the linear quadratic regulator problem for distributed parameter systems

NASA Technical Reports Server (NTRS)

Rosen, I. G.; Wang, C.

1990-01-01

The convergence of solutions to the discrete or sampled time linear quadratic regulator problem and associated Riccati equation for infinite dimensional systems to the solutions to the corresponding continuous time problem and equation, as the length of the sampling interval (the sampling rate) tends toward zero (infinity) is established. Both the finite and infinite time horizon problems are studied. In the finite time horizon case, strong continuity of the operators which define the control system and performance index together with a stability and consistency condition on the sampling scheme are required. For the infinite time horizon problem, in addition, the sampled systems must be stabilizable and detectable, uniformly with respect to the sampling rate. Classes of systems for which this condition can be verified are discussed. Results of numerical studies involving the control of a heat/diffusion equation, a hereditary of delay system, and a flexible beam are presented and discussed.

On the continuous dependence with respect to sampling of the linear quadratic regulator problem for distributed parameter system

NASA Technical Reports Server (NTRS)

Rosen, I. G.; Wang, C.

1992-01-01

The convergence of solutions to the discrete- or sampled-time linear quadratic regulator problem and associated Riccati equation for infinite-dimensional systems to the solutions to the corresponding continuous time problem and equation, as the length of the sampling interval (the sampling rate) tends toward zero(infinity) is established. Both the finite-and infinite-time horizon problems are studied. In the finite-time horizon case, strong continuity of the operators that define the control system and performance index, together with a stability and consistency condition on the sampling scheme are required. For the infinite-time horizon problem, in addition, the sampled systems must be stabilizable and detectable, uniformly with respect to the sampling rate. Classes of systems for which this condition can be verified are discussed. Results of numerical studies involving the control of a heat/diffusion equation, a hereditary or delay system, and a flexible beam are presented and discussed.

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.

Quadratic Frequency Modulation Signals Parameter Estimation Based on Two-Dimensional Product Modified Parameterized Chirp Rate-Quadratic Chirp Rate Distribution.

PubMed

Qu, Zhiyu; Qu, Fuxin; Hou, Changbo; Jing, Fulong

2018-05-19

In an inverse synthetic aperture radar (ISAR) imaging system for targets with complex motion, the azimuth echo signals of the target are always modeled as multicomponent quadratic frequency modulation (QFM) signals. The chirp rate (CR) and quadratic chirp rate (QCR) estimation of QFM signals is very important to solve the ISAR image defocus problem. For multicomponent QFM (multi-QFM) signals, the conventional QR and QCR estimation algorithms suffer from the cross-term and poor anti-noise ability. This paper proposes a novel estimation algorithm called a two-dimensional product modified parameterized chirp rate-quadratic chirp rate distribution (2D-PMPCRD) for QFM signals parameter estimation. The 2D-PMPCRD employs a multi-scale parametric symmetric self-correlation function and modified nonuniform fast Fourier transform-Fast Fourier transform to transform the signals into the chirp rate-quadratic chirp rate (CR-QCR) domains. It can greatly suppress the cross-terms while strengthening the auto-terms by multiplying different CR-QCR domains with different scale factors. Compared with high order ambiguity function-integrated cubic phase function and modified Lv's distribution, the simulation results verify that the 2D-PMPCRD acquires higher anti-noise performance and obtains better cross-terms suppression performance for multi-QFM signals with reasonable computation cost.

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.

Quadratic Expressions by Means of "Summing All the Matchsticks"

ERIC Educational Resources Information Center

Gierdien, M. Faaiz

2012-01-01

This note presents demonstrations of quadratic expressions that come about when particular problems are posed with respect to matchsticks that form regular triangles, squares, pentagons and so on. Usually when such "matchstick" problems are used as ways to foster algebraic thinking, the expressions for the number of matchstick quantities are…

Finite Element Simulation of Articular Contact Mechanics with Quadratic Tetrahedral Elements

PubMed Central

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

2016-01-01

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

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. Copyright © 2016 Elsevier Ltd. All rights reserved.

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.

DQM: Decentralized Quadratically Approximated Alternating Direction Method of Multipliers

NASA Astrophysics Data System (ADS)

Mokhtari, Aryan; Shi, Wei; Ling, Qing; Ribeiro, Alejandro

2016-10-01

This paper considers decentralized consensus optimization problems where nodes of a network have access to different summands of a global objective function. Nodes cooperate to minimize the global objective by exchanging information with neighbors only. A decentralized version of the alternating directions method of multipliers (DADMM) is a common method for solving this category of problems. DADMM exhibits linear convergence rate to the optimal objective but its implementation requires solving a convex optimization problem at each iteration. This can be computationally costly and may result in large overall convergence times. The decentralized quadratically approximated ADMM algorithm (DQM), which minimizes a quadratic approximation of the objective function that DADMM minimizes at each iteration, is proposed here. The consequent reduction in computational time is shown to have minimal effect on convergence properties. Convergence still proceeds at a linear rate with a guaranteed constant that is asymptotically equivalent to the DADMM linear convergence rate constant. Numerical results demonstrate advantages of DQM relative to DADMM and other alternatives in a logistic regression problem.

Quadratic forms involving Green's and Robin functions

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

Dubinin, Vladimir N

2009-10-31

General inequalities for quadratic forms with coefficients depending on the values of Green's and Robin functions are obtained. These inequalities cover also the reduced moduli of strips and half-strips. Some applications of the results obtained to extremal partitioning problems and related questions of geometric function theory are discussed. Bibliography: 29 titles.

A path following algorithm for the graph matching problem.

PubMed

Zaslavskiy, Mikhail; Bach, Francis; Vert, Jean-Philippe

2009-12-01

We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted graph matching problem as a least-square problem on the set of permutation matrices and relaxing it to two different optimization problems: a quadratic convex and a quadratic concave optimization problem on the set of doubly stochastic matrices. The concave relaxation has the same global minimum as the initial graph matching problem, but the search for its global minimum is also a hard combinatorial problem. We, therefore, construct an approximation of the concave problem solution by following a solution path of a convex-concave problem obtained by linear interpolation of the convex and concave formulations, starting from the convex relaxation. This method allows to easily integrate the information on graph label similarities into the optimization problem, and therefore, perform labeled weighted graph matching. The algorithm is compared with some of the best performing graph matching methods on four data sets: simulated graphs, QAPLib, retina vessel images, and handwritten Chinese characters. In all cases, the results are competitive with the state of the art.

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.

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.

A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization

NASA Astrophysics Data System (ADS)

Quan, Ning; Kim, Harrison M.

2018-03-01

The 0-1 quadratic knapsack problem (QKP) in wind farm layout optimization models possible turbine locations as nodes, and power loss due to wake effects between pairs of turbines as edges in a complete graph. The goal is to select up to a certain number of turbine locations such that the sum of selected node and edge coefficients is maximized. Finding the optimal solution to the QKP is difficult in general, but it is possible to obtain a tight upper bound on the QKP's optimal value which facilitates the use of heuristics to solve QKPs by giving a good estimate of the optimality gap of any feasible solution. This article applies an upper bound method that is especially well-suited to QKPs in wind farm layout optimization due to certain features of the formulation that reduce the computational complexity of calculating the upper bound. The usefulness of the upper bound was demonstrated by assessing the performance of the greedy algorithm for solving QKPs in wind farm layout optimization. The results show that the greedy algorithm produces good solutions within 4% of the optimal value for small to medium sized problems considered in this article.

Factorization method of quadratic template

NASA Astrophysics Data System (ADS)

Kotyrba, Martin

2017-07-01

Multiplication of two numbers is a one-way function in mathematics. Any attempt to distribute the outcome to its roots is called factorization. There are many methods such as Fermat's factorization, Dixońs method or quadratic sieve and GNFS, which use sophisticated techniques fast factorization. All the above methods use the same basic formula differing only in its use. This article discusses a newly designed factorization method. Effective implementation of this method in programs is not important, it only represents and clearly defines its properties.

Portfolio optimization using fuzzy linear programming

NASA Astrophysics Data System (ADS)

Pandit, Purnima K.

2013-09-01

Portfolio Optimization (PO) is a problem in Finance, in which investor tries to maximize return and minimize risk by carefully choosing different assets. Expected return and risk are the most important parameters with regard to optimal portfolios. In the simple form PO can be modeled as quadratic programming problem which can be put into equivalent linear form. PO problems with the fuzzy parameters can be solved as multi-objective fuzzy linear programming problem. In this paper we give the solution to such problems with an illustrative example.

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.

Design and cost analysis of rapid aquifer restoration systems using flow simulation and quadratic programming.

USGS Publications Warehouse

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

1986-01-01

Detailed two-dimensional flow simulation of a complex ground-water system is combined with quadratic and linear programming to evaluate design alternatives for rapid aquifer restoration. Results show how treatment and pumping costs depend dynamically on the type of treatment process, and capacity of pumping and injection wells, and the number of wells. The design for an inexpensive treatment process minimizes pumping costs, while an expensive process results in the minimization of treatment costs. Substantial reductions in pumping costs occur with increases in injection capacity or in the number of wells. Treatment costs are reduced by expansions in pumping capacity or injecion capacity. The analysis identifies maximum pumping and injection capacities.-from Authors

Measuring Human Performance on Clustering Problems: Some Potential Objective Criteria and Experimental Research Opportunities

ERIC Educational Resources Information Center

Brusco, Michael J.

2007-01-01

The study of human performance on discrete optimization problems has a considerable history that spans various disciplines. The two most widely studied problems are the Euclidean traveling salesperson problem and the quadratic assignment problem. The purpose of this paper is to outline a program of study for the measurement of human performance on…

The application of nonlinear programming and collocation to optimal aeroassisted orbital transfers

NASA Astrophysics Data System (ADS)

Shi, Y. Y.; Nelson, R. L.; Young, D. H.; Gill, P. E.; Murray, W.; Saunders, M. A.

1992-01-01

Sequential quadratic programming (SQP) and collocation of the differential equations of motion were applied to optimal aeroassisted orbital transfers. The Optimal Trajectory by Implicit Simulation (OTIS) computer program codes with updated nonlinear programming code (NZSOL) were used as a testbed for the SQP nonlinear programming (NLP) algorithms. The state-of-the-art sparse SQP method is considered to be effective for solving large problems with a sparse matrix. Sparse optimizers are characterized in terms of memory requirements and computational efficiency. For the OTIS problems, less than 10 percent of the Jacobian matrix elements are nonzero. The SQP method encompasses two phases: finding an initial feasible point by minimizing the sum of infeasibilities and minimizing the quadratic objective function within the feasible region. The orbital transfer problem under consideration involves the transfer from a high energy orbit to a low energy orbit.

Using Simple Quadratic Equations to Estimate Equilibrium Concentrations of an Acid

ERIC Educational Resources Information Center

Brilleslyper, Michael A.

2004-01-01

Application of quadratic equations to standard problem in chemistry like finding equilibrium concentrations of ions in an acid solution is explained. This clearly shows that pure mathematical analysis has meaningful applications in other areas as well.

VASP- VARIABLE DIMENSION AUTOMATIC SYNTHESIS PROGRAM

NASA Technical Reports Server (NTRS)

White, J. S.

1994-01-01

VASP is a variable dimension Fortran version of the Automatic Synthesis Program, ASP. The program is used to implement Kalman filtering and control theory. Basically, it consists of 31 subprograms for solving most modern control problems in linear, time-variant (or time-invariant) control systems. These subprograms include operations of matrix algebra, computation of the exponential of a matrix and its convolution integral, and the solution of the matrix Riccati equation. The user calls these subprograms by means of a FORTRAN main program, and so can easily obtain solutions to most general problems of extremization of a quadratic functional of the state of the linear dynamical system. Particularly, these problems include the synthesis of the Kalman filter gains and the optimal feedback gains for minimization of a quadratic performance index. VASP, as an outgrowth of the Automatic Synthesis Program, has the following improvements: more versatile programming language; more convenient input/output format; some new subprograms which consolidate certain groups of statements that are often repeated; and variable dimensioning. The pertinent difference between the two programs is that VASP has variable dimensioning and more efficient storage. The documentation for the VASP program contains a VASP dictionary and example problems. The dictionary contains a description of each subroutine and instructions on its use. The example problems include dynamic response, optimal control gain, solution of the sampled data matrix Riccati equation, matrix decomposition, and a pseudo-inverse of a matrix. This program is written in FORTRAN IV and has been implemented on the IBM 360. The VASP program was developed in 1971.

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)

Probability, Problem Solving, and "The Price is Right."

ERIC Educational Resources Information Center

Wood, Eric

1992-01-01

This article discusses the analysis of a decision-making process faced by contestants on the television game show "The Price is Right". The included analyses of the original and related problems concern pattern searching, inductive reasoning, quadratic functions, and graphing. Computer simulation programs in BASIC and tables of…

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

Memetic computing through bio-inspired heuristics integration with sequential quadratic programming for nonlinear systems arising in different physical models.

PubMed

Raja, Muhammad Asif Zahoor; Kiani, Adiqa Kausar; Shehzad, Azam; Zameer, Aneela

2016-01-01

In this study, bio-inspired computing is exploited for solving system of nonlinear equations using variants of genetic algorithms (GAs) as a tool for global search method hybrid with sequential quadratic programming (SQP) for efficient local search. The fitness function is constructed by defining the error function for systems of nonlinear equations in mean square sense. The design parameters of mathematical models are trained by exploiting the competency of GAs and refinement are carried out by viable SQP algorithm. Twelve versions of the memetic approach GA-SQP are designed by taking a different set of reproduction routines in the optimization process. Performance of proposed variants is evaluated on six numerical problems comprising of system of nonlinear equations arising in the interval arithmetic benchmark model, kinematics, neurophysiology, combustion and chemical equilibrium. Comparative studies of the proposed results in terms of accuracy, convergence and complexity are performed with the help of statistical performance indices to establish the worth of the schemes. Accuracy and convergence of the memetic computing GA-SQP is found better in each case of the simulation study and effectiveness of the scheme is further established through results of statistics based on different performance indices for accuracy and complexity.

Probabilistic dual heuristic programming-based adaptive critic

NASA Astrophysics Data System (ADS)

Herzallah, Randa

2010-02-01

Adaptive critic (AC) methods have common roots as generalisations of dynamic programming for neural reinforcement learning approaches. Since they approximate the dynamic programming solutions, they are potentially suitable for learning in noisy, non-linear and non-stationary environments. In this study, a novel probabilistic dual heuristic programming (DHP)-based AC controller is proposed. Distinct to current approaches, the proposed probabilistic (DHP) AC method takes uncertainties of forward model and inverse controller into consideration. Therefore, it is suitable for deterministic and stochastic control problems characterised by functional uncertainty. Theoretical development of the proposed method is validated by analytically evaluating the correct value of the cost function which satisfies the Bellman equation in a linear quadratic control problem. The target value of the probabilistic critic network is then calculated and shown to be equal to the analytically derived correct value. Full derivation of the Riccati solution for this non-standard stochastic linear quadratic control problem is also provided. Moreover, the performance of the proposed probabilistic controller is demonstrated on linear and non-linear control examples.

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,…

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.

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…

A Comparison of Approaches for Solving Hard Graph-Theoretic Problems

DTIC Science & Technology

2015-04-29

can be converted to a quadratic unconstrained binary optimization ( QUBO ) problem that uses 0/1-valued variables, and so they are often used...Frontiers in Physics, 2:5 (12 Feb 2014). [7] “Programming with QUBOs ,” (instructional document) D-Wave: The Quantum Computing Company, 2013. [8

Exact solutions to quadratic gravity

NASA Astrophysics Data System (ADS)

Pravda, V.; Pravdová, A.; Podolský, J.; Švarc, R.

2017-04-01

Since all Einstein spacetimes are vacuum solutions to quadratic gravity in four dimensions, in this paper we study various aspects of non-Einstein vacuum solutions to this theory. Most such known solutions are of traceless Ricci and Petrov type N with a constant Ricci scalar. Thus we assume the Ricci scalar to be constant which leads to a substantial simplification of the field equations. We prove that a vacuum solution to quadratic gravity with traceless Ricci tensor of type N and aligned Weyl tensor of any Petrov type is necessarily a Kundt spacetime. This will considerably simplify the search for new non-Einstein solutions. Similarly, a vacuum solution to quadratic gravity with traceless Ricci type III and aligned Weyl tensor of Petrov type II or more special is again necessarily a Kundt spacetime. Then we study the general role of conformal transformations in constructing vacuum solutions to quadratic gravity. We find that such solutions can be obtained by solving one nonlinear partial differential equation for a conformal factor on any Einstein spacetime or, more generally, on any background with vanishing Bach tensor. In particular, we show that all geometries conformal to Kundt are either Kundt or Robinson-Trautman, and we provide some explicit Kundt and Robinson-Trautman solutions to quadratic gravity by solving the above mentioned equation on certain Kundt backgrounds.

Observers for a class of systems with nonlinearities satisfying an incremental quadratic inequality

NASA Technical Reports Server (NTRS)

Acikmese, Ahmet Behcet; Martin, Corless

2004-01-01

We consider the problem of state estimation from nonlinear time-varying system whose nonlinearities satisfy an incremental quadratic inequality. Observers are presented which guarantee that the state estimation error exponentially converges to zero.

Contractions and deformations of quasiclassical Lie algebras preserving a nondegenerate quadratic Casimir operator

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

Campoamor-Stursberg, R., E-mail: rutwig@mat.ucm.e

2008-05-15

By means of contractions of Lie algebras, we obtain new classes of indecomposable quasiclassical Lie algebras that satisfy the Yang-Baxter equations in its reformulation in terms of triple products. These algebras are shown to arise naturally from noncompact real simple algebras with nonsimple complexification, where we impose that a nondegenerate quadratic Casimir operator is preserved by the limiting process. We further consider the converse problem and obtain sufficient conditions on integrable cocycles of quasiclassical Lie algebras in order to preserve nondegenerate quadratic Casimir operators by the associated linear deformations.

Directional passability and quadratic steering logic for pyramid-type single gimbal control moment gyros

NASA Astrophysics Data System (ADS)

Yamada, Katsuhiko; Jikuya, Ichiro

2014-09-01

Singularity analysis and the steering logic of pyramid-type single gimbal control moment gyros are studied. First, a new concept of directional passability in a specified direction is introduced to investigate the structure of an elliptic singular surface. The differences between passability and directional passability are discussed in detail and are visualized for 0H, 2H, and 4H singular surfaces. Second, quadratic steering logic (QSL), a new steering logic for passing the singular surface, is investigated. The algorithm is based on the quadratic constrained quadratic optimization problem and is reduced to the Newton method by using Gröbner bases. The proposed steering logic is demonstrated through numerical simulations for both constant torque maneuvering examples and attitude control examples.

On the classification of elliptic foliations induced by real quadratic fields with center

NASA Astrophysics Data System (ADS)

Puchuri, Liliana; Bueno, Orestes

2016-12-01

Related to the study of Hilbert's infinitesimal problem, is the problem of determining the existence and estimating the number of limit cycles of the linear perturbation of Hamiltonian fields. A classification of the elliptic foliations in the projective plane induced by the fields obtained by quadratic fields with center was already studied by several authors. In this work, we devise a unified proof of the classification of elliptic foliations induced by quadratic fields with center. This technique involves using a formula due to Cerveau & Lins Neto to calculate the genus of the generic fiber of a first integral of foliations of these kinds. Furthermore, we show that these foliations induce several examples of linear families of foliations which are not bimeromorphically equivalent to certain remarkable examples given by Lins Neto.

Orthogonality preserving infinite dimensional quadratic stochastic operators

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

Akın, Hasan; Mukhamedov, Farrukh

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.

Computing the full spectrum of large sparse palindromic quadratic eigenvalue problems arising from surface Green's function calculations

NASA Astrophysics Data System (ADS)

Huang, Tsung-Ming; Lin, Wen-Wei; Tian, Heng; Chen, Guan-Hua

2018-03-01

Full spectrum of a large sparse ⊤-palindromic quadratic eigenvalue problem (⊤-PQEP) is considered arguably for the first time in this article. Such a problem is posed by calculation of surface Green's functions (SGFs) of mesoscopic transistors with a tremendous non-periodic cross-section. For this problem, general purpose eigensolvers are not efficient, nor is advisable to resort to the decimation method etc. to obtain the Wiener-Hopf factorization. After reviewing some rigorous understanding of SGF calculation from the perspective of ⊤-PQEP and nonlinear matrix equation, we present our new approach to this problem. In a nutshell, the unit disk where the spectrum of interest lies is broken down adaptively into pieces small enough that they each can be locally tackled by the generalized ⊤-skew-Hamiltonian implicitly restarted shift-and-invert Arnoldi (G⊤SHIRA) algorithm with suitable shifts and other parameters, and the eigenvalues missed by this divide-and-conquer strategy can be recovered thanks to the accurate estimation provided by our newly developed scheme. Notably the novel non-equivalence deflation is proposed to avoid as much as possible duplication of nearby known eigenvalues when a new shift of G⊤SHIRA is determined. We demonstrate our new approach by calculating the SGF of a realistic nanowire whose unit cell is described by a matrix of size 4000 × 4000 at the density functional tight binding level, corresponding to a 8 × 8nm2 cross-section. We believe that quantum transport simulation of realistic nano-devices in the mesoscopic regime will greatly benefit from this work.

Solving the Integral of Quadratic Forms of Covariance Matrices for Applications in Polarimetric Radar Imagery

NASA Astrophysics Data System (ADS)

Marino, Armando; Hajnsek, Irena

2015-04-01

In this work, the solution of quadratic forms with special application to polarimetric and interferometric covariance matrices is investigated. An analytical solution for the integral of a single quadratic form is derived. Additionally, the integral of the Pol-InSAR coherence (expressed as combination of quadratic forms) is investigated. An approximation for such integral is proposed and defined as Trace coherence. Such approximation is tested on real data to verify that the error is acceptable. The trace coherence can be used for tackle problems related to change detection. Moreover, the use of the Trace coherence in model inversion (as for the RVoG three stage inversion) will be investigated in the future.

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.

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.

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.

Approximation theory for LQG (Linear-Quadratic-Gaussian) optimal control of flexible structures

NASA Technical Reports Server (NTRS)

Gibson, J. S.; Adamian, A.

1988-01-01

An approximation theory is presented for the LQG (Linear-Quadratic-Gaussian) optimal control problem for flexible structures whose distributed models have bounded input and output operators. The main purpose of the theory is to guide the design of finite dimensional compensators that approximate closely the optimal compensator. The optimal LQG problem separates into an optimal linear-quadratic regulator problem and an optimal state estimation problem. The solution of the former problem lies in the solution to an infinite dimensional Riccati operator equation. The approximation scheme approximates the infinite dimensional LQG problem with a sequence of finite dimensional LQG problems defined for a sequence of finite dimensional, usually finite element or modal, approximations of the distributed model of the structure. Two Riccati matrix equations determine the solution to each approximating problem. The finite dimensional equations for numerical approximation are developed, including formulas for converting matrix control and estimator gains to their functional representation to allow comparison of gains based on different orders of approximation. Convergence of the approximating control and estimator gains and of the corresponding finite dimensional compensators is studied. Also, convergence and stability of the closed-loop systems produced with the finite dimensional compensators are discussed. The convergence theory is based on the convergence of the solutions of the finite dimensional Riccati equations to the solutions of the infinite dimensional Riccati equations. A numerical example with a flexible beam, a rotating rigid body, and a lumped mass is given.

Solving the transport equation with quadratic finite elements: Theory and applications

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

Ferguson, J.M.

1997-12-31

At the 4th Joint Conference on Computational Mathematics, the author presented a paper introducing a new quadratic finite element scheme (QFEM) for solving the transport equation. In the ensuing year the author has obtained considerable experience in the application of this method, including solution of eigenvalue problems, transmission problems, and solution of the adjoint form of the equation as well as the usual forward solution. He will present detailed results, and will also discuss other refinements of his transport codes, particularly for 3-dimensional problems on rectilinear and non-rectilinear grids.

Calculus students' understanding of the vertex of the quadratic function in relation to the concept of derivative

NASA Astrophysics Data System (ADS)

Burns-Childers, Annie; Vidakovic, Draga

2018-07-01

The purpose of this study was to gain insight into 30, first year calculus students' understanding of the relationship between the concept of vertex of a quadratic function and the concept of the derivative. APOS (action-process-object-schema) theory was applied as a guiding framework of analysis on student written work, think-aloud and follow up group interviews. Students' personal meanings of the vertex, including misconceptions, were explored, along with students' understanding to solve problems pertaining to the derivative of a quadratic function. Results give evidence of students' weak schema of the vertex, lack of connection between different problem types and the importance of linguistics in relation to levels of APOS theory. A preliminary genetic decomposition was developed based on the results. Future research is suggested as a continuation to improve student understanding of the relationship between the vertex of quadratic functions and the derivative.

An Unexpected Influence on a Quadratic

ERIC Educational Resources Information Center

Davis, Jon D.

2013-01-01

Using technology to explore the coefficients of a quadratic equation can lead to an unexpected result. This article describes an investigation that involves sliders and dynamically linked representations. It guides students to notice the effect that the parameter "a" has on the graphical representation of a quadratic function in the form…

Menu-Driven Solver Of Linear-Programming Problems

NASA Technical Reports Server (NTRS)

Viterna, L. A.; Ferencz, D.

1992-01-01

Program assists inexperienced user in formulating linear-programming problems. A Linear Program Solver (ALPS) computer program is full-featured LP analysis program. Solves plain linear-programming problems as well as more-complicated mixed-integer and pure-integer programs. Also contains efficient technique for solution of purely binary linear-programming problems. Written entirely in IBM's APL2/PC software, Version 1.01. Packed program contains licensed material, property of IBM (copyright 1988, all rights reserved).

Automation of reverse engineering process in aircraft modeling and related optimization problems

NASA Technical Reports Server (NTRS)

Li, W.; Swetits, J.

1994-01-01

During the year of 1994, the engineering problems in aircraft modeling were studied. The initial concern was to obtain a surface model with desirable geometric characteristics. Much of the effort during the first half of the year was to find an efficient way of solving a computationally difficult optimization model. Since the smoothing technique in the proposal 'Surface Modeling and Optimization Studies of Aerodynamic Configurations' requires solutions of a sequence of large-scale quadratic programming problems, it is important to design algorithms that can solve each quadratic program in a few interactions. This research led to three papers by Dr. W. Li, which were submitted to SIAM Journal on Optimization and Mathematical Programming. Two of these papers have been accepted for publication. Even though significant progress has been made during this phase of research and computation times was reduced from 30 min. to 2 min. for a sample problem, it was not good enough for on-line processing of digitized data points. After discussion with Dr. Robert E. Smith Jr., it was decided not to enforce shape constraints in order in order to simplify the model. As a consequence, P. Dierckx's nonparametric spline fitting approach was adopted, where one has only one control parameter for the fitting process - the error tolerance. At the same time the surface modeling software developed by Imageware was tested. Research indicated a substantially improved fitting of digitalized data points can be achieved if a proper parameterization of the spline surface is chosen. A winning strategy is to incorporate Dierckx's surface fitting with a natural parameterization for aircraft parts. The report consists of 4 chapters. Chapter 1 provides an overview of reverse engineering related to aircraft modeling and some preliminary findings of the effort in the second half of the year. Chapters 2-4 are the research results by Dr. W. Li on penalty functions and conjugate gradient methods for

Discrete-time Markovian-jump linear quadratic optimal control

NASA Technical Reports Server (NTRS)

Chizeck, H. J.; Willsky, A. S.; Castanon, D.

1986-01-01

This paper is concerned with the optimal control of discrete-time linear systems that possess randomly jumping parameters described by finite-state Markov processes. For problems having quadratic costs and perfect observations, the optimal control laws and expected costs-to-go can be precomputed from a set of coupled Riccati-like matrix difference equations. Necessary and sufficient conditions are derived for the existence of optimal constant control laws which stabilize the controlled system as the time horizon becomes infinite, with finite optimal expected cost.

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

Minimization of the root of a quadratic functional under a system of affine equality constraints with application to portfolio management

NASA Astrophysics Data System (ADS)

Landsman, Zinoviy

2008-10-01

We present an explicit closed form solution of the problem of minimizing the root of a quadratic functional subject to a system of affine constraints. The result generalizes Z. Landsman, Minimization of the root of a quadratic functional under an affine equality constraint, J. Comput. Appl. Math. 2007, to appear, see , articles in press, where the optimization problem was solved under only one linear constraint. This is of interest for solving significant problems pertaining to financial economics as well as some classes of feasibility and optimization problems which frequently occur in tomography and other fields. The results are illustrated in the problem of optimal portfolio selection and the particular case when the expected return of finance portfolio is certain is discussed.

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.

The Future Problem Solving Program.

ERIC Educational Resources Information Center

Crabbe, Anne B.

1989-01-01

Describes the Future Problem Solving Program, in which students from the U.S. and around the world are tackling some complex challenges facing society, ranging from acid rain to terrorism. The program uses a creative problem solving process developed for business and industry. A sixth-grade toxic waste cleanup project illustrates the process.…

Quadratic correlation filters for optical correlators

NASA Astrophysics Data System (ADS)

Mahalanobis, Abhijit; Muise, Robert R.; Vijaya Kumar, Bhagavatula V. K.

2003-08-01

Linear correlation filters have been implemented in optical correlators and successfully used for a variety of applications. The output of an optical correlator is usually sensed using a square law device (such as a CCD array) which forces the output to be the squared magnitude of the desired correlation. It is however not a traditional practice to factor the effect of the square-law detector in the design of the linear correlation filters. In fact, the input-output relationship of an optical correlator is more accurately modeled as a quadratic operation than a linear operation. Quadratic correlation filters (QCFs) operate directly on the image data without the need for feature extraction or segmentation. In this sense, the QCFs retain the main advantages of conventional linear correlation filters while offering significant improvements in other respects. Not only is more processing required to detect peaks in the outputs of multiple linear filters, but choosing a winner among them is an error prone task. In contrast, all channels in a QCF work together to optimize the same performance metric and produce a combined output that leads to considerable simplification of the post-processing. In this paper, we propose a novel approach to the design of quadratic correlation based on the Fukunaga Koontz transform. Although quadratic filters are known to be optimum when the data is Gaussian, it is expected that they will perform as well as or better than linear filters in general. Preliminary performance results are provided that show that quadratic correlation filters perform better than their linear counterparts.

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.

Stochastic Control of Energy Efficient Buildings: A Semidefinite Programming Approach

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

Ma, Xiao; Dong, Jin; Djouadi, Seddik M

2015-01-01

The key goal in energy efficient buildings is to reduce energy consumption of Heating, Ventilation, and Air- Conditioning (HVAC) systems while maintaining a comfortable temperature and humidity in the building. This paper proposes a novel stochastic control approach for achieving joint performance and power control of HVAC. We employ a constrained Stochastic Linear Quadratic Control (cSLQC) by minimizing a quadratic cost function with a disturbance assumed to be Gaussian. The problem is formulated to minimize the expected cost subject to a linear constraint and a probabilistic constraint. By using cSLQC, the problem is reduced to a semidefinite optimization problem, wheremore » the optimal control can be computed efficiently by Semidefinite programming (SDP). Simulation results are provided to demonstrate the effectiveness and power efficiency by utilizing the proposed control approach.« less

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.

Pseudodynamic systems approach based on a quadratic approximation of update equations for diffuse optical tomography.

PubMed

Biswas, Samir Kumar; Kanhirodan, Rajan; Vasu, Ram Mohan; Roy, Debasish

2011-08-01

We explore a pseudodynamic form of the quadratic parameter update equation for diffuse optical tomographic reconstruction from noisy data. A few explicit and implicit strategies for obtaining the parameter updates via a semianalytical integration of the pseudodynamic equations are proposed. Despite the ill-posedness of the inverse problem associated with diffuse optical tomography, adoption of the quadratic update scheme combined with the pseudotime integration appears not only to yield higher convergence, but also a muted sensitivity to the regularization parameters, which include the pseudotime step size for integration. These observations are validated through reconstructions with both numerically generated and experimentally acquired data.

Quadratic formula for determining the drop size in pressure-atomized sprays with and without swirl

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

Lee, T.-W, E-mail: attwl@asu.edu; An, Keju

2016-06-15

We use a theoretical framework based on the integral form of the conservation equations, along with a heuristic model of the viscous dissipation, to find a closed-form solution to the liquid atomization problem. The energy balance for the spray renders to a quadratic formula for the drop size as a function, primarily of the liquid velocity. The Sauter mean diameter found using the quadratic formula shows good agreements and physical trends, when compared with experimental observations. This approach is shown to be applicable toward specifying initial drop size in computational fluid dynamics of spray flows.

On the time-weighted quadratic sum of linear discrete systems

NASA Technical Reports Server (NTRS)

Jury, E. I.; Gutman, S.

1975-01-01

A method is proposed for obtaining the time-weighted quadratic sum for linear discrete systems. The formula of the weighted quadratic sum is obtained from matrix z-transform formulation. In addition, it is shown that this quadratic sum can be derived in a recursive form for several useful weighted functions. The discussion presented parallels that of MacFarlane (1963) for weighted quadratic integral for linear continuous systems.

QUADrATiC: scalable gene expression connectivity mapping for repurposing FDA-approved therapeutics.

PubMed

O'Reilly, Paul G; Wen, Qing; Bankhead, Peter; Dunne, Philip D; McArt, Darragh G; McPherson, Suzanne; Hamilton, Peter W; Mills, Ken I; Zhang, Shu-Dong

2016-05-04

Gene expression connectivity mapping has proven to be a powerful and flexible tool for research. Its application has been shown in a broad range of research topics, most commonly as a means of identifying potential small molecule compounds, which may be further investigated as candidates for repurposing to treat diseases. The public release of voluminous data from the Library of Integrated Cellular Signatures (LINCS) programme further enhanced the utilities and potentials of gene expression connectivity mapping in biomedicine. We describe QUADrATiC ( http://go.qub.ac.uk/QUADrATiC ), a user-friendly tool for the exploration of gene expression connectivity on the subset of the LINCS data set corresponding to FDA-approved small molecule compounds. It enables the identification of compounds for repurposing therapeutic potentials. The software is designed to cope with the increased volume of data over existing tools, by taking advantage of multicore computing architectures to provide a scalable solution, which may be installed and operated on a range of computers, from laptops to servers. This scalability is provided by the use of the modern concurrent programming paradigm provided by the Akka framework. The QUADrATiC Graphical User Interface (GUI) has been developed using advanced Javascript frameworks, providing novel visualization capabilities for further analysis of connections. There is also a web services interface, allowing integration with other programs or scripts. QUADrATiC has been shown to provide an improvement over existing connectivity map software, in terms of scope (based on the LINCS data set), applicability (using FDA-approved compounds), usability and speed. It offers potential to biological researchers to analyze transcriptional data and generate potential therapeutics for focussed study in the lab. QUADrATiC represents a step change in the process of investigating gene expression connectivity and provides more biologically-relevant results than

Linear and Quadratic Change: A Problem from Japan

ERIC Educational Resources Information Center

Peterson, Blake E.

2006-01-01

In the fall of 2003, the author conducted research on the student teaching process in Japan. The basis for most of the lessons observed was rich mathematics problems. Upon returning to the US, the author used one such problem while teaching an algebra 2 class. This article introduces that problem, which gives rise to both linear and quadratic…

Numerical solution of quadratic matrix equations for free vibration analysis of structures

NASA Technical Reports Server (NTRS)

Gupta, K. K.

1975-01-01

This paper is concerned with the efficient and accurate solution of the eigenvalue problem represented by quadratic matrix equations. Such matrix forms are obtained in connection with the free vibration analysis of structures, discretized by finite 'dynamic' elements, resulting in frequency-dependent stiffness and inertia matrices. The paper presents a new numerical solution procedure of the quadratic matrix equations, based on a combined Sturm sequence and inverse iteration technique enabling economical and accurate determination of a few required eigenvalues and associated vectors. An alternative procedure based on a simultaneous iteration procedure is also described when only the first few modes are the usual requirement. The employment of finite dynamic elements in conjunction with the presently developed eigenvalue routines results in a most significant economy in the dynamic analysis of structures.

Path Following in the Exact Penalty Method of Convex Programming.

PubMed

Zhou, Hua; Lange, Kenneth

2015-07-01

Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value.

Path Following in the Exact Penalty Method of Convex Programming

PubMed Central

Zhou, Hua; Lange, Kenneth

2015-01-01

Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, the kinks in the penalty and the unknown magnitude of the penalty constant prevent wide application of the exact penalty method in nonlinear programming. In this article, we examine a strategy of path following consistent with the exact penalty method. Instead of performing optimization at a single penalty constant, we trace the solution as a continuous function of the penalty constant. Thus, path following starts at the unconstrained solution and follows the solution path as the penalty constant increases. In the process, the solution path hits, slides along, and exits from the various constraints. For quadratic programming, the solution path is piecewise linear and takes large jumps from constraint to constraint. For a general convex program, the solution path is piecewise smooth, and path following operates by numerically solving an ordinary differential equation segment by segment. Our diverse applications to a) projection onto a convex set, b) nonnegative least squares, c) quadratically constrained quadratic programming, d) geometric programming, and e) semidefinite programming illustrate the mechanics and potential of path following. The final detour to image denoising demonstrates the relevance of path following to regularized estimation in inverse problems. In regularized estimation, one follows the solution path as the penalty constant decreases from a large value. PMID:26366044

Finite-dimensional linear approximations of solutions to general irregular nonlinear operator equations and equations with quadratic operators

NASA Astrophysics Data System (ADS)

Kokurin, M. Yu.

2010-11-01

A general scheme for improving approximate solutions to irregular nonlinear operator equations in Hilbert spaces is proposed and analyzed in the presence of errors. A modification of this scheme designed for equations with quadratic operators is also examined. The technique of universal linear approximations of irregular equations is combined with the projection onto finite-dimensional subspaces of a special form. It is shown that, for finite-dimensional quadratic problems, the proposed scheme provides information about the global geometric properties of the intersections of quadrics.

Performance and Difficulties of Students in Formulating and Solving Quadratic Equations with One Unknown

ERIC Educational Resources Information Center

Didis, Makbule Gozde; Erbas, Ayhan Kursat

2015-01-01

This study attempts to investigate the performance of tenth-grade students in solving quadratic equations with one unknown, using symbolic equation and word-problem representations. The participants were 217 tenth-grade students, from three different public high schools. Data was collected through an open-ended questionnaire comprising eight…

An Algebraic Approach for Solving Quadratic Inequalities

ERIC Educational Resources Information Center

Mahmood, Munir; Al-Mirbati, Rudaina

2017-01-01

In recent years most text books utilise either the sign chart or graphing functions in order to solve a quadratic inequality of the form ax[superscript 2] + bx + c < 0 This article demonstrates an algebraic approach to solve the above inequality. To solve a quadratic inequality in the form of ax[superscript 2] + bx + c < 0 or in the…

Programming and Problem Solving.

ERIC Educational Resources Information Center

Elias, Barbara P.

A study was conducted to examine computer programming as a problem solving activity. Thirteen fifth grade children were selected by their teacher from an above average class to use Apple IIe microcomputers. The investigator conducted sessions of 40-50 minutes with the children in groups of two or three. Four problems, incorporating the programming…

NOLIN: A nonlinear laminate analysis program

NASA Technical Reports Server (NTRS)

Kibler, J. J.

1975-01-01

A nonlinear, plane-stress, laminate analysis program, NOLIN, was developed which accounts for laminae nonlinearity under inplane shear and transverse extensional stress. The program determines the nonlinear stress-strain behavior of symmetric laminates subjected to any combination of inplane shear and biaxial extensional loadings. The program has the ability to treat different stress-strain behavior in tension and compression, and predicts laminate failure using any or all of maximum stress, maximum strain, and quadratic interaction failure criteria. A brief description of the program is presented including discussion of the flow of information and details of the input required. Sample problems and a complete listing of the program is also provided.

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…

The stability of quadratic-reciprocal functional equation

NASA Astrophysics Data System (ADS)

Song, Aimin; Song, Minwei

2018-04-01

A new quadratic-reciprocal functional equation f ((k +1 )x +k y )+f ((k +1 )x -k y )=2/f (x )f (y )[(k+1 ) 2f (y )+k2f (x )] [(k+1)2f (y )-k2f (x )] 2 is introduced. The Hyers-Ulam stability for the quadratic-reciprocal functional equations is proved in Banach spaces using the direct method and the fixed point method, respectively.

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.

Geometric quadratic stochastic operator on countable infinite set

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

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.

Improve Problem Solving Skills through Adapting Programming Tools

NASA Technical Reports Server (NTRS)

Shaykhian, Linda H.; Shaykhian, Gholam Ali

2007-01-01

There are numerous ways for engineers and students to become better problem-solvers. The use of command line and visual programming tools can help to model a problem and formulate a solution through visualization. The analysis of problem attributes and constraints provide insight into the scope and complexity of the problem. The visualization aspect of the problem-solving approach tends to make students and engineers more systematic in their thought process and help them catch errors before proceeding too far in the wrong direction. The problem-solver identifies and defines important terms, variables, rules, and procedures required for solving a problem. Every step required to construct the problem solution can be defined in program commands that produce intermediate output. This paper advocates improved problem solving skills through using a programming tool. MatLab created by MathWorks, is an interactive numerical computing environment and programming language. It is a matrix-based system that easily lends itself to matrix manipulation, and plotting of functions and data. MatLab can be used as an interactive command line or a sequence of commands that can be saved in a file as a script or named functions. Prior programming experience is not required to use MatLab commands. The GNU Octave, part of the GNU project, a free computer program for performing numerical computations, is comparable to MatLab. MatLab visual and command programming are presented here.

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…

Hidden supersymmetry and quadratic deformations of the space-time conformal superalgebra

NASA Astrophysics Data System (ADS)

Yates, L. A.; Jarvis, P. D.

2018-04-01

We analyze the structure of the family of quadratic superalgebras, introduced in Jarvis et al (2011 J. Phys. A: Math. Theor. 44 235205), for the quadratic deformations of N  =  1 space-time conformal supersymmetry. We characterize in particular the ‘zero-step’ modules for this case. In such modules, the odd generators vanish identically, and the quadratic superalgebra is realized on a single irreducible representation of the even subalgebra (which is a Lie algebra). In the case under study, the quadratic deformations of N  =  1 space-time conformal supersymmetry, it is shown that each massless positive energy unitary irreducible representation (in the standard classification of Mack), forms such a zero-step module, for an appropriate parameter choice amongst the quadratic family (with vanishing central charge). For these massless particle multiplets therefore, quadratic supersymmetry is unbroken, in that the supersymmetry generators annihilate all physical states (including the vacuum state), while at the same time, superpartners do not exist.

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]…

Design of reinforced areas of concrete column using quadratic polynomials

NASA Astrophysics Data System (ADS)

Arif Gunadi, Tjiang; Parung, Herman; Rachman Djamaluddin, Abd; Arwin Amiruddin, A.

2017-11-01

Designing of reinforced concrete columns mostly carried out by a simple planning method which uses column interaction diagram. However, the application of this method is limited because it valids only for certain compressive strenght of the concrete and yield strength of the reinforcement. Thus, a more applicable method is still in need. Another method is the use of quadratic polynomials as a basis for the approach in designing reinforced concrete columns, where the ratio of neutral lines to the effective height of a cross section (ξ) if associated with ξ in the same cross-section with different reinforcement ratios is assumed to form a quadratic polynomial. This is identical to the basic principle used in the Simpson rule for numerical integral using quadratic polynomials and had a sufficiently accurate level of accuracy. The basis of this approach to be used both the normal force equilibrium and the moment equilibrium. The abscissa of the intersection of the two curves is the ratio that had been mentioned, since it fulfill both of the equilibrium. The application of this method is relatively more complicated than the existing method but provided with tables and graphs (N vs ξN ) and (M vs ξM ) so that its used could be simplified. The uniqueness of these tables are only distinguished based on the compresssive strength of the concrete, so in application it could be combined with various yield strenght of the reinforcement available in the market. This method could be solved by using programming languages such as Fortran.

On orthogonality preserving quadratic stochastic operators

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

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.

Quadratic trigonometric B-spline for image interpolation using GA

PubMed Central

Abbas, Samreen; Irshad, Misbah

2017-01-01

In this article, a new quadratic trigonometric B-spline with control parameters is constructed to address the problems related to two dimensional digital image interpolation. The newly constructed spline is then used to design an image interpolation scheme together with one of the soft computing techniques named as Genetic Algorithm (GA). The idea of GA has been formed to optimize the control parameters in the description of newly constructed spline. The Feature SIMilarity (FSIM), Structure SIMilarity (SSIM) and Multi-Scale Structure SIMilarity (MS-SSIM) indices along with traditional Peak Signal-to-Noise Ratio (PSNR) are employed as image quality metrics to analyze and compare the outcomes of approach offered in this work, with three of the present digital image interpolation schemes. The upshots show that the proposed scheme is better choice to deal with the problems associated to image interpolation. PMID:28640906

Quadratic trigonometric B-spline for image interpolation using GA.

PubMed

Hussain, Malik Zawwar; Abbas, Samreen; Irshad, Misbah

2017-01-01

In this article, a new quadratic trigonometric B-spline with control parameters is constructed to address the problems related to two dimensional digital image interpolation. The newly constructed spline is then used to design an image interpolation scheme together with one of the soft computing techniques named as Genetic Algorithm (GA). The idea of GA has been formed to optimize the control parameters in the description of newly constructed spline. The Feature SIMilarity (FSIM), Structure SIMilarity (SSIM) and Multi-Scale Structure SIMilarity (MS-SSIM) indices along with traditional Peak Signal-to-Noise Ratio (PSNR) are employed as image quality metrics to analyze and compare the outcomes of approach offered in this work, with three of the present digital image interpolation schemes. The upshots show that the proposed scheme is better choice to deal with the problems associated to image interpolation.

Solving Integer Programs from Dependence and Synchronization Problems

DTIC Science & Technology

1993-03-01

DEFF.NSNE Solving Integer Programs from Dependence and Synchronization Problems Jaspal Subhlok March 1993 CMU-CS-93-130 School of Computer ScienceT IC...method Is an exact and efficient way of solving integer programming problems arising in dependence and synchronization analysis of parallel programs...7/;- p Keywords: Exact dependence tesing, integer programming. parallelilzng compilers, parallel program analysis, synchronization analysis Solving

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)

Puzzles, Pastimes, Problems.

ERIC Educational Resources Information Center

Eperson, D. B.

1985-01-01

Presents six mathematical problems (with answers) which focus on: (1) chess moves; (2) patterned numbers; (3) quadratics with rational roots; (4) number puzzles; (5) Euclidean geometry; and (6) Carrollian word puzzles. (JN)

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…

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.

Computer Programming: A Medium for Teaching Problem Solving.

ERIC Educational Resources Information Center

Casey, Patrick J.

1997-01-01

Argues that including computer programming in the curriculum as a medium for instruction is a feasible alternative for teaching problem solving. Discusses the nature of problem solving; the problem-solving elements of discovery, motivation, practical learning situations and flexibility which are inherent in programming; capabilities of computer…

A Numerical Approximation Framework for the Stochastic Linear Quadratic Regulator on Hilbert Spaces

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

Levajković, Tijana, E-mail: tijana.levajkovic@uibk.ac.at, E-mail: t.levajkovic@sf.bg.ac.rs; Mena, Hermann, E-mail: hermann.mena@uibk.ac.at; Tuffaha, Amjad, E-mail: atufaha@aus.edu

We present an approximation framework for computing the solution of the stochastic linear quadratic control problem on Hilbert spaces. We focus on the finite horizon case and the related differential Riccati equations (DREs). Our approximation framework is concerned with the so-called “singular estimate control systems” (Lasiecka in Optimal control problems and Riccati equations for systems with unbounded controls and partially analytic generators: applications to boundary and point control problems, 2004) which model certain coupled systems of parabolic/hyperbolic mixed partial differential equations with boundary or point control. We prove that the solutions of the approximate finite-dimensional DREs converge to the solutionmore » of the infinite-dimensional DRE. In addition, we prove that the optimal state and control of the approximate finite-dimensional problem converge to the optimal state and control of the corresponding infinite-dimensional problem.« less

One-Dimensional Fokker-Planck Equation with Quadratically Nonlinear Quasilocal Drift

NASA Astrophysics Data System (ADS)

Shapovalov, A. V.

2018-04-01

The Fokker-Planck equation in one-dimensional spacetime with quadratically nonlinear nonlocal drift in the quasilocal approximation is reduced with the help of scaling of the coordinates and time to a partial differential equation with a third derivative in the spatial variable. Determining equations for the symmetries of the reduced equation are derived and the Lie symmetries are found. A group invariant solution having the form of a traveling wave is found. Within the framework of Adomian's iterative method, the first iterations of an approximate solution of the Cauchy problem are obtained. Two illustrative examples of exact solutions are found.

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…

On the Rigorous Derivation of the 3D Cubic Nonlinear Schrödinger Equation with a Quadratic Trap

NASA Astrophysics Data System (ADS)

Chen, Xuwen

2013-11-01

We consider the dynamics of the three-dimensional N-body Schrödinger equation in the presence of a quadratic trap. We assume the pair interaction potential is N 3 β-1 V( N β x). We justify the mean-field approximation and offer a rigorous derivation of the three-dimensional cubic nonlinear Schrödinger equation (NLS) with a quadratic trap. We establish the space-time bound conjectured by Klainerman and Machedon (Commun Math Phys 279:169-185, 2008) for by adapting and simplifying an argument in Chen and Pavlović (Annales Henri Poincaré, 2013) which solves the problem for in the absence of a trap.

Self-accelerating parabolic beams in quadratic nonlinear media

NASA Astrophysics Data System (ADS)

Dolev, Ido; Libster, Ana; Arie, Ady

2012-09-01

We present experimental observation of self-accelerating parabolic beams in quadratic nonlinear media. We show that the intensity peaks of the first and second harmonics are asynchronous with respect to one another in the two transverse coordinates. In addition, the two coupled harmonics have the same acceleration within and after the nonlinear medium. We also study the evolution of second harmonic accelerating beams inside the quadratic media and their correlation with theoretical beams.

Binary Inspiral in Quadratic Gravity

NASA Astrophysics Data System (ADS)

Yagi, Kent

2015-01-01

Quadratic gravity is a general class of quantum-gravity-inspired theories, where the Einstein-Hilbert action is extended through the addition of all terms quadratic in the curvature tensor coupled to a scalar field. In this article, we focus on the scalar Gauss- Bonnet (sGB) theory and consider the black hole binary inspiral in this theory. By applying the post-Newtonian (PN) formalism, we found that there is a scalar dipole radiation which leads to -1PN correction in the energy flux relative to gravitational radiation in general relativity. From the orbital decay rate of a low-mass X-ray binary A0600-20, we obtain the bound that is six orders of magnitude stronger than the current solar system bound. Furthermore, we show that the excess in the orbital decay rate of XTE J1118+480 can be explained by the scalar radiation in sGB theory.

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

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…

The Benefit of Interleaved Mathematics Practice Is Not Limited to Superficially Similar Kinds of Problems

ERIC Educational Resources Information Center

Rohrer, Doug; Dedrick, Robert F.; Burgess, Kaleena

2014-01-01

Most mathematics assignments consist of a group of problems requiring the same strategy. For example, a lesson on the quadratic formula is typically followed by a block of problems requiring students to use the quadratic formula, which means that students know the appropriate strategy before they read each problem. In an alternative approach,…

Realization theory and quadratic optimal controllers for systems defined over Banach and Frechet algebras

NASA Technical Reports Server (NTRS)

Byrnes, C. I.

1980-01-01

It is noted that recent work by Kamen (1979) on the stability of half-plane digital filters shows that the problem of the existence of a feedback law also arises for other Banach algebras in applications. This situation calls for a realization theory and stabilizability criteria for systems defined over Banach for Frechet algebra A. Such a theory is developed here, with special emphasis placed on the construction of finitely generated realizations, the existence of coprime factorizations for T(s) defined over A, and the solvability of the quadratic optimal control problem and the associated algebraic Riccati equation over A.

A Centered Projective Algorithm for Linear Programming

DTIC Science & Technology

1988-02-01

zx/l to (PA Karmarkar’s algorithm iterates this procedure. An alternative method, the so-called affine variant (first proposed by Dikin [6] in 1967...trajectories, II. Legendre transform coordinates . central trajectories," manuscripts, to appear in Transactions of the American [6] I.I. Dikin ...34Iterative solution of problems of linear and quadratic programming," Soviet Mathematics Dokladv 8 (1967), 674-675. [7] I.I. Dikin , "On the speed of an

Symmetric quadratic Hamiltonians with pseudo-Hermitian matrix representation

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

Fernández, Francisco M., E-mail: fernande@quimica.unlp.edu.ar

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 aremore » 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.« less

Problems in the Development of Incentive Programs

ERIC Educational Resources Information Center

Rhodes, Warren

1977-01-01

Discusses problems that often occur in the implementation and maintenance of incentive programs in residential institutions for adolescents. Suggests recommendations for overcoming these problems. (MS)

Enhancing Digital Fluency through a Training Program for Creative Problem Solving Using Computer Programming

ERIC Educational Resources Information Center

Kim, SugHee; Chung, KwangSik; Yu, HeonChang

2013-01-01

The purpose of this paper is to propose a training program for creative problem solving based on computer programming. The proposed program will encourage students to solve real-life problems through a creative thinking spiral related to cognitive skills with computer programming. With the goal of enhancing digital fluency through this proposed…

Promising Parenting Programs for Reducing Adolescent Problem Behaviors

PubMed Central

Haggerty, Kevin P.; McGlynn-Wright, Anne; Klima, Tali

2013-01-01

Purpose Adolescent problem behaviors (substance use, delinquency, school dropout, pregnancy, and violence) are costly not only for individuals, but for entire communities. Policymakers and practitioners that are interested in preventing these problem behaviors are faced with many programming options. In this review, we discuss two criteria for selecting relevant parenting programs, and provide five examples of such programs. Design/methodology/approach The first criterion for program selection is theory based. Well-supported theories, such as the social development model, have laid out key family-based risk and protective factors for problem behavior. Programs that target these risk and protective factors are more likely to be effective. Second, programs should have demonstrated efficacy; these interventions have been called “evidence-based programs” (EBP). This review highlights the importance of evidence from rigorous research designs, such as randomized clinical trials, in order to establish program efficacy. Findings Nurse-Family Partnership, The Incredible Years, Positive Parenting Program, Strengthening Families 10–14, and Staying Connected with Your Teen are examined. The unique features of each program are briefly presented. Evidence showing impact on family risk and protective factors, as well as long-term problem behaviors, is reviewed. Finally, a measure of cost effectiveness of each program is provided. Originality/value We propose that not all programs are of equal value, and suggest two simple criteria for selecting a parenting program with a high likelihood for positive outcomes. Furthermore, although this review is not exhaustive, the five examples of EBPs offer a good start for policymakers and practitioners seeking to implement effective programs in their communities. Thus, this paper offers practical suggestions for those grappling with investments in child and adolescent programs on the ground. PMID:24416068

Electromagnetic tracking system with reduced distortion using quadratic excitation.

PubMed

Bien, Tomasz; Li, Mengfei; Salah, Zein; Rose, Georg

2014-03-01

Electromagnetic tracking systems, frequently used in minimally invasive surgery, are affected by conductive distorters. The influence of conductive distorters on electromagnetic tracking system accuracy can be reduced through magnetic field modifications. This approach was developed and tested. The voltage induced directly by the emitting coil in the sensing coil without additional influence by the conductive distorter depends on the first derivative of the voltage on the emitting coil. The voltage which is induced indirectly by the emitting coil across the conductive distorter in the sensing coil, however, depends on the second derivative of the voltage on the emitting coil. The electromagnetic tracking system takes advantage of this difference by supplying the emitting coil with a quadratic excitation voltage. The method is adaptive relative to the amount of distortion cause by the conductive distorters. This approach is evaluated with an experimental setup of the electromagnetic tracking system. In vitro testing showed that the maximal error decreased from 10.9 to 3.8 mm when the quadratic voltage was used to excite the emitting coil instead of the sinusoidal voltage. Furthermore, the root mean square error in the proximity of the aluminum disk used as a conductive distorter was reduced from 3.5 to 1.6 mm when the electromagnetic tracking system used the quadratic instead of sinusoidal excitation. Electromagnetic tracking with quadratic excitation is immune to the effects of a conductive distorter, especially compared with sinusoidal excitation of the emitting coil. Quadratic excitation of electromagnetic tracking for computer-assisted surgery is promising for clinical applications.

Online Quadrat Study - Site Index

Science.gov Websites

Study Project - Prairie Advocates Project ) Background Information - Data Collection and Entry - Data Data Entry Data Summaries and Graphs Quadrat Study Poster for your classroom. Directions for Looking at by Prairie Study Prairie Experts For Non-Fermilab Prairie researchers: Complete step-by-step

Evaluating Writing Programs: Paradigms, Problems, Possibilities.

ERIC Educational Resources Information Center

McLeod, Susan H.

1992-01-01

Describes two methodological approaches (qualitative and quantitative) that grow out of two different research examples. Suggests the problems these methods present. Discusses the ways in which an awareness of these problems can help teachers to understand how to work with researchers in designing useful evaluations of writing programs. (PRA)

Optimal control of LQG problem with an explicit trade-off between mean and variance

NASA Astrophysics Data System (ADS)

Qian, Fucai; Xie, Guo; Liu, Ding; Xie, Wenfang

2011-12-01

For discrete-time linear-quadratic Gaussian (LQG) control problems, a utility function on the expectation and the variance of the conventional performance index is considered. The utility function is viewed as an overall objective of the system and can perform the optimal trade-off between the mean and the variance of performance index. The nonlinear utility function is first converted into an auxiliary parameters optimisation problem about the expectation and the variance. Then an optimal closed-loop feedback controller for the nonseparable mean-variance minimisation problem is designed by nonlinear mathematical programming. Finally, simulation results are given to verify the algorithm's effectiveness obtained in this article.

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.

A Comparison of Trajectory Optimization Methods for the Impulsive Minimum Fuel Rendezvous Problem

NASA Technical Reports Server (NTRS)

Hughes, Steven P.; Mailhe, Laurie M.; Guzman, Jose J.

2002-01-01

In this paper we present a comparison of optimization approaches to the minimum fuel rendezvous problem. Both indirect and direct methods are compared for a variety of test cases. The indirect approach is based on primer vector theory. The direct approaches are implemented numerically and include Sequential Quadratic Programming (SQP), Quasi-Newton, Simplex, Genetic Algorithms, and Simulated Annealing. Each method is applied to a variety of test cases including, circular to circular coplanar orbits, LEO to GEO, and orbit phasing in highly elliptic orbits. We also compare different constrained optimization routines on complex orbit rendezvous problems with complicated, highly nonlinear constraints.

On the complexity of some quadratic Euclidean 2-clustering problems

NASA Astrophysics Data System (ADS)

Kel'manov, A. V.; Pyatkin, A. V.

2016-03-01

Some problems of partitioning a finite set of points of Euclidean space into two clusters are considered. In these problems, the following criteria are minimized: (1) the sum over both clusters of the sums of squared pairwise distances between the elements of the cluster and (2) the sum of the (multiplied by the cardinalities of the clusters) sums of squared distances from the elements of the cluster to its geometric center, where the geometric center (or centroid) of a cluster is defined as the mean value of the elements in that cluster. Additionally, another problem close to (2) is considered, where the desired center of one of the clusters is given as input, while the center of the other cluster is unknown (is the variable to be optimized) as in problem (2). Two variants of the problems are analyzed, in which the cardinalities of the clusters are (1) parts of the input or (2) optimization variables. It is proved that all the considered problems are strongly NP-hard and that, in general, there is no fully polynomial-time approximation scheme for them (unless P = NP).

Quadratic elongation: A quantitative measure of distortion in coordination polyhedra

USGS Publications Warehouse

Robinson, Kelly F.; Gibbs, G.V.; Ribbe, P.H.

1971-01-01

Quadratic elongation and the variance of bond angles are linearly correlated for distorted octahedral and tetrahedral coordination complexes, both of which show variations in bond length and bond angle. The quadratic elonga tion is dimensionless, giving a quantitative measure of polyhedral distortion which is independent of the effective size of the polyhedron.

Effects of Classroom Instruction on Students' Understanding of Quadratic Equations

ERIC Educational Resources Information Center

Vaiyavutjamai, Pongchawee; Clements, M. A.

2006-01-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…

Exploring Quadratic Functions with Logger "Pro"

ERIC Educational Resources Information Center

Pope, Derek

2018-01-01

The author shares the lesson that he used to introduce the quadratic unit to students in an extended second-year algebra class, demonstrate why it was appropriate for his struggling learners, and discuss possible future modifications to this lesson.

Geometrical Solutions of Some Quadratic Equations with Non-Real Roots

ERIC Educational Resources Information Center

Pathak, H. K.; Grewal, A. S.

2002-01-01

This note gives geometrical/graphical methods of finding solutions of the quadratic equation ax[squared] + bx + c = 0, a [not equal to] 0, with non-real roots. Three different cases which give rise to non-real roots of the quadratic equation have been discussed. In case I a geometrical construction and its proof for finding the solutions of the…

Solving intuitionistic fuzzy multi-objective nonlinear programming problem

NASA Astrophysics Data System (ADS)

Anuradha, D.; Sobana, V. E.

2017-11-01

This paper presents intuitionistic fuzzy multi-objective nonlinear programming problem (IFMONLPP). All the coefficients of the multi-objective nonlinear programming problem (MONLPP) and the constraints are taken to be intuitionistic fuzzy numbers (IFN). The IFMONLPP has been transformed into crisp one and solved by using Kuhn-Tucker condition. Numerical example is provided to illustrate the approach.

Geometrical and Graphical Solutions of Quadratic Equations.

ERIC Educational Resources Information Center

Hornsby, E. John, Jr.

1990-01-01

Presented are several geometrical and graphical methods of solving quadratic equations. Discussed are Greek origins, Carlyle's method, von Staudt's method, fixed graph methods and imaginary solutions. (CW)

Employee assistance program treats personal problems.

PubMed

Bednarek, R J; Featherston, H J

1984-03-01

Though the concept of employee assistance programs (EAPs) is widely accepted throughout business and industry, few hospitals have established similar channels for dealing with workers whose personal problems cause work-related problems. Among the reasons for the health care profession's lack of involvement in this area are: lack of information about costs and benefits of EAPs; the hospital's multidisciplinary environment in which standards of employee competence and behavior are set by persons from many disciplines; hospital working hours; and health care workers' attitudes about their vulnerability to illness. St. Benedict's Hospital, Ogden, UT, however, has confronted the question of how to demonstrate Christian concern for its employees. St. Benedict's EAP, the Helping Hand, which was created in 1979, combines progressive disciplinary action with the opportunity for early intervention in and treatment of employees' personal problems. When a worker with personal problems is referred to the EAP coordinator, he or she is matched with the appropriate community or hospital resource for treatment. Supervisors are trained to identify employee problems and to focus on employee job performance rather than on attempting to diagnose the problem. St. Benedict's records during the program's first three years illustrate the human benefits as well as the cost savings of an EAP. Of 92 hospital employees who took part in the EAP, 72 improved their situations or resolved their problems. The hospital's turnover rates declined from 36 percent to 20 percent, and approximately $40,800 in turnover and replacement costs were saved.

MO-FG-CAMPUS-TeP2-01: A Graph Form ADMM Algorithm for Constrained Quadratic Radiation Treatment Planning

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

Liu, X; Belcher, AH; Wiersma, R

Purpose: In radiation therapy optimization the constraints can be either hard constraints which must be satisfied or soft constraints which are included but do not need to be satisfied exactly. Currently the voxel dose constraints are viewed as soft constraints and included as a part of the objective function and approximated as an unconstrained problem. However in some treatment planning cases the constraints should be specified as hard constraints and solved by constrained optimization. The goal of this work is to present a computation efficiency graph form alternating direction method of multipliers (ADMM) algorithm for constrained quadratic treatment planning optimizationmore » and compare it with several commonly used algorithms/toolbox. Method: ADMM can be viewed as an attempt to blend the benefits of dual decomposition and augmented Lagrangian methods for constrained optimization. Various proximal operators were first constructed as applicable to quadratic IMRT constrained optimization and the problem was formulated in a graph form of ADMM. A pre-iteration operation for the projection of a point to a graph was also proposed to further accelerate the computation. Result: The graph form ADMM algorithm was tested by the Common Optimization for Radiation Therapy (CORT) dataset including TG119, prostate, liver, and head & neck cases. Both unconstrained and constrained optimization problems were formulated for comparison purposes. All optimizations were solved by LBFGS, IPOPT, Matlab built-in toolbox, CVX (implementing SeDuMi) and Mosek solvers. For unconstrained optimization, it was found that LBFGS performs the best, and it was 3–5 times faster than graph form ADMM. However, for constrained optimization, graph form ADMM was 8 – 100 times faster than the other solvers. Conclusion: A graph form ADMM can be applied to constrained quadratic IMRT optimization. It is more computationally efficient than several other commercial and noncommercial optimizers and it

Quadratic spatial soliton interactions

NASA Astrophysics Data System (ADS)

Jankovic, Ladislav

Quadratic spatial soliton interactions were investigated in this Dissertation. The first part deals with characterizing the principal features of multi-soliton generation and soliton self-reflection. The second deals with two beam processes leading to soliton interactions and collisions. These subjects were investigated both theoretically and experimentally. The experiments were performed by using potassium niobate (KNBO 3) and periodically poled potassium titanyl phosphate (KTP) crystals. These particular crystals were desirable for these experiments because of their large nonlinear coefficients and, more importantly, because the experiments could be performed under non-critical-phase-matching (NCPM) conditions. The single soliton generation measurements, performed on KNBO3 by launching the fundamental component only, showed a broad angular acceptance bandwidth which was important for the soliton collisions performed later. Furthermore, at high input intensities multi-soliton generation was observed for the first time. The influence on the multi-soliton patterns generated of the input intensity and beam symmetry was investigated. The combined experimental and theoretical efforts indicated that spatial and temporal noise on the input laser beam induced multi-soliton patterns. Another research direction pursued was intensity dependent soliton routing by using of a specially engineered quadratically nonlinear interface within a periodically poled KTP sample. This was the first time demonstration of the self-reflection phenomenon in a system with a quadratic nonlinearity. The feature investigated is believed to have a great potential for soliton routing and manipulation by engineered structures. A detailed investigation was conducted on two soliton interaction and collision processes. Birth of an additional soliton resulting from a two soliton collision was observed and characterized for the special case of a non-planar geometry. A small amount of spiraling, up to 30

EZLP: An Interactive Computer Program for Solving Linear Programming Problems. Final Report.

ERIC Educational Resources Information Center

Jarvis, John J.; And Others

Designed for student use in solving linear programming problems, the interactive computer program described (EZLP) permits the student to input the linear programming model in exactly the same manner in which it would be written on paper. This report includes a brief review of the development of EZLP; narrative descriptions of program features,…

Problems, Perplexities, and Politics of Program Evaluation.

ERIC Educational Resources Information Center

Schneider, Gail Thierbach

All educational evaluations share common problems, perplexities, and political considerations. Logistic problems include incomplete definition of purpose, unclear timelines and personnel allocations, inadequate support services, and the lack of a program plan. Interpersonal dynamics and conflicts plus unwieldy committee structures are perplexities…

Decomposition method for zonal resource allocation problems in telecommunication networks

NASA Astrophysics Data System (ADS)

Konnov, I. V.; Kashuba, A. Yu

2016-11-01

We consider problems of optimal resource allocation in telecommunication networks. We first give an optimization formulation for the case where the network manager aims to distribute some homogeneous resource (bandwidth) among users of one region with quadratic charge and fee functions and present simple and efficient solution methods. Next, we consider a more general problem for a provider of a wireless communication network divided into zones (clusters) with common capacity constraints. We obtain a convex quadratic optimization problem involving capacity and balance constraints. By using the dual Lagrangian method with respect to the capacity constraint, we suggest to reduce the initial problem to a single-dimensional optimization problem, but calculation of the cost function value leads to independent solution of zonal problems, which coincide with the above single region problem. Some results of computational experiments confirm the applicability of the new methods.

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

On Volterra quadratic stochastic operators with continual state space

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

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 themore » segment X = [0,1] with Borel σ - algebra F on X , prove their regularity and show that the limit measure is a Dirac measure.« less

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

Program Helps Decompose Complicated Design Problems

NASA Technical Reports Server (NTRS)

Rogers, James L., Jr.

1993-01-01

Time saved by intelligent decomposition into smaller, interrelated problems. DeMAID is knowledge-based software system for ordering sequence of modules and identifying possible multilevel structure for design problem. Displays modules in N x N matrix format. Requires investment of time to generate and refine list of modules for input, it saves considerable amount of money and time in total design process, particularly new design problems in which ordering of modules has not been defined. Program also implemented to examine assembly-line process or ordering of tasks and milestones.

Development of Schema Knowledge in the Classroom: Effects upon Problem Representation and Problem Solution of Programming.

ERIC Educational Resources Information Center

Tsai, Shu-Er

Students with a semester or more of instruction often display remarkable naivety about the language that they have been studying and often prove unable to manage simple programming problems. The main purpose of this study was to create a set of problem-plan-program types for the BASIC programming language to help high school students build plans…

Adolescent Assertiveness: Problems and Programs.

ERIC Educational Resources Information Center

Reece, Randi S.; Wilborn, Bobbie L.

1980-01-01

Assertiveness training programs in the school setting provide a method to work with students with behavior problems. When students can manage their environments more effectively, they view the educational experience more positively and find that their present world and their transition to the adult world proceeds more productively. (Author)

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.

Linear and quadratic static response functions and structure functions in Yukawa liquids.

PubMed

Magyar, Péter; Donkó, Zoltán; Kalman, Gabor J; Golden, Kenneth I

2014-08-01

We compute linear and quadratic static density response functions of three-dimensional Yukawa liquids by applying an external perturbation potential in molecular dynamics simulations. The response functions are also obtained from the equilibrium fluctuations (static structure factors) in the system via the fluctuation-dissipation theorems. The good agreement of the quadratic response functions, obtained in the two different ways, confirms the quadratic fluctuation-dissipation theorem. We also find that the three-point structure function may be factorizable into two-point structure functions, leading to a cluster representation of the equilibrium triplet correlation function.

Interactive Problem Solving Tutorials Through Visual Programming

NASA Astrophysics Data System (ADS)

Undreiu, Lucian; Schuster, David; Undreiu, Adriana

2008-10-01

We have used LabVIEW visual programming to build an interactive tutorial to promote conceptual understanding in physics problem solving. This programming environment is able to offer a web-accessible problem solving experience that enables students to work at their own pace and receive feedback. Intuitive graphical symbols, modular structures and the ability to create templates are just a few of the advantages this software has to offer. The architecture of an application can be designed in a way that allows instructors with little knowledge of LabVIEW to easily personalize it. Both the physics solution and the interactive pedagogy can be visually programmed in LabVIEW. Our physics pedagogy approach is that of cognitive apprenticeship, in that the tutorial guides students to develop conceptual understanding and physical insight into phenomena, rather than purely formula-based solutions. We demonstrate how this model is reflected in the design and programming of the interactive tutorials.

Geometrical Solutions of Quadratic Equations.

ERIC Educational Resources Information Center

Grewal, A. S.; Godloza, L.

1999-01-01

Demonstrates that the equation of a circle (x-h)2 + (y-k)2 = r2 with center (h; k) and radius r reduces to a quadratic equation x2-2xh + (h2 + k2 -r2) = O at the intersection with the x-axis. Illustrates how to determine the center of a circle as well as a point on a circle. (Author/ASK)

Using ant colony optimization on the quadratic assignment problem to achieve low energy cost in geo-distributed data centers

NASA Astrophysics Data System (ADS)

Osei, Richard

There are many problems associated with operating a data center. Some of these problems include data security, system performance, increasing infrastructure complexity, increasing storage utilization, keeping up with data growth, and increasing energy costs. Energy cost differs by location, and at most locations fluctuates over time. The rising cost of energy makes it harder for data centers to function properly and provide a good quality of service. With reduced energy cost, data centers will have longer lasting servers/equipment, higher availability of resources, better quality of service, a greener environment, and reduced service and software costs for consumers. Some of the ways that data centers have tried to using to reduce energy costs include dynamically switching on and off servers based on the number of users and some predefined conditions, the use of environmental monitoring sensors, and the use of dynamic voltage and frequency scaling (DVFS), which enables processors to run at different combinations of frequencies with voltages to reduce energy cost. This thesis presents another method by which energy cost at data centers could be reduced. This method involves the use of Ant Colony Optimization (ACO) on a Quadratic Assignment Problem (QAP) in assigning user request to servers in geo-distributed data centers. In this paper, an effort to reduce data center energy cost involves the use of front portals, which handle users' requests, were used as ants to find cost effective ways to assign users requests to a server in heterogeneous geo-distributed data centers. The simulation results indicate that the ACO for Optimal Server Activation and Task Placement algorithm reduces energy cost on a small and large number of users' requests in a geo-distributed data center and its performance increases as the input data grows. In a simulation with 3 geo-distributed data centers, and user's resource request ranging from 25,000 to 25,000,000, the ACO algorithm was able

The non-avian theropod quadrate I: standardized terminology with an overview of the anatomy and function

PubMed Central

Araújo, Ricardo; Mateus, Octávio

2015-01-01

The quadrate of reptiles and most other tetrapods plays an important morphofunctional role by allowing the articulation of the mandible with the cranium. In Theropoda, the morphology of the quadrate is particularly complex and varies importantly among different clades of non-avian theropods, therefore conferring a strong taxonomic potential. Inconsistencies in the notation and terminology used in discussions of the theropod quadrate anatomy have been noticed, including at least one instance when no less than eight different terms were given to the same structure. A standardized list of terms and notations for each quadrate anatomical entity is proposed here, with the goal of facilitating future descriptions of this important cranial bone. In addition, an overview of the literature on quadrate function and pneumaticity in non-avian theropods is presented, along with a discussion of the inferences that could be made from this research. Specifically, the quadrate of the large majority of non-avian theropods is akinetic but the diagonally oriented intercondylar sulcus of the mandibular articulation allowed both rami of the mandible to move laterally when opening the mouth in many of theropods. Pneumaticity of the quadrate is also present in most averostran clades and the pneumatic chamber—invaded by the quadrate diverticulum of the mandibular arch pneumatic system—was connected to one or several pneumatic foramina on the medial, lateral, posterior, anterior or ventral sides of the quadrate. PMID:26401455

Optimal linear-quadratic control of coupled parabolic-hyperbolic PDEs

NASA Astrophysics Data System (ADS)

Aksikas, I.; Moghadam, A. Alizadeh; Forbes, J. F.

2017-10-01

This paper focuses on the optimal control design for a system of coupled parabolic-hypebolic partial differential equations by using the infinite-dimensional state-space description and the corresponding operator Riccati equation. Some dynamical properties of the coupled system of interest are analysed to guarantee the existence and uniqueness of the solution of the linear-quadratic (LQ)-optimal control problem. A state LQ-feedback operator is computed by solving the operator Riccati equation, which is converted into a set of algebraic and differential Riccati equations, thanks to the eigenvalues and the eigenvectors of the parabolic operator. The results are applied to a non-isothermal packed-bed catalytic reactor. The LQ-optimal controller designed in the early portion of the paper is implemented for the original nonlinear model. Numerical simulations are performed to show the controller performances.

A Wavelet Bicoherence-Based Quadratic Nonlinearity Feature for Translational Axis Condition Monitoring

PubMed Central

Li, Yong; Wang, Xiufeng; Lin, Jing; Shi, Shengyu

2014-01-01

The translational axis is one of the most important subsystems in modern machine tools, as its degradation may result in the loss of the product qualification and lower the control precision. Condition-based maintenance (CBM) has been considered as one of the advanced maintenance schemes to achieve effective, reliable and cost-effective operation of machine systems, however, current vibration-based maintenance schemes cannot be employed directly in the translational axis system, due to its complex structure and the inefficiency of commonly used condition monitoring features. In this paper, a wavelet bicoherence-based quadratic nonlinearity feature is proposed for translational axis condition monitoring by using the torque signature of the drive servomotor. Firstly, the quadratic nonlinearity of the servomotor torque signature is discussed, and then, a biphase randomization wavelet bicoherence is introduced for its quadratic nonlinear detection. On this basis, a quadratic nonlinearity feature is proposed for condition monitoring of the translational axis. The properties of the proposed quadratic nonlinearity feature are investigated by simulations. Subsequently, this feature is applied to the real-world servomotor torque data collected from the X-axis on a high precision vertical machining centre. All the results show that the performance of the proposed feature is much better than that of original condition monitoring features. PMID:24473281

Quadratic dissipation effect on the moonpool resonance

NASA Astrophysics Data System (ADS)

Liu, Heng-xu; Chen, Hai-long; Zhang, Liang; Zhang, Wan-chao; Liu, Ming

2017-12-01

This paper adopted a semi-analytical method based on eigenfunction matching to solve the problem of sharp resonance of cylindrical structures with a moonpool that has a restricted entrance. To eliminate the sharp resonance and to measure the viscous effect, a quadratic dissipation is introduced by assuming an additional dissipative disk at the moonpool entrance. The fluid domain is divided into five cylindrical subdomains, and the velocity potential in each subdomain is obtained by meeting the Laplace equation as well as the boundary conditions. The free-surface elevation at the center of the moonpool, along with the pressure and velocity at the restricted entrance for first-order wave are evaluated. By choosing appropriate dissipation coefficients, the free-surface elevation calculated at the center of the moonpool is in coincidence with the measurements in model tests both at the peak period and amplitude at resonance. It is shown that the sharp resonance in the potential flow theory can be eliminated and the viscous effect can be estimated with a simple method in some provided hydrodynamic models.

Quadratic canonical transformation theory and higher order density matrices.

PubMed

Neuscamman, Eric; Yanai, Takeshi; Chan, Garnet Kin-Lic

2009-03-28

Canonical transformation (CT) theory provides a rigorously size-extensive description of dynamic correlation in multireference systems, with an accuracy superior to and cost scaling lower than complete active space second order perturbation theory. Here we expand our previous theory by investigating (i) a commutator approximation that is applied at quadratic, as opposed to linear, order in the effective Hamiltonian, and (ii) incorporation of the three-body reduced density matrix in the operator and density matrix decompositions. The quadratic commutator approximation improves CT's accuracy when used with a single-determinant reference, repairing the previous formal disadvantage of the single-reference linear CT theory relative to singles and doubles coupled cluster theory. Calculations on the BH and HF binding curves confirm this improvement. In multireference systems, the three-body reduced density matrix increases the overall accuracy of the CT theory. Tests on the H(2)O and N(2) binding curves yield results highly competitive with expensive state-of-the-art multireference methods, such as the multireference Davidson-corrected configuration interaction (MRCI+Q), averaged coupled pair functional, and averaged quadratic coupled cluster theories.

Differences between quadratic equations and functions: Indonesian pre-service secondary mathematics teachers’ views

NASA Astrophysics Data System (ADS)

Aziz, T. A.; Pramudiani, P.; Purnomo, Y. W.

2018-01-01

Difference between quadratic equation and quadratic function as perceived by Indonesian pre-service secondary mathematics teachers (N = 55) who enrolled at one private university in Jakarta City was investigated. Analysis of participants’ written responses and interviews were conducted consecutively. Participants’ written responses highlighted differences between quadratic equation and function by referring to their general terms, main characteristics, processes, and geometrical aspects. However, they showed several obstacles in describing the differences such as inappropriate constraints and improper interpretations. Implications of the study are discussed.

Quadratic time dependent Hamiltonians and separation of variables

NASA Astrophysics Data System (ADS)

Anzaldo-Meneses, A.

2017-06-01

Time dependent quantum problems defined by quadratic Hamiltonians are solved using canonical transformations. The Green's function is obtained and a comparison with the classical Hamilton-Jacobi method leads to important geometrical insights like exterior differential systems, Monge cones and time dependent Gaussian metrics. The Wei-Norman approach is applied using unitary transformations defined in terms of generators of the associated Lie groups, here the semi-direct product of the Heisenberg group and the symplectic group. A new explicit relation for the unitary transformations is given in terms of a finite product of elementary transformations. The sequential application of adequate sets of unitary transformations leads naturally to a new separation of variables method for time dependent Hamiltonians, which is shown to be related to the Inönü-Wigner contraction of Lie groups. The new method allows also a better understanding of interacting particles or coupled modes and opens an alternative way to analyze topological phases in driven systems.

Problem Seeking. New Directions in Architectural Programming.

ERIC Educational Resources Information Center

Pena, William M.; Focke, John W.

The rationale, principles, and methods of pre-design architectural programing are explained for those responsible for overall policy decision-making in the area of facility planning. This programing process provides an orderly framework that aids the architect in defining a client's total problem. A general background is given on data collection,…

Path integration of the time-dependent forced oscillator with a two-time quadratic action

NASA Astrophysics Data System (ADS)

Zhang, Tian Rong; Cheng, Bin Kang

1986-03-01

Using the prodistribution theory proposed by DeWitt-Morette [C. DeWitt-Morette, Commun. Math. Phys. 28, 47 (1972); C. DeWitt-Morette, A. Maheshwari, and B. Nelson, Phys. Rep. 50, 257 (1979)], the path integration of a time-dependent forced harmonic oscillator with a two-time quadratic action has been given in terms of the solutions of some integrodifferential equations. We then evaluate explicitly both the classical path and the propagator for the specific kernel introduced by Feynman in the polaron problem. Our results include the previous known results as special cases.

Coordination Problems in Graduate Programs for Two-Year College English Teachers.

ERIC Educational Resources Information Center

Sparrow, W. Keats

Six problems in coordinating a graduate program for two-year college English teachers are discussed in this paper. The problems are: how to implement national guidelines for such programs, how to staff the programs, how to accommodate traditional university personnel guidelines and regulations to the nontraditional staff for the programs, how to…

Linear decomposition approach for a class of nonconvex programming problems.

PubMed

Shen, Peiping; Wang, Chunfeng

2017-01-01

This paper presents a linear decomposition approach for a class of nonconvex programming problems by dividing the input space into polynomially many grids. It shows that under certain assumptions the original problem can be transformed and decomposed into a polynomial number of equivalent linear programming subproblems. Based on solving a series of liner programming subproblems corresponding to those grid points we can obtain the near-optimal solution of the original problem. Compared to existing results in the literature, the proposed algorithm does not require the assumptions of quasi-concavity and differentiability of the objective function, and it differs significantly giving an interesting approach to solving the problem with a reduced running time.

Smoothing optimization of supporting quadratic surfaces with Zernike polynomials

NASA Astrophysics Data System (ADS)

Zhang, Hang; Lu, Jiandong; Liu, Rui; Ma, Peifu

2018-03-01

A new optimization method to get a smooth freeform optical surface from an initial surface generated by the supporting quadratic method (SQM) is proposed. To smooth the initial surface, a 9-vertex system from the neighbor quadratic surface and the Zernike polynomials are employed to establish a linear equation system. A local optimized surface to the 9-vertex system can be build by solving the equations. Finally, a continuous smooth optimization surface is constructed by stitching the above algorithm on the whole initial surface. The spot corresponding to the optimized surface is no longer discrete pixels but a continuous distribution.

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.

The application of LQR synthesis techniques to the turboshaft engine control problem. [Linear Quadratic Regulator

NASA Technical Reports Server (NTRS)

Pfeil, W. H.; De Los Reyes, G.; Bobula, G. A.

1985-01-01

A power turbine governor was designed for a recent-technology turboshaft engine coupled to a modern, articulated rotor system using Linear Quadratic Regulator (LQR) and Kalman Filter (KF) techniques. A linear, state-space model of the engine and rotor system was derived for six engine power settings from flight idle to maximum continuous. An integrator was appended to the fuel flow input to reduce the steady-state governor error to zero. Feedback gains were calculated for the system states at each power setting using the LQR technique. The main rotor tip speed state is not measurable, so a Kalman Filter of the rotor was used to estimate this state. The crossover of the system was increased to 10 rad/s compared to 2 rad/sec for a current governor. Initial computer simulations with a nonlinear engine model indicate a significant decrease in power turbine speed variation with the LQR governor compared to a conventional governor.

Estimating factors influencing the detection probability of semiaquatic freshwater snails using quadrat survey methods

USGS Publications Warehouse

Roesler, Elizabeth L.; Grabowski, Timothy B.

2018-01-01

Developing effective monitoring methods for elusive, rare, or patchily distributed species requires extra considerations, such as imperfect detection. Although detection is frequently modeled, the opportunity to assess it empirically is rare, particularly for imperiled species. We used Pecos assiminea (Assiminea pecos), an endangered semiaquatic snail, as a case study to test detection and accuracy issues surrounding quadrat searches. Quadrats (9 × 20 cm; n = 12) were placed in suitable Pecos assiminea habitat and randomly assigned a treatment, defined as the number of empty snail shells (0, 3, 6, or 9). Ten observers rotated through each quadrat, conducting 5-min visual searches for shells. The probability of detecting a shell when present was 67.4 ± 3.0%, but it decreased with the increasing litter depth and fewer number of shells present. The mean (± SE) observer accuracy was 25.5 ± 4.3%. Accuracy was positively correlated to the number of shells in the quadrat and negatively correlated to the number of times a quadrat was searched. The results indicate quadrat surveys likely underrepresent true abundance, but accurately determine the presence or absence. Understanding detection and accuracy of elusive, rare, or imperiled species improves density estimates and aids in monitoring and conservation efforts.

Photon-phonon parametric oscillation induced by quadratic coupling in an optomechanical resonator

NASA Astrophysics Data System (ADS)

Zhang, Lin; Ji, Fengzhou; Zhang, Xu; Zhang, Weiping

2017-07-01

A direct photon-phonon parametric effect of quadratic coupling on the mean-field dynamics of an optomechanical resonator in the large-scale-movement regime is found and investigated. Under a weak pumping power, the mechanical resonator damps to a steady state with a nonlinear static response sensitively modified by the quadratic coupling. When the driving power increases beyond the static energy balance, the steady states lose their stabilities via Hopf bifurcations, and the resonator produces stable self-sustained oscillation (limit-circle behavior) of discrete energies with step-like amplitudes due to the parametric effect of quadratic coupling, which can be understood roughly by the power balance between gain and loss on the resonator. A further increase in the pumping power can induce a chaotic dynamic of the resonator via a typical routine of period-doubling bifurcation, but which can be stabilized by the parametric effect through an inversion-bifurcation process back to the limit-circle states. The bifurcation-to-inverse-bifurcation transitions are numerically verified by the maximal Lyapunov exponents of the dynamics, which indicate an efficient way of suppressing the chaotic behavior of the optomechanical resonator by quadratic coupling. Furthermore, the parametric effect of quadratic coupling on the dynamic transitions of an optomechanical resonator can be conveniently detected or traced by the output power spectrum of the cavity field.

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.

Analytical approximations for the oscillators with anti-symmetric quadratic nonlinearity

NASA Astrophysics Data System (ADS)

Alal Hosen, Md.; Chowdhury, M. S. H.; Yeakub Ali, Mohammad; Faris Ismail, Ahmad

2017-12-01

A second-order ordinary differential equation involving anti-symmetric quadratic nonlinearity changes sign. The behaviour of the oscillators with an anti-symmetric quadratic nonlinearity is assumed to oscillate different in the positive and negative directions. In this reason, Harmonic Balance Method (HBM) cannot be directly applied. The main purpose of the present paper is to propose an analytical approximation technique based on the HBM for obtaining approximate angular frequencies and the corresponding periodic solutions of the oscillators with anti-symmetric quadratic nonlinearity. After applying HBM, a set of complicated nonlinear algebraic equations is found. Analytical approach is not always fruitful for solving such kinds of nonlinear algebraic equations. In this article, two small parameters are found, for which the power series solution produces desired results. Moreover, the amplitude-frequency relationship has also been determined in a novel analytical way. The presented technique gives excellent results as compared with the corresponding numerical results and is better than the existing ones.

An efficient method for generalized linear multiplicative programming problem with multiplicative constraints.

PubMed

Zhao, Yingfeng; Liu, Sanyang

2016-01-01

We present a practical branch and bound algorithm for globally solving generalized linear multiplicative programming problem with multiplicative constraints. To solve the problem, a relaxation programming problem which is equivalent to a linear programming is proposed by utilizing a new two-phase relaxation technique. In the algorithm, lower and upper bounds are simultaneously obtained by solving some linear relaxation programming problems. Global convergence has been proved and results of some sample examples and a small random experiment show that the proposed algorithm is feasible and efficient.

New computer program solves wide variety of heat flow problems

NASA Technical Reports Server (NTRS)

Almond, J. C.

1966-01-01

Boeing Engineering Thermal Analyzer /BETA/ computer program uses numerical methods to provide accurate heat transfer solutions to a wide variety of heat flow problems. The program solves steady-state and transient problems in almost any situation that can be represented by a resistance-capacitance network.

MM Algorithms for Geometric and Signomial Programming

PubMed Central

Lange, Kenneth; Zhou, Hua

2013-01-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. PMID:24634545

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.

A new approach to approximating the linear quadratic optimal control law for hereditary systems with control delays

NASA Technical Reports Server (NTRS)

Milman, M. H.

1985-01-01

A factorization approach is presented for deriving approximations to the optimal feedback gain 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 feedback kernels.

Using Linear and Quadratic Functions to Teach Number Patterns in Secondary School

ERIC Educational Resources Information Center

Kenan, Kok Xiao-Feng

2017-01-01

This paper outlines an approach to definitively find the general term in a number pattern, of either a linear or quadratic form, by using the general equation of a linear or quadratic function. This approach is governed by four principles: (1) identifying the position of the term (input) and the term itself (output); (2) recognising that each…

Linear Programming and Its Application to Pattern Recognition Problems

NASA Technical Reports Server (NTRS)

Omalley, M. J.

1973-01-01

Linear programming and linear programming like techniques as applied to pattern recognition problems are discussed. Three relatively recent research articles on such applications are summarized. The main results of each paper are described, indicating the theoretical tools needed to obtain them. A synopsis of the author's comments is presented with regard to the applicability or non-applicability of his methods to particular problems, including computational results wherever given.

Sensitive SERS detection of lead ions via DNAzyme based quadratic signal amplification.

PubMed

Tian, Aihua; Liu, Yu; Gao, Jian

2017-08-15

Highly sensitive detection of Pb 2+ is very necessary for water quality control, clinical toxicology, and industrial monitoring. In this work, a simple and novel DNAzyme-based SERS quadratic amplification method is developed for the detection of Pb 2+ . This strategy possesses some remarkable features compared to the conventional DNAzyme-based SERS methods, which are as follows: (i) Coupled DNAzyme-activated hybridization chain reaction (HCR) with bio barcodes; a quadratic amplification method is designed using the unique catalytic selectivity of DNAzyme. The SERS signal is significantly amplified. This method is rapid with a detection time of 2h. (ii) The problem of high background induced by excess bio barcodes is circumvented by using magnetic beads (MBs) as the carrier of signal-output products, and this sensing system is simple in design and can easily be carried out by simple mixing and incubation. Given the unique and attractive characteristics, a simple and universal strategy is designed to accomplish sensitive detection of Pb 2+ . The detection limit of Pb 2+ via SERS detection is 70 fM, with the linear range from 1.0×10 -13 M to 1.0×10 -7 M. The method can be further extended to the quantitative detection of a variety of targets by replacing the lead-responsive DNAzyme with other functional DNA. Copyright © 2017 Elsevier B.V. All rights reserved.

Exponential Thurston maps and limits of quadratic differentials

NASA Astrophysics Data System (ADS)

Hubbard, John; Schleicher, Dierk; Shishikura, Mitsuhiro

2009-01-01

We give a topological characterization of postsingularly finite topological exponential maps, i.e., universal covers g\\colon{C}to{C}setminus\\{0\\} such that 0 has a finite orbit. Such a map either is Thurston equivalent to a unique holomorphic exponential map λ e^z or it has a topological obstruction called a degenerate Levy cycle. This is the first analog of Thurston's topological characterization theorem of rational maps, as published by Douady and Hubbard, for the case of infinite degree. One main tool is a theorem about the distribution of mass of an integrable quadratic differential with a given number of poles, providing an almost compact space of models for the entire mass of quadratic differentials. This theorem is given for arbitrary Riemann surfaces of finite type in a uniform way.

Mixed Integer Programming and Heuristic Scheduling for Space Communication Networks

NASA Technical Reports Server (NTRS)

Cheung, Kar-Ming; Lee, Charles H.

2012-01-01

We developed framework and the mathematical formulation for optimizing communication network using mixed integer programming. The design yields a system that is much smaller, in search space size, when compared to the earlier approach. Our constrained network optimization takes into account the dynamics of link performance within the network along with mission and operation requirements. A unique penalty function is introduced to transform the mixed integer programming into the more manageable problem of searching in a continuous space. The constrained optimization problem was proposed to solve in two stages: first using the heuristic Particle Swarming Optimization algorithm to get a good initial starting point, and then feeding the result into the Sequential Quadratic Programming algorithm to achieve the final optimal schedule. We demonstrate the above planning and scheduling methodology with a scenario of 20 spacecraft and 3 ground stations of a Deep Space Network site. Our approach and framework have been simple and flexible so that problems with larger number of constraints and network can be easily adapted and solved.

Computer-aided programming for message-passing system; Problems and a solution

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

Wu, M.Y.; Gajski, D.D.

1989-12-01

As the number of processors and the complexity of problems to be solved increase, programming multiprocessing systems becomes more difficult and error-prone. Program development tools are necessary since programmers are not able to develop complex parallel programs efficiently. Parallel models of computation, parallelization problems, and tools for computer-aided programming (CAP) are discussed. As an example, a CAP tool that performs scheduling and inserts communication primitives automatically is described. It also generates the performance estimates and other program quality measures to help programmers in improving their algorithms and programs.

Problem Video Gaming Among Children Enrolled in Tertiary Weight Management Programs.

PubMed

Stubblefield, Sam; Datto, George; Phan, Thao-Ly T; Werk, Lloyd N; Stackpole, Kristin; Siegel, Robert; Stratbucker, William; Tucker, Jared M; Christison, Amy L; Hossain, Jobayer; Gentile, Douglas A

2017-02-01

Prior studies show seven percent to nine percent of children demonstrate gaming behaviors that affect a child's ability to function (e.g., problem gaming), but none have examined the association between problem gaming and weight status. The objective of this study was to determine the prevalence of problem gaming among children enrolled in tertiary weight management programs. We administered a computer-based survey to a convenience sample of children aged 11-17 years enrolled in five geographically diverse pediatric weight management (PWM) programs in the COMPASS (Childhood Obesity Multi-Program Analysis and Study System) network. The survey included demographics, gaming characteristics, and a problem gaming assessment. The survey had 454 respondents representing a diverse cohort (53 percent females, 27 percent black, 24 percent Hispanic, 41 percent white) with mean age of 13.7 years. A total of 8.2 percent of respondents met criteria for problem gaming. Problem gamers were more likely to be white, male, play mature-rated games, and report daily play. Children in PWM programs reported problem gaming at the same rate as other pediatric populations. Screening for problem gaming provides an opportunity for pediatricians to address gaming behaviors that may affect the health of children with obesity who already are at risk for worsened health and quality of life.

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.

Developing Student Programming and Problem-Solving Skills with Visual Basic

ERIC Educational Resources Information Center

Siegle, Del

2009-01-01

Although most computer users will never need to write a computer program, many students enjoy the challenge of creating one. Computer programming enhances students' problem solving by forcing students to break a problem into its component pieces and reassemble it in a generic format that can be understood by a nonsentient entity. It promotes…

Using Problem Solving to Teach a Programming Language.

ERIC Educational Resources Information Center

Milbrandt, George

1995-01-01

Computer studies courses should incorporate as many computer concepts and programming language experiences as possible. A gradual increase in problem difficulty will help the student to understand various computer concepts, and the programming language's syntax and structure. A sidebar provides two examples of how to establish a learning…

Exact solutions for an oscillator with anti-symmetric quadratic nonlinearity

NASA Astrophysics Data System (ADS)

Beléndez, A.; Martínez, F. J.; Beléndez, T.; Pascual, C.; Alvarez, M. L.; Gimeno, E.; Arribas, E.

2018-04-01

Closed-form exact solutions for an oscillator with anti-symmetric quadratic nonlinearity are derived from the first integral of the nonlinear differential equation governing the behaviour of this oscillator. The mathematical model is an ordinary second order differential equation in which the sign of the quadratic nonlinear term changes. Two parameters characterize this oscillator: the coefficient of the linear term and the coefficient of the quadratic term. Not only the common case in which both coefficients are positive but also all possible combinations of positive and negative signs of these coefficients which provide periodic motions are considered, giving rise to four different cases. Three different periods and solutions are obtained, since the same result is valid in two of these cases. An interesting feature is that oscillatory motions whose equilibrium points are not at x = 0 are also considered. The periods are given in terms of an incomplete or complete elliptic integral of the first kind, and the exact solutions are expressed as functions including Jacobi elliptic cosine or sine functions.

Quadratic grating apodized photon sieves for simultaneous multiplane microscopy

NASA Astrophysics Data System (ADS)

Cheng, Yiguang; Zhu, Jiangping; He, Yu; Tang, Yan; Hu, Song; Zhao, Lixin

2017-10-01

We present a new type of imaging device, named quadratic grating apodized photon sieve (QGPS), used as the objective for simultaneous multiplane imaging in X-rays. The proposed QGPS is structured based on the combination of two concepts: photon sieves and quadratic gratings. Its design principles are also expounded in detail. Analysis of imaging properties of QGPS in terms of point-spread function shows that QGPS can image multiple layers within an object field onto a single image plane. Simulated and experimental results in visible light both demonstrate the feasibility of QGPS for simultaneous multiplane imaging, which is extremely promising to detect dynamic specimens by X-ray microscopy in the physical and life sciences.

Solving a class of generalized fractional programming problems using the feasibility of linear programs.

PubMed

Shen, Peiping; Zhang, Tongli; Wang, Chunfeng

2017-01-01

This article presents a new approximation algorithm for globally solving a class of generalized fractional programming problems (P) whose objective functions are defined as an appropriate composition of ratios of affine functions. To solve this problem, the algorithm solves an equivalent optimization problem (Q) via an exploration of a suitably defined nonuniform grid. The main work of the algorithm involves checking the feasibility of linear programs associated with the interesting grid points. It is proved that the proposed algorithm is a fully polynomial time approximation scheme as the ratio terms are fixed in the objective function to problem (P), based on the computational complexity result. In contrast to existing results in literature, the algorithm does not require the assumptions on quasi-concavity or low-rank of the objective function to problem (P). Numerical results are given to illustrate the feasibility and effectiveness of the proposed algorithm.

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…

Sequential design of discrete linear quadratic regulators via optimal root-locus techniques

NASA Technical Reports Server (NTRS)

Shieh, Leang S.; Yates, Robert E.; Ganesan, Sekar

1989-01-01

A sequential method employing classical root-locus techniques has been developed in order to determine the quadratic weighting matrices and discrete linear quadratic regulators of multivariable control systems. At each recursive step, an intermediate unity rank state-weighting matrix that contains some invariant eigenvectors of that open-loop matrix is assigned, and an intermediate characteristic equation of the closed-loop system containing the invariant eigenvalues is created.

Iterative method for in situ measurement of lens aberrations in lithographic tools using CTC-based quadratic aberration model.

PubMed

Liu, Shiyuan; Xu, Shuang; Wu, Xiaofei; Liu, Wei

2012-06-18

This paper proposes an iterative method for in situ lens aberration measurement in lithographic tools based on a quadratic aberration model (QAM) that is a natural extension of the linear model formed by taking into account interactions among individual Zernike coefficients. By introducing a generalized operator named cross triple correlation (CTC), the quadratic model can be calculated very quickly and accurately with the help of fast Fourier transform (FFT). The Zernike coefficients up to the 37th order or even higher are determined by solving an inverse problem through an iterative procedure from several through-focus aerial images of a specially designed mask pattern. The simulation work has validated the theoretical derivation and confirms that such a method is simple to implement and yields a superior quality of wavefront estimate, particularly for the case when the aberrations are relatively large. It is fully expected that this method will provide a useful practical means for the in-line monitoring of the imaging quality of lithographic tools.

Problem Video Gaming Among Children Enrolled in Tertiary Weight Management Programs

PubMed Central

Datto, George; Phan, Thao-Ly T.; Werk, Lloyd N.; Stackpole, Kristin; Siegel, Robert; Stratbucker, William; Tucker, Jared M.; Christison, Amy L.; Hossain, Jobayer; Gentile, Douglas A.

2017-01-01

Abstract Prior studies show seven percent to nine percent of children demonstrate gaming behaviors that affect a child's ability to function (e.g., problem gaming), but none have examined the association between problem gaming and weight status. The objective of this study was to determine the prevalence of problem gaming among children enrolled in tertiary weight management programs. We administered a computer-based survey to a convenience sample of children aged 11–17 years enrolled in five geographically diverse pediatric weight management (PWM) programs in the COMPASS (Childhood Obesity Multi-Program Analysis and Study System) network. The survey included demographics, gaming characteristics, and a problem gaming assessment. The survey had 454 respondents representing a diverse cohort (53 percent females, 27 percent black, 24 percent Hispanic, 41 percent white) with mean age of 13.7 years. A total of 8.2 percent of respondents met criteria for problem gaming. Problem gamers were more likely to be white, male, play mature-rated games, and report daily play. Children in PWM programs reported problem gaming at the same rate as other pediatric populations. Screening for problem gaming provides an opportunity for pediatricians to address gaming behaviors that may affect the health of children with obesity who already are at risk for worsened health and quality of life. PMID:28170312

Middle School Students' Reasoning in Nonlinear Proportional Problems in Geometry

ERIC Educational Resources Information Center

Ayan, Rukiye; Isiksal Bostan, Mine

2018-01-01

In this study, we investigate sixth, seventh, and eighth grade students' achievement in nonlinear (quadratic or cubic) proportional problems regarding length, area, and volume of enlarged figures. In addition, we examine students' solution strategies for the problems and obstacles that prevent students from answering the problems correctly by…

Optimization by nonhierarchical asynchronous decomposition

NASA Technical Reports Server (NTRS)

Shankar, Jayashree; Ribbens, Calvin J.; Haftka, Raphael T.; Watson, Layne T.

1992-01-01

Large scale optimization problems are tractable only if they are somehow decomposed. Hierarchical decompositions are inappropriate for some types of problems and do not parallelize well. Sobieszczanski-Sobieski has proposed a nonhierarchical decomposition strategy for nonlinear constrained optimization that is naturally parallel. Despite some successes on engineering problems, the algorithm as originally proposed fails on simple two dimensional quadratic programs. The algorithm is carefully analyzed for quadratic programs, and a number of modifications are suggested to improve its robustness.

Problem Solving Variations in an Online Programming Course

ERIC Educational Resources Information Center

Ebrahimi, Alireza

2007-01-01

An observation on teaching introductory programming courses on SLN for a period of two terms led me to believe that online students try various ways to solve a problem. In the beginning, I got the impression that some of their approaches for a solution were wrong; but after a little investigation, I found that some of the problem-solving…

Quadratic electroabsorption studies of molecular motion in dye-doped polymers

NASA Astrophysics Data System (ADS)

Poga, Constantina; Kuzyk, Mark G.; Dirk, Carl W.

1993-02-01

This paper reports on quadratic electroabsorption studies of thin-film solid solutions of squarylium dye molecules in poly(methylmethacrylate) polymer with the aim of understanding the role of electronic and reorientational mechanisms in the third-order nonlinear-optical susceptibility. We present a generalized theory of the quadratic electrooptic response that includes both electronic mechanisms and molecular reorientation and show that the ratio of two independent third-order susceptibility tensor components, namely (chi) (3)3333/(chi) (3)1133, determines the relative contribution of each mechanism. Based on these theoretical results, we have designed and built an experiment that determines this ratio as a function of temperature and wavelength. Results show that at room temperature and near the first electronic transition wavelength, the response is dominated by the electronic mechanism, and that the reorientational contribution dominates when the sample is heated above its glass transition temperature. Furthermore, results show that, off-resonance, the sign of the imaginary part of the third-order susceptibility is positive. Quadratic electroabsorption is thus shown to be a versatile tool for measuring the imaginary part of the third-order nonlinear-optical susceptibility which yields information about the interaction of polymer and dopant molecule.

Adaptive bi-level programming for optimal gene knockouts for targeted overproduction under phenotypic constraints

PubMed Central

2013-01-01

Background Optimization procedures to identify gene knockouts for targeted biochemical overproduction have been widely in use in modern metabolic engineering. Flux balance analysis (FBA) framework has provided conceptual simplifications for genome-scale dynamic analysis at steady states. Based on FBA, many current optimization methods for targeted bio-productions have been developed under the maximum cell growth assumption. The optimization problem to derive gene knockout strategies recently has been formulated as a bi-level programming problem in OptKnock for maximum targeted bio-productions with maximum growth rates. However, it has been shown that knockout mutants in fact reach the steady states with the minimization of metabolic adjustment (MOMA) from the corresponding wild-type strains instead of having maximal growth rates after genetic or metabolic intervention. In this work, we propose a new bi-level computational framework--MOMAKnock--which can derive robust knockout strategies under the MOMA flux distribution approximation. Methods In this new bi-level optimization framework, we aim to maximize the production of targeted chemicals by identifying candidate knockout genes or reactions under phenotypic constraints approximated by the MOMA assumption. Hence, the targeted chemical production is the primary objective of MOMAKnock while the MOMA assumption is formulated as the inner problem of constraining the knockout metabolic flux to be as close as possible to the steady-state phenotypes of wide-type strains. As this new inner problem becomes a quadratic programming problem, a novel adaptive piecewise linearization algorithm is developed in this paper to obtain the exact optimal solution to this new bi-level integer quadratic programming problem for MOMAKnock. Results Our new MOMAKnock model and the adaptive piecewise linearization solution algorithm are tested with a small E. coli core metabolic network and a large-scale iAF1260 E. coli metabolic network

Adaptive bi-level programming for optimal gene knockouts for targeted overproduction under phenotypic constraints.

PubMed

Ren, Shaogang; Zeng, Bo; Qian, Xiaoning

2013-01-01

Optimization procedures to identify gene knockouts for targeted biochemical overproduction have been widely in use in modern metabolic engineering. Flux balance analysis (FBA) framework has provided conceptual simplifications for genome-scale dynamic analysis at steady states. Based on FBA, many current optimization methods for targeted bio-productions have been developed under the maximum cell growth assumption. The optimization problem to derive gene knockout strategies recently has been formulated as a bi-level programming problem in OptKnock for maximum targeted bio-productions with maximum growth rates. However, it has been shown that knockout mutants in fact reach the steady states with the minimization of metabolic adjustment (MOMA) from the corresponding wild-type strains instead of having maximal growth rates after genetic or metabolic intervention. In this work, we propose a new bi-level computational framework--MOMAKnock--which can derive robust knockout strategies under the MOMA flux distribution approximation. In this new bi-level optimization framework, we aim to maximize the production of targeted chemicals by identifying candidate knockout genes or reactions under phenotypic constraints approximated by the MOMA assumption. Hence, the targeted chemical production is the primary objective of MOMAKnock while the MOMA assumption is formulated as the inner problem of constraining the knockout metabolic flux to be as close as possible to the steady-state phenotypes of wide-type strains. As this new inner problem becomes a quadratic programming problem, a novel adaptive piecewise linearization algorithm is developed in this paper to obtain the exact optimal solution to this new bi-level integer quadratic programming problem for MOMAKnock. Our new MOMAKnock model and the adaptive piecewise linearization solution algorithm are tested with a small E. coli core metabolic network and a large-scale iAF1260 E. coli metabolic network. The derived knockout

Integration of the Quadratic Function and Generalization

ERIC Educational Resources Information Center

Mitsuma, Kunio

2011-01-01

We will first recall useful formulas in integration that simplify the calculation of certain definite integrals with the quadratic function. A main formula relies only on the coefficients of the function. We will then explore a geometric proof of one of these formulas. Finally, we will extend the formulas to more general cases. (Contains 3…

Performance Analysis and Design Synthesis (PADS) computer program. Volume 2: Program description, part 2

NASA Technical Reports Server (NTRS)

1972-01-01

The QL module of the Performance Analysis and Design Synthesis (PADS) computer program is described. Execution of this module is initiated when and if subroutine PADSI calls subroutine GROPE. Subroutine GROPE controls the high level logical flow of the QL module. The purpose of the module is to determine a trajectory that satisfies the necessary variational conditions for optimal performance. The module achieves this by solving a nonlinear multi-point boundary value problem. The numerical method employed is described. It is an iterative technique that converges quadratically when it does converge. The three basic steps of the module are: (1) initialization, (2) iteration, and (3) culmination. For Volume 1 see N73-13199.

Linear quadratic regulators with eigenvalue placement in a specified region

NASA Technical Reports Server (NTRS)

Shieh, Leang S.; Dib, Hani M.; Ganesan, Sekar

1988-01-01

A linear optimal quadratic regulator is developed for optimally placing the closed-loop poles of multivariable continuous-time systems within the common region of an open sector, bounded by lines inclined at + or - pi/2k (k = 2 or 3) from the negative real axis with a sector angle of pi/2 or less, and the left-hand side of a line parallel to the imaginary axis in the complex s-plane. The design method is mainly based on the solution of a linear matrix Liapunov equation, and the resultant closed-loop system with its eigenvalues in the desired region is optimal with respect to a quadratic performance index.

Finding Trustworthy Experts to Help Problem Solving on the Programming Learning Forum

ERIC Educational Resources Information Center

Tseng, Shian-Shyong; Weng, Jui-Feng

2010-01-01

The most important thing for learners in Programming Language subject is problem solving. During the practical programming project, various problems may occur and learners usually need consultation from the senior programmers (i.e. the experts) to assist them in solving the problems. Thus, the inquiry-based learning with learning forum is applied…

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.

Quantum superintegrable system with a novel chain structure of quadratic algebras

NASA Astrophysics Data System (ADS)

Liao, Yidong; Marquette, Ian; Zhang, Yao-Zhong

2018-06-01

We analyse the n-dimensional superintegrable Kepler–Coulomb system with non-central terms. We find a novel underlying chain structure of quadratic algebras formed by the integrals of motion. We identify the elements for each sub-structure and obtain the algebra relations satisfied by them and the corresponding Casimir operators. These quadratic sub-algebras are realized in terms of a chain of deformed oscillators with factorized structure functions. We construct the finite-dimensional unitary representations of the deformed oscillators, and give an algebraic derivation of the energy spectrum of the superintegrable system.

Closed-loop stability of linear quadratic optimal systems in the presence of modeling errors

NASA Technical Reports Server (NTRS)

Toda, M.; Patel, R.; Sridhar, B.

1976-01-01

The well-known stabilizing property of linear quadratic state feedback design is utilized to evaluate the robustness of a linear quadratic feedback design in the presence of modeling errors. Two general conditions are obtained for allowable modeling errors such that the resulting closed-loop system remains stable. One of these conditions is applied to obtain two more particular conditions which are readily applicable to practical situations where a designer has information on the bounds of modeling errors. Relations are established between the allowable parameter uncertainty and the weighting matrices of the quadratic performance index, thereby enabling the designer to select appropriate weighting matrices to attain a robust feedback design.

One-loop Parke-Taylor factors for quadratic propagators from massless scattering equations

NASA Astrophysics Data System (ADS)

Gomez, Humberto; Lopez-Arcos, Cristhiam; Talavera, Pedro

2017-10-01

In this paper we reconsider the Cachazo-He-Yuan construction (CHY) of the so called scattering amplitudes at one-loop, in order to obtain quadratic propagators. In theories with colour ordering the key ingredient is the redefinition of the Parke-Taylor factors. After classifying all the possible one-loop CHY-integrands we conjecture a new one-loop amplitude for the massless Bi-adjoint Φ3 theory. The prescription directly reproduces the quadratic propagators of the traditional Feynman approach.

A Computer Program for the Management of Prescription-Based Problems.

ERIC Educational Resources Information Center

Cotter, Patricia M.; Gumtow, Robert H.

1991-01-01

The Prescription Management Program, a software program using Apple's HyperCard on a MacIntosh, was developed to simplify the creation, storage, modification, and general management of prescription-based problems. Pharmacy instructors may customize the program to serve their individual teaching needs. (Author/DB)

Problem area descriptions : motor vehicle crashes - data analysis and IVI program analysis

DOT National Transportation Integrated Search

In general, the IVI program focuses on the more significant safety problem categories as : indicated by statistical analyses of crash data. However, other factors were considered in setting : program priorities and schedules. For some problem areas, ...

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.

Engineering quadratic nonlinear photonic crystals for frequency conversion of lasers

NASA Astrophysics Data System (ADS)

Chen, Baoqin; Hong, Lihong; Hu, Chenyang; Zhang, Chao; Liu, Rongjuan; Li, Zhiyuan

2018-03-01

Nonlinear frequency conversion offers an effective way to extend the laser wavelength range. Quadratic nonlinear photonic crystals (NPCs) are artificial materials composed of domain-inversion structures whose sign of nonlinear coefficients are modulated with desire to implement quasi-phase matching (QPM) required for nonlinear frequency conversion. These structures can offer various reciprocal lattice vectors (RLVs) to compensate the phase-mismatching during the quadratic nonlinear optical processes, including second-harmonic generation (SHG), sum-frequency generation and the cascaded third-harmonic generation (THG). The modulation pattern of the nonlinear coefficients is flexible, which can be one-dimensional or two-dimensional (2D), be periodic, quasi-periodic, aperiodic, chirped, or super-periodic. As a result, these NPCs offer very flexible QPM scheme to satisfy various nonlinear optics and laser frequency conversion problems via design of the modulation patterns and RLV spectra. In particular, we introduce the electric poling technique for fabricating QPM structures, a simple effective nonlinear coefficient model for efficiently and precisely evaluating the performance of QPM structures, the concept of super-QPM and super-periodically poled lithium niobate for finely tuning nonlinear optical interactions, the design of 2D ellipse QPM NPC structures enabling continuous tunability of SHG in a broad bandwidth by simply changing the transport direction of pump light, and chirped QPM structures that exhibit broadband RLVs and allow for simultaneous radiation of broadband SHG, THG, HHG and thus coherent white laser from a single crystal. All these technical, theoretical, and physical studies on QPM NPCs can help to gain a deeper insight on the mechanisms, approaches, and routes for flexibly controlling the interaction of lasers with various QPM NPCs for high-efficiency frequency conversion and creation of novel lasers.

Emotion suppression moderates the quadratic association between RSA and executive function.

PubMed

Spangler, Derek P; Bell, Martha Ann; Deater-Deckard, Kirby

2015-09-01

There is uncertainty about whether respiratory sinus arrhythmia (RSA), a cardiac marker of adaptive emotion regulation, is involved in relatively low or high executive function performance. In the present study, we investigated (a) whether RSA during rest and tasks predict both relatively low and high executive function within a larger quadratic association among the two variables, and (b) the extent to which this quadratic trend was moderated by individual differences in emotion regulation. To achieve these aims, a sample of ethnically and socioeconomically diverse women self-reported reappraisal and emotion suppression. They next experienced a 2-min resting period during which electrocardiogram (ECG) was continually assessed. In the next phase, the women completed an array of executive function and nonexecutive cognitive tasks while ECG was measured throughout. As anticipated, resting RSA showed a quadratic association with executive function that was strongest for high suppression. These results suggest that relatively high resting RSA may predict poor executive function ability when emotion regulation consumes executive control resources needed for ongoing cognitive performance. © 2015 Society for Psychophysiological Research.

Emotion suppression moderates the quadratic association between RSA and executive function

PubMed Central

Spangler, Derek P.; Bell, Martha Ann; Deater-Deckard, Kirby

2016-01-01

There is uncertainty about whether respiratory sinus arrhythmia (RSA), a cardiac marker of adaptive emotion regulation, is involved in relatively low or high executive function performance. In the present study, we investigated: (1) whether RSA during rest and tasks predict both relatively low and high executive function within a larger quadratic association among the two variables, and (2) the extent to which this quadratic trend was moderated by individual differences in emotion regulation. To achieve these aims, a sample of ethnically and socioeconomically diverse women self-reported reappraisal and emotion suppression. They next experienced a two-minute resting period during which ECG was continually assessed. In the next phase, the women completed an array of executive function and non-executive cognitive tasks while ECG was measured throughout. As anticipated, resting RSA showed a quadratic association with executive function that was strongest for high suppression. These results suggest that relatively high resting RSA may predict poor executive function ability when emotion regulation consumes executive control resources needed for ongoing cognitive performance. PMID:26018941

A Review of Youth Employment Problems, Programs & Policies: Volume 2. Special Needs and Concentrated Problems.

ERIC Educational Resources Information Center

Vice President's Task Force on Youth Employment, Washington, DC.

This series of nine reports reviews available information on the special needs and concentrated problems of youth employment. (It constitutes the second of a three-volume compendium; other volumes examine causes and dimensions of youth employment problems and analyze program experience--see note.) The effects of discrimination on minority youth…

Feasibility of Decentralized Linear-Quadratic-Gaussian Control of Autonomous Distributed Spacecraft

NASA Technical Reports Server (NTRS)

Carpenter, J. Russell

1999-01-01

A distributed satellite formation, modeled as an arbitrary number of fully connected nodes in a network, could be controlled using a decentralized controller framework that distributes operations in parallel over the network. For such problems, a solution that minimizes data transmission requirements, in the context of linear-quadratic-Gaussian (LQG) control theory, was given by Speyer. This approach is advantageous because it is non-hierarchical, detected failures gracefully degrade system performance, fewer local computations are required than for a centralized controller, and it is optimal with respect to the standard LQG cost function. Disadvantages of the approach are the need for a fully connected communications network, the total operations performed over all the nodes are greater than for a centralized controller, and the approach is formulated for linear time-invariant systems. To investigate the feasibility of the decentralized approach to satellite formation flying, a simple centralized LQG design for a spacecraft orbit control problem is adapted to the decentralized framework. The simple design uses a fixed reference trajectory (an equatorial, Keplerian, circular orbit), and by appropriate choice of coordinates and measurements is formulated as a linear time-invariant system.

Problems in Choosing Tools and Methods for Teaching Programming

ERIC Educational Resources Information Center

Vitkute-Adžgauskiene, Davia; Vidžiunas, Antanas

2012-01-01

The paper analyses the problems in selecting and integrating tools for delivering basic programming knowledge at the university level. Discussion and analysis of teaching the programming disciplines, the main principles of study programme design, requirements for teaching tools, methods and corresponding languages is presented, based on literature…

W-algebra for solving problems with fuzzy parameters

NASA Astrophysics Data System (ADS)

Shevlyakov, A. O.; Matveev, M. G.

2018-03-01

A method of solving the problems with fuzzy parameters by means of a special algebraic structure is proposed. The structure defines its operations through operations on real numbers, which simplifies its use. It avoids deficiencies limiting applicability of the other known structures. Examples for solution of a quadratic equation, a system of linear equations and a network planning problem are given.

Problem Space Matters: Evaluation of a German Enrichment Program for Gifted Children.

PubMed

Welter, Marisete M; Jaarsveld, Saskia; Lachmann, Thomas

2018-01-01

We studied the development of cognitive abilities related to intelligence and creativity ( N = 48, 6-10 years old), using a longitudinal design (over one school year), in order to evaluate an Enrichment Program for gifted primary school children initiated by the government of the German federal state of Rhineland-Palatinate ( Entdeckertag Rheinland Pfalz , Germany; ET; Day of Discoverers). A group of German primary school children ( N = 24), identified earlier as intellectually gifted and selected to join the ET program was compared to a gender-, class- and IQ- matched group of control children that did not participate in this program. All participants performed the Standard Progressive Matrices (SPM) test, which measures intelligence in well-defined problem space; the Creative Reasoning Task (CRT), which measures intelligence in ill-defined problem space; and the test of creative thinking-drawing production (TCT-DP), which measures creativity, also in ill-defined problem space. Results revealed that problem space matters: the ET program is effective only for the improvement of intelligence operating in well-defined problem space. An effect was found for intelligence as measured by SPM only, but neither for intelligence operating in ill-defined problem space (CRT) nor for creativity (TCT-DP). This suggests that, depending on the type of problem spaces presented, different cognitive abilities are elicited in the same child. Therefore, enrichment programs for gifted, but also for children attending traditional schools, should provide opportunities to develop cognitive abilities related to intelligence, operating in both well- and ill-defined problem spaces, and to creativity in a parallel, using an interactive approach.

Problem Space Matters: Evaluation of a German Enrichment Program for Gifted Children

PubMed Central

Welter, Marisete M.; Jaarsveld, Saskia; Lachmann, Thomas

2018-01-01

We studied the development of cognitive abilities related to intelligence and creativity (N = 48, 6–10 years old), using a longitudinal design (over one school year), in order to evaluate an Enrichment Program for gifted primary school children initiated by the government of the German federal state of Rhineland-Palatinate (Entdeckertag Rheinland Pfalz, Germany; ET; Day of Discoverers). A group of German primary school children (N = 24), identified earlier as intellectually gifted and selected to join the ET program was compared to a gender-, class- and IQ- matched group of control children that did not participate in this program. All participants performed the Standard Progressive Matrices (SPM) test, which measures intelligence in well-defined problem space; the Creative Reasoning Task (CRT), which measures intelligence in ill-defined problem space; and the test of creative thinking-drawing production (TCT-DP), which measures creativity, also in ill-defined problem space. Results revealed that problem space matters: the ET program is effective only for the improvement of intelligence operating in well-defined problem space. An effect was found for intelligence as measured by SPM only, but neither for intelligence operating in ill-defined problem space (CRT) nor for creativity (TCT-DP). This suggests that, depending on the type of problem spaces presented, different cognitive abilities are elicited in the same child. Therefore, enrichment programs for gifted, but also for children attending traditional schools, should provide opportunities to develop cognitive abilities related to intelligence, operating in both well- and ill-defined problem spaces, and to creativity in a parallel, using an interactive approach. PMID:29740367

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…

Robustness of linear quadratic state feedback designs in the presence of system uncertainty. [applied to STOL autopilot design

NASA Technical Reports Server (NTRS)

Patel, R. V.; Toda, M.; Sridhar, B.

1977-01-01

In connection with difficulties concerning an accurate mathematical representation of a linear quadratic state feedback (LQSF) system, it is often necessary to investigate the robustness (stability) of an LQSF design in the presence of system uncertainty and obtain some quantitative measure of the perturbations which such a design can tolerate. A study is conducted concerning the problem of expressing the robustness property of an LQSF design quantitatively in terms of bounds on the perturbations (modeling errors or parameter variations) in the system matrices. Bounds are obtained for the general case of nonlinear, time-varying perturbations. It is pointed out that most of the presented results are readily applicable to practical situations for which a designer has estimates of the bounds on the system parameter perturbations. Relations are provided which help the designer to select appropriate weighting matrices in the quadratic performance index to attain a robust design. The developed results are employed in the design of an autopilot logic for the flare maneuver of the Augmentor Wing Jet STOL Research Aircraft.

Global stability and quadratic Hamiltonian structure in Lotka-Volterra and quasi-polynomial systems

NASA Astrophysics Data System (ADS)

Szederkényi, Gábor; Hangos, Katalin M.

2004-04-01

We show that the global stability of quasi-polynomial (QP) and Lotka-Volterra (LV) systems with the well-known logarithmic Lyapunov function is equivalent to the existence of a local generalized dissipative Hamiltonian description of the LV system with a diagonal quadratic form as a Hamiltonian function. The Hamiltonian function can be calculated and the quadratic dissipativity neighborhood of the origin can be estimated by solving linear matrix inequalities.

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.

Using Predictive Analytics to Detect Major Problems in Department of Defense Acquisition Programs

DTIC Science & Technology

2012-03-01

research is focused on three questions. First, can we predict the contractor provided estimate at complete (EAC)? Second, can we use those predictions to...develop an algorithm to determine if a problem will occur in an acquisition program or sub-program? Lastly, can we provide the probability of a problem...more than doubling the probability of a problem occurrence compared to current tools in the cost community. Though program managers can use this

A new neural network model for solving random interval linear programming problems.

PubMed

Arjmandzadeh, Ziba; Safi, Mohammadreza; Nazemi, Alireza

2017-05-01

This paper presents a neural network model for solving random interval linear programming problems. The original problem involving random interval variable coefficients is first transformed into an equivalent convex second order cone programming problem. A neural network model is then constructed for solving the obtained convex second order cone problem. Employing Lyapunov function approach, it is also shown that the proposed neural network model is stable in the sense of Lyapunov and it is globally convergent to an exact satisfactory solution of the original problem. Several illustrative examples are solved in support of this technique. Copyright © 2017 Elsevier Ltd. All rights reserved.

A Unified Approach to Teaching Quadratic and Cubic Equations.

ERIC Educational Resources Information Center

Ward, A. J. B.

2003-01-01

Presents a simple method for teaching the algebraic solution of cubic equations via completion of the cube. Shows that this method is readily accepted by students already familiar with completion of the square as a method for quadratic equations. (Author/KHR)

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…

Dark-bright quadratic solitons with a focusing effective Kerr nonlinearity

NASA Astrophysics Data System (ADS)

Chen, Manna; Ping, Xiaorou; Liang, Guo; Guo, Qi; Lu, Daquan; Hu, Wei

2018-01-01

Dark solitons are traditionally considered to exist in defocusing Kerr nonlinearity media. We investigate dark quadratic solitons with a focusing effective Kerr nonlinearity and a sine-oscillatory nonlocal response. A nonlinear refractive index with a focusing sine-oscillatory response leads to a defocusing effect with a strong degree of nonlocality, which causes the formation of dark solitons. By analyzing the modulational instability, we determine the parameter domain for dark quadratic solitons with a stable background and numerically obtain dark-bright soliton solutions in the form of pairs, which avoid radiative phenomena. Based on a numerical simulation, we find that all dark-bright soliton pairs are unstable after a relatively long propagation distance, and their stabilities are affected by the soliton interval and the degree of nonlocality.

IESIP - AN IMPROVED EXPLORATORY SEARCH TECHNIQUE FOR PURE INTEGER LINEAR PROGRAMMING PROBLEMS

NASA Technical Reports Server (NTRS)

Fogle, F. R.

1994-01-01

IESIP, an Improved Exploratory Search Technique for Pure Integer Linear Programming Problems, addresses the problem of optimizing an objective function of one or more variables subject to a set of confining functions or constraints by a method called discrete optimization or integer programming. Integer programming is based on a specific form of the general linear programming problem in which all variables in the objective function and all variables in the constraints are integers. While more difficult, integer programming is required for accuracy when modeling systems with small numbers of components such as the distribution of goods, machine scheduling, and production scheduling. IESIP establishes a new methodology for solving pure integer programming problems by utilizing a modified version of the univariate exploratory move developed by Robert Hooke and T.A. Jeeves. IESIP also takes some of its technique from the greedy procedure and the idea of unit neighborhoods. A rounding scheme uses the continuous solution found by traditional methods (simplex or other suitable technique) and creates a feasible integer starting point. The Hook and Jeeves exploratory search is modified to accommodate integers and constraints and is then employed to determine an optimal integer solution from the feasible starting solution. The user-friendly IESIP allows for rapid solution of problems up to 10 variables in size (limited by DOS allocation). Sample problems compare IESIP solutions with the traditional branch-and-bound approach. IESIP is written in Borland's TURBO Pascal for IBM PC series computers and compatibles running DOS. Source code and an executable are provided. The main memory requirement for execution is 25K. This program is available on a 5.25 inch 360K MS DOS format diskette. IESIP was developed in 1990. IBM is a trademark of International Business Machines. TURBO Pascal is registered by Borland International.

Application of program generation technology in solving heat and flow problems

NASA Astrophysics Data System (ADS)

Wan, Shui; Wu, Bangxian; Chen, Ningning

2007-05-01

Based on a new DIY concept for software development, an automatic program-generating technology attached on a software system called as Finite Element Program Generator (FEPG) provides a platform of developing programs, through which a scientific researcher can submit his special physico-mathematical problem to the system in a more direct and convenient way for solution. For solving flow and heat problems by using finite element method, the stabilization technologies and fraction-step methods are adopted to overcome the numerical difficulties caused mainly due to the dominated convection. A couple of benchmark problems are given in this paper as examples to illustrate the usage and the superiority of the automatic program generation technique, including the flow in a lid-driven cavity, the starting flow in a circular pipe, the natural convection in a square cavity, and the flow past a circular cylinder, etc. They are also shown as the verification of the algorithms.

Nonadiabatic effects in ultracold molecules via anomalous linear and quadratic Zeeman shifts.

PubMed

McGuyer, B H; Osborn, C B; McDonald, M; Reinaudi, G; Skomorowski, W; Moszynski, R; Zelevinsky, T

2013-12-13

Anomalously large linear and quadratic Zeeman shifts are measured for weakly bound ultracold 88Sr2 molecules near the intercombination-line asymptote. Nonadiabatic Coriolis coupling and the nature of long-range molecular potentials explain how this effect arises and scales roughly cubically with the size of the molecule. The linear shifts yield nonadiabatic mixing angles of the molecular states. The quadratic shifts are sensitive to nearby opposite f-parity states and exhibit fourth-order corrections, providing a stringent test of a state-of-the-art ab initio model.

Robust Weak Chimeras in Oscillator Networks with Delayed Linear and Quadratic Interactions

NASA Astrophysics Data System (ADS)

Bick, Christian; Sebek, Michael; Kiss, István Z.

2017-10-01

We present an approach to generate chimera dynamics (localized frequency synchrony) in oscillator networks with two populations of (at least) two elements using a general method based on a delayed interaction with linear and quadratic terms. The coupling design yields robust chimeras through a phase-model-based design of the delay and the ratio of linear and quadratic components of the interactions. We demonstrate the method in the Brusselator model and experiments with electrochemical oscillators. The technique opens the way to directly bridge chimera dynamics in phase models and real-world oscillator networks.

Linear quadratic stochastic control of atomic hydrogen masers.

PubMed

Koppang, P; Leland, R

1999-01-01

Data are given showing the results of using the linear quadratic Gaussian (LQG) technique to steer remote hydrogen masers to Coordinated Universal Time (UTC) as given by the United States Naval Observatory (USNO) via two-way satellite time transfer and the Global Positioning System (GPS). Data also are shown from the results of steering a hydrogen maser to the real-time USNO mean. A general overview of the theory behind the LQG technique also is given. The LQG control is a technique that uses Kalman filtering to estimate time and frequency errors used as input into a control calculation. A discrete frequency steer is calculated by minimizing a quadratic cost function that is dependent on both the time and frequency errors and the control effort. Different penalties, chosen by the designer, are assessed by the controller as the time and frequency errors and control effort vary from zero. With this feature, controllers can be designed to force the time and frequency differences between two standards to zero, either more or less aggressively depending on the application.

Overcoming design problems in evaluating health behavior programs.

PubMed

Flay, B R; Best, J A

1982-03-01

The increasing importance of high-quality evaluative research on health lifestyle change programs is established. Failure to ask the right evaluative research questions and problems of research design are identified as two major reasons for the dearth of well-controlled, interpretable evaluations in this area. Thirteen issues of research design that need to be considered if interpretable answers to evaluative research questions are to be obtained are identified and discussed. Solutions to these problems and design recommendations are offered.

On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem

NASA Astrophysics Data System (ADS)

Bai, Danyu; Zhang, Zhihai

2014-08-01

This article investigates the open-shop scheduling problem with the optimal criterion of minimising the sum of quadratic completion times. For this NP-hard problem, the asymptotic optimality of the shortest processing time block (SPTB) heuristic is proven in the sense of limit. Moreover, three different improvements, namely, the job-insert scheme, tabu search and genetic algorithm, are introduced to enhance the quality of the original solution generated by the SPTB heuristic. At the end of the article, a series of numerical experiments demonstrate the convergence of the heuristic, the performance of the improvements and the effectiveness of the quadratic objective.

Parallel solution of sparse one-dimensional dynamic programming problems

NASA Technical Reports Server (NTRS)

Nicol, David M.

1989-01-01

Parallel computation offers the potential for quickly solving large computational problems. However, it is often a non-trivial task to effectively use parallel computers. Solution methods must sometimes be reformulated to exploit parallelism; the reformulations are often more complex than their slower serial counterparts. We illustrate these points by studying the parallelization of sparse one-dimensional dynamic programming problems, those which do not obviously admit substantial parallelization. We propose a new method for parallelizing such problems, develop analytic models which help us to identify problems which parallelize well, and compare the performance of our algorithm with existing algorithms on a multiprocessor.

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…

Plate/shell structure topology optimization of orthotropic material for buckling problem based on independent continuous topological variables

NASA Astrophysics Data System (ADS)

Ye, Hong-Ling; Wang, Wei-Wei; Chen, Ning; Sui, Yun-Kang

2017-10-01

The purpose of the present work is to study the buckling problem with plate/shell topology optimization of orthotropic material. A model of buckling topology optimization is established based on the independent, continuous, and mapping method, which considers structural mass as objective and buckling critical loads as constraints. Firstly, composite exponential function (CEF) and power function (PF) as filter functions are introduced to recognize the element mass, the element stiffness matrix, and the element geometric stiffness matrix. The filter functions of the orthotropic material stiffness are deduced. Then these filter functions are put into buckling topology optimization of a differential equation to analyze the design sensitivity. Furthermore, the buckling constraints are approximately expressed as explicit functions with respect to the design variables based on the first-order Taylor expansion. The objective function is standardized based on the second-order Taylor expansion. Therefore, the optimization model is translated into a quadratic program. Finally, the dual sequence quadratic programming (DSQP) algorithm and the global convergence method of moving asymptotes algorithm with two different filter functions (CEF and PF) are applied to solve the optimal model. Three numerical results show that DSQP&CEF has the best performance in the view of structural mass and discretion.

The Impact of Teacher Training on Creative Writing and Problem-Solving Using Futuristic Scenarios for Creative Problem Solving and Creative Problem Solving Programs

ERIC Educational Resources Information Center

Hayel Al-Srour, Nadia; Al-Ali, Safa M.; Al-Oweidi, Alia

2016-01-01

The present study aims to detect the impact of teacher training on creative writing and problem-solving using both Futuristic scenarios program to solve problems creatively, and creative problem solving. To achieve the objectives of the study, the sample was divided into two groups, the first consist of 20 teachers, and 23 teachers to second…

Solving deterministic non-linear programming problem using Hopfield artificial neural network and genetic programming techniques

NASA Astrophysics Data System (ADS)

Vasant, P.; Ganesan, T.; Elamvazuthi, I.

2012-11-01

A fairly reasonable result was obtained for non-linear engineering problems using the optimization techniques such as neural network, genetic algorithms, and fuzzy logic independently in the past. Increasingly, hybrid techniques are being used to solve the non-linear problems to obtain better output. This paper discusses the use of neuro-genetic hybrid technique to optimize the geological structure mapping which is known as seismic survey. It involves the minimization of objective function subject to the requirement of geophysical and operational constraints. In this work, the optimization was initially performed using genetic programming, and followed by hybrid neuro-genetic programming approaches. Comparative studies and analysis were then carried out on the optimized results. The results indicate that the hybrid neuro-genetic hybrid technique produced better results compared to the stand-alone genetic programming method.

Using a Model to Describe Students' Inductive Reasoning in Problem Solving

ERIC Educational Resources Information Center

Canadas, Maria C.; Castro, Encarnacion; Castro, Enrique

2009-01-01

Introduction: We present some aspects of a wider investigation (Canadas, 2007), whose main objective is to describe and characterize inductive reasoning used by Spanish students in years 9 and 10 when they work on problems that involved linear and quadratic sequences. Method: We produced a test composed of six problems with different…

Managing problem employees: a model program and practical guide.

PubMed

Miller, Laurence

2010-01-01

This article presents a model program for managing problem employees that includes a description ofthe basic types of problem employees and employee problems, as well as practical recommendations for. (1) selection and screening, (2) education and training, (3) coaching and counseling, (4) discipline, (5) psychological fitness-for-duty evaluations, (6) mental health services, (7) termination, and (8) leadership and administrative strategies. Throughout, the emphasis on balancing the need for order and productivity in the workplace with fairness and concern for employee health and well-being.

Reduced-Size Integer Linear Programming Models for String Selection Problems: Application to the Farthest String Problem.

PubMed

Zörnig, Peter

2015-08-01

We present integer programming models for some variants of the farthest string problem. The number of variables and constraints is substantially less than that of the integer linear programming models known in the literature. Moreover, the solution of the linear programming-relaxation contains only a small proportion of noninteger values, which considerably simplifies the rounding process. Numerical tests have shown excellent results, especially when a small set of long sequences is given.

Mixing of ultrasonic Lamb waves in thin plates with quadratic nonlinearity.

PubMed

Li, Feilong; Zhao, Youxuan; Cao, Peng; Hu, Ning

2018-07-01

This paper investigates the propagation of Lamb waves in thin plates with quadratic nonlinearity by one-way mixing method using numerical simulations. It is shown that an A 0 -mode wave can be generated by a pair of S 0 and A 0 mode waves only when mixing condition is satisfied, and mixing wave signals are capable of locating the damage zone. Additionally, it is manifested that the acoustic nonlinear parameter increases linearly with quadratic nonlinearity but monotonously with the size of mixing zone. Furthermore, because of frequency deviation, the waveform of the mixing wave changes significantly from a regular diamond shape to toneburst trains. Copyright © 2018 Elsevier B.V. All rights reserved.

Fundamental solution of the problem of linear programming and method of its determination

NASA Technical Reports Server (NTRS)

Petrunin, S. V.

1978-01-01

The idea of a fundamental solution to a problem in linear programming is introduced. A method of determining the fundamental solution and of applying this method to the solution of a problem in linear programming is proposed. Numerical examples are cited.

Design of linear quadratic regulators with eigenvalue placement in a specified region

NASA Technical Reports Server (NTRS)

Shieh, Leang-San; Zhen, Liu; Coleman, Norman P.

1990-01-01

Two linear quadratic regulators are developed for placing the closed-loop poles of linear multivariable continuous-time systems within the common region of an open sector, bounded by lines inclined at +/- pi/2k (for a specified integer k not less than 1) from the negative real axis, and the left-hand side of a line parallel to the imaginary axis in the complex s-plane, and simultaneously minimizing a quadratic performance index. The design procedure mainly involves the solution of either Liapunov equations or Riccati equations. The general expression for finding the lower bound of a constant gain gamma is also developed.

Estimation of regions of attraction and ultimate boundedness for multiloop LQ regulators. [Linear Quadratic

NASA Technical Reports Server (NTRS)

Joshi, S. M.

1984-01-01

Closed-loop stability is investigated for multivariable linear time-invariant systems controlled by optimal full state feedback linear quadratic (LQ) regulators, with nonlinear gains present in the feedback channels. Estimates are obtained for the region of attraction when the nonlinearities escape the (0.5, infinity) sector in regions away from the origin and for the region of ultimate boundedness when the nonlinearities escape the sector near the origin. The expressions for these regions also provide methods for selecting the performance function parameters in order to obtain LQ designs with better tolerance for nonlinearities. The analytical results are illustrated by applying them to the problem of controlling the rigid-body pitch angle and elastic motion of a large, flexible space antenna.

Needs and Problems of Posbindu Program: Community Health Volunteers Perspective

NASA Astrophysics Data System (ADS)

Putri, S. T.; Andriyani, S.

2018-01-01

Posbindu is a form of public participation to conduct early detection and monitoring of risk factors for non-communicable diseases(NCD), and where it was carried out in as an integrated manner, routine and periodic event. This paper aims to investigates the needs and problems on Posbindu Program based on community health volunteers(CHVs) perspective. This study used descriptive qualitative method by open ended questions. Content analysis using to explicating the result. There are 3 theme finding about elderly needs in Posbindu; medical care, support group community, and health education. We found four theme problems which in Posbindu program: low motivation from elderly, Inadequate of facilities, physical disability, failed communication. To be effective in Posbindu program, all the stakeholders have reached consensus on the Posbindu program as elderly need. CHVs need given wide knowledge about early detection, daily care, control disease continuously so that the elderly keep feeling the advantages of coming to the Posbindu.

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.

A game theoretic approach to a finite-time disturbance attenuation problem

NASA Technical Reports Server (NTRS)

Rhee, Ihnseok; Speyer, Jason L.

1991-01-01

A disturbance attenuation problem over a finite-time interval is considered by a game theoretic approach where the control, restricted to a function of the measurement history, plays against adversaries composed of the process and measurement disturbances, and the initial state. A zero-sum game, formulated as a quadratic cost criterion subject to linear time-varying dynamics and measurements, is solved by a calculus of variation technique. By first maximizing the quadratic cost criterion with respect to the process disturbance and initial state, a full information game between the control and the measurement residual subject to the estimator dynamics results. The resulting solution produces an n-dimensional compensator which expresses the controller as a linear combination of the measurement history. A disturbance attenuation problem is solved based on the results of the game problem. For time-invariant systems it is shown that under certain conditions the time-varying controller becomes time-invariant on the infinite-time interval. The resulting controller satisfies an H(infinity) norm bound.

METLIN-PC: An applications-program package for problems of mathematical programming

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

Pshenichnyi, B.N.; Sobolenko, L.A.; Sosnovskii, A.A.

1994-05-01

The METLIN-PC applications-program package (APP) was developed at the V.M. Glushkov Institute of Cybernetics of the Academy of Sciences of Ukraine on IBM PC XT and AT computers. The present version of the package was written in Turbo Pascal and Fortran-77. The METLIN-PC is chiefly designed for the solution of smooth problems of mathematical programming and is a further development of the METLIN prototype, which was created earlier on a BESM-6 computer. The principal property of the previous package is retained - the applications modules employ a single approach based on the linearization method of B.N. Pschenichnyi. Hence the namemore » {open_quotes}METLIN.{close_quotes}« less

Hyers-Ulam stability of a generalized Apollonius type quadratic mapping

NASA Astrophysics Data System (ADS)

Park, Chun-Gil; Rassias, Themistocles M.

2006-10-01

Let X,Y be linear spaces. It is shown that if a mapping satisfies the following functional equation: then the mapping is quadratic. We moreover prove the Hyers-Ulam stability of the functional equation (0.1) in Banach spaces.

FASTER 3: A generalized-geometry Monte Carlo computer program for the transport of neutrons and gamma rays. Volume 1: Summary report

NASA Technical Reports Server (NTRS)

Jordan, T. M.

1970-01-01

The theory used in FASTER-III, a Monte Carlo computer program for the transport of neutrons and gamma rays in complex geometries, is outlined. The program includes the treatment of geometric regions bounded by quadratic and quadric surfaces with multiple radiation sources which have specified space, angle, and energy dependence. The program calculates, using importance sampling, the resulting number and energy fluxes at specified point, surface, and volume detectors. It can also calculate minimum weight shield configuration meeting a specified dose rate constraint. Results are presented for sample problems involving primary neutron, and primary and secondary photon, transport in a spherical reactor shield configuration.

Regions of attraction and ultimate boundedness for linear quadratic regulators with nonlinearities

NASA Technical Reports Server (NTRS)

Joshi, S. M.

1984-01-01

The closed-loop stability of multivariable linear time-invariant systems controlled by optimal linear quadratic (LQ) regulators is investigated for the case when the feedback loops have nonlinearities N(sigma) that violate the standard stability condition, sigma N(sigma) or = 0.5 sigma(2). The violations of the condition are assumed to occur either (1) for values of sigma away from the origin (sigma = 0) or (2) for values of sigma in a neighborhood of the origin. It is proved that there exists a region of attraction for case (1) and a region of ultimate boundedness for case (2), and estimates are obtained for these regions. The results provide methods for selecting the performance function parameters to design LQ regulators with better tolerance to nonlinearities. The results are demonstrated by application to the problem of attitude and vibration control of a large, flexible space antenna in the presence of actuator nonlinearities.

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.

Experiences in Rural Mental Health. VIII: Programming and Administrative Problems.

ERIC Educational Resources Information Center

Hollister, William G.; And Others

Based on a North Carolina Feasibility study (1967-73) which focused on development of a pattern for providing comprehensive mental health services to rural people, this guide deals with programming and administrative problems in Vance and Franklin counties. Describing those problems believed to be most likely to occur in rural areas, this booklet…

The Environmental Justice Collaborative Problem-Solving Cooperative Agreement Program

EPA Pesticide Factsheets

The Environmental Justice Collaborative Problem-Solving (CPS) Cooperative Agreement Program provides financial assistance to eligible organizations working on or planning to work on projects to address local environmental and/or public health issues

Hyperspectral and multispectral data fusion based on linear-quadratic nonnegative matrix factorization

NASA Astrophysics Data System (ADS)

Benhalouche, Fatima Zohra; Karoui, Moussa Sofiane; Deville, Yannick; Ouamri, Abdelaziz

2017-04-01

This paper proposes three multisharpening approaches to enhance the spatial resolution of urban hyperspectral remote sensing images. These approaches, related to linear-quadratic spectral unmixing techniques, use a linear-quadratic nonnegative matrix factorization (NMF) multiplicative algorithm. These methods begin by unmixing the observable high-spectral/low-spatial resolution hyperspectral and high-spatial/low-spectral resolution multispectral images. The obtained high-spectral/high-spatial resolution features are then recombined, according to the linear-quadratic mixing model, to obtain an unobservable multisharpened high-spectral/high-spatial resolution hyperspectral image. In the first designed approach, hyperspectral and multispectral variables are independently optimized, once they have been coherently initialized. These variables are alternately updated in the second designed approach. In the third approach, the considered hyperspectral and multispectral variables are jointly updated. Experiments, using synthetic and real data, are conducted to assess the efficiency, in spatial and spectral domains, of the designed approaches and of linear NMF-based approaches from the literature. Experimental results show that the designed methods globally yield very satisfactory spectral and spatial fidelities for the multisharpened hyperspectral data. They also prove that these methods significantly outperform the used literature approaches.

The algebraic decoding of the (41, 21, 9) quadratic residue code

NASA Technical Reports Server (NTRS)

Reed, Irving S.; Truong, T. K.; Chen, Xuemin; Yin, Xiaowei

1992-01-01

A new algebraic approach for decoding the quadratic residue (QR) codes, in particular the (41, 21, 9) QR code is presented. The key ideas behind this decoding technique are a systematic application of the Sylvester resultant method to the Newton identities associated with the code syndromes to find the error-locator polynomial, and next a method for determining error locations by solving certain quadratic, cubic and quartic equations over GF(2 exp m) in a new way which uses Zech's logarithms for the arithmetic. The algorithms developed here are suitable for implementation in a programmable microprocessor or special-purpose VLSI chip. It is expected that the algebraic methods developed here can apply generally to other codes such as the BCH and Reed-Solomon codes.

Optomechanically induced opacity and amplification in a quadratically coupled optomechanical system

NASA Astrophysics Data System (ADS)

Si, Liu-Gang; Xiong, Hao; Zubairy, M. Suhail; Wu, Ying

2017-03-01

We analyze theoretically the features of the output field of a quadratically coupled optomechanical system, which is driven by a strong coupling field and a weak signal field, and in which the membrane (treated as a mechanical resonator) is excited by a weak coherent driving field with two-phonon resonance. We show that the system exhibits complex quantum coherent and interference effects resulting in transmission of the signal field from opacity to remarkable amplification. We also find that the total phase of the applied fields can significantly adjust the signal field's transmission spectrum. The study of the propagation of the signal field in such a quadratically coupled optomechanical system proves that the proposed device can operate as an optical transistor.

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…

Generalization of Social Skills: Strategies and Results of a Training Program in Problem Solving Skills.

ERIC Educational Resources Information Center

Paraschiv, Irina; Olley, J. Gregory

This paper describes the "Problem Solving for Life" training program which trains adolescents and adults with mental retardation in skills for solving social problems. The program requires group participants to solve social problems by practicing two prerequisite skills (relaxation and positive self-statements) and four problem solving steps: (1)…

Constraint Optimization Problem For The Cutting Of A Cobalt Chrome Refractory Material

NASA Astrophysics Data System (ADS)

Lebaal, Nadhir; Schlegel, Daniel; Folea, Milena

2011-05-01

This paper shows a complete approach to solve a given problem, from the experimentation to the optimization of different cutting parameters. In response to an industrial problem of slotting FSX 414, a Cobalt-based refractory material, we have implemented a design of experiment to determine the most influent parameters on the tool life, the surface roughness and the cutting forces. After theses trials, an optimization approach has been implemented to find the lowest manufacturing cost while respecting the roughness constraints and cutting force limitation constraints. The optimization approach is based on the Response Surface Method (RSM) using the Sequential Quadratic programming algorithm (SQP) for a constrained problem. To avoid a local optimum and to obtain an accurate solution at low cost, an efficient strategy, which allows improving the RSM accuracy in the vicinity of the global optimum, is presented. With these models and these trials, we could apply and compare our optimization methods in order to get the lowest cost for the best quality, i.e. a satisfying surface roughness and limited cutting forces.

Piece-wise quadratic approximations of arbitrary error functions for fast and robust machine learning.

PubMed

Gorban, A N; Mirkes, E M; Zinovyev, A

2016-12-01

Most of machine learning approaches have stemmed from the application of minimizing the mean squared distance principle, based on the computationally efficient quadratic optimization methods. However, when faced with high-dimensional and noisy data, the quadratic error functionals demonstrated many weaknesses including high sensitivity to contaminating factors and dimensionality curse. Therefore, a lot of recent applications in machine learning exploited properties of non-quadratic error functionals based on L 1 norm or even sub-linear potentials corresponding to quasinorms L p (0quadratic error potentials of subquadratic growth (PQSQ potentials). We develop a new and universal framework to minimize arbitrary sub-quadratic error potentials using an algorithm with guaranteed fast convergence to the local or global error minimum. The theory of PQSQ potentials is based on the notion of the cone of minorant functions, and represents a natural approximation formalism based on the application of min-plus algebra. The approach can be applied in most of existing machine learning methods, including methods of data approximation and regularized and sparse regression, leading to the improvement in the computational cost/accuracy trade-off. We demonstrate that on synthetic and real-life datasets PQSQ-based machine learning methods achieve orders of magnitude faster computational performance than the corresponding state-of-the-art methods, having similar or better approximation accuracy. Copyright © 2016 Elsevier Ltd. All rights reserved.

Alcohol-related problems and life satisfaction predict motivation to change among mandated college students.

PubMed

Diulio, Andrea R; Cero, Ian; Witte, Tracy K; Correia, Christopher J

2014-04-01

The present study investigated the role specific types of alcohol-related problems and life satisfaction play in predicting motivation to change alcohol use. Participants were 548 college students mandated to complete a brief intervention following an alcohol-related policy violation. Using hierarchical multiple regression, we tested for the presence of interaction and quadratic effects on baseline data collected prior to the intervention. A significant interaction indicated that the relationship between a respondent's personal consequences and his/her motivation to change differs depending upon the level of concurrent social consequences. Additionally quadratic effects for abuse/dependence symptoms and life satisfaction were found. The quadratic probes suggest that abuse/dependence symptoms and poor life satisfaction are both positively associated with motivation to change for a majority of the sample; however, the nature of these relationships changes for participants with more extreme scores. Results support the utility of using a multidimensional measure of alcohol related problems and assessing non-linear relationships when assessing predictors of motivation to change. The results also suggest that the best strategies for increasing motivation may vary depending on the types of alcohol-related problems and level of life satisfaction the student is experiencing and highlight potential directions for future research. Copyright © 2014. Published by Elsevier Ltd.

Tip-tilt disturbance model identification based on non-linear least squares fitting for Linear Quadratic Gaussian control

NASA Astrophysics Data System (ADS)

Yang, Kangjian; Yang, Ping; Wang, Shuai; Dong, Lizhi; Xu, Bing

2018-05-01

We propose a method to identify tip-tilt disturbance model for Linear Quadratic Gaussian control. This identification method based on Levenberg-Marquardt method conducts with a little prior information and no auxiliary system and it is convenient to identify the tip-tilt disturbance model on-line for real-time control. This identification method makes it easy that Linear Quadratic Gaussian control runs efficiently in different adaptive optics systems for vibration mitigation. The validity of the Linear Quadratic Gaussian control associated with this tip-tilt disturbance model identification method is verified by experimental data, which is conducted in replay mode by simulation.

Optimal Water-Power Flow Problem: Formulation and Distributed Optimal Solution

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

Dall-Anese, Emiliano; Zhao, Changhong; Zamzam, Admed S.

This paper formalizes an optimal water-power flow (OWPF) problem to optimize the use of controllable assets across power and water systems while accounting for the couplings between the two infrastructures. Tanks and pumps are optimally managed to satisfy water demand while improving power grid operations; {for the power network, an AC optimal power flow formulation is augmented to accommodate the controllability of water pumps.} Unfortunately, the physics governing the operation of the two infrastructures and coupling constraints lead to a nonconvex (and, in fact, NP-hard) problem; however, after reformulating OWPF as a nonconvex, quadratically-constrained quadratic problem, a feasible point pursuit-successivemore » convex approximation approach is used to identify feasible and optimal solutions. In addition, a distributed solver based on the alternating direction method of multipliers enables water and power operators to pursue individual objectives while respecting the couplings between the two networks. The merits of the proposed approach are demonstrated for the case of a distribution feeder coupled with a municipal water distribution network.« less

Convexity Conditions and the Legendre-Fenchel Transform for the Product of Finitely Many Positive Definite Quadratic Forms

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

Zhao Yunbin, E-mail: zhaoyy@maths.bham.ac.u

2010-12-15

While the product of finitely many convex functions has been investigated in the field of global optimization, some fundamental issues such as the convexity condition and the Legendre-Fenchel transform for the product function remain unresolved. Focusing on quadratic forms, this paper is aimed at addressing the question: When is the product of finitely many positive definite quadratic forms convex, and what is the Legendre-Fenchel transform for it? First, we show that the convexity of the product is determined intrinsically by the condition number of so-called 'scaled matrices' associated with quadratic forms involved. The main result claims that if the conditionmore » number of these scaled matrices are bounded above by an explicit constant (which depends only on the number of quadratic forms involved), then the product function is convex. Second, we prove that the Legendre-Fenchel transform for the product of positive definite quadratic forms can be expressed, and the computation of the transform amounts to finding the solution to a system of equations (or equally, finding a Brouwer's fixed point of a mapping) with a special structure. Thus, a broader question than the open 'Question 11' in Hiriart-Urruty (SIAM Rev. 49, 225-273, 2007) is addressed in this paper.« less

Quadratic Electro-optic Effect in a Novel Nonconjugated Conductive Polymer, iodine-doped Polynorbornene

NASA Astrophysics Data System (ADS)

Narayanan, Ananthakrishnan; Thakur, Mrinal

2009-03-01

Quadratic electro-optic effect in a novel nonconjugated conductive polymer, iodine-doped polynorbornene has been measured using field-induced birefringence at 633 nm. The electrical conductivity^1 of polynorbornene increases by twelve orders of magnitude to about 0.01 S/cm upon doping with iodine. The electro-optic measurement has been made in a film doped at the medium doping-level. The electro-optic modulation signal was recorded using a lock-in amplifier for various applied ac voltages (4 kHz) and the quadratic dependence of the modulation on the applied voltage was observed. A modulation of about 0.01% was observed for an applied electric field of 3 V/micron for a 100 nm thick film The Kerr coefficient as determined is about 1.77x10-11m/V^2. This exceptionally large quadratic electro-optic effect has been attributed to the confinement of this charge-transfer system within a sub-nanometer dimension. 1. A. Narayanan, A. Palthi and M. Thakur, J. Macromol. Sci. -- PAC, accepted.

Linear-Quadratic-Gaussian Regulator Developed for a Magnetic Bearing

NASA Technical Reports Server (NTRS)

Choi, Benjamin B.

2002-01-01

Linear-Quadratic-Gaussian (LQG) control is a modern state-space technique for designing optimal dynamic regulators. It enables us to trade off regulation performance and control effort, and to take into account process and measurement noise. The Structural Mechanics and Dynamics Branch at the NASA Glenn Research Center has developed an LQG control for a fault-tolerant magnetic bearing suspension rig to optimize system performance and to reduce the sensor and processing noise. The LQG regulator consists of an optimal state-feedback gain and a Kalman state estimator. The first design step is to seek a state-feedback law that minimizes the cost function of regulation performance, which is measured by a quadratic performance criterion with user-specified weighting matrices, and to define the tradeoff between regulation performance and control effort. The next design step is to derive a state estimator using a Kalman filter because the optimal state feedback cannot be implemented without full state measurement. Since the Kalman filter is an optimal estimator when dealing with Gaussian white noise, it minimizes the asymptotic covariance of the estimation error.

Linear Quadratic Mean Field Type Control and Mean Field Games with Common Noise, with Application to Production of an Exhaustible Resource

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

Graber, P. Jameson, E-mail: jameson-graber@baylor.edu

We study a general linear quadratic mean field type control problem and connect it to mean field games of a similar type. The solution is given both in terms of a forward/backward system of stochastic differential equations and by a pair of Riccati equations. In certain cases, the solution to the mean field type control is also the equilibrium strategy for a class of mean field games. We use this fact to study an economic model of production of exhaustible resources.

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…

Stacked Deck: An Effective, School-Based Program for the Prevention of Problem Gambling

ERIC Educational Resources Information Center

Williams, Robert J.; Wood, Robert T.; Currie, Shawn R.

2010-01-01

School-based prevention programs are an important component of problem gambling prevention, but empirically effective programs are lacking. Stacked Deck is a set of 5-6 interactive lessons that teach about the history of gambling; the true odds and "house edge"; gambling fallacies; signs, risk factors, and causes of problem gambling; and…

Symmetry-breaking instability of quadratic soliton bound states

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

Delque, Michaeel; Departement d'Optique P.M. Duffieux, Institut FEMTO-ST, Universite de Franche-Comte, CNRS UMR 6174, F-25030 Besancon; Fanjoux, Gil

We study both numerically and experimentally two-dimensional soliton bound states in quadratic media and demonstrate their symmetry-breaking instability. The experiment is performed in a potassium titanyl phosphate crystal in a type-II configuration. The bound state is generated by the copropagation of the antisymmetric fundamental beam locked in phase with the symmetrical second harmonic one. Experimental results are in good agreement with numerical simulations of the nonlinear wave equations.

Applying EXCEL Solver to a watershed management goal-programming problem

Treesearch

J. E. de Steiguer

2000-01-01

This article demonstrates the application of EXCEL® spreadsheet linear programming (LP) solver to a watershed management multiple use goal programming (GP) problem. The data used to demonstrate the application are from a published study for a watershed in northern Colorado. GP has been used by natural resource managers for many years. However, the GP solution by means...

Linear quadratic regulators with eigenvalue placement in a horizontal strip

NASA Technical Reports Server (NTRS)

Shieh, Leang S.; Dib, Hani M.; Ganesan, Sekar

1987-01-01

A method for optimally shifting the imaginary parts of the open-loop poles of a multivariable control system to the desirable closed-loop locations is presented. The optimal solution with respect to a quadratic performance index is obtained by solving a linear matrix Liapunov equation.

An Interdisciplinary Program in Technical Communications: Problems Encountered.

ERIC Educational Resources Information Center

Eckman, Martha

The need for experts in technical communication is growing significantly while the number of college graduates in the field accounts for less than one percent of the need. Three major types of problems should be considered in trying to establish a technical communication program: those involving society's need for better technical communicators,…

Stochastic resonance in a fractional oscillator driven by multiplicative quadratic noise

NASA Astrophysics Data System (ADS)

Ren, Ruibin; Luo, Maokang; Deng, Ke

2017-02-01

Stochastic resonance of a fractional oscillator subject to an external periodic field as well as to multiplicative and additive noise is investigated. The fluctuations of the eigenfrequency are modeled as the quadratic function of the trichotomous noise. Applying the moment equation method and Shapiro-Loginov formula, we obtain the exact expression of the complex susceptibility and related stability criteria. Theoretical analysis and numerical simulations indicate that the spectral amplification (SPA) depends non-monotonicly both on the external driving frequency and the parameters of the quadratic noise. In addition, the investigations into fractional stochastic systems have suggested that both the noise parameters and the memory effect can induce the phenomenon of stochastic multi-resonance (SMR), which is previously reported and believed to be absent in the case of the multiplicative noise with only a linear term.

Interpersonal Problems and Developmental Trajectories of Binge Eating Disorder

PubMed Central

Blomquist, Kerstin K.; Ansell, Emily B.; White, Marney A.; Masheb, Robin M.; Grilo, Carlos M.

2012-01-01

Objective To explore associations between specific interpersonal constructs and the developmental progression of behaviors leading to binge eating disorder (BED). Method Eighty-four consecutively evaluated, treatment-seeking obese (BMI ≥ 30) men and women with BED were assessed with structured diagnostic and clinical interviews and completed a battery of established measures to assess the current and developmental eating- and weight-related variables as well as interpersonal functioning. Results Using the interpersonal circumplex structural summary method, amplitude, elevation, the affiliation dimension, and the quadratic coefficient for the dominance dimension were associated with eating and weight-related developmental variables. The amplitude coefficient and more extreme interpersonal problems on the dominance dimension (quadratic)—i.e., problems with being extremely high (domineering) or low in dominance (submissive)—were significantly associated with ayounger age at onset of binge eating, BED, and overweight as well as accounted for significant variance in age at binge eating, BED, and overweight onset. Greater interpersonal problems with having an overly affiliative interpersonal style were significantly associated with, and accounted for significant variance in, ayounger age at diet onset. Discussion Findings provide further support for the importance of interpersonal problems among adults with BED and converge with recent work highlighting the importance of specific types of interpersonal problems for understanding heterogeneity and different developmental trajectories of individuals with BED. PMID:22727087

Thermal response test data of five quadratic cross section precast pile heat exchangers.

PubMed

Alberdi-Pagola, Maria

2018-06-01

This data article comprises records from five Thermal Response Tests (TRT) of quadratic cross section pile heat exchangers. Pile heat exchangers, typically referred to as energy piles, consist of traditional foundation piles with embedded heat exchanger pipes. The data presented in this article are related to the research article entitled "Comparing heat flow models for interpretation of precast quadratic pile heat exchanger thermal response tests" (Alberdi-Pagola et al., 2018) [1]. The TRT data consists of measured inlet and outlet temperatures, fluid flow and injected heat rate recorded every 10 min. The field dataset is made available to enable model verification studies.

Self-repeating properties of four-petal Gaussian vortex beams in quadratic index medium

NASA Astrophysics Data System (ADS)

Zou, Defeng; Li, Xiaohui; Chai, Tong; Zheng, Hairong

2018-05-01

In this paper, we investigate the propagation properties of four-petal Gaussian vortex (FPGV) beams propagating through the quadratic index medium, obtaining the analytical expression of FPGV beams. The effects of beam order n, topological charge m and beam waist ω0 are investigated. Results show that quadratic index medium support periodic distributions of FPGV beams. A hollow optical wall or an optical central principal maximum surrounded by symmetrical sidelobes will occur at the center of a period. At length, they will evolve into four petals structure, exactly same as the intensity distributions at source plane.

Annual Review of Research Under the Joint Service Electronics Program.

DTIC Science & Technology

1979-10-01

Contents: Quadratic Optimization Problems; Nonlinear Control; Nonlinear Fault Analysis; Qualitative Analysis of Large Scale Systems; Multidimensional System Theory ; Optical Noise; and Pattern Recognition.

A new problem in mathematical physics associated with the problem of coherent phase transformation

NASA Astrophysics Data System (ADS)

Grinfeld, M. A.

1985-06-01

The description of heterogeneous coherent phase equilibria in an elastic single component system is shown to lead, in the approximation of small intrinsic deformation, to a new problem in mathematical physics with an unknown bound. The low order terms of the resulting system of equilibrium equations coincide with the equations of the classical linear theory of elasticity (generally speaking, anisotropic); however, the problem remains strongly nonlinear overall, inasmuch as it contains an unknown bound and a boundary condition on it which is quadratic with respect to translation. The formulas obtained are used to find certain explicit solutions to the boundary problems. As an example, the problem of heterogeneous equilibria in an infinite rectangular isotropic beam with free faces and constant loading on the surfaces x squared = const can be examined. A modeling problem for the asymptote of small intrinsic deformation during coherent phase transformation is presented as a scalar analog of the vector problem considered initially.

Entanglement in a model for Hawking radiation: An application of quadratic algebras

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

Bambah, Bindu A., E-mail: bbsp@uohyd.ernet.in; Mukku, C., E-mail: mukku@iiit.ac.in; Shreecharan, T., E-mail: shreecharan@gmail.com

2013-03-15

Quadratic polynomially deformed su(1,1) and su(2) algebras are utilized in model Hamiltonians to show how the gravitational system consisting of a black hole, infalling radiation and outgoing (Hawking) radiation can be solved exactly. The models allow us to study the long-time behaviour of the black hole and its outgoing modes. In particular, we calculate the bipartite entanglement entropies of subsystems consisting of (a) infalling plus outgoing modes and (b) black hole modes plus the infalling modes, using the Janus-faced nature of the model. The long-time behaviour also gives us glimpses of modifications in the character of Hawking radiation. Finally, wemore » study the phenomenon of superradiance in our model in analogy with atomic Dicke superradiance. - Highlights: Black-Right-Pointing-Pointer We examine a toy model for Hawking radiation with quantized black hole modes. Black-Right-Pointing-Pointer We use quadratic polynomially deformed su(1,1) algebras to study its entanglement properties. Black-Right-Pointing-Pointer We study the 'Dicke Superradiance' in black hole radiation using quadratically deformed su(2) algebras. Black-Right-Pointing-Pointer We study the modification of the thermal character of Hawking radiation due to quantized black hole modes.« less

Quadratic semiparametric Von Mises calculus

PubMed Central

Robins, James; Li, Lingling; Tchetgen, Eric

2009-01-01

We discuss a new method of estimation of parameters in semiparametric and nonparametric models. The method is based on U-statistics constructed from quadratic influence functions. The latter extend ordinary linear influence functions of the parameter of interest as defined in semiparametric theory, and represent second order derivatives of this parameter. For parameters for which the matching cannot be perfect the method leads to a bias-variance trade-off, and results in estimators that converge at a slower than n–1/2-rate. In a number of examples the resulting rate can be shown to be optimal. We are particularly interested in estimating parameters in models with a nuisance parameter of high dimension or low regularity, where the parameter of interest cannot be estimated at n–1/2-rate. PMID:23087487

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

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.

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 2 n 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.

Learning quadratic receptive fields from neural responses to natural stimuli.

PubMed

Rajan, Kanaka; Marre, Olivier; Tkačik, Gašper

2013-07-01

Models of neural responses to stimuli with complex spatiotemporal correlation structure often assume that neurons are selective for only a small number of linear projections of a potentially high-dimensional input. In this review, we explore recent modeling approaches where the neural response depends on the quadratic form of the input rather than on its linear projection, that is, the neuron is sensitive to the local covariance structure of the signal preceding the spike. To infer this quadratic dependence in the presence of arbitrary (e.g., naturalistic) stimulus distribution, we review several inference methods, focusing in particular on two information theory-based approaches (maximization of stimulus energy and of noise entropy) and two likelihood-based approaches (Bayesian spike-triggered covariance and extensions of generalized linear models). We analyze the formal relationship between the likelihood-based and information-based approaches to demonstrate how they lead to consistent inference. We demonstrate the practical feasibility of these procedures by using model neurons responding to a flickering variance stimulus.

QUADRATIC SERENDIPITY FINITE ELEMENTS ON POLYGONS USING GENERALIZED BARYCENTRIC COORDINATES

PubMed Central

RAND, ALEXANDER; GILLETTE, ANDREW; BAJAJ, CHANDRAJIT

2013-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. PMID:25301974

A novel approach based on preference-based index for interval bilevel linear programming problem.

PubMed

Ren, Aihong; Wang, Yuping; Xue, Xingsi

2017-01-01

This paper proposes a new methodology for solving the interval bilevel linear programming problem in which all coefficients of both objective functions and constraints are considered as interval numbers. In order to keep as much uncertainty of the original constraint region as possible, the original problem is first converted into an interval bilevel programming problem with interval coefficients in both objective functions only through normal variation of interval number and chance-constrained programming. With the consideration of different preferences of different decision makers, the concept of the preference level that the interval objective function is preferred to a target interval is defined based on the preference-based index. Then a preference-based deterministic bilevel programming problem is constructed in terms of the preference level and the order relation [Formula: see text]. Furthermore, the concept of a preference δ -optimal solution is given. Subsequently, the constructed deterministic nonlinear bilevel problem is solved with the help of estimation of distribution algorithm. Finally, several numerical examples are provided to demonstrate the effectiveness of the proposed approach.

Exploring Heuristics for the Vehicle Routing Problem with Split Deliveries and Time Windows

DTIC Science & Technology

2014-09-18

a traveling 2 salesman problem (TSP). Therefore in the remainder of this document, the VRP refers to a capacitated VRP. 1.3 Military...specifically investigated the SDVRPTW. Stutzle [63] investigates the effects of several LS operators on the traveling salesman problem , the quadratic...34 Traveling salesman -type combinatorial problems and their relation to the logistics of regional blood banking," Northwestern University, Evanston, IL

New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints.

PubMed

Benko, Matúš; Gfrerer, Helmut

2018-01-01

In this paper, we consider a sufficiently broad class of non-linear mathematical programs with disjunctive constraints, which, e.g. include mathematical programs with complemetarity/vanishing constraints. We present an extension of the concept of [Formula: see text]-stationarity which can be easily combined with the well-known notion of M-stationarity to obtain the stronger property of so-called [Formula: see text]-stationarity. We show how the property of [Formula: see text]-stationarity (and thus also of M-stationarity) can be efficiently verified for the considered problem class by computing [Formula: see text]-stationary solutions of a certain quadratic program. We consider further the situation that the point which is to be tested for [Formula: see text]-stationarity, is not known exactly, but is approximated by some convergent sequence, as it is usually the case when applying some numerical method.

Multi-Objectivising Combinatorial Optimisation Problems by Means of Elementary Landscape Decompositions.

PubMed

Ceberio, Josu; Calvo, Borja; Mendiburu, Alexander; Lozano, Jose A

2018-02-15

In the last decade, many works in combinatorial optimisation have shown that, due to the advances in multi-objective optimisation, the algorithms from this field could be used for solving single-objective problems as well. In this sense, a number of papers have proposed multi-objectivising single-objective problems in order to use multi-objective algorithms in their optimisation. In this article, we follow up this idea by presenting a methodology for multi-objectivising combinatorial optimisation problems based on elementary landscape decompositions of their objective function. Under this framework, each of the elementary landscapes obtained from the decomposition is considered as an independent objective function to optimise. In order to illustrate this general methodology, we consider four problems from different domains: the quadratic assignment problem and the linear ordering problem (permutation domain), the 0-1 unconstrained quadratic optimisation problem (binary domain), and the frequency assignment problem (integer domain). We implemented two widely known multi-objective algorithms, NSGA-II and SPEA2, and compared their performance with that of a single-objective GA. The experiments conducted on a large benchmark of instances of the four problems show that the multi-objective algorithms clearly outperform the single-objective approaches. Furthermore, a discussion on the results suggests that the multi-objective space generated by this decomposition enhances the exploration ability, thus permitting NSGA-II and SPEA2 to obtain better results in the majority of the tested instances.

How Does Early Feedback in an Online Programming Course Change Problem Solving?

ERIC Educational Resources Information Center

Ebrahimi, Alireza

2012-01-01

How does early feedback change the programming problem solving in an online environment and help students choose correct approaches? This study was conducted in a sample of students learning programming in an online course entitled Introduction to C++ and OOP (Object Oriented Programming) using the ANGEL learning management system platform. My…

Quadratic band touching points and flat bands in two-dimensional topological Floquet systems

NASA Astrophysics Data System (ADS)

Du, Liang; Zhou, Xiaoting; Fiete, Gregory A.

2017-01-01

In this paper we theoretically study, using Floquet-Bloch theory, the influence of circularly and linearly polarized light on two-dimensional band structures with Dirac and quadratic band touching points, and flat bands, taking the nearest neighbor hopping model on the kagome lattice as an example. We find circularly polarized light can invert the ordering of this three-band model, while leaving the flat band dispersionless. We find a small gap is also opened at the quadratic band touching point by two-photon and higher order processes. By contrast, linearly polarized light splits the quadratic band touching point (into two Dirac points) by an amount that depends only on the amplitude and polarization direction of the light, independent of the frequency, and generally renders dispersion to the flat band. The splitting is perpendicular to the direction of the polarization of the light. We derive an effective low-energy theory that captures these key results. Finally, we compute the frequency dependence of the optical conductivity for this three-band model and analyze the various interband contributions of the Floquet modes. Our results suggest strategies for optically controlling band structure and interaction strength in real systems.

Aggregation of LoD 1 building models as an optimization problem

NASA Astrophysics Data System (ADS)

Guercke, R.; Götzelmann, T.; Brenner, C.; Sester, M.

3D city models offered by digital map providers typically consist of several thousands or even millions of individual buildings. Those buildings are usually generated in an automated fashion from high resolution cadastral and remote sensing data and can be very detailed. However, not in every application such a high degree of detail is desirable. One way to remove complexity is to aggregate individual buildings, simplify the ground plan and assign an appropriate average building height. This task is computationally complex because it includes the combinatorial optimization problem of determining which subset of the original set of buildings should best be aggregated to meet the demands of an application. In this article, we introduce approaches to express different aspects of the aggregation of LoD 1 building models in the form of Mixed Integer Programming (MIP) problems. The advantage of this approach is that for linear (and some quadratic) MIP problems, sophisticated software exists to find exact solutions (global optima) with reasonable effort. We also propose two different heuristic approaches based on the region growing strategy and evaluate their potential for optimization by comparing their performance to a MIP-based approach.

A linear quadratic regulator approach to the stabilization of uncertain linear systems

NASA Technical Reports Server (NTRS)

Shieh, L. S.; Sunkel, J. W.; Wang, Y. J.

1990-01-01

This paper presents a linear quadratic regulator approach to the stabilization of uncertain linear systems. The uncertain systems under consideration are described by state equations with the presence of time-varying unknown-but-bounded uncertainty matrices. The method is based on linear quadratic regulator (LQR) theory and Liapunov stability theory. The robust stabilizing control law for a given uncertain system can be easily constructed from the symmetric positive-definite solution of the associated augmented Riccati equation. The proposed approach can be applied to matched and/or mismatched systems with uncertainty matrices in which only their matrix norms are bounded by some prescribed values and/or their entries are bounded by some prescribed constraint sets. Several numerical examples are presented to illustrate the results.

Linear-Quadratic Control of a MEMS Micromirror using Kalman Filtering

DTIC Science & Technology

2011-12-01

LINEAR-QUADRATIC CONTROL OF A MEMS MICROMIRROR USING KALMAN FILTERING THESIS Jamie P...A MEMS MICROMIRROR USING KALMAN FILTERING THESIS Presented to the Faculty Department of Electrical Engineering Graduate School of...actuated micromirrors fabricated by PolyMUMPs. Successful application of these techniques enables demonstration of smooth, stable deflections of 50% and

A duality approach for solving bounded linear programming problems with fuzzy variables based on ranking functions and its application in bounded transportation problems

NASA Astrophysics Data System (ADS)

Ebrahimnejad, Ali

2015-08-01

There are several methods, in the literature, for solving fuzzy variable linear programming problems (fuzzy linear programming in which the right-hand-side vectors and decision variables are represented by trapezoidal fuzzy numbers). In this paper, the shortcomings of some existing methods are pointed out and to overcome these shortcomings a new method based on the bounded dual simplex method is proposed to determine the fuzzy optimal solution of that kind of fuzzy variable linear programming problems in which some or all variables are restricted to lie within lower and upper bounds. To illustrate the proposed method, an application example is solved and the obtained results are given. The advantages of the proposed method over existing methods are discussed. Also, one application of this algorithm in solving bounded transportation problems with fuzzy supplies and demands is dealt with. The proposed method is easy to understand and to apply for determining the fuzzy optimal solution of bounded fuzzy variable linear programming problems occurring in real-life situations.

Symmetric tridiagonal structure preserving finite element model updating problem for the quadratic model

NASA Astrophysics Data System (ADS)

Rakshit, Suman; Khare, Swanand R.; Datta, Biswa Nath

2018-07-01

One of the most important yet difficult aspect of the Finite Element Model Updating Problem is to preserve the finite element inherited structures in the updated model. Finite element matrices are in general symmetric, positive definite (or semi-definite) and banded (tridiagonal, diagonal, penta-diagonal, etc.). Though a large number of papers have been published in recent years on various aspects of solutions of this problem, papers dealing with structure preservation almost do not exist. A novel optimization based approach that preserves the symmetric tridiagonal structures of the stiffness and damping matrices is proposed in this paper. An analytical expression for the global minimum solution of the associated optimization problem along with the results of numerical experiments obtained by both the analytical expressions and by an appropriate numerical optimization algorithm are presented. The results of numerical experiments support the validity of the proposed method.

Sparse Regression as a Sparse Eigenvalue Problem

NASA Technical Reports Server (NTRS)

Moghaddam, Baback; Gruber, Amit; Weiss, Yair; Avidan, Shai

2008-01-01

We extend the l0-norm "subspectral" algorithms for sparse-LDA [5] and sparse-PCA [6] to general quadratic costs such as MSE in linear (kernel) regression. The resulting "Sparse Least Squares" (SLS) problem is also NP-hard, by way of its equivalence to a rank-1 sparse eigenvalue problem (e.g., binary sparse-LDA [7]). Specifically, for a general quadratic cost we use a highly-efficient technique for direct eigenvalue computation using partitioned matrix inverses which leads to dramatic x103 speed-ups over standard eigenvalue decomposition. This increased efficiency mitigates the O(n4) scaling behaviour that up to now has limited the previous algorithms' utility for high-dimensional learning problems. Moreover, the new computation prioritizes the role of the less-myopic backward elimination stage which becomes more efficient than forward selection. Similarly, branch-and-bound search for Exact Sparse Least Squares (ESLS) also benefits from partitioned matrix inverse techniques. Our Greedy Sparse Least Squares (GSLS) generalizes Natarajan's algorithm [9] also known as Order-Recursive Matching Pursuit (ORMP). Specifically, the forward half of GSLS is exactly equivalent to ORMP but more efficient. By including the backward pass, which only doubles the computation, we can achieve lower MSE than ORMP. Experimental comparisons to the state-of-the-art LARS algorithm [3] show forward-GSLS is faster, more accurate and more flexible in terms of choice of regularization

Higher order sensitivity of solutions to convex programming problems without strict complementarity

NASA Technical Reports Server (NTRS)

Malanowski, Kazimierz

1988-01-01

Consideration is given to a family of convex programming problems which depend on a vector parameter. It is shown that the solutions of the problems and the associated Lagrange multipliers are arbitrarily many times directionally differentiable functions of the parameter, provided that the data of the problems are sufficiently regular. The characterizations of the respective derivatives are given.

Fuzzy Random λ-Mean SAD Portfolio Selection Problem: An Ant Colony Optimization Approach

NASA Astrophysics Data System (ADS)

Thakur, Gour Sundar Mitra; Bhattacharyya, Rupak; Mitra, Swapan Kumar

2010-10-01

To reach the investment goal, one has to select a combination of securities among different portfolios containing large number of securities. Only the past records of each security do not guarantee the future return. As there are many uncertain factors which directly or indirectly influence the stock market and there are also some newer stock markets which do not have enough historical data, experts' expectation and experience must be combined with the past records to generate an effective portfolio selection model. In this paper the return of security is assumed to be Fuzzy Random Variable Set (FRVS), where returns are set of random numbers which are in turn fuzzy numbers. A new λ-Mean Semi Absolute Deviation (λ-MSAD) portfolio selection model is developed. The subjective opinions of the investors to the rate of returns of each security are taken into consideration by introducing a pessimistic-optimistic parameter vector λ. λ-Mean Semi Absolute Deviation (λ-MSAD) model is preferred as it follows absolute deviation of the rate of returns of a portfolio instead of the variance as the measure of the risk. As this model can be reduced to Linear Programming Problem (LPP) it can be solved much faster than quadratic programming problems. Ant Colony Optimization (ACO) is used for solving the portfolio selection problem. ACO is a paradigm for designing meta-heuristic algorithms for combinatorial optimization problem. Data from BSE is used for illustration.

Mathematical solution of multilevel fractional programming problem with fuzzy goal programming approach

NASA Astrophysics Data System (ADS)

Lachhwani, Kailash; Poonia, Mahaveer Prasad

2012-08-01

In this paper, we show a procedure for solving multilevel fractional programming problems in a large hierarchical decentralized organization using fuzzy goal programming approach. In the proposed method, the tolerance membership functions for the fuzzily described numerator and denominator part of the objective functions of all levels as well as the control vectors of the higher level decision makers are respectively defined by determining individual optimal solutions of each of the level decision makers. A possible relaxation of the higher level decision is considered for avoiding decision deadlock due to the conflicting nature of objective functions. Then, fuzzy goal programming approach is used for achieving the highest degree of each of the membership goal by minimizing negative deviational variables. We also provide sensitivity analysis with variation of tolerance values on decision vectors to show how the solution is sensitive to the change of tolerance values with the help of a numerical example.

Effects of Pascal and FORTRAN Programming on the Problem-Solving Abilities of College Students.

ERIC Educational Resources Information Center

Choi, Won Sik; Repman, Judi

1993-01-01

Describes a study that was conducted to determine whether learning to program a computer in Pascal or FORTRAN improved problem-solving skills of college students when compared to a control group and to determine which programing language was more effective in the development of problem-solving abilities. (26 references) (LRW)

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.

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.

Solving portfolio selection problems with minimum transaction lots based on conditional-value-at-risk

NASA Astrophysics Data System (ADS)

Setiawan, E. P.; Rosadi, D.

2017-01-01

Portfolio selection problems conventionally means ‘minimizing the risk, given the certain level of returns’ from some financial assets. This problem is frequently solved with quadratic or linear programming methods, depending on the risk measure that used in the objective function. However, the solutions obtained by these method are in real numbers, which may give some problem in real application because each asset usually has its minimum transaction lots. In the classical approach considering minimum transaction lots were developed based on linear Mean Absolute Deviation (MAD), variance (like Markowitz’s model), and semi-variance as risk measure. In this paper we investigated the portfolio selection methods with minimum transaction lots with conditional value at risk (CVaR) as risk measure. The mean-CVaR methodology only involves the part of the tail of the distribution that contributed to high losses. This approach looks better when we work with non-symmetric return probability distribution. Solution of this method can be found with Genetic Algorithm (GA) methods. We provide real examples using stocks from Indonesia stocks market.

Elegant Ince-Gaussian beams in a quadratic-index medium

NASA Astrophysics Data System (ADS)

Bai, Zhi-Yong; Deng, Dong-Mei; Guo, Qi

2011-09-01

Elegant Ince—Gaussian beams, which are the exact solutions of the paraxial wave equation in a quadratic-index medium, are derived in elliptical coordinates. These kinds of beams are the alternative form of standard Ince—Gaussian beams and they display better symmetry between the Ince-polynomials and the Gaussian function in mathematics. The transverse intensity distribution and the phase of the elegant Ince—Gaussian beams are discussed.

Evaluation of College Reading and Study Skills Programs; Problems and Approaches.

ERIC Educational Resources Information Center

Anderson, William W.

The purpose of this paper was to bring together some of the most outstanding and significant research in recent years relating to the problems of evaluating college reading and study skills programs and the corresponding prospects and implications for improvement. The sections of the paper include: "Criterion Measures of Program Success," which is…

A quadratic regression modelling on paddy production in the area of Perlis

NASA Astrophysics Data System (ADS)

Goh, Aizat Hanis Annas; Ali, Zalila; Nor, Norlida Mohd; Baharum, Adam; Ahmad, Wan Muhamad Amir W.

2017-08-01

Polynomial regression models are useful in situations in which the relationship between a response variable and predictor variables is curvilinear. Polynomial regression fits the nonlinear relationship into a least squares linear regression model by decomposing the predictor variables into a kth order polynomial. The polynomial order determines the number of inflexions on the curvilinear fitted line. A second order polynomial forms a quadratic expression (parabolic curve) with either a single maximum or minimum, a third order polynomial forms a cubic expression with both a relative maximum and a minimum. This study used paddy data in the area of Perlis to model paddy production based on paddy cultivation characteristics and environmental characteristics. The results indicated that a quadratic regression model best fits the data and paddy production is affected by urea fertilizer application and the interaction between amount of average rainfall and percentage of area defected by pest and disease. Urea fertilizer application has a quadratic effect in the model which indicated that if the number of days of urea fertilizer application increased, paddy production is expected to decrease until it achieved a minimum value and paddy production is expected to increase at higher number of days of urea application. The decrease in paddy production with an increased in rainfall is greater, the higher the percentage of area defected by pest and disease.

Robust Programming Problems Based on the Mean-Variance Model Including Uncertainty Factors

NASA Astrophysics Data System (ADS)

Hasuike, Takashi; Ishii, Hiroaki

2009-01-01

This paper considers robust programming problems based on the mean-variance model including uncertainty sets and fuzzy factors. Since these problems are not well-defined problems due to fuzzy factors, it is hard to solve them directly. Therefore, introducing chance constraints, fuzzy goals and possibility measures, the proposed models are transformed into the deterministic equivalent problems. Furthermore, in order to solve these equivalent problems efficiently, the solution method is constructed introducing the mean-absolute deviation and doing the equivalent transformations.

Conservation and Preservation Programs for the University of California Libraries: Problems, Programs, and Costs. RR-80-2.

ERIC Educational Resources Information Center

King, Richard G., Jr.

Designed to provide background for the planning of collection preservation programs in the libraries of the University of California, this paper presents an overview of the preservation problem, makes specific recommendations for further programs within the University of California library system, and assesses the needs of the system with regard…

Four Decades of Creative Vision: Insights from an Evaluation of the Future Problem Solving Program International (FPSPI)

ERIC Educational Resources Information Center

Treffinger, Donald J.; Solomon, Marianne; Woythal, Deb

2012-01-01

E. Paul Torrance, a pioneer in creative education, and his associates founded the Future Problem Solving Program (now FPSPI, or Future Problem Solving Program International) in the mid-1970s as a competitive, interscholastic program and as a curriculum project integrating creative problem-solving and future studies. Since its founding, the program…

A linear programming approach to max-sum problem: a review.

PubMed

Werner, Tomás

2007-07-01

The max-sum labeling problem, defined as maximizing a sum of binary (i.e., pairwise) functions of discrete variables, is a general NP-hard optimization problem with many applications, such as computing the MAP configuration of a Markov random field. We review a not widely known approach to the problem, developed by Ukrainian researchers Schlesinger et al. in 1976, and show how it contributes to recent results, most importantly, those on the convex combination of trees and tree-reweighted max-product. In particular, we review Schlesinger et al.'s upper bound on the max-sum criterion, its minimization by equivalent transformations, its relation to the constraint satisfaction problem, the fact that this minimization is dual to a linear programming relaxation of the original problem, and the three kinds of consistency necessary for optimality of the upper bound. We revisit problems with Boolean variables and supermodular problems. We describe two algorithms for decreasing the upper bound. We present an example application for structural image analysis.

Constraints on both the quadratic and quartic symmetry energy coefficients by 2β --decay energies

NASA Astrophysics Data System (ADS)

Wan, Niu; Xu, Chang; Ren, Zhongzhou; Liu, Jie

2018-05-01

In this Rapid Communication, the 2 β- -decay energies Q (2 β-) given in the atomic mass evaluation are used to extract not only the quadratic volume symmetry energy coefficient csymv, but also the quartic one csym,4 v. Based on the modified Bethe-Weizsäcker nuclear mass formula of the liquid-drop model, the decay energy Q (2 β-) is found to be closely related to both the quadratic and quartic symmetry energy coefficients csymv and csym,4 v. There are totally 449 data of decay energies Q (2 β-) used in the present analysis where the candidate nuclei are carefully chosen by fulfilling the following criteria: (1) large neutron-proton number difference N -Z , (2) large isospin asymmetry I , and (3) limited shell effect. The values of csymv and csym,4 v are extracted to be 29.345 and 3.634 MeV, respectively. Moreover, the quadratic surface-volume symmetry energy coefficient ratio is determined to be κ =csyms/csymv=1.356 .

Field-antifield and BFV formalisms for quadratic systems with open gauge algebras

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

Nirov, K.S.; Razumov, A.V.

1992-09-20

In this paper the Lagrangian field-antifield (BV) and Hamiltonian (BFV) BRST formalisms for the general quadratic systems with open gauge algebra are considered. The equivalence between the Lagrangian and Hamiltonian formalisms is proven.

First report of soybean pest, Euschistus quadrator (Hempitera: pentatomidae) in Mississippi

USDA-ARS?s Scientific Manuscript database

Here we report on the first state and county record of Euschistus quadrator Ralston (Hemiptera: Pentatomidae) in Washington County, Mississippi. The species has been documented from Honduras to Virginia primarily on soybeans, cotton, various row crops, fruit, and non-crop hosts. The local impact...

Analysis of Maneuvering Targets with Complex Motions by Two-Dimensional Product Modified Lv's Distribution for Quadratic Frequency Modulation Signals.

PubMed

Jing, Fulong; Jiao, Shuhong; Hou, Changbo; Si, Weijian; Wang, Yu

2017-06-21

For targets with complex motion, such as ships fluctuating with oceanic waves and high maneuvering airplanes, azimuth echo signals can be modeled as multicomponent quadratic frequency modulation (QFM) signals after migration compensation and phase adjustment. For the QFM signal model, the chirp rate (CR) and the quadratic chirp rate (QCR) are two important physical quantities, which need to be estimated. For multicomponent QFM signals, the cross terms create a challenge for detection, which needs to be addressed. In this paper, by employing a novel multi-scale parametric symmetric self-correlation function (PSSF) and modified scaled Fourier transform (mSFT), an effective parameter estimation algorithm is proposed-referred to as the Two-Dimensional product modified Lv's distribution (2D-PMLVD)-for QFM signals. The 2D-PMLVD is simple and can be easily implemented by using fast Fourier transform (FFT) and complex multiplication. These measures are analyzed in the paper, including the principle, the cross term, anti-noise performance, and computational complexity. Compared to the other three representative methods, the 2D-PMLVD can achieve better anti-noise performance. The 2D-PMLVD, which is free of searching and has no identifiability problems, is more suitable for multicomponent situations. Through several simulations and analyses, the effectiveness of the proposed estimation algorithm is verified.

Enhancing Problem-Solving Capabilities Using Object-Oriented Programming Language

ERIC Educational Resources Information Center

Unuakhalu, Mike F.

2009-01-01

This study integrated object-oriented programming instruction with transfer training activities in everyday tasks, which might provide a mechanism that can be used for efficient problem solving. Specifically, a Visual BASIC embedded with everyday tasks group was compared to another group exposed to Visual BASIC instruction only. Subjects were 40…

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

Huang, Kuo -Ling; Mehrotra, Sanjay

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 quadraticmore » 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).« less

Administrative Problem-Solving for Writing Programs and Writing Centers: Scenarios in Effective Program Management.

ERIC Educational Resources Information Center

Myers-Breslin, Linda

Addressing the issues and problems faced by writing program administrators (WPAs) and writing center directors (WCDs), and how they can most effectively resolve the political, pedagogical, and financial questions that arise, this book presents essays from experienced WPAs and WCDs at a wide variety of institutions that offer scenarios and case…

Importance of the cutoff value in the quadratic adaptive integrate-and-fire model.

PubMed

Touboul, Jonathan

2009-08-01

The quadratic adaptive integrate-and-fire model (Izhikevich, 2003 , 2007 ) is able to reproduce various firing patterns of cortical neurons and is widely used in large-scale simulations of neural networks. This model describes the dynamics of the membrane potential by a differential equation that is quadratic in the voltage, coupled to a second equation for adaptation. Integration is stopped during the rise phase of a spike at a voltage cutoff value V(c) or when it blows up. Subsequently the membrane potential is reset, and the adaptation variable is increased by a fixed amount. We show in this note that in the absence of a cutoff value, not only the voltage but also the adaptation variable diverges in finite time during spike generation in the quadratic model. The divergence of the adaptation variable makes the system very sensitive to the cutoff: changing V(c) can dramatically alter the spike patterns. Furthermore, from a computational viewpoint, the divergence of the adaptation variable implies that the time steps for numerical simulation need to be small and adaptive. However, divergence of the adaptation variable does not occur for the quartic model (Touboul, 2008 ) and the adaptive exponential integrate-and-fire model (Brette & Gerstner, 2005 ). Hence, these models are robust to changes in the cutoff value.

Quadratic band touching points and flat bands in two-dimensional topological Floquet systems

NASA Astrophysics Data System (ADS)

Du, Liang; Zhou, Xiaoting; Fiete, Gregory; The CenterComplex Quantum Systems Team

In this work we theoretically study, using Floquet-Bloch theory, the influence of circularly and linearly polarized light on two-dimensional band structures with Dirac and quadratic band touching points, and flat bands, taking the nearest neighbor hopping model on the kagome lattice as an example. We find circularly polarized light can invert the ordering of this three band model, while leaving the flat-band dispersionless. We find a small gap is also opened at the quadratic band touching point by 2-photon and higher order processes. By contrast, linearly polarized light splits the quadratic band touching point (into two Dirac points) by an amount that depends only on the amplitude and polarization direction of the light, independent of the frequency, and generally renders dispersion to the flat band. The splitting is perpendicular to the direction of the polarization of the light. We derive an effective low-energy theory that captures these key results. Finally, we compute the frequency dependence of the optical conductivity for this 3-band model and analyze the various interband contributions of the Floquet modes. Our results suggest strategies for optically controlling band structure and interaction strength in real systems. We gratefully acknowledge funding from ARO Grant W911NF-14-1-0579 and NSF DMR-1507621.

Comment on "Classification of Lie point symmetries for quadratic Liénard type equation x ̈ + f ( x ) x ˙ 2 + g ( x ) = 0 " [J. Math. Phys. 54, 053506 (2013)] and its erratum [J. Math. Phys. 55, 059901 (2014)

NASA Astrophysics Data System (ADS)

Paliathanasis, A.; Leach, P. G. L.

2016-02-01

We demonstrate a simplification of some recent works on the classification of the Lie symmetries for a quadratic equation of Liénard type. We observe that the problem could have been resolved more simply.

The Early Impact Program: An Early Intervention and Prevention Program for Children and Families At-Risk of Conduct Problems

ERIC Educational Resources Information Center

Larmar, Stephen; Gatfield, Terry

2007-01-01

The Early Impact (EI) program is an early intervention and prevention program for reducing the incidence of conduct problems in pre-school aged children. The EI intervention framework is ecological in design and includes universal and indicated components. This paper delineates key principles and associated strategies that underpin the EI program.…

Robustness of linear quadratic state feedback designs in the presence of system uncertainty. [application to Augmentor Wing Jet STOL Research Aircraft flare control autopilot design

NASA Technical Reports Server (NTRS)

Patel, R. V.; Toda, M.; Sridhar, B.

1977-01-01

The paper deals with the problem of expressing the robustness (stability) property of a linear quadratic state feedback (LQSF) design quantitatively in terms of bounds on the perturbations (modeling errors or parameter variations) in the system matrices so that the closed-loop system remains stable. Nonlinear time-varying and linear time-invariant perturbations are considered. The only computation required in obtaining a measure of the robustness of an LQSF design is to determine the eigenvalues of two symmetric matrices determined when solving the algebraic Riccati equation corresponding to the LQSF design problem. Results are applied to a complex dynamic system consisting of the flare control of a STOL aircraft. The design of the flare control is formulated as an LQSF tracking problem.

Multiobjective fuzzy stochastic linear programming problems with inexact probability distribution

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

Hamadameen, Abdulqader Othman; Zainuddin, Zaitul Marlizawati

This study deals with multiobjective fuzzy stochastic linear programming problems with uncertainty probability distribution which are defined as fuzzy assertions by ambiguous experts. The problem formulation has been presented and the two solutions strategies are; the fuzzy transformation via ranking function and the stochastic transformation when α{sup –}. cut technique and linguistic hedges are used in the uncertainty probability distribution. The development of Sen’s method is employed to find a compromise solution, supported by illustrative numerical example.

Genetic programming over context-free languages with linear constraints for the knapsack problem: first results.

PubMed

Bruhn, Peter; Geyer-Schulz, Andreas

2002-01-01

In this paper, we introduce genetic programming over context-free languages with linear constraints for combinatorial optimization, apply this method to several variants of the multidimensional knapsack problem, and discuss its performance relative to Michalewicz's genetic algorithm with penalty functions. With respect to Michalewicz's approach, we demonstrate that genetic programming over context-free languages with linear constraints improves convergence. A final result is that genetic programming over context-free languages with linear constraints is ideally suited to modeling complementarities between items in a knapsack problem: The more complementarities in the problem, the stronger the performance in comparison to its competitors.

A Mixed Integer Linear Programming Approach to Electrical Stimulation Optimization Problems.

PubMed

Abouelseoud, Gehan; Abouelseoud, Yasmine; Shoukry, Amin; Ismail, Nour; Mekky, Jaidaa

2018-02-01

Electrical stimulation optimization is a challenging problem. Even when a single region is targeted for excitation, the problem remains a constrained multi-objective optimization problem. The constrained nature of the problem results from safety concerns while its multi-objectives originate from the requirement that non-targeted regions should remain unaffected. In this paper, we propose a mixed integer linear programming formulation that can successfully address the challenges facing this problem. Moreover, the proposed framework can conclusively check the feasibility of the stimulation goals. This helps researchers to avoid wasting time trying to achieve goals that are impossible under a chosen stimulation setup. The superiority of the proposed framework over alternative methods is demonstrated through simulation examples.

High profile students’ growth of mathematical understanding in solving linier programing problems

NASA Astrophysics Data System (ADS)

Utomo; Kusmayadi, TA; Pramudya, I.

2018-04-01

Linear program has an important role in human’s life. This linear program is learned in senior high school and college levels. This material is applied in economy, transportation, military and others. Therefore, mastering linear program is useful for provision of life. This research describes a growth of mathematical understanding in solving linear programming problems based on the growth of understanding by the Piere-Kieren model. Thus, this research used qualitative approach. The subjects were students of grade XI in Salatiga city. The subjects of this study were two students who had high profiles. The researcher generally chose the subjects based on the growth of understanding from a test result in the classroom; the mark from the prerequisite material was ≥ 75. Both of the subjects were interviewed by the researcher to know the students’ growth of mathematical understanding in solving linear programming problems. The finding of this research showed that the subjects often folding back to the primitive knowing level to go forward to the next level. It happened because the subjects’ primitive understanding was not comprehensive.

Nonnegative constraint quadratic program technique to enhance the resolution of γ spectra

NASA Astrophysics Data System (ADS)

Li, Jinglun; Xiao, Wuyun; Ai, Xianyun; Chen, Ye

2018-04-01

Two concepts of the nonnegative least squares problem (NNLS) and the linear complementarity problem (LCP) are introduced for the resolution enhancement of the γ spectra. The respective algorithms such as the active set method and the primal-dual interior point method are applied to solve the above two problems. In mathematics, the nonnegative constraint results in the sparsity of the optimal solution of the deconvolution, and it is this sparsity that enhances the resolution. Finally, a comparison in the peak position accuracy and the computation time is made between these two methods and the boosted L_R and Gold methods.

Family-centered program deters substance use, conduct problems, and depressive symptoms in black adolescents.

PubMed

Brody, Gene H; Chen, Yi-fu; Kogan, Steven M; Yu, Tianyi; Molgaard, Virginia K; DiClemente, Ralph J; Wingood, Gina M

2012-01-01

The present research addressed the following important question in pediatric medicine: Can participation in a new family-centered preventive intervention, the Strong African American Families-Teen (SAAF-T) program, deter conduct problems, substance use, substance use problems, and depressive symptoms among rural black adolescents across 22 months? Data were collected from 502 black families in rural Georgia, assigned randomly to SAAF-T or an attention control condition. The prevention condition consisted of 5 consecutive meetings at community facilities with separate, concurrent sessions for caregivers and adolescents followed by a caregiver-adolescent session in which families practiced skills they learned in the separate sessions. Adolescents self-reported conduct problem behaviors, substance use, substance use problems, and depressive symptoms at ages 16 years (pretest) and 17 years 10 months (long-term assessment). Adolescents who participated in SAAF-T evinced lower increases in conduct problem behavior, substance use, substance use problems, and depressive symptom frequencies than did adolescents in the attention control condition across the 22 months between pretest and long-term assessment. This is the first study to demonstrate efficacy in a prevention program designed to deter conduct problems, substance use, substance use problems, and depressive symptoms among rural black adolescents. Because SAAF-T is a manualized, structured program, it can be easily disseminated to public health agencies, schools, churches, boys' and girls' clubs, and other community organizations.

Personalized Computer-Assisted Mathematics Problem-Solving Program and Its Impact on Taiwanese Students

ERIC Educational Resources Information Center

Chen, Chiu-Jung; Liu, Pei-Lin

2007-01-01

This study evaluated the effects of a personalized computer-assisted mathematics problem-solving program on the performance and attitude of Taiwanese fourth grade students. The purpose of this study was to determine whether the personalized computer-assisted program improved student performance and attitude over the nonpersonalized program.…

The Geometry of Quadratic Polynomial Differential Systems with a Finite and an Infinite Saddle-Node (C)

NASA Astrophysics Data System (ADS)

Artés, Joan C.; Rezende, Alex C.; Oliveira, Regilene D. S.

Planar quadratic differential systems occur in many areas of applied mathematics. Although more than one thousand papers have been written on these systems, a complete understanding of this family is still missing. Classical problems, and in particular, Hilbert's 16th problem [Hilbert, 1900, 1902], are still open for this family. Our goal is to make a global study of the family QsnSN of all real quadratic polynomial differential systems which have a finite semi-elemental saddle-node and an infinite saddle-node formed by the collision of two infinite singular points. This family can be divided into three different subfamilies, all of them with the finite saddle-node in the origin of the plane with the eigenvectors on the axes and with the eigenvector associated with the zero eigenvalue on the horizontal axis and (A) with the infinite saddle-node in the horizontal axis, (B) with the infinite saddle-node in the vertical axis and (C) with the infinite saddle-node in the bisector of the first and third quadrants. These three subfamilies modulo the action of the affine group and time homotheties are three-dimensional and we give the bifurcation diagram of their closure with respect to specific normal forms, in the three-dimensional real projective space. The subfamilies (A) and (B) have already been studied [Artés et al., 2013b] and in this paper we provide the complete study of the geometry of the last family (C). The bifurcation diagram for the subfamily (C) yields 371 topologically distinct phase portraits with and without limit cycles for systems in the closure /line{QsnSN(C)} within the representatives of QsnSN(C) given by a chosen normal form. Algebraic invariants are used to construct the bifurcation set. The phase portraits are represented on the Poincaré disk. The bifurcation set of /line{QsnSN(C)} is not only algebraic due to the presence of some surfaces found numerically. All points in these surfaces correspond to either connections of separatrices, or the

Problems and Solutions in Evaluating Child Outcomes of Large-Scale Educational Programs.

ERIC Educational Resources Information Center

Abrams, Allan S.; And Others

1979-01-01

Evaluation of large-scale programs is problematical because of inherent bias in assignment of treatment and control groups, resulting in serious regression artifacts even with the use of analysis of covariance designs. Nonuniformity of program implementation across sites and classrooms is also a problem. (Author/GSK)

Solving Drug-Related Problems in the Professional Experience Program.

ERIC Educational Resources Information Center

Kane, Michael P.; And Others

1993-01-01

A study investigated the effectiveness of using the Pharmacist's Work-up of Drug Therapy (PWDT) in teaching 91 pharmacy students in a clinical clerkship program to identify and solve drug-related problems. Because the instructional technique was recently implemented, the study looked at effects of 3 different quantities of training (0, 1, and 3…

Design of Linear-Quadratic-Regulator for a CSTR process

NASA Astrophysics Data System (ADS)

Meghna, P. R.; Saranya, V.; Jaganatha Pandian, B.

2017-11-01

This paper aims at creating a Linear Quadratic Regulator (LQR) for a Continuous Stirred Tank Reactor (CSTR). A CSTR is a common process used in chemical industries. It is a highly non-linear system. Therefore, in order to create the gain feedback controller, the model is linearized. The controller is designed for the linearized model and the concentration and volume of the liquid in the reactor are kept at a constant value as required.

Steering of Frequency Standards by the Use of Linear Quadratic Gaussian Control Theory

NASA Technical Reports Server (NTRS)

Koppang, Paul; Leland, Robert

1996-01-01

Linear quadratic Gaussian control is a technique that uses Kalman filtering to estimate a state vector used for input into a control calculation. A control correction is calculated by minimizing a quadratic cost function that is dependent on both the state vector and the control amount. Different penalties, chosen by the designer, are assessed by the controller as the state vector and control amount vary from given optimal values. With this feature controllers can be designed to force the phase and frequency differences between two standards to zero either more or less aggressively depending on the application. Data will be used to show how using different parameters in the cost function analysis affects the steering and the stability of the frequency standards.

Reach a nonlinear consensus for MAS via doubly stochastic quadratic operators

NASA Astrophysics Data System (ADS)

Abdulghafor, Rawad; Turaev, Sherzod; Zeki, Akram; Al-Shaikhli, Imad

2018-06-01

This technical note addresses the new nonlinear protocol class of doubly stochastic quadratic operators (DSQOs) for coordination of consensus problem in multi-agent systems (MAS). We derive the conditions for ensuring that every agent reaches consensus on a desired rate of the group's decision where the group decision value in its agent's initial statuses varies. Besides that, we investigate a nonlinear protocol sub-class of extreme DSQO (EDSQO) to reach a consensus for MAS to a common value with nonlinear low-complexity rules and fast time convergence if the interactions for each agent are not selfish. In addition, to extend the results to reach a consensus and to avoid the selfish case we specify a general class of DSQO for reaching a consensus under any given case of initial states. The case that MAS reach a consensus by DSQO is if each member of the agent group has positive interactions of DSQO (PDSQO) with the others. The convergence of both EDSQO and PDSQO classes is found to be directed towards the centre point. Finally, experimental simulations are given to support the analysis from theoretical aspect.

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…

Program Administrator's Handbook. Strategies for Preventing Alcohol and Other Drug Problems. The College Series.

ERIC Educational Resources Information Center

CSR, Inc., Washington, DC.

This handbook is for administrators of programs in higher education settings which deal with alcohol and other drug (AOD) related problems. Chapter 1, "Defining the Problem, Issues, and Trends" examines the problem from various perspectives and presents the latest statistics on the extent of AOD use on campuses, specific problems affecting…

Vagal activity is quadratically related to prosocial traits, prosocial emotions, and observer perceptions of prosociality.

PubMed

Kogan, Aleksandr; Oveis, Christopher; Carr, Evan W; Gruber, June; Mauss, Iris B; Shallcross, Amanda; Impett, Emily A; van der Lowe, Ilmo; Hui, Bryant; Cheng, Cecilia; Keltner, Dacher

2014-12-01

In the present article, we introduce the quadratic vagal activity-prosociality hypothesis, a theoretical framework for understanding the vagus nerve's involvement in prosociality. We argue that vagus nerve activity supports prosocial behavior by regulating physiological systems that enable emotional expression, empathy for others' mental and emotional states, the regulation of one's own distress, and the experience of positive emotions. However, we contend that extremely high levels of vagal activity can be detrimental to prosociality. We present 3 studies providing support for our model, finding consistent evidence of a quadratic relationship between respiratory sinus arrhythmia--the degree to which the vagus nerve modulates the heart rate--and prosociality. Individual differences in vagal activity were quadratically related to prosocial traits (Study 1), prosocial emotions (Study 2), and outside ratings of prosociality by complete strangers (Study 3). Thus, too much or too little vagal activity appears to be detrimental to prosociality. The present article provides the 1st theoretical and empirical account of the nonlinear relationship between vagal activity and prosociality.

Quadratic integrand double-hybrid made spin-component-scaled

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

Brémond, Éric, E-mail: eric.bremond@iit.it; Savarese, Marika; Sancho-García, Juan C.

2016-03-28

We propose two analytical expressions aiming to rationalize the spin-component-scaled (SCS) and spin-opposite-scaled (SOS) schemes for double-hybrid exchange-correlation density-functionals. Their performances are extensively tested within the framework of the nonempirical quadratic integrand double-hybrid (QIDH) model on energetic properties included into the very large GMTKN30 benchmark database, and on structural properties of semirigid medium-sized organic compounds. The SOS variant is revealed as a less computationally demanding alternative to reach the accuracy of the original QIDH model without losing any theoretical background.

The Current Often Implemented Fitness Tests in Physical Education Programs: Problems and Future Directions

ERIC Educational Resources Information Center

Keating, Xiaofen Deng

2003-01-01

This paper aims to examine current nationwide youth fitness test programs, address problems embedded in the programs, and possible solutions. The current Fitnessgram, President's Challenge, and YMCA youth fitness test programs were selected to represent nationwide youth fitness test programs. Sponsors of the nationwide youth fitness test programs…

Treating Conduct Problems and Strengthening Social and Emotional Competence in Young Children: The Dina Dinosaur Treatment Program.

ERIC Educational Resources Information Center

Webster-Stratton, Carolyn; Reid, M. Jamila

2003-01-01

This article describes the Dina Dinosaur Social, Emotional and Problem Solving Child Training Program for young children with conduct problems. The program emphasizes training children in skills such as emotional literacy, empathy or perspective taking, friendship and communication skills, anger management, interpersonal problem solving, and…

Exact solution for the optimal neuronal layout problem.

PubMed

Chklovskii, Dmitri B

2004-10-01

Evolution perfected brain design by maximizing its functionality while minimizing costs associated with building and maintaining it. Assumption that brain functionality is specified by neuronal connectivity, implemented by costly biological wiring, leads to the following optimal design problem. For a given neuronal connectivity, find a spatial layout of neurons that minimizes the wiring cost. Unfortunately, this problem is difficult to solve because the number of possible layouts is often astronomically large. We argue that the wiring cost may scale as wire length squared, reducing the optimal layout problem to a constrained minimization of a quadratic form. For biologically plausible constraints, this problem has exact analytical solutions, which give reasonable approximations to actual layouts in the brain. These solutions make the inverse problem of inferring neuronal connectivity from neuronal layout more tractable.

Quantum speedup in solving the maximal-clique problem

NASA Astrophysics Data System (ADS)

Chang, Weng-Long; Yu, Qi; Li, Zhaokai; Chen, Jiahui; Peng, Xinhua; Feng, Mang

2018-03-01

The maximal-clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from electrical engineering, computational chemistry, and bioinformatics to social networks. Here we develop a quantum algorithm to solve the maximal-clique problem for any graph G with n vertices with quadratic speedup over its classical counterparts, where the time and spatial complexities are reduced to, respectively, O (√{2n}) and O (n2) . With respect to oracle-related quantum algorithms for the NP-complete problems, we identify our algorithm as optimal. To justify the feasibility of the proposed quantum algorithm, we successfully solve a typical clique problem for a graph G with two vertices and one edge by carrying out a nuclear magnetic resonance experiment involving four qubits.

An implementation problem for boson fields and quantum Girsanov transform

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

Ji, Un Cig, E-mail: uncigji@chungbuk.ac.kr; Obata, Nobuaki, E-mail: obata@math.is.tohoku.ac.jp

2016-08-15

We study an implementation problem for quadratic functions of annihilation and creation operators on a boson field in terms of quantum white noise calculus. The implementation problem is shown to be equivalent to a linear differential equation for white noise operators containing quantum white noise derivatives. The solution is explicitly obtained and turns out to form a class of white noise operators including generalized Fourier–Gauss and Fourier–Mehler transforms, Bogoliubov transform, and a quantum extension of the Girsanov transform.

Solving Fractional Programming Problems based on Swarm Intelligence

NASA Astrophysics Data System (ADS)

Raouf, Osama Abdel; Hezam, Ibrahim M.

2014-04-01

This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to solve any type of FPPs. The solution results employing the SI algorithms are compared with a number of exact and metaheuristic solution methods used for handling FPPs. Swarm Intelligence can be denoted as an effective technique for solving linear or nonlinear, non-differentiable fractional objective functions. Problems with an optimal solution at a finite point and an unbounded constraint set, can be solved using the proposed approach. Numerical examples are given to show the feasibility, effectiveness, and robustness of the proposed algorithm. The results obtained using the two SI algorithms revealed the superiority of the proposed technique among others in computational time. A better accuracy was remarkably observed in the solution results of the industrial application problems.

Status of training programs and perceived labor problems in four types of noncommercial foodservice operations.

PubMed

Cluskey, M; Messersmith, A M

1991-10-01

Training is essential for the effective delivery of quality foodservice products. A well-developed training program is ongoing, comprehensive, planned in advance, and performance based. Such programs facilitate performance and may be beneficial to develop employees and reduce employee turnover rates. The purpose of this study was to investigate the kinds of training programs that are being developed and delivered to employees in noncommercial foodservice operations. A survey instrument was mailed nationally to foodservice directors and administrators in health care and educational foodservice operations requesting information about training programs used for their nonsupervisory foodservice employees. Information regarding perceived existence of potential labor problems was also collected. Relationships between training programs and perception of labor problems were investigated. Training appears to be conducted in some form within the four types of noncommercial foodservice operations investigated. The most severely perceived labor problems among nonsupervisory employees include low motivation, lack of skills, and poor promotability.

Dynamical correlation functions of the quadratic coupling spin-Boson model

NASA Astrophysics Data System (ADS)

Zheng, Da-Chuan; Tong, Ning-Hua

2017-06-01

The spin-boson model with quadratic coupling is studied using the bosonic numerical renormalization group method. We focus on the dynamical auto-correlation functions {C}O(ω ), with the operator \\hat{O} taken as {\\hat{{{σ }}}}x, {\\hat{{{σ }}}}z, and \\hat{X}, respectively. In the weak-coupling regime α < {α }{{c}}, these functions show power law ω-dependence in the small frequency limit, with the powers 1+2s, 1+2s, and s, respectively. At the critical point α ={α }{{c}} of the boson-unstable quantum phase transition, the critical exponents y O of these correlation functions are obtained as {y}{{{σ }}x}={y}{{{σ }}z}=1-2s and {y}X=-s, respectively. Here s is the bath index and X is the boson displacement operator. Close to the spin flip point, the high frequency peak of {C}{{{σ }}x}(ω ) is broadened significantly and the line shape changes qualitatively, showing enhanced dephasing at the spin flip point. Project supported by the National Key Basic Research Program of China (Grant No. 2012CB921704), the National Natural Science Foundation of China (Grant No. 11374362), the Fundamental Research Funds for the Central Universities, China, and the Research Funds of Renmin University of China (Grant No. 15XNLQ03).

Mapping the absolute magnetic field and evaluating the quadratic Zeeman-effect-induced systematic error in an atom interferometer gravimeter

NASA Astrophysics Data System (ADS)

Hu, Qing-Qing; Freier, Christian; Leykauf, Bastian; Schkolnik, Vladimir; Yang, Jun; Krutzik, Markus; Peters, Achim

2017-09-01

Precisely evaluating the systematic error induced by the quadratic Zeeman effect is important for developing atom interferometer gravimeters aiming at an accuracy in the μ Gal regime (1 μ Gal =10-8m /s2 ≈10-9g ). This paper reports on the experimental investigation of Raman spectroscopy-based magnetic field measurements and the evaluation of the systematic error in the gravimetric atom interferometer (GAIN) due to quadratic Zeeman effect. We discuss Raman duration and frequency step-size-dependent magnetic field measurement uncertainty, present vector light shift and tensor light shift induced magnetic field measurement offset, and map the absolute magnetic field inside the interferometer chamber of GAIN with an uncertainty of 0.72 nT and a spatial resolution of 12.8 mm. We evaluate the quadratic Zeeman-effect-induced gravity measurement error in GAIN as 2.04 μ Gal . The methods shown in this paper are important for precisely mapping the absolute magnetic field in vacuum and reducing the quadratic Zeeman-effect-induced systematic error in Raman transition-based precision measurements, such as atomic interferometer gravimeters.

Observational constraints on cosmological models with Chaplygin gas and quadratic equation of state

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

Sharov, G.S., E-mail: german.sharov@mail.ru

Observational manifestations of accelerated expansion of the universe, in particular, recent data for Type Ia supernovae, baryon acoustic oscillations, for the Hubble parameter H ( z ) and cosmic microwave background constraints are described with different cosmological models. We compare the ΛCDM, the models with generalized and modified Chaplygin gas and the model with quadratic equation of state. For these models we estimate optimal model parameters and their permissible errors with different approaches to calculation of sound horizon scale r {sub s} ( z {sub d} ). Among the considered models the best value of χ{sup 2} is achieved formore » the model with quadratic equation of state, but it has 2 additional parameters in comparison with the ΛCDM and therefore is not favored by the Akaike information criterion.« less

About the mechanism of ERP-system pilot test

NASA Astrophysics Data System (ADS)

Mitkov, V. V.; Zimin, V. V.

2018-05-01

In the paper the mathematical problem of defining the scope of pilot test is stated, which is a task of quadratic programming. The procedure of the problem solving includes the method of network programming based on the structurally similar network representation of the criterion and constraints and which reduces the original problem to a sequence of simpler evaluation tasks. The evaluation tasks are solved by the method of dichotomous programming.

A Mixed-Integer Linear Programming Problem which is Efficiently Solvable.

DTIC Science & Technology

1987-10-01

INTEGER LINEAR PROGRAMMING PROBLEM WHICH IS EFFICIENTLY SOLVABLE 12. PERSONAL AUTHOR(S) Leiserson, Charles, and Saxe, James B. 13a. TYPE OF REPORT j13b TIME...ger prongramn rg versions or the problem is not ac’hievable in genieral for sparse inistancves of’ P rolem(r Mi. Th le remrai nder or thris paper is...rClazes c:oIh edge (i,I*) by comlpli urg +- rnirr(z 3, ,x + a,j). A sirnI) le analysis (11 vto Nei [131 indicates why whe Iellinan-Ford algorithm works

Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems

NASA Astrophysics Data System (ADS)

Takabe, Satoshi; Hukushima, Koji

2016-05-01

Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α -uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α =2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c =e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c =1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α ≥3 , minimum vertex covers on α -uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c =e /(α -1 ) where the replica symmetry is broken.

Statistical mechanical analysis of linear programming relaxation for combinatorial optimization problems.

PubMed

Takabe, Satoshi; Hukushima, Koji

2016-05-01

Typical behavior of the linear programming (LP) problem is studied as a relaxation of the minimum vertex cover (min-VC), a type of integer programming (IP) problem. A lattice-gas model on the Erdös-Rényi random graphs of α-uniform hyperedges is proposed to express both the LP and IP problems of the min-VC in the common statistical mechanical model with a one-parameter family. Statistical mechanical analyses reveal for α=2 that the LP optimal solution is typically equal to that given by the IP below the critical average degree c=e in the thermodynamic limit. The critical threshold for good accuracy of the relaxation extends the mathematical result c=1 and coincides with the replica symmetry-breaking threshold of the IP. The LP relaxation for the minimum hitting sets with α≥3, minimum vertex covers on α-uniform random graphs, is also studied. Analytic and numerical results strongly suggest that the LP relaxation fails to estimate optimal values above the critical average degree c=e/(α-1) where the replica symmetry is broken.

An optical solution for the traveling salesman problem.

PubMed

Haist, Tobias; Osten, Wolfgang

2007-08-06

We introduce an optical method based on white light interferometry in order to solve the well-known NP-complete traveling salesman problem. To our knowledge it is the first time that a method for the reduction of non-polynomial time to quadratic time has been proposed. We will show that this achievement is limited by the number of available photons for solving the problem. It will turn out that this number of photons is proportional to N(N) for a traveling salesman problem with N cities and that for large numbers of cities the method in practice therefore is limited by the signal-to-noise ratio. The proposed method is meant purely as a gedankenexperiment.

Computation and analysis for a constrained entropy optimization problem in finance

NASA Astrophysics Data System (ADS)

He, Changhong; Coleman, Thomas F.; Li, Yuying

2008-12-01

In [T. Coleman, C. He, Y. Li, Calibrating volatility function bounds for an uncertain volatility model, Journal of Computational Finance (2006) (submitted for publication)], an entropy minimization formulation has been proposed to calibrate an uncertain volatility option pricing model (UVM) from market bid and ask prices. To avoid potential infeasibility due to numerical error, a quadratic penalty function approach is applied. In this paper, we show that the solution to the quadratic penalty problem can be obtained by minimizing an objective function which can be evaluated via solving a Hamilton-Jacobian-Bellman (HJB) equation. We prove that the implicit finite difference solution of this HJB equation converges to its viscosity solution. In addition, we provide computational examples illustrating accuracy of calibration.

Interactive program for analysis and design problems in advanced composites technology

NASA Technical Reports Server (NTRS)

Cruse, T. A.; Swedlow, J. L.

1971-01-01

During the past year an experimental program in the fracture of advanced fiber composites has been completed. The experimental program has given direction to additional experimental and theoretical work. A synthesis program for designing low weight multifastener joints in composites is proposed, based on extensive analytical background. A number of failed joints have been thoroughly analyzed to evaluate the failure hypothesis used in the synthesis procedure. Finally, a new solution is reported for isotropic and anisotropic laminates using the boundary-integral method. The solution method offers significant savings of computer core and time for important problems.

Rigorous Numerical Study of Low-Period Windows for the Quadratic Map

NASA Astrophysics Data System (ADS)

Galias, Zbigniew

An efficient method to find all low-period windows for the quadratic map is proposed. The method is used to obtain very accurate rigorous bounds of positions of all periodic windows with periods p ≤ 32. The contribution of period-doubling windows on the total width of periodic windows is discussed. Properties of periodic windows are studied numerically.

Differentiated Learning Environment--A Classroom for Quadratic Equation, Function and Graphs

ERIC Educational Resources Information Center

Dinç, Emre

2017-01-01

This paper will cover the design of a learning environment as a classroom regarding the Quadratic Equations, Functions and Graphs. The goal of the learning environment offered in the paper is to design a classroom where students will enjoy the process, use their skills they already have during the learning process, control and plan their learning…

Differentiation of Students' Reasoning on Linear and Quadratic Geometric Number Patterns

ERIC Educational Resources Information Center

Lin, Fou-Lai; Yang, Kai-Lin

2004-01-01

There are two purposes in this study. One is to compare how 7th and 8th graders reason on linear and quadratic geometric number patterns when they have not learned this kind of tasks in school. The other is to explore the hierarchical relations among the four components of reasoning on geometric number patterns: understanding, generalizing,…

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.

Fractional Programming for Communication Systems—Part I: Power Control and Beamforming

NASA Astrophysics Data System (ADS)

Shen, Kaiming; Yu, Wei

2018-05-01

This two-part paper explores the use of FP in the design and optimization of communication systems. Part I of this paper focuses on FP theory and on solving continuous problems. The main theoretical contribution is a novel quadratic transform technique for tackling the multiple-ratio concave-convex FP problem--in contrast to conventional FP techniques that mostly can only deal with the single-ratio or the max-min-ratio case. Multiple-ratio FP problems are important for the optimization of communication networks, because system-level design often involves multiple signal-to-interference-plus-noise ratio terms. This paper considers the applications of FP to solving continuous problems in communication system design, particularly for power control, beamforming, and energy efficiency maximization. These application cases illustrate that the proposed quadratic transform can greatly facilitate the optimization involving ratios by recasting the original nonconvex problem as a sequence of convex problems. This FP-based problem reformulation gives rise to an efficient iterative optimization algorithm with provable convergence to a stationary point. The paper further demonstrates close connections between the proposed FP approach and other well-known algorithms in the literature, such as the fixed-point iteration and the weighted minimum mean-square-error beamforming. The optimization of discrete problems is discussed in Part II of this paper.

Interactive computerized learning program exposes veterinary students to challenging international animal-health problems.

PubMed

Conrad, Patricia A; Hird, Dave; Arzt, Jonathan; Hayes, Rick H; Magliano, Dave; Kasper, Janine; Morfin, Saul; Pinney, Stephen

2007-01-01

This article describes a computerized case-based CD-ROM (CD) on international animal health that was developed to give veterinary students an opportunity to "virtually" work alongside veterinarians and other veterinary students as they try to solve challenging disease problems relating to tuberculosis in South African wildlife, bovine abortion in Mexico, and neurologic disease in horses in Rapa Nui, Chile. Each of the three case modules presents, in a highly interactive format, a problem or mystery that must be solved by the learner. As well as acquiring information via video clips and text about the specific health problem, learners obtain information about the different countries, animal-management practices, diagnostic methods, related disease-control issues, economic factors, and the opinions of local experts. After assimilating this information, the learner must define the problem and formulate an action plan or make a recommendation or diagnosis. The computerized program invokes three principles of adult education: active learning, learner-centered education, and experiential learning. A medium that invokes these principles is a potentially efficient learning tool and template for developing other case-based problem-solving computerized programs. The program is accessible on the World Wide Web at . A broadband Internet connection is recommended, since the modules make extensive use of embedded video and audio clips. Information on how to obtain the CD is also provided.

A hybrid computer program for rapidly solving flowing or static chemical kinetic problems involving many chemical species

NASA Technical Reports Server (NTRS)

Mclain, A. G.; Rao, C. S. R.

1976-01-01

A hybrid chemical kinetic computer program was assembled which provides a rapid solution to problems involving flowing or static, chemically reacting, gas mixtures. The computer program uses existing subroutines for problem setup, initialization, and preliminary calculations and incorporates a stiff ordinary differential equation solution technique. A number of check cases were recomputed with the hybrid program and the results were almost identical to those previously obtained. The computational time saving was demonstrated with a propane-oxygen-argon shock tube combustion problem involving 31 chemical species and 64 reactions. Information is presented to enable potential users to prepare an input data deck for the calculation of a problem.

Soliton compression to few-cycle pulses with a high quality factor by engineering cascaded quadratic nonlinearities.

PubMed

Zeng, Xianglong; Guo, Hairun; Zhou, Binbin; Bache, Morten

2012-11-19

We propose an efficient approach to improve few-cycle soliton compression with cascaded quadratic nonlinearities by using an engineered multi-section structure of the nonlinear crystal. By exploiting engineering of the cascaded quadratic nonlinearities, in each section soliton compression with a low effective order is realized, and high-quality few-cycle pulses with large compression factors are feasible. Each subsequent section is designed so that the compressed pulse exiting the previous section experiences an overall effective self-defocusing cubic nonlinearity corresponding to a modest soliton order, which is kept larger than unity to ensure further compression. This is done by increasing the cascaded quadratic nonlinearity in the new section with an engineered reduced residual phase mismatch. The low soliton orders in each section ensure excellent pulse quality and high efficiency. Numerical results show that compressed pulses with less than three-cycle duration can be achieved even when the compression factor is very large, and in contrast to standard soliton compression, these compressed pulses have minimal pedestal and high quality factor.

A Kind of Nonlinear Programming Problem Based on Mixed Fuzzy Relation Equations Constraints

NASA Astrophysics Data System (ADS)

Li, Jinquan; Feng, Shuang; Mi, Honghai

In this work, a kind of nonlinear programming problem with non-differential objective function and under the constraints expressed by a system of mixed fuzzy relation equations is investigated. First, some properties of this kind of optimization problem are obtained. Then, a polynomial-time algorithm for this kind of optimization problem is proposed based on these properties. Furthermore, we show that this algorithm is optimal for the considered optimization problem in this paper. Finally, numerical examples are provided to illustrate our algorithms.

The application of quadratic optimal cooperative control synthesis to a CH-47 helicopter

NASA Technical Reports Server (NTRS)

Townsend, Barbara K.

1987-01-01

A control-system design method, quadratic optimal cooperative control synthesis (CCS), is applied to the design of a stability and control augmentation system (SCAS). The CCS design method is different from other design methods in that it does not require detailed a priori design criteria, but instead relies on an explicit optimal pilot-model to create desired performance. The design method, which was developed previously for fixed-wing aircraft, is simplified and modified for application to a Boeing CH-47 helicopter. Two SCAS designs are developed using the CCS design methodology. The resulting CCS designs are then compared with designs obtained using classical/frequency-domain methods and linear quadratic regulator (LQR) theory in a piloted fixed-base simulation. Results indicate that the CCS method, with slight modifications, can be used to produce controller designs which compare favorably with the frequency-domain approach.

The application of quadratic optimal cooperative control synthesis to a CH-47 helicopter

NASA Technical Reports Server (NTRS)

Townsend, Barbara K.

1986-01-01

A control-system design method, Quadratic Optimal Cooperative Control Synthesis (CCS), is applied to the design of a Stability and Control Augmentation Systems (SCAS). The CCS design method is different from other design methods in that it does not require detailed a priori design criteria, but instead relies on an explicit optimal pilot-model to create desired performance. The design model, which was developed previously for fixed-wing aircraft, is simplified and modified for application to a Boeing Vertol CH-47 helicopter. Two SCAS designs are developed using the CCS design methodology. The resulting CCS designs are then compared with designs obtained using classical/frequency-domain methods and Linear Quadratic Regulator (LQR) theory in a piloted fixed-base simulation. Results indicate that the CCS method, with slight modifications, can be used to produce controller designs which compare favorably with the frequency-domain approach.

Quadratic genetic modifications: a streamlined route to cosmological simulations with controlled merger history

NASA Astrophysics Data System (ADS)

Rey, Martin P.; Pontzen, Andrew

2018-02-01

Recent work has studied the interplay between a galaxy's history and its observable properties using `genetically modified' cosmological zoom simulations. The approach systematically generates alternative histories for a halo, while keeping its cosmological environment fixed. Applications to date altered linear properties of the initial conditions, such as the mean overdensity of specified regions; we extend the formulation to include quadratic features, such as local variance, that determines the overall importance of smooth accretion relative to mergers in a galaxy's history. We introduce an efficient algorithm for this new class of modification and demonstrate its ability to control the variance of a region in a one-dimensional toy model. Outcomes of this work are twofold: (i) a clarification of the formulation of genetic modifications and (ii) a proof of concept for quadratic modifications leading the way to a forthcoming implementation in cosmological simulations.

An Achievement Degree Analysis Approach to Identifying Learning Problems in Object-Oriented Programming

ERIC Educational Resources Information Center

Allinjawi, Arwa A.; Al-Nuaim, Hana A.; Krause, Paul

2014-01-01

Students often face difficulties while learning object-oriented programming (OOP) concepts. Many papers have presented various assessment methods for diagnosing learning problems to improve the teaching of programming in computer science (CS) higher education. The research presented in this article illustrates that although max-min composition is…

The problem of the driverless vehicle specified path stability control

NASA Astrophysics Data System (ADS)

Buznikov, S. E.; Endachev, D. V.; Elkin, D. S.; Strukov, V. O.

2018-02-01

Currently the effort of many leading foreign companies is focused on creation of driverless transport for transportation of cargo and passengers. Among many practical problems arising while creating driverless vehicles, the problem of the specified path stability control occupies a central place. The purpose of this paper is formalization of the problem in question in terms of the quadratic functional of the control quality, the comparative analysis of the possible solutions and justification of the choice of the optimum technical solution. As square value of the integral of the deviation from the specified path is proposed as the quadratic functional of the control quality. For generation of the set of software and hardware solution variants the Zwicky “morphological box” method is used within the hardware and software environments. The heading control algorithms use the wheel steering angle data and the deviation from the lane centerline (specified path) calculated based on the navigation data and the data from the video system. Where the video system does not detect the road marking, the control is carried out based on the wheel navigation system data and where recognizable road marking exits - based on to the video system data. The analysis of the test results allows making the conclusion that the application of the combined navigation system algorithms that provide quasi-optimum solution of the problem while meeting the strict functional limits for the technical and economic indicators of the driverless vehicle control system under development is effective.

A tutorial on the LQG/LTR method. [Linear Quadratic Gaussian/Loop Transfer Recovery

NASA Technical Reports Server (NTRS)

Athans, M.

1986-01-01

In this paper the so-called Linear-Quadratic-Gaussian method with Loop-Transfer-Recovery is surveyed. The objective is to provide a pragmatic exposition, with special emphasis on the step-by-step characteristics for designing multivariable feedback control systems.

A bivariate rational interpolation with a bi-quadratic denominator

NASA Astrophysics Data System (ADS)

Duan, Qi; Zhang, Huanling; Liu, Aikui; Li, Huaigu

2006-10-01

In this paper a new rational interpolation with a bi-quadratic denominator is developed to create a space surface using only values of the function being interpolated. The interpolation function has a simple and explicit rational mathematical representation. When the knots are equally spaced, the interpolating function can be expressed in matrix form, and this form has a symmetric property. The concept of integral weights coefficients of the interpolation is given, which describes the "weight" of the interpolation points in the local interpolating region.

Primal Barrier Methods for Linear Programming

DTIC Science & Technology

1989-06-01

A Theoretical Bound Concerning the difficulties introduced by an ill-conditioned H- 1, Dikin [Dik67] and Stewart [Stew87] show for a full-rank A...Dik67] I. I. Dikin (1967). Iterative solution of problems of linear and quadratic pro- gramming, Doklady Akademii Nauk SSSR, Tom 174, No. 4. [Fia79] A. V

Quantum speedup of the traveling-salesman problem for bounded-degree graphs

NASA Astrophysics Data System (ADS)

Moylett, Dominic J.; Linden, Noah; Montanaro, Ashley

2017-03-01

The traveling-salesman problem is one of the most famous problems in graph theory. However, little is currently known about the extent to which quantum computers could speed up algorithms for the problem. In this paper, we prove a quadratic quantum speedup when the degree of each vertex is at most 3 by applying a quantum backtracking algorithm to a classical algorithm by Xiao and Nagamochi. We then use similar techniques to accelerate a classical algorithm for when the degree of each vertex is at most 4, before speeding up higher-degree graphs via reductions to these instances.

A multiple-drawer medication layout problem in automated dispensing cabinets.

PubMed

Pazour, Jennifer A; Meller, Russell D

2012-12-01

In this paper we investigate the problem of locating medications in automated dispensing cabinets (ADCs) to minimize human selection errors. We formulate the multiple-drawer medication layout problem and show that the problem can be formulated as a quadratic assignment problem. As a way to evaluate various medication layouts, we develop a similarity rating for medication pairs. To solve industry-sized problem instances, we develop a heuristic approach. We use hospital ADC transaction data to conduct a computational experiment to test the performance of our developed heuristics, to demonstrate how our approach can aid in ADC design trade-offs, and to illustrate the potential improvements that can be made when applying an analytical process to the multiple-drawer medication layout problem. Finally, we present conclusions and future research directions.

Frequency-independent approach to calculate physical optics radiations with the quadratic concave phase variations

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

Wu, Yu Mao, E-mail: yumaowu@fudan.edu.cn; Teng, Si Jia, E-mail: sjteng12@fudan.edu.cn

In this work, we develop the numerical steepest descent path (NSDP) method to calculate the physical optics (PO) radiations with the quadratic concave phase variations. With the surface integral equation method, the physical optics (PO) scattered fields are formulated and further reduced to the surface integrals. The high frequency physical critical points contributions, including the stationary phase points, the boundary resonance points and the vertex points are comprehensively studied via the proposed NSDP method. The key contributions of this work are twofold. One is that together with the PO integrals taking the quadratic parabolic and hyperbolic phase terms, this workmore » makes the NSDP theory be complete for treating the PO integrals with quadratic phase variations. Another is that, in order to illustrate the transition effect of the high frequency physical critical points, in this work, we consider and further extend the NSDP method to calculate the PO integrals with the coalescence of the high frequency critical points. Numerical results for the highly oscillatory PO integral with the coalescence of the critical points are given to verify the efficiency of the proposed NSDP method. The NSDP method could achieve the frequency independent computational workload and error controllable accuracy in all the numerical experiments, especially for the case of the coalescence of the high frequency critical points.« less

Graphical Description of Johnson-Neyman Outcomes for Linear and Quadratic Regression Surfaces.

ERIC Educational Resources Information Center

Schafer, William D.; Wang, Yuh-Yin

A modification of the usual graphical representation of heterogeneous regressions is described that can aid in interpreting significant regions for linear or quadratic surfaces. The standard Johnson-Neyman graph is a bivariate plot with the criterion variable on the ordinate and the predictor variable on the abscissa. Regression surfaces are drawn…

California's program: Indoor air problems aren't amenable to regulation

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

Wesolowski, J.

In 1982, California's legislature established an Indoor Air Quality Program (CIAQP) in the Department of Health Services to carry out research on the nature and extent of the indoor air problem (excluding industrial worksites), to find appropriate mitigation measures, and to promote and coordinate the efforts of other state agencies. Since indoor air problems usually are not amenable to regulatory solutions, regulatory authority was not included in the mandate. The program conducts research into a wide range of contaminants--radon, asbestos, formaldehyde, carbon monoxide, volatile organic compounds, environmental tobacco smoke (ETS), as well as into biological aerosols that cause such diseasesmore » as Legionnaires disease, tuberculosis, allergies, and asthma. Studies are also carried out to better understand the Sick Building Syndrome. The research includes field surveys to determine the exposure of the population to specific contaminants and experiments in the laboratory to develop protocols for reducing exposures. The research emphasizes measurement of exposure--concentration multiplied by the time a person is exposed--as opposed to measurement of concentration only.« less

Dynamic Programming for Structured Continuous Markov Decision Problems

NASA Technical Reports Server (NTRS)

Dearden, Richard; Meuleau, Nicholas; Washington, Richard; Feng, Zhengzhu

2004-01-01

We describe an approach for exploiting structure in Markov Decision Processes with continuous state variables. At each step of the dynamic programming, the state space is dynamically partitioned into regions where the value function is the same throughout the region. We first describe the algorithm for piecewise constant representations. We then extend it to piecewise linear representations, using techniques from POMDPs to represent and reason about linear surfaces efficiently. We show that for complex, structured problems, our approach exploits the natural structure so that optimal solutions can be computed efficiently.

Replicator equations, maximal cliques, and graph isomorphism.

PubMed

Pelillo, M

1999-11-15

We present a new energy-minimization framework for the graph isomorphism problem that is based on an equivalent maximum clique formulation. The approach is centered around a fundamental result proved by Motzkin and Straus in the mid-1960s, and recently expanded in various ways, which allows us to formulate the maximum clique problem in terms of a standard quadratic program. The attractive feature of this formulation is that a clear one-to-one correspondence exists between the solutions of the quadratic program and those in the original, combinatorial problem. To solve the program we use the so-called replicator equations--a class of straightforward continuous- and discrete-time dynamical systems developed in various branches of theoretical biology. We show how, despite their inherent inability to escape from local solutions, they nevertheless provide experimental results that are competitive with those obtained using more elaborate mean-field annealing heuristics.

An Analysis of Problems in College Students' Participation in the Western China Program

ERIC Educational Resources Information Center

Yumei, Yi

2008-01-01

Since its initiation in 2003, the College Student Western China Program has had several satisfying achievements. At the same time, however, problems exist in the project. This article gives a brief analysis of problems encountered in the project from the aspects of publicity and campaign work, plans and schedules, student participation, voluntary…

Towards a unifying approach to diversity measures: bridging the gap between the Shannon entropy and Rao's quadratic index.

PubMed

Ricotta, Carlo; Szeidl, Laszlo

2006-11-01

The diversity of a species assemblage has been studied extensively for many decades in relation to its possible connection with ecosystem functioning and organization. In this view most diversity measures, such as Shannon's entropy, rely upon information theory as a basis for the quantification of diversity. Also, traditional diversity measures are computed using species relative abundances and cannot account for the ecological differences between species. Rao first proposed a diversity index, termed quadratic diversity (Q) that incorporates both species relative abundances and pairwise distances between species. Quadratic diversity is traditionally defined as the expected distance between two randomly selected individuals. In this paper, we show that quadratic diversity can be interpreted as the expected conflict among the species of a given assemblage. From this unusual interpretation, it naturally follows that Rao's Q can be related to the Shannon entropy through a generalized version of the Tsallis parametric entropy.

Frontogenesis driven by horizontally quadratic distributions of density

NASA Technical Reports Server (NTRS)

Jacqmin, David

1991-01-01

Attention is given to the quadratic density distribution in a channel, which has been established by Simpson and Linden to be the simplest case of the horizontally nonlinear distribution of fluid density required for the production of frontogenesis. The porous-media and Boussinesq flow models are examined, and their evolution equations are reduced to one-dimensional systems. While both the porous-media and the inviscid/nondiffusive Boussinesq systems exhibit classic frontogenesis behavior, the viscous Boussinesq system exhibits a more complex behavior: boundary-layer effects force frontogenesis away from the lower boundary, and at late times the steepest density gradients are close to mid-channel.

Uniform sparse bounds for discrete quadratic phase Hilbert transforms

NASA Astrophysics Data System (ADS)

Kesler, Robert; Arias, Darío Mena

2017-09-01

For each α \\in T consider the discrete quadratic phase Hilbert transform acting on finitely supported functions f : Z → C according to H^{α }f(n):= \\sum _{m ≠ 0} e^{iα m^2} f(n - m)/m. We prove that, uniformly in α \\in T , there is a sparse bound for the bilinear form < H^{α } f , g > for every pair of finitely supported functions f,g : Z→ C . The sparse bound implies several mapping properties such as weighted inequalities in an intersection of Muckenhoupt and reverse Hölder classes.

Analysis of Learning Behavior in a Flipped Programing Classroom Adopting Problem-Solving Strategies

ERIC Educational Resources Information Center

Chiang, Tosti Hsu-Cheng

2017-01-01

Programing is difficult for beginners because they need to learn the new language of computers. Developing software, especially complex software, is bound to result in problems, frustration, and the need to think in new ways. Identifying the learning behavior behind programing by way of empirical studies can help beginners learn more easily. In…

A quasi-Newton approach to optimization problems with probability density constraints. [problem solving in mathematical programming

NASA Technical Reports Server (NTRS)

Tapia, R. A.; Vanrooy, D. L.

1976-01-01

A quasi-Newton method is presented for minimizing a nonlinear function while constraining the variables to be nonnegative and sum to one. The nonnegativity constraints were eliminated by working with the squares of the variables and the resulting problem was solved using Tapia's general theory of quasi-Newton methods for constrained optimization. A user's guide for a computer program implementing this algorithm is provided.

Fuzzy bi-objective linear programming for portfolio selection problem with magnitude ranking function

NASA Astrophysics Data System (ADS)

Kusumawati, Rosita; Subekti, Retno

2017-04-01

Fuzzy bi-objective linear programming (FBOLP) model is bi-objective linear programming model in fuzzy number set where the coefficients of the equations are fuzzy number. This model is proposed to solve portfolio selection problem which generate an asset portfolio with the lowest risk and the highest expected return. FBOLP model with normal fuzzy numbers for risk and expected return of stocks is transformed into linear programming (LP) model using magnitude ranking function.

Problems and limitations of voluntary cleanup programs

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

Johnson, S.F.

1995-12-31

At least a dozen states have already implemented voluntary cleanup programs (VCPs). Provisions to promote state VCPs were prominent in the EPA`s 1994 proposed revisions to CERCLA and in current legislative initiatives. Under the VCP, property owners voluntarily enroll to investigate and remediate contaminated sites with the aegis of a state agency and thus avoid involvement with the federal Superfund program. When the state agency is satisfied with the condition of the site, it issues a certificate to the owner. The VCP is meant to mitigate unintended consequences of CERCLA such as the economic abandonment of urban industrial sites inmore » favor of unpolluted suburban sites. The VCP concept has been combined with other reforms including cleanup standards, financial incentives, and independent action. The effectiveness of voluntary cleanup programs is limited by the costs of investigation and cleanup relative to the value of the property in question. It is also limited when property has environmental problems outside the traditional focus of state Superfund agencies on soil and groundwater contamination. VCPs also have potential unintended consequences of their own. The VCP concept is consistent with a 15 year trend of increasing government attention and involvement with sites of diminishing health and environmental significance. VCP may reinforce the perception of liability and unwittingly raise the standard of due diligence in property assessments, especially if combined with generic cleanup standard.« less

Analysis of problem solving on project based learning with resource based learning approach computer-aided program

NASA Astrophysics Data System (ADS)

Kuncoro, K. S.; Junaedi, I.; Dwijanto

2018-03-01

This study aimed to reveal the effectiveness of Project Based Learning with Resource Based Learning approach computer-aided program and analyzed problem-solving abilities in terms of problem-solving steps based on Polya stages. The research method used was mixed method with sequential explanatory design. The subject of this research was the students of math semester 4. The results showed that the S-TPS (Strong Top Problem Solving) and W-TPS (Weak Top Problem Solving) had good problem-solving abilities in each problem-solving indicator. The problem-solving ability of S-MPS (Strong Middle Problem Solving) and (Weak Middle Problem Solving) in each indicator was good. The subject of S-BPS (Strong Bottom Problem Solving) had a difficulty in solving the problem with computer program, less precise in writing the final conclusion and could not reflect the problem-solving process using Polya’s step. While the Subject of W-BPS (Weak Bottom Problem Solving) had not been able to meet almost all the indicators of problem-solving. The subject of W-BPS could not precisely made the initial table of completion so that the completion phase with Polya’s step was constrained.

Computers Are for Kids: Designing Software Programs to Avoid Problems of Learning.

ERIC Educational Resources Information Center

Grimes, Lynn

1981-01-01

Procedures for programing computers to deal with handicapped students, problems in selective attention, visual discrimination, reaction time differences, short term memory, transfer and generalization, recognition of mistakes, and social skills are discussed. (CL)

s-Ordered Exponential of Quadratic Forms Gained via IWSOP Technique

NASA Astrophysics Data System (ADS)

Bazrafkan, M. R.; Shähandeh, F.; Nahvifard, E.

2012-11-01

Using the generalized bar{s}-ordered Wigner operator, in which bar{s} is a vector over the field of complex numbers, the technique of integration within an s-ordered product of operators (IWSOP) has been extended to multimode case. We derive the bar{s}-ordered form of the widely applicable multimode exponential of quadratic form exp\\{sum_{i,j = 1}n ai^{dag}\\varLambda_{ij}{aj}\\} , each mode being in some particular order s i , applying this method.

INTRODUCTION OF UNIVERSAL HEALTH PROGRAM IN GEORGIA: PROBLEMS AND PERSPECTIVES.

PubMed

Verulava, T; Jorbenadze, R; Barkalaia, T

2017-01-01

Since 2013, Georgia enacted Universal Healthcare (UHC) program. Inclusion of uninsured population in the UHC program will have a positive impact on their financial accessibility to the health services. The study aims to analyze the referral rate of the beneficiaries to the health service providers before introduction and after application of the UHC program, particularly, how much it increased the recently uninsured population referral to primary health care units, and also to study the level of satisfaction with the UHC program. Research was conducted by qualitative and quantitative methods. The target groups' (program beneficiaries, physicians, personnel of the Social Service Agency) opinions were identified by means of face-to-face interviews. Enactment of the UHC programs significantly raised the population refferal to the family physicians, and the specialists. Insignificantly, but also increased the frequency of laboratory and diagnostic services. Despite the serious positive changes caused by UHC program implementation there still remain the problems in the primary healthcare system. Also, it is desirable to raise the financial availability of those medical services, which may cause catastrophic costs. In this respect, such medical services must be involved in the universal healthcare program and been expanded their scale. For the purpose of effective usage of the limited funds allocated for health care services provision, the private health insurance companies should be involved in UHC programs. This, together with the reduction of health care costs will increase a competition in the medical market, and enhance the quality of health service.

The Effect of TMPT Program on Pre-School Children's Social Problem Solving Skills

ERIC Educational Resources Information Center

Gur, Cagla; Kocak, Nurcan

2018-01-01

Purpose: Starting Thinking Training at an early age is important. However, few studies were found regarding Thinking Training programs for pre-school children and the contributions of these programs to children's social problem-solving. In this context, the TMPT Program was developed for pre-school children and the effect of the program on 5-6…

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

DTIC Science & Technology

2012-02-09

1nclud1ng suggestions for reduc1ng the burden. to the Department of Defense. ExecutiVe Serv1ce D>rectorate (0704-0188) Respondents should be aware...benchmark problem we contacted Bertrand LeCun who in their poject CHOC from 2005-2008 had applied their parallel B&B framework BOB++ to the RLT1

Failures and Inabilities of High School Students about Quadratic Equations and Functions

ERIC Educational Resources Information Center

Memnun, Dilek Sezgin; Aydin, Bünyamin; Dinç, Emre; Çoban, Merve; Sevindik, Fatma

2015-01-01

In this research study, it was aimed to examine failures and inabilities of eleventh grade students about quadratic equations and functions. For this purpose, these students were asked ten open-ended questions. The analysis of the answers given by the students to these questions indicated that a significant part of these students had failures and…

Accuracy of quadrat sampling in studying forest reproduction on cut-over areas

Treesearch

I. T. Haig

1929-01-01

The quadrat method, first introduced into ecological studies by Pound and Clements in i898, has been adopted by both foresters and ecologists as one of the most accurate means of studying the occurrence, distribution, and development of vegetation (Clements, '05; Weaver, '18). This method is unquestionably more precise than the descriptive method which it...

Brief note on Ashtekar-Magnon-Das conserved quantities in quadratic curvature theories

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

Pang Yi

2011-04-15

In this note, we correct a mistake in the mass formula in [N. Okuyama and J. i. Koga, Phys. Rev. D 71, 084009 (2005).] which generalizes the Ashtekar-Magnon-Das method to incorporate extended gravities with quadratic curvature terms. The corrected mass formula confirms that the black hole masses for recently discovered critical gravities vanish.

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.

The Existence of Periodic Orbits and Invariant Tori for Some 3-Dimensional Quadratic Systems

PubMed Central

Jiang, Yanan; Han, Maoan; Xiao, Dongmei

2014-01-01

We use the normal form theory, averaging method, and integral manifold theorem to study the existence of limit cycles in Lotka-Volterra systems and the existence of invariant tori in quadratic systems in ℝ3. PMID:24982980

Problems Impacting Extension Program Quality at the County Level: Results from an Analysis of County Program Reviews Conducted in Florida

ERIC Educational Resources Information Center

Harder, Amy; Moore, Austen; Mazurkewicz, Melissa; Benge, Matt

2013-01-01

Needs assessments are an important tool for informing organizational development efforts in Extension. The purpose of the study reported here was to identify problems faced by county units within UF/IFAS Extension during county program reviews. The findings were drawn from the reports created after five county units experienced program reviews in…

A Fuzzy Goal Programming for a Multi-Depot Distribution Problem

NASA Astrophysics Data System (ADS)

Nunkaew, Wuttinan; Phruksaphanrat, Busaba

2010-10-01

A fuzzy goal programming model for solving a Multi-Depot Distribution Problem (MDDP) is proposed in this research. This effective proposed model is applied for solving in the first step of Assignment First-Routing Second (AFRS) approach. Practically, a basic transportation model is firstly chosen to solve this kind of problem in the assignment step. After that the Vehicle Routing Problem (VRP) model is used to compute the delivery cost in the routing step. However, in the basic transportation model, only depot to customer relationship is concerned. In addition, the consideration of customer to customer relationship should also be considered since this relationship exists in the routing step. Both considerations of relationships are solved using Preemptive Fuzzy Goal Programming (P-FGP). The first fuzzy goal is set by a total transportation cost and the second fuzzy goal is set by a satisfactory level of the overall independence value. A case study is used for describing the effectiveness of the proposed model. Results from the proposed model are compared with the basic transportation model that has previously been used in this company. The proposed model can reduce the actual delivery cost in the routing step owing to the better result in the assignment step. Defining fuzzy goals by membership functions are more realistic than crisps. Furthermore, flexibility to adjust goals and an acceptable satisfactory level for decision maker can also be increased and the optimal solution can be obtained.

A note on the relationship between the quadratic mean stand diameter and harmonic mean basal area under size-biased distribution theory

Treesearch

Jeffrey H. Gove

2003-01-01

This note seeks to extend the utility of size-biased distribution theory as applied to forestry through two relationships regarding the quadratic mean stand diameter. First, the quadratic mean stand diameter's relationship to the harmonic mean basal area for horizontal point sampling, which has been known algebraically from early on, is proved under size-biased...

A Pilot Study of a Self-Voicing Computer Program for Prealgebra Math Problems

ERIC Educational Resources Information Center

Beal, Carole R.; Rosenblum, L. Penny; Smith, Derrick W.

2011-01-01

Fourteen students with visual impairments in Grades 5-12 participated in the field-testing of AnimalWatch-VI-Beta. This computer program delivered 12 prealgebra math problems and hints through a self-voicing audio feature. The students provided feedback about how the computer program can be improved and expanded to make it accessible to all users.…

Quadratic String Method for Locating Instantons in Tunneling Splitting Calculations.

PubMed

Cvitaš, Marko T

2018-03-13

The ring-polymer instanton (RPI) method is an efficient technique for calculating approximate tunneling splittings in high-dimensional molecular systems. In the RPI method, tunneling splitting is evaluated from the properties of the minimum action path (MAP) connecting the symmetric wells, whereby the extensive sampling of the full potential energy surface of the exact quantum-dynamics methods is avoided. Nevertheless, the search for the MAP is usually the most time-consuming step in the standard numerical procedures. Recently, nudged elastic band (NEB) and string methods, originaly developed for locating minimum energy paths (MEPs), were adapted for the purpose of MAP finding with great efficiency gains [ J. Chem. Theory Comput. 2016 , 12 , 787 ]. In this work, we develop a new quadratic string method for locating instantons. The Euclidean action is minimized by propagating the initial guess (a path connecting two wells) over the quadratic potential energy surface approximated by means of updated Hessians. This allows the algorithm to take many minimization steps between the potential/gradient calls with further reductions in the computational effort, exploiting the smoothness of potential energy surface. The approach is general, as it uses Cartesian coordinates, and widely applicable, with computational effort of finding the instanton usually lower than that of determining the MEP. It can be combined with expensive potential energy surfaces or on-the-fly electronic-structure methods to explore a wide variety of molecular systems.

An Improved Correction for Range Restricted Correlations Under Extreme, Monotonic Quadratic Nonlinearity and Heteroscedasticity.

PubMed

Culpepper, Steven Andrew

2016-06-01

Standardized tests are frequently used for selection decisions, and the validation of test scores remains an important area of research. This paper builds upon prior literature about the effect of nonlinearity and heteroscedasticity on the accuracy of standard formulas for correcting correlations in restricted samples. Existing formulas for direct range restriction require three assumptions: (1) the criterion variable is missing at random; (2) a linear relationship between independent and dependent variables; and (3) constant error variance or homoscedasticity. The results in this paper demonstrate that the standard approach for correcting restricted correlations is severely biased in cases of extreme monotone quadratic nonlinearity and heteroscedasticity. This paper offers at least three significant contributions to the existing literature. First, a method from the econometrics literature is adapted to provide more accurate estimates of unrestricted correlations. Second, derivations establish bounds on the degree of bias attributed to quadratic functions under the assumption of a monotonic relationship between test scores and criterion measurements. New results are presented on the bias associated with using the standard range restriction correction formula, and the results show that the standard correction formula yields estimates of unrestricted correlations that deviate by as much as 0.2 for high to moderate selectivity. Third, Monte Carlo simulation results demonstrate that the new procedure for correcting restricted correlations provides more accurate estimates in the presence of quadratic and heteroscedastic test score and criterion relationships.

Problems Analysis on Increasing Rice Production Through Food Estate Program in Bulungan Regency, North Kalimantan

NASA Astrophysics Data System (ADS)

Setyo, P.; Elly, J.

2018-05-01

To increase rice production in the Province of North Kalimantan, the provincial government has launched a Food Estate Program. The program is also a central government program in relation to government policies on food security. One of the food estate development areas is the Delta Kayan Food Estate of 50,000 hectares in Bulungan Regency, where about 30,000 hectares area is a tidal land with a very fertile alluvial soil type. This policy study aims to identify and analyze problems of increasing rice production through food estate development in North Kalimantan Province and formulate priority programs as recommendations for policy making in increasing rice production. The study has identified a number of problems of increasing rice production, such as land tenure, land suitability, water system, infrastructure, accessibility of production factors, institutional, and capacity of human resources. The Analytic Hierarchy Process was applied to develop priority programs, resulting in the three most important programs being water management, improving access to production factors, and improving the capacity of human resources. Action plans related to priority programs have also been identified.

Quadratic Electro-optic Effect in a Novel Nano-optical Polymer (iodine-doped polyisoprene)

NASA Astrophysics Data System (ADS)

Swamy, Rajendra; Titus, Jitto; Thakur, Mrinal

2004-03-01

In this report, exceptionally large quadratic electro-optic effect in a novel nano-optical polymer will be discussed. The material involved is cis-1,4-polyisoprene or natural rubber which is a nonconjugated conductive polymer[1,2].Upon doping with an acceptor such as iodine, an electron is transferred from its isolated double bond to the dopant leading to a charge-transfer complex. The positive charge (hole) thus created is localized around the double-bond site, within a nanometer dimension - thus, forming a nano-optical material. The quadratic electro-optic measurement on the doped polyisoprene film was made using field-induced birefringence method. The measured Kerr coefficient is about sixty six times that of nitrobenzene at 632 nm. Significant electroabsorption was also observed in this material at 632 nm. 1. M. Thakur, J. Macromol. Sci. - PAC, 2001, A38(12), 1337. 2. M. Thakur, S. Khatavkar and E.J. Parish, J. Macromol. Sci. - PAC, 2003, A40 (12), 1397.

Building Students' Understanding of Quadratic Equation Concept Using Naïve Geometry

ERIC Educational Resources Information Center

Fachrudin, Achmad Dhany; Putri, Ratu Ilma Indra; Darmawijoyo

2014-01-01

The purpose of this research is to know how Naïve Geometry method can support students' understanding about the concept of solving quadratic equations. In this article we will discuss one activities of the four activities we developed. This activity focused on how students linking the Naïve Geometry method with the solving of the quadratic…

Design a software real-time operation platform for wave piercing catamarans motion control using linear quadratic regulator based genetic algorithm.

PubMed

Liang, Lihua; Yuan, Jia; Zhang, Songtao; Zhao, Peng

2018-01-01

This work presents optimal linear quadratic regulator (LQR) based on genetic algorithm (GA) to solve the two degrees of freedom (2 DoF) motion control problem in head seas for wave piercing catamarans (WPC). The proposed LQR based GA control strategy is to select optimal weighting matrices (Q and R). The seakeeping performance of WPC based on proposed algorithm is challenged because of multi-input multi-output (MIMO) system of uncertain coefficient problems. Besides the kinematical constraint problems of WPC, the external conditions must be considered, like the sea disturbance and the actuators (a T-foil and two flaps) control. Moreover, this paper describes the MATLAB and LabVIEW software plats to simulate the reduction effects of WPC. Finally, the real-time (RT) NI CompactRIO embedded controller is selected to test the effectiveness of the actuators based on proposed techniques. In conclusion, simulation and experimental results prove the correctness of the proposed algorithm. The percentage of heave and pitch reductions are more than 18% in different high speeds and bad sea conditions. And the results also verify the feasibility of NI CompactRIO embedded controller.

Design a software real-time operation platform for wave piercing catamarans motion control using linear quadratic regulator based genetic algorithm

PubMed Central

Liang, Lihua; Zhang, Songtao; Zhao, Peng

2018-01-01

This work presents optimal linear quadratic regulator (LQR) based on genetic algorithm (GA) to solve the two degrees of freedom (2 DoF) motion control problem in head seas for wave piercing catamarans (WPC). The proposed LQR based GA control strategy is to select optimal weighting matrices (Q and R). The seakeeping performance of WPC based on proposed algorithm is challenged because of multi-input multi-output (MIMO) system of uncertain coefficient problems. Besides the kinematical constraint problems of WPC, the external conditions must be considered, like the sea disturbance and the actuators (a T-foil and two flaps) control. Moreover, this paper describes the MATLAB and LabVIEW software plats to simulate the reduction effects of WPC. Finally, the real-time (RT) NI CompactRIO embedded controller is selected to test the effectiveness of the actuators based on proposed techniques. In conclusion, simulation and experimental results prove the correctness of the proposed algorithm. The percentage of heave and pitch reductions are more than 18% in different high speeds and bad sea conditions. And the results also verify the feasibility of NI CompactRIO embedded controller. PMID:29709008

CHEMEX; Understanding and Solving Problems in Chemistry. A Computer-Assisted Instruction Program for General Chemistry.

ERIC Educational Resources Information Center

Lower, Stephen K.

A brief overview of CHEMEX--a problem-solving, tutorial style computer-assisted instructional course--is provided and sample problems are offered. In CHEMEX, students receive problems in advance and attempt to solve them before moving through the computer program, which assists them in overcoming difficulties and serves as a review mechanism.…