Powered by Deep Web Technologies
Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


1

A polynomial projection algorithm for linear programming  

E-Print Network [OSTI]

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.

2013-05-03T23:59:59.000Z

2

A NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING  

E-Print Network [OSTI]

We present a new polynomial-time algorithm for linear programming. In the worst case, the algorithm requires O(tf'SL) arithmetic operations on O(L) bit numbers, where n is the number of variables and L is the number of bits in the input. The running,time of this algorithm is better than the ellipsoid algorithm by a factor of O(n~'~). We prove that given a polytope P and a strictly in-terior point a E P, there is a projective transformation of the space that maps P, a to P', a ' having the following property. The ratio of the radius of the smallest sphere with center a', containing P ' to the radius of the largest sphere with center a ' contained in P ' is O(n). The algorithm consists of repeated application of such projective transformations each followed by optimization over an inscribed sphere to create a sequence of points which converges to the optimal solution in poly-nomial time.

N. Karmarkar

1984-01-01T23:59:59.000Z

3

a nonstandard simplex algorithm for linear programming 1.  

E-Print Network [OSTI]

Ten Algorithms in the Twenty Century (IEEE2002), it is one of the most famous and ... Section 3 formulas the proposed nonstandard algorithm. Section 4 deals...

2008-12-29T23:59:59.000Z

4

A polynomial relaxation-type algorithm for linear programming  

E-Print Network [OSTI]

Feb 6, 2011 ... The paper proposes a polynomial algorithm for solving systems of ... a polynomial relaxation-type procedure which either finds a solution for.

2011-02-06T23:59:59.000Z

5

Linear Programming Environmental  

E-Print Network [OSTI]

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

Nagurney, Anna

6

Enhanced algorithms for stochastic programming  

SciTech Connect (OSTI)

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.

Krishna, A.S.

1993-09-01T23:59:59.000Z

7

SCIL --Symbolic Constraints in Integer Linear Programming \\Lambda Ernst Althaus  

E-Print Network [OSTI]

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

Mehlhorn, Kurt

8

Inverse Stochastic Linear Programming  

E-Print Network [OSTI]

the objective is to schedule the production so as to deviate, in each period, as little as possible ..... We leave the exploration of the decomposition algorithms for future work. ... Principles on the Benefits of Manufacturing Process Flexibility,.

2007-01-05T23:59:59.000Z

9

MIXED INTEGER LINEAR PROGRAMMING FORMULATION ...  

E-Print Network [OSTI]

Jul 22, 2014 ... multi-commodity network flow problem with piecewise linear costs. ...... [82] IBM ILOG, CPLEX High-performance mathematical programming engine. .... Scheduling of Public Transport Urban Passenger Vehicle and Crew...

2014-07-22T23:59:59.000Z

10

Duality for Mixed-Integer Linear Programs  

E-Print Network [OSTI]

The theory of duality for linear programs is well-developed and has been ... tended to mixed-integer linear programs, but this has proven difficult, in part because...

2007-04-05T23:59:59.000Z

11

An Integer Programming Approach for Linear Programs with ...  

E-Print Network [OSTI]

Linear programs with joint probabilistic constraints (PCLP) are dif- ficult to solve ...... Stochastic optimization for operating chemical processes under uncertainty.

2008-05-02T23:59:59.000Z

12

Stochastic linear programming games with concave preferences  

E-Print Network [OSTI]

We study stochastic linear programming games: a class of stochastic ... which include minimum cost spanning trees (Granot and Huberman 1981) as a special

2014-12-04T23:59:59.000Z

13

Decomposing Linear Programs for Parallel Solution?  

E-Print Network [OSTI]

Decomposing Linear Programs for Parallel Solution? Ali P nar, Umit V. Catalyurek, Cevdet Aykanat in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited industrial applications and the advent of powerful computers have in- creased the users' ability to formulate

?atalyürek, ?mit V.

14

Decomposing Linear Programs for Parallel Solution ?  

E-Print Network [OSTI]

Decomposing Linear Programs for Parallel Solution ? Ali Pinar, ¨ Umit V. C¸ ataly¨urek, Cevdet in the solution of Linear Programming (LP) problems with block angular constraint matrices has been exploited with successful industrial applications and the advent of powerful computers have in­ creased the users' ability

?atalyürek, ?mit V.

15

On linear programing approach to inventory control  

E-Print Network [OSTI]

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

Mayfield, John

16

The Linear Complementarity Problem, Lemke Algorithm ...  

E-Print Network [OSTI]

... the known cases for which the algorithm works is restricted to problems LCP(q, M) in which M belongs to ..... A directed path along solid edges leads to.

2011-03-01T23:59:59.000Z

17

A linear program for testing local realism  

E-Print Network [OSTI]

We present a linear program that is capable of determining whether a set of correlations can be captured by a local realistic model. If the correlations can be described by such a model, the linear program outputs a joint probability distribution that produces the given correlations. If the correlations cannot be described under the assumption of local realism, the program outputs a Bell inequality violated by the correlations.

Matthew B. Elliott

2009-05-18T23:59:59.000Z

18

Outcome-Space Outer Approximation Algorithm for Linear ...  

E-Print Network [OSTI]

Jul 20, 2007 ... This paper presents an outcome-space outer approximation algo- rithm for globally solving the linear multiplicative programming prob- lem.

2007-07-20T23:59:59.000Z

19

Analysis of Copositive Optimization Based Linear Programming ...  

E-Print Network [OSTI]

