A polynomial projection algorithm for linear programming
2013-05-03T23:59:59.000Z
We propose a polynomial algorithm for linear programming. The algorithm represents a linear optimization or decision problem in the form of a system of linear ...
Algorithms for Symmetric Linear and Integer Programs
Bödi, Richard; Joswig, Michael
2010-01-01T23:59:59.000Z
This paper deals with exploiting symmetry for solving linear and integer programming problems. Basic properties of linear representations of finite groups can be used to reduce symmetric linear programming to solving linear programs of lower dimension. Combining this approach with knowledge of the geometry of feasible integer solutions yields an algorithm for solving highly symmetric integer linear programs which only takes time which is linear in the number of constraints and quadratic in the dimension.
A New Algorithm for Linear Programming
Dhananjay P. Mehendale
2015-03-28T23:59:59.000Z
In this paper we propose two types of new algorithms for linear programming. The first type of these new algorithms uses algebraic methods while the second type of these new algorithms uses geometric methods. The first type of algorithms is based on treating the objective function as a parameter. In this method, we form a matrix using coefficients in the system of equations consisting objective equation and equations obtained from inequalities defining constraint by introducing slack/surplus variables. We obtain reduced row echelon form for this matrix containing only one variable, namely, the objective function itself as an unknown parameter. We analyse this matrix in the reduced row echelon form and develop a clear cut method to find the optimal solution for the problem at hand, if and when it exists. We see that the entire optimization process can be developed through the proper analysis of the said matrix in the reduced row echelon form. The second type of algorithms that we propose for linear programming are inspired by geometrical considerations. All these algorithms pursue common aim of approaching closer and closer to centroid or some centrally located interior point for speeding up the process of reaching an optimal solution! We then proceed to show that the algebraic method developed above for linear programming naturally extends to non-linear and integer programming problems. For non-linear and integer programming problems we use the technique of Grobner bases and the methods of solving linear Diophantine equations respectively.
A Distributed Simplex Algorithm for Degenerate Linear Programs and Multi-Agent Assignments
Bullo, Francesco
A Distributed Simplex Algorithm for Degenerate Linear Programs and Multi-Agent Assignments Mathias: Distributed Simplex, Distributed Linear Programming, Asynchronous Algorithm, Multi-Agent Task Assignment. M we propose a novel distributed algorithm to solve degenerate linear programs on asynchronous peer
A Dynamic Near-Optimal Algorithm for Online Linear Programming
Ye, Yinyu
-time forward dynamic pricing for PEVs charging/discharging on smart-grid; Yinyu Ye Online Linear Program 2009
Scalable massively parallel simplex algorithms for block-structured linear programs
Hall, Julian
Scalable massively parallel simplex algorithms for block-structured linear programs Ilkay Boduro of Mathematics, University of Edinburgh September 14th 2007 Scalable massively parallel simplex algorithms for block-structured linear programs #12;Simplex methods for LP problems minimize f = cT x subject to Ax = b
LINEAR-PROGRAMMING DESIGN AND ANALYSIS OF FAST ALGORITHMS FOR MAX 2-CSP
Scott, Alexander Alexander
LINEAR-PROGRAMMING DESIGN AND ANALYSIS OF FAST ALGORITHMS FOR MAX 2-CSP ALEXANDER D. SCOTT AND GREGORY B. SORKIN Abstract. The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint(G) (13/75 + o(1))m, which gives a faster Max 2-CSP algorithm that uses exponential space: running in time
Linear Programming Lower Bounds for Minimum Converter ...
generation algorithm for solving the linear relaxation of the most promising ... Keywords: Optical Networks, Wavelength Assignment, Integer Programming.
A polynomial algorithm for linear optimization which is strongly ...
2015-01-31T23:59:59.000Z
In this paper we present a new polynomial algorithm for linear programming. ... linear optimization problems having 0-1 optimal solutions (e.g., the assignment.
on an efficient implementation of the face algorithm for linear ...
Ping-Qi Pan
2015-04-27T23:59:59.000Z
Apr 27, 2015 ... ``ON AN EFFICIENT IMPLEMENTATION OF THE FACE ALGORITHM FOR LINEAR PROGRAMMING''. Ping-Qi Pan(panpq ***at*** seu.edu.cn).
Symmetries in Linear and Integer Programs
Bödi, R
2009-01-01T23:59:59.000Z
The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric linear and integer programs are studied from a group theoretical viewpoint. We show that for any linear program there exists an optimal solution in the fixed point set of its symmetry group. Using this result, we develop an algorithm that allows for reducing the dimension of any linear program having a non-trivial group of symmetries.
Linear Programming Environmental
Nagurney, Anna
Linear Program to control air pollution was developed in 1968 by Teller, which minimized cost Fall 2006 #12;Topics · Introduction · Background · Air · Land · Water #12;Introduction · "The United States spends more than 2% of its gross domestic product on pollution control, and this is more than any
Classical Simplex Methods for Linear Programming and Their ...
This paper presents a new primal dual simplex method and investigates the ... The classical simplex algorithm is the most popularly used for linear programming ...
GENERALIZED DUAL FACE ALGORITHM FOR LINEAR ...
2014-10-02T23:59:59.000Z
1991 Mathematics Subject Classification. Primary 90C05; Secondary 65K05. Key words and phrases. linear programming, dual level face, dual optimal face .
Linear Programming and Kantorovich Spaces
S. Kutateladze
2009-05-08T23:59:59.000Z
This is a brief overview of the life of Leonid Kantorovich (1912--1986) and his contribution to the fields of linear programming and ordered vector spaces.
Dantzig, G.B.
1992-10-01T23:59:59.000Z
Analogous to gunners firing trial shots to bracket a target in order to adjust direction and distance, we demonstate that it is sometimes faster not to apply an algorithm directly, but to roughly approximately solve several perturbations of the problem and then combine these rough approximations to get an exact solution. To find a feasible solution to an m-equation linear program with a convexity constraint, the von Neumann Algorithm generates a sequence of approximate solutions which converge very slowly to the right hand side b{sup 0}. However, it can be redirected so that in the first few iterations it is guaranteed to move rapidly towards the neighborhood of one of m + 1 perturbed right hand sides {cflx b}{sup i}, then redirected in turn to the next {cflx b}{sup i}. Once within the neighborhood of each {cflx b}{sup i}, a weighted sum of the approximate solutions. {bar x}{sup i} yields the exact solution of the unperturbed problem where the weights are found by solving a system of m + 1 equations in m + 1 unknowns. It is assumed an r > 0 is given for which the problem is feasible for all right hand sides b whose distance {parallel}b - b{sup 0}{parallel}{sub 2} {le} r. The feasible solution is found in less than 4(m+ 1){sup 3}/r{sup 2} iterations. The work per iteration is {delta}mn + 2m + n + 9 multiplications plus {delta}mn + m + n + 9 additions or comparisons where {delta} is the density of nonzero coeffients in the matrix.
Dantzig, G.B.
1992-10-01T23:59:59.000Z
Analogous to gunners firing trial shots to bracket a target in order to adjust direction and distance, we demonstate that it is sometimes faster not to apply an algorithm directly, but to roughly approximately solve several perturbations of the problem and then combine these rough approximations to get an exact solution. To find a feasible solution to an m-equation linear program with a convexity constraint, the von Neumann Algorithm generates a sequence of approximate solutions which converge very slowly to the right hand side b[sup 0]. However, it can be redirected so that in the first few iterations it is guaranteed to move rapidly towards the neighborhood of one of m + 1 perturbed right hand sides [cflx b][sup i], then redirected in turn to the next [cflx b][sup i]. Once within the neighborhood of each [cflx b][sup i], a weighted sum of the approximate solutions. [bar x][sup i] yields the exact solution of the unperturbed problem where the weights are found by solving a system of m + 1 equations in m + 1 unknowns. It is assumed an r > 0 is given for which the problem is feasible for all right hand sides b whose distance [parallel]b - b[sup 0][parallel][sub 2] [le] r. The feasible solution is found in less than 4(m+ 1)[sup 3]/r[sup 2] iterations. The work per iteration is [delta]mn + 2m + n + 9 multiplications plus [delta]mn + m + n + 9 additions or comparisons where [delta] is the density of nonzero coeffients in the matrix.
Stochastic linear programming games with concave preferences
2014-12-04T23:59:59.000Z
We study stochastic linear programming games: a class of stochastic ... be seen as linear programming games; examples include assignment games (Shapley ...
A LINEAR TIME ALGORITHM FOR THE KOOPMANS-BECKMANN ...
2011-11-24T23:59:59.000Z
said to be linearizable if there exists an instance of the linear assignment problem (LAP) .... quadratic programming formulation to a integer linear programming ...
Termination of Linear Programs Ashish Tiwari
Tiwari, Ashish
Termination of Linear Programs Ashish Tiwari SRI International, 333 Ravenswood Ave, Menlo Park, CA, U.S.A tiwari@csl.sri.com Abstract. We show that termination of a class of linear loop programs is decidable. Linear loop programs are discrete-time linear systems with a loop condition governing termination
Termination of Linear Programs Ashish Tiwari #
Tiwari, Ashish
Termination of Linear Programs Ashish Tiwari # SRI International, 333 Ravenswood Ave, Menlo Park, CA, U.S.A tiwari@csl.sri.com Abstract. We show that termination of a class of linear loop programs is decidable. Linear loop programs are discreteÂtime linear systems with a loop condition governing termination
Sketching, streaming, and sub-linear space algorithms
Reif, Rafael
Sketching, streaming, and sub-linear space algorithms Piotr Indyk MIT (currently at Rice U) #12 algorithms are approximate · We assume worst-case input stream Adversaries do exist General algorithms Modular composition · Randomized algorithms OK (often necessary) Randomness in the algorithm
Integer Algorithms to Solver Diophantine Linear Equations and Systems
Florentin Smarandache
2007-11-28T23:59:59.000Z
The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to Diophantine linear equations with $n$ unknowns and then to Diophantine linear systems. The proprieties of the general integer solution are determined (both for a Diophantine linear equation and for a Diophantine linear system). Seven original integer algorithms (two for Diophantine linear equations, and five for Diophantine linear systems) are exposed. The algorithms are strictly proved and an example for each of them is given. These algorithms can be easily implemented on the computer.
Linear optimization Linear programming using the Simplex method
McCready, Mark J.
Linear optimization Linear programming using the Simplex method Maximize M = 40 x1 + 60 x2 subject, that increasing x2 is the way to get the biggest impact. The idea of the simplex method is to move only
AN ALTERNATIVE NOTATION FOR REPRESENTING DENSE LINEAR ALGEBRA ALGORITHMS
van de Geijn, Robert A.
AN ALTERNATIVE NOTATION FOR REPRESENTING DENSE LINEAR ALGEBRA ALGORITHMS PAOLO BIENTINESI AND ROBERT A. VAN DE GEIJN Abstract. We present a notation that allows a dense linear algebra algorithm subvectors and submatrices allowing the details of the algorithm to be the focus while hiding the intricate
Duality for Mixed-Integer Linear Programs
2007-04-05T23:59:59.000Z
The theory of duality for linear programs is well-developed and has been successful ... methods for determining the effect of modifications to the input data on the ..... and the primal problem is bounded, since linear programming duality tells us ...
Optimization Online - Linear, Cone and Semidefinite Programming ...
Strong duality in conic linear programming: facial reduction and extended duals ... A new semide nite programming relaxation for the quadratic assignment ...
On linear programing approach to inventory control
Mayfield, John
On linear programing approach to inventory control problems Zhu received his PhD from Wayne State imbeds the inventory control problem into an infinite-dimensional linear program over a space of measures restricted classes of control policies. Additional auxiliary and dual linear programs are introduced
Optimal subgradient algorithms with application to large-scale linear ...
2014-05-26T23:59:59.000Z
order methods, for examples Beck & Teboulle [8], Becker et al. ..... applying linear mappings, the complexity of an algorithm can be measured by counting the ...
AN EFFICIENT ALGORITHM FOR SECOND-ORDER CONE LINEAR ...
2013-01-28T23:59:59.000Z
In this paper, we consider efficient numerical algorithms to solve the SOCLCP where the linear transformation M has the. GUS property. By closely relying upon
Algorithms for Solving Linear Congruences and Systems of Linear Congruences
Florentin Smarandache
2007-02-16T23:59:59.000Z
In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.
An Efficient Dual Algorithm for Vectorless Power Grid Verification under Linear Current Constraints
Wang, Jia
An Efficient Dual Algorithm for Vectorless Power Grid Verification under Linear Current Constraints, Chicago, IL 60616, USA ABSTRACT Vectorless power grid verification makes it possible to eval- uate worst, the vectorless power grid verification problem can be formulated and solved as a linear programming (LP) problem
The Equivalence of Linear Programs and Zero-Sum Games
2012-01-15T23:59:59.000Z
In 1951, Dantzig showed the equivalence of linear programming problems and ... This note concerns the equivalence between linear programming (LP) ...
Resource analysis of the quantum linear system algorithm
Artur Scherer; Benoît Valiron; Siun-Chuon Mau; Scott Alexander; Eric van den Berg; Thomas E. Chapuran
2015-05-25T23:59:59.000Z
We provide a detailed estimate for the logical resource requirements of the quantum linear system algorithm (QLSA) [Phys. Rev. Lett. 103, 150502 (2009)] including the recently described generalization [Phys. Rev. Lett. 110, 250504 (2013)]. Our resource estimates are based on the standard quantum-circuit model of quantum computation; they comprise circuit width, circuit depth, the number of qubits and ancilla qubits employed, and the overall number of elementary quantum gate operations as well as more specific gate counts for each elementary fault-tolerant gate from the standard set {X, Y, Z, H, S, T, CNOT}. To perform these estimates, we used an approach that combines manual analysis with automated estimates generated via the Quipper quantum programming language and compiler. Our estimates pertain to the example problem size N=332,020,680 beyond which, according to a crude big-O complexity comparison, QLSA is expected to run faster than the best known classical linear-system solving algorithm. For this problem size, a desired calculation accuracy 0.01 requires an approximate circuit width 340 and circuit depth of order $10^{25}$ if oracle costs are excluded, and a circuit width and depth of order $10^8$ and $10^{29}$, respectively, if oracle costs are included, indicating that the commonly ignored oracle resources are considerable. In addition to providing detailed logical resource estimates, it is also the purpose of this paper to demonstrate explicitly how these impressively large numbers arise with an actual circuit implementation of a quantum algorithm. While our estimates may prove to be conservative as more efficient advanced quantum-computation techniques are developed, they nevertheless provide a valid baseline for research targeting a reduction of the resource requirements, implying that a reduction by many orders of magnitude is necessary for the algorithm to become practical.
Truthful and Near-Optimal Mechanism Design via Linear Programming
Sandholm, Tuomas W.
Truthful and Near-Optimal Mechanism Design via Linear ProgrammingÂ£ Ron LaviÃ ronlavi mechanisms that are truthful in expectation. We show that for packing domains, any Â«-approximation algorithm an Â«-approximation mechanism that is truthful in expectation. This immediately yields a variety of new
Interior-point methods for linear programming: a guided tour
Glineur, FranÃ§ois
linear programming1. The simplex algorithm, first developed by* * Dantzig in 1947, is a very.). However, an article by Karmarkar [Kar84] introduced in 1984 a new clas* *s of meth- ods: the so optimization problems. The purpose of this article is to give an overview of this rather new
Interior-point methods for linear programming: a guided tour
Glineur, FranÃ§ois
talk about linear programming 1 . The simplex algorithm, #12;rst developed by Dantzig in 1947 variety of problems (production planning, transportation, scheduling, etc.). However, an article be generalized to other types of convex optimization problems. The purpose of this article is to give an overview
LINEAR CONTROL SYSTEMS OVER ORE ALGEBRAS: EFFECTIVE ALGORITHMS FOR
Robertz, Daniel
LINEAR CONTROL SYSTEMS OVER ORE ALGEBRAS: EFFECTIVE ALGORITHMS FOR THE COMPUTATION@momo.math.rwth-aachen.de. Abstract: In this paper, we study linear control systems over Ore algebras. Within this mathematical framework, we can simultaneously deal with different classes of linear control systems such as time
Non-Linear Continuum Regression Using Genetic Programming Ben.McKay@ncl.ac.uk
Fernandez, Thomas
Non-Linear Continuum Regression Using Genetic Programming Ben McKay Ben.McKay@ncl.ac.uk Mark Willis In this contribution, genetic programming is combined with continuum regression to produce two novel non-linear-based' strategy. Having discussed continuum regression, the modifications required to extend the algorithm for non-linear
Blood Management Using Approximate Linear Programming
Shenoy, Prashant
Blood Management Using Approximate Linear Programming Marek Petrik and Shlomo Zilberstein January 13th, 2009 Marek Petrik and Shlomo Zilberstein () Blood Management Using Approximate Linear ProgrammingJanuary 13th, 2009 1 / 36 #12;Blood Inventory Management Problem Regional blood banks: Aggregate
Outcome-Space Outer Approximation Algorithm for Linear ...
2007-07-20T23:59:59.000Z
Jul 20, 2007 ... Primary: 90 C29; Secondary: 90 C26. Key words. Linear multiplicative programming, global optimization problem, efficient point, outcome set.
APPLICATION OF NEURAL NETWORK ALGORITHMS FOR BPM LINEARIZATION
Musson, John C. [JLAB; Seaton, Chad [JLAB; Spata, Mike F. [JLAB; Yan, Jianxun [JLAB
2012-11-01T23:59:59.000Z
Stripline BPM sensors contain inherent non-linearities, as a result of field distortions from the pickup elements. Many methods have been devised to facilitate corrections, often employing polynomial fitting. The cost of computation makes real-time correction difficult, particulalry when integer math is utilized. The application of neural-network technology, particularly the multi-layer perceptron algorithm, is proposed as an efficient alternative for electrode linearization. A process of supervised learning is initially used to determine the weighting coefficients, which are subsequently applied to the incoming electrode data. A non-linear layer, known as an ?activation layer,? is responsible for the removal of saturation effects. Implementation of a perceptron in an FPGA-based software-defined radio (SDR) is presented, along with performance comparisons. In addition, efficient calculation of the sigmoidal activation function via the CORDIC algorithm is presented.
A Linear Programming based Satisfiability solver using a new
Rossi, Francesca
is unsatisfiable or has a satisfying assignment, we solve a linear program. The solution of the linear program a satisfying assignment or a contradiction we solve a linear program. By the above men- tioned lemmaA Linear Programming based Satisfiability solver using a new Horn-driven search tree design Hans
Planning under uncertainty solving large-scale stochastic linear programs
Infanger, G. (Stanford Univ., CA (United States). Dept. of Operations Research Technische Univ., Vienna (Austria). Inst. fuer Energiewirtschaft)
1992-12-01T23:59:59.000Z
For many practical problems, solutions obtained from deterministic models are unsatisfactory because they fail to hedge against certain contingencies that may occur in the future. Stochastic models address this shortcoming, but up to recently seemed to be intractable due to their size. Recent advances both in solution algorithms and in computer technology now allow us to solve important and general classes of practical stochastic problems. We show how large-scale stochastic linear programs can be efficiently solved by combining classical decomposition and Monte Carlo (importance) sampling techniques. We discuss the methodology for solving two-stage stochastic linear programs with recourse, present numerical results of large problems with numerous stochastic parameters, show how to efficiently implement the methodology on a parallel multi-computer and derive the theory for solving a general class of multi-stage problems with dependency of the stochastic parameters within a stage and between different stages.
Autotuning programs with algorithmic choice
Ansel, Jason (Jason Andrew)
2014-01-01T23:59:59.000Z
The process of optimizing programs and libraries, both for performance and quality of service, can be viewed as a search problem over the space of implementation choices. This search is traditionally manually conducted by ...
The Gravisphere Method Algorithm Programming
A. E. Rosaev
2008-01-23T23:59:59.000Z
The action sphere method program is written. The initial conditions set at pericenter of planetocentric orbits. When action sphere radius is reached, the heliocentric orbit is calculated and data redirected to numeric integration program. The method is useful for capture and collision problem investigation. The very preliminary numeric results were obtained and discussed. A manifold in orbital elements space, leads to temporary capture about 50 year (4 Jupiter revolutions), was found.
Bobrow, James E.
A Fast Sequential Linear Quadratic Algorithm for Solving Unconstrained Nonlinear Optimal Control control problem using sequence of linear quadratic subproblems. Each subproblem is solved efficiently an efficient algorithm for its solution. This algorithm is the well-known Linear Quadratic optimal control
A SUB-LINEAR SCALING ALGORITHM FOR COMPUTING THE ELECTRONIC STRUCTURE OF MATERIALS
Lu, Jianfeng
A SUB-LINEAR SCALING ALGORITHM FOR COMPUTING THE ELECTRONIC STRUCTURE OF MATERIALS CARLOS J. GARC of this paper is to introduce a new class of sub-linear scal- ing algorithms for the analysis of the electronicÂ´IA-CERVERA, JIANFENG LU, AND WEINAN EÂ§ Abstract. We introduce a class of sub-linear scaling algorithms for analyzing
Trajectory Optimization using Mixed-Integer Linear Programming
Trajectory Optimization using Mixed-Integer Linear Programming by Arthur George Richards Master Optimization using Mixed-Integer Linear Programming by Arthur George Richards Submitted to the Department subjected to avoidance and assignment requirements. The former include avoidance of collisions
Noncommercial Software for Mixed-Integer Linear Programming
2004-12-23T23:59:59.000Z
Dec 23, 2004 ... A mixed-integer linear program (MILP) is a mathematical program with linear ...... In addition to defining new template classes of constraints and .... This management must be performed by all MILP solvers, but it can be ...
Fast Jacobi-type Algorithm for Computing Distances Between Linear Dynamical Systems
Vidal, René
Fast Jacobi-type Algorithm for Computing Distances Between Linear Dynamical Systems Nicolas D Jacobi-type algorithm that solves this problem. Each step of the algorithm is equivalent to finding, in this paper, we introduce a fast and accurate Jacobi-type algorithm for computing alignment distances. Our
Transient Analysis of Linear Circuits using Constraint Logic Programming
Gilbert, David
Transient Analysis of Linear Circuits using Constraint Logic Programming Archana Shankar, David London EC1V 0HB, UK Abstract This paper describes the design of a transient analysis program for linear circuits and its implementation in a Constraint Logic Programming language, CLP(R). The transient analysis
Recent Progresses on Linear Programming and the Simplex Method
Ye, Yinyu
Recent Progresses on Linear Programming and the Simplex Method Yinyu Ye www.stanford.edu/~yyye K Programming started... #12;May 1, 2013 CMS Montreal ... with the simplex method #12;May 1, 2013 CMS Montreal Outline Â· Counterexamples to the Hirsch conjecture Â· Linear Programming (LP) and the simplex method
High Performance Computing linear algorithms for two-phase flow in porous media
Paris-Sud XI, Université de
High Performance Computing linear algorithms for two-phase flow in porous media Robert Eymard High Performance Computing techniques. This implies to handle the difficult problem of solving
Ordóñez, Fernando
ISE 536{Fall03: Linear Programming and Extensions September 24, 2003 Lecture 9: Simplex Method, Degeneracy Lecturer: Fernando Ord#19;o~nez 1 Full simplex algorithm To solve min c t x : Ax = b; x #21; 0 = b; x #21; 0 from (0; b) as the initial BFS using Simplex. #15; If u #3; > 0 original problem
Ordóñez, Fernando
ISE 536Fall03: Linear Programming and Extensions September 24, 2003 Lecture 9: Simplex Method, Degeneracy Lecturer: Fernando Ord´o~nez 1 Full simplex algorithm To solve min ctx : Ax = b, x 0. To start Solve the problem u = min m k=1 yk : Ax + Iy = b, x 0 from (0, b) as the initial BFS using Simplex
Optimization Online - Large-Scale Linear Programming Techniques ...
Michael Wagner
2002-02-12T23:59:59.000Z
Feb 12, 2002 ... Large-Scale Linear Programming Techniques for the Design of Protein Folding Potentials. Michael Wagner (mwagner ***at*** odu.edu)
PuLP: A Linear Programming Toolkit for Python
2011-09-05T23:59:59.000Z
Sep 5, 2011 ... Many mixed-integer linear programming (MILP) solvers are .... tions, to place facilities and assigns the production of n products to these ...
A several new mixed integer linear programming formulations for ...
2014-05-31T23:59:59.000Z
May 31, 2014 ... linear programming formulations for exploration of information flow within ... potential locations are established, and each user is assigned to ...
A new mixed integer linear programming formulation for one ...
2014-05-31T23:59:59.000Z
new mixed integer linear programming formulations for first and second prob- ... the best formulation was based on WF closest assignment constraints proposed.
Calmness of linear programs under perturbations of all data
M.J. CÃ¡novas
2014-05-26T23:59:59.000Z
May 26, 2014 ... Calmness of linear programs under perturbations of all data: ... for the optimal set mapping, as well as an operative upper bound for the ...
The Next Linear Collider Klystron Development Program*
E. Jongewaard; G. Caryotakis; C. Pearson; R. M. Phillips; D. Sprehn; A. Vlieks
2000-08-19T23:59:59.000Z
Klystrons capable of 75 MW output power at 11.4 GHz have been under development at SLAC for the last decade. The work has been part of the program to realize all the components necessary for the construction of the Next Linear Collider (NLC). The effort has produced a family of solenoid-focused 50 MW klystrons, which are currently powering a 0.5 GeV test accelerator at SLAC and several test stands, where high power components are evaluated and fundamental research is performed studying rf breakdown and dark current production. Continuing development has resulted in a Periodic Permanent Magnet (PPM) focused 50 MW klystron, tested at SLAC and subsequently contracted for manufacture by industry in England and Japan. A 75 MW version of that PPM klystron was built at SLAC and reached 75 MW, with 2.8 microsecond pulses. Based on this design, a prototype 75 MW klystron, designed for low-cost manufacture, is currently under development at SLAC, and will eventually be procured from industry in modest quantities for advanced NLC tests. Beyond these developments, the design of Multiple Beam Klystrons (MBKs) is under study at SLAC. MBKs offer the possibility of considerably lower modulator costs by producing comparable power to the klystrons now available, at much lower voltages. * This work supported by the Department of Energy under contract DE-AC03-76SF00515
Optimization Online - Decomposition theorems for linear programs
Jean-Bertrand Gauthier
2014-10-08T23:59:59.000Z
Oct 8, 2014 ... While it is the crucial component of the analysis, the heart of the algorithm is the residual network upon which are derived two theorems that ...
Control structures in linear and stack-based Genetic Programming
Fernandez, Thomas
Control structures in linear and stack-based Genetic Programming Elko B. Tchernev and Dhananjay S condition, the if and else sections, etc.) are all subtrees of the flow- control node. Linear and stack implementation issues in linear and stack-based GP. A set of flow- control nodes is presented, and examples given
Ordóñez, Fernando
ISE 536{Fall03: Linear Programming and Extensions September 24, 2003 Lecture 8: Simplex Method look for the BFS associated to x 2 ; x 4 ; x 5 ? Let us run the algorithm What did simplex do; 2.2 Outline of the Simplex Algorithm Let u ij be the elements of the tableau, i = 0; : : : ; m and j
IPASS: Error Tolerant NMR Backbone Resonance Assignment by Linear Programming
Waterloo, University of
IPASS: Error Tolerant NMR Backbone Resonance Assignment by Linear Programming Babak Alipanahi1 automatically picked peaks. IPASS is proposed as a novel integer linear programming (ILP) based assignment assignment method. Although a variety of assignment approaches have been developed, none works well on noisy
Comparison of open-source linear programming solvers.
Gearhart, Jared Lee; Adair, Kristin Lynn; Durfee, Justin D.; Jones, Katherine A.; Martin, Nathaniel; Detry, Richard Joseph
2013-10-01T23:59:59.000Z
When developing linear programming models, issues such as budget limitations, customer requirements, or licensing may preclude the use of commercial linear programming solvers. In such cases, one option is to use an open-source linear programming solver. A survey of linear programming tools was conducted to identify potential open-source solvers. From this survey, four open-source solvers were tested using a collection of linear programming test problems and the results were compared to IBM ILOG CPLEX Optimizer (CPLEX) [1], an industry standard. The solvers considered were: COIN-OR Linear Programming (CLP) [2], [3], GNU Linear Programming Kit (GLPK) [4], lp_solve [5] and Modular In-core Nonlinear Optimization System (MINOS) [6]. As no open-source solver outperforms CPLEX, this study demonstrates the power of commercial linear programming software. CLP was found to be the top performing open-source solver considered in terms of capability and speed. GLPK also performed well but cannot match the speed of CLP or CPLEX. lp_solve and MINOS were considerably slower and encountered issues when solving several test problems.
Krumke, Sven O.
Simplex Algorithm 16. Primal-Dual Simplex Algorithm Horst W. HamacherVorlesung, Lineare Optimierung, Sommersemester 2009 Page 2 Dual Simplex Algorithm Dual Simplex Given: Simplex tableau which is dual feasible If simplex tableau is also primal feasible: STOP - Tableau is optimal · Choose dual pivot column
Efficient scalable algorithms for solving dense linear systems with ...
2013-12-11T23:59:59.000Z
superfast direct solvers for both dense and sparse linear systems. ... Introduction. .... parallel HSS algorthms, taking into account communication latency and ...
Linear Programming Uses for Recycling and Product Reuse
Nagurney, Anna
Linear Programming Uses for Recycling and Product Reuse Tara Demeyer Management Science I #12;Outline Introduction Construction Waste Recycling Paper Waste Recycling Printer Component Reuse #12;Reverse Logistics Returns/ Damaged Product Recycling of waste materials Reuse of product components #12
Designing AC Power Grids using Integer Linear Programming
2011-02-18T23:59:59.000Z
view of recent developments in integer linear programming, we revisit a less known .... optimal solution of the DC model was the minimum cost circuit of the network. ... Andersson, G.: Modelling and Analysis of Electric Power Systems (
Linear programming model for optimum resource allocation in rural systems
Devadas, V. [Indian Inst. of Tech., Kharagpur (India)
1997-07-01T23:59:59.000Z
The article presents a model for optimum resource allocation in a rural system. Making use of linear programming, the objective function of the linear programming model is to maximize the revenue of the rural system, and optimum resource allocation is made subject to a number of energy- and nonenergy-related constraints relevant to the rural system. The model also quantifies the major yields as well as the by-products of different sectors of the rural economic system.
CS 521: LINEAR PROGRAMMING Fall 2009, 3 Credits INSTRUCTOR: Bahman Kalantari (kalantar (Elements of Linear Algebra, Calculus and Multivariable Calculus). GRADING: Homework assignments (written OUTLINE: Linear inequalities and the feasibility problem. The linear programming prob- lem (LP). Related
Generative Story Worlds Linear Logic Programs
Goldstein, Seth Copen
with standard logical implication: buy_soda : has(Alice, $1) ^ wants(Alice, soda) has(Alice, soda) #12;LINEAR LOGIC 13 A -o B #12;14 buy_soda : has(Alice, $1) * wants(Alice, soda) -o has(Alice, soda) #12;15 A * B/murder : anger C C' * anger C C' * anger C C' * anger C C' * at C L * at C' L * has C weapon -o {at C L * !dead C
Cambridge, University of
non-linear. Genetic algorithms (GAs) is one possible method of solving such a problem. Goldberg described these algorithms as "search procedures based on the mechanics of natural selection and natural the yield strength of austenitic stainless steels as a function of composition (wt%), temperature (K
Krumke, Sven O.
. Finiteness of Simplex Algorithm Finiteness of Bland's Rule 7. Revised Simplex Algorithm Horst W. Hamacher j with smallest index. · Choose the pivot row i such that B(i) is smallest. Then the simplexVorlesung, Lineare Optimierung, Sommersemester 2014 Page 3 Reduced Simplex Tableau Idea: Compute only a part of each
Dhar, Deepak
polymers. Sumedha #3; and Deepak Dhar y Department Of Theoretical Physics Tata Institute Of Fundamental algorithm for linear and branched polymers. There is a qualitative di#11;erence in the eÆciency in these two for linear polymers, but as exp(cn #11; ) for branched (undirected and directed) polymers, where 0
An Efficient Sequential Linear Quadratic Algorithm for Solving Nonlinear Optimal Control Problems
Bobrow, James E.
An Efficient Sequential Linear Quadratic Algorithm for Solving Nonlinear Optimal Control Problems for the optimal control. I. INTRODUCTION As the complexity of nonlinear systems such as robots increases/state trajectory and solving a corresponding linear quadratic optimal control problem. From the solution
An algorithm to solve any tropical linear system $A\\odot x=B\\odot x$
Lorenzo, E
2010-01-01T23:59:59.000Z
An algorithm to solve any tropical linear system $A\\odot x=B\\odot x$ is presented. The given system is converted into two classical linear systems: a system of equations and a system of inequalities, each item (equation or inequality) involving exactly two variables, one with coefficient $1$, and another with coefficient $-1$. The two classical linear systems are solved, essentially, by triangulation and backward substitution.
CYCLIC GENETIC ALGORITHMS FOR EVOLVING MULTILOOP CONTROL PROGRAMS
Parker, Gary B.
algorithms, sensors, learning, search, hexapod 1. INTRODUCTION Cyclic Genetic Algorithm (CGA), a variant of traditional successfully been used evolve single loop control programs hexapod gaits and area coverage path modeled simulation a hexapod robot equipped with sensors. The task of learning search behavior autonomous
Ordóñez, Fernando
ISE 536{Fall03: Linear Programming and Extensions October 15, 2003 Lecture 13: Dual Simplex, Farkas Lemma Lecturer: Fernando Ord#19;o~nez 1 Dual Simplex #15; Usual Simplex Maintain a BFS and aim maintain all #22; c j #21; 0, but potentially some b i Simplex Algorithm 1. Select row r
Ordóñez, Fernando
ISE 536Fall03: Linear Programming and Extensions October 15, 2003 Lecture 13: Dual Simplex, Farkas Lemma Lecturer: Fernando Ord´o~nez 1 Dual Simplex · Usual Simplex Maintain a BFS and aim for optimality, but potentially some bi Simplex Algorithm 1. Select row r such that (xB)r = ur0
6.854J / 18.415J Advanced Algorithms, Fall 2001
Goemans, Michel
A first-year graduate course in algorithms. Emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Data structures. Network flows. Linear programming. Computational ...
6.854J / 18.415J Advanced Algorithms, Fall 1999
Karger, David
A first-year graduate course in algorithms. Emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Data structures. Network flows. Linear programming. Computational ...
Integer linear programming models for a cement delivery problem
Hertz, Alain
Integer linear programming models for a cement delivery problem Alain Hertz D´epartement de math.uldry@unifr.ch and marino.widmer@unifr.ch April 4, 2011 Abstract We consider a cement delivery problem with an heterogeneous in [14], [15] and [16] and are reviewed in [4]. In this paper, we study a cement delivery problem which
Multi-stage Stochastic Linear Programming: Scenarios Versus Events
2010-05-17T23:59:59.000Z
To solve the multi-stage linear programming problem, one may use a deterministic or a sto- ... Of course, other approaches can be used, as for example to infer statistical ...... [4] A. Berkelaar, J. A. S. Gromicho, R. Kouwenberg, and S. Zhang.
Yoshio Uwano; Hiromi Yuya
2008-07-25T23:59:59.000Z
In the paper of Uwano [Czech. J. of Phys., vol.56, pp.1311-1316 (2006)], a gradient system is found on the space of density matrices endowed with the quantum SLD Fisher metric (to be referred to as the quantum information space) that realizes a generalization of a gradient system on the space of multinomial distributions studied by Nakamura [Japan J. Indust. Appl. Math., vol.10, pp.179-189 (1993)]. On motived by those papers, the present paper aims to construct a gradient system on the quantum information space that realizes the Karmarkar flow, the continuous limit of the Karmarkar projective scaling algorithm for linear programming.
No-signaling Quantum Key Distribution: Solution by Linear Programming
Won-Young Hwang; Joonwoo Bae; Nathan Killoran
2013-01-15T23:59:59.000Z
We outline a straightforward approach for obtaining a secret key rate using only no-signaling constraints and linear programming. Assuming an individual attack, we consider all possible joint probabilities. Initially, we study only the case where Eve has binary outcomes, and we impose constraints due to the no-signaling principle and given measurement outcomes. Within the remaining space of joint probabilities, by using linear programming, we get bound on the probability of Eve correctly guessing Bob's bit. We then make use of an inequality that relates this guessing probability to the mutual information between Bob and a more general Eve, who is not binary-restricted. Putting our computed bound together with the Csisz\\'ar-K\\"orner formula, we obtain a positive key generation rate. The optimal value of this rate agrees with known results, but was calculated in a more straightforward way, offering the potential of generalization to different scenarios.
Multiobjective fuzzy stochastic linear programming problems with inexact probability distribution
Hamadameen, Abdulqader Othman [Optimization, Department of Mathematical Sciences, Faculty of Science, UTM (Malaysia); Zainuddin, Zaitul Marlizawati [Department of Mathematical Sciences, Faculty of Science, UTM (Malaysia)
2014-06-19T23:59:59.000Z
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.
Simulation of Quantum Algorithms with a Symbolic Programming Language
Peter Nyman
2007-05-24T23:59:59.000Z
This study examines the simulation of quantum algorithms on a classical computer. The program code implemented on a classical computer will be a straight connection between the mathematical formulation of quantum mechanics and computational methods. The computational language will include formulations such as quantum state, superposition and quantum operator.
Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control
Powell, Warren B.
for the optimal control of such power systems are critical for the deployment of reliable and more economical and within 1.34% in stochastic ones, much lower than those obtained using model predictive control. We useBenchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control
How bad is a gradient algorithm for linear programming?
peter
2011-04-20T23:59:59.000Z
Apr 20, 2011 ... Page 1 ... Don't simplex and interior point methods too follow a path of ... The question now is: what can be derived from the characteristics ...
A strong polynomial gradient algorithm in Linear Programming
peter bruijs
2015-03-31T23:59:59.000Z
Page 1 ... Karmarkar don't have the strong characteristic. ... Probably he had no notion of the concept of a convex space, so that is what will have to be .... For the best direction that is left now, one has to exclude from the gradient c exactly and.
A Pivoting Algorithm for Linear Programs with Complementarity ...
2009-10-27T23:59:59.000Z
Oct 27, 2009 ... rithm always finds a minimizer or an unbounded descent search direction in a .... Remark 2.1 An equivalent statement in terms of multipliers is that for all P?D(ˆx) .... The index r indicates the constraint to enter the working set.
A FAST SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING 1 ...
2007-10-15T23:59:59.000Z
Project 10371017 supported by National Natural Science Foundation of China. 1 .... 1http://www-fp.mcs.anl.gov/otc/Guide/TestProblems/LPtest/.
a nonstandard simplex algorithm for linear programming 1.
2008-12-29T23:59:59.000Z
Project 10871043 supported by National Natural Science Foundation of China. 1 ..... 1http://www-fp.mcs.anl.gov/otc/Guide/TestProblems/LPtest/.
Linear algorithms for phase retrieval in the Fresnel region: validity conditions
Gureyev, T E
2015-01-01T23:59:59.000Z
We describe the relationship between different forms of linearized expressions for the spatial distribution of intensity of X-ray projection images obtained in the Fresnel region. We prove that under the natural validity conditions some of the previously published expressions can be simplified without a loss of accuracy. We also introduce modified validity conditions which are likely to be fulfilled in many relevant practical cases, and which lead to a further significant simplification of the expression for the image-plane intensity, permitting simple non-iterative linear algorithms for the phase retrieval.
A taxonomy of descent algorithms for nonlinear programs and variational inequalities
Patriksson, Michael
descent algorithms for nonlinear programs and variational inequalit* *ies, based, classification, nonlinear programs, variational inequalitie* *s, descent algo- rithms, cost approximation. 1
Mittal, Shashi, Ph. D. Massachusetts Institute of Technology
2011-01-01T23:59:59.000Z
This thesis presents efficient algorithms that give optimal or near-optimal solutions for problems with non-linear objective functions that arise in discrete, continuous and robust optimization. First, we present a general ...
Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming
Cardoso, Goncalo; Stadler, Michael; Siddiqui, Afzal; Marnay, Chris; DeForest, Nicholas; Barbosa-Povoa, Ana; Ferrao, Paulo
2013-05-23T23:59:59.000Z
This paper describes the introduction of stochastic linear programming into Operations DER-CAM, a tool used to obtain optimal operating schedules for a given microgrid under local economic and environmental conditions. This application follows previous work on optimal scheduling of a lithium-iron-phosphate battery given the output uncertainty of a 1 MW molten carbonate fuel cell. Both are in the Santa Rita Jail microgrid, located in Dublin, California. This fuel cell has proven unreliable, partially justifying the consideration of storage options. Several stochastic DER-CAM runs are executed to compare different scenarios to values obtained by a deterministic approach. Results indicate that using a stochastic approach provides a conservative yet more lucrative battery schedule. Lower expected energy bills result, given fuel cell outages, in potential savings exceeding 6percent.
Shang, Yu; Yu, Guoqiang, E-mail: guoqiang.yu@uky.edu [Department of Biomedical Engineering, University of Kentucky, Lexington, Kentucky 40506 (United States)
2014-09-29T23:59:59.000Z
Conventional semi-infinite analytical solutions of correlation diffusion equation may lead to errors when calculating blood flow index (BFI) from diffuse correlation spectroscopy (DCS) measurements in tissues with irregular geometries. Very recently, we created an algorithm integrating a Nth-order linear model of autocorrelation function with the Monte Carlo simulation of photon migrations in homogenous tissues with arbitrary geometries for extraction of BFI (i.e., ?D{sub B}). The purpose of this study is to extend the capability of the Nth-order linear algorithm for extracting BFI in heterogeneous tissues with arbitrary geometries. The previous linear algorithm was modified to extract BFIs in different types of tissues simultaneously through utilizing DCS data at multiple source-detector separations. We compared the proposed linear algorithm with the semi-infinite homogenous solution in a computer model of adult head with heterogeneous tissue layers of scalp, skull, cerebrospinal fluid, and brain. To test the capability of the linear algorithm for extracting relative changes of cerebral blood flow (rCBF) in deep brain, we assigned ten levels of ?D{sub B} in the brain layer with a step decrement of 10% while maintaining ?D{sub B} values constant in other layers. Simulation results demonstrate the accuracy (errors?linear algorithm in extracting BFIs in different tissue layers and rCBF in deep brain. By contrast, the semi-infinite homogenous solution resulted in substantial errors in rCBF (34.5%???errors???60.2%) and BFIs in different layers. The Nth-order linear model simplifies data analysis, thus allowing for online data processing and displaying. Future study will test this linear algorithm in heterogeneous tissues with different levels of blood flow variations and noises.
Transient Analysis and Synthesis of Linear Circuits using Constraint Logic Programming
Gilbert, David
Transient Analysis and Synthesis of Linear Circuits using Constraint Logic Programming Archana for linear circuits and its implementation in a Constraint Logic Programming language, CLP(R). The transient analysis program parses the input circuit description into a network graph, analyses its semantic
Quantum algorithms for the ordered search problem via semidefinite programming Andrew M. Childs,1,
Landahl, Andrew J.
Quantum algorithms for the ordered search problem via semidefinite programming Andrew M. Childs,1 a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log2 query algorithms for the ordered search problem in terms of a semidefinite program, we find quantum
On the Equivalence of Linear Programming Problems and Zero-Sum ...
Ilan Adler
2010-06-18T23:59:59.000Z
Jun 18, 2010 ... Abstract: In 1951, Dantzig showed the equivalence of linear programming and two-person zero-sum games. However, in the description of his ...
Sun Wei [Faculty of Engineering and Applied Science, University of Regina, Regina, Saskatchewan, S4S 0A2 (Canada); Huang, Guo H., E-mail: huang@iseis.org [Institute for Energy, Environment and Sustainability Research, UR-NCEPU, North China Electric Power University, Beijing 102206 (China); Institute for Energy, Environment and Sustainable Communities, University of Regina, Regina, Saskatchewan, S4S 0A2 (Canada); Lv Ying; Li Gongchen [Faculty of Engineering and Applied Science, University of Regina, Regina, Saskatchewan, S4S 0A2 (Canada)
2012-06-15T23:59:59.000Z
Highlights: Black-Right-Pointing-Pointer Inexact piecewise-linearization-based fuzzy flexible programming is proposed. Black-Right-Pointing-Pointer It's the first application to waste management under multiple complexities. Black-Right-Pointing-Pointer It tackles nonlinear economies-of-scale effects in interval-parameter constraints. Black-Right-Pointing-Pointer It estimates costs more accurately than the linear-regression-based model. Black-Right-Pointing-Pointer Uncertainties are decreased and more satisfactory interval solutions are obtained. - Abstract: To tackle nonlinear economies-of-scale (EOS) effects in interval-parameter constraints for a representative waste management problem, an inexact piecewise-linearization-based fuzzy flexible programming (IPFP) model is developed. In IPFP, interval parameters for waste amounts and transportation/operation costs can be quantified; aspiration levels for net system costs, as well as tolerance intervals for both capacities of waste treatment facilities and waste generation rates can be reflected; and the nonlinear EOS effects transformed from objective function to constraints can be approximated. An interactive algorithm is proposed for solving the IPFP model, which in nature is an interval-parameter mixed-integer quadratically constrained programming model. To demonstrate the IPFP's advantages, two alternative models are developed to compare their performances. One is a conventional linear-regression-based inexact fuzzy programming model (IPFP2) and the other is an IPFP model with all right-hand-sides of fussy constraints being the corresponding interval numbers (IPFP3). The comparison results between IPFP and IPFP2 indicate that the optimized waste amounts would have the similar patterns in both models. However, when dealing with EOS effects in constraints, the IPFP2 may underestimate the net system costs while the IPFP can estimate the costs more accurately. The comparison results between IPFP and IPFP3 indicate that their solutions would be significantly different. The decreased system uncertainties in IPFP's solutions demonstrate its effectiveness for providing more satisfactory interval solutions than IPFP3. Following its first application to waste management, the IPFP can be potentially applied to other environmental problems under multiple complexities.
Restless Bandits, Linear Programming Relaxations and a Primal-Dual Heuristic
Bertsimas, Dimitris J.
We propose a mathematical programming approach for the classical PSPACE - hard problem of n restless bandits in stochastic optimization. We introduce a series of n increasingly stronger linear programming relaxations, the ...
Chance Constrained Mixed Integer Program: Bilinear and Linear ...
2014-05-31T23:59:59.000Z
Dept. of Industrial and Management Systems Engineering. University of South Florida. Tampa ...... records the computational time in seconds. If the algorithm is.
Beltran-Royo, Cesar
integer linear programming. 1. Introduction In 1957, the Quadratic Assignment Problem (QAP) was introducedSolving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers Huizhen Zhang Cesar Beltran-Royo Liang Ma 19/04/2010 Abstract The Quadratic Assignment
Deriving Unit Cost Coefficients for Linear Programming-Driven Priority-Based Simulations
Lund, Jay R.
Deriving Unit Cost Coefficients for Linear Programming-Driven Priority-Based Simulations By INES-by-step procedure to generate priority preserving weights for linear programming driven simulations models. Many-priority deliveries, the assignment of unit weights in the objective function can be a matter of some art
Dong, Feng Dan
2011-01-01T23:59:59.000Z
Stability and control of differential linear repetitiveLinear matrix inequalities in systems and control theory .and M. Phan. Linear quadratic optimal control (lql). Int.
New Semidefinite Programming Relaxations for the Linear Ordering ...
2015-01-15T23:59:59.000Z
Her model is based on the observation that linear orderings can be fully described by a series of cuts. .... [48] and input-output analysis [39]), sociology (
THE CENTRAL CURVE IN LINEAR PROGRAMMING 1. Introduction ...
2010-12-17T23:59:59.000Z
Section 2 offers an analysis of central curves in the plane, with emphasis on the dual ...... path is generated by the circuit polynomials (21) and the d linear ...
A taxonomy of descent algorithms for nonlinear programs and variational inequalities
Patriksson, Michael
A taxonomy of descent algorithms for nonlinear programs and variational inequalities Michael describes the problem and the choices of cost approximating mappings and merit functions. The taxonomy. Taxonomy, classification, nonlinear programs, variational inequalities, descent algo rithms, cost
A Note on the Implementation and Applications of Linear Logic Programming Languages
Harland, James
A Note on the Implementation and Applications of Linear Logic Programming Languages J.A. Harland D programming languages, such as Prolog, have their origins in classical logic. Recently it has been shown how logic programming languages can be based on lin ear logic, a logic designed with bounded re sources
Chance Constrained Mixed Integer Program: Bilinear and Linear ...
Assumption: In this paper, to help us focus on typical problems, we make an assumption ...... equivalents: an approach to stochastic programming of heating oil, ...
Analysis of Linear Programming Relaxations for a Class of Connectivity Problems
Goemans, Michel X.
We consider the analysis of linear programming (LP) relaxations for a class of connectivity problems. The central problem in the class is the survivable network design problem - the problem of designing a minimum cost ...
Advances in Interior Point Methods for Large-Scale Linear Programming
Colombo, Marco
2007-01-01T23:59:59.000Z
This research studies two computational techniques that improve the practical performance of existing implementations of interior point methods for linear programming. Both are based on the concept of symmetric neighbourhood ...
Linear Program to Select Energy Conservation Projects in an Existing Facility
Mak, J. Y.
1983-01-01T23:59:59.000Z
and petrJchemical industries for scheduling, product planning and utility system optimization. In an energy audit of a refinery or chemical plant, linear programming is a very useful technique in the screening of potential energy conservation projects...
Linear Dynamic Programs for Resource Management Marek Petrik
Massachusetts at Amherst, University of
dynamic programming, a method used to optimize hydroelectric systems. 1 Introduction Sequential decision a river reservoir to produce hydroelectric power. Among renewable sources, hydroelectricity has the lowest management can therefore significantly reduce carbon emissions. Hydroelectric power is usually produced
Practical Guidelines for Solving Difficult Linear Programs1 Ed Klotz Alexandra M. Newman
, algorithmic tuning, numerical stability,11 memory use, run time, tutorials12 1 Introduction13 Operations. Furthermore, improvements in computing power and linear pro-18 gramming solvers have often prompted tuning. We assume basic familiarity with fundamental27 1 #12;mathematics, such as matrix algebra
An Improved Algorithm for the Generalized Quadratic Assignment ...
artur
2008-05-15T23:59:59.000Z
presented a special-purpose branch-and-bound algorithm that utilizes linear programming cuts, feasible solution generators, Lagrangean relaxation, and ...
Feasible and accurate algorithms for covering semidefinite programs
2010-07-02T23:59:59.000Z
The running times of our algorithm and previous works, applied to .... denote the complex vector that models the propagation loss and the phase shift from.
Alternative mixed-integer linear programming models of a maritime inventory routing problem
Grossmann, Ignacio E.
Alternative mixed-integer linear programming models of a maritime inventory routing problem Jiang is enhanced by reformulating the time assignment constraints. Next, we present a model based on event points. Sherali et al (1999) formulated a mixed-integer programming model based on a discrete time representation
Solving Real-World Linear Ordering Problems Using a Primal-Dual Interior Point Cutting Plane Method
Borchers, Brian
Solving Real-World Linear Ordering Problems Using a Primal-Dual Interior Point Cutting Plane Method to the next. A cutting plane algorithm for solving the linear ordering problem is described. This algorithm problems with linear programming methodology use the simplex method to solve the linear programs
CYCLIC GENETIC ALGORITHMS FOR EVOLVING MULTI-LOOP CONTROL PROGRAMS
Parker, Gary B.
, genetic algorithms, sensors, learning, search, hexapod 1. INTRODUCTION The Cyclic Genetic Algorithm (CGA for hexapod gaits and area coverage path planning. However, in order for a robot to react properly to sensor walls and locate the desired target. The agent modeled in simulation is a hexapod robot equipped
A linear programming problem Math 10120, Spring 2014
Galvin, David
programming April 7, 2014 1 / 2 #12;A diet - of bananas -- and beer I need at least 2000 calories a day of carbohydrates, .45mg of Vitamin B-6, and cost 90 cents each. A bottle of beer gives me 180 calories, 13g of carbohydrates, .2mg of Vitamin B-6, and costs 70 cents. If I want to have a healthy diet of bananas and beer
Abdel-Rehim, A. M.; Stathopoulos, Andreas; Orginos, Kostas
2014-08-01T23:59:59.000Z
The technique that was used to build the EigCG algorithm for sparse symmetric linear systems is extended to the nonsymmetric case using the BiCG algorithm. We show that, similarly to the symmetric case, we can build an algorithm that is capable of computing a few smallest magnitude eigenvalues and their corresponding left and right eigenvectors of a nonsymmetric matrix using only a small window of the BiCG residuals while simultaneously solving a linear system with that matrix. For a system with multiple right-hand sides, we give an algorithm that computes incrementally more eigenvalues while solving the first few systems and then uses the computed eigenvectors to deflate BiCGStab for the remaining systems. Our experiments on various test problems, including Lattice QCD, show the remarkable ability of EigBiCG to compute spectral approximations with accuracy comparable to that of the unrestarted, nonsymmetric Lanczos. Furthermore, our incremental EigBiCG followed by appropriately restarted and deflated BiCGStab provides a competitive method for systems with multiple right-hand sides.
Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems
Van Benthem, Mark H. (Middletown, DE); Keenan, Michael R. (Albuquerque, NM)
2008-11-11T23:59:59.000Z
A fast combinatorial algorithm can significantly reduce the computational burden when solving general equality and inequality constrained least squares problems with large numbers of observation vectors. The combinatorial algorithm provides a mathematically rigorous solution and operates at great speed by reorganizing the calculations to take advantage of the combinatorial nature of the problems to be solved. The combinatorial algorithm exploits the structure that exists in large-scale problems in order to minimize the number of arithmetic operations required to obtain a solution.
Parallelization of Path Planning Algorithms for AUVs Concepts, Opportunities, and Program-Technical
Kremer, Ulrich
Parallelization of Path Planning Algorithms for AUVs Concepts, Opportunities, and Program of an energy-aware, many-core computing architec- ture to perform on-board path planning within a battery- operated AUV. A previously published path planning algorithm was ported onto the SCC, an experimental 48
for MSIS 26:711:651 Linear Programming Last updatedon 1/28/13 at 08:37 PM
and References: 1. (Required)Bazaraa, Jarvis and Sherali "Linear Programming and network flows", fourth edition for Mathematical Programming" 2nd edition , Boyd & Fraser Publishing Company, 2002 The first book is our main textSyllabus for MSIS 26:711:651 Linear Programming Last updatedon 1/28/13 at 08:37 PM Texts
An Implementation of an Algorithm for Nonlinear Programming ...
2011-04-21T23:59:59.000Z
Apr 21, 2011 ... of which scale up well in the number of variables and constraints. ... difficulties occurring in practice, such as Jacobian rank deficiencies, .... Upon completion of the active-set identification phase, the algorithm solves ..... The Maratos effect [18, 20], is a well known phenomenon where steps that make good.
Optimization of HDR brachytherapy dose distributions using linear programming with penalty costs
Alterovitz, Ron
Optimization of HDR brachytherapy dose distributions using linear programming with penalty costs-dose-rate HDR brachytherapy, a type of radio- therapy in which a radioactive source is guided through catheters each year,1 is increasingly treated with high-dose-rate HDR brachytherapy, a medical procedure in which
AUTOMATIC LOOP-SHAPING OF QFT CONTROLLERS VIA LINEAR PROGRAMMING1
Massachusetts at Amherst, University of
AUTOMATIC LOOP-SHAPING OF QFT CONTROLLERS VIA LINEAR PROGRAMMING1 Yossi Chait2 Qian Chen3 and C-time QFT users, there is a genuine need for an automatic loop-shaping tool to generate a first-cut solution. Clearly, such an automatic process must involve some sort of optimization, and, while recent results
Truthful and NearOptimal Mechanism Design via Linear Programming ronlavi@ist.caltech.edu
Truthful and NearÂOptimal Mechanism Design via Linear Programming #3; Ron Lavi y ronlavi mechanisms that are truthful in expectation. We show that for packing domains, any #11;Âapproximation to construct an #11;Âapproximation mechanism that is truthful in expectation. This immediately yields a variety
Job Scheduling Using successive Linear Programming Approximations of a Sparse Model
Paris-Sud XI, Université de
Job Scheduling Using successive Linear Programming Approximations of a Sparse Model Stephane of parallel jobs on a set of processors either in a cluster or in a multiprocessor computer. For the makespan objective, i.e., the comple- tion time of the last job, this problem has been shown to be NP
Linear programming applied to the ower sector: a Gladiolus bulb production case study
Dragoti-Çela, Eranda
Linear programming applied to the ¯ower sector: a Gladiolus bulb production case study Jose representative Brazilian bulb growing and trading company's decision making process, during the Gladiolus production planning activity. The pertinent LP model was focused on client's bulb requests to be attended
Antsaklis, Panos
A Linear Programming Approach to Time Optimal Control of Integrator Switched Systems with State, USA Abstract-- In this paper, time optimal control problems of a class of integrator switched systems Recently, optimal control problems of switched and hybrid systems have attracted many researchers from
STABLE REDUCTION TO KKT SYSTEMS IN BARRIER METHODS FOR LINEAR AND QUADRATIC PROGRAMMING
Stanford University
-dual barrier methods for linear and quadratic programming. Following Freund and Jarre, we explore methods, y, z. Most authors eliminate z and/or x without further ado. Freund and Jarre [FJ95] first showed scaling into a KKT system involving a symmetric matrix K. We generalize Freund and Jarre's approach
Solving Linear Programs #2 1.0 Manipulations of the simplex method
McCalley, James D.
1 Solving Linear Programs #2 1.0 Manipulations of the simplex method In setting up the simplex to do now is illustrate the manipulations taken by the simplex method in solving this problem. #12;2 The material of this section is adapted from [1]. Fig. 1: Illustration of feasible region 2.0 Simplex
Application of linear programming methods to determine the best location of concrete dispatch plants
Yong, Alexander
plants Carlos Horacio Gómez Junghye Moon University of Illinois Urbana-Champaign Introduction: I just costs, our plants (factories) should be as close as possible to our actual and potential clients, so of linear programming can be extremely helpful to determine the ideal location of concrete dispatch plants
Solving the Double Digestion Problem as a MixedInteger Linear Program \\Lambda
Zhang, Yin
Solving the Double Digestion Problem as a MixedInteger Linear Program \\Lambda Zhijun Wu y and Yin Zhang z August, 2001 Abstract. The double digestion problem for DNA restriction mapping is knownscale double digestion problems. Key Words. DNA sequencing, restriction mapping, double digestion, NP
Quadratic Time, Linear Space Algorithms for Gram-Schmidt Orthogonalization and Gaussian
International Association for Cryptologic Research (IACR)
.lyubashevsky,thomas.prest}@ens.fr 3 Thales Communications & Security Abstract. A procedure for sampling lattice vectors arithmetic precision necessary for achieving negligible statistical distance between the outputs of our lattices show that the practical performance improvements of our algorithms are as predicted in theory. 1
Algorithms for Stochastic Integer Programs Using Fenchel Cutting Planes
Venkatachalam, Saravanan
2014-08-10T23:59:59.000Z
This dissertation develops theory and methodology based on Fenchel cutting planes for solving stochastic integer programs (SIPs) with binary or general integer variables in the second-stage. The methodology is applied to ...
Convergence Analysis of DC Algorithm for DC programming with ...
2010-09-14T23:59:59.000Z
In this paper, we consider DC programming with subanalytic data. ... Lojasiewicz inequality is an ingredient tool in Subanalytic Geometry as well as in its ... us list some of the elementary properties of subanalytic sets and subanalytic functions ...
Farag, Aly A.
by information theoretic approach, using the Akiake Information Criterion (AIC). This paper provides empirical the weights may take positive and negative values. Various statistical properties of the estimator are studied evaluation of the estimator with respect to window-based estimators and the classical linear combinations
Grossmann, Ignacio E.
1 A Mixed-Integer Linear Programming Model for Optimizing the Scheduling and Assignment of Tank, Midland, MI 48674, USA Abstract This paper presents a novel mixed-integer linear programming (MILP multi-product processing lines and the assignment of dedicated storage tanks to finished products
Estimation of the regional demand for hired farm labor: a parametric linear programming approach
Cox, Thomas Lee
1980-01-01T23:59:59.000Z
86 86 89 93 101 TABLE OF CONTENTS (continued) Chapter Page The Linear Programming Framework Introduction Assumptions Similarities and Contrasts of Marginal and LP Analysis The Mathematical LP Model The Duality Context Derived Factor... migratory labor tha it implies. The style and f?zmat of this thesis follows that of the Amer-ican- gournN1 of Agricultural gconomj, cs. At the national level there 's growing concern over the "leakaqa" of Mexican Nationals from Southves. secondary...
Deselaers, Thomas
A GIS-LIKE TRAINING ALGORITHM FOR LOG-LINEAR MODELS WITH HIDDEN VARIABLES Georg Heigold, Thomas with Generalized Iterative Scal- ing (GIS). GIS offers, upon others, the immediate advantages that it is locally convergent, completely parameter free, and guarantees an improvement of the criterion in each step. GIS
E-model for Transportation Problem of Linear Stochastic Fractional ...
Dr.V.Charles
2007-03-07T23:59:59.000Z
Abstract: This paper deals with the so-called transportation problem of linear stochastic fractional programming, and ... sophisticated analysis. Stochastic ... circuit board of multi-objective LSFP, algorithm to identify redundant fractional objective ...
Demmel, James; Holtz, Olga; Dumitriu, Ioana
2007-01-01T23:59:59.000Z
than other basic linear algebra subroutines. AcknowledgmentsApplied Numerical Linear Algebra. SIAM, 1997. [23] J.algorithms in numerical linear algebra. SIAM Review, 20:740–
A Run-Time System for Programming Out-of-Core Matrix Algorithms-by-Tiles on
Batory, Don
A Run-Time System for Programming Out-of-Core Matrix Algorithms-by-Tiles on Multithreaded. Quintana-Ort´i Robert van de Geijn Abstract Out-of-core implementations of algorithms for dense matrix and data movement in the hands of a run-time system. Remarkable performance is demonstrated
Evaluating the impact of AND/OR search on 0-1 integer linear programming
Marinescu, Radu; Dechter, Rina
2010-01-01T23:59:59.000Z
Wolsey, J. (1998). Integer programming. New York: Wiley. 48.and practice of constraint programming (CP) (pp. 660–705).in mixed-integer programming. Mathematical Programming, 1(
Hafstein, Sigurður Freyr
Introduction Relationship between ISS and Robust Lyapunov Functions Computing Local Robust Lyapunov Functions by Linear Programming Computing Lo Computation of Local ISS Lyapunov Function Via Linear;Introduction Relationship between ISS and Robust Lyapunov Functions Computing Local Robust Lyapunov Functions
Street, Nick
Breast Cancer Diagnosis and Prognosis via Linear Programming \\Lambda Olvi L. Mangasarian, W. Nick cancer diagnosis and prognosis. The first application to breast cancer diagnosis utilizes characteristics breast cancer is likely to recur in patients that have had their cancers excised. This gives
A O(n^8) X O(n^7) Linear Programming Model of the Quadratic Assignment Problem
Diaby, Moustapha
2008-01-01T23:59:59.000Z
In this paper, we propose a linear programming (LP) formulation of the Quadratic Assignment Problem (QAP) with O(n^8) variables and O(n^7) constraints, where n is the number of assignments. A small experimentation that was undertaken in order to gain some rough indications about the computational performance of the model is discussed.
A Branch-and-Bound Algorithm for the Quadratic Assignment Problem Based on the Hungarian Method
the Linear Assignment Problem. Our DP solves the QAP in certain cases, i.e., for some small problems (N Assignment Problem, Branch-and-bound, Quadratic Programming, Integer Programming, Mathematical Programming, which has roots in the Hungarian algorithm (see Munkres [21]) which solves the linear assignment problem
Clement, Prabhakar
2001-01-01T23:59:59.000Z
of this present study was to introduce a simple, easily understood method for carrying out non-linear regression: Microsoft Excel; Non-linear regression; Least squares; Iteration; Goodness of fit; Curve fit wwwComputer Methods and Programs in Biomedicine 65 (2001) 191200 A step-by-step guide to non-linear
An Algorithm for Fractional Assignment Problems Maiko Shigeno
Yamamoto, Hirosuke
Optimization, Mathematical Programming, Fractional Programming, Assignment Problems, Approximation Optimality fractional assignment problems which are special cases of 0-1 fractional programming problems. Let G = (I; J assignment problem. In this case, the algorithm proposed in this paper solves the linear assignment problem
Gugat, Martin
consisting of two linear mappings, an allocation and a timing function. In this paper, we address the problem allocation function, a continuous relaxation of this problem is studied by passing from linear to quasi of the null space of the allocation function. Therefore, a branching approach is proposed for finding quasi
A Current-Voltage Successive Linear Programming Approach to Solving the ACOPF
Oren, Shmuel S.
, DC, USA richard.oneill@ferc.gov Variables: pg n Total linearized real power generation at bus n pg n,l Linear segment l of generation at bus n qg n Reactive power generation at bus n vn Voltage magnitude Maximum real power generation at bus n Qmin n Minimum reactive power generation at bus n Qmax n Maximum
Paris-Sud XI, Université de
-wise linear costs Ay³e Akbal#25;k (1) and Christophe Rapine (2) (1) LTM #21; CNRS #21; UJF, 17, ave. des (CLSP). We consider a constant batch size production with a #28;xed cost associated to each batch, additionally to the production setup cost and a unit holding cost. The production cost can then be considered
Message Passing Algorithms for Optimization Nicholas Robert Ruozzi
Tatikonda, Sekhar
). These algorithms can be viewed as coordinate ascent schemes over different duals of a linear programming-product algorithm, which attempts to compute the most probable assignment (MAP) of a given probability distribution to converge and, even if it does, is not guaranteed to produce the MAP assignment. Many alternative message
Optimization Online - PuLP: A Linear Programming Toolkit for Python
Stuart Mitchell
2011-09-22T23:59:59.000Z
Sep 22, 2011 ... PuLP is a high-level modelling library that leverages the power of the ... Keywords: mathematical programming; Python; modelling language.
Application of a dynamic linear programming model for optimum use of range resources over time
Sharp, Wayne Winston
1964-01-01T23:59:59.000Z
~ . ~ ~ ~ ~ ? ~ ~ ~ ~ ~ ~ ~ ~ Scope and Importance of Range Resource Use . . . . . . . . e. . . ? " . . Present Status of the Problem, Objectives of the Study 1 2 4 6 11 II. DESCRIPTION OF THE STUDY AREA, Size and Location of the Area, Major Soils and Types of Enterprises... ~ Cattle Transfer Equations , ee ~ ~ ~ ~ ~ ~ 46 46 48 52 54 55 58 6'I 62 66 66 68 7'1 75 75 76 76 77 77 The Function to be Maximized The Role of Management. Program I Program II Program III 80 80 82 82 83 V. RESULTS. Optimal...
Leung, L.C. [Chinese Univ. of Hong Kong, Shatin (Hong Kong). Decision Science and Managerial Economics] [Chinese Univ. of Hong Kong, Shatin (Hong Kong). Decision Science and Managerial Economics; Khator, S.K. [Univ. of South Florida, Tampa, FL (United States). Industrial and Management Systems Engineering] [Univ. of South Florida, Tampa, FL (United States). Industrial and Management Systems Engineering
1995-05-01T23:59:59.000Z
The Power Delivery Substation Division at Florida Power and Light (FPL) must plan and provide logistical support for about 2,000 transformers located at roughly 400 substations. Each year, to meet new transformer requirements, the Division must make the decision of procuring and/or relocating transformers. Due to the large number of transformers and substations involved, there is a strong need for a systematic approach to determine optimally the decisions for transformer procurement and relocation, as well as their schedules. In this paper, a mixed 0-1 linear programming model is developed for that purpose.
Advances in Normal Conducting Accelerator Technology from the X-Band Linear Collider Program
Adolphsen, Chris
2005-01-01T23:59:59.000Z
In the early 1990's, groups at SLAC and KEK began dedicated development of X-band (11.4 GHz) rf technology for a next generation, TeV-scale linear collider. The choice of a relatively high frequency, four times that of the SLAC 50 GeV Linac, was motivated by the cost benefits of having lower rf energy per pulse (hence fewer rf components) and reasonable efficiencies at high gradients (hence shorter linacs). However, to realize such savings requires operation at gradients and peak powers much higher than that hitherto achieved. During the past 15 years, these challenges were met through innovations on several fronts, and resulted in a viable rf system design for a linear collider. This paper reviews these achievements, which include developments in the generation and transport of high power rf, and new insights into high gradient limitations.
Award DE-FG02-04ER52655 Final Technical Report: Interior Point Algorithms for Optimization Problems
O'Leary, Dianne P. [Univ. of Maryland] [Univ. of Maryland; Tits, Andre [Univ. of Maryland] [Univ. of Maryland
2014-04-03T23:59:59.000Z
Over the period of this award we developed an algorithmic framework for constraint reduction in linear programming (LP) and convex quadratic programming (QP), proved convergence of our algorithms, and applied them to a variety of applications, including entropy-based moment closure in gas dynamics.
An Infeasible InteriorPoint Algorithm for Solving Primal and Dual Geometric Programs \\Lambda
Ye, Yinyu
with the classical, arithmetic/geometric inequality--based dual geometric programming problem, see [20]. However
Solutions of ordinary and partial differential equations by a linear programming technique
Ormand, James Franklin
1966-01-01T23:59:59.000Z
for programming techniques and topics for investigation were invaluable in the results of this research. Next, I would like to extend my appreciation to these members of the graduate faculty who served on my committee: Dr. H. A. Luther, Professor... (boundary) conditions, y(0. 0) = 0 and y(1. 5) . 557936, and with step length (H) . 5. We have the following situation: y(0) 0 y(1. 5) ~ . 557936 0 . 5 1. 0 1. 5 To find: y(x), y'(x) and y''(x) at each of the above 4 points. The output from the dual...
Current Status of the Next Linear Collider X-Band Klystron Development Program
Caryotakis, G.; Haase, A.A.; Jongewaard, E.N.; Pearson, C.; Sprehn, D.W.; /SLAC
2005-05-09T23:59:59.000Z
Klystrons capable of driving accelerator sections in the Next Linear Collider (NLC) have been developed at SLAC during the last decade. In addition to fourteen 50 MW solenoid-focused devices and a 50 MW Periodic Permanent Magnet focused (PPM) klystron, a 500 kV 75 MW PPM klystron was tested in 1999 to 80 MW with 3 {micro}s pulses, but very low duty. Subsequent 75 MW prototypes aimed for low-cost manufacture by employing reusable focusing structures external to the vacuum, similar to a solenoid electromagnet. During the PPM klystron development, several partners (CPI, EEV and Toshiba) have participated by constructing partial or complete PPM klystrons. After early failures during testing of the first two devices, SLAC has recently tested this design (XP3-3) to the full NLC specifications of 75 MW, 1.6 {micro}s pulse length, and 120 Hz. This 14.4 kW average power operation came with an efficiency of 50%. The XP3-3 average and peak output power, together with the focusing method, arguably makes it the most advanced high power klystron ever built anywhere in the world. Design considerations and test results for these latest prototypes will be presented.
Throughput Validation of an Advanced Channel Assignment Algorithm in IEEE 802.11 Mohamad Haidar
Akl, Robert
assignment for hot-spot service areas in a WLAN by formulating an Integer Linear Programming (ILP) modelThroughput Validation of an Advanced Channel Assignment Algorithm in IEEE 802.11 WLAN Mohamad channel-assignment algorithm at the Access Points (APs) of a Wireless Local Area Network (WLAN
PARSMI, a parallel revised simplex algorithm incorporating minor iterations and Devex pricing
Hall, Julian
PARSMI, a parallel revised simplex algorithm incorporating minor iterations and Devex pricing J, a parallel revised simplex algorithm incorporating minor iterations and Devex pricing J. A. J. Hall and K. I linear programming problems using the re- vised simplex method, two common variants are the incorporation
Inverse Stochastic Linear Programming
2007-01-05T23:59:59.000Z
Pittsburgh, PA USA 15261. Lewis Ntaimo ... College Station, TX USA 77843. Abstract. Inverse ..... investments in the electricity generation industry. The instances ...
Linear Programming brewer's problem
Sedgewick, Robert
: Brewer's problem Small brewery produces ale and beer. · Production limited by scarce resources: corn, hops, barley malt. · Recipes for ale and beer require different proportions of resources. Brewer 160 1190 ale (1 barrel) 5 4 35 13 beer (1 barrel) 15 4 20 23 all ale (34 barrels) 179 136 1190 442 all
Random Search Algorithms Zelda B. Zabinsky
Del Moral , Pierre
Random Search Algorithms Zelda B. Zabinsky April 5, 2009 Abstract Random search algorithms with convergence results in probability. Random search algorithms include simulated an- nealing, tabu search, genetic algorithms, evolutionary programming, particle swarm optimization, ant colony optimization, cross
Evans, Joshua D., E-mail: jevans2@mcvh-vcu.edu; Yu, Yaduo; Williamson, Jeffrey F. [Department of Radiation Oncology, Virginia Commonwealth University, Richmond, Virginia 23298 (United States)] [Department of Radiation Oncology, Virginia Commonwealth University, Richmond, Virginia 23298 (United States); Whiting, Bruce R. [Department of Radiology, University of Pittsburgh, Pittsburgh, Pennsylvania 15213 (United States)] [Department of Radiology, University of Pittsburgh, Pittsburgh, Pennsylvania 15213 (United States); O’Sullivan, Joseph A. [Department of Electrical and Systems Engineering, Washington University, St. Louis, Missouri 63130 (United States)] [Department of Electrical and Systems Engineering, Washington University, St. Louis, Missouri 63130 (United States); Politte, David G. [Mallinckrodt Institute of Radiology, Washington University, St. Louis, Missouri 63110 (United States)] [Mallinckrodt Institute of Radiology, Washington University, St. Louis, Missouri 63110 (United States); Klahr, Paul H. [Philips Healthcare, 595 Miner Rd., Highland Hts., Ohio 44143 (United States)] [Philips Healthcare, 595 Miner Rd., Highland Hts., Ohio 44143 (United States)
2013-12-15T23:59:59.000Z
Purpose: Accurate patient-specific photon cross-section information is needed to support more accurate model-based dose calculation for low energy photon-emitting modalities in medicine such as brachytherapy and kilovoltage x-ray imaging procedures. A postprocessing dual-energy CT (pDECT) technique for noninvasivein vivo estimation of photon linear attenuation coefficients has been experimentally implemented on a commercial CT scanner and its accuracy assessed in idealized phantom geometries. Methods: Eight test materials of known composition and density were used to compare pDECT-estimated linear attenuation coefficients to NIST reference values over an energy range from 10 keV to 1 MeV. As statistical image reconstruction (SIR) has been shown to reconstruct images with less random and systematic error than conventional filtered backprojection (FBP), the pDECT technique was implemented with both an in-house polyenergetic SIR algorithm, alternating minimization (AM), as well as a conventional FBP reconstruction algorithm. Improvement from increased spectral separation was also investigated by filtering the high-energy beam with an additional 0.5 mm of tin. The law of propagated uncertainty was employed to assess the sensitivity of the pDECT process to errors in reconstructed images. Results: Mean pDECT-estimated linear attenuation coefficients for the eight test materials agreed within 1% of NIST reference values for energies from 1 MeV down to 30 keV, with mean errors rising to between 3% and 6% at 10 keV, indicating that the method is unbiased when measurement and calibration phantom geometries are matched. Reconstruction with FBP and AM algorithms conferred similar mean pDECT accuracy. However, single-voxel pDECT estimates reconstructed on a 1 × 1 × 3 mm{sup 3} grid are shown to be highly sensitive to reconstructed image uncertainty; in some cases pDECT attenuation coefficient estimates exhibited standard deviations on the order of 20% around the mean. Reconstruction with the statistical AM algorithm led to standard deviations roughly 40% to 60% less than FBP reconstruction. Additional tin filtration of the high energy beam exhibits similar pDECT estimation accuracy as the unfiltered beam, even when scanning with only 25% of the dose. Using the law of propagated uncertainty, low Z materials are found to be more sensitive to image reconstruction errors than high Z materials. Furthermore, it is estimated that reconstructed CT image uncertainty must be limited to less than 0.25% to achieve a target linear-attenuation coefficient estimation uncertainty of 3% at 28 keV. Conclusions: That pDECT supports mean linear attenuation coefficient measurement accuracies of 1% of reference values for energies greater than 30 keV is encouraging. However, the sensitivity of the pDECT measurements to noise and systematic errors in reconstructed CT images warrants further investigation in more complex phantom geometries. The investigated statistical reconstruction algorithm, AM, reduced random measurement uncertainty relative to FBP owing to improved noise performance. These early results also support efforts to increase DE spectral separation, which can further reduce the pDECT sensitivity to measurement uncertainty.
Paris-Sud XI, Université de
Discrete Mathematics and Theoretical Computer Science DMTCS vol. 14:1, 2012, 147158 A linear time in H such that each edge of H appears in this sequence exactly once and vi-1, vi ei, vi-1 = vi Mathematics and Theoretical Computer Science 14, 1 (2012) 147-158" #12;148 Zbigniew Lonc and Pawel Naroski (i
Methods for Estimation and Control of Linear Systems Driven by Cauchy Noises
Fernandez, Javier Huerta
2013-01-01T23:59:59.000Z
prediction optimal control for a scalar linear system withPrediction Optimal Control for a Scalar Linear System withsystems in modern stochastic optimal control, algorithms like the linear
Auction Algorithms Dimitri P. Bertsekas
Bertsekas, Dimitri
a fundamental linear programming structure. The most important type of linear programming problems, the linear, any method for solving the assignment problem can be 1 #12;generalized to solve the linear network is an intuitive method for solving the classical assignment problem. It outperforms substantially its main
Jr, Peter Chien; Rosenman, Karla; Cheung, Wang; Wang, Nadia; Sanchez, Miguel
2009-01-01T23:59:59.000Z
type 1/type 2 mosaic of psoriasis? Dermatology 2006; 212:Magalhaes RF, et al. Linear psoriasis in Brazilian childrensuffering from linear psoriasis along lines of Blaschko. Br
Applying new optimization algorithms to more predictive control
Wright, S.J.
1996-03-01T23:59:59.000Z
The connections between optimization and control theory have been explored by many researchers and optimization algorithms have been applied with success to optimal control. The rapid pace of developments in model predictive control has given rise to a host of new problems to which optimization has yet to be applied. Concurrently, developments in optimization, and especially in interior-point methods, have produced a new set of algorithms that may be especially helpful in this context. In this paper, we reexamine the relatively simple problem of control of linear processes subject to quadratic objectives and general linear constraints. We show how new algorithms for quadratic programming can be applied efficiently to this problem. The approach extends to several more general problems in straightforward ways.
A Smart Algorithm for the Diagnosis of Short-Circuit Faults in a Photovoltaic Generator
Paris-Sud XI, Université de
A Smart Algorithm for the Diagnosis of Short-Circuit Faults in a Photovoltaic Generator Wail Rezgui observations distributed over classes is used for simulation purposes. Keywords--Photovoltaic generator, SVM, k-NN, short-circuit fault, smart classification, linear programming. NOMENCLATURE PV = Photovoltaic; SVM
Optimising a nonlinear utility function in multi-objective integer programming
Ozlen, Melih; Burton, Benjamin A
2010-01-01T23:59:59.000Z
In this paper we develop an algorithm to optimise a nonlinear utility function of multiple objectives over the integer nondominated set. Our approach is based on identifying and updating bounds on the individual objectives as well as the optimal utility value. This is done using already known solutions, linear programming relaxations, utility function inversion, and integer programming. We develop a general optimisation algorithm for use with k objectives, and we illustrate our approach using a tri-objective assignment problem.
Automatic Conversion Software for the Safety Verification of Goal-based Control Programs
Murray, Richard M.
, an automatic software algorithm for converting goal network control programs into linear hybrid systemsAutomatic Conversion Software for the Safety Verification of Goal-based Control Programs Julia M. B. Braman and Richard M. Murray Abstract-- Fault tolerance and safety verification of control systems
9. Genetic Algorithms 9.1 Introduction
Cambridge, University of
66 9. Genetic Algorithms 9.1 Introduction The concept of evolution is prevalent in most biological to computational optimisation methods using "genetic algorithms" [50]. 9.2 Neural Networks and Genetic Algorithms.1) with the function f being non-linear. Genetic algorithms (GAs) is one possible method of solving such a problem
Two Strategies to Speed up Connected Component Labeling Algorithms
Wu, Kesheng; Otoo, Ekow; Suzuki, Kenji
2008-01-01T23:59:59.000Z
but not linear set union algorithm,” J. ACM, vol. 22, no. 2,analysis of set union algorithms,” J. ACM, vol. 31, no. 2,An improved equivalence algorithm,” Commun. ACM, vol. 7, no.
The International Linear Collider
Jim Brau; Paul Grannis; Mike Harrison; Michael Peskin; Marc Ross; Harry Weerts
2013-04-09T23:59:59.000Z
We present a brief summary of the International Linear Collider as documented in the 2013 Technical Design Report. The Technical Design Report has detailed descriptions of the accelerator baseline design for a 500 GeV e+e- linear collider, the R&D program that has demonstrated its feasibility, the physics goals and expected sensitivities, and the description of the ILD and SiD detectors and their capabilities.
Algorithms for Greechie Diagrams
Brendan D. McKay; Norman D. Megill; Mladen Pavicic
2001-01-21T23:59:59.000Z
We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2,3,4,... atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 100,000 times slower. We also provide an algorithm and programs for checking of Greechie diagram passage by equations defining varieties of orthomodular lattices and give examples from Hilbert lattices. At the end we discuss some additional characteristics of Greechie diagrams.
Computationally efficient algorithms for statistical image processing. Implementation in R
Langovoy, Mikhail A
2011-01-01T23:59:59.000Z
In the series of our earlier papers on the subject, we proposed a novel statistical hypothesis testing method for detection of objects in noisy images. The method uses results from percolation theory and random graph theory. We developed algorithms that allowed to detect objects of unknown shapes in the presence of nonparametric noise of unknown level and of unknown distribution. No boundary shape constraints were imposed on the objects, only a weak bulk condition for the object's interior was required. Our algorithms have linear complexity and exponential accuracy. In the present paper, we describe an implementation of our nonparametric hypothesis testing method. We provide a program that can be used for statistical experiments in image processing. This program is written in the statistical programming language R.
Linear Dependence and Linear Independence
PRETEX (Halifax NS) #1 1054 1999 Mar 05 10:59:16
2010-02-12T23:59:59.000Z
Feb 16, 2007 ... Observe that the vector (1, 2) is already a linear combination of (1, 0) and (0, 1), and therefore it does not add any new vectors to the linear span ...
Optimization Online - Integer Programming Submissions - 2013
Integer Programming Submissions - 2013. January 2013. (Mixed) Integer Linear Programming On the Augmented Lagrangian Dual for Integer Programming
Batch-mode Supervised Learning Linear regression
Wehenkel, Louis
Batch-mode Supervised Learning Linear regression Applied inductive learning - Lecture 3 Louis (& Pierre Geurts)AIA... (1/19) #12;Batch-mode Supervised Learning Linear regression Batch-mode Supervised Learning Linear regression Least mean square error solution Regularization and algorithmics Residual
Mukherjee, Srayanta; Zhang, Yang
2009-05-14T23:59:59.000Z
. Compared with a naïve extension of the monomer alignment program of TM-align, the alignment accuracy of MM-align is significantly higher as judged by the average TM-score of the physically-aligned residues. MM-align is about two times faster than TM...
Customized proximal point algorithms for linearly constrained ...
2011-10-30T23:59:59.000Z
Oct 30, 2011 ... regularization introduced in [70] (see e.g. [15, 29, 82, 91]), fluid ...... S. Osher, G. Sapiro and J. Xin, A convex model for non-negative matrix.
MIT Lincoln Laboratory Linear Algebraic Graph Algorithms
Kepner, Jeremy
& scale ~ 103 seconds needed for effective CONOPS (1000x improvement) Planned system capability (over
Extensions of Answer Set Programming
Brik, Alex
2012-01-01T23:59:59.000Z
Logic Programming . . . . . . . . . . . . 2.2 Preference Set4.1 The Dynamic Programming Algorithm . . . . . . . . . .of predicate logic as a programming language. J. ACM, 23(4):
Parallel solution of linear programs
Smith, Edmund
2013-11-28T23:59:59.000Z
The factors limiting the performance of computer software periodically undergo sudden shifts, resulting from technological progress, and these shifts can have profound implications for the design of high performance codes. ...
MIXED INTEGER LINEAR PROGRAMMING FORMULATION ...
2014-07-22T23:59:59.000Z
Jul 22, 2014 ... to Sommer. [148]. The following proposition from [74, 6] shows how to use (9.3) to construct formu- lations for simple disjunctive constraints.
Stripping Coupons with Linear Programming
Allen, David E; Thomas, Lyn C; Zheng, Harry
2000-01-01T23:59:59.000Z
When using market prices to fit the parameters of models for the price of bonds, the first step is to strip the market bonds of their coupons. The standard bootstrapping technique of stripping coupons can cause mispricing ...
EXTENSIONS OF GENERALIZED LINEAR MODELING APPROACH TO STOCHASTIC WEATHER GENERATORS
Katz, Richard
weather) -- Software R open source statistical programming language: Function glm "Family;(2) Generalized Linear Models Statistical Framework -- Multiple Regression Analysis (Linear model or LM) Response
Peter Wittek
2015-06-12T23:59:59.000Z
A hierarchy of semidefinite programming (SDP) relaxations approximates the global optimum of polynomial optimization problems of noncommuting variables. Generating the relaxation, however, is a computationally demanding task, and only problems of commuting variables have efficient generators. We develop an implementation for problems of noncommuting problems that creates the relaxation to be solved by SDPA -- a high-performance solver that runs in a distributed environment. We further exploit the inherent sparsity of optimization problems in quantum physics to reduce the complexity of the resulting relaxations. Constrained problems with a relaxation of order two may contain up to a hundred variables. The implementation is available in Python. The tool helps solve problems such as finding the ground state energy or testing quantum correlations.
Michele Mosca
2008-08-04T23:59:59.000Z
This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a summary of the early quantum algorithms, a description of the Abelian Hidden Subgroup algorithms (including Shor's factoring and discrete logarithm algorithms), quantum searching and amplitude amplification, quantum algorithms for simulating quantum mechanical systems, several non-trivial generalizations of the Abelian Hidden Subgroup Problem (and related techniques), the quantum walk paradigm for quantum algorithms, the paradigm of adiabatic algorithms, a family of ``topological'' algorithms, and algorithms for quantum tasks which cannot be done by a classical computer, followed by a discussion.
Expander Graph Arguments for Message Passing Algorithms
Burshtein, David
Expander Graph Arguments for Message Passing Algorithms David Burshtein and Gadi Miller Dept arguments may be used to prove that message passing algorithms can correct a linear number of erroneous a message passing algorithm has corrected a sufficiently large fraction of the errors, it will eventually
Optimization Online - Equivalence of an Approximate Linear ...
Alejandro Toriello
2013-02-07T23:59:59.000Z
Feb 7, 2013 ... Equivalence of an Approximate Linear Programming Bound with the Held-Karp Bound for the Traveling Salesman Problem. Alejandro Toriello ...
Algorithms for active learning
Hsu, Daniel Joseph
2010-01-01T23:59:59.000Z
6.2 Algorithms . . . . . . . . . . . . . . . . . . . 6.2.1CAL algorithm. . . . . . . . . . . . . . . . . . . .IWAL-CAL algorithm. . . . . . . . . . . . . . . . . . . . .
Davis, Ernest
Problem 3 This problem has to do with the programming assignment on Electric Charges in this repository think through this programming assignment before doing this problem, and since thinking through the programming assignment is practically equivalent to doing it, it is prob- ably a good idea to complete
Gajic, Zoran
students interested in linear dynamic systems and signals---especially biomedical, aerospace, mechanical processing courses. In addition, many problems in wireless communications, networking, signal processing senior level courses in wireless communications, networking, photonics, and signal processing, some
Gajic, Zoran
students interested in linear dynamic systems and signals--especially biomedical, aerospace, mechanical processing courses. In addition, many problems in wireless communications, networking, signal processing senior level courses in wireless communications, networking, photonics, and signal processing, some
Optimization Online - Efficient First-Order Methods for Linear ...
James Renegar
2014-09-27T23:59:59.000Z
Sep 27, 2014 ... Efficient First-Order Methods for Linear Programming and Semidefinite Programming. James Renegar (renegar ***at*** cornell.edu). Abstract: ...
Logo-like Learning of Basic Concepts of Algorithms -Having Fun with Algorithms
Logo-like Learning of Basic Concepts of Algorithms - Having Fun with Algorithms Gerald Futschek are not primarily interested in programming the way of learning is highly influenced by the Logo style of learning to design efficient algorithms. Keywords Logo-like learning, algorithms, group learning 1 2 3 4 5 n ... 1
Multisensor data fusion algorithm development
Yocky, D.A.; Chadwick, M.D.; Goudy, S.P.; Johnson, D.K.
1995-12-01T23:59:59.000Z
This report presents a two-year LDRD research effort into multisensor data fusion. We approached the problem by addressing the available types of data, preprocessing that data, and developing fusion algorithms using that data. The report reflects these three distinct areas. First, the possible data sets for fusion are identified. Second, automated registration techniques for imagery data are analyzed. Third, two fusion techniques are presented. The first fusion algorithm is based on the two-dimensional discrete wavelet transform. Using test images, the wavelet algorithm is compared against intensity modulation and intensity-hue-saturation image fusion algorithms that are available in commercial software. The wavelet approach outperforms the other two fusion techniques by preserving spectral/spatial information more precisely. The wavelet fusion algorithm was also applied to Landsat Thematic Mapper and SPOT panchromatic imagery data. The second algorithm is based on a linear-regression technique. We analyzed the technique using the same Landsat and SPOT data.
Program Optimization for Faster Genetic Programming
1998-04-24T23:59:59.000Z
[1] that together speed up the evolution process by at least a factor of ten. ..... Algorithm discovery using the genetic programming paradigm: Extracting ...
Optimization Online - Integer Programming Submissions - 2011
Integer Programming Submissions - 2011. January 2011. (Mixed) Integer Linear Programming A Computational Study of Finitely Convergent Polyhedral ...
Exploiting group symmetry in semidefinite programming relaxations ...
Etienne De Klerk
2007-06-13T23:59:59.000Z
Jun 13, 2007 ... QAPLIB - a quadratic assignment problem library. ... Category 1: Linear, Cone and Semidefinite Programming (Semi-definite Programming ).
Optimization Online - Improved semidefinite programming bounds ...
Etienne de Klerk
2009-09-17T23:59:59.000Z
Sep 17, 2009 ... ... programming bounds for quadratic assignment problems with suitable symmetry ... Category 1: Linear, Cone and Semidefinite Programming.
Euclid's Algorithm, Guass' Elimination and Buchberger's Algorithm
International Association for Cryptologic Research (IACR)
Euclid's Algorithm, Guass' Elimination and Buchberger's Algorithm Shaohua Zhang School of Mathematics, Shandong University, Jinan, Shandong, 250100, PRC Abstract: It is known that Euclid's algorithm, Guass' elimination and Buchberger's algorithm play important roles in algorithmic number the- ory
Miller, Naomi J.; Perrin, Tess E.; Royer, Michael P.; Wilkerson, Andrea M.; Beeson, Tracy A.
2014-05-20T23:59:59.000Z
Although lensed troffers are numerous, there are many other types of optical systems as well. This report looked at the performance of three linear (T8) LED lamps chosen primarily based on their luminous intensity distributions (narrow, medium, and wide beam angles) as well as a benchmark fluorescent lamp in five different troffer types. Also included are the results of a subjective evaluation. Results show that linear (T8) LED lamps can improve luminaire efficiency in K12-lensed and parabolic-louvered troffers, effect little change in volumetric and high-performance diffuse-lensed type luminaires, but reduce efficiency in recessed indirect troffers. These changes can be accompanied by visual appearance and visual comfort consequences, especially when LED lamps with clear lenses and narrow distributions are installed. Linear (T8) LED lamps with diffuse apertures exhibited wider beam angles, performed more similarly to fluorescent lamps, and received better ratings from observers. Guidance is provided on which luminaires are the best candidates for retrofitting with linear (T8) LED lamps.
A Near Maximum Likelihood Decoding Algorithm for MIMO Systems ...
2005-10-05T23:59:59.000Z
Jul 30, 2005 ... Graphic representation for the proposed randomization algorithm ..... to solve relaxation (34), we formulate the SDP model as a standard linear ...
Kolla, Alexandra
2009-01-01T23:59:59.000Z
2.3.1 Semidefinite Programming . . . . . . . . .developing semidefinite programming based algorithms for aof Semidefinite Programming. Making this connection
Topics in Approximation Algorithms
Khare, Monik
2012-01-01T23:59:59.000Z
Hybrid Algorithm . . . . . . . . . . . . . . . . . . . 2.42 Empirical study of algorithms for packing and covering 2.12.3.1 CPLEX algorithms . . . . . . . . . . . . . . . . . . .
When are two algorithms the same?
Andreas Blass; Nachum Dershowitz; Yuri Gurevich
2008-11-05T23:59:59.000Z
People usually regard algorithms as more abstract than the programs that implement them. The natural way to formalize this idea is that algorithms are equivalence classes of programs with respect to a suitable equivalence relation. We argue that no such equivalence relation exists.
Kernel Density Based Linear Regression Estimate and Zhibiao Zhao
Zhao, Zhibiao
Kernel Density Based Linear Regression Estimate Weixin Yao and Zhibiao Zhao Abstract For linear regression models with non-normally distributed errors, the least squares estimate (LSE) will lose some words: EM algorithm, Kernel density estimate, Least squares estimate, Linear regression, Maximum
STATISTICAL MODEL OF SYSTEMATIC ERRORS: LINEAR ERROR MODEL
Rudnyi, Evgenii B.
to apply. The algorithm to maximize a likelihood function in the case of a non-linear physico - the same variances of errors 3.1. One-way classification 3.2. Linear regression 4. Real case (vaporizationSTATISTICAL MODEL OF SYSTEMATIC ERRORS: LINEAR ERROR MODEL E.B. Rudnyi Department of Chemistry
Evolutionary Non-linear Great Deluge for University Course Timetabling
Landa-Silva, Dario
Evolutionary Non-linear Great Deluge for University Course Timetabling Dario Landa-Silva and Joe-linear great deluge algorithm in which evolutionary opera- tors are incorporated. First, we generate of the evo- lutionary operators. Our results show that the hybrid between non-linear great deluge
Upcoming Numerical Linear Algebra Issues in Systems and Control Theory
Upcoming Numerical Linear Algebra Issues in Systems and Control Theory Paul Van Dooren University in the interdisciplinary area of numerical linear algebra and systems and control theory. Although we do not claimto, and normalized coprime factorizations in robust control. Key words. Numerical algorithms, linear algebra, sparse
Upcoming Numerical Linear Algebra Issues in Systems and Control Theory
Upcoming Numerical Linear Algebra Issues in Systems and Control Theory Paul Van Dooren University in the interdisciplinary area of numerical linear algebra and systems and control theory. Although we do not claim, and normalized coprime factorizations in robust control. Key words. Numerical algorithms, linear algebra, sparse
Generic Optimization Program User Manual Version 3.0.0
Wetter, Michael
2009-05-11T23:59:59.000Z
GenOpt is an optimization program for the minimization of a cost function that is evaluated by an external simulation program. It has been developed for optimization problems where the cost function is computationally expensive and its derivatives are not available or may not even exist. GenOpt can be coupled to any simulation program that reads its input from text files and writes its output to text files. The independent variables can be continuous variables (possibly with lower and upper bounds), discrete variables, or both, continuous and discrete variables. Constraints on dependent variables can be implemented using penalty or barrier functions. GenOpt uses parallel computing to evaluate the simulations. GenOpt has a library with local and global multi-dimensional and one-dimensional optimization algorithms, and algorithms for doing parametric runs. An algorithm interface allows adding new minimization algorithms without knowing the details of the program structure. GenOpt is written in Java so that it is platform independent. The platform independence and the general interface make GenOpt applicable to a wide range of optimization problems. GenOpt has not been designed for linear programming problems, quadratic programming problems, and problems where the gradient of the cost function is available. For such problems, as well as for other problems, special tailored software exists that is more efficient.
The International Linear Collider
Marco Battaglia
2007-05-28T23:59:59.000Z
The International Linear Collider (ILC) is the next large scale project in accelerator particle physics. Colliding electrons with positrons at energies from 0.3 TeV up to about 1 TeV, the ILC is expected to provide the accuracy needed to complement the LHC data and extend the sensitivity to new phenomena at the high energy frontier and answer some of the fundamental questions in particle physics and in its relation to Cosmology. This paper reviews some highlights of the ILC physics program and some of the major challenges for the accelerator and detector design.
Reflections for quantum query algorithms
Ben W. Reichardt
2010-05-10T23:59:59.000Z
We show that any boolean function can be evaluated optimally by a quantum query algorithm that alternates a certain fixed, input-independent reflection with a second reflection that coherently queries the input string. Originally introduced for solving the unstructured search problem, this two-reflections structure is therefore a universal feature of quantum algorithms. Our proof goes via the general adversary bound, a semi-definite program (SDP) that lower-bounds the quantum query complexity of a function. By a quantum algorithm for evaluating span programs, this lower bound is known to be tight up to a sub-logarithmic factor. The extra factor comes from converting a continuous-time query algorithm into a discrete-query algorithm. We give a direct and simplified quantum algorithm based on the dual SDP, with a bounded-error query complexity that matches the general adversary bound. Therefore, the general adversary lower bound is tight; it is in fact an SDP for quantum query complexity. This implies that the quantum query complexity of the composition f(g,...,g) of two boolean functions f and g matches the product of the query complexities of f and g, without a logarithmic factor for error reduction. It further shows that span programs are equivalent to quantum query algorithms.
Nikolova, Evdokia Velinova
2009-01-01T23:59:59.000Z
Classical algorithms from theoretical computer science arise time and again in practice. However,a practical situations typically do not fit precisely into the traditional theoretical models. Additional necessary components ...
Active-set methods for quadratic programming
Wong, Elizabeth Lai Sum
2011-01-01T23:59:59.000Z
Quadratic Programming . . . . . . . . . . . . . . . . . . .QP Dual Quadratic Programming . . . . . . . . 4.14.2.1 Dual linear programming . . . 4.2.2 Degeneracy of the
Positrons for linear colliders
Ecklund, S.
1987-11-01T23:59:59.000Z
The requirements of a positron source for a linear collider are briefly reviewed, followed by methods of positron production and production of photons by electromagnetic cascade showers. Cross sections for the electromagnetic cascade shower processes of positron-electron pair production and Compton scattering are compared. A program used for Monte Carlo analysis of electromagnetic cascades is briefly discussed, and positron distributions obtained from several runs of the program are discussed. Photons from synchrotron radiation and from channeling are also mentioned briefly, as well as positron collection, transverse focusing techniques, and longitudinal capture. Computer ray tracing is then briefly discussed, followed by space-charge effects and thermal heating and stress due to showers. (LEW)
STANFORD LINEAR ACCELERATOR CENTER DIRECTOR'S OFFICE
Wechsler, Risa H.
of these offices not listed here. PART 1: RESEARCH & DEVELOPMENT PROGRAM MANAGEMENT RECORDS R&D Program Management records document the basis for research and development program management decisions, direction, policiesSTANFORD LINEAR ACCELERATOR CENTER DIRECTOR'S OFFICE RECORDS CONTROL SCHEDULE SCOPE: This schedule
Jacques Carolan; Chris Harrold; Chris Sparrow; Enrique Martín-López; Nicholas J. Russell; Joshua W. Silverstone; Peter J. Shadbolt; Nobuyuki Matsuda; Manabu Oguma; Mikitaka Itoh; Graham D. Marshall; Mark G. Thompson; Jonathan C. F. Matthews; Toshikazu Hashimoto; Jeremy L. O'Brien; Anthony Laing
2015-05-05T23:59:59.000Z
Linear optics underpins tests of fundamental quantum mechanics and computer science, as well as quantum technologies. Here we experimentally demonstrate the longstanding goal of a single reprogrammable optical circuit that is sufficient to implement all possible linear optical protocols up to the size of that circuit. Our six-mode universal system consists of a cascade of 15 Mach-Zehnder interferometers with 30 thermo-optic phase shifters integrated into a single photonic chip that is electrically and optically interfaced for arbitrary setting of all phase shifters, input of up to six photons and their measurement with a 12 single-photon detector system. We programmed this system to implement heralded quantum logic and entangling gates, boson sampling with verification tests, and six-dimensional complex Hadamards. We implemented 100 Haar random unitaries with average fidelity 0.999 $\\pm$ 0.001. Our system is capable of switching between these and any other linear optical protocol in seconds. These results point the way to applications across fundamental science and quantum technologies.
A Panoply of Quantum Algorithms
Bartholomew Furrow
2006-06-15T23:59:59.000Z
We create a variety of new quantum algorithms that use Grover's algorithm and similar techniques to give polynomial speedups over their classical counterparts. We begin by introducing a set of tools that carefully minimize the impact of errors on running time; those tools provide us with speedups to already-published quantum algorithms, such as improving Durr, Heiligman, Hoyer and Mhalla's algorithm for single-source shortest paths [quant-ph/0401091] by a factor of lg N. The algorithms we construct from scratch have a range of speedups, from O(E)->O(sqrt(VE lg V)) speedups in graph theory to an O(N^3)->O(N^2) speedup in dynamic programming.
Accelerating Majorization Algorithms
Jan de Leeuw
2011-01-01T23:59:59.000Z
incomplete data via the em algorithm. Journal of the RoyalACCELERATING MAJORIZATION ALGORITHMS JAN DE LEEUW Abstract.construc- tion of majorization algorithms and their rate of
Accelerating Majorization Algorithms
Leeuw, Jan de
2008-01-01T23:59:59.000Z
incomplete data via the em algorithm. Journal of the RoyalACCELERATING MAJORIZATION ALGORITHMS JAN DE LEEUW Abstract.construc- tion of majorization algorithms and their rate of
KIRKPATRICK, BONNIE
2011-01-01T23:59:59.000Z
41 3.2.1 The Peeling Algorithm and Elston-Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .46 iv 4 Algorithms for Inference 4.1 Gibbs
Generating All Efficient Extreme Points in Multiple Objective Linear ...
2007-06-21T23:59:59.000Z
for generating all efficient extreme points and all efficient extreme rays of a multiple objective linear programming problem (V P). As an application we solve the ...
T. T. Moh
2015-01-20T23:59:59.000Z
goal of this course is to enable you to recognize linear algebra problems ... descriptions of other people's solutions to problems that use linear algebra and to
Translation and integration of numerical atomic orbitals in linear molecules
Heinäsmäki, Sami, E-mail: sami.heinasmaki@gmail.com [Department of Physics, University of Oulu, FIN-90014, Oulu (Finland)] [Department of Physics, University of Oulu, FIN-90014, Oulu (Finland)
2014-02-14T23:59:59.000Z
We present algorithms for translation and integration of atomic orbitals for LCAO calculations in linear molecules. The method applies to arbitrary radial functions given on a numerical mesh. The algorithms are based on pseudospectral differentiation matrices in two dimensions and the corresponding two-dimensional Gaussian quadratures. As a result, multicenter overlap and Coulomb integrals can be evaluated effectively.
Dikin-type algorithms for dextrous grasping force optimization
Buss, M. [Technical Univ. of Munich (Germany). Inst. of Automatic Control Engineering; Faybusovich, L. [Univ. of Notre Dame, IN (United States). Dept. of Mathematics; Moore, J.B. [Australian National Univ., Canberra, Australia Capital Territory (Australia)
1998-08-01T23:59:59.000Z
One of the central issues in dextrous robotic hand grasping is to balance external forces acting on the object and at the same time achieve grasp stability and minimum grasping effort. A companion paper shows that the nonlinear friction-force limit constraints on grasping forces are equivalent to the positive definiteness of a certain matrix subject to linear constraints. Further, compensation of the external object force is also a linear constraint on this matrix. Consequently, the task of grasping force optimization can be formulated as a problem with semidefinite constraints. In this paper, two versions of strictly convex cost functions, one of them self-concordant, are considered. These are twice-continuously differentiable functions that tend to infinity at the boundary of possible definiteness. For the general class of such cost functions, Dikin-type algorithms are presented. It is shown that the proposed algorithms guarantee convergence to the unique solution of the semidefinite programming problem associated with dextrous grasping force optimization. Numerical examples demonstrate the simplicity of implementation, the good numerical properties, and the optimality of the approach.
Symmetries in Integer Programs
Bödi, R
2009-01-01T23:59:59.000Z
The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric integer programs are studied from a group theoretical viewpoint. We investigate the structure of integer solutions of integer programs and show that any integer program on n variables having an alternating group A_n as a group of symmetries can be solved in linear time in the number of variables.
Five Quantum Algorithms Using Quipper
Safat Siddiqui; Mohammed Jahirul Islam; Omar Shehab
2014-06-18T23:59:59.000Z
Quipper is a recently released quantum programming language. In this report, we explore Quipper's programming framework by implementing the Deutsch's, Deutsch-Jozsa's, Simon's, Grover's, and Shor's factoring algorithms. It will help new quantum programmers in an instructive manner. We choose Quipper especially for its usability and scalability though it's an ongoing development project. We have also provided introductory concepts of Quipper and prerequisite backgrounds of the algorithms for readers' convenience. We also have written codes for oracles (black boxes or functions) for individual algorithms and tested some of them using the Quipper simulator to prove correctness and introduce the readers with the functionality. As Quipper 0.5 does not include more than \\ensuremath{4 \\times 4} matrix constructors for Unitary operators, we have also implemented \\ensuremath{8 \\times 8} and \\ensuremath{16 \\times 16} matrix constructors.
Machine Learning: Foundations and Algorithms
Ben-David, Shai
with accident prevention systems that are built using machine learning algorithms. Machine learning is also to us). Machine learning tools are concerned with endowing programs with the ability to "learn if the learning process succeeded or failed? The second goal of this book is to present several key machine
Linear, Cone and Semidefinite Programming Submissions - 2014. January 2014. Linear Programming A strongly polynomial algorithm for linear optimization ...
Optimization Online - A Simple and Efficient Algorithm For Solving ...
Natashia Boland
2014-09-11T23:59:59.000Z
Sep 11, 2014 ... A Simple and Efficient Algorithm For Solving Three Objective Integer Programs. Natashia Boland(Natashia.Boland ***at*** newcastle.edu.au)
Optimization Online - A Constraint-Reduced Algorithm for ...
Sungwoo Park
2015-05-21T23:59:59.000Z
May 21, 2015 ... Park and O'Leary proposed a constraint-reduced predictor-corrector algorithm for semidefinite programming with polynomial global ...
Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems
Mackey, Niloufer
Hamilton and Jacobi come full circle: Jacobi algorithms for structured Hamiltonian eigenproblems. J. Eberlein To appear in Linear Algebra & its Applications Abstract We develop Jacobi algorithms- symmetric, symplectic, Jacobi method, quaternion, tensor product, structure-preserving, paral- lelizable
Fast Development of Dense Linear Algebra Codes on Graphics Processors
Batory, Don
Fast Development of Dense Linear Algebra Codes on Graphics Processors M. JesÂ´us Zafont, Alberto that facilitates the development of dense linear algebra algorithms on graphics processors applying the FLAME methodology. The interface, built on top of the NVIDIA CUBLAS library, implements all the com- putational
On Termination of Integer Linear Loops Joel Ouaknine
Oxford, University of
On Termination of Integer Linear Loops JoÂ¨el Ouaknine Department of Computer Science Oxford con- cerns the termination of simple linear loops of the form: x u ; while Bx c do x Ax + a , where initial integer vectors u, such a loop terminates. The correctness of our algorithm relies
On Termination of Integer Linear Loops Joel Ouaknine
Ouaknine, Joël
On Termination of Integer Linear Loops Jo¨el Ouaknine Department of Computer Science Oxford con- cerns the termination of simple linear loops of the form: x u ; while Bx c do x Ax + a , where initial integer vectors u, such a loop terminates. The correctness of our algorithm relies
Implementation of the Trigonometric LMS Algorithm using Original Cordic Rotation
Akhter, Nasrin; Fersouse, Lilatul; Khandaker, Faria
2010-01-01T23:59:59.000Z
The LMS algorithm is one of the most successful adaptive filtering algorithms. It uses the instantaneous value of the square of the error signal as an estimate of the mean-square error (MSE). The LMS algorithm changes (adapts) the filter tap weights so that the error signal is minimized in the mean square sense. In Trigonometric LMS (TLMS) and Hyperbolic LMS (HLMS), two new versions of LMS algorithms, same formulations are performed as in the LMS algorithm with the exception that filter tap weights are now expressed using trigonometric and hyperbolic formulations, in cases for TLMS and HLMS respectively. Hence appears the CORDIC algorithm as it can efficiently perform trigonometric, hyperbolic, linear and logarithmic functions. While hardware-efficient algorithms often exist, the dominance of the software systems has kept those algorithms out of the spotlight. Among these hardware- efficient algorithms, CORDIC is an iterative solution for trigonometric and other transcendental functions. Former researches wor...
Rios, A. B. [Escuela de Ciencia y Tecnologia--Universidad Nacional de San Martin (UNSAM) (Argentina); Consejo Nacional de Investigaciones Cientificas y Tecnicas (CONICET) (Argentina); Valda, A.; Somacal, H. [Escuela de Ciencia y Tecnologia-Universidad Nacional de San Martin (UNSAM) (Argentina); Laboratorio Tandar, Comision Nacional de Energia Atomica (CNEA) (Argentina)
2007-10-26T23:59:59.000Z
Usually tomographic procedure requires a set of projections around the object under study and a mathematical processing of such projections through reconstruction algorithms. An accurate reconstruction requires a proper number of projections (angular sampling) and a proper number of elements in each projection (linear sampling). However in several practical cases it is not possible to fulfill these conditions leading to the so-called problem of few projections. In this case, iterative reconstruction algorithms are more suitable than analytic ones. In this work we present a program written in C++ that provides an environment for two iterative algorithm implementations, one algebraic and the other statistical. The software allows the user a full definition of the acquisition and reconstruction geometries used for the reconstruction algorithms but also to perform projection and backprojection operations. A set of analysis tools was implemented for the characterization of the convergence process. We analyze the performance of the algorithms on numerical phantoms and present the reconstruction of experimental data with few projections coming from transmission X-ray and micro PIXE (Particle-Induced X-Ray Emission) images.
LCFIPlus: A Framework for Jet Analysis in Linear Collider Studies
Suehara, Taikan
2015-01-01T23:59:59.000Z
We report on the progress in flavor identification tools developed for a future $e^+e^-$ linear collider such as the International Linear Collider (ILC) and Compact Linear Collider (CLIC). Building on the work carried out by the LCFIVertex collaboration, we employ new strategies in vertex finding and jet finding, and introduce new discriminating variables for jet flavor identification. We present the performance of the new algorithms in the conditions simulated using a detector concept designed for the ILC. The algorithms have been successfully used in ILC physics simulation studies, such as those presented in the ILC Technical Design Report.
LCFIPlus: A Framework for Jet Analysis in Linear Collider Studies
Taikan Suehara; Tomohiko Tanabe
2015-06-28T23:59:59.000Z
We report on the progress in flavor identification tools developed for a future $e^+e^-$ linear collider such as the International Linear Collider (ILC) and Compact Linear Collider (CLIC). Building on the work carried out by the LCFIVertex collaboration, we employ new strategies in vertex finding and jet finding, and introduce new discriminating variables for jet flavor identification. We present the performance of the new algorithms in the conditions simulated using a detector concept designed for the ILC. The algorithms have been successfully used in ILC physics simulation studies, such as those presented in the ILC Technical Design Report.
A computer program for linear models
Zerbe, Manfred Rudolf
1966-01-01T23:59:59.000Z
M tel II} UJ ct 4 I-X ZORIL 0 0 Z 0 8o II UJ 2 OI 0 U. 0 X Z 4} Il } UI } X 4 X 2 IA III 0 ~ X I 4} c CLI UJ ct 0 X I-0 ttSON N 4. \\9 ~ IA 0 0 2 J J + N U 0 N 0 0 I- UJ UJ 0 D N 4 Z U. 0 U K Z Y 8 UJ X 0& ct r... 9 18 3 19 12 3 12 21 -4 -13. 3 -133. 0 albi aib2 a2bi -4 14 9 14 96. 0 35. 5 99. 7 a2b2 8 15 91. 6 73 IG IO M ID 'll 'P M f33 M LI3 M N M M ft3 tt3 N N ? N Yl N CII 0 I Iff N I33 0 Q ICI 0 0 Lt3 0 O 0 0 0 0 0 0 ICI 0 O M 0 M 0 0 0...
Iterative Estimation Maximization for Stochastic Linear Programs ...
2009-03-26T23:59:59.000Z
Pu Huang. IBM T.J.Watson Research Center ... samples, which makes it extreme efficient for real-world, large-scale problems. ... problem using an S&P 500 data set. ..... 1 Consumer Discretionary. 80. 2 Consumer Staples. 41. 3 Energy. 39.
Limitations of Linear and Semidefinite Programs
Schoenebeck, Grant Robert
2010-01-01T23:59:59.000Z
2006. [29] Madhur Tulsiani. CSP gaps and reductions in thecannot prove that a random k-CSP over any predicate impliedi j ? } k }) The language k-CSP-P consists of satis?able k-
SDDP FOR MULTISTAGE STOCHASTIC LINEAR PROGRAMS ...
2012-08-20T23:59:59.000Z
stochastic uncertainty in engineering, transportation, finance and energy. ...... Energy. Springer, New York, 2011. [4] J. Cotter and K. Dowd. Extreme spectral risk ...
SA305: Linear Programming Spring 2013
Phillips, David
to Optimization Modeling Example 1. (Example 1.1 on page 5 in the book) Farmer Jones decides to supplement his income by baking and selling two types of cakes, chocolate and vanilla. Each chocolate cake sold gives to maximize Farmer Jones' profit? Problem definition and Data Gathering What are we trying to solve? Creating
Optimal portfolios using Linear Programming models
Cpu
2002-10-17T23:59:59.000Z
Feb 12, 2003 ... The problem. The portfolio manager Sigma wants to construct an optimal portfolio for a customer. .... It is easy to show that it is also possible ...
Polynomial Approximations for Continuous Linear Programs
2012-04-05T23:59:59.000Z
Imperial College of Science, Technology, and Medicine. 180 Queen's Gate, London SW7 2BZ, UK ...... for the air cargo industry. Working paper, Carnegie Mellon ...
A computer program for linear models
Zerbe, Manfred Rudolf
1966-01-01T23:59:59.000Z
whe re: (X'X) ! s the sum of squares and crossproducts ~atrix of the X matrix. (X'Y);s the sum of crossprcducts matrix of the x's with Y. I2 C is (X'X) It should be noted that (X'X), hence (X'X) , is a symmetric matrix and is in many practical.... Courant, Differential and Inte ral Calculus &New York: Interscience Publishers, Inc. , I%61) p. 2 18 12 2 22 3 13 4 n(n+I} n(n+I) nn It is possible to obtain the subscript of an element in the X array given the subscripts of the element of the A...
On semidefinite programming bounds for graph bandwidth
Etienne De Klerk
2011-06-06T23:59:59.000Z
Jun 6, 2011 ... Keywords: Graph bandwidth, cyclic bandwidth, semidefinite programming, quadratic assignment problem. Category 1: Linear, Cone and ...
Design Optimization of electromagnetic actuator by genetic algorithm
ELBEZ
2008-02-26T23:59:59.000Z
condition in the design or in the optimization of electromagnetic ... propose a new approach to optimize linear actuator. This new .... derivative of the stored magnetic energy with respect ..... H. Poorzahedy “Hybrid meta-heuristic algorithms.
The Microscopic Linear Dynamics
Penny, Will
The Microscopic Brain Will Penny Linear Dynamics Exponentials Matrix Exponential Eigendecomposition Dynamical Modes Nodes State Space Saddles Oscillations Spirals Centres Offsets Retinal Circuit Nullclines Stability Spiking Neurons Fitzhugh-Nagumo Nonlinear Dynamics Linearization Nonlinear Oscillation Excitable
Zeghib, Abdelghani
Introduction Results Linear Dynamics Lorentz Dynamics Actions of discrete groups on stationary Piccione) Geodeycos Meeting, Lyon, 28-30 April 2010 Abdelghani Zeghib Dynamics on Lorentz manifolds #12;Introduction Results Linear Dynamics Lorentz Dynamics Motivations and questions Examples 1 Introduction
Generalized Linear Quadratic Control
Gattami, Ather Said
We consider the problem of stochastic finite- and infinite-horizon linear quadratic control under power constraints. The calculations of the optimal control law can be done off-line as in the classical linear quadratic ...
Introduction to Linear Relaxations
Introduction to Linear Relaxations by R. Baker Kearfott Department of Mathematics University relaxations; . discuss validation of linear relaxations. Intro. Linear Relaxations December, 2003 Taylor, . . . , m 2 , where # : R n # R and c i , g i : R n # R are guaranteed to be within one of the x # that has
Photon Linear Collider Gamma-Gamma Summary
Gronberg, J
2012-02-27T23:59:59.000Z
High energy photon - photon collisions can be achieved by adding high average power short-pulse lasers to the Linear Collider, enabling an expanded physics program for the facility. The technology required to realize a photon linear collider continues to mature. Compton back-scattering technology is being developed around the world for low energy light source applications and high average power lasers are being developed for Inertial Confinement Fusion.
Peak thrust operation of linear induction machines from parameter identification
Zhang, Z.; Eastham, T.R.; Dawson, G.E. [Queen`s Univ., Kingston, Ontario (Canada). Dept. of Electrical and Computer Engineering
1995-12-31T23:59:59.000Z
Various control strategies are being used to achieve high performance operation of linear drives. To maintain minimum volume and weight of the power supply unit on board the transportation vehicle, peak thrust per unit current operation is a desirable objective. True peak thrust per unit current through slip control is difficult to achieve because the parameters of linear induction machines vary during normal operation. This paper first develops a peak thrust per unit current control law based on the per-phase equivalent circuit for linear induction machines. The algorithm for identification of the variable parameters in induction machines is then presented. Application to an operational linear induction machine (LIM) demonstrates the utility of this algorithm. The control strategy is then simulated, based on an operational transit LIM, to show the capability of achieving true peak thrust operation for linear induction machines.
Approximation Algorithms for Covering Problems
Koufogiannakis, Christos
2009-01-01T23:59:59.000Z
1.3.1 Sequential Algorithms . . . . . . . . . . . . .Distributed 2-approximation algorithm for CMIP 2 (Alg.2 Sequential Algorithm 2.1 The Greedy Algorithm for Monotone
DUAL FACE ALGORITHM USING GAUSS-JORDAN ELIMINATION ...
2015-05-06T23:59:59.000Z
Primary 90C05; Secondary 65K05. Key words and phrases. linear programming, bounded-variable, dual face, dual optimal face, Gauss-. Jordan elimination .
An Exact Algorithm and a Local Search Heuristic for a Two Runway Scheduling Problem
Ravidas, Amrish Deep
2011-02-22T23:59:59.000Z
heuristic for a 25 aircraft scheduling problem has iv an average quality of 8% with respect to the optimal solution found by the general- ized dynamic programming algorithm. The heuristic can be used for both real-time and fast-time simulations of airport... and Brentnall?s Dynamic programming algorithm : : : : : : : : : : : : : : : : : : : : : : : : : 18 3 Average running time of GDP algorithm and Brentnall?s Dynamic programming algorithm for aircraft grouped to batches based on type 18 4 Average solution quality...
A Fast Algorithm for Chebyshev, Fourier & Sinc
Boyd, John P.
A Fast Algorithm for Chebyshev, Fourier & Sinc Interpolation Onto an Irregular Grid John P. Boyd or Fourier series may be evaluated on the standard collocation grid by the Fast Fourier Transform (FFT with the interpolation points {xj}. The cardinal functions Cj(x) are linear combinations of the underlying Fourier
LOCAL CONVERGENCE OF AN ALGORITHM FOR SUBSPACE ...
2014-07-01T23:59:59.000Z
algorithm for identifying a linear subspace of Rn from data consisting of partial observations of random vectors from that ..... Concepts of incoherence have been well studied .... Let us now write the update formula (1.2) as follows. Ut+1 := Ut +.
Linear accelerator for radioisotope production
Hansborough, L.D.; Hamm, R.W.; Stovall, J.E.
1982-02-01T23:59:59.000Z
A 200- to 500-..mu..A source of 70- to 90-MeV protons would be a valuable asset to the nuclear medicine program. A linear accelerator (linac) can achieve this performance, and it can be extended to even higher energies and currents. Variable energy and current options are available. A 70-MeV linac is described, based on recent innovations in linear accelerator technology; it would be 27.3 m long and cost approx. $6 million. By operating the radio-frequency (rf) power system at a level necessary to produce a 500-..mu..A beam current, the cost of power deposited in the radioisotope-production target is comparable with existing cyclotrons. If the rf-power system is operated at full power, the same accelerator is capable of producing an 1140-..mu..A beam, and the cost per beam watt on the target is less than half that of comparable cyclotrons.
LED Linear Lamps and Troffer Lighting
Broader source: Energy.gov [DOE]
The CALiPER program performed a series of investigations on linear LED lamps. Each report in the series covers the performance of up to 31 linear LED lamps, which were purchased in late 2012 or 2013. The first report focuses on bare lamp performance of LED T8 replacement lamps and subsequent reports examine performance in various troffers, as well as cost-effectiveness. There is also a concise guidance document that describes the findings of the Series 21 studies and provides practical advice to manufacturers, specifiers, and consumers (Report 21.4: Summary of Linear (T8) LED Lamp Testing , 5 pages, June 2014).
A Gibbs Sampler for Multivariate Linear Regression
Mantz, Adam B
2015-01-01T23:59:59.000Z
Kelly (2007, hereafter K07) described an efficient algorithm, using Gibbs sampling, for performing linear regression in the fairly general case where non-zero measurement errors exist for both the covariates and response variables, where these measurements may be correlated (for the same data point), where the response variable is affected by intrinsic scatter in addition to measurement error, and where the prior distribution of covariates is modeled by a flexible mixture of Gaussians rather than assumed to be uniform. Here I extend the K07 algorithm in two ways. First, the procedure is generalized to the case of multiple response variables. Second, I describe how to model the prior distribution of covariates using a Dirichlet process, which can be thought of as a Gaussian mixture where the number of mixture components is learned from the data. I present an example of multivariate regression using the extended algorithm, namely fitting scaling relations of the gas mass, temperature, and luminosity of dynamica...
Impulsive observer-based control for linear systems using irregularly sampled measurements
Paris-Sud XI, Université de
Impulsive observer-based control for linear systems using irregularly sampled measurements Y linear state feedback controller and an impulsive observer to provide an estimate the non-measured states, which are subsequently fed back in the control algorithm. We consider linear systems that can
A New Book "NUMERICAL METHODS FOR LINEAR CONTROL SYSTEMS DESIGN AND ANALYSIS"
Datta, Biswa
A New Book "NUMERICAL METHODS FOR LINEAR CONTROL SYSTEMS DESIGN AND ANALYSIS" by Biswa Nath Datta I am pleased to announce publication of my book: "Numerical Methods for Linear Control Systems Design-of-the-art computationally viable algorithms for major tasks arising in linear control systems design and analysis
Event-triggered control with LQ optimality guarantees for saturated linear systems
Paris-Sud XI, Université de
Event-triggered control with LQ optimality guarantees for saturated linear systems A. Seuret , C of the domain of attraction. Keywords: event-based control, input saturation, linear quadratic performance 1 with event-triggered control algorithms for linear systems subject to plant input saturation. Hence, given
978-1-4799-3230-6/13/$31.00 2013 339 Automatic Programming Using Genetic Programming
Fernandez, Thomas
978-1-4799-3230-6/13/$31.00 ©2013 339 Automatic Programming Using Genetic Programming Kevin Igwe Africa pillayn32@ukzn.ac.za Abstract--Genetic programming (GP) is an evolutionary algorithm which explores a program space rather than a solution space which is typical of other evolutionary algorithms
Linear Sum Assignment Algorithms for Distributed Multi-robot Systems
Liu, Lantao
2013-04-30T23:59:59.000Z
Multi-robot task assignment (allocation) involves assigning robots to tasks in order to optimize the entire team’s performances. Until now, one of the most useful non-domain-specific ways to coordinate multi-robot systems is through task allocation...
An efficient algorithm for damper optimization for linear vibrating systems
Truhar, Ninoslav
of the bridge with the wind induced oscillatory forces. For the majority of engineering applications, resonance, used in [14], is given by requirement of the minimization of the total energy of the system, that is 0 E(t) dt = min (1.4) The advantage of this criterion are: (i) its obvious closeness to the total en
General Realization Algorithm for Modal Identification of Linear Dynamic Systems
De Callafon, Raymond A.; Moaveni, Babak; Conte, Joel P; He, Xianfei; Udd, Eric
2008-01-01T23:59:59.000Z
depends only on step response data yields significantlydifferentiating the step response measurements (de Callafonstep process that includes a state reconstruction followed by a least squares optimization yielding a minimum prediction error for the response.
General Realization Algorithm for Modal Identification of Linear Dynamic Systems
De Callafon, Raymond A.; Moaveni, Babak; Conte, Joel P; He, Xianfei; Udd, Eric
2008-01-01T23:59:59.000Z
Veletsos, A. S. , and Ventura, C. E. (1986). “Modal analysisdamping matrix C (Veletsos and Ventura 1986). The latter wasfrequencies (Veletsos and Ventura 1986), differ from the
A TRUST REGION INTERIOR POINT ALGORITHM FOR LINEARLY CONSTRAINED OPTIMIZATION
Bonnans, Frédéric
, and Terlaky [8], Jarre [15], Mehrotra and Sun [19], McCormick [18], Monteiro and Adler [20], Dennis
L1 Regularization Path Algorithm for Generalized Linear Models
Hastie, Trevor
of the paths; we suggest intuitive and flexible strategies for choosing appropriate values. We demonstrate: ^() = argmin {- log L(y; ) + 1}, (2) where > 0 is the regularization parameter. Logistic regression with L1 the most complex stage possible. By generating the regularization path rather than computing solutions
Non-linear Dynamics in Multiagent Reinforcement Learning Algorithms
Massachusetts at Amherst, University of
British University Dubai, United Arab Emirates sherief.abdallah@buid.ac.ae Victor Lesser University model of the en- vironment. This ability is particularly important when the world is not fully
Evolving Recursive Programs by Using Adaptive Grammar Based Genetic Programming
Fernandez, Thomas
Page 1 Evolving Recursive Programs by Using Adaptive Grammar Based Genetic Programming Man Leung@ln.edu.hk Abstract Genetic programming (GP) extends traditional genetic algorithms to automatically induce computer programs. GP has been applied in a wide range of applications such as software re- engineering, electrical
Fault tolerant linear actuator
Tesar, Delbert
2004-09-14T23:59:59.000Z
In varying embodiments, the fault tolerant linear actuator of the present invention is a new and improved linear actuator with fault tolerance and positional control that may incorporate velocity summing, force summing, or a combination of the two. In one embodiment, the invention offers a velocity summing arrangement with a differential gear between two prime movers driving a cage, which then drives a linear spindle screw transmission. Other embodiments feature two prime movers driving separate linear spindle screw transmissions, one internal and one external, in a totally concentric and compact integrated module.
Using Linearity Web Copyright 2007
Rodriguez, Carlos
Using Linearity Web Rev. 2.0 May 2007 Copyright © 2007 #12;Using Linearity Web i Contents Introduction to Linearity Web.............................................................................1 Features, Benefits, and Value of Linearity Web..............................................1 Before You
A cooperative control algorithm for camera based observational systems.
Young, Joseph G.
2012-01-01T23:59:59.000Z
Over the last several years, there has been considerable growth in camera based observation systems for a variety of safety, scientific, and recreational applications. In order to improve the effectiveness of these systems, we frequently desire the ability to increase the number of observed objects, but solving this problem is not as simple as adding more cameras. Quite often, there are economic or physical restrictions that prevent us from adding additional cameras to the system. As a result, we require methods that coordinate the tracking of objects between multiple cameras in an optimal way. In order to accomplish this goal, we present a new cooperative control algorithm for a camera based observational system. Specifically, we present a receding horizon control where we model the underlying optimal control problem as a mixed integer linear program. The benefit of this design is that we can coordinate the actions between each camera while simultaneously respecting its kinematics. In addition, we further improve the quality of our solution by coupling our algorithm with a Kalman filter. Through this integration, we not only add a predictive component to our control, but we use the uncertainty estimates provided by the filter to encourage the system to periodically observe any outliers in the observed area. This combined approach allows us to intelligently observe the entire region of interest in an effective and thorough manner.
W. B. Vasantha Kandasamy; Florentin Smarandache
2008-07-18T23:59:59.000Z
In this book, the authors introduce the notion of Super linear algebra and super vector spaces using the definition of super matrices defined by Horst (1963). This book expects the readers to be well-versed in linear algebra. Many theorems on super linear algebra and its properties are proved. Some theorems are left as exercises for the reader. These new class of super linear algebras which can be thought of as a set of linear algebras, following a stipulated condition, will find applications in several fields using computers. The authors feel that such a paradigm shift is essential in this computerized world. Some other structures ought to replace linear algebras which are over a century old. Super linear algebras that use super matrices can store data not only in a block but in multiple blocks so it is certainly more powerful than the usual matrices. This book has 3 chapters. Chapter one introduces the notion of super vector spaces and enumerates a number of properties. Chapter two defines the notion of super linear algebra, super inner product spaces and super bilinear forms. Several interesting properties are derived. The main application of these new structures in Markov chains and Leontief economic models are also given in this chapter. The final chapter suggests 161 problems mainly to make the reader understand this new concept and apply them.
MATHEMATICAL PROGRAMMING MODELS FOR ENVIRONMENTAL QUALITY CONTROL
Greenberg, Harvey J.
was a linear programming model for wastewater treatment plant design. Mathematical pro- gramming models an equivalent mathematical program or use mathematical programming to compute a fixed point. A primary goal
Simulation and Analysis of Various Routing Algorithms for Optical Networks
Bertsekas, Dimitri
of Problem Formulations . . . . . . . . . . . . . . . . . . . 8 2 Linear Programming Formulation 11 2.1 Multi . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.3 Integer-Linear Programming Formulation . . . . . . . . . . . . . . . . 12 2.4 Piece of Bachelor of Science in Electrical Engineering Abstract The problem of Routing and Wavelength Assignment
Splitting Algorithms for Convex Optimization and Applications to Sparse Matrix Factorization
Rong, Rong
2013-01-01T23:59:59.000Z
Algorithms . . . . . . . . . . . . . . . . . . . . . . .Splitting Algorithms . . . . .Proximal Point Algorithm . . . . . . . . . .
An investigation of two network flow optimization algorithms
Steelquist, John Anders
1973-01-01T23:59:59.000Z
in Chapter V. The program listing for the Out-of-Kilter algorithm and the SUP ERKIL algorithm can be found in Appendix B and Appendix C. These algorithms are applied to network flow problems. Network flow problems are solved through the application... applications. [ [4 5 12 161 Some of these have clarified and extended the range of applications of the Out-of-Kilter algorithm. Several computer codes have been written to apply the Out-of- Kilter algorithm to actual problems. The code used...
A Linearly Convergent Linear-Time First-Order Algorithm for Support ...
2009-04-08T23:59:59.000Z
P ? Rn and Q ? Rn, the support vector classification problem asks for the computation of a hyperplane ...... LIBSVM: A library for support vector machines, 2001.
Efficient Algebraic Representations for Throughput-Oriented Algorithms
McKinlay, Christopher E.
2013-01-01T23:59:59.000Z
Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . .Throughput-Oriented Algorithm Design Multilinear
A Filter Algorithm for Nonlinear Semidefinite Programming
2006-10-26T23:59:59.000Z
SSDP using a merit function (called Han penalty function) and a line search strategy. ... functions with penalty terms which adjustment can be problematic. ...... Furthermore, (22c) ensures that (?(xk), f(xk)) does not enter to the filter Fk?1.
A Sequential Convex Semidefinite Programming Algorithm for ...
2007-08-11T23:59:59.000Z
[3] and has been studied in several further articles as, for example, [1, 24]. ...... by PENSCP (w.r.t. a high quality approximation of the accurate solution computed.
New Algorithms for Nonlinear Generalized Disjunctive Programming
Grossmann, Ignacio E.
in distillation column), in the synthesis of process networks, and in the design and scheduling of batch, optimal positioning of new products and batch process design. Keywords: Generalized disjunctive networks and reactor networks), in process design (optimal positioning of product and feed location
Algorithms and Problem Solving Introduction
Razak, Saquib
Unit 16 1 Algorithms and Problem Solving · Introduction · What is an Algorithm? · Algorithm Properties · Example · Exercises #12;Unit 16 2 What is an Algorithm? What is an Algorithm? · An algorithm. · The algorithm must be general, that is, it should solve the problem for all possible input sets to the problem
V. M. Akulin; G. A. Kabatyanski; A. Mandilara
2015-06-19T23:59:59.000Z
We introduce with geometric means a density matrix decomposition of a multipartite quantum system of a finite dimension into two density matrices: a separable one, also known as the best separable approximation, and an essentially entangled one, which contains no product states components. We show that this convex decomposition can be achieved in practice with the help of an algorithm based on linear programming, which in the general case scales polynomially with the dimension of the multipartite system. Furthermore, we suggest methods for analyzing the multipartite entanglement content of the essentially entangled component and derive analytically an upper bound for its rank. We illustrate the algorithm at an example of a composed system of total dimension 12 undergoing loss of coherence due to classical noise and we trace the time evolution of its essentially entangled component. We suggest a "geometric" description of entanglement dynamics and show how it explains the well-known phenomena of sudden death and revival of multipartite entanglement.
Statistics of voltage drop in distribution circuits: a dynamic programming approach
Turitsyn, Konstantin S [Los Alamos National Laboratory
2010-01-01T23:59:59.000Z
We analyze a power distribution line with high penetration of distributed generation and strong variations of power consumption and generation levels. In the presence of uncertainty the statistical description of the system is required to assess the risks of power outages. In order to find the probability of exceeding the constraints for voltage levels we introduce the probability distribution of maximal voltage drop and propose an algorithm for finding this distribution. The algorithm is based on the assumption of random but statistically independent distribution of loads on buses. Linear complexity in the number of buses is achieved through the dynamic programming technique. We illustrate the performance of the algorithm by analyzing a simple 4-bus system with high variations of load levels.
Algorithms and Software for PCR Primer Design
Huang, Yu-Ting
2015-01-01T23:59:59.000Z
5.3.3 Algorithm . . . . . . . . . . . . . . . . . . . . .5.2.4 Algorithm . . . . . .clique problems and MCDPD . . . . . . . . . . . Algorithm 1
Optimization Online - A Sequential Quadratic Programming ...
Jose Luis Morales
2008-12-29T23:59:59.000Z
Dec 29, 2008 ... A Sequential Quadratic Programming Algorithm with an Additional Equality Constrained Phase. Jose Luis Morales(jmorales ***at*** itam.mx)
Analysis of Stability and Performance of Adaptation Algorithms with Time-invariant Gains
parameters of linear regression models are investigated. The considered class of algorithms apply linear time adaptation task is to estimate the parameter vector h t in a linear regression y t = ' #3; t h t + v t ; (1 straightforward. Performance analysis in the presence of a non-negligible time- varying feedback is performed
The PABTEC Algorithm for Passivity-Preserving Model Reduction of Circuit Equations
Reis, Timo
a modified nodal analysis (MNA), linear RLC circuits can be modelled by a linear system of differential. Electronic circuits often contain large linear RLC sub- networks that consist of resistors, inductorsThe PABTEC Algorithm for Passivity-Preserving Model Reduction of Circuit Equations Tatjana Stykel
Reconstruction algorithms for MRI
Bilgic?, Berkin
2013-01-01T23:59:59.000Z
This dissertation presents image reconstruction algorithms for Magnetic Resonance Imaging (MRI) that aims to increase the imaging efficiency. Algorithms that reduce imaging time without sacrificing the image quality and ...
Rubinfeld, Ronitt
Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion of the input. We discuss the types of answers that one can ...
Indigenous Algorithms, Organizations, and Rationality
Leaf, Murray
2008-01-01T23:59:59.000Z
Indigenous Optimizing Algorithm. Mathematical Anthropologythe use of maximizing algorithms in behavior is a crucialthe knowledge, rules, and algorithms that they apply. If we
Variational Algorithms for Marginal MAP
Liu, Q; Ihler, A
2013-01-01T23:59:59.000Z
2004. A. L. Yuille. CCCP algorithms to minimize the BetheA tutorial on MM algorithms. The American Statistician, 1(time approximation algorithms for the ising model. SIAM
Linearly parameterized bandits
Tsitsiklis, John N.
We consider bandit problems involving a large (possibly infinite) collection of arms, in which the expected reward of each arm is a linear function of an r-dimensional random vector Z ? ?(superscript r), where r ? 2. The ...
Linear Motor Powered Transportation
Thornton, Richard D.
This special issue on linear-motor powered transportation covers both supporting technologies and innovative transport systems in various parts of the World, as this technology moves from the lab to commercial operations. ...
Energy Science and Technology Software Center (OSTI)
002651IBMPC00 Algorithm for Accounting for the Interactions of Multiple Renewable Energy Technologies in Estimation of Annual Performance
Free Oscillations of a Linear Oscillator Eugene Butikov
Butikov, Eugene
of a Linear Torsion Oscillator The linear oscillator simulated in this computer program is a balanced flywheel whose center of mass lies on the axis of rotation. Such a flywheel may consist, for example, of a rod that passes through its center. A spiral spring with one end fixed and the other attached to the flywheel
Giorda, Paolo [Institute for Scientific Interchange, Villa Gualino Viale Settimio Severo 65, 10133 Turin (Italy); Iorio, Alfredo [Center for Theoretical Physics, Massachusetts Institute of Technology, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139-4307 (United States); INFN, Rome (Italy); Sen, Samik [School of Mathematics, Trinity College Dublin, Dublin 2 (Ireland); Sen, Siddhartha [School of Mathematics, Trinity College Dublin, Dublin 2 (Ireland); IACS, Jadavpur, Calcutta 700032 (India)
2004-09-01T23:59:59.000Z
We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-(1/2) SU(2) generalized coherent states. Surprisingly, we find evidence that the algorithm's success probability is not too severely modified by our semiclassical approximation. This suggests that it is worth pursuing practical implementations of the algorithm on semiclassical devices.
Physical Algorithms Roger Wattenhofer
Physical Algorithms Roger Wattenhofer Computer Engineering and Networks Laboratory TIK ETH Zurich to an ICALP 2010 invited talk, intending to encourage research in physical algorithms. The area of physical algorithms deals with networked systems of active agents. These agents have access to limited information
Brambley, Michael R.; Katipamula, Srinivas
2006-10-06T23:59:59.000Z
Pacific Northwest National Laboratory (PNNL) is assisting the U.S. Department of Energy (DOE) Distributed Energy (DE) Program by developing advanced control algorithms that would lead to development of tools to enhance performance and reliability, and reduce emissions of distributed energy technologies, including combined heat and power technologies. This report documents phase 2 of the program, providing a detailed functional specification for algorithms for performance monitoring and commissioning verification, scheduled for development in FY 2006. The report identifies the systems for which algorithms will be developed, the specific functions of each algorithm, metrics which the algorithms will output, and inputs required by each algorithm.
Finite Element Analyses of a Cyclically Loaded Linear Viscoelastic Biodegradable Stent
Murphy, Jason Kyle
2014-12-03T23:59:59.000Z
degradation behaviors on the performance of cylindrical annuli that mimic stents under cyclic loadings is examined. Two polymers are considered: poly-L-lactic acid (PLLA) and polyoxymethylene (POM). A numerical algorithm for an isotropic, linear, viscoelastic...
ACTIVE SUSPENSION CONTROL WITH DIRECT-DRIVE TUBULAR LINEAR BRUSHLESS PERMANENT-MAGNET MOTOR
Lee, Seungho
2010-01-16T23:59:59.000Z
Recently, active suspension has been applied to many commercial automobiles. To develop the control algorithm for active suspension, a quarter-car test bed was built by using a direct-drive tubular linear brushless permanent-magnet motor (LBPMM...
ACTIVE SUSPENSION CONTROL WITH DIRECT-DRIVE TUBULAR LINEAR BRUSHLESS PERMANENT-MAGNET MOTOR
Lee, Seungho
2010-01-16T23:59:59.000Z
Recently, active suspension has been applied to many commercial automobiles. To develop the control algorithm for active suspension, a quarter-car test bed was built by using a direct-drive tubular linear brushless ...
Optimization Online - A novel integer programming formulation for ...
Elder M. Macambira
2005-10-28T23:59:59.000Z
Oct 28, 2005 ... ... programming formulation for the K-SONET ring assignment problem ... a novel and compact 0-1 integer linear programming formulation for ...
Krylov space solvers for shifted linear systems
B. Jegerlehner
1996-12-15T23:59:59.000Z
We investigate the application of Krylov space methods to the solution of shifted linear systems of the form (A+\\sigma) x - b = 0 for several values of \\sigma simultaneously, using only as many matrix-vector operations as the solution of a single system requires. We find a suitable description of the problem, allowing us to understand known algorithms in a common framework and developing shifted methods basing on short recurrence methods, most notably the CG and the BiCGstab solvers. The convergence properties of these shifted solvers are well understood and the derivation of other shifted solvers is easily possible. The application of these methods to quark propagator calculations in quenched QCD using Wilson and Clover fermions is discussed and numerical examples in this framework are presented. With the shifted CG method an optimal algorithm for staggered fermions is available.
Optimization Online - Linear-quadratic control problem with a linear ...
L Faybusovich
2003-12-19T23:59:59.000Z
Dec 19, 2003 ... Abstract: We describe a complete solution of the linear-quaratic control problem with the linear term in the objective function on a semiinfinite ...
Communication Avoiding and Overlapping for Numerical Linear Algebra
Touriño, Juan
Communication Avoiding and Overlapping for Numerical Linear Algebra Evangelos Georganas1, Jorge exascale systems, communication cost must be avoided or overlapped. Communication-avoiding 2.5D algorithms. Communication overlap attempts to hide messaging latency by pipelining messages and overlapping
On Low-Complexity Decodable Universally Good Linear Codes
Médard, Muriel
] as well as provably good [For65], [For66]. and try to walk an analogous path to address practical codeOn Low-Complexity Decodable Universally Good Linear Codes Todd P. Coleman University of Illinois and construction of low-complexity decoding algorithms. We discuss the properties of `universally good codes
Model checking LTL over controllable linear systems is decidable
Pappas, George J.
Model checking LTL over controllable linear systems is decidable Paulo Tabuada and George J. Pappas Department of Electrical and Systems Engineering University of Pennsylvania Philadelphia, PA 19104 {tabuadap,pappasg}@seas.upenn.edu Abstract. The use of algorithmic verification and synthesis tools for hy- brid systems is currently limited
The design of linear algebra libraries for high performance computers
Dongarra, J.J. [Tennessee Univ., Knoxville, TN (United States). Dept. of Computer Science; [Oak Ridge National Lab., TN (United States); Walker, D.W. [Oak Ridge National Lab., TN (United States)
1993-08-01T23:59:59.000Z
This paper discusses the design of linear algebra libraries for high performance computers. Particular emphasis is placed on the development of scalable algorithms for MIMD distributed memory concurrent computers. A brief description of the EISPACK, LINPACK, and LAPACK libraries is given, followed by an outline of ScaLAPACK, which is a distributed memory version of LAPACK currently under development. The importance of block-partitioned algorithms in reducing the frequency of data movement between different levels of hierarchical memory is stressed. The use of such algorithms helps reduce the message startup costs on distributed memory concurrent computers. Other key ideas in our approach are the use of distributed versions of the Level 3 Basic Linear Algebra Subprograms (BLAS) as computational building blocks, and the use of Basic Linear Algebra Communication Subprograms (BLACS) as communication building blocks. Together the distributed BLAS and the BLACS can be used to construct higher-level algorithms, and hide many details of the parallelism from the application developer. The block-cyclic data distribution is described, and adopted as a good way of distributing block-partitioned matrices. Block-partitioned versions of the Cholesky and LU factorizations are presented, and optimization issues associated with the implementation of the LU factorization algorithm on distributed memory concurrent computers are discussed, together with its performance on the Intel Delta system. Finally, approaches to the design of library interfaces are reviewed.
Algorithms for Quantum Computers
Jamie Smith; Michele Mosca
2010-01-07T23:59:59.000Z
This paper surveys the field of quantum computer algorithms. It gives a taste of both the breadth and the depth of the known algorithms for quantum computers, focusing on some of the more recent results. It begins with a brief review of quantum Fourier transform based algorithms, followed by quantum searching and some of its early generalizations. It continues with a more in-depth description of two more recent developments: algorithms developed in the quantum walk paradigm, followed by tensor network evaluation algorithms (which include approximating the Tutte polynomial).
Relation between XL algorithm and Grobner Bases Algorithms
International Association for Cryptologic Research (IACR)
Relation between XL algorithm and Gr¨obner Bases Algorithms Makoto Sugita1 , Mitsuru Kawazoe2 the XL algorithm and Gr¨obner bases algorithms. The XL algorithm was proposed to be a more efficient algorithm to solve a system of equations with a special assumption with- out trying to calculate a whole Gr
August 2000 ((Mixed) Integer Nonlinear Programming ) Sven Leyffer ...
((Mixed) Integer Linear Programming ) ... Facets of The Cardinality Constrained Circuit Polytope ..... Analysis of MILP Techniques for the Pooling Problem
DSDP5 user guide - software for semidefinite programming.
Benson, S. J.; Ye, Y.; Mathematics and Computer Science
2006-01-24T23:59:59.000Z
DSDP implements the dual-scaling algorithm for semidefinite programming. The source code of this interior-point solver, written entirely in ANSI C, is freely available. The solver can be used as a subroutine library, as a function within the Matlab environment, or as an executable that reads and writes to files. Initiated in 1997, DSDP has developed into an efficient and robust general-purpose solver for semidefinite programming. Although the solver is written with semidefinite programming in mind, it can also be used for linear programming and other constraint cones. The features of DSDP include the following: a robust algorithm with a convergence proof and polynomially bounded complexity under mild assumptions on the data, primal and dual solutions, feasible solutions when they exist or approximate certificates of infeasibility, initial points that can be feasible or infeasible, relatively low memory requirements for an interior-point method, sparse and low-rank data structures, extensibility that allows applications to customize the solver and improve its performance, a subroutine library that enables it to be linked to larger applications, scalable performance for large problems on parallel architectures, and a well-documented interface and examples of its use. The package has been used in many applications and tested for efficiency, robustness, and ease of use. We welcome and encourage further use under the terms of the license included in the distribution.
6, 74277469, 2006 Linear ozone
Boyer, Edmond
ACPD 6, 74277469, 2006 Linear ozone photochemistry parametrizations A. J. Geer et al. Title Page Chemistry and Physics Discussions Evaluation of linear ozone photochemistry parametrizations Linear ozone photochemistry parametrizations A. J. Geer et al. Title Page Abstract Introduction
KWIC Index for Numerical Linear Algebra
Carpenter, J.A.
1983-07-01T23:59:59.000Z
This report is a sequel to ORNL/CSD-106 in the ongoing supplements to Professor A.S. Householder's KWIC Index for Numerical Algebra. Beginning with the previous supplement, the subject has been restricted to Numerical Linear Algebra, roughly characterized by the American Mathematical Society's classification sections 15 and 65F but with little coverage of infinite matrices, matrices over fields of characteristics other than zero, operator theory, optimization and those parts of matrix theory primarily combinatorial in nature. Some consideration is given to the uses of graph theory in Numerical Linear Algebra, particularly with respect to algorithms for sparse matrix computations. The period covered by this report is roughly the calendar year 1982 as measured by the appearance of the articles in the American Mathematical Society's Contents of Mathematical Publications lagging actual appearance dates by up to nearly half a year. The review citations are limited to the Mathematical Reviews (MR).
Sec$on Summary ! Properties of Algorithms
#12;Sec$on Summary ! Properties of Algorithms ! Algorithms for Searching and Sorting ! Greedy Algorithms ! Halting Problem #12;Problems and Algorithms ! In many. This procedure is called an algorithm. #12;Algorithms Definition: An algorithm
A C++ APPLICATION PROGRAMMING INTERFACE FOR BIASED ...
Rodrigo Franco Toso
object oriented application programming interface for the algorithmic frame- ... are part of the framework, including population management and evolutionary .... written in the C++ programming language and relies on its standard template.
Implications of Modern Semiconductor Technologies on Gate Sizing
Lee, John
2012-01-01T23:59:59.000Z
2.3.10 Linear programming based assignmentby running a linear programming assignment for minimizingtheir algorithm. Linear programming based assignment methods
Linear Algebra: Ideas and Applications
Linear Algebra: Ideas and Applications. [photo]. Welcome to the web page for Linear Algebra: Idaes and Applications by Richard Penney. This web site is ...
Parallelism of the SANDstorm hash algorithm.
Torgerson, Mark Dolan; Draelos, Timothy John; Schroeppel, Richard Crabtree
2009-09-01T23:59:59.000Z
Mainstream cryptographic hashing algorithms are not parallelizable. This limits their speed and they are not able to take advantage of the current trend of being run on multi-core platforms. Being limited in speed limits their usefulness as an authentication mechanism in secure communications. Sandia researchers have created a new cryptographic hashing algorithm, SANDstorm, which was specifically designed to take advantage of multi-core processing and be parallelizable on a wide range of platforms. This report describes a late-start LDRD effort to verify the parallelizability claims of the SANDstorm designers. We have shown, with operating code and bench testing, that the SANDstorm algorithm may be trivially parallelized on a wide range of hardware platforms. Implementations using OpenMP demonstrates a linear speedup with multiple cores. We have also shown significant performance gains with optimized C code and the use of assembly instructions to exploit particular platform capabilities.
Efficient scalable algorithms for hierarchically semiseparable matrices
Wang, Shen; Xia, Jianlin; Situ, Yingchong; Hoop, Maarten V. de
2011-09-14T23:59:59.000Z
Hierarchically semiseparable (HSS) matrix algorithms are emerging techniques in constructing the superfast direct solvers for both dense and sparse linear systems. Here, we develope a set of novel parallel algorithms for the key HSS operations that are used for solving large linear systems. These include the parallel rank-revealing QR factorization, the HSS constructions with hierarchical compression, the ULV HSS factorization, and the HSS solutions. The HSS tree based parallelism is fully exploited at the coarse level. The BLACS and ScaLAPACK libraries are used to facilitate the parallel dense kernel operations at the #12;ne-grained level. We have appplied our new parallel HSS-embedded multifrontal solver to the anisotropic Helmholtz equations for seismic imaging, and were able to solve a linear system with 6.4 billion unknowns using 4096 processors, in about 20 minutes. The classical multifrontal solver simply failed due to high demand of memory. To our knowledge, this is the #12;first successful demonstration of employing the HSS algorithms in solving the truly large-scale real-world problems. Our parallel strategies can be easily adapted to the parallelization of the other rank structured methods.
GREIT: a unified approach to 2D linear EIT reconstruction of lung images
Adler, Andy
GREIT: a unified approach to 2D linear EIT reconstruction of lung images Andy Adler1 , John H the distribution of ventilation. However, most clinical and physiological research in lung EIT is done using older algorithm for lung EIT, called GREIT (Graz consensus Reconstruction algorithm for EIT). This paper describes
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Paris-Sud XI, Université de
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic Fran¸cois Bobot1 oracle based on the Simplex pro- cedure. Our algorithm is proved sound, complete, and terminating are extensions of either the Simplex algorithm or the Fourier-Motzkin method. Both techniques first relax
Separable nonlinear programming
Bunton, Wiley Ray
1963-01-01T23:59:59.000Z
. . . An Example . . Development of the Simplex Algorithm Definition of Nonlinear Programming . Survey of Nonlinear Methods. . . . . . II. MILLER'S METHOD 10 The Algorithm. An Example . . Termination and Optimality. . . . . . . . . . . Modeling Devices... oils. In order to maximize daily profits. how much of each motor fuel should be made and how should the raw stocks be blended? Let: motor fuel A = premium gasoline motor fuel 8 = regular gasoline and let subscripts p and r refer to premium...
Spectral learning of linear dynamics from generalised-linear observations
a non-linear and non-Gaussian observation process. We use this approach to obtain estimates to the generalised-linear regression model [8]), where the expected value of an observation is given by a monotonicSpectral learning of linear dynamics from generalised-linear observations with application
QPL 2005 Preliminary Version De-linearizing linearity: projective quantum
Selinger, Peter
QPL 2005 Preliminary Version De-linearizing linearity: projective quantum axiomatics from strong the linear structure of Hilbert spaces into several constituents which play different roles in quantum)famous Birkhoff- von Neumann paper [7]. The bulk of the linear structure required to reason about quantum
Application of separable programming to optimization by geometric programming
Humber, Joseph Barker
1971-01-01T23:59:59.000Z
Mathematical Programming System/ 360 computer program (MPS/360) [3]. The program uses the method described in the previous chapter; i. e. , the "Delta Method" described by Hadley [2), The user must provide the following data: (i. ) The partition of each x... applied it to engineering design problems. Chapter II contains a detailed presentation of the theory of this technique. Once a pro'olem has been formulated as a geometric programming problem, its solution can then be approximated by linear programming...
Control algorithms for dynamic attenuators
Hsieh, Scott S., E-mail: sshsieh@stanford.edu [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Pelc, Norbert J. [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)] [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)
2014-06-15T23:59:59.000Z
Purpose: The authors describe algorithms to control dynamic attenuators in CT and compare their performance using simulated scans. Dynamic attenuators are prepatient beam shaping filters that modulate the distribution of x-ray fluence incident on the patient on a view-by-view basis. These attenuators can reduce dose while improving key image quality metrics such as peak or mean variance. In each view, the attenuator presents several degrees of freedom which may be individually adjusted. The total number of degrees of freedom across all views is very large, making many optimization techniques impractical. The authors develop a theory for optimally controlling these attenuators. Special attention is paid to a theoretically perfect attenuator which controls the fluence for each ray individually, but the authors also investigate and compare three other, practical attenuator designs which have been previously proposed: the piecewise-linear attenuator, the translating attenuator, and the double wedge attenuator. Methods: The authors pose and solve the optimization problems of minimizing the mean and peak variance subject to a fixed dose limit. For a perfect attenuator and mean variance minimization, this problem can be solved in simple, closed form. For other attenuator designs, the problem can be decomposed into separate problems for each view to greatly reduce the computational complexity. Peak variance minimization can be approximately solved using iterated, weighted mean variance (WMV) minimization. Also, the authors develop heuristics for the perfect and piecewise-linear attenuators which do not requirea priori knowledge of the patient anatomy. The authors compare these control algorithms on different types of dynamic attenuators using simulated raw data from forward projected DICOM files of a thorax and an abdomen. Results: The translating and double wedge attenuators reduce dose by an average of 30% relative to current techniques (bowtie filter with tube current modulation) without increasing peak variance. The 15-element piecewise-linear dynamic attenuator reduces dose by an average of 42%, and the perfect attenuator reduces dose by an average of 50%. Improvements in peak variance are several times larger than improvements in mean variance. Heuristic control eliminates the need for a prescan. For the piecewise-linear attenuator, the cost of heuristic control is an increase in dose of 9%. The proposed iterated WMV minimization produces results that are within a few percent of the true solution. Conclusions: Dynamic attenuators show potential for significant dose reduction. A wide class of dynamic attenuators can be accurately controlled using the described methods.
W. B. Vasantha Kandasamy; Florentin Smarandache
2010-12-08T23:59:59.000Z
In this book we use only special types of intervals and introduce the notion of different types of interval linear algebras and interval vector spaces using the intervals of the form [0, a] where the intervals are from Zn or Z+ \\cup {0} or Q+ \\cup {0} or R+ \\cup {0}. A systematic development is made starting from set interval vector spaces to group interval vector spaces. Vector spaces are taken as interval polynomials or interval matrices or just intervals over suitable sets or semigroups or groups. Main feature of this book is the authors have given over 350 examples. This book has six chapters. Chapter one is introductory in nature. Chapter two introduces the notion of set interval linear algebras of type one and two. Set fuzzy interval linear algebras and their algebras and their properties are discussed in chapter three. Chapter four introduces several types of interval linear bialgebras and bivector spaces and studies them. The possible applications are given in chapter five. Chapter six suggests nearly 110 problems of all levels.
Shaon Sahoo; Soumya Kanti Ganguly
2015-02-01T23:59:59.000Z
Contrary to the actual nonlinear Glauber model (NLGM), the linear Glauber model (LGM) is exactly solvable, although the detailed balance condition is not generally satisfied. This motivates us to address the issue of writing the transition rate ($w_j$) in a best possible linear form such that the mean squared error in satisfying the detailed balance condition is least. The advantage of this work is that, by studying the LGM analytically, we will be able to anticipate how the kinetic properties of an arbitrary Ising system depend on the temperature and the coupling constants. The analytical expressions for the optimal values of the parameters involved in the linear $w_j$ are obtained using a simple Moore-Penrose pseudoinverse matrix. This approach is quite general, in principle applicable to any system and can reproduce the exact results for one dimensional Ising system. In the continuum limit, we get a linear time-dependent Ginzburg-Landau (TDGL) equation from the Glauber's microscopic model of non-conservative dynamics. We analyze the critical and dynamic properties of the model, and show that most of the important results obtained in different studies can be reproduced by our new mathematical approach. We will also show in this paper that the effect of magnetic field can easily be studied within our approach; in particular, we show that the inverse of relaxation time changes quadratically with (weak) magnetic field and that the fluctuation-dissipation theorem is valid for our model.
A complete implementation of the conjugate gradient algorithm on a reconfigurable supercomputer
Dubois, David H [Los Alamos National Laboratory; Dubois, Andrew J [Los Alamos National Laboratory; Connor, Carolyn M [Los Alamos National Laboratory; Boorman, Thomas M [Los Alamos National Laboratory; Poole, Stephen W [ORNL
2008-01-01T23:59:59.000Z
The conjugate gradient is a prominent iterative method for solving systems of sparse linear equations. Large-scale scientific applications often utilize a conjugate gradient solver at their computational core. In this paper we present a field programmable gate array (FPGA) based implementation of a double precision, non-preconditioned, conjugate gradient solver for fmite-element or finite-difference methods. OUf work utilizes the SRC Computers, Inc. MAPStation hardware platform along with the 'Carte' software programming environment to ease the programming workload when working with the hybrid (CPUIFPGA) environment. The implementation is designed to handle large sparse matrices of up to order N x N where N <= 116,394, with up to 7 non-zero, 64-bit elements per sparse row. This implementation utilizes an optimized sparse matrix-vector multiply operation which is critical for obtaining high performance. Direct parallel implementations of loop unrolling and loop fusion are utilized to extract performance from the various vector/matrix operations. Rather than utilize the FPGA devices as function off-load accelerators, our implementation uses the FPGAs to implement the core conjugate gradient algorithm. Measured run-time performance data is presented comparing the FPGA implementation to a software-only version showing that the FPGA can outperform processors running up to 30x the clock rate. In conclusion we take a look at the new SRC-7 system and estimate the performance of this algorithm on that architecture.
Computational Study of Non-linear Great Deluge for University Course Timetabling
Landa-Silva, Dario
Computational Study of Non-linear Great Deluge for University Course Timetabling Joe Henry Obit and Dario Landa-Silva Abstract. The great deluge algorithm explores neighbouring solutions which the current water level. In the original great deluge method, the water level decreases steadily in a linear
Great Deluge with Non-linear Decay Rate for Solving Course Timetabling Problems
Landa-Silva, Dario
Great Deluge with Non-linear Decay Rate for Solving Course Timetabling Problems Dario Landa. The great deluge algorithm explores neighbouring solutions which are accepted if they are better than. In the original great deluge, the water level decreases steadily in a linear fashion. In this paper, we propose
A Parallel Modified Lagrangian Method for an Optimal Control Problem of a Linear Distributed@informatik.uni-halle.de Abstract We consider an optimal control problem for a Hilbert space valued linear* * stochastic Optimization, Control, Parallel Algorithms AMS Classification: 65Y05, 93E20, 93E23 1 Introduction
Linear Adaptive Infrared Image Fusion Chuong T. Nguyen and Joseph P. Havlicek
Havlicek, Joebob
Linear Adaptive Infrared Image Fusion Chuong T. Nguyen and Joseph P. Havlicek School of Electrical a new adaptive image fusion algorithm to address the decomposition level problem in the multiresolution fusion technique. The fusion scheme consists of two parallel processes which are linearly combined
Testing Linear Algebra Software Nicholas J. Higham, Department of Mathematics, University of
Higham, Nicholas J.
Testing Linear Algebra Software Nicholas J. Higham, Department of Mathematics, University error properties of the algorithms, with particular reference to the test software in LAPACK. Issues software, testing, linear algebra, backward error, LAPACK. 1 INTRODUCTION How can we test the correctness
Automatic Linear Orders (Revised Version)
Stephan, Frank
CDMTCS Research Report Series Automatic Linear Orders and Trees (Revised Version) Bakhadyr; Automatic Linear Orders and Trees Bakhadyr Khoussainov, Sasha Rubin and Frank Stephan November 13, 2003 emphasis is on trees and linear orders. We study the relationship between automatic linear orders and trees
Becker, Jörg D
2015-01-01T23:59:59.000Z
In many European countries the growth of the real GDP per capita has been linear since 1950. An explanation for this linearity is still missing. We propose that in artificial intelligence we may find models for a linear growth of performance. We also discuss possible consequences of the fact that in systems with linear growth the percentage growth goes to zero.
Development of neural network calibration algorithms for multi-port pressure probes
Kinser Robert Eric
1996-01-01T23:59:59.000Z
The development of an enhanced neural network training algorithm and program for the calibration of velocity measurement instrumentation is presented. The backpropagation-based program, PROBENET, is intended to be a robust self learning code...
ON SEMIDEFINITE PROGRAMMING RELAXATIONS OF THE ...
2009-02-08T23:59:59.000Z
To see this, note that every Hamiltonian circuit in a complete graph. ?Department of ...... Heuristic analysis, linear programming, and branch and bound.
Analysis of Stochastic Dual Dynamic Programming Method
2010-05-29T23:59:59.000Z
Abstract. In this paper we discuss statistical properties and convergence of the .... For a ? R, [a]+ := max{0,a}. ... Problem (2.2) is a linear programming problem.
Optimization Online - Integer Programming Submissions - 2013
January 2013. (Mixed) Integer Linear Programming ... Memory-Aware Parallelized RLT3 for Solving Quadratic Assignment Problems Peter Hahn, Amir Roth, ...
Improved semidefinite programming bounds for quadratic ...
2009-09-15T23:59:59.000Z
Sep 15, 2009 ... nite programming relaxations of the quadratic assignment problem, Math- ematical ... linear term since it arises when doing branch and bound.
Tang, Yu-Hang
2013-01-01T23:59:59.000Z
We present a scalable dissipative particle dynamics simulation code, fully implemented on the Graphics Processing Units (GPUs) using a hybrid CUDA/MPI programming model, which achieves 10-30 times speedup on a single GPU over 16 CPU cores and almost linear weak scaling across a thousand nodes. A unified framework is developed within which the efficient generation of the neighbor list and maintaining particle data locality are addressed. Our algorithm generates strictly ordered neighbor lists in parallel, while the construction is deterministic and makes no use of atomic operations or sorting. Such neighbor list leads to optimal data loading efficiency when combined with a two-level particle reordering scheme. A faster in situ generation scheme for Gaussian random numbers is proposed using precomputed binary signatures. We designed custom transcendental functions that are fast and accurate for evaluating the pairwise interaction. The correctness and accuracy of the code is verified through a set of test cases ...
Automatic Parallelization of Divide and Conquer Algorithms \\Lambda Radu Rugina and Martin Rinard
Rugina, Radu
algorithms. Our results show that the programs perform well and exhibit good speedup. 1 Introduction Divide that works well for small problem sizes terminates the recursion. Good divide and conquer algorithms exist@lcs.mit.edu Abstract Divide and conquer algorithms are a good match for modern parallel machines: they tend to have
An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
Polak, E.
1982-05-01T23:59:59.000Z
An implementable master algorithm for solving optimal design centering, tolerancing, and tuning problems is presented. This master algorithm decomposes the original nondifferentiable optimization problem into a sequence of ordinary nonlinear programming problems. The master algorithm generates sequences with accumulation points that are feasible and satisfy a new optimality condition, which is shown to be stronger than the one previously used for these problems.
Introduction to Programming ATS Short Course
Collett Jr., Jeffrey L.
Introduction to Programming ATS Short Course Objectives: Provide a general overview of programming) 2 Jan 27 Introduction to the concepts of programming, algorithm design (loops, statements: Kate Thayer-Calder 5 Feb 17 Introduction, developing a program, creating and compiling a Fortran
Banks, R.M.
1986-01-14T23:59:59.000Z
This patent describes a linear output nitinol engine consisting of a number of integrated communicating parts. The engine has an external support framework which is described in detail. The patent further describes a wire transport mechanism, a pair of linkage levers with a loom secured to them, a number of nitinol wires strung between the looms, and a power takeoff block secured to the linkage levers. A pulley positioned in a flip-flop supporting bracket and a power takeoff modality including a tension member connected to a power output cable in order to provide linear power output transmission is described. A method for biasing the timing and the mechanism for timing the synchronization of the throw over arms and the flip-flop of the pulley are also described.
Buttram, M.T.; Ginn, J.W.
1988-06-21T23:59:59.000Z
A linear induction accelerator includes a plurality of adder cavities arranged in a series and provided in a structure which is evacuated so that a vacuum inductance is provided between each adder cavity and the structure. An energy storage system for the adder cavities includes a pulsed current source and a respective plurality of bipolar converting networks connected thereto. The bipolar high-voltage, high-repetition-rate square pulse train sets and resets the cavities. 4 figs.
Combustion powered linear actuator
Fischer, Gary J. (Albuquerque, NM)
2007-09-04T23:59:59.000Z
The present invention provides robotic vehicles having wheeled and hopping mobilities that are capable of traversing (e.g. by hopping over) obstacles that are large in size relative to the robot and, are capable of operation in unpredictable terrain over long range. The present invention further provides combustion powered linear actuators, which can include latching mechanisms to facilitate pressurized fueling of the actuators, as can be used to provide wheeled vehicles with a hopping mobility.
Amesos2 and Belos: Direct and Iterative Solvers for Large Sparse Linear Systems
DOE Public Access Gateway for Energy & Science Beta (PAGES Beta)
Bavier, Eric; Hoemmen, Mark; Rajamanickam, Sivasankaran; Thornquist, Heidi
2012-01-01T23:59:59.000Z
Solvers for large sparse linear systems come in two categories: direct and iterative. Amesos2, a package in the Trilinos software project, provides direct methods, and Belos, another Trilinos package, provides iterative methods. Amesos2 offers a common interface to many different sparse matrix factorization codes, and can handle any implementation of sparse matrices and vectors, via an easy-to-extend C++ traits interface. It can also factor matrices whose entries have arbitrary “Scalar” type, enabling extended-precision and mixed-precision algorithms. Belos includes many different iterative methods for solving large sparse linear systems and least-squares problems. Unlike competing iterative solver libraries, Belos completely decouples themore »algorithms from the implementations of the underlying linear algebra objects. This lets Belos exploit the latest hardware without changes to the code. Belos favors algorithms that solve higher-level problems, such as multiple simultaneous linear systems and sequences of related linear systems, faster than standard algorithms. The package also supports extended-precision and mixed-precision algorithms. Together, Amesos2 and Belos form a complete suite of sparse linear solvers.« less
The International Linear Collider
Barish, Barry
2013-01-01T23:59:59.000Z
In this article, we describe the key features of the recently completed technical design for the International Linear Collider (ILC), a 200-500 GeV linear electron-positron collider (expandable to 1 TeV) that is based on 1.3 GHz superconducting radio-frequency (SCRF) technology. The machine parameters and detector characteristics have been chosen to complement the Large Hadron Collider physics, including the discovery of the Higgs boson, and to further exploit this new particle physics energy frontier with a precision instrument. The linear collider design is the result of nearly twenty years of R&D, resulting in a mature conceptual design for the ILC project that reflects an international consensus. We summarize the physics goals and capability of the ILC, the enabling R&D and resulting accelerator design, as well as the concepts for two complementary detectors. The ILC is technically ready to be proposed and built as a next generation lepton collider, perhaps to be built in stages beginning as a Hig...
A Branch-and-Cut Algorithm for the Stochastic Uncapacitated Lot ...
2004-02-09T23:59:59.000Z
A. Wagelmans, A. van Hoesel and A. Kolen. Economic lot sizing: An O(n log n) algorithm that runs in linear time in the Wagner-Whitin case. Operations Research ...
Control of linear systems subject to input constraints: a polynomial approach. \\Lambda
Henrion, Didier
rely on the extended Farkas lemma [14], linear programming [32, 9], eigenstructure assignment [8, 9Control of linear systems subject to input constraints: a polynomial approach. \\Lambda Didier Republic Abstract A polynomial approach is pursued for locally stabilizing discretetime linear systems
Java Programming Certificate Program
Loudon, Catherine
Java Programming Certificate Program COMPUTER PROGRAMMING The Java programming language lies that fuel the Internet economy. In addition, the portability inherent in Java is useful for programming languages are likely to encounter projects in the near future that require knowledge of Java. Who Should
Java Programming Certificate Program
Loudon, Catherine
Java Programming Certificate Program COMPUTER PROGRAMMING The Java programming language lies that fuel the Internet economy. In addition, the portability inherent in Java is useful for programming are likely to encounter projects in the near future that require knowledge of Java. Who Should Enroll
Combinatorial Phylogenetics of Reconstruction Algorithms
Kleinman, Aaron Douglas
2012-01-01T23:59:59.000Z
and A. Spillner. Consistency of the Neighbor-Net algorithm.Algorithms for Molecular Biology, 2:8, 2007. [10] P.D. Gusfield. Efficient algorithms for inferring evolutionary
Park, Joung Won
2010-10-12T23:59:59.000Z
, and Temperature (PVT) variations and increase high power input capability. After analyzing and designing a resistive feedback LNA, novel linearization methods were applied. A highly linear broadband LNA is designed and simulated in 65nm CMOS technology. Simulation...
Park, Joung Won
2010-10-12T23:59:59.000Z
In this work, a highly linear broadband Low Noise Amplifier (LNA) is presented. The linearity issue in broadband Radio Frequency (RF) front-end is introduced, followed by an analysis of the specifications and requirements of a broadband LNA through...
Linear Collider Physics Resource Book Snowmass 2001
Ronan (Editor), M.T.
2001-06-01T23:59:59.000Z
The American particle physics community can look forward to a well-conceived and vital program of experimentation for the next ten years, using both colliders and fixed target beams to study a wide variety of pressing questions. Beyond 2010, these programs will be reaching the end of their expected lives. The CERN LHC will provide an experimental program of the first importance. But beyond the LHC, the American community needs a coherent plan. The Snowmass 2001 Workshop and the deliberations of the HEPAP subpanel offer a rare opportunity to engage the full community in planning our future for the next decade or more. A major accelerator project requires a decade from the beginning of an engineering design to the receipt of the first data. So it is now time to decide whether to begin a new accelerator project that will operate in the years soon after 2010. We believe that the world high-energy physics community needs such a project. With the great promise of discovery in physics at the next energy scale, and with the opportunity for the uncovering of profound insights, we cannot allow our field to contract to a single experimental program at a single laboratory in the world. We believe that an e{sup +}e{sup -} linear collider is an excellent choice for the next major project in high-energy physics. Applying experimental techniques very different from those used at hadron colliders, an e{sup +}e{sup -} linear collider will allow us to build on the discoveries made at the Tevatron and the LHC, and to add a level of precision and clarity that will be necessary to understand the physics of the next energy scale. It is not necessary to anticipate specific results from the hadron collider programs to argue for constructing an e{sup +}e{sup -} linear collider; in any scenario that is now discussed, physics will benefit from the new information that e{sup +}e{sup -} experiments can provide. This last point merits further emphasis. If a new accelerator could be designed and built in a few years, it would make sense to wait for the results of each accelerator before planning the next one. Thus, we would wait for the results from the Tevatron before planning the LHC experiments, and wait for the LHC before planning any later stage. In reality accelerators require a long time to construct, and they require such specialized resources and human talent that delay can cripple what would be promising opportunities. In any event, we believe that the case for the linear collider is so compelling and robust that we can justify this facility on the basis of our current knowledge, even before the Tevatron and LHC experiments are done. The physics prospects for the linear collider have been studied intensively for more than a decade, and arguments for the importance of its experimental program have been developed from many different points of view. This book provides an introduction and a guide to this literature. We hope that it will allow physicists new to the consideration of linear collider physics to start from their own personal perspectives and develop their own assessments of the opportunities afforded by a linear collider.
The Leap-Frog Algorithm and Optimal Control: Theoretical Aspects
Noakes, Lyle
problems in IR 2 with bounded controls. The local time-optimal control solution of systems linear Riemannian manifolds. A direct application of this algorithm to #12;nd optimal control for systems-bang control solution of a system with bounded controls, which is well-understood in the plane. Key words: Time-optimal
Algorithms incorporating concurrency and caching
Fineman, Jeremy T
2009-01-01T23:59:59.000Z
This thesis describes provably good algorithms for modern large-scale computer systems, including today's multicores. Designing efficient algorithms for these systems involves overcoming many challenges, including concurrency ...
A New Backoff Algorithm for the IEEE 802.11 Distributed Coordination Function
Deng, Jing
is dynamically controlled by the Binary Ex- ponential Backoff (BEB) algorithm. The BEB scheme, as shown in some-performs the BEB scheme employed in the IEEE 802.11 MAC standard and the Multiplicative Increase Linear Decrease Exponential Backoff (BEB). In the BEB algorithm, the contention window is doubled every time a node
Editor's Note Owing to the increasing length of algorithms accepted for publication in ACM
Hoffman, Karla
Editor's Note Owing to the increasing length of algorithms accepted for publication in ACM,D.R. A test problem generator for discrete linear LI approximation problems. ACM Trans. Math. Softw. 6, 4 (Dec part of the listing is printed here. The complete listing is available from the ACM Algorithms
An Auto-Generated Real-Time Iteration Algorithm for Nonlinear MPC in the Microsecond Range
. Yet a differ- ent approach is the nonlinear real-time iteration (RTI) scheme [11,13]. Like. An overview of existing algorithms for fast non- linear MPC can be found in [14]. The RTI scheme has is to demonstrate that NMPC algorithms based on the RTI scheme can be optimized and auto-generated efficiently
Linear Solvers 1.Introduction [1
McCalley, James D.
linear algebra packages including LAPACK, ScaLAPACK and PETSc, are built on top of BLAS. Most of standard, portable solver libraries available, including: BLAS (Basic linear algebra subprograms): Many (Automatically Tuned Linear Algebra Software package) is a version of BLAS that, upon installation, tests
Wave functions of linear systems
Tomasz Sowinski
2007-06-05T23:59:59.000Z
Complete analysis of quantum wave functions of linear systems in an arbitrary number of dimensions is given. It is shown how one can construct a complete set of stationary quantum states of an arbitrary linear system from purely classical arguments. This construction is possible because for linear systems classical dynamics carries the whole information about quantum dynamics.
Simple Linear Regression Basic Ideas
Simple Linear Regression Basic Ideas Some Examples Least Squares Statistical View of Least Squares of Least Squares #12;Simple Linear Regression Basic Ideas Some Examples Least Squares Basic Ideas Suppose #12;Simple Linear Regression Basic Ideas Some Examples Least Squares Basic Ideas Suppose we have two
Special set linear algebra and special set fuzzy linear algebra
W. B. Vasantha Kandasamy; Florentin Smarandache; K. Ilanthenral
2009-12-30T23:59:59.000Z
The authors in this book introduce the notion of special set linear algebra and special set fuzzy Linear algebra, which is an extension of the notion set linear algebra and set fuzzy linear algebra. These concepts are best suited in the application of multi expert models and cryptology. This book has five chapters. In chapter one the basic concepts about set linear algebra is given in order to make this book a self contained one. The notion of special set linear algebra and their fuzzy analogue is introduced in chapter two. In chapter three the notion of special set semigroup linear algebra is introduced. The concept of special set n-vector spaces, n greater than or equal to three is defined and their fuzzy analogue is their fuzzy analogue is given in chapter four. The probable applications are also mentioned. The final chapter suggests 66 problems.
Design of active suspension control based upon use of tubular linear motor and quarter-car model
Allen, Justin Aaron
2008-10-10T23:59:59.000Z
The design, fabrication, and testing of a quarter-car facility coupled with various control algorithms are presented in this thesis. An experimental linear tubular motor, capable of producing a 52-N force, provides control ...
Pattern separation via ellipsoids and conic programming
Glineur, François
' & $ % Pattern separation via ellipsoids and conic programming Fran¸cois Glineur 1 of 1 05 ellipsoids and conic programming ' & $ % \\Upsilon \\Sigma \\Xi \\Pi Objective Machine learning ffl Separation problem ffl Classification Mathematical programming ffl Linear programming ffl Interiorpoint methods ffl
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms
Del Moral , Pierre
Randomized Algorithms with Splitting: Why the Classic Randomized Algorithms do not Work and how Abstract We show that the original classic randomized algorithms for approximate counting in NP simultaneously multiple Markov chains. We present several algorithms of the combined version, which we simple
The Complex Gaussian Kernel LMS algorithm
Bouboulis, Pantelis
2010-01-01T23:59:59.000Z
Although the real reproducing kernels are used in an increasing number of machine learning problems, complex kernels have not, yet, been used, in spite of their potential interest in applications such as communications. In this work, we focus our attention on the complex gaussian kernel and its possible application in the complex Kernel LMS algorithm. In order to derive the gradients needed to develop the complex kernel LMS (CKLMS), we employ the powerful tool of Wirtinger's Calculus, which has recently attracted much attention in the signal processing community. Writinger's calculus simplifies computations and offers an elegant tool for treating complex signals. To this end, the notion of Writinger's calculus is extended to include complex RKHSs. Experiments verify that the CKLMS offers significant performance improvements over the traditional complex LMS or Widely Linear complex LMS (WL-LMS) algorithms, when dealing with nonlinearities.
Linear equalities in blackbox optimization ?
Mathilde Peyrega
2014-05-28T23:59:59.000Z
May 28, 2014 ... From aeronautics to chemical engineering going through medical engineering and hydrology, these algorithms have several applications in a ...
GPU-Based Heuristic Solver for Linear Sum Assignment Problems Under Real-time Constraints
Roverso, Roberto; El-Beltagy, Mohammed; El-Ansary, Sameh
2011-01-01T23:59:59.000Z
In this paper we modify a fast heuristic solver for the Linear Sum Assignment Problem (LSAP) for use on Graphical Processing Units (GPUs). The motivating scenario is an industrial application for P2P live streaming that is moderated by a central node which is periodically solving LSAP instances for assigning peers to one another. The central node needs to handle LSAP instances involving thousands of peers in as near to real-time as possible. Our findings are generic enough to be applied in other contexts. Our main result is a parallel version of a heuristic algorithm called Deep Greedy Switching (DGS) on GPUs using the CUDA programming language. DGS sacrifices absolute optimality in favor of low computation time and was designed as an alternative to classical LSAP solvers such as the Hungarian and auctioning methods. The contribution of the paper is threefold: First, we present the process of trial and error we went through, in the hope that our experience will be beneficial to adopters of GPU programming for...
Hoshi, Takeo; Akiyama, Yohei
2013-01-01T23:59:59.000Z
A novel linear-algebraic algorithm, multiple Arnoldi method, was developed in an interdisciplinary study between physics and applied mathematics and realized one-hundred-million-atom (100-nm-scale) electronic state calculations on the K computer. The algorithms are Krylov-subspace solvers for generalized shifted linear equations and were implemented in our order-N calculation code ELSES (http://www.elses.jp/). Moreover, a method for calculating eigen states is presented as a theoretical extension.
Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources
Mimura, Kazushi
2011-01-01T23:59:59.000Z
A lossy compression algorithm for binary redundant i.i.d. sources is presented. The proposed scheme is based on sparse graph codes. By introducing a nonlinear function, redundant memoryless sequences can be compressed. We propose a linear complexity compressor based on the extended belief propagation, into which an inertia term is heuristically introduced, and show that it has near optimal performance for moderate blocklengths.
The International Linear Collider
Karsten Buesser
2013-06-13T23:59:59.000Z
The International Linear Collider (ILC) is a proposed electron-positron collider for the centre-of-mass energy range of 200 to 500 GeV and with upgrade options towards 1 TeV. The ILC would be the ideal tool to explore with high precision the properties of the new Higgs-like particle that has recently been discovered at the LHC with a mass of around 125 GeV. The ILC accelerator design is based on the mature superconducting technology that has been developed in the TESLA collaboration and that is currently being used for the European XFEL. The exploitation of the huge physics potential of the ILC is a challenge for the design of the ILC detectors.
Linear Algebraic Method for Non-Linear Map Analysis
Yu,L.; Nash, B.
2009-05-04T23:59:59.000Z
We present a newly developed method to analyze some non-linear dynamics problems such as the Henon map using a matrix analysis method from linear algebra. Choosing the Henon map as an example, we analyze the spectral structure, the tune-amplitude dependence, the variation of tune and amplitude during the particle motion, etc., using the method of Jordan decomposition which is widely used in conventional linear algebra.
International linear collider reference design report
Aarons, G.
2008-01-01T23:59:59.000Z
A. Loew, et al. , “International Linear Collider Technologyfor the International Linear Collider”, in preparation [37]for the International Linear Collider,” in PAC05,http://
Algorithmic Thomas Decomposition of Algebraic and Differential Systems
Bächler, Thomas; Lange-Hegermann, Markus; Robertz, Daniel
2011-01-01T23:59:59.000Z
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems, simplicity means triangularity, square-freeness and non-vanishing initials. Differential simplicity extends algebraic simplicity with involutivity. We build upon the constructive ideas of J. M. Thomas and develop them into a new algorithm for disjoint decomposition. The given paper is a revised version of a previous paper and includes the proofs of correctness and termination of our decomposition algorithm. In addition, we illustrate the algorithm with further instructive examples and describe its Maple implementation together with an experimental comparison to some other triangular decomposition algorithms.
Ricci, Laura
D in Computer Science #12;Introduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithmsIntroduction Epidemic virus diffusion: models Epidemic algorithms Gossip algorithms Epidemic Outline 1 Introduction 2 Epidemic virus diffusion: models 3 Epidemic algorithms 4 Gossip algorithms #12
Tiled QR factorization algorithms
Bouwmeester, Henricus; Langou, Julien; Robert, Yves
2011-01-01T23:59:59.000Z
This work revisits existing algorithms for the QR factorization of rectangular matrices composed of p-by-q tiles, where p >= q. Within this framework, we study the critical paths and performance of algorithms such as Sameh and Kuck, Modi and Clarke, Greedy, and those found within PLASMA. Although neither Modi and Clarke nor Greedy is optimal, both are shown to be asymptotically optimal for all matrices of size p = q^2 f(q), where f is any function such that \\lim_{+\\infty} f= 0. This novel and important complexity result applies to all matrices where p and q are proportional, p = \\lambda q, with \\lambda >= 1, thereby encompassing many important situations in practice (least squares). We provide an extensive set of experiments that show the superiority of the new algorithms for tall matrices.
Kliman, G.B.; Brynsvold, G.V.; Jahns, T.M.
1989-08-22T23:59:59.000Z
A winding and method of winding for a submersible linear pump for pumping liquid sodium are disclosed. The pump includes a stator having a central cylindrical duct preferably vertically aligned. The central vertical duct is surrounded by a system of coils in slots. These slots are interleaved with magnetic flux conducting elements, these magnetic flux conducting elements forming a continuous magnetic field conduction path along the stator. The central duct has placed therein a cylindrical magnetic conducting core, this core having a cylindrical diameter less than the diameter of the cylindrical duct. The core once placed to the duct defines a cylindrical interstitial pumping volume of the pump. This cylindrical interstitial pumping volume preferably defines an inlet at the bottom of the pump, and an outlet at the top of the pump. Pump operation occurs by static windings in the outer stator sequentially conveying toroidal fields from the pump inlet at the bottom of the pump to the pump outlet at the top of the pump. The winding apparatus and method of winding disclosed uses multiple slots per pole per phase with parallel winding legs on each phase equal to or less than the number of slots per pole per phase. The slot sequence per pole per phase is chosen to equalize the variations in flux density of the pump sodium as it passes into the pump at the pump inlet with little or no flux and acquires magnetic flux in passage through the pump to the pump outlet. 4 figs.
Kliman, Gerald B. (Schenectady, NY); Brynsvold, Glen V. (San Jose, CA); Jahns, Thomas M. (Schenectady, NY)
1989-01-01T23:59:59.000Z
A winding and method of winding for a submersible linear pump for pumping liquid sodium is disclosed. The pump includes a stator having a central cylindrical duct preferably vertically aligned. The central vertical duct is surrounded by a system of coils in slots. These slots are interleaved with magnetic flux conducting elements, these magnetic flux conducting elements forming a continuous magnetic field conduction path along the stator. The central duct has placed therein a cylindrical magnetic conducting core, this core having a cylindrical diameter less than the diameter of the cylindrical duct. The core once placed to the duct defines a cylindrical interstitial pumping volume of the pump. This cylindrical interstitial pumping volume preferably defines an inlet at the bottom of the pump, and an outlet at the top of the pump. Pump operation occurs by static windings in the outer stator sequentially conveying toroidal fields from the pump inlet at the bottom of the pump to the pump outlet at the top of the pump. The winding apparatus and method of winding disclosed uses multiple slots per pole per phase with parallel winding legs on each phase equal to or less than the number of slots per pole per phase. The slot sequence per pole per phase is chosen to equalize the variations in flux density of the pump sodium as it passes into the pump at the pump inlet with little or no flux and acquires magnetic flux in passage through the pump to the pump outlet.
6, 66276694, 2006 linearized ozone
Boyer, Edmond
ACPD 6, 66276694, 2006 CHEM2D-OPP linearized ozone photochemistry J. P. McCormack et al. Title Chemistry and Physics Discussions CHEM2D-OPP: A new linearized gas-phase ozone photochemistry.mccormack@nrl.navy.mil) 6627 #12;ACPD 6, 66276694, 2006 CHEM2D-OPP linearized ozone photochemistry J. P. McCormack et al
Linear Algebra 1: Computing canonical forms in exact linear
Pernet, Clément
Linear Algebra 1: Computing canonical forms in exact linear algebra Clément PERNET, LIG, where U is invertible Reduced echelon form: E = 1 0 0 1 0 1 Gauss-Jordan elimination #12 a field: B = U-1 AU Frobenius normal form (or canonical rational form): F = CP0 CP1 ... CPk
Identifying Redundant Linear Constraints in Systems of Linear ...
2006-06-22T23:59:59.000Z
Jun 22, 2006 ... redundant linear constraints from the system (2.1) and (2.2). ... It is informative to note that in the above theorem, the optimal ..... S. Boyd and L. El Ghaoui, “Linear Matrix Inequalities in System and Control Theory”, SIAM, vol.
Tavakoli, Ruhollah
2010-01-01T23:59:59.000Z
The structure of many real-world optimization problems includes minimization of a nonlinear (or quadratic) functional subject to bound and singly linear constraints (in the form of either equality or bilateral inequality) which are commonly called as continuous knapsack problems. Since there are efficient methods to solve large-scale bound constrained nonlinear programs, it is desirable to adapt these methods to solve knapsack problems, while preserving their efficiency and convergence theories. The goal of this paper is to introduce a general framework to extend a box-constrained optimization solver to solve knapsack problems. This framework includes two main ingredients which are O(n) methods; in terms of the computational cost and required memory; for the projection onto the knapsack constrains and the null-space manipulation of the related linear constraint. The main focus of this work is on the extension of Hager-Zhang active set algorithm (SIAM J. Optim. 2006, pp. 526--557). The main reasons for this ch...
12.010 Computational Methods of Scientific Programming, Fall 2008
Herring, Thomas
This course introduces programming languages and techniques used by physical scientists: FORTRAN, C, C++, MATLAB, and Mathematica. Emphasis is placed on program design, algorithm development and verification, and comparative ...
12.010 Computational Methods of Scientific Programming, Fall 2002
Herring, T. (Thomas)
This course introduces programming languages and techniques used by physical scientists: FORTRAN, C, C++, MATLAB®, and Mathematica®. Emphasis is placed on program design, algorithm development and verification, and comparative ...
12.010 Computational Methods of Scientific Programming, Fall 2007
Herring, T. (Thomas)
This course introduces programming languages and techniques used by physical scientists: FORTRAN, C, C++, Matlab, and Mathematica. Emphasis is placed on program design, algorithm development and verification, and comparative ...
12.010 Computational Methods of Scientific Programming, Fall 2005
Herring, T. (Thomas)
This course introduces programming languages and techniques used by physical scientists: FORTRAN, C, C++, Matlab, and Mathematica. Emphasis is placed on program design, algorithm development and verification, and comparative ...
Goddard III, William A.
146 Chapter VI The Parallel and Distributed Algorithms #12; 147 Abstract This chapter contains of concurrent computing. Based on the resonance method and program design described in Chapter V, an algorithm algorithm lends itself to effective parallelization. The main requirement for effective parallelization
Quantum algorithms for algebraic problems
Andrew M. Childs; Wim van Dam
2008-12-02T23:59:59.000Z
Quantum computers can execute algorithms that dramatically outperform classical computation. As the best-known example, Shor discovered an efficient quantum algorithm for factoring integers, whereas factoring appears to be difficult for classical computers. Understanding what other computational problems can be solved significantly faster using quantum algorithms is one of the major challenges in the theory of quantum computation, and such algorithms motivate the formidable task of building a large-scale quantum computer. This article reviews the current state of quantum algorithms, focusing on algorithms with superpolynomial speedup over classical computation, and in particular, on problems with an algebraic flavor.
Incentives and Internet Algorithms
Feigenbaum, Joan
Game Theory Internet Design #12;9 Game Theory and the Internet Â· Long history of work: Â NetworkingIncentives and Internet Algorithms Joan Feigenbaum Yale University http://www.cs.yale.edu/~jf Scott with selfishness? Â· Internet Architecture: robust scalability Â How to build large and robust systems? #12
Genetic Algorithms Artificial Life
Forrest, Stephanie
systems tremendously. Likewise, evolution of artificial systems is an important component of artificial) are currently the most promi nent and widely used models of evolution in artificiallife systems. GAs have beenGenetic Algorithms and Artificial Life Melanie Mitchell Santa Fe Institute 1660 Old Pecos Tr
Reformulations, Relaxations and Cutting Planes for Linear Generalized Disjunctive
Grossmann, Ignacio E.
model allows for a combination of algebraic and logical equations through disjunctions and logic by Raman and Grossmann [1994], is an extension of the well-known disjunctive programming paradigm developed the underlying logical structure of the problem, in both the linear [Raman & Grossmann, 1994] and nonlinear cases
GENERALIZED LINEAR MODELING APPROACH TO STOCHASTIC WEATHER GENERATORS
Katz, Richard
) Multisites (Spatial dependence of daily weather) -- Software R open source statistical programming language (Capable of "reproducing" any desired statistic) -- Disadvantages Synthetic weather looks too much like") Not amenable to uncertainty analysis #12;#12;#12;(2) Generalized Linear Models · Statistical Framework
Decomposition and Dynamic Cut Generation in Integer Linear ...
2004-08-18T23:59:59.000Z
tion procedures or by rewriting it as the equivalent linear program. zLD. = max ...... of a “class” of inequalities comes from the well-known template paradigm for separation, so named by ...... for Management of Operations and Logistics, 1995. 27.
15.053 Introduction to Optimization, Spring 2002
Orlin, James B., 1953-
Introduces students to the theory, algorithms, and applications of optimization. The optimization methodologies include linear programming, network optimization, dynamic programming, integer programming, non-linear ...
15.053 Introduction to Optimization, Spring 2004
Orlin, James B., 1953-
Introduces students to the theory, algorithms, and applications of optimization. The optimization methodologies include linear programming, network optimization, dynamic programming, integer programming, non-linear ...
Algorithms for Next-Generation High-Throughput Sequencing Technologies
Kao, Wei-Chun
2011-01-01T23:59:59.000Z
Algorithm . . . . . . . . . . . . . . . . . . . . . .2.6.1 A hybrid base-calling algorithm . . . . . . . . .Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . .
Sontag, Eduardo
Infinite Time Optimal Control of Hybrid Systems with a Linear Performance Index Mato BaotiÂ´c, Frank the constrained infinite time optimal control problem for the class of discrete time linear hybrid systems. When time, optimal control, discrete time, linear hybrid systems, dynamic program- ming, multi
Heinstein, M.W. [Sandia National Labs., Albuquerque, NM (United States). Engineering Mechanics and Material Modeling Dept.
1997-10-01T23:59:59.000Z
A contact enforcement algorithm has been developed for matrix-free quasistatic finite element techniques. Matrix-free (iterative) solution algorithms such as nonlinear Conjugate Gradients (CG) and Dynamic Relaxation (DR) are distinctive in that the number of iterations required for convergence is typically of the same order as the number of degrees of freedom of the model. From iteration to iteration the contact normal and tangential forces vary significantly making contact constraint satisfaction tenuous. Furthermore, global determination and enforcement of the contact constraints every iteration could be questioned on the grounds of efficiency. This work addresses this situation by introducing an intermediate iteration for treating the active gap constraint and at the same time exactly (kinematically) enforcing the linearized gap rate constraint for both frictionless and frictional response.
Graph Algorithms in the Internet Age
Stanton, Isabelle Lesley
2012-01-01T23:59:59.000Z
5.2 Classic Matching Algorithms . . . . . . . . . . . . .4.3 Analysis of Algorithms on Random Graphs . . . . . . . .Graph Problems 5 An Introduction to Matching Algorithms 5.1
High-performance combinatorial algorithms
Pinar, Ali
2003-01-01T23:59:59.000Z
mathematics, and high performance computing. The numericalalgorithms on high performance computing platforms.algorithms on high performance computing platforms, which
Ensure Program Correctness Programming Languages
Chen, Sheng-Wei
Ensure Program Correctness Programming Languages and Formal Methods Research Group Lab Coordinator Bow-Yaw Wang The Programming Languages and Formal Methods Research Group develops techniques to help ensure program correctness. Our research in programming languages focuses on syntactic, semantic
Lexicographic products and the power of non-linear network coding
Blasiak, Anna; Lubetzky, Eyal
2011-01-01T23:59:59.000Z
We introduce a technique for establishing and amplifying gaps between parameters of network coding and index coding. The technique uses linear programs to establish separations between combinatorial and coding-theoretic parameters and applies hypergraph lexicographic products to amplify these separations. This entails combining the dual solutions of the lexicographic multiplicands and proving that they are a valid dual of the product. Our result is general enough to apply to a large family of linear programs. This blend of linear programs and lexicographic products gives a recipe for constructing hard instances in which the gap between combinatorial or coding-theoretic parameters is polynomially large. We find polynomial gaps in cases in which the largest previously known gaps were only small constant factors or entirely unknown. Most notably, we show a polynomial separation between linear and non-linear network coding rates. This involves exploiting a connection between matroids and index coding to establish...
Iterative algorithm for the volume integral method for magnetostatics problems
Pasciak, J.E.
1980-11-01T23:59:59.000Z
Volume integral methods for solving nonlinear magnetostatics problems are considered in this paper. The integral method is discretized by a Galerkin technique. Estimates are given which show that the linearized problems are well conditioned and hence easily solved using iterative techniques. Comparisons of iterative algorithms with the elimination method of GFUN3D shows that the iterative method gives an order of magnitude improvement in computational time as well as memory requirements for large problems. Computational experiments for a test problem as well as a double layer dipole magnet are given. Error estimates for the linearized problem are also derived.
Multipartite entanglement in quantum algorithms
D. Bruß; C. Macchiavello
2010-07-23T23:59:59.000Z
We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyse the multipartite entanglement properties in the Deutsch-Jozsa, Grover and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.
Axioms, algorithms and Hilbert's Entscheidungsproblem
Axioms, algorithms and Hilbert's Entscheidungsproblem Jan Stovicek Department of Mathematical Sciences September 9th, 2008 www.ntnu.no Jan Stovicek, Axioms & algorithms #12;2 Outline The Decision & algorithms #12;3 Outline The Decision Problem Formal Languages and Theories Incompleteness Undecidability www
Algorithm FIRE -- Feynman Integral REduction
A. V. Smirnov
2008-08-02T23:59:59.000Z
The recently developed algorithm FIRE performs the reduction of Feynman integrals to master integrals. It is based on a number of strategies, such as applying the Laporta algorithm, the s-bases algorithm, region-bases and integrating explicitly over loop momenta when possible. Currently it is being used in complicated three-loop calculations.
A NOVEL INTEGER PROGRAMMING FORMULATION FOR THE K ...
2005-10-28T23:59:59.000Z
Oct 28, 2005 ... This problem is called k-SONET Ring Assignment Problem, or ... In Section 4, the novel integer linear programming formulation is presented.
Code verification by static analysis: a mathematical programming ...
2009-09-24T23:59:59.000Z
(for example the assignment of convex over-approximations X ? ? to x). ... This yields a Mixed-Integer Linear Program for code based on integer arithmetic,.
A weighted iterative algorithm for neuromagnetic imaging
Gorodnitsky, I. (Los Alamos National Lab., NM (United States) California Univ., San Diego, La Jolla, CA (United States)); George, J.S.; Schlitt, H.A.; Lewis, P.S. (Los Alamos National Lab., NM (United States))
1992-01-01T23:59:59.000Z
The goal of neuromagnetic source reconstruction is high resolution 3-D mapping of the current distribution within the brain. However, the neuromagnetic inverse problem is ill-posed and typically underdetermined. The Moore-Penrose pseudoinverse provides a linear algebraic inverse calculation that simultaneously minimizes chisquare and the Euclidean norm of the component currents. Such minimum norm'' reconstructions tend to produce diffuse and superficial current distributions because voxels nearer the sensor array can account for more power in the data with less current than deeper voxels. We describe an algorithm that overcomes the bias of minimum norm procedures toward superficial solutions by using weights chosen to compensate for the distance dependence of magnetic signal strength. We also apply a Bayesian weighting strategy in an iterative pseudoinverse computation, to address the bias of the linear estimator procedure toward diffuse solutions. This strategy produces a progressively more focal current distribution while accomodating distributed current sources, and appears to effectively reduce the problems associated with the under-determined linear system.
A weighted iterative algorithm for neuromagnetic imaging
Gorodnitsky, I. [Los Alamos National Lab., NM (United States)]|[California Univ., San Diego, La Jolla, CA (United States); George, J.S.; Schlitt, H.A.; Lewis, P.S. [Los Alamos National Lab., NM (United States)
1992-09-01T23:59:59.000Z
The goal of neuromagnetic source reconstruction is high resolution 3-D mapping of the current distribution within the brain. However, the neuromagnetic inverse problem is ill-posed and typically underdetermined. The Moore-Penrose pseudoinverse provides a linear algebraic inverse calculation that simultaneously minimizes chisquare and the Euclidean norm of the component currents. Such ``minimum norm`` reconstructions tend to produce diffuse and superficial current distributions because voxels nearer the sensor array can account for more power in the data with less current than deeper voxels. We describe an algorithm that overcomes the bias of minimum norm procedures toward superficial solutions by using weights chosen to compensate for the distance dependence of magnetic signal strength. We also apply a Bayesian weighting strategy in an iterative pseudoinverse computation, to address the bias of the linear estimator procedure toward diffuse solutions. This strategy produces a progressively more focal current distribution while accomodating distributed current sources, and appears to effectively reduce the problems associated with the under-determined linear system.
Tomasz Plawski, J. Hovater
2010-09-01T23:59:59.000Z
A digital low level radio frequency (RF) system typically incorporates either a heterodyne or direct sampling technique, followed by fast ADCs, then an FPGA, and finally a transmitting DAC. This universal platform opens up the possibilities for a variety of control algorithm implementations. The foremost concern for an RF control system is cavity field stability, and to meet the required quality of regulation, the chosen control system needs to have sufficient feedback gain. In this paper we will investigate the effectiveness of the regulation for three basic control system algorithms: I&Q (In-phase and Quadrature), Amplitude & Phase and digital SEL (Self Exciting Loop) along with the example of the Jefferson Lab 12 GeV cavity field control system.
Stability of Coupling Algorithms
Akkasale, Abhineeth
2012-07-16T23:59:59.000Z
of Committee, K. B. Nakshatrala Committee Members, Steve Suh J. N. Reddy Head of Department, Dennis O?Neal May 2011 Major Subject: Mechanical Engineering iii ABSTRACT Stability of Coupling Algorithms. (May 2011) Abhineeth Akkasale, B.E., Bangalore... step. iv To Amma and Anna v ACKNOWLEDGMENTS First and foremost, I thank Dr. Kalyana B. Nakshatrala for being an incredible advisor and for his time and patience in constantly guiding me through my research. I am indebted to him for his guidance...
Approximation Algorithms for Covering Problems
Koufogiannakis, Christos
2009-01-01T23:59:59.000Z
on Automata, Languages and Programming, LNCS 5555:634– DOIon Automata, Languages and Programming, LNCS 5555:634–652,on Automata, Languages and Programming, pages 943–955.
Large scale tracking algorithms.
Hansen, Ross L.; Love, Joshua Alan; Melgaard, David Kennett; Karelitz, David B.; Pitts, Todd Alan; Zollweg, Joshua David; Anderson, Dylan Z.; Nandy, Prabal; Whitlow, Gary L.; Bender, Daniel A.; Byrne, Raymond Harry
2015-01-01T23:59:59.000Z
Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase signi cantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classfication steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Programming Programming Compiling and linking programs on Euclid. Compiling Codes How to compile and link MPI codes on Euclid. Read More Using the ACML Math Library How to...
Acoustic emission linear pulse holography
Collins, H.D.; Busse, L.J.; Lemon, D.K.
1983-10-25T23:59:59.000Z
This device relates to the concept of and means for performing Acoustic Emission Linear Pulse Holography, which combines the advantages of linear holographic imaging and Acoustic Emission into a single non-destructive inspection system. This unique system produces a chronological, linear holographic image of a flaw by utilizing the acoustic energy emitted during crack growth. The innovation is the concept of utilizing the crack-generated acoustic emission energy to generate a chronological series of images of a growing crack by applying linear, pulse holographic processing to the acoustic emission data. The process is implemented by placing on a structure an array of piezoelectric sensors (typically 16 or 32 of them) near the defect location. A reference sensor is placed between the defect and the array.
Distributed algorithms for mobile ad hoc networks
Malpani, Navneet
2001-01-01T23:59:59.000Z
We first present two new leader election algorithms for mobile ad hoc networks. The algorithms ensure that eventually each connected component of the topology graph has exactly one leader. The algorithms are based on a routing algorithm called TORA...
DOE Publishes CALiPER Report on Linear (T8) LED Lamps in Recessed Troffers
Broader source: Energy.gov [DOE]
The U.S. Department of Energy's CALiPER program has released Report 21.2, which is part of a series of investigations on linear LED lamps. Report 21.2 focuses on the performance of three linear (T8...
Linear Consistency Testing Yonatan Aumann
Sudan, Madhu
of Blum, Luby and Rubinfeld [?] to check the linear-consistency of three functions f1, f2, f3 mapping and check if f1(x) + f2(y) = f3(x + y). We analyze this test for two cases: (1) G and H are arbitrary the consistency of multiple functions. Given a triple of functions f1, f2, f3 : G H, we say that they are "linear
A linear induction motor conveyer
Solinsky, Kenneth Sheldon
1973-01-01T23:59:59.000Z
A LINEAR INCUCTION MOTOR CONVEYER A Thesis Kenneth Sheldon. Solinsky Submitted to the Graduate College of Texas AkM University in partial fulfillment of the requirement for the degree of MASTER 07 SCIENCE May 1973 Major Subject: Industrial.... Howie, USAMC-ITC-P/P, Red River Army Depot, Texarkana, Texas 75501. Approved owxe, xe , ro uc o uction Engineering For the Commander ne , grec or, I A LINEAR INDUCTION MOTOR CONVEYER A Thesis by Kenneth Sheldon Solinsky App ved as to style...
Software realization of the complex spectra analysis algorithm in R
Bakhrushin, Vladimir
2015-01-01T23:59:59.000Z
Software realization of the complex spectra decomposition on unknown number of similarcomponents is proposed.The algorithm is based on non-linear minimizing the sum of squared residuals of the spectrum model. For the adequacy checking the complex of criteria is used.It tests the model residuals correspondence with the normal distribution, equality to zero of their mean value and autocorrelation. Also the closeness of residuals and experimental data variances is checked.
PERFORMANCE EVALUATION AND CHARACTERIZATION OF SCALABLE DATA MINING ALGORITHMS
PERFORMANCE EVALUATION AND CHARACTERIZATION OF SCALABLE DATA MINING ALGORITHMS Ying Liu, choudhar}@ece.northwestern.edu ABSTRACT Data mining has become one of the most essential tools in diverse perspectives for a set of representative data mining programs. We first design MineBench, a benchmarking suite
NASA/TM2010216190 A General Algorithm for Reusing Krylov
Vuik, Kees
NASA/TM2010216190 A General Algorithm for Reusing Krylov Subspace Information. I. Unsteady Navier, and Hester Bijl Delft University of Technology, Delft, The Netherlands January 2010 #12;NASA STI Program . . . in Profile Since its founding, NASA has been dedicated to the advancement of aeronautics and space science
Milan Batista; Abdel Rahman A. Ibrahim Karawia
2008-07-24T23:59:59.000Z
The article presents the theoretical background of the algorithms for solving cyclic block tridiagonal and cyclic block penta-diagonal systems of linear algebraic equations present in ref [1] and [2]. The theory is based on the Woodbury formula.
6.046J Introduction to Algorithms (SMA 5503), Fall 2004
Leiserson, Charles Eric
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph ...
header for SPIE use Evolving forest fire burn severity classification algorithms
Fernandez, Thomas
header for SPIE use Evolving forest fire burn severity classification algorithms for multi, to the classification of forest fire burn severity using Landsat 7 ETM+ multispectral imagery. The details. Keywords: Multispectral imagery, Genetic programming, Supervised classification, Forest fire, Wildfire. 1
6.046J / 18.410J Introduction to Algorithms, Fall 2001
Demaine, Erik D.
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph ...
Distributed Algorithms for Control of Demand Response and Distributed Energy Resources
Liberzon, Daniel
(DRRs), sign a contract with an aggregating entity--the demand response provider--so as their load canDistributed Algorithms for Control of Demand Response and Distributed Energy Resources Alejandro D networks. These algorithms are relevant for load curtailment control in demand response programs, and also
Distribution of a Stochastic Control Algorithm Applied to Gas Storage Valuation
Vialle, Stéphane
Distribution of a Stochastic Control Algorithm Applied to Gas Storage Valuation Constantinos to speed-up and size-up some gas storage valuations, based on a Stochastic Dy- namic Programming algorithm. Such valuations are typically needed by investment projects and yield prices of gas storage spaces and facilities
Looking for strong polynomiality in Linear Programming : Arguments ...
peter bruijs
2015-01-06T23:59:59.000Z
sequence has an exponential length measured in terms of m and n, thereby refuting strong ..... room for one new single variable to enter the basis, while in the gradient concept presented .... the new search space locally left for improvement.
Tools for primal degenerate linear programs: IPS, DCA, and PE
2014-10-01T23:59:59.000Z
the selection of a compatible variable to enter the basis ensures a nondegenerate pivot, PE .... At the heart of this framework lies the search for so-
Non-Linear Stochastic Fractional Programming Model of Financial ...
2005-04-19T23:59:59.000Z
of financial derivatives- II, Proceedings of International Conference on Business ... optimum allocation of recruitment in manpower planning, International Journal
Sequential Linear Programming Coordination Strategy for Deterministic and Probabilistic
Papalambros, Panos
electric fuel cell vehicle design model, including enterprise, powertrain, fuel cell and battery models using an L norm to measure deviations between targets and responses. A subproblem suspension strategy on trust region and target value step size. A global convergence proof of the SLP-based coordination
Short Communication: A Linear Programming Approach for the ...
2008-09-19T23:59:59.000Z
Baker, D., Sali, A.: Protein structure prediction and structural genomics. Sci- ence 294(5540), 93–96 (2001). 2. Bennett, C.H.: Efficient estimation of free energy ...
Transient Analysis of Linear Circuits using Constraint Logic Programming
Shankar, A.; Gilbert, D.
Shankar,A. Gilbert,D. Jampel,M. Proceedings of PACT96: Practical Application of Constraint Technology, The Practical Applications Company Ltd pp 221-247 Academic Press
mixed zero-one linear programs under objective uncertainty
2010-10-28T23:59:59.000Z
In the shortest path context, this is a lower bound along the lines of the Lyons et al. .... and the entire feasible region as L?{0,1}B. The problem of interest is. (P).
A new method for solving linear fractional programming problems By ...
Administrator
2007-03-27T23:59:59.000Z
financial and corporate planning, health care and hospital planning. Several methods to solve this problem are proposed in (1962), Charnes and Kooper have
Large-Scale Linear Programming Techniques for the Design of ...
2002-02-05T23:59:59.000Z
Feb 5, 2002 ... Page 1 ... We present large-scale optimization techniques to model the energy function that underlies the folding process of ..... which we will refer to from now on, we get a system. AT y ? b, ... Although we don't want to rule out that a so- ..... What we believe is interesting in this context is that the results from.
Linear Dynamic Programs for Resource Management Marek Petrik
Zilberstein, Shlomo
observable MDPs (POMDPs). We show that the LDP framework makes it possible to adapt point-based methods a river reservoir to produce hydroelectric power. Among renewable sources, hydroelectricity has the lowest carbon footprint per MWh and is the most signifi- cant source of renewable energy, supplying about 20
Scheduling Smart Home Appliances Using Mixed Integer Linear Programming
Johansson, Karl Henrik
incentives such as time-varying electricity tariff (e.g. spot pricing [1]), or CO2 footprint Research (SSF) and the Knut and Alice Wallenberg Foundation. project [2]). An illustration of spot price. Electricity tariff (spot price) for New York City on February 15th, 2011. Data taken from NYISO. The web
Protein Helical Topology Prediction Using Mixed-Integer Linear Programming
Singh, Jaswinder Pal
Allister Department of Chemical Engineering Princeton University The protein folding problem represents one enhances the ASTRO-FOLD protein folding approach of Klepeis and Floudas (2003), which finds the structure
Exercise 1. Let (P) be the following linear program
Rapaport, Iván
of G such that eM c(e) is minimum.Fr A company of petrol wishes to explore oil reservoirs. Once petrol. At this point individual oil traps (target) can be specified more precisely. In most situations
An elementary proof of optimality conditions for linear programming
Anders Forsgren
2008-06-30T23:59:59.000Z
Jun 30, 2008 ... ... Report TRITA-MAT-2008-OS6, Department of Mathematics, Royal Institute of Technology (KTH), SE-100 44 Stockholm, Sweden, June 2008.
Linear Programming Uses for Recycling and Product Reuse
Nagurney, Anna
;Reverse Logistics Returns/ Damaged Product Recycling of waste materials Reuse of product components #12
Linear programming optimization for aquifer influence functions on microcomputers
Brown, Don L
1989-01-01T23:59:59.000Z
al. 's LP matrices were large and sparse (only 34 of the elements were non-zero) and were solved on main frame computers with use of a modified simplex LP method. The purpose of this work is to investigate the use of different LP methods... for increasing operating speed and efficient computer storage with the AIF p~ on micraccmputers. Three LP methods were investigated on microoczrputers using the AIF p~: (I) the simplex method, (2) the revised simplex methcd, and (3) the symmetric msthcd. Each...
Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming
Cardoso, Goncalo
2014-01-01T23:59:59.000Z
of a 1 MW molten carbonate fuel cell. Both are in the Santaand a 1 MW molten carbonate fuel cell (MCFC) operating as a
Calmness of linear programs under perturbations of all data ...
2014-06-18T23:59:59.000Z
mapping, as well as an operative upper bound for the corresponding calmness ... son [20], since the Karush#Kunh#Tucker conditions allow us to express the.
Objective space for multiple objectives linear fractional programming ...
Administrator
2007-04-12T23:59:59.000Z
May 2, 2007 ... considered this problem and presented a simplex –based solution procedure to find all ... Geoffrion in his article introduced the notion of proper.
Toward portable programming of numerical linear algebra on manycore nodes.
Office of Scientific and Technical Information (OSTI)
AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level:5 TablesExports to3,1,50022,3,,0,,6,1,SeparationConnect1.08]Te[subscriptM-PACEResponses to a WarmingtopologicalConference: Toward(Conference) |
Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming
Cardoso, Goncalo
2014-01-01T23:59:59.000Z
significant impact on both energy and demand costs, althoughtariffs for both energy and power demand incurs significant0) = 4 Total energy costs TOU charges Demand charges Average
Robust Distributed Control of Networked Systems with Linear Programming Objectives /
Richert, Dean, M.
2014-01-01T23:59:59.000Z
Assistive Robotics and Mechatronics, [52] B. Johansson, T.Advanced Intelligent Mechatronics, Montr´eal, Canada, 2010,
Constraint Reduction for Linear Programs with Many Inequality ...
2005-11-07T23:59:59.000Z
each iteration, rather than being updated in a build-up/build-down fashion. ...... convex or quasiconvex feasibility problems, Large Scale Optimization: State of ...
Higher-order Linear Logic Programming of Categorial Deduction
Morrill, Glyn
Llenguatges i Sistemes Inform`atics Universitat Polit`ecnica de Catalunya for multimodal hybrid formulations; unification must be carried out accord- ing to the structural axioms
Luminosity Measurement at the International Linear Collider
Iftach Sadeh
2010-10-28T23:59:59.000Z
The International Linear Collider (ILC) is a proposed electron-positron collider with a center-of-mass energy of 500~GeV, and a peak luminosity of $2 \\cdot 10^{34}~\\mathrm{cm}^{-2}\\mathrm{s}^{-1}$. The ILC will complement the Large Hadron Collider, a proton-proton accelerator, and provide precision measurements, which may help in solving some of the fundamental questions at the frontier of scientific research, such as the origin of mass and the possible existence of new principles of nature. The linear collider community has set a goal to achieve a precision of $10^{-4}$ on the luminosity measurement at the ILC. This may be accomplished by constructing a finely granulated calorimeter, which will measure Bhabha scattering at small angles. The Bhabha cross-section is theoretically known to great precision, yet the rate of Bhabha scattering events, which would be measured by the luminosity detector, will be influenced by beam-beam effects, and by the inherent energy spread of the collider. The electroweak radiative effects can be calculated to high precision and partially checked with events with final state photon radiation by distinguishing between the observable energy deposits of electrons and of photons in the luminosity calorimeter, using a clustering algorithm. In order to achieve the design goal, the geometrical parameters of the calorimeter need to be reevaluated. This must be done in a generalized manner, so as to facilitate future modifications, the need for which is foreseen, due to expected changes in the detector concept. This work demonstrates that the clustering approach is viable, and that a luminosity calorimeter may be designed to match the precision requirements on the luminosity measurement.
Student Internship Programs Program Description
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Student Internship Programs Program Description The objective of the Laboratory's student internship programs is to provide students with opportunities for meaningful hands- on...
5. Greedy and other efficient optimization algorithms
Keil, David M.
5. Greedy and other efficient optimization algorithms David Keil Analysis of Algorithms 7/14 1David Keil Analysis of Algorithms 5. Greedy algorithms 8/14 CSCI 347 Analysis of Algorithms David M. Keil, Framingham State University 5. Greedy and other fast optimization algorithms 1. When the next step is easy
Optimal Unravellings for Feedback Control in Linear Quantum Systems
H. M . Wiseman; A. C. Doherty
2005-02-26T23:59:59.000Z
For quantum systems with linear dynamics in phase space much of classical feedback control theory applies. However, there are some questions that are sensible only for the quantum case, such as: given a fixed interaction between the system and the environment what is the optimal measurement on the environment for a particular control problem? We show that for a broad class of optimal (state-based) control problems (the stationary Linear-Quadratic-Gaussian class), this question is a semi-definite program. Moreover, the answer also applies to Markovian (current-based) feedback.
Large Scale Approximate Inference and Experimental Design for Sparse Linear Models
Seeger, Matthias
Large Scale Approximate Inference and Experimental Design for Sparse Linear Models Matthias W.kyb.tuebingen.mpg.de/bs/people/seeger/ 27 June 2008 Matthias W. Seeger (MPI BioCyb) Large Scale Bayesian Experimental Design 27/6/08 1 / 27 Algorithms 4 Magnetic Resonance Imaging Sequences Matthias W. Seeger (MPI BioCyb) Large Scale Bayesian
Crack Detection in Dielectric Structures by a Linear Sampling , M. Brignone2
Piana, Michele
Crack Detection in Dielectric Structures by a Linear Sampling Approach G. Bozza1 , M. Brignone2 , M for the detection of cracks and defects inside dielectric structures is presented. The proposed algorithm is based of the approach is assessed by means of numerical simulations. 1. Introduction The imaging community
Andreas Stathopoulos; Kostas Orginos
2008-06-12T23:59:59.000Z
We present a new algorithm that computes eigenvalues and eigenvectors of a Hermitian positive definite matrix while solving a linear system of equations with Conjugate Gradient (CG). Traditionally, all the CG iteration vectors could be saved and recombined through the eigenvectors of the tridiagonal projection matrix, which is equivalent theoretically to unrestarted Lanczos. Our algorithm capitalizes on the iteration vectors produced by CG to update only a small window of vectors that approximate the eigenvectors. While this window is restarted in a locally optimal way, the CG algorithm for the linear system is unaffected. Yet, in all our experiments, this small window converges to the required eigenvectors at a rate identical to unrestarted Lanczos. After the solution of the linear system, eigenvectors that have not accurately converged can be improved in an incremental fashion by solving additional linear systems. In this case, eigenvectors identified in earlier systems can be used to deflate, and thus accelerate, the convergence of subsequent systems. We have used this algorithm with excellent results in lattice QCD applications, where hundreds of right hand sides may be needed. Specifically, about 70 eigenvectors are obtained to full accuracy after solving 24 right hand sides. Deflating these from the large number of subsequent right hand sides removes the dreaded critical slowdown, where the conditioning of the matrix increases as the quark mass reaches a critical value. Our experiments show almost a constant number of iterations for our method, regardless of quark mass, and speedups of 8 over original CG for light quark masses.
Weighted Sum Rate Maximization of Correlated MISO Broadcast Channels under Linear Precoding
Paris-Sud XI, Université de
1 Weighted Sum Rate Maximization of Correlated MISO Broadcast Channels under Linear Precoding algorithm proposed by Christensen et al. in large correlated MISO broadcast channels. We propose a novel maximization. I. INTRODUCTION WE consider the multiple-input single-output (MISO) broadcast channel (BC
Optimal Control of Discrete-Time Linear Systems with Network-Induced Varying Delay
importance in modern systems applications. However, most traditional digital control and algorithmsOptimal Control of Discrete-Time Linear Systems with Network-Induced Varying Delay Hiroyuki Hirano for networked control systems, that have network induced time delay in the communication networks. In our
COMPUTING AND DEFLATING EIGENVALUES WHILE SOLVING MULTIPLE RIGHT HAND SIDE LINEAR SYSTEMS WITH AN
Stathopoulos, Andreas
COMPUTING AND DEFLATING EIGENVALUES WHILE SOLVING MULTIPLE RIGHT HAND SIDE LINEAR SYSTEMS a new algorithm that computes eigenvalues and eigenvectors of a Her- mitian positive definite matrix applications, where hundreds of right hand sides may be needed. Specifically, about 70 eigenvectors
Averroes: Whole-Program Analysis without the Whole Program
Lhotak, Ondrej
and precise algorithms analyze the whole program including all library dependencies. The separate compi analyzing libraries. We investigate whether the separate compilation assumption can be encoded universally. We present and evaluate Averroes, a tool that generates a placeholder library that overapproximates
Linear conic optimization for nonlinear optimal control
Didier Henrion
2014-07-07T23:59:59.000Z
Jul 7, 2014 ... Abstract: Infinite-dimensional linear conic formulations are described for nonlinear optimal control problems. The primal linear problem consists ...
Fast algorithms for computing defects and their derivatives in the Regge calculus
Leo Brewin
2010-11-08T23:59:59.000Z
Any practical attempt to solve the Regge equations, these being a large system of non-linear algebraic equations, will almost certainly employ a Newton-Raphson like scheme. In such cases it is essential that efficient algorithms be used when computing the defect angles and their derivatives with respect to the leg-lengths. The purpose of this paper is to present details of such an algorithm.
Nonserial dynamic programming and local decomposition ...
2006-03-23T23:59:59.000Z
every assignment to x2 and x3, compute the value of x1 for which: h1(x2,x3) .... Consider the integer linear programming problem Z with binary variables: z = cT x ...
Bilevel Programming and the Separation Problem
2013-01-23T23:59:59.000Z
Mar 26, 2012 ... Department of Industrial and Systems Engineering, Lehigh University, USA ... Department of Mathematics and Computer Science, TU Eindhoven, The ... tive method for solving generic mixed integer linear programs (MILPs).
Frolov, Vladimir [Moscow Inst. of Physics and Technology (MIPT), Moscow (Russian Federation); Backhaus, Scott N. [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Chertkov, Michael [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
2014-01-14T23:59:59.000Z
We explore optimization methods for planning the placement, sizing and operations of Flexible Alternating Current Transmission System (FACTS) devices installed to relieve transmission grid congestion. We limit our selection of FACTS devices to Series Compensation (SC) devices that can be represented by modification of the inductance of transmission lines. Our master optimization problem minimizes the l_{1} norm of the inductance modification subject to the usual line thermal-limit constraints. We develop heuristics that reduce this non-convex optimization to a succession of Linear Programs (LP) which are accelerated further using cutting plane methods. The algorithm solves an instance of the MatPower Polish Grid model (3299 lines and 2746 nodes) in 40 seconds per iteration on a standard laptop—a speed up that allows the sizing and placement of a family of SC devices to correct a large set of anticipated congestions. We observe that our algorithm finds feasible solutions that are always sparse, i.e., SC devices are placed on only a few lines. In a companion manuscript, we demonstrate our approach on realistically-sized networks that suffer congestion from a range of causes including generator retirement. In this manuscript, we focus on the development of our approach, investigate its structure on a small test system subject to congestion from uniform load growth, and demonstrate computational efficiency on a realistically-sized network.