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 polynomial projection algorithm for linear programming
2013-05-03T23:59:59.000Z
algorithm is based on a procedure whose input is a homogeneous system of linear ..... In this case s = 0 and the procedure sets the output vector yout to 0.
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.
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.
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).
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 ...
Enhanced algorithms for stochastic programming
Krishna, A.S.
1993-09-01T23:59:59.000Z
In this dissertation, we present some of the recent advances made in solving two-stage stochastic linear programming problems of large size and complexity. Decomposition and sampling are two fundamental components of techniques to solve stochastic optimization problems. We describe improvements to the current techniques in both these areas. We studied different ways of using importance sampling techniques in the context of Stochastic programming, by varying the choice of approximation functions used in this method. We have concluded that approximating the recourse function by a computationally inexpensive piecewise-linear function is highly efficient. This reduced the problem from finding the mean of a computationally expensive functions to finding that of a computationally inexpensive function. Then we implemented various variance reduction techniques to estimate the mean of a piecewise-linear function. This method achieved similar variance reductions in orders of magnitude less time than, when we directly applied variance-reduction techniques directly on the given problem. In solving a stochastic linear program, the expected value problem is usually solved before a stochastic solution and also to speed-up the algorithm by making use of the information obtained from the solution of the expected value problem. We have devised a new decomposition scheme to improve the convergence of this algorithm.
SCIL --Symbolic Constraints in Integer Linear Programming \\Lambda Ernst Althaus
Mehlhorn, Kurt
want short development time (= efficient use of human resources) and runtime efficiency (= efficient introduces symbolic constraints into branchÂandÂcutÂandÂprice algorithms for integer linear programs for integer linear programming (ILP) and mixed integer linear programming (MILP) based on a branchÂandÂcutÂandÂprice
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 .
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.
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
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 ...
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 ...
An Integer Programming Approach for Linear Programs with ...
2008-05-02T23:59:59.000Z
Linear programs with joint probabilistic constraints (PCLP) are dif- ficult to solve ...... Stochastic optimization for operating chemical processes under uncertainty.
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) ...
Stochastic linear programming games with concave preferences
2014-12-04T23:59:59.000Z
We study stochastic linear programming games: a class of stochastic ... which include minimum cost spanning trees (Granot and Huberman 1981) as a special
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
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
On linear programing approach to inventory control
Mayfield, John
On linear programing approach to inventory control problems Zhu received his PhD from Wayne State with inventory control problems under the discounted criterion. The objective is to minimize the discounted total imbeds the inventory control problem into an infinite-dimensional linear program over a space of measures
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
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.
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
The Linear Complementarity Problem, Lemke Algorithm ...
2011-03-01T23:59:59.000Z
graphs [4], [14], [9] and the research articles in their reference lists. One of the interesting ..... The Linear Complementarity Problem, Academic-Press,. Inc., 1992
Outcome-Space Outer Approximation Algorithm for Linear ...
2007-07-20T23:59:59.000Z
Jul 20, 2007 ... This paper presents an outcome-space outer approximation algo- rithm for globally solving the linear multiplicative programming prob- lem.
Jian Jinbao, E-mail: jianjb@gxu.edu.cn; Li Jianling; Mo Xingde [College of Mathematics and Information Science, Guangxi University, Nanning, Guangxi 530004 (China)
2006-06-15T23:59:59.000Z
This paper discusses a kind of optimization problem with linear complementarity constraints, and presents a sequential quadratic programming (SQP) algorithm for solving a stationary point of the problem. The algorithm is a modification of the SQP algorithm proposed by Fukushima et al. [Computational Optimization and Applications, 10 (1998),5-34], and is based on a reformulation of complementarity condition as a system of linear equations. At each iteration, one quadratic programming and one system of equations needs to be solved, and a curve search is used to yield the step size. Under some appropriate assumptions, including the lower-level strict complementarity, but without the upper-level strict complementarity for the inequality constraints, the algorithm is proved to possess strong convergence and superlinear convergence. Some preliminary numerical results are reported.
Decoding Turbo-Like Codes via Linear Programming Jon Feldman David R. Karger
Decoding Turbo-Like Codes via Linear Programming Jon Feldman David R. Karger MIT Laboratory algorithm for decoding turbo-like codes based on linear programming. We prove that for the case of Repeat is the path corresponding to the original transmitted code word. 1 Introduction The introduction of turbo
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
Shrink-Wrapping trajectories for Linear Programming
2010-05-30T23:59:59.000Z
May 30, 2010 ... In particular, we analyze the geometry of these trajectories in the ... convexity that does not rely on complex variables; in Section 3 we ..... otal observation for building Shrink-Wrapping framework for linear programming ... In applications, these three types of problems provide an extremely powerful modeling.
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.
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.
Linear Programming Algorithms for Sparse Filter Design
Baran, Thomas A.
In designing discrete-time filters, the length of the impulse response is often used as an indication of computational cost. In systems where the complexity is dominated by arithmetic operations, the number of nonzero ...
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 ...
Lifted Linear Programming Martin Mladenov Babak Ahmadi Kristian Kersting
Kersting, Kristian
Lifted Linear Programming Martin Mladenov Babak Ahmadi Kristian Kersting Knowledge Discovery Lifted inference approaches have rendered large, previously intractable probabilistic in- ference- tuitively, given a linear program (LP), we em- ploy a lifted variant of Gaussian belief propa- gation (Ga
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
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
Feasible and accurate algorithms for covering semidefinite programs
Garud Iyengar
2010-07-02T23:59:59.000Z
Jul 2, 2010 ... Abstract: In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs.
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
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
Tools for primal degenerate linear programs: IPS, DCA, and PE
Jean-Bertrand Gauthier
2014-10-08T23:59:59.000Z
Oct 8, 2014 ... Tools for primal degenerate linear programs: IPS, DCA, and PE. Jean-Bertrand Gauthier(jean-bertrand.gauthier ***at*** hec.ca) Jacques ...
On treating single-objective fuzzy integer linear fractional programs
User
2009-06-05T23:59:59.000Z
On Solving Single-objective Fuzzy Integer Linear Fractional Programs. Omar M. Saad*; Azza H. Amer and Eman F. Abdellah. Department of Mathematics ...
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.
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 - 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
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.
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
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
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
New linear and positive semidefinite programming based ...
2014-04-18T23:59:59.000Z
testing matrix copositivity [10, 25]; (ii) 0-1 linear optimisation problems [35, 36, ...... 1. By letting Mr be the set of polynomials in M of degree less than or equal to r, ...
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
An Optimal Approximate Dynamic Programming Algorithm for the Energy Dispatch Problem with Grid-
Powell, Warren B.
dispatch and energy allocation decisions in the presence of grid-level storage. The model makes it possible the economic behavior of energy allocation and electric power dispatch. Linear pro- gramming has been usedAn Optimal Approximate Dynamic Programming Algorithm for the Energy Dispatch Problem with Grid
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
Static and Dynamic Locality Optimizations Using Integer Linear Programming
Kuzmanovic, Aleksandar
Static and Dynamic Locality Optimizations Using Integer Linear Programming Mahmut Kandemir, Member hierarchies is closely related to the performance of the memory subsystem. Compiler optimizations aimed at improving cache locality are critical in realizing the performance potential of powerful processors
PRICING ENERGY DERIVATIVES BY LINEAR PROGRAMMING: TOLLING AGREEMENT CONTRACTS
Uryasev, Stanislav
PRICING ENERGY DERIVATIVES BY LINEAR PROGRAMMING: TOLLING AGREEMENT CONTRACTS Valeriy Ryabchenko for pricing energy derivatives known as tolling agreement contracts. The pricing problem is reduced energy derivatives. The problem of pricing such contracts falls into the class of multiple optimal
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 (
Optimization Online - Vector Space Decomposition for Linear ...
Jean Bertrand Gauthier
2015-02-26T23:59:59.000Z
Feb 26, 2015 ... Abstract: This paper describes a vector space decomposition algorithmic framework for linear programming guided by dual feasibility ...
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
Section Notes 5 Review of Linear Programming
Chen, Yiling
3 Lecture 4: Convexity, Extreme points 3 4 Lecture 5: Primal Simplex 4 5 Lecture 6: Advanced Primal (LP) is an optimization problem that involves maximizing or minimizing a linear objective function, ..., Am form a square matrix that is invertible · Span These vectors A1, ..., Am span the vector space
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
Global linear convergence of an augmented Lagrangian algorithm ...
2004-02-25T23:59:59.000Z
section 5 by relating some numerical experiments on a seismic tomography problem and by a discussion on algorithmic consequences. Notation. We denote the ...
Estimation of linear autoregressive models with Markov-switching, the E.M. algorithm revisited
Rynkiewicz, Joseph
2008-01-01T23:59:59.000Z
This work concerns estimation of linear autoregressive models with Markov-switching using expectation maximisation (E.M.) algorithm. Our method generalise the method introduced by Elliot for general hidden Markov models and avoid to use backward recursion.
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
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
A Simple Linear Time (1 + )-Approximation Algorithm for k-Means Clustering in Any Dimensions
Sen, Sandeep
A Simple Linear Time (1 + )-Approximation Algorithm for k-Means Clustering in Any Dimensions Amit@cse.iitd.ernet.in Abstract We present the first linear time (1+)-approximation al- gorithm for the k-means problem for fixed of the most popular definitions of cluster- ing is the k-means clustering problem. Given a set of points P
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 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.
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
Linear Tolls Suce: New bounds and algorithms for tolls
Fleischer, Lisa K.
; 1] ordered by their increasing willingness to pay tolls to reduce latency | their valuation of time. Cole, et al. give an algorithm that computes optimal tolls for a bounded number of agent valuations with optimal tolls is independent of the distribution of valuations of time of the users. In particular
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
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 ...
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.
A Simple Linear Time (1 + #)Approximation Algorithm for kMeans Clustering in Any Dimensions
Kumar, Amit
A Simple Linear Time (1 + #)ÂApproximation Algorithm for kÂMeans Clustering in Any Dimensions Amit@cse.iitd.ernet.in Abstract We present the first linear time (1+#)Âapproximation alÂ gorithm for the kÂmeans problem for fixed of the most popular definitions of clusterÂ ing is the kÂmeans clustering problem. Given a set of points P
Distibuted Dense Numerical Linear Algebra Algorithms on massively parallel architectures: DPLASMA
Luszczek, Piotr
of communication and computation, task prioritization, architecture-aware scheduling and management of micro and execution in a distributed system. We demonstrate from our preliminary results that our DAG-based approach. Keywords: Linear systems, parallel algorithms, scheduling and task partitioning 1 Introduction
An Energy-Efficient Algorithm For Conflict-Free AGV Routing On A Linear Path Layout
Zeng, Jianyang "Michael"
1 An Energy-Efficient Algorithm For Conflict-Free AGV Routing On A Linear Path Layout ZENG Jian time and the AGV utilization in dispatching and routing. However, as energy shortage and pollution to environment become major concerns and the competition become more intense, the issue of minimizing the energy
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
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.
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 FAST SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING 1 ...
2007-10-15T23:59:59.000Z
its approximation Devex rule [6] are now accepted to be as the best ones, and are commonly used in commercial packages, such as CPLEX [1, 7]. Recently, Pan ...
Interior-Point Algorithms for a Generalization of Linear Programming ...
2011-02-23T23:59:59.000Z
Feb 23, 2011 ... Acknowledgement. I am grateful to Eric Denardo for a series of conversations that stimulated my interest in the topic of this paper. 11 ...
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
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.
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
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 ...
A Comparison of Software Packages for Verified Linear Programming
Christian Keil
2008-06-11T23:59:59.000Z
Jun 11, 2008 ... ... is supported by the Mathematical Programming Society and by the Optimization Technology Center. Mathematical Programming Society.
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 ...
Pseudocodewords of Linear Programming Decoding of 3-Dimensional Turbo Codes
Rosnes, Eirik; Amat, Alexandre Graell i
2011-01-01T23:59:59.000Z
In this work, we consider pseudocodewords of (relaxed) linear programming (LP) decoding of 3-dimensional turbo codes (3D-TCs), recently introduced by Berrou et al.. Here, we consider binary 3D-TCs while the original work of Berrou et al. considered double-binary codes. We present a relaxed LP decoder for 3D-TCs, which is an adaptation of the relaxed LP decoder for conventional turbo codes proposed by Feldman in his thesis. The vertices of this relaxed polytope are the pseudocodewords. We show that the support set of any pseudocodeword is a stopping set of iterative decoding of 3D-TCs using maximum a posteriori constituent decoders on the binary erasure channel. Furthermore, we present a numerical study of small block length 3D-TCs, which shows that typically the minimum pseudoweight (on the additive white Gaussian noise (AWGN) channel) is smaller than both the minimum distance and the stopping distance. In particular, we performed an exhaustive search over all interleaver pairs in the 3D-TC based on quadratic...
Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage
Sadeh, Norman M.
Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage in practice. Focusing on commodity storage, we identify a deficiency of approximate linear programming, which their corresponding ALPs. Applied to existing natural gas storage instances, our ALP relaxations significantly
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
Calmness of linear programs under perturbations of all data ...
2014-06-18T23:59:59.000Z
the nominal data, and not data in a neighborhood) for computing or estimating the calmness modulus of the optimal set (argmin) mapping in linear optimization
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 ...
Extending the eigCG algorithm to non-symmetric linear systems with multiple right-hand sides
Abdou Abdel-Rehim, Kostas Orginos, Andreas Stathopoulos
2009-11-01T23:59:59.000Z
For Hermitian positive definite linear systems and eigenvalue problems, the eigCG algorithm is a memory efficient algorithm that solves the linear system and simultaneously computes some of its eigenvalues. The algorithm is based on the Conjugate-Gradient (CG) algorithm, however, it uses only a window of the vectors generated by the CG algorithm to compute approximate eigenvalues. The number and accuracy of the eigenvectors can be increased by solving more right-hand sides. For Hermitian systems with multiple right-hand sides, the computed eigenvectors can be used to speed up the solution of subsequent systems. The algorithm was tested on Lattice QCD problems by solving the normal equations and was shown to give large speed up factors and to remove the critical slowing down as we approach light quark masses. Here, an extension to the non-symmetric case based on the two-sided Lanczos algorithm is given. The new algorithm is tested on Lattice QCD problems and is shown to give promising results. We also study the removal of the critical slowing down and compare results with those of the eigCG algorithm. We also discuss the case when the system is gamma5-Hermitian.
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
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.
Optimization Online - ADMM for Convex Quadratic Programs: Linear ...
Arvind U. Raghunathan
2015-01-08T23:59:59.000Z
Jan 8, 2015 ... Abstract: In this paper, we analyze the convergence of Alternating Direction Method of Multipliers (ADMM) on convex quadratic programs (QPs) ...
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...
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 ...
Shockley, Laura
2014-05-16T23:59:59.000Z
that an A/E/C firm may want to evaluate include: 1. Customer Satisfaction Data Envelopment Analysis: A Linear Programming Application to Measure the Relative Efficiencies of Internal Business Divisions Laura Shockley 26 2. Percent Repeat Customer... the Relative Efficiencies of Internal Business Divisions Laura Shockley 1 Executive Summary Data Envelopment Analysis (DEA) is a non-parametric linear programming model used to determine relative efficiencies of similar decision making units based...
Evolution of Biped Locomotion using Linear Genetic Programming
Wolff, Krister
of anthropomorphic bipedal loco- motion is addressed by means of artificial evolution using linear genetic model free evolution of bipedal gaits for a system with high number of degrees of freedom. 1, except when the robot is on a steep slope. Legged robots, on the contrary, lift their feet off the ground
Linear Dynamic Programs for Resource Management Marek Petrik
Massachusetts at Amherst, University of
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 dynamic programming, a method used to optimize hydroelectric systems. 1 Introduction Sequential decision
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
An Integer Linear Programming Approach to Product Software Release
Utrecht, Universiteit
and Computing Sciences Utrecht University, Utrecht, The Netherlands www.cs.uu.nl #12;ISSN: 0924-3275 Department of Information and Computing Sciences Utrecht University P.O. Box 80.089 3508 TB Utrecht The Netherlands #12 Thesis Master program of Business Informatics Department of information & computing science Utrecht
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 ...
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
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.
An Implementation of an Algorithm for Nonlinear Programming ...
2011-04-21T23:59:59.000Z
Apr 21, 2011 ... cal guidelines given in [6]. Numerical .... large enough to enforce that sufficient progress is made in reducing a measure of linearized feasibility ...
Prior Reduced Fill-In in Solving Equations in Interior Point Algorithms
Birge, John R.
The efficiency of interior-point algorithms for linear programming is related to the effort required to factorize the matrix used to solve for the search direction at each iteration. When the linear program is in symmetric ...
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.
Park, Sang Woo
2009-05-15T23:59:59.000Z
±cients, and the Mixture Kalman Filter (MKF) algorithm is used to marginalize out the fading channel coe±cients. At the end, two resampling schemes are adopted....
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
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
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
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
Pose Estimation of Object Categories in Videos Using Linear Programming Michele Fenzi1
Giger, Christine
Pose Estimation of Object Categories in Videos Using Linear Programming Michele Fenzi1 , Laura Leal to consistently recover the pose of an object from a known class in a video se- quence. As individual poses estimated from monocular im- ages are rather noisy, we optimally aggregate pose evidence over all video
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
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
Developmental Plasticity in Linear Genetic Programming Nicholas Freitag McPhee
Poli, Riccardo
Developmental Plasticity in Linear Genetic Programming Nicholas Freitag McPhee Division of Science numerous types of plasticity, where they respond both developmentally and behaviorally to environ- mental selection to act on these otherwise "invis- ible" genes. In contrast to biological plasticity, the vast
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
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 ...
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 ...
The application of bi-level non-linear programming to the aluminum industry
Nicholls, M.
1994-12-31T23:59:59.000Z
In this paper a bi-level non-linear mathematical model of an aluminum smelter is described. The model is based on the Portland Aluminum smelter and aims at maximizing the aluminum production while minimizing the costs associated with the production of this maximum output. The model has two variables, the power input (kilo-Amperes) and the setting cycle (of the anode replacement). The solution algorithm, based on a grid search which enumerates the appropriate intersections of the resource and other constraints is then discussed. Additionally, some of the areas currently being developed, including sensitivity analysis and the incorporation of dependencies between some of the variables and coefficients are considered.
The Lee-Yang and Polya-Schur Programs. I. Linear Operators Preserving Stability
Borcea, Julius
2008-01-01T23:59:59.000Z
In 1952 Lee and Yang proposed the program of analyzing phase transitions in terms of zeros of partition functions. Linear operators preserving non-vanishing properties are an essential tool in this program as well as various contexts in complex analysis, probability theory, combinatorics, matrix theory. We characterize all linear operators on finite or infinite-dimensional spaces of multivariate polynomials preserving the property of being non-vanishing when the variables are in prescribed open circular domains. In particular, this supersedes [7, 9] and solves the higher dimensional counterpart of a long-standing classification problem originating from classical works of Hermite, Laguerre, Hurwitz and Polya-Schur on univariate polynomials with such properties.
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...
Span programs and quantum algorithms for st-connectivity and claw detection
Aleksandrs Belovs; Ben W. Reichardt
2012-03-12T23:59:59.000Z
We introduce a span program that decides st-connectivity, and generalize the span program to develop quantum algorithms for several graph problems. First, we give an algorithm for st-connectivity that uses O(n d^{1/2}) quantum queries to the n x n adjacency matrix to decide if vertices s and t are connected, under the promise that they either are connected by a path of length at most d, or are disconnected. We also show that if T is a path, a star with two subdivided legs, or a subdivision of a claw, its presence as a subgraph in the input graph G can be detected with O(n) quantum queries to the adjacency matrix. Under the promise that G either contains T as a subgraph or does not contain T as a minor, we give O(n)-query quantum algorithms for detecting T either a triangle or a subdivision of a star. All these algorithms can be implemented time efficiently and, except for the triangle-detection algorithm, in logarithmic space. One of the main techniques is to modify the st-connectivity span program to drop along the way "breadcrumbs," which must be retrieved before the path from s is allowed to enter t.
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
Linear and Bayesian Planet Detection Algorithms for the Terrestrial Planet Finder
N. Jeremy Kasdin; Isabelle Braems
2006-01-02T23:59:59.000Z
Current plans call for the first Terrestrial Planet Finder mission, TPF-C, to be a monolithic space telescope with a coronagraph for achieving high contrast. The coronagraph removes the diffracted starlight allowing the nearby planet to be detected. In this paper, we present a model of the planet measurement and noise statistics. We utilize this model to develop two planet detection algorithms, one based on matched filtering of the PSF and one using Bayesian techniques. These models are used to formulate integration time estimates for a planet detection with desired small probabilities of false alarms and missed detections.
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 ...
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
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–
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
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
Optimizing well-stimulation treatment size using mixed integer linear programming
Picon Aranguren, Oscar
2002-01-01T23:59:59.000Z
algorithm, Branch-and-Bound (BB). Our approach integrates the relationship between well performance, reservoir, and proppant characteristics, considering the effect of treatment size both on well performance and treatment cost through the unifying concept...
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.
Martinos, Ioannis, 1977-
2003-01-01T23:59:59.000Z
We use mathematical programming to perform simulated and actual flight experiments with the MIT autonomous helicopter platform. The experimental platform mechanical hardware, avionics and software architecture are described. ...
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
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.
Zhou, YuQian
2012-01-01T23:59:59.000Z
This paper proposes a method to find efficient bounded algorithms of NPC problems by machine enumeration. The key contributions are: * On Universal Turing Machines, a program's time complexity should be characterized as: execution time(n) = loading time(n) + running time(n). * Introduces the concept of bounded algorithms; proposes a comparison based criterion to decide if a bounded algorithm is inefficient; and establishes the length upper bound of efficient bounded programs. * Introduces a new way to evaluate program complexity by using the growth rate characteristic function, which is more easily machine checkable based on observations.
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
150-MW S-band klystron program at the Stanford Linear Accelerator Center
Sprehn, D.; Caryotakis, G.; Phillips, R.M.
1996-07-01T23:59:59.000Z
Two S-Band klystrons operating at 150 MW have been designed, fabricated and tested at the Stanford Linear Accelerator Center (SLAC) during the past two years for use in an experimental accelerator at Deutsches Elektronen-Synchrotron (DESY) in Hamburg, Germany. Both klystrons operate at the design power, 60 Hz repetition rate, 3 {micro}s pulsewidth, with an efficiency {gt} 40%, and agreement between the experimental results and simulations is excellent. The 535 kV, 700 A electron gun was tested by constructing a solenoidal focused beam stick which identified a source of oscillation, subsequently engineered out of the klystron guns. Design of the beam stick and the two klystrons is discussed, along with observation and suppression of spurious oscillations. Differences in design and the resulting performance of the Klystrons is emphasized.
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
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
Inverse Stochastic Linear Programming
2007-01-05T23:59:59.000Z
The instance LandS is from the Slptestset [23] and is an electric investment planning ... investments in the electricity generation industry. The instances stormg ...
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
ALGORITHM & DOCUMENTATION: MINRES-QLP for Singular ...
SOU-CHENG T. CHOI, MICHAEL A. SAUNDERS
2013-01-12T23:59:59.000Z
Jan 12, 2013 ... ALGORITHM & DOCUMENTATION: MINRES-QLP for Singular Symmetric and. Hermitian Linear Equations and Least-Squares. Problems.
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
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.
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
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
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
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.
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
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.
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.
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...
SPARSE REPRESENTATIONS WITH DATA FIDELITY TERM VIA AN ITERATIVELY REWEIGHTED LEAST SQUARES ALGORITHM
WOHLBERG, BRENDT [Los Alamos National Laboratory; RODRIGUEZ, PAUL [Los Alamos National Laboratory
2007-01-08T23:59:59.000Z
Basis Pursuit and Basis Pursuit Denoising, well established techniques for computing sparse representations, minimize an {ell}{sup 2} data fidelity term subject to an {ell}{sup 1} sparsity constraint or regularization term on the solution by mapping the problem to a linear or quadratic program. Basis Pursuit Denoising with an {ell}{sup 1} data fidelity term has recently been proposed, also implemented via a mapping to a linear program. They introduce an alternative approach via an iteratively Reweighted Least Squares algorithm, providing greater flexibility in the choice of data fidelity term norm, and computational advantages in certain circumstances.
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.
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. ...
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
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
On Stable Piecewise Linearization and Generalized Algorithmic ...
2012-12-30T23:59:59.000Z
Dec 30, 2012 ... in the control flow. The situation where there are branches in the form of conditional gotos remains to be investigated. The data dependence ...
An Adaptive Linear Approximation Algorithm for Copositive ...
2008-09-18T23:59:59.000Z
Page 1 ... In this paper we are concerned with the topic of conic formulations and relaxations for ..... survey on this topic including convergence results is [12].
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.
Fault Tolerant Control using Cartesian Genetic Programming
Fernandez, Thomas
Fault Tolerant Control using Cartesian Genetic Programming Yoshikazu Hirayama University of York]: Robotics-- Sensors; F.2.2 [Analysis of Algorithms and Problem Complexity]: Nonnumerical Algorithms and Problems General Terms Algorithms, Reliability Keywords cartesian genetic programming, evolutionary
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 ...
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
Daniel, David J [Los Alamos National Laboratory; Mc Pherson, Allen [Los Alamos National Laboratory; Thorp, John R [Los Alamos National Laboratory; Barrett, Richard [SNL; Clay, Robert [SNL; De Supinski, Bronis [LLNL; Dube, Evi [LLNL; Heroux, Mike [SNL; Janssen, Curtis [SNL; Langer, Steve [LLNL; Laros, Jim [SNL
2011-01-14T23:59:59.000Z
A programming model is a set of software technologies that support the expression of algorithms and provide applications with an abstract representation of the capabilities of the underlying hardware architecture. The primary goals are productivity, portability and performance.
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: ...
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.
A Linear Storage-Retrieval Policy for Robust Warehouse Management
Marcus Ang
2008-11-10T23:59:59.000Z
Nov 10, 2008 ... A Linear Storage-Retrieval Policy for Robust Warehouse Management ... Keywords: Dynamic programming, Transportation, Materials handling, ...
A new hybrid algorithm for analysis of HVdc and FACTs systems
Anderson, G.W.J. [New Zealand Aluminium Smelters Ltd., Invercargill (New Zealand); Watson, N.R.; Arnold, C.P.; Arrillaga, J. [Univ. of Canterbury, Christchurch (New Zealand)
1995-12-31T23:59:59.000Z
Hybrid stability programs use a transient stability analysis for ac systems, in conjunction with detailed state variable or EMTP type modelling for fast dynamic devices. This paper presents a new hybrid algorithm that uses optimized techniques based on previously proposed methods. The hybrid provides a useful analysis tool to examine systems incorporating fast dynamic non-linear components such as HVdc links and FACTs devices.
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office of Science (SC)IntegratedSpeedingTechnical News,Program Direction and Analysis DeputyStructure
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
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.
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.
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 ...
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
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: Alternative1 First Use of Energy for All Purposes (Fuel and Nonfuel), 2002; Level: National5Sales for4,645U.S. DOE Office of Science (SC)Integrated Codes |Is Your HomeLatestCenter (LMI-EFRC) -Choices toLeeLinear Accelerator
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
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
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
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)
affirmative action program: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
programming Air pollution modeling: proportional rollback, Gaussian transport, emissions trading Location of waste disposal facilities, integer linear programming Dissolved...
advanced design program: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
to programming methodology; principles of programming language design, emphasizing the evolution of algorithmic notation and its relation to programming methodologies. This...
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.
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.
Paris-Sud XI, Université de
Blind source separation of convolutive mixtures of non circular linearly modulated signals addresses the problem of blind separation of convolutive mix- tures of BPSK and circular linearly modulated theoretical statements. Keywords: Blind source separation, Convolutive mixture, Constant Modulus Algorithm
Welcome To CSCE 3030 Parallel Programming CSCE 3030: January 18, 2011 1
Kavi, Krishna
algorithms (vector dot products, matrix multiplication) Solving linear equations (Gaussian elimination, iterative solvers) Sorting (quick sort, bubble sort and others) Graph algorithms (shortest path
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 ...
assessment program final: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
25 Next Page Last Page Topic Index 1 Stanford Geothermal Program Final Report Renewable Energy Websites Summary: Linear Programming1 Stanford Geothermal Program Final Report July...
apprenticeship program final: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
to and screened Jun, Suckjoon 15 Stanford Geothermal Program Final Report Renewable Energy Websites Summary: Linear Programming1 Stanford Geothermal Program Final Report July...
Acclerator R&D for a Linear Collider
Rubin, D.L.; Dugan, G.; Gibbons, L.; Palmer, M.; Patterson, R.; Sagan, D.; Smith, J.C.; Tenenbaum, P.; Woodley, M.; Fields, J.; Urban, J.
2008-11-26T23:59:59.000Z
The goal of this project was to perform simulations of beam transport in linear colliders, with an emphasis on emittance dilution, spin polarization transport, and development and testing of beam based tuning algorithms. Our simulations are based on an existing object-oriented particle-tracking library, Bmad. To facilitate the efficient development of simulations, an accelerator design and analysis program based on Bmad has been developed called Tao (Tool for Accelerator Optics). The three beam-based alignment algorithms, Dispersion Free Steering, Ballistic Alignment (BA), and the Kubo Method have been implemented in Tao. We have studied the effects of magnet misalignments, BPM resolution, beam jitter, stray fields, BPM and steering magnet failure and the effects of various cavity shape wakefields. A parametric study has been conducted in the presence of the above types of errors for all three alignment algorithms. We find that BPM resolution has only modest impact on the effectiveness of beam based alignment. The DFS correction algorithm was found to be very robust in situations where there were BPM and/or steering magnet failures. The wakefields in the main linac are very weak and cause negligible emittance growth. Spin tracking was extended to study all accelerator components between the damping ring and the interaction point, including RF cavities and the helical undulator. We find that there is no significant depolarization in the RTML, main linac or beam delivery system and that the polarization is relatively insensitive to misalignment. We have developed an effective spin rotator. During the final year of the grant we exploited the computing power of our new linux cluster, along with the modeling codes that we had developed, to investigate damping ring physics and design, specifically as it relates to the CESR Test Accelerator project.
Wiscombe, Warren J.; Marshak, A.; Chiu, J.-Y. C.; Knyazikhin, Y.; Barnard, James C.; Luo, Yi
2005-03-14T23:59:59.000Z
Cloud optical depth is the most important of all cloud optical properties, and vital for any cloud-radiation parameterization. To estimate cloud optical depth, the atmospheric science community has widely used ground-based flux measurements from either broadband or narrowband radiometers in the past decade. However, this type of technique is limited to overcast conditions and, at best, gives us an "effective" cloud optical depth instead of its "local" value. Unlike flux observations, monochromatic narrow-field-of-view (NFOV) radiance measurements contain information of local cloud properties, but unfortunately, the use of radiance to interpret optical depth suffers from retrieval ambiguity. We have pioneered an algorithm to retrieve cloud optical depth in a fully three-dimensional cloud situation using new Atmospheric Radiation Measurement (ARM) ground-based passive two-channel (673 and 870 nm) NFOV measurements. The underlying principle of the algorithm is that these two channels have similar cloud properties but strong spectral contrast in surface reflectance. This algorthm offers the first opportunity to illustrate cloud evolution with high temporal resolution retrievals. A combination of two-channel NFOV radiances with multi-filter rotating shadowband radiometer (MFRSR) fluxes for the retrieval of cloud optical properties is also discussed.
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
Das, Saptarshi; Das, Shantanu; Gupta, Amitava; 10.1109/PACC.2011.5978962
2012-01-01T23:59:59.000Z
Genetic Algorithm (GA) has been used in this paper for a new Nyquist based sub-optimal model reduction and optimal time domain tuning of PID and fractional order (FO) PI{\\lambda}D{\\mu} controllers. Comparative studies show that the new model reduction technique outperforms the conventional H2-norm based reduced order modeling techniques. Optimum tuning rule has been developed next with a test-bench of higher order processes via Genetic Programming (GP) with minimum value of weighted integral error index and control signal. From the Pareto optimal front which is a trade-off between the complexity of the formulae and control performance, an efficient set of tuning rules has been generated for time domain optimal PID and PI{\\lambda}D{\\mu} controllers.
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.
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)
algorithm ga technique: Topics by E-print Network
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
are investigated. Using a traditional method of harmonic Itoh, Tatsuo 7 Algorithm Design Techniques, including Dynamic Programming Environmental Sciences and Ecology Websites...
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 ...
Mechanical Verification of Hypercube Algorithms Eric Gascard, Laurence Pierre
Pierre, Laurence
Mechanical Verification of Hypercube Algorithms Eric Gascard, Laurence Pierre LIM CMI in the development of parallel programs, rather few results have been reported re garding solutions for formally
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 ...
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
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
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.
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 ...
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...
Polynomial Approximations for Continuous Linear Programs
2012-04-05T23:59:59.000Z
where the cost rate c(t), the right hand side vector b(t) as well as the matrices. G(t) and H(t, ... dual approximations, respectively, estimates the degree of suboptimality of the ...... the matrix of capital coefficients, where Bij defines the stock of good i required per unit of ...... In Optimization methods for resource allocation (Proc.
Apprentice Program: Linear Algebra Instructor: Miklos Abert
Babai, LÃ¡szlÃ³
is the dot product of the ith row of A with the jth column of B. In particular, if n = 1 and m = 1 (i.e., A is a row vector and B is a column vector) then AB is simply the dot product of A and B. The set of all n number (written (i j) in cycle notation) is called a transposition. Consider now the bubble sort
Analysis of Copositive Optimization Based Linear Programming ...
2014-04-18T23:59:59.000Z
inner approximations of the cone C. More specifically, the corresponding inner approxima- tions are given by. Ir := ?. ?. ?. ? d??r n ?d ddT : ?d ? 0 for each d
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 ...
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-
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.
Algorithms for builder guidelines
Balcomb, J.D.; Lekov, A.B.
1989-06-01T23:59:59.000Z
The Builder Guidelines are designed to make simple, appropriate guidelines available to builders for their specific localities. Builders may select from passive solar and conservation strategies with different performance potentials. They can then compare the calculated results for their particular house design with a typical house in the same location. Algorithms used to develop the Builder Guidelines are described. The main algorithms used are the monthly solar ratio (SLR) method for winter heating, the diurnal heat capacity (DHC) method for temperature swing, and a new simplified calculation method (McCool) for summer cooling. This paper applies the algorithms to estimate the performance potential of passive solar strategies, and the annual heating and cooling loads of various combinations of conservation and passive solar strategies. The basis of the McCool method is described. All three methods are implemented in a microcomputer program used to generate the guideline numbers. Guidelines for Denver, Colorado, are used to illustrate the results. The structure of the guidelines and worksheet booklets are also presented. 5 refs., 3 tabs.
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 ...
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
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 .
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.
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
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.
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).
Deforestation: Transforming programs to eliminate trees
Wadler, Philip
Deforestation: Transforming programs to eliminate to eliminate inter* *mediate lists_and intermediate trees_called the Deforestation Algorithm. A form of fun. Treeless form and the Deforestation Algorithm are presented in three steps. * *The first step presents
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
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
GRADUATE PROGRAM UNDERGRADUATE PROGRAMS
SELF STUDY GRADUATE PROGRAM UNDERGRADUATE PROGRAMS DEPARTMENT OF POLITICAL SCIENCE COLLEGE OF LIBERALARTS TEXAS A&M UNIVERSITY March 2007 #12;SELF STUDY GRADUATE PROGRAM UNDERGRADUATE PROGRAMS DEPARTMENT........................................................................................ 4 Brief History of Degree Programs and the Department
AN EFFICIENT ALGORITHM FOR SECOND-ORDER CONE LINEAR ...
2013-01-28T23:59:59.000Z
INPUT: A matrix M with the GUS property, a vector q and a tolerance ? > 0. OUTPUT: The solution x ? SOL(M, Kn, q) and the corresponding s?. Step 1:.
A linearly constrained adaptive algorithm for seismic array processing
Byun, Bok Sub
1973-01-01T23:59:59.000Z
-tap pzocessor nap be apyrozinated bp the single-tap processor Q(oyt) ~ 5 K(KW"X) (?) For the single-tap ossa equation (5) beoonee I(y) - s(ya)t + t)()). (14) Insertion of equations (5) and (14) into equation (15) yields Q(opt) ~ P"5 [1 + (Bt "K) /B(s (gd... requirement of the optimum constrained filter (11) ~ Assuming that the noise sources produced within the processor sre negligible, measure- ment of the input correlation matrix 5 for a given fitting interval J requires approximately N MJ operations...
An Algorithm for the Fast Solution of Linear Complementarity ...
2007-06-04T23:59:59.000Z
Jun 4, 2007 ... ... Foundation grant CCF-0514772, Department of Energy grant DE-FG02- ...... a stand-alone physics processing unit [ 1 ], while graphics.
Distributed Dense Numerical Linear Algebra Algorithms on massively parallel architectures
Boyer, Edmond
by a stubborn set of physical barriers: excess heat produced, too much power consumed, too much voltage leaked prioritization, architecture-aware scheduling and management of micro-tasks on distributed architectures in a distributed system. We demonstrate from our preliminary results that our DAG-based approach has the potential
Optimal subgradient algorithms with application to large-scale linear ...
2014-05-26T23:59:59.000Z
117624.44. 30.33. 16.84. Cameraman. 512. ×. 512. 111579.37. 32.98. 29.51. 111655.52. 32.87. 15.86. 111656.63. 33.00. 13.30. 110900.70. 33.53. 17.56. Car.
Efficient scalable algorithms for solving dense linear systems with ...
2013-12-11T23:59:59.000Z
arising from time-harmonic wave equation modeling prevailing in the energy indus- try [24, 25]. .... a global context created from the entire communicator, e.g., MPI COMM WORLD. When ...... Then, assuming a perfect load balance, the flop ..... performance statistics of the parallel HSS methods for k ranging from 100 to 500.
A LINEAR TIME ALGORITHM FOR THE KOOPMANS-BECKMANN ...
2011-11-24T23:59:59.000Z
The vector space of all n×n matrices over R with standard ..... bjp + ¯api. ¯ bpj). = ¯bjp ¯?i + ¯bpj. ¯ ?i + ¯aip¯?j + ¯api ¯µj ? (n ? 4)(¯aip. ¯ bjp + ¯api. ¯ bpj). (10).
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.
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...
A polynomial algorithm for linear optimization which is strongly ...
2015-01-31T23:59:59.000Z
In the general case it is an open question whether there exists a strongly ..... ei ? a). T. 1 ? 1. 2. ? ?. To understand how this simple lemma works in the context of
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
Learning Nonlinear Dynamical Systems using an EM Algorithm
Ghahramani, Zoubin
Learning Nonlinear Dynamical Systems using an EM Algorithm Zoubin Ghahramani and Sam T. Roweis identi cation in linear stochastic state-space models, where the state variables are hidden from become tractable and the maximization step can be solved via systems of linear equations. 1 Stochastic
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
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)
Bad semidefinite programs: they all look the same 1 Introduction
2014-05-14T23:59:59.000Z
Conic linear programs provide a natural framework to study duality in convex programs, and model a wide variety of practical optimization problems.
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 ...
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.
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.
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
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.
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
Converting online algorithms to local computation algorithms
Mansour, Yishay; Vardi, Shai; Xie, Ning
2012-01-01T23:59:59.000Z
We propose a general method for converting online algorithms to local computation algorithms by selecting a random permutation of the input, and simulating running the online algorithm. We bound the number of steps of the algorithm using a query tree, which models the dependencies between queries. We improve previous analyses of query trees on graphs of bounded degree, and extend the analysis to the cases where the degrees are distributed binomially, and to a special case of bipartite graphs. Using this method, we give a local computation algorithm for maximal matching in graphs of bounded degree, which runs in time and space O(log^3 n). We also show how to convert a large family of load balancing algorithms (related to balls and bins problems) to local computation algorithms. This gives several local load balancing algorithms which achieve the same approximation ratios as the online algorithms, but run in O(log n) time and space. Finally, we modify existing local computation algorithms for hypergraph 2-color...
A Linear Parabolic Trough Solar Collector Performance Model
Qu, M.; Archer, D.; Masson, S.
2006-01-01T23:59:59.000Z
A performance model has been programmed for solar thermal collector based on a linear, tracking parabolic trough reflector focused on a surface-treated metallic pipe receiver enclosed in an evacuated transparent tube: a Parabolic Trough Solar...
Fatigue life estimation program for Part 23 airplanes, `AFS.FOR`
Kaul, S.K.
1993-12-31T23:59:59.000Z
The purpose of this paper is to introduce to the general aviation industry a computer program which estimates the safe fatigue life of any Federal Aviation Regulation (FAR) Part 23 airplane. The algorithm uses the methodology (Miner`s Linear Cumulative Damage Theory) and the various data presented in the Federal Aviation Administration (FAA) Report No. AFS-120-73-2, dated May 1973. The program is written in FORTRAN 77 language and is executable on a desk top personal computer. The program prompts the user for the input data needed and provides a variety of options for its intended use. The program is envisaged to be released through issuance of a FAA report, which will contain the appropriate comments, instructions, warnings and limitations.
An Algorithm for Calculating the Probability of Classes of Data Patterns on a Genealogy
Koch, Jordan M.; Holder, Mark T.
2012-12-14T23:59:59.000Z
Felsenstein’s pruning algorithm allows one to calculate the probability of any particular data pattern arising on a phylogeny given a model of character evolution. Here we present a similar dynamic programming algorithm. ...
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.
APPROXIMATE DYNAMIC PROGRAMMING--II: ALGORITHMS
Powell, Warren B.
. These problems range from relatively low-dimensional applications to very high- dimensional industrial problems of uncertainty. A short list of applications, which illustrate different prob- lem classes, include the following of Go. Â· Controlling a Device. This might be a robot or unmanned aerial vehicle, but there is a need
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
An Improved Algorithm for Biobjective Integer Programs
2005-08-16T23:59:59.000Z
Examples may be found in business and management, engineering, ..... In practice, choosing a proper value for ? can be problematic. ... best outcome seen so far with respect to the weighted Chebyshev norm. ..... information on the library and its interface are available in the user's manual [37] and in a recent paper that.
A Sequential Convex Semidefinite Programming Algorithm for ...
2007-08-11T23:59:59.000Z
tion of multiple load FMO problems is based on dualization of the original problem and leads to ..... holds true for all partial derivatives of ck and ?. ?Ei ck(
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.
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...
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
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...
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...
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
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.
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. ...
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
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...
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 ...
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
Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel
Boyer, Edmond
Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel Fahad Syed Muhammmad, Jean- DMT system is presented in the power line communication (PLC) context with a loading algorithm which spectral density constraint. Using a multipath model of PLC channel, it is shown that the proposed coded
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.
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.
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.
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
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 ...
Energy Science and Technology Software Center (OSTI)
002651IBMPC00 Algorithm for Accounting for the Interactions of Multiple Renewable Energy Technologies in Estimation of Annual Performance
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).
Robust Linear Optimization With Recourse
2010-05-19T23:59:59.000Z
We propose an approach to two-stage linear optimization with recourse that does ... Linear optimization with recourse was first introduced by Dantzig in [17] as a ...
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.
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
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
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
Linear Quantum Feedback Networks
J. Gough; R. Gohm; M. Yanagisawa
2008-07-15T23:59:59.000Z
The mathematical theory of quantum feedback networks has recently been developed for general open quantum dynamical systems interacting with bosonic input fields. In this article we show, for the special case of linear dynamical systems Markovian systems with instantaneous feedback connections, that the transfer functions can be deduced and agree with the algebraic rules obtained in the nonlinear case. Using these rules, we derive the the transfer functions for linear quantum systems in series, in cascade, and in feedback arrangements mediated by beam splitter devices.
Algorithms to Automate LCLS Undulator Tuning
Wolf, Zachary
2010-12-03T23:59:59.000Z
Automation of the LCLS undulator tuning offers many advantages to the project. Automation can make a substantial reduction in the amount of time the tuning takes. Undulator tuning is fairly complex and automation can make the final tuning less dependent on the skill of the operator. Also, algorithms are fixed and can be scrutinized and reviewed, as opposed to an individual doing the tuning by hand. This note presents algorithms implemented in a computer program written for LCLS undulator tuning. The LCLS undulators must meet the following specifications. The maximum trajectory walkoff must be less than 5 {micro}m over 10 m. The first field integral must be below 40 x 10{sup -6} Tm. The second field integral must be below 50 x 10{sup -6} Tm{sup 2}. The phase error between the electron motion and the radiation field must be less than 10 degrees in an undulator. The K parameter must have the value of 3.5000 {+-} 0.0005. The phase matching from the break regions into the undulator must be accurate to better than 10 degrees. A phase change of 113 x 2{pi} must take place over a distance of 3.656 m centered on the undulator. Achieving these requirements is the goal of the tuning process. Most of the tuning is done with Hall probe measurements. The field integrals are checked using long coil measurements. An analysis program written in Matlab takes the Hall probe measurements and computes the trajectories, phase errors, K value, etc. The analysis program and its calculation techniques were described in a previous note. In this note, a second Matlab program containing tuning algorithms is described. The algorithms to determine the required number and placement of the shims are discussed in detail. This note describes the operation of a computer program which was written to automate LCLS undulator tuning. The algorithms used to compute the shim sizes and locations are discussed.
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.
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.
APPROXIMATE DYNAMIC PROGRAMMING FOR OPTIMIZING OIL
Van Roy, Ben
In this chapter, a new ADP algorithm integrating (1) systematic basis function con- struction, (2) a linear op- timization techniques to improve the performance of petroleum reservoir operations. Many optimization algorithms have been applied to maximize reservoir performance. Most of these optimization
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.
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...
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
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.
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.
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
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 ...
Logic Programming, Abduction and Probability
Poole, David
Logic Programming, Abduction and Probability: a top-down anytime algorithm for estimating prior, Vancouver, B.C., Canada V6T 1Z2 poole@cs.ubc.ca March 17, 1993 Abstract Probabilistic Horn abduction logically. The relationship be- tween probabilistic Horn abduction and logic programming is at two levels
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.
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
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
Henneaux, Marc; Teitelboim, Claudio [Physique Theorique et Mathematique and International Solvay Institutes, Universite Libre de Bruxelles, Campus Plaine C. P. 231, B-1050 Brussels (Belgium) and Centro de Estudios Cientificos (CECS), Valdivia (Chile); Centro de Estudios Cientificos (CECS), Valdivia (Chile)
2005-01-15T23:59:59.000Z
We show that duality transformations of linearized gravity in four dimensions, i.e., rotations of the linearized Riemann tensor and its dual into each other, can be extended to the dynamical fields of the theory so as to be symmetries of the action and not just symmetries of the equations of motion. Our approach relies on the introduction of two superpotentials, one for the spatial components of the spin-2 field and the other for their canonically conjugate momenta. These superpotentials are two-index, symmetric tensors. They can be taken to be the basic dynamical fields and appear locally in the action. They are simply rotated into each other under duality. In terms of the superpotentials, the canonical generator of duality rotations is found to have a Chern-Simons-like structure, as in the Maxwell case.
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.
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...
Quantum digital-to-analog conversion algorithm using decoherence
Akira SaiToh
2014-12-28T23:59:59.000Z
We consider the problem of mapping digital data encoded on a quantum register to analog amplitudes in parallel. It is shown to be unlikely that a fully unitary polynomial-time quantum algorithm exists for this problem; NP becomes a subset of BQP if it exists. In the practical point of view, we propose a nonunitary linear-time algorithm using quantum decoherence. It tacitly uses an exponentially large physical resource, which is typically a huge number of identical molecules. Quantumness of correlation appearing in the process of the algorithm is also discussed.
On parallelizing dual decomposition in stochastic integer programming
Miles Lubin
2012-10-09T23:59:59.000Z
Oct 9, 2012 ... Abstract: For stochastic mixed-integer programs, we revisit the dual decomposition algorithm of Car\\o{}e and Schultz from a computational ...
Market Equilibrium via a Primal-Dual-Type Algorithm Nikhil R. Devanur
Saberi, Amin
Amin Saberi Vijay V. Vazirani Abstract We provide the first polynomial time algorithm for the linear of Technology. This work was done while visiting U.C. Berkeley and ICSI Berkeley. Email: {nikhil, saberi
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 ...
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.
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...
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...
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 ...
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.
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.
Performance impact of dynamic parallelism on different clustering algorithms
Taufer, Michela
will be measured using two well-known clustering algorithms that exhibit data dependencies: the K-means clustering and the hierarchical clustering. K-means has a sequential data dependence wherein iterations occur in a linear fashion drawbacks of CUDA 5's new dynamic parallelism feature. Keywords: K-means, Divisive hierarchical clustering
Proximal Algorithm Meets a Conjugate descent Matthieu Kowalski
] and the non-linear conjugate gradient method [23]. We then extend some results known in the smooth case conjugate gradient algorithm is pro- posed for some non smooth problems. We extend some results of descent for (conjugate) gradient descent to the non-smooth case in Section 4. Hence, we derive and analyze the resulting
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 ...
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.
Linear equalities in blackbox optimization ?
Mathilde Peyrega
2014-05-28T23:59:59.000Z
May 28, 2014 ... medical engineering and hydrology, these algorithms have several applications in a wide range of fields. More details about these methods ...
Optimized Algorithms Boost Combustion Research
Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)
Optimized Algorithms Boost Combustion Research Optimized Algorithms Boost Combustion Research Methane Flame Simulations Run 6x Faster on NERSC's Hopper Supercomputer November 25,...
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 ...
Adaptive Scheduling Algorithms for Planet Searches
Eric B. Ford
2007-12-17T23:59:59.000Z
High-precision radial velocity planet searches have surveyed over ~2000 nearby stars and detected over ~200 planets. While these same stars likely harbor many additional planets, they will become increasingly challenging to detect, as they tend to have relatively small masses and/or relatively long orbital periods. Therefore, observers are increasing the precision of their observations, continuing to monitor stars over decade timescales, and also preparing to survey thousands more stars. Given the considerable amounts of telescope time required for such observing programs, it is important use the available resources as efficiently as possible. Previous studies have found that a wide range of predetermined scheduling algorithms result in planet searches with similar sensitivities. We have developed adaptive scheduling algorithms which have a solid basis in Bayesian inference and information theory and also are computationally feasible for modern planet searches. We have performed Monte Carlo simulations of plausible planet searches to test the power of adaptive scheduling algorithms. Our simulations demonstrate that planet searches performed with adaptive scheduling algorithms can simultaneously detect more planets, detect less massive planets, and measure orbital parameters more accurately than comparable surveys using a non-adaptive scheduling algorithm. We expect that these techniques will be particularly valuable for the N2K radial velocity planet search for short-period planets as well as future astrometric planet searches with the Space Interferometry Mission which aim to detect terrestrial mass planets.
Optimization of wind turbine energy and power factor with an evolutionary computation algorithm
Kusiak, Andrew
-controllable variables of a 1.5 MW wind turbine. An evolutionary strategy algorithm solves the data-derived optimization-linear approach to control a variable-speed turbine to maximize power in the presence of generator torque for variable-speed wind turbines. Munteanu et al. [11] applied a linear-quadratic stochastic approach to solve
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 ...
Deforestation: Transforming programs to eliminate trees
Wadler, Philip
Deforestation: Transforming programs to eliminate trees Philip Wadler University of Glasgow \\Lambda---called the Deforestation Algorithm. A form of function definition that uses no intermediate trees is characterised, called and the Deforestation Algorithm are presented in three steps. The first step presents ``pure'' treeless form in a first
Linear Clearing Prices in Non-Convex European Day-Ahead Electricity Markets
Martin, Alexander; Pokutta, Sebastian
2012-01-01T23:59:59.000Z
The European power grid can be divided into several market areas where the price of electricity is determined in a day-ahead auction. Market participants can provide continuous hourly bid curves and combinatorial bids with associated quantities given the prices. The goal of our auction is to maximize the economic surplus of all participants subject to transmission constraints and the existence of linear prices. In general strict linear prices do not exist in non-convex markets. Therefore we enforce the existence of linear prices where no one incurs a loss and only combinatorial bids might see a not realized gain. The resulting optimization problem is an MPEC that can not be solved efficiently by a standard solver. We present an exact algorithm and a fast heuristic for this type of problem. Both algorithms decompose the MPEC into a master MIP and price subproblems (LPs). The modeling technique and the algorithms are applicable to all MIP based combinatorial auctions.
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,.
On solving multistage stochastic programs with coherent risk ...
A. B. Philpott
2012-08-13T23:59:59.000Z
Aug 13, 2012 ... Abstract: We consider a class of multistage stochastic linear programs in which at each stage a coherent risk measure of future costs is to be ...
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...
A Note on Declarative Programming Paradigms and the Future of Definitional Programming
Torgersson, Olof
declarative programming languages stem from work in artificial intelligence and automated theorem proving is that programming is lifted to a higher level of abstraction. At this higher level of abstrac- tion the programmer of an algorithm and that all control information is supplied automatically by the system. Declarative programming
JPlag: Finding plagiarisms among a set of programs
Prechelt, Lutz
: The "k-means" program . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 4.3.4 j5 presents the design of JPlag, in particular the comparison algorithm, and carefully evaluates JPlag . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3 The JPlag comparison algorithm 10 3.1 Converting the programs into token strings
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
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.
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
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.
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
Quantization of general linear electrodynamics
Rivera, Sergio; Schuller, Frederic P. [Albert Einstein Institute, Max Planck Institute for Gravitational Physics, Am Muehlenberg 1, 14476 Potsdam (Germany)
2011-03-15T23:59:59.000Z
General linear electrodynamics allow for an arbitrary linear constitutive relation between the field strength 2-form and induction 2-form density if crucial hyperbolicity and energy conditions are satisfied, which render the theory predictive and physically interpretable. Taking into account the higher-order polynomial dispersion relation and associated causal structure of general linear electrodynamics, we carefully develop its Hamiltonian formulation from first principles. Canonical quantization of the resulting constrained system then results in a quantum vacuum which is sensitive to the constitutive tensor of the classical theory. As an application we calculate the Casimir effect in a birefringent linear optical medium.
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...
Designing programs that check their work \\Lambda Manuel Blum
Plotkin, Joshua B.
Designing programs that check their work \\Lambda Manuel Blum Comp. Sci. Division U. of California Classification D.2.4 F.2.0 F.3.1 G.3 Abstract A program correctness checker is an algorithm for checking the output of a computation. That is, given a program and an instance on which the program is run
program2circuit ERIC C.R. HEHNER
Hehner, Eric C.R.
according to the programs, and have the same structure as the programs. For timing we use local delays example, C), not to describe circuits, but to describe algorithms. The resulting circuits are produced automatically; they behave according to the programs, and have the same structure as the programs. For timing we
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.
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
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...
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
Program School/ Career: Descripton ISIS Program Codes
Wisconsin at Madison, University of
Program School/ Career: Descripton ISIS Program Codes Program Career: Descripton College School;Program School/ Career: Descripton ISIS Program Codes Program Career: Descripton College School/ College 1
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...
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
Graph algorithms experimentation facility
Sonom, Donald George
1994-01-01T23:59:59.000Z
DRAWADJMAT 2 ~e ~l 2. ~f ~2 2 ~t ~& [g H 2 O? Z Mwd a P d ed d Aid~a sae R 2-BE& T C dbms Fig. 2. External Algorithm Handler The facility is menu driven and implemented as a client to XAGE. Our implementation follows very closely the functionality...
Space Complexity Algorithms & Complexity
Way, Andy
Space Complexity Algorithms & Complexity Space Complexity Nicolas Stroppa Patrik Lambert - plambert@computing.dcu.ie CA313@Dublin City University. 2008-2009. December 4, 2008 #12;Space Complexity Hierarchy of problems #12;Space Complexity NP-intermediate Languages If P = NP, then are there languages which neither in P
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).
Robust seed selection algorithm for k-means type algorithms
Pavan, K Karteeka; Rao, A V Dattatreya; Sridhar, G R; 10.5121/ijcsit.2011.3513
2012-01-01T23:59:59.000Z
Selection of initial seeds greatly affects the quality of the clusters and in k-means type algorithms. Most of the seed selection methods result different results in different independent runs. We propose a single, optimal, outlier insensitive seed selection algorithm for k-means type algorithms as extension to k-means++. The experimental results on synthetic, real and on microarray data sets demonstrated that effectiveness of the new algorithm in producing the clustering results
Global Inference for Sentence Compression: An Integer Linear Programming Approach
Clarke, James
2008-01-01T23:59:59.000Z
In this thesis we develop models for sentence compression. This text rewriting task has recently attracted a lot of attention due to its relevance for applications (e.g., summarisation) and simple formulation by means ...
Multi-stage Stochastic Linear Programming: Scenarios Versus Events
2010-05-17T23:59:59.000Z
†laureano.escudero@urjc.es, Statistics and Operations Research, Rey Juan Carlos University, Madrid ..... where f?[t] and f?t , are joint and marginal distributions, respectively. ...... site production planning problem in an uncertain environment.
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
Equivalence of an Approximate Linear Programming Bound with the ...
2013-03-06T23:59:59.000Z
Mar 6, 2013 ... management [5], stochastic games [32] and stochastic vehicle routing [47]. ...... The traveling-salesman problem and minimum spanning trees, ...
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
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.
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
Improved Linear Programming Bounds for Antipodal Spherical Codes
and include all codes obtained as the collection of minimal vectors in a lattice. ... We also show that for n = 4, 6 and 7 the antipodal codes with. maximal kissing ...
Economic analysis of the Stiles Farm: a linear programming approach
Barreyro, Hector Ramon
1971-01-01T23:59:59.000Z
cotton allotrent; 1, 033. 5 ac. & X (ll) For feed crain base; 1, 498 ac. & X In the case of' objective function two' the acreace restriction equations are: (12) . -. 'or effecti. v cottcn allotment; 1, 033. 5 ac. & X + X 7 (13) 7 :"or dc:. stic... cotton alloi~~t; 671. 77 ac. & X (14) =or cotton diverted acres; 310. 00 ac. & X + X (15) (16) :-or feed gra'n base; 1, 498. 00 ac. & X3 + X4 + X5 . or dom-. stic feed crain base; 749. 00 ac. & X3 (17) For paic crain sorghum diversion. 499. 00 ac...
Chance Constrained Mixed Integer Program: Bilinear and Linear ...
2014-05-31T23:59:59.000Z
typically introduced to model decisions with concrete definitions in practice, e.g., quantity of ..... Indeed, given that our testing instances are unstructured, we.
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 programming optimization for aquifer influence functions on microcomputers
Brown, Don L
1989-01-01T23:59:59.000Z
NO FEASIBLE SOLUTION * I ) GOIO 600 25 CONTINUE INE=O I COUNT=ICDUNT+1 MM=O MPH=0 C C ******************************************************************* C * * C * CHECKING ROW INDICATORS FOR FEASIBILITY. * C * DEZERMINE THE ~ ABSOIUTE CHANGE...
Calmness of linear programs under perturbations of all data
M.J. CÃ¡novas
2014-05-26T23:59:59.000Z
May 26, 2014 ... Abstract: This paper provides operative point-based formulas (only involving the nominal data, and not data in a neighborhood) for computing ...
A Stable Primal-Dual Approach for Linear Programming under ...
2007-12-13T23:59:59.000Z
computations in this section were done on a Sun-Fire-480R running SunOS 5.8. ... negative effect that the loss of sparsity has on the stable direct solver, since ..... centiat thesis, Department of Mathematics, Linköping University, Sweden, 1991.
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 ...
An Augmented Primal-Dual Method for Linear Conic Programs
2007-04-11T23:59:59.000Z
Apr 11, 2007 ... apd-function with a conjugate gradient method illustrate the ... as a conjugate gradient type method or a limited memory BFGS method.
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
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
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 ...
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
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
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.
an elementary proof of optimality conditions for linear programming
2008-06-30T23:59:59.000Z
References. Acknowledgement. This note has its origin in discussions with Krister Svanberg on elementary proofs of Farkas' lemma. References. [1] A. Charnes.
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.
Abstract Interpretation and Object-oriented Programming
Cortesi, Tino
and logic programming, have been in the past a very fertile test bed for the development of sophisticated abstract domains and specialized fix- point algorithms. On the other hand, when looking overshadow the great potentialities of abstract interpretation on the mainstream programming platforms where
Dinh, Q Tran; Diehl, M
2011-01-01T23:59:59.000Z
This paper proposes an algorithmic framework for solving parametric optimization problems which we call adjoint-based predictor-corrector sequential convex programming. After presenting the algorithm, we prove a contraction estimate that guarantees the tracking performance of the algorithm. Two variants of this algorithm are investigated. The first one can be used to solve nonlinear programming problems while the second variant is aimed to treat online parametric nonlinear programming problems. The local convergence of these variants is proved. An application to a large-scale benchmark problem that originates from nonlinear model predictive control of a hydro power plant is implemented to examine the performance of the algorithms.
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.
Hanford External Dosimetry Program
Fix, J.J.
1990-10-01T23:59:59.000Z
This document describes the Hanford External Dosimetry Program as it is administered by Pacific Northwest Laboratory (PNL) in support of the US Department of Energy (DOE) and its Hanford contractors. Program services include administrating the Hanford personnel dosimeter processing program and ensuring that the related dosimeter data accurately reflect occupational dose received by Hanford personnel or visitors. Specific chapters of this report deal with the following subjects: personnel dosimetry organizations at Hanford and the associated DOE and contractor exposure guidelines; types, characteristics, and procurement of personnel dosimeters used at Hanford; personnel dosimeter identification, acceptance testing, accountability, and exchange; dosimeter processing and data recording practices; standard sources, calibration factors, and calibration processes (including algorithms) used for calibrating Hanford personnel dosimeters; system operating parameters required for assurance of dosimeter processing quality control; special dose evaluation methods applied for individuals under abnormal circumstances (i.e., lost results, etc.); and methods for evaluating personnel doses from nuclear accidents. 1 ref., 14 figs., 5 tabs.
The optimization problem Genetic Algorithm
GimÃ©nez, Domingo
The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results for time-power optimization META, October 27-31, 2014 1 / 25 #12;The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results Conclusions Time and energy optimization Traditionally
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.
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 ...
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 ...
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
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.
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.
Zhao, Yuxiao
.fritzson@liu.se Abstract This paper presents a survey on matching algorithms which are required to translate Modelica- mented in the programming language C and Meta- Modelica. In addition two cheap matching algorithms Introduction A major benefit of Equation based Object Oriented modeling Languages (EOOL) like Modelica
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
Parallel contact detection algorithm for transient solid dynamics simulations using PRONTO3D
Attaway, S.W.; Hendrickson, B.A.; Plimpton, S.J. [and others
1996-09-01T23:59:59.000Z
An efficient, scalable, parallel algorithm for treating material surface contacts in solid mechanics finite element programs has been implemented in a modular way for MIMD parallel computers. The serial contact detection algorithm that was developed previously for the transient dynamics finite element code PRONTO3D has been extended for use in parallel computation by devising a dynamic (adaptive) processor load balancing scheme.
Termination of Nondeterministic Quantum Programs
Yangjia Li; Nengkun Yu; Mingsheng Ying
2012-01-04T23:59:59.000Z
We define a language-independent model of nondeterministic quantum programs in which a quantum program consists of a finite set of quantum processes. These processes are represented by quantum Markov chains over the common state space. An execution of a nondeterministic quantum program is modeled by a sequence of actions of individual processes. These actions are described by super-operators on the state Hilbert space. At each step of an execution, a process is chosen nondeterministically to perform the next action. A characterization of reachable space and a characterization of diverging states of a nondeterministic quantum program are presented. We establish a zero-one law for termination probability of the states in the reachable space of a nondeterministic quantum program. A combination of these results leads to a necessary and sufficient condition for termination of nondeterministic quantum programs. Based on this condition, an algorithm is found for checking termination of nondeterministic quantum programs within a fixed finite-dimensional state space. A striking difference between nondeterministic classical and quantum programs is shown by example: it is possible that each of several quantum programs simulates the same classical program which terminates with probability 1, but the nondeterministic program consisting of them terminates with probability 0 due to the interference carried in the execution of them.
Non Linear Beam Dynamics Studies at SPEAR
Terebilo, A.; Pellegrini, C.; /UCLA; Cornacchia, M.; Corbett, J.; Martin, D.; /SLAC
2011-09-12T23:59:59.000Z
The frequency map analysis of a Hamiltonian system recently introduced to accelerators physics in combination with turn-by-turn phase space measurements opens new experimental opportunities for studying non linear dynamic in storage rings. In this paper we report on the experimental program at SPEAR having the goal of measuring the frequency map of the machine. In this paper we discuss the accuracy of the instantaneous tune extraction from experimental data and demonstrate the possibility of the frequency map measurement. The instantaneous tune extraction technique can be applied to experimental tracking data with reasonable accuracy. Frequency map can be experimentally determined using the existing turn-by-turn phase space measurement techniques and NAFF instantaneous tune extraction.
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
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
SWITCHING LMS LINEAR TURBO EQUALIZATION Seok-Jun Lee, Andrew C. Singer, and Naresh R. Shanbhag
Singer, Andrew C
SWITCHING LMS LINEAR TURBO EQUALIZATION Seok-Jun Lee, Andrew C. Singer, and Naresh R. Shanbhag-Champaign 1308 West Main Street, Urbana, IL 61801 Email: [slee6,acsinger,shanbhag]@uiuc.edu ABSTRACT Turbo symbol for each iteration. In this paper, we consider a class of turbo equal- ization algorithms in which
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.
Sponsored Program Resources SPONSORED PROGRAMS
Mather, Patrick T.
Sponsored Program Resources - 1 - SPONSORED PROGRAMS Sponsored programs are research, instruction for sponsored programs is provided through an agreement between the sponsor and Syracuse University are being achieved and funds properly used Sponsored programs are managed by the Office of Sponsored
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...
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)
Experience, is a unique educational program designed to introduce students in geophysics and related fields to "hands on" geophysical exploration and research. The program...
Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]
1997-08-21T23:59:59.000Z
This volume describes program administration that establishes and maintains effective organizational management and control of the emergency management program. Canceled by DOE G 151.1-3.
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...
Environmental Programs Environmental Programs Committee
Richards-Kortum, Rebecca
162 Environmental Programs Environmental Programs Committee Walter Whitfield Isle, Chair (English) Katherine Bennett Ensor (Statistics) Mark R. Wiesner (Civil and Environmental Engineering) Donald Ostdiek (Architecture) The Environmental Programs Committee coordinates courses and curricula on environmental topics
Accessible programming using program synthesis
Singh, Rishabh
2014-01-01T23:59:59.000Z
New computing platforms have greatly increased the demand for programmers, but learning to program remains a big challenge. Program synthesis techniques have the potential to revolutionize programming by making it more ...
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 ...
Pappas, George J.
in the context of linear programming. Besides its theoretical significance, its frequent appearance in the areas consider the linear assignment problem in the context of networked systems, where the main challenge and tasks, respectively, the linear assignment problem searches for a one-to-one matching between the agents
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.
Biholomorphic maps with linear parts having Jordan blocks: linearization and
Jordan block. Our main result proves convergence of the linearizing transformation of maps for which the Jordan part of the spectrum lies inside the unit circle and the spectrum satis#12;es a R in (C [x]) n , (1.2) where C [x] stands for the set of all formal power series with complex coe
Design and performance of the Stanford Linear Collider Control System
Melen, R.E.
1984-10-01T23:59:59.000Z
The success of the Stanford Linear Collider (SLC) will be dependent upon the implementation of a very large advanced computer-based instrumentation and control system. This paper describes the architectural design of this system as well as a critique of its performance. This critique is based on experience obtained from its use in the control and monitoring of 1/3 of the SLAC linac and in support of an expensive experimental machine physics experimental program. 11 references, 3 figures.
High dimensional linear inverse modelling
Cooper, Fenwick C
2015-01-01T23:59:59.000Z
We introduce and demonstrate two linear inverse modelling methods for systems of stochastic ODE's with accuracy that is independent of the dimensionality (number of elements) of the state vector representing the system in question. Truncation of the state space is not required. Instead we rely on the principle that perturbations decay with distance or the fact that for many systems, the state of each data point is only determined at an instant by itself and its neighbours. We further show that all necessary calculations, as well as numerical integration of the resulting linear stochastic system, require computational time and memory proportional to the dimensionality of the state vector.
Linear electric field mass spectrometry
McComas, D.J.; Nordholt, J.E.
1992-12-01T23:59:59.000Z
A mass spectrometer and methods for mass spectrometry are described. The apparatus is compact and of low weight and has a low power requirement, making it suitable for use on a space satellite and as a portable detector for the presence of substances. High mass resolution measurements are made by timing ions moving through a gridless cylindrically symmetric linear electric field. 8 figs.
Linearized theory of peridynamic states.
Silling, Stewart Andrew
2009-04-01T23:59:59.000Z
A state-based peridynamic material model describes internal forces acting on a point in terms of the collective deformation of all the material within a neighborhood of the point. In this paper, the response of a state-based peridynamic material is investigated for a small deformation superposed on a large deformation. The appropriate notion of a small deformation restricts the relative displacement between points, but it does not involve the deformation gradient (which would be undefined on a crack). The material properties that govern the linearized material response are expressed in terms of a new quantity called the modulus state. This determines the force in each bond resulting from an incremental deformation of itself or of other bonds. Conditions are derived for a linearized material model to be elastic, objective, and to satisfy balance of angular momentum. If the material is elastic, then the modulus state is obtainable from the second Frechet derivative of the strain energy density function. The equation of equilibrium with a linearized material model is a linear Fredholm integral equation of the second kind. An analogue of Poincare's theorem is proved that applies to the infinite dimensional space of all peridynamic vector states, providing a condition similar to irrotationality in vector calculus.
PROCESS CONTROLLABILITY ANALYSIS USING LINEAR AND NONLINEAR
Skogestad, Sigurd
PROCESS CONTROLLABILITY ANALYSIS USING LINEAR AND NONLINEAR OPTIMISATION Samara D. Chenery October linear and nonlinear dynamic optimisation techniques. For the linear case an optimal control problem is formulated to assess the best achievable performance for the set of linear time invariant (LTI) controllers
Sikes, Derek S.
MATH F314-F71 Linear Algebra Summer 2014 Instructor: Dr. Dana E. Madison, demadison2@alaska is by email. Class Dates and Times: July 7 August 14, 12:00pm 1:50pm Textbook: Linear Algebra and its: This is a first course in linear algebra that starts with the basic objects vectors, matrices, systems of linear
Why quantum dynamics is linear
Thomas F. Jordan
2007-02-16T23:59:59.000Z
Quantum dynamics is linear. How do we know? From theory or experiment? The history of this question is reviewed. Nonlinear generalizations of quantum mechanics have been proposed. They predict small but clear nonlinear effects, which very accurate experiments have not seen. Is there a reason in principle why nonlinearity is not found? Is it impossible? Does quantum dynamics have to be linear? Attempts to prove this have not been decisive, because either their assumptions are not compelling or their arguments are not conclusive. The question has been left unsettled. There is a simple answer, based on a simple assumption. It was found in two steps separated by 44 years. They are steps back to simpler and more compelling assumptions. A proof of the assumptions of the Wigner-Bargmann proof has been known since 1962. It assumes that the maps of density matrices in time are linear. For this step, it is also assumed that density matrices are mapped one-to-one onto density matrices. An alternative is to assume that pure states are mapped one-to-one onto pure states and that entropy does not decrease. In a step taken in 2006, it is proved that the maps of density matrices in time are linear. It is assumed, as in the earlier step, that at each time the physical quantities and states are described by the usual linear structures of quantum mechanics, so the question is only about how things change in time. Beyond that, the proof assumes only that the dynamics does not depend on anything outside the system, but must allow the system to be described as part of a larger system.
Shortest Path Algorithms: A Comparison
Golden, Bruce L., 1950-
In this note we present some computational evidence to suggest that a version of Bellman's shortest path algorithm outperforms Treesort- Dijkstra's for a certain class of networks.
Hedge Algorithm and Subgradient Methods
2010-10-05T23:59:59.000Z
standard complexity results on subgradient algorithms allows us to derive optimal parameters ...... the American Statistical Association, 58:13–30, 1963. 1In fact ...
Predicting Polymeric Crystal Structures by Evolutionary Algorithms
Qiang Zhu; Vinit Sharma; Artem R Oganov; Rampi Ramprasad
2014-06-05T23:59:59.000Z
The recently developed evolutionary algorithm USPEX proved to be a tool that enables accurate and reliable prediction of structures for a given chemical composition. Here we extend this method to predict the crystal structure of polymers by performing constrained evolutionary search, where each monomeric unit is treated as one or several building blocks with fixed connectivity. This greatly reduces the search space and allows the initial structure generation with different sequences and packings using these blocks. The new constrained evolutionary algorithm is successfully tested and validated on a diverse range of experimentally known polymers, namely polyethylene (PE), polyacetylene (PA), poly(glycolic acid) (PGA), poly(vinyl chloride) (PVC), poly(oxymethylene) (POM), poly(phenylene oxide) (PPO), and poly (p-phenylene sulfide) (PPS). By fixing the orientation of polymeric chains, this method can be further extended to predict all polymorphs of poly(vinylidene fluoride) (PVDF), and the complex linear polymer crystals, such as nylon-6 and cellulose. The excellent agreement between predicted crystal structures and experimentally known structures assures a major role of this approach in the efficient design of the future polymeric materials.
Set Linear Algebra and Set Fuzzy Linear Algebra
W. B. Vasantha Kandasamy; Florentin Smarandache; K. Ilanthenral
2008-06-17T23:59:59.000Z
In this book, the authors define the new notion of set vector spaces which is the most generalized form of vector spaces. Set vector spaces make use of the least number of algebraic operations, therefore, even a non-mathematician is comfortable working with it. It is with the passage of time, that we can think of set linear algebras as a paradigm shift from linear algebras. Here, the authors have also given the fuzzy parallels of these new classes of set linear algebras. This book is divided into seven chapters. The first chapter briefly recalls some of the basic concepts in order to make this book self-contained. Chapter two introduces the notion of set vector spaces which is the most generalized concept of vector spaces. Set vector spaces lends itself to define new classes of vector spaces like semigroup vector spaces and group vector spaces. These are also generalization of vector spaces. The fuzzy analogue of these concepts are given in Chapter three. In Chapter four, set vector spaces are generalized to biset bivector spaces and not set vector spaces. This is done taking into account the advanced information technology age in which we live. As mathematicians, we have to realize that our computer-dominated world needs special types of sets and algebraic structures. Set n-vector spaces and their generalizations are carried out in Chapter five. Fuzzy n-set vector spaces are introduced in the sixth chapter. The seventh chapter suggests more than three hundred problems.
Lecture 24: Parallel Algorithms I Topics: sort and matrix algorithms
Balasubramonian, Rajeev
1 Lecture 24: Parallel Algorithms I · Topics: sort and matrix algorithms #12;2 Processor Model a single clock (asynchronous designs will require minor modifications) · At each clock, processors receive input output #12;4 Control at Each Processor · Each processor stores the minimum number it has seen
A CMOS Current-Mode Dynamic Programming Circuit
Mak, Terrence
Dynamic programming (DP) is a fundamental algorithm for complex optimization and decision-making in many engineering and biomedical systems. However, conventional DP computation based on digital implementation of the ...
IBM Research CS/EE/Math Summer Intern Program
Pang, Alex
Intern Program in Computer Science, Electrical Engineering, and Mathematical Sciences at its locations.com/ Selected Research Areas Computer Science - Algorithms and Theory - Artificial Intelligence - Communications and Theory - Economics - Industrial Engineering - Knowledge Discovery and Data Mining - Management Science
Architecture-Aware Algorithms for Scalable Performance and Resilience on Heterogeneous Architectures
Dongarra, Jack [University of Tennessee, Knoxville] [University of Tennessee, Knoxville
2013-10-15T23:59:59.000Z
The goal of the Extreme-scale Algorithms & Software Institute (EASI) is to close the ?application-architecture performance gap? by exploring algorithms and runtime improvements that will enable key science applications to better exploit the architectural features of DOE extreme-scale systems. For the past year of the project, our efforts at the University of Tennessee have concentrated on, and made significant progress related to, the following high-level EASI goals: ? Develop multi-precision and architecture-aware implementations of Krylov, Poisson, Helmholtz solvers, and dense factorizations for heterogeneous multi-core systems; ? Explore new methods of algorithm resilience, and develop new algorithms with these capabilities; ? Develop runtime support for adaptable algorithms that are dealing with resilience, scalability; ? Distribute the new algorithms and runtime support through widely used software packages; ? Establish a strong outreach program to disseminate results, interact with colleagues and train students and junior members of our community.
International linear collider reference design report
Aarons, G.
2007-06-22T23:59:59.000Z
The International Linear Collider will give physicists a new cosmic doorway to explore energy regimes beyond the reach of today's accelerators. A proposed electron-positron collider, the ILC will complement the Large Hadron Collider, a proton-proton collider at the European Center for Nuclear Research (CERN) in Geneva, Switzerland, together unlocking some of the deepest mysteries in the universe. With LHC discoveries pointing the way, the ILC -- a true precision machine -- will provide the missing pieces of the puzzle. Consisting of two linear accelerators that face each other, the ILC will hurl some 10 billion electrons and their anti-particles, positrons, toward each other at nearly the speed of light. Superconducting accelerator cavities operating at temperatures near absolute zero give the particles more and more energy until they smash in a blazing crossfire at the centre of the machine. Stretching approximately 35 kilometres in length, the beams collide 14,000 times every second at extremely high energies -- 500 billion-electron-volts (GeV). Each spectacular collision creates an array of new particles that could answer some of the most fundamental questions of all time. The current baseline design allows for an upgrade to a 50-kilometre, 1 trillion-electron-volt (TeV) machine during the second stage of the project. This reference design provides the first detailed technical snapshot of the proposed future electron-positron collider, defining in detail the technical parameters and components that make up each section of the 31-kilometer long accelerator. The report will guide the development of the worldwide R&D program, motivate international industrial studies and serve as the basis for the final engineering design needed to make an official project proposal later this decade.
Optimal Constructions of Fault Tolerant Optical Linear Compressors and Linear Decompressors
Chang, Cheng-Shang
1 Optimal Constructions of Fault Tolerant Optical Linear Compressors and Linear Decompressors Cheng linear compressors and linear decompressors. The basic network element for our constructions is scaled first obtain a fundamental result on the minimum con- struction complexity of a linear compressor
Memory with memory: Soft assignment in Genetic Programming
Poli, Riccardo
Keywords Genetic Programming, Linear GP, Soft assignment, Memory with memory, Symbolic regressionMemory with memory: Soft assignment in Genetic Programming Nicholas Freitag McPhee Division was carried over to most versions of genetic programming (GP) that had state and assignments. This includes
Memory with Memory: Soft Assignment in Genetic Programming
Fernandez, Thomas
Keywords Genetic Programming, Linear GP, Soft assignment, Memory with memory, Symbolic regressionMemory with Memory: Soft Assignment in Genetic Programming Nicholas Freitag McPhee Division was carried over to most versions of genetic programming (GP) that had state and assignments. This includes
Cast dielectric composite linear accelerator
Sanders, David M. (Livermore, CA); Sampayan, Stephen (Manteca, CA); Slenes, Kirk (Albuquerque, NM); Stoller, H. M. (Albuquerque, NM)
2009-11-10T23:59:59.000Z
A linear accelerator having cast dielectric composite layers integrally formed with conductor electrodes in a solventless fabrication process, with the cast dielectric composite preferably having a nanoparticle filler in an organic polymer such as a thermosetting resin. By incorporating this cast dielectric composite the dielectric constant of critical insulating layers of the transmission lines of the accelerator are increased while simultaneously maintaining high dielectric strengths for the accelerator.
Linearized supergravity from Matrix theory
D. Kabat; W. Taylor
1998-03-10T23:59:59.000Z
We show that the linearized supergravity potential between two objects arising from the exchange of quanta with zero longitudinal momentum is reproduced to all orders in 1/r by terms in the one-loop Matrix theory potential. The essential ingredient in the proof is the identification of the Matrix theory quantities corresponding to moments of the stress tensor and membrane current. We also point out that finite-N Matrix theory violates the equivalence principle.
Precision linear ramp function generator
Jatko, W. Bruce (Knoxville, TN); McNeilly, David R. (Maryville, TN); Thacker, Louis H. (Knoxville, TN)
1986-01-01T23:59:59.000Z
A ramp function generator is provided which produces a precise linear ramp unction which is repeatable and highly stable. A derivative feedback loop is used to stabilize the output of an integrator in the forward loop and control the ramp rate. The ramp may be started from a selected baseline voltage level and the desired ramp rate is selected by applying an appropriate constant voltage to the input of the integrator.
Precision linear ramp function generator
Jatko, W.B.; McNeilly, D.R.; Thacker, L.H.
1984-08-01T23:59:59.000Z
A ramp function generator is provided which produces a precise linear ramp function which is repeatable and highly stable. A derivative feedback loop is used to stabilize the output of an integrator in the forward loop and control the ramp rate. The ramp may be started from a selected baseline voltage level and the desired ramp rate is selected by applying an appropriate constant voltage to the input of the integrator.
Segmented rail linear induction motor
Cowan, M. Jr.; Marder, B.M.
1996-09-03T23:59:59.000Z
A segmented rail linear induction motor has a segmented rail consisting of a plurality of nonferrous electrically conductive segments aligned along a guideway. The motor further includes a carriage including at least one pair of opposed coils fastened to the carriage for moving the carriage. A power source applies an electric current to the coils to induce currents in the conductive surfaces to repel the coils from adjacent edges of the conductive surfaces. 6 figs.
A linear induction motor conveyer
Solinsky, Kenneth Sheldon
1973-01-01T23:59:59.000Z
wave 14. Fundamentals of inducing a magnetic field. 25 15. Dsr made of conducting material placed above six current carrying wire . . . . . . . . . . . . . . . . . . . 26 16. Change in conductor's magnetic field with time. 27 17. Origin of. forces..., it is pos- sible to design a mears of moving certain objects, such that the arly moving parts of the entire convey- ing system are the items to be moved. Such a system can be used to move any item made of a nonmagnetic conductor. A linear inductior...
On program restructuring, scheduling, and communication for parallel processor systems
Polychronopoulos, Constantine D.
1986-08-01T23:59:59.000Z
This dissertation discusses several software and hardware aspects of program execution on large-scale, high-performance parallel processor systems. The issues covered are program restructuring, partitioning, scheduling and interprocessor communication, synchronization, and hardware design issues of specialized units. All this work was performed focusing on a single goal: to maximize program speedup, or equivalently, to minimize parallel execution time. Parafrase, a Fortran restructuring compiler was used to transform programs in a parallel form and conduct experiments. Two new program restructuring techniques are presented, loop coalescing and subscript blocking. Compile-time and run-time scheduling schemes are covered extensively. Depending on the program construct, these algorithms generate optimal or near-optimal schedules. For the case of arbitrarily nested hybrid loops, two optimal scheduling algorithms for dynamic and static scheduling are presented. Simulation results are given for a new dynamic scheduling algorithm. The performance of this algorithm is compared to that of self-scheduling. Techniques for program partitioning and minimization of interprocessor communication for idealized program models and for real Fortran programs are also discussed. The close relationship between scheduling, interprocessor communication, and synchronization becomes apparent at several points in this work. Finally, the impact of various types of overhead on program speedup and experimental results are presented. 69 refs., 74 figs., 14 tabs.
2008 Academic Program Review Graduate Programs
2008 Academic Program Review of Graduate Programs November 2008 Texas A&M University College ........................................................................................................12 III. Graduate Program.....................................................................................................14 B. Educational Programs
Swiler, Laura Painton; Eldred, Michael Scott
2009-09-01T23:59:59.000Z
This report documents the results of an FY09 ASC V&V Methods level 2 milestone demonstrating new algorithmic capabilities for mixed aleatory-epistemic uncertainty quantification. Through the combination of stochastic expansions for computing aleatory statistics and interval optimization for computing epistemic bounds, mixed uncertainty analysis studies are shown to be more accurate and efficient than previously achievable. Part I of the report describes the algorithms and presents benchmark performance results. Part II applies these new algorithms to UQ analysis of radiation effects in electronic devices and circuits for the QASPR program.
Algorithms for Stochastic Integer Programs Using Fenchel Cutting Planes
Venkatachalam, Saravanan
2014-08-10T23:59:59.000Z
characteristics . . . . . . . . . . . . . . . . . . . . . . . 88 5.11 Performance characteristics - using L1 norm . . . . . . . . . . . . . . 93 5.12 Performance characteristics - using L2 norm . . . . . . . . . . . . . . 94 A.1 Set 1 Computational results... OF CONTENTS . . . . . . . . . . . . . . . . . . . . . . . . . . . . . vii LIST OF FIGURES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ix LIST OF TABLES . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi 1. INTRODUCTION...
A scenario decomposition algorithm for 0-1 stochastic programs
2013-06-26T23:59:59.000Z
Jun 26, 2013 ... ... and impose a time limit of 5000 seconds. All computations are done using the boyle cluster in the ISyE High Performance Computing Facility.
General Methods for Algorithm Design 1. Dynamic Programming
Bezrukov, Sergei
MCO(p); for i = 1 to n do m[i, i] := 0 for l = 2 to n do for i = 1 to n - l + 1 do (j := i + l - 1; m] := q s[i, j] := k return m and s The running time of MCO is O(n3 ). Moreover MCO uses O(n2 ) memory
Advanced Dynamic Programming in CL: Theory, Algorithms, and Applications
Plotkin, Joshua B.
in determining the effectiveness of endovascular brachyther- apy. As we [24] and others [5] have argued earlier
Algorithm and intelligent tutoring system design for ladder logic programming
Cheng, Yuan-Teng
2009-05-15T23:59:59.000Z
knowledge. The problem here is how to design a web-based system that is intelligent and adaptive enough to teach the students domain knowledge in Programmable Logic Controller (PLC). In my research, I proposed a system architecture which combines the pre...
Applications and algorithms for mixed integer nonlinear programming
Linderoth, Jeffrey T.
the efficient management of electricity transmission [1], contingency analysis and blackout prevention of electric power systems [2], the design of water distribution networks [3], operational reloading of nuclear and flexibility, MINLPs have been proposed for many diverse and important scientific applications, including
Exploring a Two-Population Genetic Algorithm Steven Orla Kimbrough1
Kimbrough, Steven Orla
. In this paper we: (1) extend the investigation of two-market GAs to non- linear optimization, (2) introduce a new, two-population variant on the two-market idea, and (3) report on experiments with the twoBow College of Business, Philadelphia, PA 19104 wudj@drexel.edu Abstract. In a two-market genetic algorithm
Quadratic Diffusion Monte-Carlo Algorithms for Solving Atomic Many-Body Problems
Chin, Siu A.
1990-01-01T23:59:59.000Z
, or LGV2c, then, as discussed in Sec. II, the normalization energy would converge quadratically, despite that fact that the ground state of (28} only converges linearly. Genuine second-order algorithms can be obtained via ?ht(EL E)/2 gtL ht(EL E)/27'=e...
Algorithm PREQN: Fortran 77 Subroutines for Preconditioning the Conjugate Gradient Method
Nocedal, Jorge
Algorithm PREQN: Fortran 77 Subroutines for Preconditioning the Conjugate Gradient Method Jos subroutines for automatically generating pre conditioners for the conjugate gradient method. It is designed the conjugate gradient method. They are designed for solving a sequence of linear systems, A i x = b i ; i = 1
Convergence and Rate of Convergence of A Manifold-Based Dimension Reduction Algorithm
Huo, Xiaoming
of a particular manifold- based learning algorithm: LTSA [12]. The main technical tool is the perturbation analysis on the linear invariant subspace that corresponds to the solution of LTSA. We derive the upper bound for errors under the worst case for LTSA; it naturally leads to a convergence result. We
Lossy compression of discrete sources via Viterbi algorithm
Jalali, Shirin; Weissman, Tsachy
2010-01-01T23:59:59.000Z
We present a new lossy compressor for discrete-valued sources. For coding a sequence $x^n$, the encoder starts by assigning a certain cost to each possible reconstruction sequence. It then finds the one that minimizes this cost and describes it losslessly to the decoder via a universal lossless compressor. The cost of each sequence is a linear combination of its distance from the sequence $x^n$ and a linear function of its $k^{\\rm th}$ order empirical distribution. The structure of the cost function allows the encoder to employ the Viterbi algorithm to recover the minimizer of the cost. We identify a choice of the coefficients comprising the linear function of the empirical distribution used in the cost function which ensures that the algorithm universally achieves the optimum rate-distortion performance of any stationary ergodic source in the limit of large $n$, provided that $k$ diverges as $o(\\log n)$. Iterative techniques for approximating the coefficients, which alleviate the computational burden of find...
Phase and amplitude control system for Stanford Linear Accelerator
Yoo, S.J.
1983-09-26T23:59:59.000Z
The computer controlled phase and amplitude detection system measures the instantaneous phase and amplitude of a 1 micro-second 2856 MHz rf pulse at a 180 Hz rate. This will be used for phase feedback control, and also for phase and amplitude jitter measurement. The program, which was originally written by John Fox and Keith Jobe, has been modified to improve the function of the system. The software algorithms used in the measurement are described, as is the performance of the prototype phase and amplitude detector system.
Linear-quadratic control problem with a linear term on semiinfinite ...
2003-12-18T23:59:59.000Z
Dec 15, 2003 ... We describe a complete solution of the linear-quadratic control prob- lem on a semiinfinite interval with the linear term in the objective func-.