instances on which upper and lower bounds are exact at a finite level of the hierarchy, .... where r ? N, gives rise to a linear programming problem with O(nr+

2014-04-18T23:59:59.000Z

20

A Strongly and Superlinearly Convergent SQP Algorithm for Optimization Problems with Linear Complementarity Constraints  

SciTech Connect (OSTI)

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.

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

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


21

Decoding Turbo-Like Codes via Linear Programming Jon Feldman David R. Karger  

E-Print Network [OSTI]

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

22

Solving Method for a Class of Bilevel Linear Programming based on ...  

E-Print Network [OSTI]

The paper studies and designs an genetic algorithm (GA) of the bilevel linear program- ... function approach method from White and Anandalingam, Aiyoshi and Shimizu [17, 18, 19], etc. 3. .... If v1 and v2 crossover, then the final off-

2003-06-14T23:59:59.000Z

23

APPLICATION OF NEURAL NETWORK ALGORITHMS FOR BPM LINEARIZATION  

SciTech Connect (OSTI)

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.

Musson, John C. [JLAB; Seaton, Chad [JLAB; Spata, Mike F. [JLAB; Yan, Jianxun [JLAB

2012-11-01T23:59:59.000Z

24

Linear Programming Algorithms for Sparse Filter Design  

E-Print Network [OSTI]

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

Baran, Thomas A.

25

Lifted Linear Programming Martin Mladenov Babak Ahmadi Kristian Kersting  

E-Print Network [OSTI]

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

Kersting, Kristian

26

Evolving Distributed Algorithms with Genetic Programming: Election  

E-Print Network [OSTI]

Evolving Distributed Algorithms with Genetic Programming: Election Thomas Weise Distributed Systems Group University of Kassel 34121 Kassel, Germany weise@vs.uni-kassel.de Michael Zapf Distributed Systems Group University of Kassel 34121 Kassel, Germany zapf@vs.uni-kassel.de ABSTRACT In this paper, we

Fernandez, Thomas

27

Feasible and accurate algorithms for covering semidefinite programs  

E-Print Network [OSTI]

Jul 2, 2010 ... Abstract: In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs.

Garud Iyengar

2010-07-02T23:59:59.000Z

28

Optimization Online - A new mixed integer linear programming ...  

E-Print Network [OSTI]

May 22, 2014 ... ... networks introduced in Stanimirovi\\'c and Mi\\v{s}kovi\\'c (2012). This paper introduces a new mixed integer linear programming formulation for...

Aleksandra Petrovic

2014-05-22T23:59:59.000Z

29

Non-Linear Stochastic Fractional Programming Model of Financial ...  

E-Print Network [OSTI]

2. Charles, V. and Dutta, D., A method for solving linear stochastic fractional programming problem with mixed constraints, Acta Ciencia Indica, Vol. XXX M,. No.

2005-04-19T23:59:59.000Z

30

Optimization Online - Large-Scale Linear Programming Techniques ...  

E-Print Network [OSTI]

Feb 12, 2002 ... Large-Scale Linear Programming Techniques for the Design of Protein Folding Potentials. Michael Wagner (mwagner ***at*** odu.edu)

Michael Wagner

2002-02-12T23:59:59.000Z

31

High Performance Computing linear algorithms for two-phase flow in porous media  

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

32

Linear Programming: Penn State Math 484 Lecture Notes  

E-Print Network [OSTI]

. Matrix Inverse 35 6. Solution of Linear Equations 37 7. Linear Combinations, Span, Linear Independence 39 Programs with Matlab 47 Chapter 4. Convex Sets, Functions and Cones and Polyhedral Theory 51 1. Convex Sets on the Graph of z. The level sets existing in R2 while the graph of z existing R3 . The level sets have been

Squicciarini, Anna Cinzia

33

Comparison of open-source linear programming solvers.  

SciTech Connect (OSTI)

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.

Gearhart, Jared Lee; Adair, Kristin Lynn; Durfee, Justin D.; Jones, Katherine A.; Martin, Nathaniel; Detry, Richard Joseph

2013-10-01T23:59:59.000Z

34

Solutions of differential equations by linear programming techniques  

E-Print Network [OSTI]

. INTRODUCTION II. LINEAR PROGRAMMING General Discussion. Theory of Linear ProSrsmming. a Duality . The Simplex Method anA LP/90. III. LINEAR DIFFZREKTAL EQUATIONS. General Discussion. A Limital Solution to a Differential Equation IV. THE ~ PROGRAMING... be traced back much further. A study of mathematical game theory was initiated. in 1928 by Von Neumann. In 1944 Von Neumann and Morgenstern published the book, Theory of Games and. Economic Behavior which is an economic application of minimax theory...

Saye, Jake Lee

2012-06-07T23:59:59.000Z

35

Global linear convergence of an augmented Lagrangian algorithm ...  

E-Print Network [OSTI]

section 5 by relating some numerical experiments on a seismic tomography problem and by a discussion on algorithmic consequences. Notation. We denote the...

2004-02-25T23:59:59.000Z

36

Section Notes 5 Review of Linear Programming  

E-Print Network [OSTI]

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

Chen, Yiling

37

Parallel supercomputing: Advanced methods, algorithms, and software for large-scale linear and nonlinear problems  

SciTech Connect (OSTI)

The program outlined here is directed to research on methods, algorithms, and software for distributed parallel supercomputers. Of particular interest are finite element methods and finite difference methods together with sparse iterative solution schemes for scientific and engineering computations of very large-scale systems. Both linear and nonlinear problems will be investigated. In the nonlinear case, applications with bifurcation to multiple solutions will be considered using continuation strategies. The parallelizable numerical methods of particular interest are a family of partitioning schemes embracing domain decomposition, element-by-element strategies, and multi-level techniques. The methods will be further developed incorporating parallel iterative solution algorithms with associated preconditioners in parallel computer software. The schemes will be implemented on distributed memory parallel architectures such as the CRAY MPP, Intel Paragon, the NCUBE3, and the Connection Machine. We will also consider other new architectures such as the Kendall-Square (KSQ) and proposed machines such as the TERA. The applications will focus on large-scale three-dimensional nonlinear flow and reservoir problems with strong convective transport contributions. These are legitimate grand challenge class computational fluid dynamics (CFD) problems of significant practical interest to DOE. The methods developed and algorithms will, however, be of wider interest.

Carey, G.F.; Young, D.M.

1993-12-31T23:59:59.000Z

38

Static and Dynamic Locality Optimizations Using Integer Linear Programming  

E-Print Network [OSTI]

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

Kuzmanovic, Aleksandar

39

PRICING ENERGY DERIVATIVES BY LINEAR PROGRAMMING: TOLLING AGREEMENT CONTRACTS  

E-Print Network [OSTI]

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

Uryasev, Stanislav

40

Approximate Linear Programming for Firstorder MDPs Scott Sanner  

E-Print Network [OSTI]

, the bounds that we derive for approximation error apply equally to all domain instantiations (i.eApproximate Linear Programming for First­order MDPs Scott Sanner University of Toronto Department

Sanner, Scott

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


41

On Programs with Linearly Ordered Multiple Preferences  

E-Print Network [OSTI]

programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these se, politics} N2 = {local, sports} N3 = {national, economy} N4 = {international, economy} . The redaction

Vermeir, Dirk

42

Sensitivity analysis in linear semi-infinite programming via partitions  

E-Print Network [OSTI]

Given a linear semi-infinite programming (LSIP) problem and a perturbation direction of the ... and, second, the recent paper [8], where conditions are given for the linearity. (not only on ...... and let x = xj. According to the final remark in Section.

2006-12-29T23:59:59.000Z

43

Optimization Online - Vector Space Decomposition for Linear ...  

E-Print Network [OSTI]

Feb 26, 2015 ... Abstract: This paper describes a vector space decomposition algorithmic framework for linear programming guided by dual feasibility...

Jean Bertrand Gauthier

2015-02-26T23:59:59.000Z

44

On Programs with Linearly Ordered Multiple Preferences  

E-Print Network [OSTI]

programs allows for the defeat of rules to resolve contradictions. We propose a refinement of these se the following extended answer sets: N 1 = {local , politics} N 2 = {local , sports} N 3 = {national , economy} N 4 = {international , economy} . The redaction wishes to order them according to their preferences

Vermeir, Dirk

45

Estimation of linear autoregressive models with Markov-switching, the E.M. algorithm revisited  

E-Print Network [OSTI]

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.

Rynkiewicz, Joseph

2008-01-01T23:59:59.000Z

46

Application of linear programming redispatch technique to dynamic generation allocation  

SciTech Connect (OSTI)

This paper considers dispatch problems that involve the allocation of system generation optimally among generating units while tracking a load curve and observing power rate limits of the units, system spinning reserve requirements and other security constraints. Two methods are used in the solution of the problem. The first method is quadratic programming technique combined with a linear programming redispatch technique. The latter utilizes a linear programming formulation of the dynamic dispatch problem about the base case static economic dispatch solution. Tests and computer results on 4 systems of different combinations of units and intervals are given to show the advantages of the techniques proposed.

Somuah, C.B. (Dept. of Electrical Engr., KFUPM, Dhahran 31261 (SA)); Khunaizi, N. (Saudi Consolidated Electric Co., In the Eastern Province, Dammam (SA))

1990-02-01T23:59:59.000Z

47

Linear Tolls Suce: New bounds and algorithms for tolls  

E-Print Network [OSTI]

; 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

Fleischer, Lisa K.

48

DYNAMIC PROGRAMMING ALGORITHM FOR RATE-DISTORTION OPTIMIZED MEDIA STREAMING  

E-Print Network [OSTI]

a dynamic programming algorithm for finding optimal transmission policies for a single packet in rate the assumption as a heuris- tic principle. Simulations show that for realistic channel models, the algorithm multimedia services over the Internet [1]. In contrast to traditional video transmission systems, a video

Reiterer, Harald

49

Representing the space of linear programs as a Grassmannian  

E-Print Network [OSTI]

Feb 22, 2006 ... We will show that there are only a finite number of stable points. Thus ... linear programs as the space of projection matrices. ..... QA[x]2AT QT ...... There are many questions related to the implementation and efficiency of these...

2006-03-01T23:59:59.000Z

50

An Energy-Efficient Algorithm For Conflict-Free AGV Routing On A Linear Path Layout  

E-Print Network [OSTI]

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

Zeng, Jianyang "Michael"

51

Distibuted Dense Numerical Linear Algebra Algorithms on massively parallel architectures: DPLASMA  

E-Print Network [OSTI]

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

Luszczek, Piotr

52

ECG Compression Algorithms Comparisons among EZW, Modified EZW and Wavelet Based Linear Prediction  

E-Print Network [OSTI]

ECG Compression Algorithms Comparisons among EZW, Modified EZW and Wavelet Based Linear Prediction 74 6 Recommendation for Future Research 78 List of References 79 Appendices 81 Appendix 1 ECG Signal.............................................87 #12;iv List of Tables 2.1 Variance Comparisons (ECG 16265

Fowler, Mark

53

Stochastic integer programming based algorithms for adaptable ...  

E-Print Network [OSTI]

Apr 22, 2012 ... In order to define the multi-stage problem clearly, we provide a dynamic programming ..... der of magnitude to 0.1 USD/minute. The third problem ... an OR manager trying to fit the surgeries into a Gantt chart. This is our attempt...

2012-04-22T23:59:59.000Z

54

A FAST ASYMPTOTICALLY EFFICIENT ALGORITHM FOR BLIND SEPARATION OF A LINEAR MIXTURE OF BLOCK-WISE STATIONARY AUTOREGRESSIVE PROCESSES  

E-Print Network [OSTI]

A FAST ASYMPTOTICALLY EFFICIENT ALGORITHM FOR BLIND SEPARATION OF A LINEAR MIXTURE OF BLOCK separation algorithm called Block AutoRegressive Blind Identi cation (BARBI). The al- gorithm to be applicable in blind separation of a linear mixture of speech signals. Index Terms-- Approximate joint

Yeredor, Arie

55

A FAST ASYMPTOTICALLY EFFICIENT ALGORITHM FOR BLIND SEPARATION OF A LINEAR MIXTURE OF BLOCK-WISE STATIONARY AUTOREGRESSIVE PROCESSES  

E-Print Network [OSTI]

A FAST ASYMPTOTICALLY EFFICIENT ALGORITHM FOR BLIND SEPARATION OF A LINEAR MIXTURE OF BLOCK separation algorithm called Block AutoRegressive Blind Identification (BARBI). The al- gorithm to be applicable in blind separation of a linear mixture of speech signals. Index Terms-- Approximate joint

Yeredor, Arie

56

A FAST SIMPLEX ALGORITHM FOR LINEAR PROGRAMMING 1 ...  

E-Print Network [OSTI]

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

2007-10-15T23:59:59.000Z

57

Interior-Point Algorithms for a Generalization of Linear Programming ...  

E-Print Network [OSTI]

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

2011-02-23T23:59:59.000Z

58

How bad is a gradient algorithm for linear programming?  

E-Print Network [OSTI]

Apr 20, 2011 ... Acknowledgement. Early discussions around 1980 with Erik van Doorn, as well as recent discussions with Kees. Roos and Michael Todd have...

peter

2011-04-20T23:59:59.000Z

59

An Algorithm for Nonlinear Optimization Using Linear Programming ...  

E-Print Network [OSTI]

We use the routine MA27 from the HSL library. [16] to factor ..... All tests described in this paper were performed on a Sun Ultra 5, with 1Gb of memory running...

60

EECS 495: Randomized Algorithms Lecture 10 Semi-definite Programming  

E-Print Network [OSTI]

eigen- value is violating constraint Rounding the SDP Goal: Want (i, j) to be cut when (1-vi·vj)/2EECS 495: Randomized Algorithms Lecture 10 Semi-definite Programming Reading: Text: Williamson a graph with small max cut but large LP value, e.g., square plus diagonal. Can strengthen with more

Immorlica, Nicole

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


61

Linear algorithms for phase retrieval in the Fresnel region: validity conditions  

E-Print Network [OSTI]

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.

Gureyev, T E

2015-01-01T23:59:59.000Z

62

Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming  

SciTech Connect (OSTI)

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.

Cardoso, Goncalo; Stadler, Michael; Siddiqui, Afzal; Marnay, Chris; DeForest, Nicholas; Barbosa-Povoa, Ana; Ferrao, Paulo

2013-05-23T23:59:59.000Z

63

A Linear Algorithm for Compact Box-Drawings of Trees Masud Hasan , Md. Saidur Rahman y , and Takao Nishizeki z  

E-Print Network [OSTI]

A Linear Algorithm for Compact Box-Drawings of Trees Masud Hasan #3; , Md. Saidur Rahman y, Bangladesh. Email: m2hasan@hopper.math.uwaterloo.ca y Graduate School of Information Sciences, Tohoku Univer

Wismath, Stephen

64

A Comparison of Software Packages for Verified Linear Programming  

E-Print Network [OSTI]

Jun 11, 2008 ... ... is supported by the Mathematical Programming Society and by the Optimization Technology Center. Mathematical Programming Society.

Christian Keil

2008-06-11T23:59:59.000Z

65

Pseudocodewords of Linear Programming Decoding of 3-Dimensional Turbo Codes  

E-Print Network [OSTI]

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

Rosnes, Eirik; Amat, Alexandre Graell i

2011-01-01T23:59:59.000Z

66

OPTIMIZATION OF TURBOMACHINERY AIRFOILS WITH A GENETIC/SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM  

E-Print Network [OSTI]

OPTIMIZATION OF TURBOMACHINERY AIRFOILS WITH A GENETIC/SEQUENTIAL QUADRATIC PROGRAMMING ALGORITHM words: shape optimization, aerodynamic design, turbomachinery, aerodynamics, genetic algorithms-magneto- gasdynamic effects. In the case of a turbomachinery aerodynamics, sources of entropy production other than

Dennis, Brian

67

Looking for strong polynomiality in Linear Programming : Arguments ...  

E-Print Network [OSTI]

L) operations equally on O(L)-digit numbers are involved. It is clear that ..... there is more detailed information on the conduct of the revised algorithm. Especially...

peter bruijs

2015-01-06T23:59:59.000Z

68

Extending the eigCG algorithm to non-symmetric linear systems with multiple right-hand sides  

SciTech Connect (OSTI)

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.

Abdou Abdel-Rehim, Kostas Orginos, Andreas Stathopoulos

2009-11-01T23:59:59.000Z

69

Relaxations of Approximate Linear Programs for the Real Option Management of Commodity Storage  

E-Print Network [OSTI]

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

Sadeh, Norman M.

70

Designing AC Power Grids using Integer Linear Programming  

E-Print Network [OSTI]

Although our linearization forces the power loss to be zero, we can use a dif- ferent approach to sucessfully approximate the power loss. This model is way more.

2011-02-18T23:59:59.000Z

71

Calmness of linear programs under perturbations of all data ...  

E-Print Network [OSTI]

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

2014-06-18T23:59:59.000Z

72

A study of linear programming and methods for programming the simplex method  

E-Print Network [OSTI]

Techniques, Johns Hopkins Press, Maryland (1958). 8. Symonds, G. H. , Linear Programmin: The Solution of Refinin Problems, Esso Standard Oil Company, New York (1955). CM*R*h' 1 dW tth, ~tt-ot t Anal sis: An A praisal, Volume 18, Princeton University Press... of the Air Force organized a research group under the title Project SCOOP (Scientific Computation of Optimal Programs) ~ As a direct result of thts research project Dantzig devised the first system- t' p d 1*~ii tg g 11' p g ' gp gt . Tli new method...

Watson, Warren Wallace

2012-06-07T23:59:59.000Z

73

Linear Stochastic Fractional Programming with Sum-of-Probabilistic ...  

E-Print Network [OSTI]

Fractional Programming Problem with Mixed Constraints, Acta Ciencia Indica,. Vol. XXX M, No. 3, pp 497-506. 11. Charles, V., and Dutta, D., Extremization of...

2005-04-19T23:59:59.000Z

74

Optimization Online - ADMM for Convex Quadratic Programs: Linear ...  

E-Print Network [OSTI]

Jan 8, 2015 ... Abstract: In this paper, we analyze the convergence of Alternating Direction Method of Multipliers (ADMM) on convex quadratic programs (QPs)...

Arvind U. Raghunathan

2015-01-08T23:59:59.000Z

75

A cutting surface algorithm for semi-infinite convex programming ...  

E-Print Network [OSTI]

Jun 16, 2013 ... this distribution optimization method and the cutting surface algorithm yields a ... We present a novel cutting surface algorithm for general ...... in their formulation are defined through bounds on the measure, bounds on the distance from a .... in Algorithm 2, in the remainder of this section we provide a short...

2013-06-16T23:59:59.000Z

76

Evolution of Biped Locomotion using Linear Genetic Programming  

E-Print Network [OSTI]

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

Wolff, Krister

77

A Warm-Start Approach for Large-Scale Stochastic Linear Programs  

E-Print Network [OSTI]

Aug 29, 2006 ... A Warm-Start Approach for Large-Scale Stochastic Linear Programs ... so that it can be seen as a structure-exploiting initial point generator.

Marco Colombo

2006-08-29T23:59:59.000Z

78

Analysis of Linear Programming Relaxations for a Class of Connectivity Problems  

E-Print Network [OSTI]

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

Goemans, Michel X.

79

Linear Program to Select Energy Conservation Projects in an Existing Facility  

E-Print Network [OSTI]

Linear Programming is a mathematical optimization tool which has been widely used in the chemical and petrochemical industries for scheduling, product planning and utility system optimization. In an energy audit of a refinery or chemical plant...

Mak, J. Y.

1983-01-01T23:59:59.000Z

80

Numerical solutions of a system of partial differential equations by a linear programming technique  

E-Print Network [OSTI]

NUMERICAL SOLUTIONS OF A SYSTEM OF PARTIAL DIFFERENTIAL EQUATIONS BY A LINEAR PROGRAMMING TECHNIQUE A Thesis By PATRICK LOUIS MUSMAKER Submitted to the Graduate College of the Texas A&M University in partial fulfillment of the requirements... for the degree of MASTER OF SCIENCE May 1967 Major Subject: Mathematics NUMERICAL SOLUTIONS OF A SYSTEM OF PARTIAL DIFFERENTIAL EQUATIONS BY A LINEAR PROGRAMMING TECHNIQUE A Thesis By PATRICK LOUIS MUSMAKER Approved as to sty1e and content by: (Chairman...

Musmaker, Patrick Louis

1967-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


81

Optimizing well-stimulation treatment size using mixed integer linear programming  

E-Print Network [OSTI]

OPTIMIZING WELL-STIMULATION TREATMENT SIZE USING MIXED INTEGER LINEAR PROGRAMMING A Thesis by OSCAR PICON ARANGUREN Submitted to the Office of Graduate Studies of Texas A&M University in partial fulfillment of the requirements for the degree... of MASTER OF SCIENCE August 2002 Major Subject: Petroleum Engineering OPTIMIZING WELL-STIMULATION TREATMENT SIZE USING MIXED INTEGER LINEAR PROGRAMMING A Thesis by OSCAR PICON ARANGUREN Submitted to Texas A&M University in partial fulfillment...

Picon Aranguren, Oscar

2002-01-01T23:59:59.000Z

82

Data Envelopment Analysis: A Linear Programming Application to Measure the Relative Efficiencies of Internal Business Divisions  

E-Print Network [OSTI]

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

Shockley, Laura

2014-05-16T23:59:59.000Z

83

An Integer Linear Programming Approach to Product Software Release  

E-Print Network [OSTI]

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

Utrecht, Universiteit

84

An Implementation of an Algorithm for Nonlinear Programming ...  

E-Print Network [OSTI]

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

2011-04-21T23:59:59.000Z

85

Fast Combinatorial Algorithm for the Solution of Linearly Constrained Least Squares Problems  

DOE Patents [OSTI]

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.

Van Benthem, Mark H. (Middletown, DE); Keenan, Michael R. (Albuquerque, NM)

2008-11-11T23:59:59.000Z

86

Efficient blind symbol rate estimation and data symbol detection algorithms for linearly modulated signals  

E-Print Network [OSTI]

cients, and the Mixture Kalman Filter (MKF) algorithm is used to marginalize out the fading channel coecients. At the end, two resampling schemes are adopted....

Park, Sang Woo

2009-05-15T23:59:59.000Z

87

Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides  

SciTech Connect (OSTI)

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.

Abdel-Rehim, A. M.; Stathopoulos, Andreas; Orginos, Kostas

2014-08-01T23:59:59.000Z

88

On the integer max-linear programming problem Peter Butkovic1,  

E-Print Network [OSTI]

and the integer max-linear programming problem. In max-algebra, for a, b R = R {-}, we define a b = max(a, b to Elsevier July 22, 2013 #12;A two-sided max-linear system (TSS) is of the form Ax c = Bx d where A, B R m time, and give a method in this case. If f R n , then the function f(x) = fT x is called max

Butkovic, Peter

89

The optimization of a function involving an integral by linear programming techniques  

E-Print Network [OSTI]

feasible solution. Then (4. 9) becomes (4. 10) Maximize: M3 = 1317. 15x(t20) + [340u(t0) - 800v(t )] + [1268. 06u(t ) ? 3105. 43v(t ) ? . 2611D(t ) + . 2611S(tl)] + [591. 16u(t2) ? 1506. 82v(t2) ? . 1217D(t2) + . 1217S (t2) ] [ ( -20) ( 2(j) 3 ( 20... for a particular dynamic economics problem and to determine the effectiveness of the linear programming solution procedure. The linear program- ming approach to the Thompson-George model was suggested by Dr. Russell G. Thompson of Texas A&M...

Goeble, Harold Everett

1969-01-01T23:59:59.000Z

90

Prior Reduced Fill-In in Solving Equations in Interior Point Algorithms  

E-Print Network [OSTI]

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

Birge, John R.

91

A Dynamic Programming Algorithm for RNA Structure Prediction Including Pseudoknots  

E-Print Network [OSTI]

minimum energy structure for a single RNA sequence, using standard RNA folding thermodynamic parameters algorithm to be able to fold optimal (minimum energy) pseudoknotted RNAs with the accepted RNA thermodynamic, particularly pairs which covary to maintain Watson-Crick complementarity, are indicative of conserved base

Eddy, Sean

92

A dynamic programming algorithm for RNA structure prediction including pseudoknots  

E-Print Network [OSTI]

­ ates the optimal minimum energy structure for a single RNA sequence, using standard RNA folding this is the first algorithm to be able to fold optimal (minimum energy) pseudoknotted RNAs with the accepted RNA­Crick complementarity, are indicative of conserved base pairing interactions. The accepted secondary structures of most

Eddy, Sean

93

Feasible and accurate algorithms for covering semidefinite programs  

E-Print Network [OSTI]

on ? is critical, and the algorithms in this paper may be preferable to those of the previous work. ..... transmit signal is zero-mean white noise with unit power and the noise at receiver i is ...... The final equality implies that Tr(Y)=1/n since K =.

2010-07-02T23:59:59.000Z

94

Quadratic integer programming and a technique for selection of regression coefficients  

E-Print Network [OSTI]

. . ~. . . ~. . . . . . . . . 1 Programming Problems. Linear Programming. Non-Linear Programming. Integer Linear Programming. Quadratic Integer Programming . kpplication in Statistics 1 2 6 7 II. QUADRATIC INTEGER PROGRAMMING. . . . . . . 9 Formulation of the Quadratic... Integer Programming Problem. The Kunsi-Oettli Algorithm. Theoretical Development Numerical Examples. 9 1$ 15 21 III. ~ICATION IN REGRESSION JQIMYSIS. Formulation of the Regression Problem . . . $0 Conclusions . . . . . . . . . . . . . . . 55...

Coward, James Michael

1966-01-01T23:59:59.000Z

95

Application of linear programming methods to determine the best location of concrete dispatch plants  

E-Print Network [OSTI]

Application of linear programming methods to determine the best location of concrete dispatch cement and concrete industry; "anybody can make concrete..... you just need cement, stone, sand, water the labor cost is so low, that for construction companies is cheaper to "handmade" their own concrete

Yong, Alexander

96

Pose Estimation of Object Categories in Videos Using Linear Programming Michele Fenzi1  

E-Print Network [OSTI]

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

Giger, Christine

97

Developmental Plasticity in Linear Genetic Programming Nicholas Freitag McPhee  

E-Print Network [OSTI]

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

Poli, Riccardo

98

Non-Linear Factor Model for Asset Selection using Multi Objective Genetic Programming  

E-Print Network [OSTI]

and sensi- tivity to market movement. In [8], the interest rates, money growth, oil prices, and growth framework of the model. It was shown that the market exhibits evidence for nonlinear behaviour with effectsNon-Linear Factor Model for Asset Selection using Multi Objective Genetic Programming Ghada Hassan

Fernandez, Thomas

99

Solving the Double Digestion Problem as a MixedInteger Linear Program \\Lambda  

E-Print Network [OSTI]

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

Zhang, Yin

100

The application of bi-level non-linear programming to the aluminum industry  

SciTech Connect (OSTI)

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.

Nicholls, M.

1994-12-31T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


101

The Lee-Yang and Polya-Schur Programs. I. Linear Operators Preserving Stability  

E-Print Network [OSTI]

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.

Borcea, Julius

2008-01-01T23:59:59.000Z

102

Linear and Bayesian Planet Detection Algorithms for the Terrestrial Planet Finder  

E-Print Network [OSTI]

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.

N. Jeremy Kasdin; Isabelle Braems

2006-01-02T23:59:59.000Z

103

Span programs and quantum algorithms for st-connectivity and claw detection  

E-Print Network [OSTI]

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.

Aleksandrs Belovs; Ben W. Reichardt

2012-03-12T23:59:59.000Z

104

Sporting Good Manufacturing Company: Optimal Manufacturing and Shipping Cost Through Linear Programming Models  

E-Print Network [OSTI]

Figure 15: Example Transshipment Model.............................................................................. 18 vi List of Principal Symbols and Nomenclature SGMC Sporting Good Manufacturing Company LP Linear Programming CEO Chief... Executive Officer COO Chief Operation Officer PKR Pakistani Rupees EMGT Engineering Management O.F. Objective Function A i No. of bats manufactured in factory i; where i = k, l BB i No. of Stumps manufactured in factory i; where i = k, l C i No...

Malik, Ejaz

2009-05-15T23:59:59.000Z

105

An Approximate Dynamic Programming Algorithm for the Allocation of High-Voltage Transformer Spares in the  

E-Print Network [OSTI]

An Approximate Dynamic Programming Algorithm for the Allocation of High-Voltage Transformer Spares high-voltage transformer spares throughout the electric grid to mitigate the risk of random transformer-voltage transformers are an integral part of the electric transmission system. A catas- trophic transformer failure

Powell, Warren B.

106

LINEAR-PROGRAMMING DESIGN AND ANALYSIS OF FAST ALGORITHMS FOR MAX 2-CSP  

E-Print Network [OSTI]

AND GREGORY B. SORKIN Abstract. The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint(rm/5) for r- valued problems), making it the fastest for Max Cut, and tied (at the time) for Max 2-Sat(·) notation, which ignores leading polynomial factors, is defined in Section 2.1.) For Max 2-CSP we give an O(r

Scott, Alexander Alexander

107

Solving multi-stage stochastic mixed integer linear programs by the ...  

E-Print Network [OSTI]

Finally, a numerical test on a real problem in energy market is provided. Keywords integer programming, stochastic programming, dual dynamic program- ming...

2012-01-26T23:59:59.000Z

108

Linear Programming in the Community In this project, we aimed to help a food pantry service by selecting the optimal  

E-Print Network [OSTI]

Linear Programming in the Community In this project, we aimed to help a food pantry service other food pantry services, where they distribute food by packets, each containing about the same a lottery system. Unlike other community food services where they distribute only the food donated to them

Yong, Alexander

109

Using Linear Genetic Programming to Develop a C/C++ Simulation Model of a Waste Incinerator. Larry M Deschaine PE  

E-Print Network [OSTI]

Using Linear Genetic Programming to Develop a C/C++ Simulation Model of a Waste Incinerator. Larry incinerator accurately. Human expert written simulation models are used worldwide in a variety of industrial waste incinerator. This process is a difficult problem to model. Previously, in a well-conducted study

Fernandez, Thomas

110

A Mixed-Integer Linear Programming Model for Optimizing the Scheduling and Assignment of Tank Farm Operations  

E-Print Network [OSTI]

1 A Mixed-Integer Linear Programming Model for Optimizing the Scheduling and Assignment of Tank) formulation for the Tank Farm Operation Problem (TFOP), which involves simultaneous scheduling of continuous multi-product processing lines and the assignment of dedicated storage tanks to finished products

Grossmann, Ignacio E.

111

Comparing Evolutionary Programs and Evolutionary Pattern Search Algorithms: A Drug Docking Application  

SciTech Connect (OSTI)

Evolutionary programs (EPs) and evolutionary pattern search algorithms (EPSAS) are two general classes of evolutionary methods for optimizing on continuous domains. The relative performance of these methods has been evaluated on standard global optimization test functions, and these results suggest that EPSAs more robustly converge to near-optimal solutions than EPs. In this paper we evaluate the relative performance of EPSAs and EPs on a real-world application: flexible ligand binding in the Autodock docking software. We compare the performance of these methods on a suite of docking test problems. Our results confirm that EPSAs and EPs have comparable performance, and they suggest that EPSAs may be more robust on larger, more complex problems.

Hart, W.E.

1999-02-10T23:59:59.000Z

112

E-Print Network 3.0 - advanced non-linear programming Sample...  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

; Geosciences 40 Fifth International Conference on Advanced Composite Materials in Bridges and Structures (ACMES-V) Winnipeg. Manitoba, Canada Summary: -dimensional linear and...

113

Branch-and-Cut for Linear Programs with Overlapping SOS1 ...  

E-Print Network [OSTI]

Apr 1, 2015 ... are derived by a sequential lifting procedure of cover inequalities. ...... F.: Future paths for integer programming and links to artificial intelligence.

Tobias Fischer and Marc E. Pfetsch

2015-04-01T23:59:59.000Z

114

Experiments in real time path planning for a small unmanned helicopter using mixed integer linear programming  

E-Print Network [OSTI]

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

Martinos, Ioannis, 1977-

2003-01-01T23:59:59.000Z

115

The program complexity on Universal Turing Machines, and a proposal to find efficient n-bounded algorithms of NPC problems by machine enumeration  

E-Print Network [OSTI]

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.

Zhou, YuQian

2012-01-01T23:59:59.000Z

116

Adequacy Assessment in Power Systems Using Genetic Algorithm and Dynamic Programming  

E-Print Network [OSTI]

Simulation sample a residual state space with a higher density of failure states. This thesis presents a modified Genetic Algorithm (GA) as the state space pruning tool, with higher efficiency and a controllable stopping criterion as well as better parameter...

Zhao, Dongbo

2011-02-22T23:59:59.000Z

117

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

SciTech Connect (OSTI)

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.

O'Leary, Dianne P. [Univ. of Maryland] [Univ. of Maryland; Tits, Andre [Univ. of Maryland] [Univ. of Maryland

2014-04-03T23:59:59.000Z

118

150-MW S-band klystron program at the Stanford Linear Accelerator Center  

SciTech Connect (OSTI)

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.

Sprehn, D.; Caryotakis, G.; Phillips, R.M.

1996-07-01T23:59:59.000Z

119

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

SciTech Connect (OSTI)

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

Machnes, S. [Quantum Group, Department of Physics, Tel-Aviv University, Tel Aviv 69978 (Israel); Institute for Theoretical Physics, University of Ulm, D-89069 Ulm (Germany); Sander, U.; Glaser, S. J.; Schulte-Herbrueggen, T. [Department of Chemistry, Technical University of Munich (TUM), D-85747 Garching (Germany); Fouquieres, P. de; Gruslys, A.; Schirmer, S. [Department of Applied Mathematics and Theoretical Physics, University of Cambridge, CB3 0WA (United Kingdom)

2011-08-15T23:59:59.000Z

120

ON LINEAR PROGRAMS WITH LINEAR COMPLEMENTARITY CONSTRAINTS  

E-Print Network [OSTI]

for the Degree of DOCTOR OF PHILOSOPHY Major Subject: Mathematical Sciences Approved by the Examining Committee of the Requirements for the Degree of DOCTOR OF PHILOSOPHY Major Subject: Mathematical Sciences The original . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2. THE LPCC AND ITS APPLICATIONS . . . . . . . . . . . . . . . . . . . . . 8 2.1 The Value-At-Risk

Mitchell, John E.

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


121

A Fast Algorithm for Total Variation Image Reconstruction from ...  

E-Print Network [OSTI]

we propose, analyze, and test a fast alternating minimization algorithm for image ... The per-iteration cost of the proposed algorithm involves a linear time.

2010-01-12T23:59:59.000Z

122

A Smart Algorithm for the Diagnosis of Short-Circuit Faults in a Photovoltaic Generator  

E-Print Network [OSTI]

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

Paris-Sud XI, Université de

123

Standards for graph algorithm primitives  

E-Print Network [OSTI]

It is our view that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building ...

Mattson, Tim

124

An Algorithm for Bootstrapping Communications  

E-Print Network [OSTI]

I present an algorithm which allows two agents to generate a simple language based only on observations of a shared environment. Vocabulary and roles for the language are learned in linear time. Communication is robust and ...

Beal, Jacob

2001-08-13T23:59:59.000Z

125

EXACT REGULARIZATION OF LINEAR PROGRAMS  

E-Print Network [OSTI]

Dec 26, 2005 ... optimization. An exact penalty formulation of a ... (convex) optimization problem. (

2006-01-05T23:59:59.000Z

126

Parallel solution of linear programs  

E-Print Network [OSTI]

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

Smith, Edmund

2013-11-28T23:59:59.000Z

127

Decomposition in Integer Linear Programming  

E-Print Network [OSTI]

vector of multipliers u that yield the largest bound are called optimal (dual) multipliers. It is easy to see that ..... Let us now return to the TSP example to further explore the use of the price and cut method. ... This shows the additional power of price and cut over the ...... Plant location with minimum inventory. Mathematical.

2005-08-16T23:59:59.000Z

128

Customized proximal point algorithms for linearly constrained ...  

E-Print Network [OSTI]

Oct 30, 2011 ... and it has been well studied in various fields such as the partial differential equations, .... For solving (1.4), a natural idea is to extend the ADM (1.7) in a .... In this section, we review some preliminaries which are useful later.

2011-10-30T23:59:59.000Z

129

An Adaptive Linear Approximation Algorithm for Copositive ...  

E-Print Network [OSTI]

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

2008-09-18T23:59:59.000Z

130

On Stable Piecewise Linearization and Generalized Algorithmic ...  

E-Print Network [OSTI]

Dec 30, 2012 ... we examine generalizations of the midpoint and the trapezoidal rule for the case of. Lipschitz continuous ...... Here we emphasize its quality in approximating the underlying ..... the assurance of overall continuity. Without, one...

2012-12-30T23:59:59.000Z

131

GENERALIZED DUAL FACE ALGORITHM FOR LINEAR ...  

E-Print Network [OSTI]

bT?y/?y ? bTu/u, ? 0 = u ? Null(BT). Proof. For P defined by (3.1), it holds that. (3.6). Pu = u = 0, ? 0 = u ? Null(BT). It is known from Cauchy inequality that.

2014-10-02T23:59:59.000Z

132

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

SciTech Connect (OSTI)

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.

WOHLBERG, BRENDT [Los Alamos National Laboratory; RODRIGUEZ, PAUL [Los Alamos National Laboratory

2007-01-08T23:59:59.000Z

133

Fault Tolerant Control using Cartesian Genetic Programming  

E-Print Network [OSTI]

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

Fernandez, Thomas

134

A FAST ALGORITHM FOR PROVING TERMINATING HYPERGEOMETRIC IDENTITIES *  

E-Print Network [OSTI]

Gosper's algorithm for* * indefinite hypergeometric summation . A MAPLE program implementing recently by Gasper and Rahman[G-R1]. A MAPLE program implementing the algorithm is available from explicitly, in the form QA

Zeilberger, Doron

135

Programming models  

SciTech Connect (OSTI)

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.

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

136

A new hybrid algorithm for analysis of HVdc and FACTs systems  

SciTech Connect (OSTI)

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.

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

137

A Linear Storage-Retrieval Policy for Robust Warehouse Management  

E-Print Network [OSTI]

Nov 10, 2008 ... A Linear Storage-Retrieval Policy for Robust Warehouse Management ... Keywords: Dynamic programming, Transportation, Materials handling,...

Marcus Ang

2008-11-10T23:59:59.000Z

138

Nonlocality improves Deutsch algorithm  

E-Print Network [OSTI]

Recently, [{arXiv:0810.3134}] is accepted and published. We show that the Bell inequalities lead to a new type of linear-optical Deutsch algorithms. We have considered a use of entangled photon pairs to determine simultaneously and probabilistically two unknown functions. The usual Deutsch algorithm determines one unknown function and exhibits a two to one speed up in a certain computation on a quantum computer rather than on a classical computer. We found that the violation of Bell locality in the Hilbert space formalism of quantum theory predicts that the proposed {\\it probabilistic} Deutsch algorithm for computing two unknown functions exhibits at least a $2\\sqrt{2}(\\simeq 2.83)$ to one speed up.

Koji Nagata; Sangkyung Lee; Jaewook Ahn

2007-03-15T23:59:59.000Z

139

DOE CALiPER Program, Report 21.2: Linear (T8) LED Lamp Performance in Five Types of Recessed Troffers  

SciTech Connect (OSTI)

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.

Miller, Naomi J.; Perrin, Tess E.; Royer, Michael P.; Wilkerson, Andrea M.; Beeson, Tracy A.

2014-05-20T23:59:59.000Z

140

Optimization Online - A Polynomial Time Algorithm to Solve a Class ...  

E-Print Network [OSTI]

Dec 28, 2014 ... ... linear Fisher markets, and Kelly capacity allocation markets, but has applications in other fields of study as well. The algorithm computes an...

Hadi Charkhgard

2014-12-28T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


141

USABC Program Highlights  

Broader source: Energy.gov (indexed) [DOE]

control algorithms (State-of-Charge estimation) Vehicle interface Diagnostics (State-of-Health estimation) Battery Pack Production and Support Battery Program...

142

Positrons for linear colliders  

SciTech Connect (OSTI)

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)

Ecklund, S.

1987-11-01T23:59:59.000Z

143

Applications of linear and nonlinear programming to the problems of curve fitting with special emphasis on a problem in activation analysis  

E-Print Network [OSTI]

~ E 1 5 ~ 8 ) FORMAT(12HAI MATRIX ~ I+o I I/5Xo2H I o5X ~ 6HXP100 ~ 10X ~ 2H" ~ & FORMAT (9HQ MATR IXo o I 1 o I HO&o 11 ) FORMAT(6Xo 2HQRo I I o3X ~ 2HXP ~ I 3 oEI 5 ~ 8) FORMAT(9HB VECTORS o 11) FORMAT(5X ~ 2H lo21X ~ 2HO ~ 86X ~ 4HA2R2o IBXo2HO..., there must be available the spectra 5 of each of the components present in the mixture. The possible presence of compounds not in the library spectrum and measurement errors gives a set of linear inequalities: a. x & b ] = l, 2~ i. ~ ~ m E i] 1? i~i (2...

Berman, Bernard H

1963-01-01T23:59:59.000Z

144

An object-oriented cluster search algorithm  

SciTech Connect (OSTI)

In this work we describe two object-oriented cluster search algorithms, which can be applied to a network of an arbitrary structure. First algorithm calculates all connected clusters, whereas the second one finds a path with the minimal number of connections. We estimate the complexity of the algorithm and infer that the number of operations has linear growth with respect to the size of the network.

Silin, Dmitry; Patzek, Tad

2003-01-24T23:59:59.000Z

145

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

146

Genetic algorithms  

SciTech Connect (OSTI)

Genetic algorithms solve problems by using principles inspired by natural population genetics: They maintain a population of knowledge structures that represent candidate solutions, and then let that population evolve over time through competition and controlled variation. GAs are being applied to a wide range of optimization and learning problems in many domains.

Grefenstette, J.J.

1994-12-31T23:59:59.000Z

147

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

148

E-Print Network 3.0 - adaptive general linear Sample Search Results  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Bilello Summary: of the learning algorithms that are used in both linear and nonlinear adaptive filters, and to describe a number... 2 x3 xn' Inputs Fig. 1: An adaptive linear...

149

Blind source separation of convolutive mixtures of non circular linearly modulated signals with unknown baud  

E-Print Network [OSTI]

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

Paris-Sud XI, Universit de

150

A Novel Retrieval Algorithm for Cloud Optical Properties from the Atmopsheric Radiation Measurement Program's Two-Channel Narrow-Field-of-View Radiometer  

SciTech Connect (OSTI)

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.

Wiscombe, Warren J.; Marshak, A.; Chiu, J.-Y. C.; Knyazikhin, Y.; Barnard, James C.; Luo, Yi

2005-03-14T23:59:59.000Z

151

Acclerator R&D for a Linear Collider  

SciTech Connect (OSTI)

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.

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

152

Welcome To CSCE 3030 Parallel Programming CSCE 3030: January 18, 2011 1  

E-Print Network [OSTI]

algorithms (vector dot products, matrix multiplication) Solving linear equations (Gaussian elimination, iterative solvers) Sorting (quick sort, bubble sort and others) Graph algorithms (shortest path

Kavi, Krishna

153

Genetic Algorithm Based Improved Sub-Optimal Model Reduction in Nyquist Plane for Optimal Tuning Rule Extraction of PID and PI{\\lambda}D{\\mu} Controllers via Genetic Programming  

E-Print Network [OSTI]

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.

Das, Saptarshi; Das, Shantanu; Gupta, Amitava; 10.1109/PACC.2011.5978962

2012-01-01T23:59:59.000Z

154

D-ADMM: A Communication-Efficient Distributed Algorithm For ...  

E-Print Network [OSTI]

graph, In is the identity matrix in Rn, and ? is the Kronecker product. Each column ...... program, which we solve with Matlab's quadprog function. Algorithm 3 was...

2012-02-13T23:59:59.000Z

155

Optimization Online - A Feasible Direction Algorithm for Nonlinear ...  

E-Print Network [OSTI]

Aug 21, 2014 ... Abstract: In this work we present a new feasible direction algorithm for solving smooth nonlinear second-order cone programs. These problems...

Alfredo Canelas

2014-08-21T23:59:59.000Z

156

On Termination of Integer Linear Loops Joel Ouaknine  

E-Print Network [OSTI]

On Termination of Integer Linear Loops Joel 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

Ouaknine, Jol

157

Algorithms for builder guidelines  

SciTech Connect (OSTI)

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.

Balcomb, J.D.; Lekov, A.B.

1989-06-01T23:59:59.000Z

158

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

159

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

160

Apprentice Program: Linear Algebra Instructor: Miklos Abert  

E-Print Network [OSTI]

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

Babai, László

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


161

SDDP FOR MULTISTAGE STOCHASTIC LINEAR PROGRAMS ...  

E-Print Network [OSTI]

stochastic uncertainty in engineering, transportation, finance and energy. ...... Energy. Springer, New York, 2011. [4] J. Cotter and K. Dowd. Extreme spectral risk...

2012-08-20T23:59:59.000Z

162

Shrink-Wrapping trajectories for Linear Programming  

E-Print Network [OSTI]

May 30, 2010 ... For a given method, of particular theoretical and practical interest is .... pre and post-multiplying A ? ?B by inverse Cholesky factors of B or ?B. ..... sufficiently small d1,d2 the boundary assumes hyperbolic shape, in particular,.

2010-05-30T23:59:59.000Z

163

Linear Programming Lower Bounds for Minimum Converter ...  

E-Print Network [OSTI]

of an optical network design consists of the cost of the installed equipment. ..... multiple (parallel) links (if no parallel links are allowed, this can be avoided by...

164

New linear and positive semidefinite programming based ...  

E-Print Network [OSTI]

... email:peter.dickinson@univie.ac.at. Faculty of Information Studies in Novo Mesto, Ulica talcev 3, 8000 Novo Mesto, Slovenia. email:janez.povh@fis.unm.si. 1...

2014-04-18T23:59:59.000Z

165

Polynomial Approximations for Continuous Linear Programs  

E-Print Network [OSTI]

first studied by Bellman [5] to model economic processes, but they have also applications in various areas of engineering and management science such as.

2012-04-05T23:59:59.000Z

166

Iterative Estimation Maximization for Stochastic Linear Programs ...  

E-Print Network [OSTI]

We analyze the performance of IEM from a column generation point of view ...... To generate the whole frontier, we add the following constraint to Model (M4).

2009-03-26T23:59:59.000Z

167

A computer program for linear models  

E-Print Network [OSTI]

II Z J 8 UJ 0 IU 4- IA Z a 0 IA IU K 2 O 0 Z IZ ?aa C w a 4IOO I- XVV ' ~ V ?I 2 2 J J 58 IL IU 4 4 0 0 4J UJ IU e VJ z UJ e V Z Z J W E 4 ll X RUJW ?I Vl I- I- VI ~ Z V UJ cl cl ZZ aa w V4JRZZ cl 0 ?LIL VV ZZ &I- IUIL a Vl IUW Ww... V I I 0 R H I-I 0 Z ZZ 3 3 0 0 Y Y X R Z IJI I- V I IU Z 0 4. V 4J EII Z Z K 4. Z K J 4. 3 H IU IU 0 $ +ZIU 0 0 N Pl Z I- ? J 4 Z EEI ORVIV 45 I- Z 0 V Z 4 R 0 V Z b H I- Z 0 ? V ? IA 0 IU Z a K?a IA IU ZP) LJ Q...

Zerbe, Manfred Rudolf

2012-06-07T23:59:59.000Z

168

Optimization Online - Integer Programming Submissions - 2014  

E-Print Network [OSTI]

A several new mixed integer linear programming formulations for exploration ... and Sensitivity Analysis using Generalized Subadditive Generator Functions: A...

169

Algorithm Development & Stepwise Refinement Algorithm Development  

E-Print Network [OSTI]

? Daylight savings time? Another required property of an algorithm is that each step can actually be carried to have no solution; algorithm asserts that a sub- problem will be solved without specifying how; etc

Murphy, John

170

New Hybrid Optimization Algorithms for Machine Scheduling Problems  

E-Print Network [OSTI]

operations. The paper ...... experiments conducted by [4]; taking into account the fact that our ... conduct an experimental study of linear-programming-based.

2006-12-03T23:59:59.000Z

171

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

172

A robustness application for linear estimation  

E-Print Network [OSTI]

, recursive algorithm for yielding estimates of the state of a linear dynamic system (see, for example, the excellent tutorial [1]). Many other applications of this estimation scheme exist in the areas of signal processing, power systems, telecommunications... on robustness causes the coefficient which maximizes J to approach the coefficient which produces maximum robustness. 37 REFERENCES [1] I. B. Rhodes, "A Tutorial Introduction to Estimation and Filtering, "IEEE Trans. on Automatic Control, vol. AC-16, pp...

Kitzman, Kenneth Victor

1990-01-01T23:59:59.000Z

173

A smooth perceptron algorithm  

E-Print Network [OSTI]

Sep 22, 2011 ... chine learning community, is a simple greedy algorithm for finding a solution ... perceptron algorithm finds a solution to (1) after at most 1 ?(A)2...

2011-09-22T23:59:59.000Z

174

A linearly constrained adaptive algorithm for seismic array processing  

E-Print Network [OSTI]

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

Byun, Bok Sub

1973-01-01T23:59:59.000Z

175

Linear Sum Assignment Algorithms for Distributed Multi-robot Systems  

E-Print Network [OSTI]

Multi-robot task assignment (allocation) involves assigning robots to tasks in order to optimize the entire teams performances. Until now, one of the most useful non-domain-specific ways to coordinate multi-robot systems is through task allocation...

Liu, Lantao

2013-04-30T23:59:59.000Z

176

AN EFFICIENT ALGORITHM FOR SECOND-ORDER CONE LINEAR ...  

E-Print Network [OSTI]

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

2013-01-28T23:59:59.000Z

177

An Algorithm for the Fast Solution of Linear Complementarity ...  

E-Print Network [OSTI]

Jun 4, 2007 ... ... Foundation grant CCF-0514772, Department of Energy grant DE-FG02- ...... a stand-alone physics processing unit [ 1 ], while graphics.

2007-06-04T23:59:59.000Z

178

Distributed Dense Numerical Linear Algebra Algorithms on massively parallel architectures  

E-Print Network [OSTI]

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

Boyer, Edmond

179

Optimal subgradient algorithms with application to large-scale linear ...  

E-Print Network [OSTI]

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.

2014-05-26T23:59:59.000Z

180

Efficient scalable algorithms for solving dense linear systems with ...  

E-Print Network [OSTI]

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.

2013-12-11T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


181

History of Proton Linear Accelerators  

E-Print Network [OSTI]

much. References 1. Linear Accelerators, edited by P. M .at the 1986 Linear Accelerator Conference, SLAC, Stanford,HISTORY OF PROTON LINEAR ACCELERATORS Luis W. Alvarez TWO-

Alvarez, Luis W.

1987-01-01T23:59:59.000Z

182

Deforestation: Transforming programs to eliminate trees  

E-Print Network [OSTI]

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

Wadler, Philip

183

Unit I-2 Linear Maps 1 Linear maps  

E-Print Network [OSTI]

Unit I-2 Linear Maps 1 Unit I-2 Linear maps Unit I-2 Linear Maps 2 Linear map · V & U are vector spaces over the same scalars · a function f: VU is a linear map if it preserves the vector space transformation [particularly when f: RnRm] ­ linear operator when f: V V [same v.s.] ­ linear mapping ­ linear

Birkett, Stephen

184

Statistical Parsing Inside Algorithm  

E-Print Network [OSTI]

Parsing · Review · Statistical Parsing · SCFG · Inside Algorithm · Outside Algorithm NLP statistical parsing 1 · Outside Algorithm · Viterbi Algorithm · Learning models · SCFG extensions · Other NLP statistical parsing 2 language and is often viewed as an important prerequisite for building

Ageno, Alicia

185

Learning Nonlinear Dynamical Systems using an EM Algorithm  

E-Print Network [OSTI]

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

Ghahramani, Zoubin

186

Converting online algorithms to local computation algorithms  

E-Print Network [OSTI]

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

Mansour, Yishay; Vardi, Shai; Xie, Ning

2012-01-01T23:59:59.000Z

187

Linearly Scaling 3D Fragment Method for Large-Scale Electronic Structure Calculations  

SciTech Connect (OSTI)

We present a new linearly scaling three-dimensional fragment (LS3DF) method for large scale ab initio electronic structure calculations. LS3DF is based on a divide-and-conquer approach, which incorporates a novel patching scheme that effectively cancels out the artificial boundary effects due to the subdivision of the system. As a consequence, the LS3DF program yields essentially the same results as direct density functional theory (DFT) calculations. The fragments of the LS3DF algorithm can be calculated separately with different groups of processors. This leads to almost perfect parallelization on tens of thousands of processors. After code optimization, we were able to achieve 35.1 Tflop/s, which is 39percent of the theoretical speed on 17,280 Cray XT4 processor cores. Our 13,824-atom ZnTeO alloy calculation runs 400 times faster than a direct DFTcalculation, even presuming that the direct DFT calculation can scale well up to 17,280 processor cores. These results demonstrate the applicability of the LS3DF method to material simulations, the advantage of using linearly scaling algorithms over conventional O(N3) methods, and the potential for petascale computation using the LS3DF method.

Wang, Lin-Wang; Lee, Byounghak; Shan, Hongzhang; Zhao, Zhengji; Meza, Juan; Strohmaier, Erich; Bailey, David H.

2008-07-01T23:59:59.000Z

188

A cooperative control algorithm for camera based observational systems.  

SciTech Connect (OSTI)

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.

Young, Joseph G.

2012-01-01T23:59:59.000Z

189

An Improved Algorithm for Biobjective Integer Programs  

E-Print Network [OSTI]

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.

2005-08-16T23:59:59.000Z

190

A Sequential Convex Semidefinite Programming Algorithm for ...  

E-Print Network [OSTI]

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(

2007-08-11T23:59:59.000Z

191

A Filter Algorithm for Nonlinear Semidefinite Programming  

E-Print Network [OSTI]

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.

2006-10-26T23:59:59.000Z

192

APPROXIMATE DYNAMIC PROGRAMMING--II: ALGORITHMS  

E-Print Network [OSTI]

. 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

Powell, Warren B.

193

A Linearly Convergent Linear-Time First-Order Algorithm for Support ...  

E-Print Network [OSTI]

Recently, Ahipasao?glu, Sun, and Todd [2] ..... [2] D. Ahipasao?glu, P. Sun, and M. J. Todd. ... LIBSVM: A library for support vector machines, 2001. Software...

2009-04-08T23:59:59.000Z

194

An Algorithm for Calculating the Probability of Classes of Data Patterns on a Genealogy  

E-Print Network [OSTI]

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

Koch, Jordan M.; Holder, Mark T.

2012-12-14T23:59:59.000Z

195

GRADUATE PROGRAM UNDERGRADUATE PROGRAMS  

E-Print Network [OSTI]

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

196

An elementary derivation of the Deutsch-Jozsa algorithm  

E-Print Network [OSTI]

Quantum computing takes fully advantage of the superposition principle to increase greatly (even exponentially) the speed of calculations, relative to the classical approach. The Deutsch-Jozsa algorithm is the simplest quantum algorithm illustrating this power. Unfortunately, the standard derivation involves several ingenious steps which usually leave students feeling that they could never have figured out the algorithm by themselves. We present here a different formulation of the problem which allows students to derive the algorithm using only basic knowledge of quantum mechanics and linear algebra.

Neda Amin; Patrick Labelle

2008-10-13T23:59:59.000Z

197

A Linear Parabolic Trough Solar Collector Performance Model  

E-Print Network [OSTI]

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

Qu, M.; Archer, D.; Masson, S.

2006-01-01T23:59:59.000Z

198

Reconstruction algorithms for MRI  

E-Print Network [OSTI]

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

Bilgic?, Berkin

2013-01-01T23:59:59.000Z

199

Structured Wide-Area Programming: Orc Programming Examples  

E-Print Network [OSTI]

Structured Wide-Area Programming: Orc Programming Examples Jayadev Misra Department of Computer Science University of Texas at Austin http://orc.csres.utexas.edu #12;Some Algorithms · Enumeration;Corresponding Orc program val (x, y) = (Ref(0), Ref(0)) def f1() = Ift(x?

Misra, Jayadev

200

ALGORITHM FOR ACCNT  

Energy Science and Technology Software Center (OSTI)

002651IBMPC00 Algorithm for Accounting for the Interactions of Multiple Renewable Energy Technologies in Estimation of Annual Performance

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


201

Bad semidefinite programs: they all look the same 1 Introduction  

E-Print Network [OSTI]

Conic linear programs provide a natural framework to study duality in convex programs, and model a wide variety of practical optimization problems.

2014-05-14T23:59:59.000Z

202

Specification of Selected Performance Monitoring and Commissioning Verification Algorithms for CHP Systems  

SciTech Connect (OSTI)

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.

Brambley, Michael R.; Katipamula, Srinivas

2006-10-06T23:59:59.000Z

203

DSDP5 user guide - software for semidefinite programming.  

SciTech Connect (OSTI)

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.

Benson, S. J.; Ye, Y.; Mathematics and Computer Science

2006-01-24T23:59:59.000Z

204

Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel  

E-Print Network [OSTI]

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

Boyer, Edmond

205

Top 10 Algorithms in Data Mining Xindong Wu ( )  

E-Print Network [OSTI]

Learning Theory. Springer-Verlag New York, Inc. ­ #6. EM: McLachlan, G. and Peel, D. (2000). Finite Mixture of Vermont, USA; #12;2 Top 10 Algorithms in Data Mining: Xindong Wu and Vipin Kumar "Top 10 Algorithms.5: Quinlan, J. R. 1993. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc. ­ #2. CART: L

Wu, Xindong

206

Robust Linear Optimization With Recourse  

E-Print Network [OSTI]

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

2010-05-19T23:59:59.000Z

207

Linear Quantum Feedback Networks  

E-Print Network [OSTI]

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.

J. Gough; R. Gohm; M. Yanagisawa

2008-07-15T23:59:59.000Z

208

Algorithms to Automate LCLS Undulator Tuning  

SciTech Connect (OSTI)

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.

Wolf, Zachary

2010-12-03T23:59:59.000Z

209

BS IE Program Educational Outcomes, Key Abilities, and Performance Indicators for ABET assessment B. Gopalakrishnan, IMSE, 04/11/13  

E-Print Network [OSTI]

to use modern and classical industrial engineering methodologies such as operations research Indicators Operations Research IENG 350 Linear programming Students will be able to solve linear programming of the linear program. Students will be able to use the Simplex Method to solve a linear program and conduct

Mohaghegh, Shahab

210

Control algorithms for dynamic attenuators  

SciTech Connect (OSTI)

Purpose: The authors describe algorithms to control dynamic attenuators in CT and compare their performance using simulated scans. Dynamic attenuators are prepatient beam shaping filters that modulate the distribution of x-ray fluence incident on the patient on a view-by-view basis. These attenuators can reduce dose while improving key image quality metrics such as peak or mean variance. In each view, the attenuator presents several degrees of freedom which may be individually adjusted. The total number of degrees of freedom across all views is very large, making many optimization techniques impractical. The authors develop a theory for optimally controlling these attenuators. Special attention is paid to a theoretically perfect attenuator which controls the fluence for each ray individually, but the authors also investigate and compare three other, practical attenuator designs which have been previously proposed: the piecewise-linear attenuator, the translating attenuator, and the double wedge attenuator. Methods: The authors pose and solve the optimization problems of minimizing the mean and peak variance subject to a fixed dose limit. For a perfect attenuator and mean variance minimization, this problem can be solved in simple, closed form. For other attenuator designs, the problem can be decomposed into separate problems for each view to greatly reduce the computational complexity. Peak variance minimization can be approximately solved using iterated, weighted mean variance (WMV) minimization. Also, the authors develop heuristics for the perfect and piecewise-linear attenuators which do not requirea priori knowledge of the patient anatomy. The authors compare these control algorithms on different types of dynamic attenuators using simulated raw data from forward projected DICOM files of a thorax and an abdomen. Results: The translating and double wedge attenuators reduce dose by an average of 30% relative to current techniques (bowtie filter with tube current modulation) without increasing peak variance. The 15-element piecewise-linear dynamic attenuator reduces dose by an average of 42%, and the perfect attenuator reduces dose by an average of 50%. Improvements in peak variance are several times larger than improvements in mean variance. Heuristic control eliminates the need for a prescan. For the piecewise-linear attenuator, the cost of heuristic control is an increase in dose of 9%. The proposed iterated WMV minimization produces results that are within a few percent of the true solution. Conclusions: Dynamic attenuators show potential for significant dose reduction. A wide class of dynamic attenuators can be accurately controlled using the described methods.

Hsieh, Scott S., E-mail: sshsieh@stanford.edu [Department of Radiology, Stanford University, Stanford, California 94305 and Department of Electrical Engineering, Stanford University, Stanford, California 94305 (United States); Pelc, Norbert J. [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)] [Department of Radiology, Stanford University, Stanford California 94305 and Department of Bioengineering, Stanford University, Stanford, California 94305 (United States)

2014-06-15T23:59:59.000Z

211

A complete implementation of the conjugate gradient algorithm on a reconfigurable supercomputer  

SciTech Connect (OSTI)

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.

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

212

Invertible Mappings of Nonlinear PDEs to Linear PDEs Through Admitted Conservation Laws  

E-Print Network [OSTI]

An algorithmic method using conservation law multipliers is introduced that yields necessary and sufficient conditions to find invertible mappings of a given nonlinear PDE to some linear PDE and to construct such a mapping when it exists. Previous methods yielded such conditions from admitted point or contact symmetries of the nonlinear PDE. Through examples, these two linearization approaches are contrasted.

Stephen C. Anco; George Bluman; Thomas Wolf

2008-01-26T23:59:59.000Z

213

Rank-Constrained Solutions to Linear Matrix Equations using PowerFactorization  

E-Print Network [OSTI]

Rank-Constrained Solutions to Linear Matrix Equations using PowerFactorization Authors: Justin P at Urbana-Champaign This is an author preprint of: J. P. Haldar, D. Hernando. "Rank-Constrained Solutions the IEEE. 1 #12;Abstract: Algorithms to construct/recover low-rank matrices satisfying a set of linear

Leahy, Richard M.

214

Duality in linearized gravity  

SciTech Connect (OSTI)

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.

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

215

Combustion powered linear actuator  

DOE Patents [OSTI]

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.

Fischer, Gary J. (Albuquerque, NM)

2007-09-04T23:59:59.000Z

216

Linear induction accelerator  

DOE Patents [OSTI]

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.

Buttram, M.T.; Ginn, J.W.

1988-06-21T23:59:59.000Z

217

Analyzing the Performance of a Multiobjective GA-P Algorithm for Learning Fuzzy Queries in  

E-Print Network [OSTI]

Analyzing the Performance of a Multiobjective GA-P Algorithm for Learning Fuzzy Queries in a Machine Learning Environment Oscar Cord´on1 , Enrique Herrera-Viedma1 , Mar´ia Luque1 , F´elix de Moya2- tionary algorithms (EAs) [1], such as genetic algorithm-programming (GA-P) [11] or simulated annealing

Fernandez, Thomas

218

APPROXIMATE DYNAMIC PROGRAMMING FOR OPTIMIZING OIL  

E-Print Network [OSTI]

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

Van Roy, Ben

219

Quantum digital-to-analog conversion algorithm using decoherence  

E-Print Network [OSTI]

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.

Akira SaiToh

2014-12-28T23:59:59.000Z

220

Sorghum Program BIOENERGY PROGRAM  

E-Print Network [OSTI]

Sorghum Program BIOENERGY PROGRAM Sorghums are important nongrain lignocellulosic feedstocks Biomass Switch Grass Forage Sorghum Bioenergy Sorghum Biomass per acre per year that can be converted (DT

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


221

Market Equilibrium via a Primal-Dual-Type Algorithm Nikhil R. Devanur  

E-Print Network [OSTI]

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

Saberi, Amin

222

A LOGICAL INVERTED TAXONOMY OF SORTING ALGORITHMS S.M. Merritt K.K. Lau  

E-Print Network [OSTI]

A LOGICAL INVERTED TAXONOMY OF SORTING ALGORITHMS S.M. Merritt K.K. Lau School of Computer Science­ mational programming and automatic program synthesis provided the insight that led to Merritt's inverted taxonomy of sorting algorithms. This provides a logical basis for the inverted taxonomy and expands

Lau, Kung-Kiu

223

History of Proton Linear Accelerators  

E-Print Network [OSTI]

the board to show why the accelerator couldn't work. Then atmuch. References 1. Linear Accelerators, edited by P. M .at the 1986 Linear Accelerator Conference, SLAC, Stanford,

Alvarez, Luis W.

1986-01-01T23:59:59.000Z

224

Linear Collider Physics Resource Book Snowmass 2001  

SciTech Connect (OSTI)

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.

Ronan (Editor), M.T.

2001-06-01T23:59:59.000Z

225

Logic Programming, Abduction and Probability  

E-Print Network [OSTI]

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

Poole, David

226

Wave functions of linear systems  

E-Print Network [OSTI]

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.

Tomasz Sowinski

2007-06-05T23:59:59.000Z

227

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

228

Proximal Algorithm Meets a Conjugate descent Matthieu Kowalski  

E-Print Network [OSTI]

] 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

229

Algorithms to Compute Minimum Cycle Basis in Directed Graphs #  

E-Print Network [OSTI]

, . . . ,C d whose incidence vectors permit a unique linear combination of the incidence vector of any cycleAlgorithms to Compute Minimum Cycle Basis in Directed Graphs # Telikepalli Kavitha + Kurt Mehlhorn # Abstract We consider the problem of computing a minimum cycle basis in a di­ rected graph G with m arcs

Mehlhorn, Kurt

230

CHARM: An Efficient Algorithm for Closed Itemset Mining  

E-Print Network [OSTI]

previous methods. It is also linearly scalable in the number of transactions. 1 Introduction Mining as follows: Given a large data base of item transactions, find all frequent itemsets, where a frequent-inspired algorithms [5, 13, 16] show good performance with sparse datasets such as market- basket data, where

Zaki, Mohammed Javeed

231

Asymptotic properties of some underdiagonal walks generation algorithms  

E-Print Network [OSTI]

to a random generator), the height of the walk at its last step and the maximum of the walk. We obtain various a linear algorithm for the random generation of single- rooted directed animals, whose #12;rst step is to generate an underdiagonal walk. In [2] they examine a more general class of underdiagonal walks made up

Louchard, Guy

232

Automated Algorithm for MFRSR Data Analysis  

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:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth (AOD)ProductssondeadjustsondeadjustAboutScience Program Cumulus Humilis, 2014Automated Algorithm for MFRSR

233

An Updated Set of 306 Test Problems for Nonlinear Programming ...  

E-Print Network [OSTI]

The availability of nonlinear programming test problems is extremely important to test optimization codes or to develop new algorithms. We describe the usage.

2009-11-16T23:59:59.000Z

234

On parallelizing dual decomposition in stochastic integer programming  

E-Print Network [OSTI]

Oct 9, 2012 ... Abstract: For stochastic mixed-integer programs, we revisit the dual decomposition algorithm of Car\\o{}e and Schultz from a computational...

Miles Lubin

2012-10-09T23:59:59.000Z

235

Adaptive Scheduling Algorithms for Planet Searches  

E-Print Network [OSTI]

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.

Eric B. Ford

2007-12-17T23:59:59.000Z

236

Linear Complexity Lossy Compressor for Binary Redundant Memoryless Sources  

E-Print Network [OSTI]

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.

Mimura, Kazushi

2011-01-01T23:59:59.000Z

237

On the order of general linear methods.  

SciTech Connect (OSTI)

General linear (GL) methods are numerical algorithms used to solve ODEs. The standard order conditions analysis involves the GL matrix itself and a starting procedure; however, a finishing method (F) is required to extract the actual ODE solution. The standard order analysis and stability are sufficient for the convergence of any GL method. Nonetheless, using a simple GL scheme, we show that the order definition may be too restrictive. Specifically, the order for GL methods with low order intermediate components may be underestimated. In this note we explore the order conditions for GL schemes and propose a new definition for characterizing the order of GL methods, which is focused on the final result--the outcome of F--and can provide more effective algebraic order conditions.

Constantinescu, E. M.; Mathematics and Computer Science

2009-09-01T23:59:59.000Z

238

A Sparse Common Spatial Pattern Algorithm for Brain-Computer Interface  

E-Print Network [OSTI]

and consider CSP as a Rayleigh quotient problem. We use sparse PCA and elastic net to calculate the sparse.e., their weights in linear combi- nations are non-zero. This problem makes a BCI system easy to be over algorithms face a loading problem, i.e., their weights in the linear combinations for PCA and CSP are non-zero

Lu, Bao-Liang

239

A quadratic algorithm for road coloring  

E-Print Network [OSTI]

The road coloring theorem states that every aperiodic directed graph with constant out-degree has a synchronized coloring. This theorem had been conjectured during many years as the road coloring problem before being settled by A. Trahtman. Trahtman's proof leads to an algorithm that finds a synchronized labeling with a cubic worst-case time complexity. We show a variant of his construction with a worst-case complexity which is quadratic in time and linear in space. We also extend the road coloring theorem to the periodic case.

Bal, Marie-Pierre

2008-01-01T23:59:59.000Z

240

Improving Quantum Algorithms for Quantum Chemistry  

E-Print Network [OSTI]

We present several improvements to the standard Trotter-Suzuki based algorithms used in the simulation of quantum chemistry on a quantum computer. First, we modify how Jordan-Wigner transformations are implemented to reduce their cost from linear or logarithmic in the number of orbitals to a constant. Our modification does not require additional ancilla qubits. Then, we demonstrate how many operations can be parallelized, leading to a further linear decrease in the parallel depth of the circuit, at the cost of a small constant factor increase in number of qubits required. Thirdly, we modify the term order in the Trotter-Suzuki decomposition, significantly reducing the error at given Trotter-Suzuki timestep. A final improvement modifies the Hamiltonian to reduce errors introduced by the non-zero Trotter-Suzuki timestep. All of these techniques are validated using numerical simulation and detailed gate counts are given for realistic molecules.

M. B. Hastings; D. Wecker; B. Bauer; M. Troyer

2014-03-23T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


241

Nonlinear Integer Programming  

E-Print Network [OSTI]

A polynomial f ? Z[x] is said to be integer-convex on [l,u] ? Rn, if for any finite ...... the mixed-integer linear programs codes Cplex and Xpress-MP, in conjunction ...... Bonami, P., Cornujols, G., Lodi, A., Margot, F.: A feasibility pump for mixed...

2009-06-28T23:59:59.000Z

242

Winding for linear pump  

DOE Patents [OSTI]

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.

Kliman, Gerald B. (Schenectady, NY); Brynsvold, Glen V. (San Jose, CA); Jahns, Thomas M. (Schenectady, NY)

1989-01-01T23:59:59.000Z

243

12.010 Computational Methods of Scientific Programming, Fall 2002  

E-Print Network [OSTI]

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

Herring, T. (Thomas)

244

12.010 Computational Methods of Scientific Programming, Fall 2007  

E-Print Network [OSTI]

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

Herring, T. (Thomas)

245

Linear equalities in blackbox optimization ?  

E-Print Network [OSTI]

May 28, 2014 ... extensions to treat problems with linear equalities whose expression is known. The main idea consists in reformulating the optimization...

Mathilde Peyrega

2014-05-28T23:59:59.000Z

246

Quantization of general linear electrodynamics  

SciTech Connect (OSTI)

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.

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

247

Linear Clearing Prices in Non-Convex European Day-Ahead Electricity Markets  

E-Print Network [OSTI]

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.

Martin, Alexander; Pokutta, Sebastian

2012-01-01T23:59:59.000Z

248

Graphs are among the most important abstract data structures in computer sci-ence, and the algorithms that operate on them are critical to modern life. Graphs  

E-Print Network [OSTI]

description that assumes a sparse matrix representation of the graph, and operates on that matrix with linear environments (e.g., Matlab ). (2) Ease of implementation. Parallel graph algorithms are notoriously difficult computation of graph algorithms. (3) Performance. Graph algorithms expressed by a series of sparse matrix

Kepner, Jeremy

249

An Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems  

SciTech Connect (OSTI)

Block tridiagonal systems of linear equations arise in a wide variety of scientific and engineering applications. Recursive doubling algorithm is a well-known prefix computation-based numerical algorithm that requires O(M^3(N/P + log P)) work to compute the solution of a block tridiagonal system with N block rows and block size M on P processors. In real-world applications, solutions of tridiagonal systems are most often sought with multiple, often hundreds and thousands, of different right hand sides but with the same tridiagonal matrix. Here, we show that a recursive doubling algorithm is sub-optimal when computing solutions of block tridiagonal systems with multiple right hand sides and present a novel algorithm, called the accelerated recursive doubling algorithm, that delivers O(R) improvement when solving block tridiagonal systems with R distinct right hand sides. Since R is typically about 100 1000, this improvement translates to very significant speedups in practice. Detailed complexity analyses of the new algorithm with empirical confirmation of runtime improvements are presented. To the best of our knowledge, this algorithm has not been reported before in the literature.

Seal, Sudip K [ORNL] [ORNL

2014-01-01T23:59:59.000Z

250

MATH 1503 Introduction to Linear Algebra Notes on MATLAB  

E-Print Network [OSTI]

1 MATH 1503 Introduction to Linear Algebra Notes on MATLAB MATLAB (`MATrix LABoratory as a programming language. MATLAB is available to UNB students on the University's Novell network ­ click on the `More Applications' icon, then click on the `MATLAB' icon. More than one release of MATLAB may

Monson, Barry

251

Independent Demand Models Non Linear (Chemical Industry -take or pay)  

E-Print Network [OSTI]

casesshippedperweek #12;High Variability Between Forecast and Actual · Demand in relation to the forecast means almostIndependent Demand Models · Non Linear (Chemical Industry - take or pay) · Deterministic Simulation (make to stock - lumpy demand) · Mathematical Programming (family structure - near optimum) · Heuristic

Brock, David

252

Graph algorithms experimentation facility  

E-Print Network [OSTI]

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

Sonom, Donald George

1994-01-01T23:59:59.000Z

253

Space Complexity Algorithms & Complexity  

E-Print Network [OSTI]

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

Way, Andy

254

Deforestation: Transforming programs to eliminate trees  

E-Print Network [OSTI]

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

Wadler, Philip

255

15.053 Introduction to Optimization, Spring 2004  

E-Print Network [OSTI]

Introduces students to the theory, algorithms, and applications of optimization. The optimization methodologies include linear programming, network optimization, dynamic programming, integer programming, non-linear ...

Orlin, James B., 1953-

256

A Note on Declarative Programming Paradigms and the Future of Definitional Programming  

E-Print Network [OSTI]

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

Torgersson, Olof

257

The optimization problem Genetic Algorithm  

E-Print Network [OSTI]

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

Giménez, Domingo

258

Euclid Programming  

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

259

Shrinking Procedures and Optimal Algorithms  

E-Print Network [OSTI]

Jun 18, 2012 ... Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal...

Saeed Ghadimi

2012-06-18T23:59:59.000Z

260

Deutsch and Jozsa's Algorithm Revisited  

E-Print Network [OSTI]

A classical analogue of Deutsch and Jozsa's algorithm is given and its implications on quantum computing is discussed

John W. Cooper

2006-03-27T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


261

On solving multistage stochastic programs with coherent risk ...  

E-Print Network [OSTI]

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

A. B. Philpott

2012-08-13T23:59:59.000Z

262

program2circuit ERIC C.R. HEHNER  

E-Print Network [OSTI]

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

Hehner, Eric C.R.

263

Designing programs that check their work \\Lambda Manuel Blum  

E-Print Network [OSTI]

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

Plotkin, Joshua B.

264

Graph Algorithms Tours in Graphs  

E-Print Network [OSTI]

terminates only at y. Graph Algorithms 14 #12;Combining the Main and the Secondary Cycles Let C = (x a secondary cycle C starting with y. - Combine the cycles C and C into C. Return the cycle C. Graph AlgorithGraph Algorithms Tours in Graphs Graph Algorithms #12;Special Paths and Cycles in Graphs Euler Path

Bar-Noy, Amotz

265

Multipartite entanglement in quantum algorithms  

SciTech Connect (OSTI)

We investigate the entanglement features of the quantum states employed in quantum algorithms. In particular, we analyze the multipartite entanglement properties in the Deutsch-Jozsa, Grover, and Simon algorithms. Our results show that for these algorithms most instances involve multipartite entanglement.

Bruss, D. [Institut fuer Theoretische Physik III, Heinrich-Heine-Universitaet Duesseldorf, D-40225 Duesseldorf (Germany); Macchiavello, C. [Dipartimento di Fisica 'A. Volta' and INFN-Sezione di Pavia, Via Bassi 6, 27100 Pavia (Italy)

2011-05-15T23:59:59.000Z

266

Stability of Coupling Algorithms  

E-Print Network [OSTI]

INTRODUCTION AND MOTIVATION : : : : : : : : : : : : : 1 A. Approaches to solving a coupled system . . . . . . . . . . . 3 B. Common terminology . . . . . . . . . . . . . . . . . . . . . 5 C. Classi cation of coupling algorithms . . . . . . . . . . . . . 7 1... equal, cA = cB = mA = mB = 1 and with dissipation, = 0:5 : : : : : : : : : : : : : : : : 26 10 Conditional stability observed with cA > cB. The material prop- erties: cA = 100; cB = 1; mA = mB = 1; = 1 : : : : : : : : : : : : : 27 11 An unstable...

Akkasale, Abhineeth

2012-07-16T23:59:59.000Z

267

Large scale tracking algorithms.  

SciTech Connect (OSTI)

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.

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

268

Non-linear programs with max-linear constraints: A heuristic approach  

E-Print Network [OSTI]

5, 2009 Abstract Let a b = max(a, b) and a b = a + b for a, b R and extend the pair of operations = max(a, b) and a b = a + b for a, b R and extend the pair of operations to matrices and vectors bkj = maxk(aik + bkj) for all i, j. Also, if R then A = ( aij). Max-algebra has been studied

Butkovic, Peter

269

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

270

[New technology for linear colliders  

SciTech Connect (OSTI)

This report discusses the following topics on research of microwave amplifiers for linear colliders: Context in current microwave technology development; gated field emission for microwave cathodes; cathode fabrication and tests; microwave cathode design using field emitters; and microwave localization.

McIntyre, P.M.

1992-08-12T23:59:59.000Z

271

Linear actuator powered flapping wing  

E-Print Network [OSTI]

Small scale unmanned aerial vehicles (UAVs) have proven themselves to be useful, but often too noisy for certain operations due to their rotary motors. This project examined the feasibility of using an almost silent linear ...

Benson, Christopher Lee

2010-01-01T23:59:59.000Z

272

An Augmented Primal-Dual Method for Linear Conic Programs  

E-Print Network [OSTI]

Apr 11, 2007 ... apd-function with a conjugate gradient method illustrate the ... as a conjugate gradient type method or a limited memory BFGS method.

2007-04-11T23:59:59.000Z

273

An application of linear programming to a Mississippi Delta farm  

E-Print Network [OSTI]

)nomlct, december, l&jg4. Of'u, iCK 8, D=SO --'. , I 1, F81 '. , " l 11, S. I. , 'Otm~ 81188 COO * h SO ' C 38tlf 8 IIII~ ~ SSIIS '8 SI ith, r opportunities 'n uthern love arms, love . . . ;xlcult nal Exp:. rlment totbm, es-arch ~ latin i;~, JancWrs ~ 19QO...

Cooke, Fred Thomas

1957-01-01T23:59:59.000Z

274

Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming  

E-Print Network [OSTI]

of offering strategies for a wind power producer, Electricdevelop offering strategies for wind power production whilethe uncertainty in wind power and market prices. In [23],

Cardoso, Goncalo

2014-01-01T23:59:59.000Z

275

Scheduling Smart Home Appliances Using Mixed Integer Linear Programming  

E-Print Network [OSTI]

electricity generation, personal electrical vehicles (PEVs) and distributed electricity generation the wind power's dynamic contribution to electricity generation and the PEVs' random demand of electricity electricity cost scheduling problem of smart home appliances. Operation char- acteristics, such as expected

Johansson, Karl Henrik

276

On Solving Single-objective Fuzzy Integer Linear Fractional Programs  

E-Print Network [OSTI]

Jun 5, 2009 ... Citation: Department of Mathematics, Faculty of Science, Helwan University Ain Helwan, Postal Code 11792, Cairo, Egypt. Download:...

Omar Saad

2009-06-05T23:59:59.000Z

277

Objective space for multiple objectives linear fractional programming  

E-Print Network [OSTI]

Apr 13, 2007 ... Citation: Mathematics Department Faculty of Science, Helwan University (11795) Cairo, Egypt. Download: [Postscript][PDF]. Entry Submitted:...

Said Tantawy

2007-04-13T23:59:59.000Z

278

Linear programming optimization for aquifer influence functions on microcomputers  

E-Print Network [OSTI]

for increasing operating speed and efficient computer storage with the AIF p~ on micraccmputers. Three LP methods were investigated on microoczrputers using the AIF p~: (I) the simplex method, (2) the revised simplex methcd, and (3) the symmetric msthcd. Each... ACKNOWLEIGEMENTS TABLE OF CONTENTS LIST OF TABLES LIST OF FIGURES INTRODUCTION LP METHODS V V1 V11 Simplex Methcd Revised Simplex Methcd Symmetric Methcd 5 12 18 TEST PROBLEMS 23 Test Problem 1 Test Problem 2 23 24 25 DISCUSSION OF RESULTS 03...

Brown, Don L

2012-06-07T23:59:59.000Z

279

Tools for primal degenerate linear programs: IPS, DCA, and PE  

E-Print Network [OSTI]

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-

2014-10-01T23:59:59.000Z

280

New Semidefinite Programming Relaxations for the Linear Ordering ...  

E-Print Network [OSTI]

The inverse operation to (11) is given by v j i ? vj?1 ... In Subsection 3.2 we conduct a polyhedral study to obtain semidefinite relaxations for the. (LOP) based on...

2015-01-15T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


281

The Concept of Recoverable Robustness, Linear Programming Recovery,  

E-Print Network [OSTI]

Christian Liebchen, Marco L¨ubbecke, Rolf M¨ohring, and Sebastian Stiller Technische Universit¨at Berlin, Strasse des 17. Juni 136, 10623 Berlin, Germany {liebchen,m.luebbecke,moehring,stiller

Lübbecke, Marco

282

Calmness of linear programs under perturbations of all data  

E-Print Network [OSTI]

May 26, 2014 ... Abstract: This paper provides operative point-based formulas (only involving the nominal data, and not data in a neighborhood) for computing...

M.J. Cánovas

2014-05-26T23:59:59.000Z

283

A Cutting Surface Method for Uncertain Linear Programs with ...  

E-Print Network [OSTI]

Nov 6, 2008 ... Since the utility function of a decision maker is not known to us, if we would like to ensure that X ... Then P is the line segment connecting.

2008-11-06T23:59:59.000Z

284

An Effective Heuristic for Multistage Stochastic Linear Programming  

E-Print Network [OSTI]

May 28, 2013 ... The average CPLEX time for the EV, ELP and SLP approaches has been ...... ability of any resource will prevent sales of the bundle, which...

2013-05-28T23:59:59.000Z

285

Multi-stage Stochastic Linear Programming: Scenarios Versus Events  

E-Print Network [OSTI]

average scenario). In the ELP approach, the potentially huge scenario tree of the SLP approach is ...... [13] J. Gondzio, R. Sarkissian, and J.-Ph. Vial. Parallel...

2010-05-17T23:59:59.000Z

286

an elementary proof of optimality conditions for linear programming  

E-Print Network [OSTI]

References. Acknowledgement. This note has its origin in discussions with Krister Svanberg on elementary proofs of Farkas' lemma. References. [1] A. Charnes.

2008-06-30T23:59:59.000Z

287

PuLP: A Linear Programming Toolkit for Python  

E-Print Network [OSTI]

Sep 5, 2011 ... PuLP is a high-level modelling library that leverages the power of the ..... ness between any two people is a function of the number of letters...

2011-09-05T23:59:59.000Z

288

Uniform Linear Transformation with Repair and Alternation in Genetic Programming  

E-Print Network [OSTI]

to the publication of this chapter we discovered that there was a bug in our code for the padding step of our ULTRA scheme does perform as reported here, and its source code is available at https://github.com/lspector/Clojush/blob/a1fd37f2a57b10319b16d66bcd2d6707d31c540c/src/clojush/pushgp/genetic_operators.clj #12;2 Lee Spector

Spector, Lee

289

Global Inference for Sentence Compression: An Integer Linear Programming Approach  

E-Print Network [OSTI]

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

Clarke, James

2008-01-01T23:59:59.000Z

290

THE CENTRAL CURVE IN LINEAR PROGRAMMING 1. Introduction ...  

E-Print Network [OSTI]

Newton steps needed to reach the optimal solution is to bound the total curvature of the ... On the right a close-up of the central path and its inflection points. cT = (?

2010-12-17T23:59:59.000Z

291

Equivalence of an Approximate Linear Programming Bound with the ...  

E-Print Network [OSTI]

Mar 6, 2013 ... management [5], stochastic games [32] and stochastic vehicle routing [47]. ...... The traveling-salesman problem and minimum spanning trees,...

2013-03-06T23:59:59.000Z

292

mixed zero-one linear programs under objective uncertainty  

E-Print Network [OSTI]

mization problems including the spanning tree [17], assignment [1, 29, 26, 32], traveling ...... Stochastic Sensitivity Analysis of Highest Order Statistic. ..... [17] A. M. Frieze (1985) On the value of a random minimum spanning tree problem,...

2010-10-28T23:59:59.000Z

293

Linear Dynamic Programs for Resource Management Marek Petrik  

E-Print Network [OSTI]

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

Massachusetts at Amherst, University of

294

Short Communication: A Linear Programming Approach for the ...  

E-Print Network [OSTI]

Abstract This work addresses the computation of free-energy differences between .... In this work, we enhance the morphing procedure by incorporating per-.

2008-09-19T23:59:59.000Z

295

Tools for primal degenerate linear programs: IPS, DCA, and PE  

E-Print Network [OSTI]

Oct 8, 2014 ... Abstract: This paper describes three recent tools for dealing with primal ... The idea is to work only with those constraints that correspond to...

Jean-Bertrand Gauthier

2014-10-08T23:59:59.000Z

296

On a new collection of stochastic linear programming testproblems ...  

E-Print Network [OSTI]

Energy is supplied by many different technologies, including hydro power .... ogy , which corresponds to peak consumption in period ..... ? i ? port (epz?{ .

2001-05-31T23:59:59.000Z

297

A several new mixed integer linear programming formulations for ...  

E-Print Network [OSTI]

May 31, 2014 ... formulations for exploration of online social networks ... open control devices in order to minimize the overall search process of online.

2014-05-31T23:59:59.000Z

298

A new mixed integer linear programming formulation for one ...  

E-Print Network [OSTI]

lem of exploration of online social networks introduced in Stanimirovic and. Mikovic .... the overall search process of online social network. More precisely, in...

2014-05-31T23:59:59.000Z

299

Improved Linear Programming Bounds for Antipodal Spherical Codes  

E-Print Network [OSTI]

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

300

A Stable Primal-Dual Approach for Linear Programming under ...  

E-Print Network [OSTI]

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, Linkping University, Sweden, 1991.

2007-12-13T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


301

Economic analysis of the Stiles Farm: a linear programming approach  

E-Print Network [OSTI]

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

Barreyro, Hector Ramon

1971-01-01T23:59:59.000Z

302

Chance Constrained Mixed Integer Program: Bilinear and Linear ...  

E-Print Network [OSTI]

typically introduced to model decisions with concrete definitions in practice, e.g., quantity of ..... Indeed, given that our testing instances are unstructured, we.

2014-05-31T23:59:59.000Z

303

Protein Helical Topology Prediction Using Mixed-Integer Linear Programming  

E-Print Network [OSTI]

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

Singh, Jaswinder Pal

304

A linear induction motor conveyer  

E-Print Network [OSTI]

A LINEAR INCUCTION MOTOR CONVEYER A Thesis Kenneth Sheldon. Solinsky Submitted to the Graduate College of Texas AkM University in partial fulfillment of the requirement for the degree of MASTER 07 SCIENCE May 1973 Major Subject: Industrial.... Howie, USAMC-ITC-P/P, Red River Army Depot, Texarkana, Texas 75501. Approved owxe, xe , ro uc o uction Engineering For the Commander ne , grec or, I A LINEAR INDUCTION MOTOR CONVEYER A Thesis by Kenneth Sheldon Solinsky App ved as to style...

Solinsky, Kenneth Sheldon

1973-01-01T23:59:59.000Z

305

BroadPeak: a novel algorithm for identifying broad peaks in dif-fuse ChIP-seq datasets  

E-Print Network [OSTI]

1 BroadPeak: a novel algorithm for identifying broad peaks in dif- fuse ChIP-seq datasets JianrongIP-seq datasets. We show that BroadPeak is a linear time algorithm that requires only two parame- ters, and we validate its performance on real and simulated histone modification ChIP-seq datasets. BroadPeak calls

Jordan, King

306

NASA/TM2010216190 A General Algorithm for Reusing Krylov  

E-Print Network [OSTI]

-Stokes Mark H. Carpenter Langley Research Center, Hampton, Virginia C. Vuik, Peter Lucas, Martin van Gijzen, and Hester Bijl Delft University of Technology, Delft, The Netherlands January 2010 #12;NASA STI Program­216190 A General Algorithm for Reusing Krylov Subspace Information. I. Unsteady Navier-Stokes Mark H. Carpenter

Vuik, Kees

307

Identifying Redundant Linear Constraints in Systems of Linear ...  

E-Print Network [OSTI]

Jun 22, 2006 ... This project was partially supported by an REU-NSF grant of ... metric Programming, Kluwer Academic Publishers, International Series in...

2006-06-22T23:59:59.000Z

308

Parallel contact detection algorithm for transient solid dynamics simulations using PRONTO3D  

SciTech Connect (OSTI)

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.

Attaway, S.W.; Hendrickson, B.A.; Plimpton, S.J. [and others

1996-09-01T23:59:59.000Z

309

Distribution of a Stochastic Control Algorithm Applied to Gas Storage Valuation  

E-Print Network [OSTI]

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

Vialle, Stphane

310

Survey of appropriate matching algorithms for large scale systems of differential algebraic equations  

E-Print Network [OSTI]

.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

Zhao, Yuxiao

311

Shor's algorithm on a nearest-neighbor machine  

E-Print Network [OSTI]

We give a new ``nested adds'' circuit for implementing Shor's algorithm in linear width and quadratic depth on a nearest-neighbor machine. Our circuit combines Draper's transform adder with approximation ideas of Zalka. The transform adder requires small controlled rotations. We also give another version, with slightly larger depth, using only reversible classical gates. We do not know which version will ultimately be cheaper to implement.

Samuel A. Kutin

2006-08-31T23:59:59.000Z

312

A Note on the Use of the Woodbury Formula To Solve Cyclic Block Tri-Diagonal and Cyclic Block Penta-diagonal Linear Systems of Equations  

E-Print Network [OSTI]

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.

Milan Batista; Abdel Rahman A. Ibrahim Karawia

2008-07-24T23:59:59.000Z

313

Non Linear Beam Dynamics Studies at SPEAR  

SciTech Connect (OSTI)

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.

Terebilo, A.; Pellegrini, C.; /UCLA; Cornacchia, M.; Corbett, J.; Martin, D.; /SLAC

2011-09-12T23:59:59.000Z

314

SWITCHING LMS LINEAR TURBO EQUALIZATION Seok-Jun Lee, Andrew C. Singer, and Naresh R. Shanbhag  

E-Print Network [OSTI]

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

Singer, Andrew C

315

Weighted Sum Rate Maximization of Correlated MISO Broadcast Channels under Linear Precoding  

E-Print Network [OSTI]

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

Paris-Sud XI, Universit de

316

Program School/ Career: Descripton ISIS Program Codes  

E-Print Network [OSTI]

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

Wisconsin at Madison, University of

317

Adjoint-based predictor-corrector sequential convex programming for parametric nonlinear optimization  

E-Print Network [OSTI]

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.

Dinh, Q Tran; Diehl, M

2011-01-01T23:59:59.000Z

318

NASA's sea ice program: present and future  

E-Print Network [OSTI]

· New remote sensing applications Infer properties such as sea ice thickness from ICESat Research · WhatNASA's sea ice program: present and future Thomas Wagner, PhD Program Scientist, Cryosphere NASA for remote sensing · New algorithms to interpret satellite data Improvements to long term satellite record

Kuligowski, Bob

319

Hanford External Dosimetry Program  

SciTech Connect (OSTI)

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.

Fix, J.J.

1990-10-01T23:59:59.000Z

320

Biholomorphic maps with linear parts having Jordan blocks: linearization and  

E-Print Network [OSTI]

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

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


321

Linear operator inequalities for strongly stable weakly regular linear systems  

E-Print Network [OSTI]

that A has compact resolvent and its eigenvectors form a Riesz basis for the state space, we give an explicit to a spectral factorization problem and to a lin- ear quadratic optimal control problem. More concretely R, which implies that R #21; 0. The associated linear matrix inequality in the unknown self

Curtain, Ruth F.

322

Non adiabatic quantum search algorithms  

E-Print Network [OSTI]

We present two new continuous time quantum search algorithms similar to the adiabatic search algorithm, but now without an adiabatic evolution. We find that both algorithms work for a wide range of values of the parameters of the Hamiltonian, and one of them has, as an additional feature that, for values of time larger than a characteristic one, it will converge to a state which can be close to the searched state.

A. Perez; A. Romanelli

2007-06-08T23:59:59.000Z

323

AN ENGINE OIL LIFE ALGORITHM.  

E-Print Network [OSTI]

??An oil-life algorithm to calculate the remaining percentage of oil life is presented as a means to determine the right time to change the oil (more)

Bommareddi, Anveshan

2009-01-01T23:59:59.000Z

324

Optimization Online - Coordinate descent algorithms  

E-Print Network [OSTI]

Dec 1, 2014 ... Stephen Wright(swright ***at*** cs.wisc.edu). Abstract: Coordinate descent algorithms solve optimization problems by successively minimizing...

Stephen Wright

2014-12-01T23:59:59.000Z

325

Shortest Path Algorithms: A Comparison  

E-Print Network [OSTI]

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.

Golden, Bruce L., 1950-

326

Growth of Smaller Grain Attached on Larger One: Algorithm to Overcome Unphysical Overlap between Grain  

E-Print Network [OSTI]

As a smaller grain, which is attached on larger one, is growing, it pushes also the larger one and other grains in its surrounding. In a simulation of similar system, repulsive force such as contact force based on linear spring-dashpot model can not accommodate this situation when cell growing rate is faster than simulation time step, since it produces sudden large overlap between grains that makes unphysical result. An algorithm that preserves system linear momentum by introducing additional velocity induced by cell growth is presented in this work. It should be performed in an implicit step. The algorithm has successfully eliminated unphysical overlap.

Acep Purqon; Sparisoma Viridi

2014-11-01T23:59:59.000Z

327

Branch-and-Price Guided Search for Integer Programs with an ...  

E-Print Network [OSTI]

yields a small restricted integer program to be solved next. The extended formulation is solved with a branch-and-price algorithm, which, when run to completion,...

2012-02-15T23:59:59.000Z

328

Linearized theory of peridynamic states.  

SciTech Connect (OSTI)

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.

Silling, Stewart Andrew

2009-04-01T23:59:59.000Z

329

Linear electric field mass spectrometry  

DOE Patents [OSTI]

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.

McComas, D.J.; Nordholt, J.E.

1992-12-01T23:59:59.000Z

330

Transformations for densities Linear transformations  

E-Print Network [OSTI]

' & $ % Lecture 28 Transformations for densities Linear transformations 1-1 differentiable functions General transformations Expectation of a function 1 #12;' & $ % Transformations for discrete transformation of a U[0, 1] · Take X U[0, 1], so that fX(x) = 1 0 0 and set Y

Adler, Robert J.

331

Termination of Nondeterministic Quantum Programs  

E-Print Network [OSTI]

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.

Yangjia Li; Nengkun Yu; Mingsheng Ying

2012-01-04T23:59:59.000Z

332

Localized overlap algorithm for unexpanded dispersion energies  

SciTech Connect (OSTI)

First-principles-based, linearly scaling algorithm has been developed for calculations of dispersion energies from frequency-dependent density susceptibility (FDDS) functions with account of charge-overlap effects. The transition densities in FDDSs are fitted by a set of auxiliary atom-centered functions. The terms in the dispersion energy expression involving products of such functions are computed using either the unexpanded (exact) formula or from inexpensive asymptotic expansions, depending on the location of these functions relative to the dimer configuration. This approach leads to significant savings of computational resources. In particular, for a dimer consisting of two elongated monomers with 81 atoms each in a head-to-head configuration, the most favorable case for our algorithm, a 43-fold speedup has been achieved while the approximate dispersion energy differs by less than 1% from that computed using the standard unexpanded approach. In contrast, the dispersion energy computed from the distributed asymptotic expansion differs by dozens of percent in the van der Waals minimum region. A further increase of the size of each monomer would result in only small increased costs since all the additional terms would be computed from the asymptotic expansion.

Rob, Fazle; Szalewicz, Krzysztof [Department of Physics and Astronomy, University of Delaware, Newark, Delaware 19716 (United States)] [Department of Physics and Astronomy, University of Delaware, Newark, Delaware 19716 (United States); Misquitta, Alston J. [School of Physics and Astronomy, Queen Mary, University of London, London E1 4NS (United Kingdom)] [School of Physics and Astronomy, Queen Mary, University of London, London E1 4NS (United Kingdom); Podeszwa, Rafa? [Institute of Chemistry, University of Silesia, Szkolna 9, 40-006 Katowice (Poland)] [Institute of Chemistry, University of Silesia, Szkolna 9, 40-006 Katowice (Poland)

2014-03-21T23:59:59.000Z

333

Predicting Polymeric Crystal Structures by Evolutionary Algorithms  

E-Print Network [OSTI]

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.

Qiang Zhu; Vinit Sharma; Artem R Oganov; Rampi Ramprasad

2014-06-05T23:59:59.000Z

334

Sponsored Program Resources SPONSORED PROGRAMS  

E-Print Network [OSTI]

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

Mather, Patrick T.

335

Why quantum dynamics is linear  

E-Print Network [OSTI]

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.

Thomas F. Jordan

2007-02-16T23:59:59.000Z

336

Program Manager  

Broader source: Energy.gov [DOE]

A successful candidate in this position will participate in a wide spectrum of program and project management activities involving systems engineering and integration support for Defense Programs...

337

Program Administration  

Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

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.

1997-08-21T23:59:59.000Z

338

Environmental Programs Environmental Programs Committee  

E-Print Network [OSTI]

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

Richards-Kortum, Rebecca

339

CS1428 : Honors Assignment 0: Algorithms in Real Life and Hello World  

E-Print Network [OSTI]

CS1428 : Honors Assignment 0: Algorithms in Real Life and Hello World 100 Points Due: Friday, Sep 6. The write-up does not need to be elaborate (1 page is sufficient). 2 Hello World Description For part two of this assginment you will write the hello world program in C++. This program has traditionally been the first

Qasem, Apan - Department of Computer Science, Texas State University

340

Segmented rail linear induction motor  

DOE Patents [OSTI]

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.

Cowan, Jr., Maynard (1107 Stagecoach Rd. SE., Albuquerque, NM 87123); Marder, Barry M. (1412 Pinnacle View Dr. NE., Albuquerque, NM 87123)

1996-01-01T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


341

Segmented rail linear induction motor  

DOE Patents [OSTI]

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.

Cowan, M. Jr.; Marder, B.M.

1996-09-03T23:59:59.000Z

342

Cast dielectric composite linear accelerator  

DOE Patents [OSTI]

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.

Sanders, David M. (Livermore, CA); Sampayan, Stephen (Manteca, CA); Slenes, Kirk (Albuquerque, NM); Stoller, H. M. (Albuquerque, NM)

2009-11-10T23:59:59.000Z

343

Precision linear ramp function generator  

DOE Patents [OSTI]

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.

Jatko, W.B.; McNeilly, D.R.; Thacker, L.H.

1984-08-01T23:59:59.000Z

344

International linear collider reference design report  

SciTech Connect (OSTI)

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.

Aarons, G.

2007-06-22T23:59:59.000Z

345

Bound reduction using pairs of linear inequalities  

E-Print Network [OSTI]

(FBBT), developed originally for Artificial Intelligence [9] and Constraint Programming and then successfully employed in Nonlinear Programming [19] and...

2011-11-11T23:59:59.000Z

346

Wheat Improvement Programs WHEAT PROGRAM  

E-Print Network [OSTI]

. Royalty revenues, which assist funding of programs and attracting/retaining top scientists, have increased

347

Efficient algorithms for mixed aleatory-epistemic uncertainty quantification with application to radiation-hardened electronics. Part I, algorithms and benchmark results.  

SciTech Connect (OSTI)

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.

Swiler, Laura Painton; Eldred, Michael Scott

2009-09-01T23:59:59.000Z

348

Advanced Dynamic Programming in CL: Theory, Algorithms, and Applications  

E-Print Network [OSTI]

in determining the effectiveness of endovascular brachyther- apy. As we [24] and others [5] have argued earlier

Plotkin, Joshua B.

349

Benchmarking a Scalable Approximate Dynamic Programming Algorithm for Stochastic Control  

E-Print Network [OSTI]

economical electrochemical energy storage technologies, storage solutions for grid-level applications remain), the finite-horizon energy storage problem is studied and a rule-based dispatch solution is obtained; however of Multidimensional Energy Storage Problems Daniel F. Salas1 , Warren B. Powell2 1 Department of Chemical & Biological

Powell, Warren B.

350

Algorithm and intelligent tutoring system design for ladder logic programming  

E-Print Network [OSTI]

-test, cased-based reasoning (i.e., heuristic functions), tutorials and tests of the domain concepts, and post-test (i.e., including pre-exam and post-exam) to customize students needs according to their knowledge levels and help them learn the PLC concepts...

Cheng, Yuan-Teng

2009-05-15T23:59:59.000Z

351

A scenario decomposition algorithm for 0-1 stochastic programs  

E-Print Network [OSTI]

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.

2013-06-26T23:59:59.000Z

352

Toward a molecular programming language for algorithmic self-assembly.  

E-Print Network [OSTI]

?? Self-assembly is the process whereby relatively simple components autonomously combine to form more complex objects. Nature exhibits self-assembly to form everything from microscopic crystals (more)

Patitz, Matthew John

2010-01-01T23:59:59.000Z

353

Toward a molecular programming language for algorithmic self-assembly.  

E-Print Network [OSTI]

??Self-assembly is the process whereby relatively simple components autonomously combine to form more complex objects. Nature exhibits self-assembly to form everything from microscopic crystals to (more)

Patitz, Matthew John

2010-01-01T23:59:59.000Z

354

Algorithms for Stochastic Integer Programs Using Fenchel Cutting Planes  

E-Print Network [OSTI]

to solve. 6 Honda Toyota Ford Ridgeline Accord Fit Tundra Camry Yaris F350 Focus Fiesta Truck Sedan HB Truck Sedan HB Truck Sedan HB Weight (lbs) 6,050 3,216 2,496 6,800 3,190 2,295 9,900 2,097 3,620 Length (inches) 207 195 162 229 189 154 233 179 160...-stage problems have been 11 almost exclusively restricted to disjunctive cut-generation schemes. In [29], lift-and- project cutting planes approach based on the ideas from [12] is used to solve problems with F = {B,C};S = {B,C}. Cutting planes are used...

Venkatachalam, Saravanan

2014-08-10T23:59:59.000Z

355

Lossy compression of discrete sources via Viterbi algorithm  

E-Print Network [OSTI]

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

Jalali, Shirin; Weissman, Tsachy

2010-01-01T23:59:59.000Z

356

Parallel Algorithms for Graph Optimization using Tree Decompositions  

SciTech Connect (OSTI)

Although many $\\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

Sullivan, Blair D [ORNL; Weerapurage, Dinesh P [ORNL; Groer, Christopher S [ORNL

2012-06-01T23:59:59.000Z

357

Algorithm PREQN: Fortran 77 Subroutines for Preconditioning the Conjugate Gradient Method  

E-Print Network [OSTI]

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

Nocedal, Jorge

358

Convergence and Rate of Convergence of A Manifold-Based Dimension Reduction Algorithm  

E-Print Network [OSTI]

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

Huo, Xiaoming

359

Quadratic Diffusion Monte-Carlo Algorithms for Solving Atomic Many-Body Problems  

E-Print Network [OSTI]

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

Chin, Siu A.

1990-01-01T23:59:59.000Z

360

A superlinear infeasible-interior-point algorithm for monotone complementarity problems  

SciTech Connect (OSTI)

We use the globally convergent framework proposed by Kojima, Noma, and Yoshise to construct an infeasible-interior-point algorithm for monotone nonlinear complementary problems. Superlinear convergence is attained when the solution is nondegenerate and also when the problem is linear. Numerical experiments confirm the efficacy of the proposed approach.

Wright, S. [Argonne National Lab., IL (United States). Mathematics and Computer Science Div.; Ralph, D. [Melbourne Univ., Parkville, VIC (Australia). Dept. of Mathematics

1996-11-01T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


361

Geometric algorithms for reconfigurable structures  

E-Print Network [OSTI]

In this thesis, we study three problems related to geometric algorithms of reconfigurable structures. In the first problem, strip folding, we present two universal hinge patterns for a strip of material that enable the ...

Benbernou, Nadia M

2011-01-01T23:59:59.000Z

362

Unit I-4 More about linear maps 1 More about linear maps  

E-Print Network [OSTI]

Unit I-4 More about linear maps 1 Unit I-4 More about linear maps Unit I-4 More about linear maps 2 Using bases to define linear maps · V, U vector spaces · a unique linear map T: V U is determined · if v = a1v1 + ... + anvn then T(v) = a1T(v1) + ... + anT(vn) Unit I-4 More about linear maps 3 Example

Birkett, Stephen

363

Linear Accelerator | Advanced Photon Source  

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:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr MayAtmospheric Optical Depth7-1D: VegetationEquipment Surfaces and Interfaces Sample6, 2011Liisa O'Neill About Us LiisaLin WangLinear

364

A CMOS Current-Mode Dynamic Programming Circuit  

E-Print Network [OSTI]

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

Mak, Terrence

365

Mathematical Programming Models and Their Relaxations for The ...  

E-Print Network [OSTI]

Note that the database graph on the right has a subgraph, which is structurally identical ..... We next introduce the matrix variable Y = yyT , where y is the vector .... which is a MATLAB interface for the semidefinite programming algorithm...

Birbil

2014-08-20T23:59:59.000Z

366

An algorithm for scheduling a large pumped storage plant  

SciTech Connect (OSTI)

The Michigan Electric Coordination Center (MEPCC), operated by Consumers Power and Detroit Edison Companies, has the responsibility for scheduling the Ludington pumped storage plant. Ludington has an extremely large economic effect on the Consumers Power and Detroit Edison Companies' system due to its size (over 1800 MW net demonstrated generating capability). This paper presents a dynamic programming algorithm for scheduling large pumped storage plants and shows how this method can be coordinated with the commitment of the thermal units of the system.

Cohen, A.I.; Wan, S.H.

1985-08-01T23:59:59.000Z

367

Scalable Load Distribution and Load Balancing for Dynamic Parallel Programs  

E-Print Network [OSTI]

shown that the algorithm scales according to the definition of scalability given following. LoadScalable Load Distribution and Load Balancing for Dynamic Parallel Programs E. Berger and J. C of an integrated load distribution-load balancing algorithm which was targeted to be both efficient and scalable

Berger, Emery

368

Extraction of diffuse correlation spectroscopy flow index by integration of Nth-order linear model with Monte Carlo simulation  

SciTech Connect (OSTI)

Conventional semi-infinite solution for extracting blood flow index (BFI) from diffuse correlation spectroscopy (DCS) measurements may cause errors in estimation of BFI (?D{sub B}) in tissues with small volume and large curvature. We proposed an algorithm integrating Nth-order linear model of autocorrelation function with the Monte Carlo simulation of photon migrations in tissue for the extraction of ?D{sub B}. The volume and geometry of the measured tissue were incorporated in the Monte Carlo simulation, which overcome the semi-infinite restrictions. The algorithm was tested using computer simulations on four tissue models with varied volumes/geometries and applied on an in vivo stroke model of mouse. Computer simulations shows that the high-order (N???5) linear algorithm was more accurate in extracting ?D{sub B} (errors?linear algorithm and semi-infinite solution were fairly small (errors?linear algorithm. DCS with the high-order linear algorithm shows the potential for the inter-subject comparison and longitudinal monitoring of absolute BFI in a variety of tissues/organs with different volumes/geometries.

Shang, Yu; Lin, Yu; Yu, Guoqiang, E-mail: guoqiang.yu@uky.edu [Department of Biomedical Engineering, University of Kentucky, Lexington, Kentucky 40506 (United States); Li, Ting [Department of Biomedical Engineering, University of Kentucky, Lexington, Kentucky 40506 (United States); State Key Laboratory for Electronic Thin Film and Integrated Device, University of Electronic Science and Technology of China, Chengdu 610054 (China); Chen, Lei; Toborek, Michal [Department of Neurosurgery, University of Kentucky, Lexington, Kentucky 40536 (United States)

2014-05-12T23:59:59.000Z

369

New architecture for RF power amplifier linearization  

E-Print Network [OSTI]

Power amplifier linearization has become an important part of the transmitter system as 3G and developing 4G communication standards require higher linearity than ever before. The thesis proposes two power amplifier ...

Boo, Hyun H

2009-01-01T23:59:59.000Z

370

Algorithm for detecting energy diversion. [Appendix contains an annotated bibliography  

SciTech Connect (OSTI)

The objective of this project was to investigate those factors influencing energy consumption and to develop advanced statistical algorithms and a corresponding computer program to aid utilities in identifying energy diversion by analyzing patterns of energy consumption and other factors readily available to the utility. This final report documents the development of the algorithms, the methodologies used in analyzing their validity, and the advantages and disadvantages of these methods that resulted from these analyses. In the internal study, the algorithms appear to discriminate diverters from the rest of the population. Problems were found that decreased the efficiency of the algorithms during the field investigation. These included the quality of the data used by the algorithms, and the incomplete description of diverters. For the external study 300 potential diverters were submitted to the participating utility for field investigation. They found many cases of vacancies, seasonal use, two cases of tampering, several of suspect nature, irregularities in billing, and a number of meter problems. The code development was not undertaken due to the inconclusive nature of the results obtained in the external validation of the algorithms. Two final recommendations are presented. The first, to create better profiles for diverters and nondiverters, a large sample investigation of electric utility customers should be conducted. This would eliminate selection bias problems perceived to be present in current data. The second provides a list of action items that can be taken by the utilities, to improve both present detection methods and any algorithms that may be developed in the future. 64 refs., 39 figs., 32 figs.

Altschul, R.E.; Janky, D.G.; Scholz, F.W.; Tjoelker, R.A.; Tosch, T.J.; Tosch, T.J. (Boeing Computer Services Co., Seattle, WA (United States))

1991-08-01T23:59:59.000Z

371

Repair of overheating linear accelerator  

SciTech Connect (OSTI)

Los Alamos Neutron Science Center (LANSCE) is a proton accelerator that produces high energy particle beams for experiments. These beams include neutrons and protons for diverse uses including radiography, isotope production, small feature study, lattice vibrations and material science. The Drift Tube Linear Accelerator (DTL) is the first portion of a half mile long linear section of accelerator that raises the beam energy from 750 keV to 100 MeV. In its 31st year of operation (2003), the DTL experienced serious issues. The first problem was the inability to maintain resonant frequency at full power. The second problem was increased occurrences of over-temperature failure of cooling hoses. These shortcomings led to an investigation during the 2003 yearly preventative maintenance shutdown that showed evidence of excessive heating: discolored interior tank walls and coper oxide deposition in the cooling circuits. Since overheating was suspected to be caused by compromised heat transfer, improving that was the focus of the repair effort. Investigations revealed copper oxide flow inhibition and iron oxide scale build up. Acid cleaning was implemented with careful attention to protection of the base metal, selection of components to clean and minimization of exposure times. The effort has been very successful in bringing the accelerator through a complete eight month run cycle allowing an incredible array of scientific experiments to be completed this year (2003-2004). This paper will describe the systems, investigation analysis, repair, return to production and conclusion.

Barkley, Walter; Baldwin, William; Bennett, Gloria; Bitteker, Leo; Borden, Michael; Casados, Jeff; Fitzgerald, Daniel; Gorman, Fred; Johnson, Kenneth; Kurennoy, Sergey; Martinez, Alberto; OHara, James; Perez, Edward; Roller, Brandon; Rybarcyk, Lawrence; Stark, Peter; Stockton, Jerry

2004-01-01T23:59:59.000Z

372

(Parallel Linear Algebra Package) Jess Cmara Moreno  

E-Print Network [OSTI]

álgebra lineal (Linear Algebra Objects). También permite la utilización de vistas (objetos referenciadosPLAPACK (Parallel Linear Algebra Package) Jesús Cámara Moreno Programación Paralela y Computación Reducción de Vectores Inicialización de PLAPACK. Funciones. Templates. Funciones. Linear Algebra Objects

Giménez, Domingo

373

Academic Programs  

E-Print Network [OSTI]

The Department of Mathematics offers a comprehensive educational program in applied and computational mathematics, and promotes both fundamental...

374

On program restructuring, scheduling, and communication for parallel processor systems  

SciTech Connect (OSTI)

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.

Polychronopoulos, Constantine D.

1986-08-01T23:59:59.000Z

375

Lifetime Approximation Schemes Allow Multicast Algorithm with Linear Message Complexity in Wireless Sensor Networks  

E-Print Network [OSTI]

residual battery energy based on the observation that long-lived multicast / broadcast trees should consume information in order to construct an energy efficient multicast tree. Sometimes, this centralized approach Sensor Networks Mianxiong Dong, Song Guo and Minyi Guo School of Electrical and Computer Engineering

Guo, Minyi

376

A Linear Time Algorithm for Pricing European Sequential Barrier Peng Gao Ron van der Meyden  

E-Print Network [OSTI]

option contract states an agreed price for a crude oil transaction 3 months in the future of the date depends on the current crude oil market price and expectations concerning price movements. Although period. Option con- tracts are one simple kind of financial derivative. For example, a 3-month crude oil

van der Meyden, Ron

377

Numerical Linear Algebra Algorithms, Applications, and Training. An NWO-JSPS joint Seminar.  

E-Print Network [OSTI]

systems. Shao-Liang Zhang, Nagoya University. 11:30 New developments in sparse matrix partitioning:30 Modularity graph clustering on the GPU. Bas Fagginger Auer, Utrecht University. 3:00 Coffee Break 3 of Technology. 6. TRUSTµ: Matlab software for large-scale non-negative regularization. Hoang Kien Nguyen, Delft

Rojas, Marielba

378

An EnergyEfficient Algorithm For ConflictFree AGV Routing On A Linear Path Layout  

E-Print Network [OSTI]

consumption will unavoidably become an important consideration for the AGV systems. The primary objective the energy, aiming to minimize energy consumption of the vehicles during routing. As the energy resource, to account for the energy consumption, we formulate a basic energy model for AGV routing, and the energy

Zeng, Jianyang "Michael"

379

A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear ...  

E-Print Network [OSTI]

Feb 5, 2005 ... ... which is the working horse in all IPMs. 2 .... Of course, system (3) is still hard to solve, but by applying Newton's method one can easily find...

2005-02-19T23:59:59.000Z

380

Developing a gas purchasing strategy using a linear model  

SciTech Connect (OSTI)

This paper outlines the process of developing a gas purchasing strategy with the use of a linear programming model. The linear model is used to determine the least cost approach regarding the acquisition of natural gas which has a considerable impact on the company`s financial performance. The author discusses the importance of optimizing gas costs from an end-user`s perspective. The Midland Cogeneration Venture (MCV) is the country`s largest cogeneration facility. The Facility has been certified by FERC (Federal Energy Regulatory Commission) as a Q.F. (Qualifying Facility) under PURPA (Public Utility Regulatory Policies Act of 1978). Unlike utilities, who have the ability to pass costs through to customers, MCV`s revenues are based on long-term contracts with its utility and industrial customers. Therefore, MCV cannot pass costs through to its customers. As such, effectively managing costs is vital to the success of the company.

Alst, K.M. Van [Midland Cogeneration Venture Limited Partnership, Midland, MI (United States)

1995-12-31T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


381

Finite element analyses of a linear-accelerator electron gun  

SciTech Connect (OSTI)

Thermo-structural analyses of the Beijing Electron-Positron Collider (BEPCII) linear-accelerator, electron gun, were performed for the gun operating with the cathode at 1000?C. The gun was modeled in computer aided three-dimensional interactive application for finite element analyses through ANSYS workbench. This was followed by simulations using the SLAC electron beam trajectory program EGUN for beam optics analyses. The simulations were compared with experimental results of the assembly to verify its beam parameters under the same boundary conditions. Simulation and test results were found to be in good agreement and hence confirmed the design parameters under the defined operating temperature. The gun is operating continuously since commissioning without any thermal induced failures for the BEPCII linear accelerator.

Iqbal, M., E-mail: muniqbal.chep@pu.edu.pk, E-mail: muniqbal@ihep.ac.cn [Centre for High Energy Physics, University of the Punjab, Lahore 45590 (Pakistan); Institute of High Energy Physics, Chinese Academy of Sciences, Beijing 100049 (China); Wasy, A. [Department of Mechanical Engineering, Changwon National University, Changwon 641773 (Korea, Republic of)] [Department of Mechanical Engineering, Changwon National University, Changwon 641773 (Korea, Republic of); Islam, G. U. [Centre for High Energy Physics, University of the Punjab, Lahore 45590 (Pakistan)] [Centre for High Energy Physics, University of the Punjab, Lahore 45590 (Pakistan); Zhou, Z. [Institute of High Energy Physics, Chinese Academy of Sciences, Beijing 100049 (China)] [Institute of High Energy Physics, Chinese Academy of Sciences, Beijing 100049 (China)

2014-02-15T23:59:59.000Z

382

Reticle stage based linear dosimeter  

DOE Patents [OSTI]

A detector to measure EUV intensity employs a linear array of photodiodes. The detector is particularly suited for photolithography systems that includes: (i) a ringfield camera; (ii) a source of radiation; (iii) a condenser for processing radiation from the source of radiation to produce a ringfield illumination field for illuminating a mask; (iv) a reticle that is positioned at the ringfield camera's object plane and from which a reticle image in the form of an intensity profile is reflected into the entrance pupil of the ringfield camera, wherein the reticle moves in a direction that is transverse to the length of the ringfield illumination field that illuminates the reticle; (v) detector for measuring the entire intensity along the length of the ringfield illumination field that is projected onto the reticle; and (vi) a wafer onto which the reticle imaged is projected from the ringfield camera.

Berger, Kurt W. (Livermore, CA)

2007-03-27T23:59:59.000Z

383

On extreme Bosonic linear channels  

E-Print Network [OSTI]

The set of all channels with fixed input and output is convex. We first give a convenient formulation of necessary and sufficient condition for a channel to be extreme point of this set in terms of complementary channel, a notion of big importance in quantum information theory. This formulation is based on the general approach to extremality of completely positive maps in an operator algebra due to Arveson. We then apply this formulation to prove the main result of this note: under certain nondegeneracy conditions, purity of the environment is necessary and sufficient for extremality of Bosonic linear (quasi-free) channel. It follows that Gaussian channel between finite-mode Bosonic systems is extreme if and only if it has minimal noise.

A. S. Holevo

2011-11-15T23:59:59.000Z

384

2008 Academic Program Review Graduate Programs  

E-Print Network [OSTI]

2008 Academic Program Review of Graduate Programs November 2008 Texas A&M University College ........................................................................................................12 III. Graduate Program.....................................................................................................14 B. Educational Programs

385

Programs of Study Programs of Study.......................................... .42  

E-Print Network [OSTI]

Programs ............................... .45 Minnesota Transfer Curriculum and Liberal Education41 Programs of Study Programs of Study.......................................... .42 UMC Degrees.................................................................................43 Certificates .......................................................................43 Program

Amin, S. Massoud

386

Linear Transformer Ideal Transformer Consider linear and ideal transformers attached to Circuit 1 and Circuit 2.  

E-Print Network [OSTI]

Linear Transformer Ideal Transformer I1 + V2 _ + V1 _ Consider linear and ideal transformers in linear transformer equations for :MLL ,, 21 ( ) ( ) ( ) ( ) ( ) ( ) 12212212 2 1 112 2 12 2 1 2212 2 PP Now solve the linear transformer equations for the currents: 1 212 2 22 2 1 2 1 212 2 22 12 2 2 2

Kozick, Richard J.

387

A Cavity QED Implementation of Deutsch-Jozsa Algorithm  

E-Print Network [OSTI]

The Deutsch-Jozsa algorithm is a generalization of the Deutsch algorithm which was the first algorithm written. We present schemes to implement the Deutsch algorithm and the Deutsch-Jozsa algorithm via cavity QED.

E. S. Guerra

2004-10-23T23:59:59.000Z

388

Linear multistep methods for integrating reversible differential equations  

E-Print Network [OSTI]

This paper studies multistep methods for the integration of reversible dynamical systems, with particular emphasis on the planar Kepler problem. It has previously been shown by Cano & Sanz-Serna that reversible linear multisteps for first-order differential equations are generally unstable. Here, we report on a subset of these methods -- the zero-growth methods -- that evade these instabilities. We provide an algorithm for identifying these rare methods. We find and study all zero-growth, reversible multisteps with six or fewer steps. This select group includes two well-known second-order multisteps (the trapezoidal and explicit midpoint methods), as well as three new fourth-order multisteps -- one of which is explicit. Variable timesteps can be readily implemented without spoiling the reversibility. Tests on Keplerian orbits show that these new reversible multisteps work well on orbits with low or moderate eccentricity, although at least 100 steps/radian are required for stability.

Wyn Evans; Scott Tremaine

1999-06-24T23:59:59.000Z

389

Water filtration optimization by geometric programming  

E-Print Network [OSTI]

Subject: Industrial Engineering WATER FILTRATION OPTIMIZATION BY GEOMETRIC PROGRAMMING A Thesis by DUANE JIMMY WRAY Chairman of Committee) (Head of Department) (Member) M p, ~ (Member)' December 1970 ABSTRACT Water Fi 1 trati on Optimization... Mechanisms Empirical Studies Mi ltimedia Filters GEOMETRIC PROGRAMMING Posynomial Functions . Optimizing Posynomials Constrained Optima , Degrees of Difficulty Computer Algorithm . Page 12 13 17 20 20 24 25 FILTER COST MODEL Reducing...

Wray, Duane Jimmy

1970-01-01T23:59:59.000Z

390

Mathematics programs1 teach individuals to use mathematical methods in solving problems. Students in mathematics may use  

E-Print Network [OSTI]

Mathematics programs1 teach individuals to use mathematical methods in solving problems. Students in mathematics may use mathematical theory, computational techniques, algorithms, and the latest computer. Mathematics programs fall into two classes of mathematics, applied mathematics and theoretical (pure

Lawrence, Rick L.

391

Linear Optics From Closed Orbits (LOCO): An Introduction  

SciTech Connect (OSTI)

The LOCO code is used to find and correct errors in the linear optics of storage rings. The original FORTRAN code was written to correct the optics of the NSLS X-Ray ring, and was applied soon thereafter to debug problems with the ALS optics. The ideas used in the code were developed from previous work at SLAC. Several years ago, LOCO was rewritten in MATLAB. As described in this newsletter, the MATLAB version includes a user-friendly interface, with many useful fitting and analysis options. LOCO has been used at many accelerators. Presently, a search for LOCO in the text of papers on the Joint Accelerator Conferences Website yields 107 papers. A comprehensive survey of applications will not be included here. Details of recent results at a few light sources are included in this newsletter. In the past, the quality of LOCO fitting results varied significantly, depending on the storage ring. In particular, the results were mixed for colliding beam facilities, where there tend to be fewer BPMs that in light sources. Fitting rings with less BPM data to constrain the fit optics parameters often led to unreasonably large fit quadrupole gradient variations. Recently, modifications have been made to the LOCO fitting algorithm which leads to much better results when the BPM data does not tightly constrain the fit parameters. The modifications are described in this newsletter, and an example of results with this new algorithm is included.

Safranek, James; /SLAC

2009-06-18T23:59:59.000Z

392

Counterintelligence Program  

Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

To establish the policies, procedures, and specific responsibilities for the Department of Energy (DOE) Counterintelligence (CI) Program. This directive does not cancel any other directive.

1992-09-04T23:59:59.000Z

393

Programming Stage  

Broader source: Directives, Delegations, and Requirements [Office of Management (MA)]

This chapter addresses plans for the acquisition and installation of operating environment hardware and software and design of a training program.

1997-05-21T23:59:59.000Z

394

Education Programs  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

growth of the laboratory, and deployment of mission priorities. University Partnerships & Educational Outreach (UP&EO) programs provide students, teachers, and professors'...

395

LWRS Program  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

What's New Archive Light Water Reactor Sustainability Program Accomplishments Report: 2013 An accomplishments report highlighting progress in the development of the scientific...

396

LWRS Program  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

utilities across the industry (representing 70% of the existing LWR fleet) and Electric Power Research Institute advises the program. The Utility Working Group developed a...

397

Final Report for the UNIVERSITY-BASED DETECTOR RESEARCH AND DEVELOPMENT FOR THE INTERNATIONAL LINEAR COLLIDER  

SciTech Connect (OSTI)

The U.S Linear Collider Detector R&D program, supported by the DOE and NSF umbrella grants to the University of Oregon, made significant advances on many critical aspects of the ILC detector program. Progress advanced on vertex detector sensor development, silicon and TPC tracking, calorimetry on candidate technologies, and muon detection, as well as on beamline measurements of luminosity, energy, and polarization.

Brau, James E [Univ. of Oregon] [Univ. of Oregon

2013-04-22T23:59:59.000Z

398

LINEAR COLLIDER PHYSICS RESOURCE BOOK FOR SNOWMASS 2001.  

SciTech Connect (OSTI)

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 {minus}} 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 {minus}} 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 {minus}} linear collider; in any scenario that is now discussed, physics will benefit from the new information that e{sup +}e{sup {minus}} experiments can provide.

ABE,T.; DAWSON,S.; HEINEMEYER,S.; MARCIANO,W.; PAIGE,F.; TURCOT,A.S.; ET AL

2001-05-03T23:59:59.000Z

399

Summer 2012 Mathematics 317, Linear Algebra  

E-Print Network [OSTI]

or download a .pdf version for use on a Kindle or Sony Reader or a printable .pdf version. You do not need://linear.ups.edu/xml/latest/fcla-xml-latest.xml Amazon Kindle DX format (optimized PDF): http://linear.ups.edu/download/fcla-kindleDX-2.30.pdf SONY Reader format (optimized PDF for PRS-500, PRS-505): http://linear.ups.edu/download/fcla-sony505-2.30.pdf

Long, Nicholas

400

International Workshop on Linear Colliders 2010  

ScienceCinema (OSTI)

IWLC2010 International Workshop on Linear Colliders 2010ECFA-CLIC-ILC joint meeting: Monday 18 October - Friday 22 October 2010Venue: CERN and CICG (International Conference Centre Geneva, Switzerland)This year, the International Workshop on Linear Colliders organized by the European Committee for Future Accelerators (ECFA) will study the physics, detectors and accelerator complex of a linear collider covering both CLIC and ILC options.Contact Workshop SecretariatIWLC2010 is hostedby CERN

None

2011-10-06T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


401

Algorithmic Thermodynamics John C. Baez  

E-Print Network [OSTI]

Algorithmic Thermodynamics John C. Baez Department of Mathematics, University of California in statistical mechanics. This viewpoint allows us to apply many techniques developed for use in thermodynamics and chemical potential. We derive an analogue of the fundamental thermodynamic relation dE = TdS - PdV + µd

Tomkins, Andrew

402

Adaptive protection algorithm and system  

DOE Patents [OSTI]

An adaptive protection algorithm and system for protecting electrical distribution systems traces the flow of power through a distribution system, assigns a value (or rank) to each circuit breaker in the system and then determines the appropriate trip set points based on the assigned rank.

Hedrick, Paul (Pittsburgh, PA) [Pittsburgh, PA; Toms, Helen L. (Irwin, PA) [Irwin, PA; Miller, Roger M. (Mars, PA) [Mars, PA

2009-04-28T23:59:59.000Z

403

Parallel algorithms for inductance extraction  

E-Print Network [OSTI]

. . . . . . . . . . . . . . . . . . . . . . . . . 30 3. Pin Connect . . . . . . . . . . . . . . . . . . . . . . . . . 31 C. The Inductance Extraction Algorithm . . . . . . . . . . . . . . 33 ix CHAPTER Page V COMPARISON WITH EXISTING WORK . . . . . . . . . . . . . 35 A. Ground Plane... . . . . . . . . . . . . . . . . . . . . . . . 52 1. Shared Memory Parallelization . . . . . . . . . . . . . . . 53 2. Mixed Mode Parallelization . . . . . . . . . . . . . . . . . 55 3. Distributed Memory Parallelization . . . . . . . . . . . . . 56 VII CONCLUSIONS...

Mahawar, Hemant

2007-09-17T23:59:59.000Z

404

Global Optimization in Generalized Geometric Programming  

E-Print Network [OSTI]

exchangernetwork design 5], chemical reactor design 2, 6], optimal condenser design 7], oxygen production 8Global Optimization in Generalized Geometric Programming Costas D. Maranas1 and Christodoulos A Abstract A deterministic global optimization algorithm is proposed for locating the global minimum

Maranas, Costas

405

Ultra-high vacuum photoelectron linear accelerator  

DOE Patents [OSTI]

An rf linear accelerator for producing an electron beam. The outer wall of the rf cavity of said linear accelerator being perforated to allow gas inside said rf cavity to flow to a pressure chamber surrounding said rf cavity and having means of ultra high vacuum pumping of the cathode of said rf linear accelerator. Said rf linear accelerator is used to accelerate polarized or unpolarized electrons produced by a photocathode, or to accelerate thermally heated electrons produced by a thermionic cathode, or to accelerate rf heated field emission electrons produced by a field emission cathode.

Yu, David U.L.; Luo, Yan

2013-07-16T23:59:59.000Z

406

Optimization Online - Linear equalities in blackbox optimization  

E-Print Network [OSTI]

May 28, 2014 ... ... neither in theory nor in practice. The present work proposes extensions to treat problems with linear equalities whose expression is known.

Charles Audet

2014-05-28T23:59:59.000Z

407

LED Replacements for Linear Fluorescent Lamps Webcast  

Broader source: Energy.gov [DOE]

In this June 20, 2011 webcast on LED products marketed as replacements for linear fluorescent lamps, Jason Tuenge of the Pacific Northwest National Laboratory (PNNL) discussed current Lighting...

408

Elastic Wave Behavior Across Linear Slip Interfaces  

E-Print Network [OSTI]

plane waves incident at arbitrary angles upon a plane linear slip interface are computed ... Also included in these sections is an analysis ... ish, Ut is of the form.

Schoenberg, M.

409

Optimization Online - Accelerated Linearized Bregman Method  

E-Print Network [OSTI]

Jun 27, 2011 ... Abstract: In this paper, we propose and analyze an accelerated linearized Bregman (ALB) method for solving the basis pursuit and related...

Bo Huang

2011-06-27T23:59:59.000Z

410

Linear conic optimization for nonlinear optimal control  

E-Print Network [OSTI]

Jul 7, 2014 ... 3Faculty of Electrical Engineering, Czech Technical University in Prague, ..... This linear transport equation is classical in fluid mechanics,...

2014-07-07T23:59:59.000Z

411

Subcritical Fission Reactor Based on Linear Collider  

E-Print Network [OSTI]

The beams of Linear Collider after main collision can be utilized to build an accelerator--driven sub--critical reactor.

I. F. Ginzburg

2005-07-29T23:59:59.000Z

412

Linear dependence of exponentials - Department of Mathematics ...  

E-Print Network [OSTI]

in the books of the Russian mathematician A. Leontiev. Dear Steven and Sherman,. I recently saw the problem on linear independence of exponentials.

2012-09-30T23:59:59.000Z

413

Linear PM Generator for Wave Energy Conversion.  

E-Print Network [OSTI]

??The main objective of this thesis is to design a selected version of linear PM generator and to determine the electromechanical characteristics at variable operating (more)

Parthasarathy, Rajkumar

2012-01-01T23:59:59.000Z

414

Siting the International Linear Collider at Hanford  

SciTech Connect (OSTI)

Review of the proposed International Linear Collider, applications in high energy physics, and evaluation of the Hanford Site as a possible location for siting the facilityl.

Kouzes, Richard T.; Asner, David M.; Brodzinski, Ronald L.; Fast, James E.; Miley, Harry S.

2012-03-15T23:59:59.000Z

415

Siting the International Linear Collider at Hanford  

SciTech Connect (OSTI)

Review of the proposed International Linear Collider, applications in high energy physics, and evaluation of the Hanford Site as a possible location for siting the facility.

Kouzes, Richard T.; Asner, David M.; Brodzinski, Ronald L.; Fast, James E.; Miley, Harry S.

2012-05-01T23:59:59.000Z

416

Linear Functionals in ECG and Diplomarbeit  

E-Print Network [OSTI]

Linear Functionals in ECG and VCG Diplomarbeit zur Erlangung des akademischen Grades Diplom . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.5. 12-lead ECG . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2. Heart

Münster, Westfälische Wilhelms-Universität

417

Maps for general open quantum systems and a theory of linear quantum error correction  

E-Print Network [OSTI]

We show that quantum subdynamics of an open quantum system can always be described by a Hermitian map, irrespective of the form of the initial total system state. Since the theory of quantum error correction was developed based on the assumption of completely positive (CP) maps, we present a generalized theory of linear quantum error correction, which applies to any linear map describing the open system evolution. In the physically relevant setting of Hermitian maps, we show that the CP-map based version of quantum error correction theory applies without modifications. However, we show that a more general scenario is also possible, where the recovery map is Hermitian but not CP. Since non-CP maps have non-positive matrices in their range, we provide a geometric characterization of the positivity domain of general linear maps. In particular, we show that this domain is convex, and that this implies a simple algorithm for finding its boundary.

A. Shabani; D. A. Lidar

2009-02-14T23:59:59.000Z

418

Apprentice Program Alternate Proof of the Spectral Theorem  

E-Print Network [OSTI]

Math REU Apprentice Program Alternate Proof of the Spectral Theorem Julian Hartman September 17 in the apprentice class but not in this manner. Because the Spectral Theorem is such a fundamental theorem in linear

May, J. Peter

419

15.053 Optimization Methods in Management Science, Spring 2007  

E-Print Network [OSTI]

15.053 introduces students to the theory, algorithms, and applications of optimization. Optimization methodologies include linear programming, network optimization, integer programming, decision trees, and dynamic programming. ...

Mamani, Hamed

420

Daylighting simulation: methods, algorithms, and resources  

SciTech Connect (OSTI)

This document presents work conducted as part of Subtask C, ''Daylighting Design Tools'', Subgroup C2, ''New Daylight Algorithms'', of the IEA SHC Task 21 and the ECBCS Program Annex 29 ''Daylight in Buildings''. The search for and collection of daylighting analysis methods and algorithms led to two important observations. First, there is a wide range of needs for different types of methods to produce a complete analysis tool. These include: Geometry; Light modeling; Characterization of the natural illumination resource; Materials and components properties, representations; and Usability issues (interfaces, interoperability, representation of analysis results, etc). Second, very advantageously, there have been rapid advances in many basic methods in these areas, due to other forces. They are in part driven by: The commercial computer graphics community (commerce, entertainment); The lighting industry; Architectural rendering and visualization for projects; and Academia: Course materials, research. This has led to a very rich set of information resources that have direct applicability to the small daylighting analysis community. Furthermore, much of this information is in fact available online. Because much of the information about methods and algorithms is now online, an innovative reporting strategy was used: the core formats are electronic, and used to produce a printed form only secondarily. The electronic forms include both online WWW pages and a downloadable .PDF file with the same appearance and content. Both electronic forms include live primary and indirect links to actual information sources on the WWW. In most cases, little additional commentary is provided regarding the information links or citations that are provided. This in turn allows the report to be very concise. The links are expected speak for themselves. The report consists of only about 10+ pages, with about 100+ primary links, but with potentially thousands of indirect links. For purposes of the printed version, a list of the links is explicitly provided. This document exists in HTML form at the URL address: http://eande.lbl.gov/Task21/dlalgorithms.html. An equivalent downloadable PDF version, also with live links, at the URL address: http://eande.lbl.gov/Task21/dlalgorithms.pdf. A printed report can be derived directly from either of the electronic versions by simply printing either of them. In addition to the live links in the electronic forms, all report forms, electronic and paper, also have explicitly listed link addresses so that they can be followed up or referenced manually.

Carroll, William L.

1999-12-01T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


421

Genetic Programming Based Automatic Gait Generation for Quadruped Robots  

E-Print Network [OSTI]

Descriptors I.2.9 [Artificial Intelligence]: Robotics General Terms Algorithms, Design, Performance KeywordsGenetic Programming Based Automatic Gait Generation for Quadruped Robots Kisung Seo Electronic a new approach to develop a fast gait for quadruped robot using genetic programming (GP). Several recent

Fernandez, Thomas

422

Oscillation Detection Algorithm Development Summary Report and Test Plan  

SciTech Connect (OSTI)

Small signal stability problems are one of the major threats to grid stability and reliability in California and the western U.S. power grid. An unstable oscillatory mode can cause large-amplitude oscillations and may result in system breakup and large-scale blackouts. There have been several incidents of system-wide oscillations. Of them, the most notable is the August 10, 1996 western system breakup produced as a result of undamped system-wide oscillations. There is a great need for real-time monitoring of small-signal oscillations in the system. In power systems, a small-signal oscillation is the result of poor electromechanical damping. Considerable understanding and literature have been developed on the small-signal stability problem over the past 50+ years. These studies have been mainly based on a linearized system model and eigenvalue analysis of its characteristic matrix. However, its practical feasibility is greatly limited as power system models have been found inadequate in describing real-time operating conditions. Significant efforts have been devoted to monitoring system oscillatory behaviors from real-time measurements in the past 20 years. The deployment of phasor measurement units (PMU) provides high-precision time-synchronized data needed for estimating oscillation modes. Measurement-based modal analysis, also known as ModeMeter, uses real-time phasor measure-ments to estimate system oscillation modes and their damping. Low damping indicates potential system stability issues. Oscillation alarms can be issued when the power system is lightly damped. A good oscillation alarm tool can provide time for operators to take remedial reaction and reduce the probability of a system breakup as a result of a light damping condition. Real-time oscillation monitoring requires ModeMeter algorithms to have the capability to work with various kinds of measurements: disturbance data (ringdown signals), noise probing data, and ambient data. Several measurement-based modal analysis algorithms have been developed. They include Prony analysis, Regularized Ro-bust Recursive Least Square (R3LS) algorithm, Yule-Walker algorithm, Yule-Walker Spectrum algorithm, and the N4SID algo-rithm. Each has been shown to be effective for certain situations, but not as effective for some other situations. For example, the traditional Prony analysis works well for disturbance data but not for ambient data, while Yule-Walker is designed for ambient data only. Even in an algorithm that works for both disturbance data and ambient data, such as R3LS, latency results from the time window used in the algorithm is an issue in timely estimation of oscillation modes. For ambient data, the time window needs to be longer to accumulate information for a reasonably accurate estimation; while for disturbance data, the time window can be significantly shorter so the latency in estimation can be much less. In addition, adding a known input signal such as noise probing signals can increase the knowledge of system oscillatory properties and thus improve the quality of mode estimation. System situations change over time. Disturbances can occur at any time, and probing signals can be added for a certain time period and then removed. All these observations point to the need to add intelligence to ModeMeter applications. That is, a ModeMeter needs to adaptively select different algorithms and adjust parameters for various situations. This project aims to develop systematic approaches for algorithm selection and parameter adjustment. The very first step is to detect occurrence of oscillations so the algorithm and parameters can be changed accordingly. The proposed oscillation detection approach is based on the signal-noise ratio of measurements.

Zhou, Ning; Huang, Zhenyu; Tuffner, Francis K.; Jin, Shuangshuang

2009-10-03T23:59:59.000Z

423

Time parallelization of plasma simulations using the parareal algorithm  

SciTech Connect (OSTI)

Simulation of fusion plasmas involve a broad range of timescales. In magnetically confined plasmas, such as in ITER, the timescale associated with the microturbulence responsible for transport and confinement timescales vary by an order of 10^6 10^9. Simulating this entire range of timescales is currently impossible, even on the most powerful supercomputers available. Space parallelization has so far been the most common approach to solve partial differential equations. Space parallelization alone has led to computational saturation for fluid codes, which means that the walltime for computaion does not linearly decrease with the increasing number of processors used. The application of the parareal algorithm to simulations of fusion plasmas ushers in a new avenue of parallelization, namely temporal parallelization. The algorithm has been successfully applied to plasma turbulence simulations, prior to which it has been applied to other relatively simpler problems. This work explores the extension of the applicability of the parareal algorithm to ITER relevant problems, starting with a diffusion-convection model.

Samaddar, D. [ITER Organization, Saint Paul Lez Durance, France; Houlberg, Wayne A [ORNL; Berry, Lee A [ORNL; Elwasif, Wael R [ORNL; Huysmans, G [ITER Organization, Saint Paul Lez Durance, France; Batchelor, Donald B [ORNL

2011-01-01T23:59:59.000Z

424

Hybrid and optical implementation of the Deutsch-Jozsa algorithm  

E-Print Network [OSTI]

A hybrid model of the Deutsch-Jozsa algorithm is presented, inspired by the proposals of hybrid computation by S. Lloyd and P. van Loock et. al. The model is based on two observations made about both the discrete and continuous algorithms already available. First, the Fourier transform is a single-step operation in a continuous-variable (CV) setting. Additionally, any implementation of the oracle is nontrivial in both schemes. The steps of the computation are very similar to those in the CV algorithm, with the main difference being the way in which the qunats, or quantum units of analogic information, and the qubits interact in the oracle. Using both discrete and continuous states of light, linear devices, and photo-detection, an optical implementation of the oracle is proposed. For simplicity, infinitely squeezed states are used in the continuous register, whereas the optical qubit is encoded in the dual-rail logic of the KLM protocol. The initial assumption of ideal states as qunats will be dropped to study the effects of finite squeezing in the quality of the computation.

Luis A. Garcia; Jagdish R. Luthra

2009-12-31T23:59:59.000Z

425

Algorithm for calculation of characterisitcs of thermionic electricity-generating assemblies  

SciTech Connect (OSTI)

A numerical algorithm has been developed for calculating the kinetic characteristics of electricity-generating coaxial cells and assemblies; it is based on separate solution of the equations describing the thermal and electrical processes with their subsequent coordination by way of the volt-ampere characteristics of an elementary thermionic converter by means of piecewise-linear approximation of the nonlinear characteristics at the operating points. The possibilities and advantages of the proposed calculation algorithm for investigation of the transients occurring in the course of operation of the electricity generating assemblies (EGA) are indicated. Results are reported for sample calculations of several EGA static and kinetic characteristics. 10 refs.

Babushkin, Yu.V.; Mendel'baum, M.A.; Savinov, A.P.; Sinyavskii, V.V.

1981-01-01T23:59:59.000Z

426

Optimization Online - An Approximation Algorithm for Constructing ...  

E-Print Network [OSTI]

Sep 2, 2006 ... In this paper, we propose an approximation algorithm for the 2-bit Hamming prefix code problem. Our algorithm spends $O(n \\log^3 n)$ time to...

Artur Pessoa

2006-09-02T23:59:59.000Z

427

A mathematical method for boiling water reactor control rod programming  

SciTech Connect (OSTI)

A new mathematical programming method has been developed and utilized in OPROD, an existing computer code for automatic generation of control rod programs as an alternative inner-loop routine for the method of approximate programming. The new routine is constructed of a dual feasible direction algorithm, and consists essentially of two stages of iterative optimization procedures Optimization Procedures I and II. Both follow almost the same algorithm; Optimization Procedure I searches for feasible solutions and Optimization Procedure II optimizes the objective function. Optimization theory and computer simulations have demonstrated that the new routine could find optimum solutions, even if deteriorated initial control rod patterns were given.

Tokumasu, S.; Hiranuma, H.; Ozawa, M.; Yokomi, M.

1985-12-01T23:59:59.000Z

428

NONEQUILIBRIUM LINEAR BEHAVIOR OF BIOLOGICAL SYSTEMS  

E-Print Network [OSTI]

-phosphorylation in mitochondria (2, 3), sodium transport in frog skin, toad bladder (4) and toad skin (5), and hydrogen ion transport in turtle bladder (6). Linearity has also been noted in a synthetic membrane exhibiting active transport (7). (Linearity as used in these papers and here implies the flow, J, is related to the force, A1

Stanley, H. Eugene

429

LOCAL LINEAR PID CONTROLLERS FOR NONLINEAR CONTROL  

E-Print Network [OSTI]

1 LOCAL LINEAR PID CONTROLLERS FOR NONLINEAR CONTROL Jing Lan1, Jeongho Cho1, Deniz Erdogmus2, Jos}@cnel.ufl.edu, derdogmus@ieee.org, m.a.motter@larc.nasa.gov Abstract Nonlinear PID design is difficult if one approaches modeling approach with traditional linear PID controller design techniques to arrive at a principled

Slatton, Clint

430

Architecture of an Automatic Tuned Linear Algebra  

E-Print Network [OSTI]

/01 and PI-34/00788/F5/01. #12;Hierarchical Architecture of a Self-Optimised Lineal Algebra LibraryArchitecture of an Automatic Tuned Linear Algebra Library* Javier Cuenca Domingo Giménez José .... SPt c,z Architecture of a Self-Optimised Linear Algebra Routine (SOLAR) Installation_information n1

Giménez, Domingo

431

Voltage regulation in linear induction accelerators  

DOE Patents [OSTI]

Improvement in voltage regulation in a Linear Induction Accelerator wherein a varistor, such as a metal oxide varistor, is placed in parallel with the beam accelerating cavity and the magnetic core. The non-linear properties of the varistor result in a more stable voltage across the beam accelerating cavity than with a conventional compensating resistance.

Parsons, William M. (Santa Fe, NM)

1992-01-01T23:59:59.000Z

432

Voltage regulation in linear induction accelerators  

DOE Patents [OSTI]

Improvement in voltage regulation in a linear induction accelerator wherein a varistor, such as a metal oxide varistor, is placed in parallel with the beam accelerating cavity and the magnetic core is disclosed. The non-linear properties of the varistor result in a more stable voltage across the beam accelerating cavity than with a conventional compensating resistance. 4 figs.

Parsons, W.M.

1992-12-29T23:59:59.000Z

433

Hierarchical Linear Discriminant Analysis for Beamforming  

E-Print Network [OSTI]

model of h-LDA by relating it to the two-way multivariate analysis of variance (MANOVA), which fits well dimension reduction, hierarchical linear discriminant analysis (h-LDA) to a well-known spatial localization1 Hierarchical Linear Discriminant Analysis for Beamforming Jaegul Choo , Barry L. Drake

Park, Haesun

434

Soft materials for linear electromechanical energy conversion  

E-Print Network [OSTI]

We briefly review the literature of linear electromechanical effects of soft materials, especially in synthetic and biological polymers and liquid crystals (LCs). First we describe results on direct and converse piezoelectricity, and then we discuss a linear coupling between bending and electric polarization, which maybe called bending piezoelectricity, or flexoelectricity.

Antal Jakli; Nandor Eber

2014-07-29T23:59:59.000Z

435

Best Linear Unbiased Estimate Motivation for BLUE  

E-Print Network [OSTI]

1 Chapter 6 Best Linear Unbiased Estimate (BLUE) #12;2 Motivation for BLUE Except for Linear Model to a sub-optimal estimate BLUE is one such sub-optimal estimate Idea for BLUE: 1. Restrict estimate) Advantage of BLUE:Needs only 1st and 2nd moments of PDF Mean & Covariance Disadvantages of BLUE: 1. Sub

Fowler, Mark

436

Company Name: Linear Technology Corporation Web Site: www.linear.com  

E-Print Network [OSTI]

Company Name: Linear Technology Corporation Web Site: www.linear.com Industry: Semiconductor Brief worldwide for three decades. The Company's products provide an essential bridge between our analog world

New Hampshire, University of

437

asexual genetic algorithm: Topics by E-print Network  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

for Genetic Algorithms No Author Given Andrews, Mark W. 2 A simple algorithm for optimization and model fitting: AGA (asexual genetic algorithm) CERN Preprints Summary: Context....

438

An implicit numerical algorithm general relativistic hydrodynamics  

E-Print Network [OSTI]

An implicit numerical algorithm general relativistic hydrodynamics This article has been replaced by arXiv:0801.1017

A. Hujeirat

2008-01-09T23:59:59.000Z

439

An algorithm for minimization of quantum cost  

E-Print Network [OSTI]

A new algorithm for minimization of quantum cost of quantum circuits has been designed. The quantum cost of different quantum circuits of particular interest (eg. circuits for EPR, quantum teleportation, shor code and different quantum arithmetic operations) are computed by using the proposed algorithm. The quantum costs obtained using the proposed algorithm is compared with the existing results and it is found that the algorithm has produced minimum quantum cost in all cases.

Anindita Banerjee; Anirban Pathak

2010-04-09T23:59:59.000Z

440

PARETO OPTIMA OF MULTICRITERIA INTEGER LINEAR ...  

E-Print Network [OSTI]

Jul 9, 2007 ... in the order ?R. We shall show that the algorithm only spends polynomial time between the output of wi and the output of wi+1. The key...

2007-07-10T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


441

Assumptions that imply quantum dynamics is linear  

E-Print Network [OSTI]

A basic linearity of quantum dynamics, that density matrices are mapped linearly to density matrices, is proved very simply for a system that does not interact with anything else. It is assumed that at each time the physical quantities and states are described by the usual linear structures of quantum mechanics. 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. The basic linearity is linked with previously established results to complete a simple derivation of the linear Schrodinger equation. For this it is 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.

Thomas F. Jordan

2006-01-26T23:59:59.000Z

442

Automated Architectural Exploration for Signal Processing Algorithms  

E-Print Network [OSTI]

Automated Architectural Exploration for Signal Processing Algorithms Ramsey Hourani, Ravi Jenkal, W processing algorithms. The goal of our framework is to improve hardware architectural exploration by guiding Property (IP) cores for system level signal processing algorithms. We present our view of a framework

Davis, Rhett

443

Fast algorithms for triangular Josephson junction arrays  

SciTech Connect (OSTI)

We develop fast algorithms for the numerical study of two-dimensional triangular Josephson junction arrays. The Dirac bra-ket formalism is introduced in the context of such arrays. We note that triangular arrays can have both hexagonal and rectangular periodicity and develop algorithms for each. Boundaries are next introduced and fast algorithms for finite arrays are developed. 40 refs., 4 figs.

Datta, S.; Sahdev, D. [Indian Institute of Technology, Kanpur (India)] [Indian Institute of Technology, Kanpur (India)

1997-04-01T23:59:59.000Z

444

Deutsch Algorithm on Classical Circuits  

E-Print Network [OSTI]

The well-known Deutsch Algorithm (DA) and Deutsch-Jozsha Algorithm (DJA) both are used as an evidence to the power of quantum computers over classical computation mediums. In these theoretical experiments, it has been shown that a quantum computer can find the answer with certainty within a few steps although classical electronic systems must evaluate more iterations than quantum computer. In this paper, it is shown that a classical computation system formed by using ordinary electronic parts may perform the same task with equal performance than quantum computers. DA and DJA quantum circuits act like an analog computer, so it is unfair to compare the bit of classical digital computers with the qubit of quantum computers. An analog signal carrying wire will of course carry more information that a bit carrying wire without serial communication protocols.

Osman Kaan Erol

2008-03-21T23:59:59.000Z

445

Linear Transformations In this Chapter, we will define the notion of a linear transformation between  

E-Print Network [OSTI]

Chapter 6 Linear Transformations In this Chapter, we will define the notion of a linear transformation between two vector spaces V and W which are defined over the same field and prove the most basic transformations is equivalent to matrix theory. We will also study the geometric properties of linear

Carrell, Jim

446

Solar Thermal Incentive Program  

Broader source: Energy.gov [DOE]

Note: This program is not currently accepting applications. Check the program web site for information regarding future financing programs.

447

Machinist Pipeline/Apprentice Program Program Description  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (Extended Search)

Machinist PipelineApprentice Program Program Description The Machinist Pipeline Program was created by the Prototype Fabrication Division to fill a critical need for skilled...

448

ARRA Program Summary: Energy Smart Jobs Program  

E-Print Network [OSTI]

ARRA Program Summary: Energy Smart Jobs Program Statewide Program (Initially targeting urban 30,000 buildings surveyed, approximately 5,000 will be retrofitted, yielding approximately $40

449

RERTR program  

SciTech Connect (OSTI)

The Reduced Enrichment Research and Test Reactor (RERTR) Program was established in 1978 at the Argonne National Laboratory by the U.S. Department of Energy (DOE), which continues to fund the program and to manage it in coordination with the U.S. Department of State, the Arms Control and Disarmament Agency, and the U.S. Nuclear Regulatory Commission (NRC). The primary objective of the program is to develop the technology needed to use low-enrichment uranium (LEU) instead of high-enrichment uranium (HEU) in research and test reactors, without significant penalties in experiment performance, economics, or safety. Eliminating the continuing need of HEU supplies for research and test reactors has long been an integral part of U.S. nonproliferation policy. This paper reviews the main accomplishments of the program through the years.

Travelli, A. [Argonne National Lab., IL (United States)

1997-12-01T23:59:59.000Z

450

Program TOMSCAT  

SciTech Connect (OSTI)

Program TOMSCAT is an interactive code that calculates the scattering spectrum and background for a Thomson-scattering diagnostic in typical magnetic fusion plasmas. Thomson scattering yields values of the plasma electron temperature T/sub e/ and electron density N/sub e/. This program is intended as an aid for designing Thomson-scattering systems, so all experimental parameters are input by the user. The code is operational on OCTOPUS.

Frank, A.M.

1980-05-30T23:59:59.000Z

451

SECO Programs  

E-Print Network [OSTI]

this web page address! ASSISTANCE AND FUNDING OPPORTUNITIES Energy Efficiency Technical Assistance Energy Efficiency Grants Renewable Energy Technology Grants Alternative Fuel Grants The LoanSTAR Revolving Loan Program Energy Efficiency... maximum of $50,000 per grant ? Funded on a reimbursement basis Renewable Energy Technology Grants ? Fort Worth ISD ? South Sills High School ? 5KW Wind Turbine Alternative Fuel Grants ? Grant program to convert city/county and ISD vehicle...

Trevino, E.

2011-01-01T23:59:59.000Z

452

Mathematical programming approach to tighten a Big-M formulation  

E-Print Network [OSTI]

Computational results are presented in order to show that our ... original formulation of P managing the LI by using the branches yi = 1 and zi ? 0. However, linear .... Solution Property) we have v(Pk(M0,w)) ? ?zk ? M0k. Again, if. ?. Mk = ?zk ?k ... Our algorithms have been performed on a personal computer as follows:.

2014-08-09T23:59:59.000Z

453

Reachability and Termination Analysis of Concurrent Quantum Programs  

E-Print Network [OSTI]

We introduce a Markov chain model of concurrent quantum programs. This model is a quantum generalization of Hart, Sharir and Pnueli's probabilistic concurrent programs. Some characterizations of the reachable space, uniformly repeatedly reachable space and termination of a concurrent quantum program are derived by the analysis of their mathematical structures. Based on these characterizations, algorithms for computing the reachable space and uniformly repeatedly reachable space and for deciding the termination are given.

Nengkun Yu; Mingsheng Ying

2012-06-09T23:59:59.000Z

454

algorithms  

Office of Scientific and Technical Information (OSTI)

AFDC Printable Version Share this resource Send a link to EERE: Alternative Fuels Data Center Home Page to someone by E-mail Share EERE: Alternative Fuels Data Center Home Page on Facebook Tweet about EERE: Alternative Fuels Data Center Home Page on Twitter Bookmark EERE:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May Jun Jul(Summary)morphinanInformation InInformation In closing, an National Carbon Capture Center at2/316 PhotovoltaicCapORNL

455

Approximation Algorithms for Covering Problems  

E-Print Network [OSTI]

?-approximation for general CIP with {0, 1} variables [24].details of an extension to CIP with general upper bounds onCovering Integer Programs ( CIP ). Given a non-negative cost

Koufogiannakis, Christos

2009-01-01T23:59:59.000Z

456

Optimization Online - All Areas Submissions - April 2008  

E-Print Network [OSTI]

... Algorithm for the Degree-Constrained Minimum Spanning Tree Problem ... Iterative Estimation Maximization for Stochastic Linear and Convex Programs with...

457

Optimization Online Digest -- April 2008  

E-Print Network [OSTI]

Iterative Estimation Maximization for Stochastic Linear and Convex Programs with ... Algorithm for the Degree-Constrained Minimum Spanning Tree Problem

458

Electronic nose with a new feature reduction method and a multi-linear classifier for Chinese liquor classification  

SciTech Connect (OSTI)

An electronic nose (e-nose) was designed to classify Chinese liquors of the same aroma style. A new method of feature reduction which combined feature selection with feature extraction was proposed. Feature selection method used 8 feature-selection algorithms based on information theory and reduced the dimension of the feature space to 41. Kernel entropy component analysis was introduced into the e-nose system as a feature extraction method and the dimension of feature space was reduced to 12. Classification of Chinese liquors was performed by using back propagation artificial neural network (BP-ANN), linear discrimination analysis (LDA), and a multi-linear classifier. The classification rate of the multi-linear classifier was 97.22%, which was higher than LDA and BP-ANN. Finally the classification of Chinese liquors according to their raw materials and geographical origins was performed using the proposed multi-linear classifier and classification rate was 98.75% and 100%, respectively.

Jing, Yaqi; Meng, Qinghao, E-mail: qh-meng@tju.edu.cn; Qi, Peifeng; Zeng, Ming; Li, Wei; Ma, Shugen [Tianjin Key Laboratory of Process Measurement and Control, Institute of Robotics and Autonomous Systems, School of Electrical Engineering and Automation, Tianjin University, Tianjin 300072 (China)] [Tianjin Key Laboratory of Process Measurement and Control, Institute of Robotics and Autonomous Systems, School of Electrical Engineering and Automation, Tianjin University, Tianjin 300072 (China)

2014-05-15T23:59:59.000Z

459

Blind MD-MC Component Separation for Polarized Observations of the CMB with the EM Algorithm  

E-Print Network [OSTI]

We present the PolEMICA [Aumont & Macias-Perez 2007] (Polarized Expectation-Maximization Independent Component Analysis) algorithm which is an extension to polarization of the SMICA [Delabrouille et al. 2003] temperature component separation method. This algorithm allows us to estimate blindly in harmonic space multiple physical components from multi-detectors polarized sky maps. Assuming a linear noisy mixture of components we are able to reconstruct jointly the electromagnetic spectra of the components for each mode T, E and B, as well as the temperature and polarization spatial power spectra, TT, EE, BB, TE, TB and EB for each of the physical components and for the noise on each of the detectors. This has been tested using full sky simulations of the Planck satellite polarized channels for a 14-months nominal mission assuming a simple linear sky model including CMB, and optionally Galactic synchrotron and dust emissions.

J. Aumont

2007-03-12T23:59:59.000Z

460

Distributed Approaches for Determination of Reconfiguration Algorithm Termination  

E-Print Network [OSTI]

Distributed Approaches for Determination of Reconfiguration Algorithm Termination Pinak Tulpule architecture was used as globally shared memory structure for detection of algorithm termination. This paper of algorithm termination. Keywords--autonomous agent-based reconfiguration, dis- tributed algorithms, shipboard

Lai, Hong-jian

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


461

Knapsack Problems with Sigmoid Utilities: Approximation Algorithms via Hybrid Optimization$  

E-Print Network [OSTI]

Knapsack Problems with Sigmoid Utilities: Approximation Algorithms via Hybrid Optimization$ Vaibhav with sigmoid utilities. We merge approximation algorithms from discrete optimization with algorithms from continuous optimization to develop approximation algorithms for these NP-hard problems with sigmoid utilities

Bullo, Francesco

462

Linear phase distribution of acoustical vortices  

SciTech Connect (OSTI)

Linear phase distribution of phase-coded acoustical vortices was theoretically investigated based on the radiation theory of point source, and then confirmed by experimental measurements. With the proposed criterion of positive phase slope, the possibility of constructing linear circular phase distributions is demonstrated to be determined by source parameters. Improved phase linearity can be achieved at larger source number, lower frequency, smaller vortex radius, and/or longer axial distance. Good agreements are observed between numerical simulations and measurement results for circular phase distributions. The favorable results confirm the feasibility of precise phase control for acoustical vortices and suggest potential applications in particle manipulation.

Gao, Lu; Zheng, Haixiang [Key Laboratory of Optoelectronics of Jiangsu Province, School of Physics Science and Technology, Nanjing Normal University, 1 Wenyuan Road, Xianlin District, Nanjing 210023 (China); Ma, Qingyu, E-mail: maqingyu@njnu.edu.cn [Key Laboratory of Optoelectronics of Jiangsu Province, School of Physics Science and Technology, Nanjing Normal University, 1 Wenyuan Road, Xianlin District, Nanjing 210023 (China); Laboratory of Modern Acoustics of MOE, Nanjing University, Nanjing 210093 (China); Tu, Juan; Zhang, Dong [Laboratory of Modern Acoustics of MOE, Nanjing University, Nanjing 210093 (China)

2014-07-14T23:59:59.000Z

463

Optically isolated signal coupler with linear response  

DOE Patents [OSTI]

An optocoupler for isolating electrical signals that translates an electrical input signal linearly to an electrical output signal. The optocoupler comprises a light emitter, a light receiver, and a light transmitting medium. The light emitter, preferably a blue, silicon carbide LED, is of the type that provides linear, electro-optical conversion of electrical signals within a narrow wavelength range. Correspondingly, the light receiver, which converts light signals to electrical signals and is preferably a cadmium sulfide photoconductor, is linearly responsive to light signals within substantially the same wavelength range as the blue LED.

Kronberg, James W. (Aiken, SC)

1994-01-01T23:59:59.000Z

464

Microgenetic optimization algorithm for optimal wavefront shaping  

E-Print Network [OSTI]

One of the main limitations of utilizing optimal wavefront shaping in imaging and authentication applications is the slow speed of the optimization algorithms currently being used. To address this problem we develop a micro-genetic optimization algorithm ($\\mu$GA) for optimal wavefront shaping. We test the abilities of the $\\mu$GA and make comparisons to previous algorithms (iterative and simple-genetic) by using each algorithm to optimize transmission through an opaque medium. From our experiments we find that the $\\mu$GA is faster than both the iterative and simple-genetic algorithms and that both genetic algorithms are more resistant to noise and sample decoherence than the iterative algorithm.

Anderson, Benjamin R; Gunawidjaja, Ray; Eilers, Hergen

2015-01-01T23:59:59.000Z

465

Optimization Online - Optimal steepest descent algorithms for ...  

E-Print Network [OSTI]

Aug 7, 2008 ... ... is supported by the Mathematical Programming Society and by the Optimization Technology Center. Mathematical Programming Society.

Cl vis Caesar Gonzaga

2008-08-07T23:59:59.000Z

466

ECS 122B: Algorithm Design and Analysis Handout ?? UC Davis --Charles Martel Jan. 4, 2010  

E-Print Network [OSTI]

ECS 122B: Algorithm Design and Analysis Handout ?? UC Davis -- Charles Martel Jan. 4, 2010 Problem for some future topics of program verification and testing. Real assignments will come soon. Problem 1), and a target integer t. Your function should return "-1" if t is is not in A, and the position

California at Davis, University of

467

Numerical Analysis of Three-Dimensional Frequency-Selective Structures Using the Multilevel Fast Multipole Algorithm  

E-Print Network [OSTI]

Multipole Algorithm ?zgür Ergül1,2 and Levent Gürel1,2 1 Department of Electrical and Electronics was supported by the Turkish Academy of Sciences in the framework of the Young Scientist Award Program (LG

Gürel, Levent

468

The Design, Implementation, and Evaluation of a Compiler Algorithm for CPU Energy Reduction  

E-Print Network [OSTI]

. Physical measurements on a highperformance laptop show that total system (i.e., laptop) energy savings, with a performance slowdown of 2%. It was also discovered that the energy usage of the programs using our DVSThe Design, Implementation, and Evaluation of a Compiler Algorithm for CPU Energy Reduction Chung

Kremer, Ulrich

469

Maximum Utility Product Pricing Models and Algorithms Based on Reservation Prices  

E-Print Network [OSTI]

Maximum Utility Product Pricing Models and Algorithms Based on Reservation Prices R. Shioda L. Tun for pricing a product line with several customer segments under the assumption that customers' product choices utility model and formulate it as a mixed-integer programming problem, design heuristics and valid cuts

Tunçel, Levent

470

ECS 122B: Algorithm Design and Analysis Handout ?? UC Davis ---Charles Martel May. 2001  

E-Print Network [OSTI]

ECS 122B: Algorithm Design and Analysis Handout ?? UC Davis --- Charles Martel May. 2001 SampleL layers in GL . (20) 2. After students graduate from Medical school they are assigned to hospitals. Each, but it illustrates a kind of question I might ask). (20) 3. In the select program for assignment 1 the main

California at Davis, University of

471

Optimization Strategy apply to an Attribute Algorithm for the Abstract Interpretation  

E-Print Network [OSTI]

Cedex FRANCE e-mail: musumbu@labri.fr Abstract Presented in this work is a novel approach to implement of the transformation and that fixed point is the abstract semantics of the given logic program. Presented in this workOptimization Strategy apply to an Attribute Algorithm for the Abstract Interpretation Kaninda

Paris-Sud XI, Université de

472

Algorithms for Categorizing Multiprocessor Communication Under Invalidate and UpdateBased Coherence Protocols \\Lambda  

E-Print Network [OSTI]

of useless traffic entailed by each coherence protocol. Under an invalidatebased protocol, our algorithms and Technology---HighPerformance Computing, Software Science and Tech nology program, ARPA Order no. 8930 to intro duce useless communication due to a mismatch between the hardware unit of coherence and the data

Bianchini, Ricardo

473

A Practical Access to the Theory of Parallel Algorithms Christoph Kessler  

E-Print Network [OSTI]

: FundamentalsofParallelProcessing. Prentice Hall, 2003. Keller, Kessler, Tr¨aff: Practical PRAM ProgrammingA Practical Access to the Theory of Parallel Algorithms Christoph Kessler Department of Computer, USA, March 6, 2004 SIGCSE'04 Norfolk 6 March 2004 -- A practical access to the theory of parallel

Kessler, Christoph

474

Call for Papers 9th Annual European Symposium on Algorithms ESA 2001  

E-Print Network [OSTI]

Call for Papers 9th Annual European Symposium on Algorithms ­ ESA 2001 BRICS, University of Aarhus Simultaneous submission to other conferences with published proceedings is not allowed with the only exception submissions to other conferences with published proceedings is not allowed. Program Committee Friedhelm Meyer

Brodal, Gerth Stølting

475

Call for Papers 9th Annual European Symposium on Algorithms --ESA 2001  

E-Print Network [OSTI]

Call for Papers 9th Annual European Symposium on Algorithms -- ESA 2001 BRICS, University of Aarhus Simultaneous submission to other conferences with published proceedings is not allowed with the only exception submissions to other conferences with published proceedings is not allowed. Program Committee Friedhelm Meyer

Brodal, Gerth Stølting

476

Hardware Verification using ANSI-C Programs as a Reference Edmund Clarke Daniel Kroening  

E-Print Network [OSTI]

Hardware Verification using ANSI-C Programs as a Reference£ Edmund Clarke Daniel Kroening Computer an algorithm to verify a hardware design given in Verilog using an ANSI-C program as a specification. We use in a language like ANSI-C. This program is then used for extensive testing and debugging, in particular of any

Clarke, Edmund M.

477

Advanced Techniques for the Creation and Propagation of Modules in Cartesian Genetic Programming  

E-Print Network [OSTI]

Algorithms, Design, Experimentation, Performance Keywords Cartesian genetic programming (CGP), embeddedAdvanced Techniques for the Creation and Propagation of Modules in Cartesian Genetic Programming. One of the most popular models is cartesian genetic programming, which encodes an array of logic gates

Fernandez, Thomas

478

Globally Solving Nonconvex Quadratic Programming Problems via ...  

E-Print Network [OSTI]

Mar 7, 2011 ... Contract DE-AC02-06CH11357. ... Department of Management Sciences, University of Iowa, Iowa City, .... F?. At the root node, the authors set F(b?Ax) = F? = ?. ..... the increased size of the relaxations causes overall larger B&B times. ... 4Clp Coin-Or Linear Programming. http://projects.coin-or.org/Clp/,...

2011-08-15T23:59:59.000Z

479

Support graph preconditioners for sparse linear systems  

E-Print Network [OSTI]

Elliptic partial differential equations that are used to model physical phenomena give rise to large sparse linear systems. Such systems can be symmetric positive de?nite and can be solved by the preconditioned conjugate gradients method...

Gupta, Radhika

2005-02-17T23:59:59.000Z

480

Photon emission within the linear sigma model  

E-Print Network [OSTI]

Soft-photon emission rates are calculated within the linear sigma model. The investigation is aimed at answering the question to which extent the emissivities map out the phase structure of this particular effective model of strongly interacting matter.

F. Wunderlich; B. Kampfer

2014-12-22T23:59:59.000Z

Note: This page contains sample records for the topic "linear programming algorithm" from the National Library of EnergyBeta (NLEBeta).
While these samples are representative of the content of NLEBeta,
they are not comprehensive nor are they the most current set.
We encourage you to perform a real-time search of NLEBeta
to obtain the most current and comprehensive results.


481

Linear Thermodynamics of Rodlike DNA Filtration  

E-Print Network [OSTI]

Linear thermodynamics transportation theory is employed to study filtration of rodlike DNA molecules. Using the repeated nanoarray consisting of alternate deep and shallow regions, it is demonstrated that the complex ...

Li, Zirui

482

18.06 Linear Algebra, Spring 2005  

E-Print Network [OSTI]

This is a basic subject on matrix theory and linear algebra. Emphasis is given to topics that will be useful in other disciplines, including systems of equations, vector spaces, determinants, eigenvalues, similarity, and ...

Strang, Gilbert

483

The Computational Complexity of Linear Optics  

E-Print Network [OSTI]

We give new evidence that quantum computers---moreover, rudimentary quantum computers built entirely out of linear-optical elements---cannot be efficiently simulated by classical computers. In particular, we define a model ...

Aaronson, Scott

2011-01-01T23:59:59.000Z

484

CANCER PROGRAM ANNUAL REPORT CANCER PROGRAM  

E-Print Network [OSTI]

CANCER PROGRAM ANNUAL REPORT CANCER PROGRAM 2010 ANNUAL REPORT WITH STATISTICAL DATA FROM 2009 UNIVERSITY OF ILLINOIS MEDICAL CENTER #12;2 CANCER PROGRAM ANNUAL REPORT 2 #12;3 CANCER PROGRAM ANNUAL REPORT 3 UIMC CANCER PROGRAM CHANGING MULTIDISCIPLINARY CARE. FOR GOOD. #12;4 CANCER PROGRAM ANNUAL REPORT

Illinois at Chicago, University of

485

Zeros in linear multivariable control systems  

E-Print Network [OSTI]

ZEROS IN LINEAR MULTIVARIABLE CONTROL SYSTEMS A Thesis by ROBERT FENNELL EWING Submitted to the Graduate College of Texas A8M University in partial fulfillment of the requirement for the degree of MASTER OF SCIENCE August 1974 Major... Control Systems (August 1974) Robert Fennell Ewing, B. S. , Texas A&M University Chairman of Advisory Committee: Dr. J. W. Howze This thesis examines the problem of altering the transfer function matrix of a linear, time-invariant, multivariable system...

Ewing, Robert Fennell

1974-01-01T23:59:59.000Z

486

A High-Order Finite-Volume Algorithm for Fokker-Planck Collisions in Magnetized Plasmas  

SciTech Connect (OSTI)

A high-order finite volume algorithm is developed for the Fokker-Planck Operator (FPO) describing Coulomb collisions in strongly magnetized plasmas. The algorithm is based on a general fourth-order reconstruction scheme for an unstructured grid in the velocity space spanned by parallel velocity and magnetic moment. The method provides density conservation and high-order-accurate evaluation of the FPO independent of the choice of the velocity coordinates. As an example, a linearized FPO in constant-of-motion coordinates, i.e. the total energy and the magnetic moment, is developed using the present algorithm combined with a cut-cell merging procedure. Numerical tests include the Spitzer thermalization problem and the return to isotropy for distributions initialized with velocity space loss cones. Utilization of the method for a nonlinear FPO is straightforward but requires evaluation of the Rosenbluth potentials.

Xiong, Z; Cohen, R H; Rognlien, T D; Xu, X Q

2007-04-18T23:59:59.000Z

487

Span Programs for Functions with Constant-Sized 1-certificates  

E-Print Network [OSTI]

Besides the Hidden Subgroup Problem, the second large class of quantum speed-ups is for functions with constant-sized 1-certificates. This includes the OR function, solvable by the Grover algorithm, the distinctness, the triangle and other problems. The usual way to solve them is by quantum walk on the Johnson graph. We propose a solution for the same problems using span programs. The span program is a computational model equivalent to the quantum query algorithm in its strength, and yet very different in its outfit. We prove the power of our approach by designing a quantum algorithm for the triangle problem with query complexity $O(n^{35/27})$ that is better than $O(n^{13/10})$ of the best previously known algorithm by Magniez et al.

Aleksandrs Belovs

2011-05-20T23:59:59.000Z

488

Lectures on Linear Algebra over Division Ring  

E-Print Network [OSTI]

In this book i treat linear algebra over division ring. A system of linear equations over a division ring has properties similar to properties of a system of linear equations over a field. However, noncommutativity of a product creates a new picture. Matrices allow two products linked by transpose. Biring is algebra which defines on the set two correlated structures of the ring. As in the commutative case, solutions of a system of linear equations build up right or left vector space depending on type of system. We study vector spaces together with the system of linear equations because their properties have a close relationship. As in a commutative case, the group of automorphisms of a vector space has a single transitive representation on a frame manifold. This gives us an opportunity to introduce passive and active representations. Studying a vector space over a division ring uncovers new details in the relationship between passive and active transformations, makes this picture clearer. Considering of twin representations of division ring in Abelian group leads to the concept of D vector space and their linear map. Based on polyadditive map I considered definition of tensor product of rings and tensor product of D vector spaces.

Aleks Kleyn

2014-10-11T23:59:59.000Z

489

Euclid Programming  

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:1 First Use of Energy for All Purposes (Fuel and Nonfuel),Feet) Year Jan Feb Mar Apr May JunDatastreamsmmcrcalgovInstrumentsruc DocumentationP-Series toESnet4:Epitaxial Thin Film XRD EpitaxialProgramming Programming

490

STEP Program Benchmark Report  

Broader source: Energy.gov [DOE]

STEP Program Benchmark Report, from the Tool Kit Framework: Small Town University Energy Program (STEP).

491

Lineal: A linear-algebraic -calculus Pablo Arrighia,1  

E-Print Network [OSTI]

Lineal: A linear-algebraic -calculus Pablo Arrighia,1 , Gilles Dowekc aUniversit´e de Grenoble, together with linear algebra. We see this Linear-algebraic -calculus (also referred to as Lineal for short and linear algebra. This language extends the -calculus with the possibility to make arbitrary linear

Dowek, Gilles

492

Lineal: A linear-algebraic -calculus Pablo Arrighia,1  

E-Print Network [OSTI]

Lineal: A linear-algebraic -calculus Pablo Arrighia,1 , Gilles Dowekc aUniversite de Grenoble, together with linear algebra. We see this Linear-algebraic -calculus (also referred to as Lineal for short and linear algebra. This language extends the -calculus with the possibility to make arbitrary linear

Paris-Sud XI, Universit de

493

Algorithmic randomness, physical entropy, measurements, and the second law  

SciTech Connect (OSTI)

Algorithmic information content is equal to the size -- in the number of bits -- of the shortest program for a universal Turing machine which can reproduce a state of a physical system. In contrast to the statistical Boltzmann-Gibbs-Shannon entropy, which measures ignorance, the algorithmic information content is a measure of the available information. It is defined without a recourse to probabilities and can be regarded as a measure of randomness of a definite microstate. I suggest that the physical entropy S -- that is, the quantity which determines the amount of the work {Delta}W which can be extracted in the cyclic isothermal expansion process through the equation {Delta}W = k{sub B}T{Delta}S -- is a sum of two contributions: the mission information measured by the usual statistical entropy and the known randomness measured by the algorithmic information content. The sum of these two contributions is a constant of motion'' in the process of a dissipation less measurement on an equilibrium ensemble. This conservation under a measurement, which can be traced back to the noiseless coding theorem of Shannon, is necessary to rule out existence of a successful Maxwell's demon. 17 refs., 3 figs.

Zurek, W.H.

1989-01-01T23:59:59.000Z

494

RESEARCHCONTRIBUTIONS Programming  

E-Print Network [OSTI]

RESEARCHCONTRIBUTIONS Programming Techniques and Data Structures Min-Max Heaps and Ian Munro Editor Generalized Priority Queues M. D. ATKINSON,J.-R. SACK,N. SANTORO,and T. STROTHOTTE ABSTRACT: ,4 simple implementation of double- endedpriority queues is presented. The proposed structure, called a min-max heap, can

Atkinson, Mike

495

Quantum random-walk search algorithm  

SciTech Connect (OSTI)

Quantum random walks on graphs have been shown to display many interesting properties, including exponentially fast hitting times when compared with their classical counterparts. However, it is still unclear how to use these novel properties to gain an algorithmic speedup over classical algorithms. In this paper, we present a quantum search algorithm based on the quantum random-walk architecture that provides such a speedup. It will be shown that this algorithm performs an oracle search on a database of N items with O({radical}(N)) calls to the oracle, yielding a speedup similar to other quantum search algorithms. It appears that the quantum random-walk formulation has considerable flexibility, presenting interesting opportunities for development of other, possibly novel quantum algorithms.

Shenvi, Neil; Whaley, K. Birgitta [Department of Chemistry, University of California, Berkeley, California 94720 (United States); Kempe, Julia [Department of Chemistry, University of California, Berkeley, California 94720 (United States); Computer Science Division, EECS, University of California, Berkeley, California 94720 (United States); CNRS-LRI, UMR 8623, Universite de Paris-Sud, 91405 Orsay (France)

2003-05-01T23:59:59.000Z

496

Gravitational Lens Modeling with Genetic Algorithms and Particle Swarm Optimizers  

E-Print Network [OSTI]

Strong gravitational lensing of an extended object is described by a mapping from source to image coordinates that is nonlinear and cannot generally be inverted analytically. Determining the structure of the source intensity distribution also requires a description of the blurring effect due to a point spread function. This initial study uses an iterative gravitational lens modeling scheme based on the semilinear method to determine the linear parameters (source intensity profile) of a strongly lensed system. Our 'matrix-free' approach avoids construction of the lens and blurring operators while retaining the least squares formulation of the problem. The parameters of an analytical lens model are found through nonlinear optimization by an advanced genetic algorithm (GA) and particle swarm optimizer (PSO). These global optimization routines are designed to explore the parameter space thoroughly, mapping model degeneracies in detail. We develop a novel method that determines the L-curve for each solution automa...

Rogers, Adam

2011-01-01T23:59:59.000Z

497

SHALE: An Efficient Algorithm for Allocation of Guaranteed Display Advertising  

E-Print Network [OSTI]

Motivated by the problem of optimizing allocation in guaranteed display advertising, we develop an efficient, lightweight method of generating a compact {\\em allocation plan} that can be used to guide ad server decisions. The plan itself uses just O(1) state per guaranteed contract, is robust to noise, and allows us to serve (provably) nearly optimally. The optimization method we develop is scalable, with a small in-memory footprint, and working in linear time per iteration. It is also "stop-anytime", meaning that time-critical applications can stop early and still get a good serving solution. Thus, it is particularly useful for optimizing the large problems arising in the context of display advertising. We demonstrate the effectiveness of our algorithm using actual Yahoo! data.

Bharadwaj, Vijay; Ma, Wenjing; Nagarajan, Chandrashekhar; Tomlin, John; Vassilvitskii, Sergei; Vee, Erik; Yang, Jian

2012-01-01T23:59:59.000Z

498

Reliability and Maintainability Issues for the Next Linear Collider  

SciTech Connect (OSTI)

Large accelerators for high energy physics research traditionally have been designed using informal best design, engineering, and management practices to achieve acceptable levels of operational availability. However, the Next Linear Collider(NLC) project presents a particular challenge for operational availability due to the unprecedented size and complexity of the accelerator systems required to achieve the physics goals of high center-of-mass energy and high luminosity. Formal reliability and maintainability analysis, design, and implementation will be required to achieve acceptable operational availability for the high energy physics research program. This paper introduces some of the basic concepts of reliability analysis and applies them to the 2.6-cm microwave power system of the two 10-km-long, 250-GeV linacs that are currently proposed for the NLC design.

Wilson, Zane J.; Gold, Saul L.; Koontz, Ron F.; Lavine, Ted L.; /SLAC

2011-08-26T23:59:59.000Z

499

Algorithm for a microfluidic assembly line  

E-Print Network [OSTI]

Microfluidic technology has revolutionized the control of flows at small scales giving rise to new possibilities for assembling complex structures on the microscale. We analyze different possible algorithms for assembling arbitrary structures, and demonstrate that a sequential assembly algorithm can manufacture arbitrary 3D structures from identical constituents. We illustrate the algorithm by showing that a modified Hele-Shaw cell with 7 controlled flowrates can be designed to construct the entire English alphabet from particles that irreversibly stick to each other.

Tobias M. Schneider; Shreyas Mandre; Michael P. Brenner

2011-01-19T23:59:59.000Z

500

This book is designed to be a comprehensive treatment of parallel al gorithms for optimal control of large scale linear and bilinear systems.  

E-Print Network [OSTI]

tion column, steam power system, hydro power plant, chemical plants, gas absorber, supported beam the power and usefulness of the synchronous parallel algorithms for optimal control of large scale linearPreface This book is designed to be a comprehensive treatment of parallel al gorithms for optimal

Gajic, Zoran