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)

Jul 5, 2013 ... Abstract: We propose a polynomial algorithm for linear programming. The algorithm represents a linear optimization or decision problem in the ...

2

A polynomial projection algorithm for linear programming  

E-Print Network (OSTI)

a linear optimization or decision problem in the form of a system of linear ... we understand the number of arithmetic and the other elementary operations ..... where M is a diagonal matrix whose entries on the main diagonal are non-

3

A Globally Convergent Sequential Linear Programming Algorithm ...  

E-Print Network (OSTI)

approach, and a piecewise sequential quadratic programming approach (PSQP). Fukushima, Luo and Pang [20] proposed a sequential quadratic programming, ...

4

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

E-Print Network (OSTI)

LINEAR-PROGRAMMING DESIGN AND ANALYSIS OF FAST ALGORITHMS FOR MAX 2-CSP ALEXANDER D. SCOTT AND GREGORY B. SORKIN Abstract. The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint(G) (13/75 + o(1))m, which gives a faster Max 2-CSP algorithm that uses exponential space: running in time

Scott, Alexander Alexander

5

A Potential Reduction Algorithm With User-Specified Phase I - Phase II Balance, for Solving a Linear Program from an Infeasible Warm Start  

E-Print Network (OSTI)

This paper develops a potential reduction algorithm for solving a linear-programming problem directly from a "warm start" initial point that is neither feasible nor optimal. The algorithm is of an "interior point" variety ...

Freund, Robert M.

6

Solving linear program as linear system in polynomial time  

Science Conference Proceedings (OSTI)

A physically concise polynomial-time iterative-cum-non-iterative algorithm is presented to solve the linear program (LP) Minc^txsubject toAx=b,x>=0. The iterative part-a variation of Karmarkar projective transformation algorithm-is essentially due to ... Keywords: Barnes algorithm, Error-free computation, Linear program, Linear system, Matlab program, Polynomial-time iterative-cum-non-iterative algorithm

Syamal K. Sen; Suja Ramakrishnan; Ravi P. Agarwal

2011-03-01T23:59:59.000Z

7

Fun with sub-linear time algorithms  

Science Conference Proceedings (OSTI)

Provided that one is willing to use randomness and to tolerate an approximate answer, many computational problems admit ultrafast algorithms that run in less than linear time in the length of the input. In many interesting cases, even algorithms that ...

Luca Trevisan

2007-06-01T23:59:59.000Z

8

Improved Linear Programming Decoding using Frustrated Cycles  

E-Print Network (OSTI)

We consider transmission over a binary-input additive white Gaussian noise channel using low-density parity-check codes. One of the most popular techniques for decoding low-density parity-check codes is the linear programming decoder. In general, the linear programming decoder is suboptimal. I.e., the word error rate is higher than the optimal, maximum a posteriori decoder. In this paper we present a systematic approach to enhance the linear program decoder. More precisely, in the cases where the linear program outputs a fractional solution, we give a simple algorithm to identify frustrated cycles which cause the output of the linear program to be fractional. Then adding these cycles, adaptively to the basic linear program, we show improved word error rate performance.

Kudekar, Shrinivas; Chertkov, Misha

2011-01-01T23:59:59.000Z

9

EOF-Based Linear Prediction Algorithm: Theory  

Science Conference Proceedings (OSTI)

This study considers the theory of a general three-dimensional (space and time) statistical prediction/extrapolation algorithm. The predictor is in the form of a linear data filter. The prediction kernel is based on the minimization of prediction ...

Kwang-Y. Kim; Gerald R. North

1998-11-01T23:59:59.000Z

10

Inverse Stochastic Linear Programming  

E-Print Network (OSTI)

the objective is to schedule the production so as to deviate, in each period, as little ..... We leave the exploration of the decomposition algorithms for future work.

11

New geometric techniques for linear programming and graph partitioning  

E-Print Network (OSTI)

In this thesis, we advance a collection of new geometric techniques for the analysis of combinatorial algorithms. Using these techniques, we resolve several longstanding questions in the theory of linear programming, ...

Kelner, Jonathan, 1980-

2006-01-01T23:59:59.000Z

12

A multiple divide-and-conquer (MDC) algorithm for optimal alignments in linear space  

Science Conference Proceedings (OSTI)

Dynamic programming algorithms are often used to find the similarities of sequences as well as to deliver the actual alignment of two sequences. Two kinds of alignments are used to compare sequences: local alignments and global alignments. The local alignments attempt to locate conserved regions, while the global alignments identify overall relationship between two sequences. While dynamic programming algorithms are relatively time consuming, the space required is often the limiting factor when aligning long sequences. A linear space algorithm for computing maximal common subsequences, proposed by Hirschberg, was applied by Myers and Miller to deliver optimal alignments in linear space. The authors have improved the Myers and Miller algorithm by introducing a multiple divide and conquer technique that reduces the algorithm`s running time while maintaining its linear space property. Efficient sequence alignment algorithms have been an active topic in computational biology.

Guan, X.; Uberbacher, E.C.

1994-06-01T23:59:59.000Z

13

A parallel descent algorithm for convex programming  

Science Conference Proceedings (OSTI)

Keywords: convex programming, decomposition, descent method, parallel algorithm, trust region method

Masao Fukushima; Mounir Haddou; Van Hien Nguyen; Jean-Jacques Strodiot; Takanobu Sugimoto; Eiki Yamakawa

1996-01-01T23:59:59.000Z

14

A NONSTANDARD SIMPLEX ALGORITHM FOR LINEAR ...  

E-Print Network (OSTI)

standard simplex algorithm. 2. Pivoting operations. In the next section, we describe column and row pivot- ing operations. This topic is closely related to the  ...

15

An Adaptive Linear Approximation Algorithm for Copositive ...  

E-Print Network (OSTI)

linear algebra literature (a good survey is [1]), but the optimization community has only recently .... relations v ? 0 and M ? 0 will be understood entrywise.

16

On the modulus algorithm for the linear complementarity problem  

Science Conference Proceedings (OSTI)

Concerning three subclasses of P-matrices the modulus algorithm and the projected successive overrelaxation (PSOR) method solving the linear complementarity problem are compared to each other with respect to convergence. It is shown that the modulus ... Keywords: H-matrix, Linear complementarity problem, P-matrix, PSOR method

Uwe SchäFer

2004-07-01T23:59:59.000Z

17

Scenario Formulation of Stochastic Linear Programs and the Homogeneous Self-Dual Interior-Point Method  

Science Conference Proceedings (OSTI)

We consider a homogeneous self-dual interior-point algorithm for solving multistage stochastic linear programs. The algorithm is particularly suitable for the so-called “scenario formulation” of the problem, whose constraint system consists ... Keywords: decomposition, interior-point methods, multistage stochastic linear programs

Jie Sun; Xinwei Liu

2006-01-01T23:59:59.000Z

18

Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference  

Science Conference Proceedings (OSTI)

Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new advances in phylogeny inference will be required if we are to be able to continue ... Keywords: Computational Biology, Algorithms, Integer Linear Programming, Steiner tree problem, Phylogenetic tree reconstruction, Maximum parsimony

Srinath Sridhar; Fumei Lam; Guy E. Blelloch; R. Ravi; Russell Schwartz

2008-07-01T23:59:59.000Z

19

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

20

Linear Logical Algorithms Robert J. Simmons and Frank Pfenning  

E-Print Network (OSTI)

will formally define a program P as a series of rules. Each rule has one or more atomic propositions A0 of abstract running time, reasoning about the complexity of algorithms requires understanding the intricacies The pure bottom-up logic programming language introduced in the previous section is built from atomic

Andrews, Peter B.

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

The Next Linear Collider Program  

NLE Websites -- All DOE Office Websites (Extended Search)

To use the left side navigation on this page, you will need to turn on To use the left side navigation on this page, you will need to turn on Javascript. You do not need JavaScript to use the text-based navigation bar at the bottom of the page. The Next Linear Collider at SLAC Navbar MISSION: Scientists expect research at this facility to answer fundamental questions about the behavior of matter and the origins of the Universe. NLC 8-Pack on the Drawing Board What's New In the Next Linear Collider: • NLC Newsletter October, 2001 • NLC Snowmass report 2001 • NLC All Hands Talk, August 2001 Upcoming Events: • Fall 2001 Working Sessions, Oct. 22-23, 2001 • Pulse Compression Workshop, Oct. 22-24, 2001 • Machine Advisory Committee Mtg., Oct. 24-26, 2001 • ISG-7 at KEK, Nov. 12-15, 2001 • LC' 02 at SLAC, Feb. 4-8, 2002 NLC Website Search: Entire SLAC Web | Help |

22

APPLICATION OF NEURAL NETWORK ALGORITHMS FOR BPM LINEARIZATION  

Science Conference Proceedings (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

23

Finding all solutions of separable systems of piecewise-linear equations using integer programming  

Science Conference Proceedings (OSTI)

Finding all solutions of nonlinear or piecewise-linear equations is an important problem which is widely encountered in science and engineering. Various algorithms have been proposed for this problem. However, the implementation of these algorithms are ... Keywords: 65H10, 65H20, 65K05, Finding all solutions, Integer programming, Piecewise-linear equations

Kiyotaka Yamamura; Naoya Tamura

2012-05-01T23:59:59.000Z

24

A fast algorithm for the linear canonical transform  

E-Print Network (OSTI)

In recent years there has been a renewed interest in finding fast algorithms to compute accurately the linear canonical transform (LCT) of a given function. This is driven by the large number of applications of the LCT in optics and signal processing. The well-known integral transforms: Fourier, fractional Fourier, bilateral Laplace and Fresnel transforms are special cases of the LCT. In this paper we obtain an O(N*Log N) algorithm to compute the LCT by using a chirp-FFT-chirp transformation yielded by a convergent quadrature formula for the fractional Fourier transform. This formula gives a unitary discrete LCT in closed form. In the case of the fractional Fourier transform the algorithm computes this transform for arbitrary complex values inside the unitary circle and not only at the boundary. In the case of the ordinary Fourier transform the algorithm improves the output of the FFT.

Campos, Rafael G

2009-01-01T23:59:59.000Z

25

Decomposition Algorithms for Stochastic Programming on a Computational Grid  

Science Conference Proceedings (OSTI)

We describe algorithms for two-stage stochastic linear programming with recourse and their implementation on a grid computing platform. In particular, we examine serial and asynchronous versions of the L-shaped method and a trust-region method. The parallel ...

Jeff Linderoth; Stephen Wright

2003-02-01T23:59:59.000Z

26

DUAL FACE ALGORITHM FOR LINEAR PROGRAMMING 1 ...  

E-Print Network (OSTI)

rection, the associated line search, and operations of a dual face contraction. Section ..... (ii) An index chosen to enter the nonface index set in an expansion iteration ... of B and ˜B, the kth row of B+ can be represented in terms of h (= 0), that is,.

27

Planning under uncertainty solving large-scale stochastic linear programs  

Science Conference Proceedings (OSTI)

For many practical problems, solutions obtained from deterministic models are unsatisfactory because they fail to hedge against certain contingencies that may occur in the future. Stochastic models address this shortcoming, but up to recently seemed to be intractable due to their size. Recent advances both in solution algorithms and in computer technology now allow us to solve important and general classes of practical stochastic problems. We show how large-scale stochastic linear programs can be efficiently solved by combining classical decomposition and Monte Carlo (importance) sampling techniques. We discuss the methodology for solving two-stage stochastic linear programs with recourse, present numerical results of large problems with numerous stochastic parameters, show how to efficiently implement the methodology on a parallel multi-computer and derive the theory for solving a general class of multi-stage problems with dependency of the stochastic parameters within a stage and between different stages.

Infanger, G. (Stanford Univ., CA (United States). Dept. of Operations Research Technische Univ., Vienna (Austria). Inst. fuer Energiewirtschaft)

1992-12-01T23:59:59.000Z

28

A simple, combinatorial algorithm for solving SDD systems in nearly-linear time  

E-Print Network (OSTI)

In this paper, we present a simple combinatorial algorithm that solves symmetric diagonally dominant (SDD) linear systems in nearly-linear time. It uses little of the machinery that previously appeared to be necessary for ...

Orecchia, Lorenzo

29

Dynamic task scheduling for linear algebra algorithms on distributed-memory multicore systems  

Science Conference Proceedings (OSTI)

This paper presents a dynamic task scheduling approach to executing dense linear algebra algorithms on multicore systems (either shared-memory or distributed-memory). We use a task-based library to replace the existing linear algebra subroutines such ...

Fengguang Song; Asim YarKhan; Jack Dongarra

2009-11-01T23:59:59.000Z

30

Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming  

Science Conference Proceedings (OSTI)

In this paper we present a primal-dual inexact infeasible interior-point algorithm for semidefinite programming problems (SDP). This algorithm allows the use of search directions that are calculated from the defining linear system with only moderate ... Keywords: inexact search direction, infeasible interior point method, polynomial complexity, primal-dual

Guanglu Zhou; Kim-Chuan Toh

2004-03-01T23:59:59.000Z

31

Neural data fusion algorithms based on a linearly constrained least square method  

Science Conference Proceedings (OSTI)

Two novel neural data fusion algorithms based on a linearly constrained least square (LCLS) method are proposed. While the LCLS method is used to minimize the energy of the linearly fused information, two neural-network algorithms are developed to overcome ...

Youshen Xia; H. Leung; E. Bosse

2002-03-01T23:59:59.000Z

32

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

E-Print Network (OSTI)

linear transformation M ? Rn×n in the second-order cone linear comple- ..... does not require extra storage except for the vector y(k) and several scalars. This.

33

Optimal approximation of linear systems using Taguchi-sliding-based differential evolution algorithm  

Science Conference Proceedings (OSTI)

A Taguchi-sliding-based differential evolution algorithm (TSBDEA) is proposed in this study to solve the problem of optimally approximating linear systems. The TSBDEA is an approach of combining the differential evolution algorithm (DEA) with the Taguchi-sliding-level-method ... Keywords: Differential evolution algorithm, Model reduction, Taguchi sliding level method

Jinn-Tsong Tsai; Wen-Hsien Ho; Jyh-Horng Chou; Ching-Yi Guo

2011-03-01T23:59:59.000Z

34

Linear-scaling and parallelizable algorithms for stochastic quantum chemistry  

E-Print Network (OSTI)

For many decades, quantum chemical method development has been dominated by algorithms which involve increasingly complex series of tensor contractions over one-electron orbital spaces. Procedures for their derivation and implementation have evolved to require the minimum amount of logic and rely heavily on computationally efficient library-based matrix algebra and optimized paging schemes. In this regard, the recent development of exact stochastic quantum chemical algorithms to reduce computational scaling and memory overhead requires a contrasting algorithmic philosophy, but one which when implemented efficiently can often achieve higher accuracy/cost ratios with small random errors. Additionally, they can exploit the continuing trend for massive parallelization which hinders the progress of deterministic high-level quantum chemical algorithms. In the Quantum Monte Carlo community, stochastic algorithms are ubiquitous but the discrete Fock space of quantum chemical methods is often unfamiliar, and the metho...

Booth, George H; Alavi, Ali

2013-01-01T23:59:59.000Z

35

Nonconvergence of the plain Newton-min algorithm for linear ...  

E-Print Network (OSTI)

Apr 7, 2010 ... accounts on the use of interior point methods to solve linear ...... mineral precipitation-dissolution reactions by a semismooth Newton method.

36

Algorithms for Sparse Linear Classifiers in the Massive Data Setting  

Science Conference Proceedings (OSTI)

Classifiers favoring sparse solutions, such as support vector machines, relevance vector machines, LASSO-regression based classifiers, etc., provide competitive methods for classification problems in high dimensions. However, current algorithms for training ...

Suhrid Balakrishnan; David Madigan

2008-06-01T23:59:59.000Z

37

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

SciTech Connect

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

Algorithms for Solving Linear Systems over Cyclotomic Fields - CECM  

E-Print Network (OSTI)

See http://www.cecm.sfu.ca/CAG/code/VahidsSystems.zip. [4] J. D. Dixon. Exact solution of linear equations using p?adic expansions. Numer. Math. 40 pp.

39

Algorithms for Solving Linear Systems over Cyclotomic Fields - CECM  

E-Print Network (OSTI)

See http://www.cecm.sfu.ca/CAG/code/VahidsSystems.zip. [5] J. D. Dixon. Exact solution of linear equations using p?adic expansions. Numer. Math. 40 pp.

40

Performance analysis of Non Linear Filtering Algorithms for underwater images  

E-Print Network (OSTI)

Image filtering algorithms are applied on images to remove the different types of noise that are either present in the image during capturing or injected in to the image during transmission. Underwater images when captured usually have Gaussian noise, speckle noise and salt and pepper noise. In this work, five different image filtering algorithms are compared for the three different noise types. The performances of the filters are compared using the Peak Signal to Noise Ratio (PSNR) and Mean Square Error (MSE). The modified spatial median filter gives desirable results in terms of the above two parameters for the three different noise. Forty underwater images are taken for study.

Padmavathi, Dr G; Kumar, Mr M Muthu; Thakur, Suresh Kumar

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


41

A new evolutionary algorithm for non-linear economic dispatch  

Science Conference Proceedings (OSTI)

Reduce fossil fuel resources; increasing established new power generation unit costs; and ever growing demand for electric energy necessitate optimal economic dispatch (ED) in today's electric power systems. Modern heuristic optimization techniques have ... Keywords: Chaotic Modified Shuffled Frog Leaping Algorithm, Economic dispatch, Nonlinear optimization

Taher Niknam; Bahman Bahmani Firouzi; Hasan Doagou Mojarrad

2011-09-01T23:59:59.000Z

42

The Slater condition is generic in linear conic programming  

E-Print Network (OSTI)

Nov 9, 2012 ... †University of Groningen, Johann Bernoulli Institute for Mathematics and ..... Strict complementarity is fundamental for this algorithm, since regularity of the .... of semidefinite programming, 29–65, Handbook of Semidefinite.

43

Duality for Mixed-Integer Linear Programs  

E-Print Network (OSTI)

constraints in (1), with the integer variables (those required to take on integer ... programming, but does not integrate easily with current computational practice.

44

Semidefinite Programming versus the Reformulation-Linearization ...  

E-Print Network (OSTI)

102 (2005), 559-575. [17] H. Wolkowicz, R. Saigal and L. Vandenberghe, eds, Handbook of Semidefinite Programming,. Kluwer, 2000. [18] Y. Ye, Approximating ...

45

Program and Algorithm Visualization in Engineering and Physics  

Science Conference Proceedings (OSTI)

We report here on our experiences using a program animation tool, the Teaching Machine, for program and algorithm visualization for engineering and physics students at two universities: Memorial University, where it has been used since 1999 for teaching ...

Michael Bruce-Lockhart; Theodore S. Norvell; Yiannis Cotronis

2007-07-01T23:59:59.000Z

46

Profilio Selection Using the Adelais Multiobjective Linear Programming System  

Science Conference Proceedings (OSTI)

The ADELAIS (Aide à la DEcision pour systèmes Linéaires multicritères par AIde à la Structuration des préférences), multiobjective linear programming system is proposed as a decision tool for the selection ... Keywords: ADELAIS, portfolio analysis, portfolio selection

C. Zopounidis; D. K. Despotis; I. Kamaratou

1998-06-01T23:59:59.000Z

47

The Equivalence of Linear Programs and Zero-Sum Games  

E-Print Network (OSTI)

he noted that there was one case in which the reduction does not work. This also led .... linear program does not exist. ...... In: Handbook of game theory with eco-.

48

MIXED ZERO-ONE LINEAR PROGRAMS UNDER OBJECTIVE ...  

E-Print Network (OSTI)

One of the fundamental problems in mixed 0-1 linear programs under ... of Mathematics, Faculty of Science, National University of Singapore. ...... [2] M. O. Ball, C. J. Colbourn and J. S. Provan (1995) Network reliability, Handbook in Operations.

49

Online trajectory planning for UAVs using mixed integer linear programming  

E-Print Network (OSTI)

This thesis presents a improved path planner using mixed-integer linear programming (MILP) to solve a receding horizon optimization problem for unmanned aerial vehicles (UAV's). Using MILP, hard constraints for obstacle ...

Culligan, Kieran Forbes

2006-01-01T23:59:59.000Z

50

A Nonlinear Programming Algorithm for Solving Semidefinite ...  

E-Print Network (OSTI)

Mar 9, 2001 ... The following fundamental proposition (whose proof can be found for ...... As stated in Section 3, the augmented Lagrangian algorithm does not have ...... In R. Saigal, L. Vandenberghe, and H. Wolkowicz, editors, Handbook of ...

51

Explicit/multi-parametric model predictive control (MPC) of linear discrete-time systems by dynamic and multi-parametric programming  

Science Conference Proceedings (OSTI)

This work presents a new algorithm for solving the explicit/multi-parametric model predictive control (or mp-MPC) problem for linear, time-invariant discrete-time systems, based on dynamic programming and multi-parametric programming techniques. The ... Keywords: Dynamic programming, Explicit Model Predictive Control, Model Predictive Control, Multi-parametric control, Multi-parametric programming

K. I. Kouramas; N. P. Faísca; C. Panos; E. N. Pistikopoulos

2011-08-01T23:59:59.000Z

52

Maximum a posteriori based kernel classifier trained by linear programming  

Science Conference Proceedings (OSTI)

We propose a new approach for classification problem based on the maximum a posteriori (MAP) estimation. The necessary and sufficient condition for the cost function to estimate a posteriori probability was obtained. It was clarified by the condition ... Keywords: cost function, kernel function, linear programming, maximum a posteriori

Nopriadi Nopriadi; Yukihiko Yamashita

2010-08-01T23:59:59.000Z

53

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

SciTech Connect

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

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

2011-02-24T23:59:59.000Z

54

An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming  

Science Conference Proceedings (OSTI)

We study the problem of reconstructing haplotype configurations from genotypes on pedigree data with missing alleles under the Mendelian law of inheritance and the minimum recombination principle, which is important for the construction of haplotype ... Keywords: branch-and-bound algorithm, haplotyping, integer linear programming, missing data imputation, pedigree analysis, recombination

Jing Li; Tao Jiang

2004-03-01T23:59:59.000Z

55

On the Convergence of Successive Linear Programming Algorithms  

E-Print Network (OSTI)

Apr 23, 2003... and CCR-0219438, and by Department of Energy grant DE-FG02- .... Set dC k = ?kdLP k . 2b. Compute dk so that dk. ? ?k and qk(dk) ? qk( ...

56

A Dynamic Near-Optimal Algorithm for Online Linear Programming  

E-Print Network (OSTI)

PRIXDELACROISSANCEVERTENUMERIQUE PRIX DE LA CROISSANCE VERTE NUMERIQUE 2011 Smart-DR® Actility propose une technologie SmartGrid France. En cas de pic, l'usine est ralentie en lieu et place, contre rémunération. Notre offre SmartGrid

Ye, Yinyu

57

A non-iterative polynomial algorithm for linear programming  

E-Print Network (OSTI)

Jun 26, 2013 ... Citation: Reliance M. & E. Engineering Co. Ltd, F19-T2 Xihuan Plaza, 1 Xiwai St, Xicheng District, Beijing, China. June 2013. Download: [PDF].

58

FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment  

Science Conference Proceedings (OSTI)

Sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length m and n, full-matrix (FM), dynamic programming alignment algorithms such as Needleman-Wunsch and Smith-Waterman take O(m × ...

Adrian Driga; Paul Lu; Jonathan Schaeffer; Duane Szafron; Kevin Charter; Ian Parsons

2006-07-01T23:59:59.000Z

59

6.854J / 18.415J Advanced Algorithms, Fall 2001  

E-Print Network (OSTI)

A first-year graduate course in algorithms. Emphasizes fundamental algorithms and advanced methods of algorithmic design, analysis, and implementation. Data structures. Network flows. Linear programming. Computational ...

Goemans, Michel

60

Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming  

Science Conference Proceedings (OSTI)

This paper aims at solving a nonconvex mixed integer nonlinear programming (MINLP) model used to solve a refinery crude-oil operations scheduling problem. The model is mostly linear but contains bilinear products of continuous variables in the objective ...

Sylvain Mouret; Ignacio E. Grossmann; Pierre Pestiaux

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


61

An approximation algorithm for convex multi-objective programming problems  

Science Conference Proceedings (OSTI)

In multi-objective convex optimization it is necessary to compute an infinite set of nondominated points. We propose a method for approximating the nondominated set of a multi-objective nonlinear programming problem, where the objective functions and ... Keywords: ?-nondominated point, Approximation algorithm, Convex optimization, Multi-objective optimization

Matthias Ehrgott; Lizhen Shao; Anita Schöbel

2011-07-01T23:59:59.000Z

62

SIMPLEX, a code for the solution of linear programming problems  

SciTech Connect

A set of procedures is described for solution of a general linear programming problem that seeks to maximize the linear functional W =/sup n/ $Sigma$/sub j = 1/ c/sub j/x/ sub j/ for coordinates x/sub j/ greater than or equal to 0, subject to m restrictions of the form/sup n/$Sigma$/sub j = 1/ a/sub ij/x/sub j/ less than or equal to b/sub i/ and l restrictions of the form/sup n/ $Sigma$/sub j = 1/ a/sub ij/x/sub j/ = b/sub i/. An LRLTRAN computer code, which performs the maximization, has been developed to follow these procedures and is also described. Illustration of the use of the simplex procedure is given. (auth)

Walker, H.; Hall, L.S.

1975-06-01T23:59:59.000Z

63

A New Decomposition Technique in Solving Multistage Stochastic Linear Programs by Infeasible Interior Point Methods  

Science Conference Proceedings (OSTI)

Multistage stochastic linear programming (MSLP) is a powerful tool for making decisions under uncertainty. A deterministic equivalent problem of MSLP is a large-scale linear program with nonanticipativity constraints. Recently developed infeasible interior ... Keywords: Decomposition, Infeasible primal-dual interior point method, Scenario analysis, Stochastic linear programs

Xinwei Liu; Jie Sun

2004-02-01T23:59:59.000Z

64

Concept for an Algorithm Testing and Evaluation Program at ...  

Science Conference Proceedings (OSTI)

... the same data sets using the ATS's reference algorithms. ... The geometric fitting reference algorithms are incorporated within the ATS. ...

2012-10-09T23:59:59.000Z

65

Waste management under multiple complexities: Inexact piecewise-linearization-based fuzzy flexible programming  

SciTech Connect

Highlights: Black-Right-Pointing-Pointer Inexact piecewise-linearization-based fuzzy flexible programming is proposed. Black-Right-Pointing-Pointer It's the first application to waste management under multiple complexities. Black-Right-Pointing-Pointer It tackles nonlinear economies-of-scale effects in interval-parameter constraints. Black-Right-Pointing-Pointer It estimates costs more accurately than the linear-regression-based model. Black-Right-Pointing-Pointer Uncertainties are decreased and more satisfactory interval solutions are obtained. - Abstract: To tackle nonlinear economies-of-scale (EOS) effects in interval-parameter constraints for a representative waste management problem, an inexact piecewise-linearization-based fuzzy flexible programming (IPFP) model is developed. In IPFP, interval parameters for waste amounts and transportation/operation costs can be quantified; aspiration levels for net system costs, as well as tolerance intervals for both capacities of waste treatment facilities and waste generation rates can be reflected; and the nonlinear EOS effects transformed from objective function to constraints can be approximated. An interactive algorithm is proposed for solving the IPFP model, which in nature is an interval-parameter mixed-integer quadratically constrained programming model. To demonstrate the IPFP's advantages, two alternative models are developed to compare their performances. One is a conventional linear-regression-based inexact fuzzy programming model (IPFP2) and the other is an IPFP model with all right-hand-sides of fussy constraints being the corresponding interval numbers (IPFP3). The comparison results between IPFP and IPFP2 indicate that the optimized waste amounts would have the similar patterns in both models. However, when dealing with EOS effects in constraints, the IPFP2 may underestimate the net system costs while the IPFP can estimate the costs more accurately. The comparison results between IPFP and IPFP3 indicate that their solutions would be significantly different. The decreased system uncertainties in IPFP's solutions demonstrate its effectiveness for providing more satisfactory interval solutions than IPFP3. Following its first application to waste management, the IPFP can be potentially applied to other environmental problems under multiple complexities.

Sun Wei [Faculty of Engineering and Applied Science, University of Regina, Regina, Saskatchewan, S4S 0A2 (Canada); Huang, Guo H., E-mail: huang@iseis.org [Institute for Energy, Environment and Sustainability Research, UR-NCEPU, North China Electric Power University, Beijing 102206 (China); Institute for Energy, Environment and Sustainable Communities, University of Regina, Regina, Saskatchewan, S4S 0A2 (Canada); Lv Ying; Li Gongchen [Faculty of Engineering and Applied Science, University of Regina, Regina, Saskatchewan, S4S 0A2 (Canada)

2012-06-15T23:59:59.000Z

66

Accessibility of Analysis of Algorithms: from programming to problem solving  

Science Conference Proceedings (OSTI)

In Introduction to Analysis of Algorithms, students' first experience applying a combination of computer science theory and mathematics to paper-based problem solving, analysis of pre-developed algorithms, and proofs of algorithmic run-times. ...

Karina V Assiter

2005-12-01T23:59:59.000Z

67

Global optimization algorithms for semi-infinite and generalized semi-infinite programs  

E-Print Network (OSTI)

The goals of this thesis are the development of global optimization algorithms for semi-infinite and generalized semi-infinite programs and the application of these algorithms to kinetic model reduction. The outstanding ...

Lemonidis, Panayiotis

2008-01-01T23:59:59.000Z

68

Dynamic programming for constrained optimal control of discrete-time linear hybrid systems  

Science Conference Proceedings (OSTI)

In this paper we study the solution to optimal control problems for constrained discrete-time linear hybrid systems based on quadratic or linear performance criteria. The aim of the paper is twofold. First, we give basic theoretical results on the structure ... Keywords: Dynamic programming, Hybrid systems, Multiparametric programming, Optimal control, Piecewise affine systems

Francesco Borrelli; Mato Baoti?; Alberto Bemporad; Manfred Morari

2005-10-01T23:59:59.000Z

69

Designing AC power grids using integer linear programming  

Science Conference Proceedings (OSTI)

Recent developments have drawn focus towards the efficient calculation of flows in AC power grids, which are difficult to solve systems of nonlinear equations. The common linearization approach leads to the well known and often used DC formulation, which ...

Arie M. C. A. Koster; Stephan Lemkens

2011-06-01T23:59:59.000Z

70

A mixed-integer linear optimization model for local energy system planning based on simplex and branch-and-bound algorithms  

Science Conference Proceedings (OSTI)

A Mixed-integer linear optimization model is developed to support the decision making for the sustainable use of energy in the local area. It details exploitation of primary energy sources, electrical and thermal generation, enduse sectors and emissions. ... Keywords: branch-and-bound algorithm, local energy system, low-carbon society, mixed-integer linear optimization, simplex algorithm

Hongbo Ren; Weisheng Zhou; Weijun Gao; Qiong Wu

2010-09-01T23:59:59.000Z

71

Approximate forward-backward algorithm for a switching linear Gaussian model  

Science Conference Proceedings (OSTI)

A hidden Markov model with two hidden layers is considered. The bottom layer is a Markov chain and given this the variables in the second hidden layer are assumed conditionally independent and Gaussian distributed. The observation process is Gaussian ... Keywords: Approximation, Forward-backward algorithm, Hidden Markov model, Metropolis-Hastings algorithm, Seismic inversion

Hugo Hammer; Håkon Tjelmeland

2011-01-01T23:59:59.000Z

72

Steam Generator Management Program: Evaluation of Steam Generator Eddy Current Analysis Algorithms  

Science Conference Proceedings (OSTI)

As part of the U.S. Nuclear Regulatory Commissions (NRCs) International Steam Generator Tube Integrity Program, Argonne National Laboratory (ANL) evaluated algorithms for computer-aided analysis of rotating probe eddy current data. The algorithms were designed for both flaw detection and flaw sizing. Rotating probe data collected on the flawed tubes in the NRCs steam generator (SG) mockup were used to document performance of the algorithms for both detection and sizing. In the NRC program, the results of...

2011-06-30T23:59:59.000Z

73

On-Off Minimum-Time Control With Limited Fuel Usage: Global Optima Via Linear Programming  

SciTech Connect

A method for finding a global optimum to the on-off minimum-time control problem with limited fuel usage is presented. Each control can take on only three possible values: maximum, zero, or minimum. The simplex method for linear systems naturally yields such a solution for the re-formulation presented herein because it always produces an extreme point solution to the linear program. Numerical examples for the benchmark linear flexible system are presented.

DRIESSEN,BRIAN

1999-09-01T23:59:59.000Z

74

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

E-Print Network (OSTI)

theory and solution methods for various types of fractional programs. ... many industries including airlines, energy, manufacturing and telecommunications. .... model is used by hospital administrators in the State of Texas to decide on relative ... matrix. The i th deterministic constraint for (2.2) is obtained from [7-11] as. ?. = n.

75

Short communication: Application of symmetric fuzzy linear programming in life cycle assessment  

Science Conference Proceedings (OSTI)

Life cycle assessment (LCA) is known to entail multiple objective decision-making in the analysis of tradeoffs between different environmental impacts. The work of Azapagic and Clift in the late 1990s illustrates the use of multiple objective linear ... Keywords: Fuzzy linear programming, Life cycle assessment

Raymond R. Tan

2005-10-01T23:59:59.000Z

76

The Effect of Process Topology and Load Balancing on Parallel Programming Models for SMP Clusters and Iterative Algorithms  

Science Conference Proceedings (OSTI)

This article focuses on the effect of both process topology and load balancing on various programming models for SMP clusters and iterative algorithms. More specifically, we consider nested loop algorithms with constant flow dependencies, that can be ... Keywords: MPI, OpenMP, SMP clusters, high performance computing, hybrid programming, iterative algorithms, parallel programming, tiling

Nikolaos Drosinos; Nectarios Koziris

2006-01-01T23:59:59.000Z

77

Steam Generator Management Program: Evaluation of Eddy Current Data Analysis Algorithms  

Science Conference Proceedings (OSTI)

As part of the U.S. Nuclear Regulatory Commission’s (NRC’s) International Steam Generator Tube Integrity Program, Argonne National Laboratory (ANL) was contracted to develop algorithms to assist in the analysis of rotating probe eddy current data. The algorithms were designed for both flaw detection and sizing. Rotating probe data collected on the flawed tubes in the NRC’s steam generator (SG) mockup were used to document the performance of the algorithms for both detection and ...

2012-09-28T23:59:59.000Z

78

Information flow metrics analysis in object oriented programming and metrics validation process by RAA algorithm  

Science Conference Proceedings (OSTI)

Transparent data flow metrics and control flow metrics had no main concern which to be handled by a compiler. Nowadays similar hardware and multithreaded coding is increased. Consequently, both data flow and control flow become more important in analyses ... Keywords: Ant colony algorithm, Information flow metrics, Object oriented information flow, Object oriented programming, Rule accuracy algorithm, Rule induction

Abdul Jabbar; Subramani Sarala

2012-12-01T23:59:59.000Z

79

Wireless Sensor Node Placement Using Hybrid Genetic Programming and Genetic Algorithms  

Science Conference Proceedings (OSTI)

The ease of use and re-configuration in a wireless network has played a key role in their widespread growth. The node deployment problem deals with an optimal placement strategy of the wireless nodes. This paper models a wireless sensor network, consisting ... Keywords: Genetic Algorithms, Genetic Programming, Hierarchical Genetic Algorithms, Node Deployment, Wireless Sensor Networks Optimization

Arpit Tripathi; Pulkit Gupta; Aditya Trivedi; Rahul Kala

2011-04-01T23:59:59.000Z

80

Algorithm 741: least-squares solution of a linear, bordered, block-diagonal system of equations  

Science Conference Proceedings (OSTI)

A package of Fortran subroutines is presented for the least-squares solution of a system of overdetermined, full-rank, linear equations with single-bordered block-diagonal structure. This structure allows for a natural sequential processing, one block ... Keywords: bordered block-diagonal equations, least-squares solutions, sparse systems

Richard D. Ray

1995-03-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

An algorithm for the estimation of a regression function by continuous piecewise linear functions  

Science Conference Proceedings (OSTI)

The problem of the estimation of a regression function by continuous piecewise linear functions is formulated as a nonconvex, nonsmooth optimization problem. Estimates are defined by minimization of the empirical L 2 risk over a ... Keywords: Nonparametric regression, Nonsmooth optimization, Semismooth functions, Subdifferential

Adil Bagirov; Conny Clausen; Michael Kohler

2010-01-01T23:59:59.000Z

82

Evolutionary algorithms for compiler-enabled program autotuning  

E-Print Network (OSTI)

PetaBricks [4, 21, 7, 3, 5] is an implicitly parallel programming language which, through the process of autotuning, can automatically optimize programs for fast QoS-aware execution on any hardware. In this thesis we develop ...

Pacula, Maciej

2011-01-01T23:59:59.000Z

83

Process industry scheduling optimization using genetic algorithm and mathematical programming  

Science Conference Proceedings (OSTI)

This article addresses the problem of scheduling in oil refineries. The problem consists of a multi-product plant scheduling, with two serial machine stages--a mixer and a set of tanks--which have resource constraints and operate on a continuous flow ... Keywords: Genetic algorithm, MILP, Refining, Scheduling

F. Oliveira; S. Hamacher; M. R. Almeida

2011-10-01T23:59:59.000Z

84

Convergence Analysis of DC Algorithm for DC programming with ...  

E-Print Network (OSTI)

programs to which it gave almost always global solutions and proved to be more robust ... In this paper, we consider DC programming with subanalytic data. .... open ball with the center x ? Rn and radius ? > 0 is denoted by B(x, ?); while the unit ... and C ? Rn is a nonempty convex set, we can equivalently transform it into a.

85

A O(1/?2)n-time sieving algorithm for approximate integer programming  

Science Conference Proceedings (OSTI)

The Integer Programming Problem (IP) for a polytope P??n is to find an integer point in P or decide that P is integer free. We give a randomized algorithm for an approximate version of this problem, ... Keywords: closest vector problem, integer programming, shortest vector problem

Daniel Dadush

2012-04-01T23:59:59.000Z

86

SUTIL - Network selection based on utility function and integer linear programming  

Science Conference Proceedings (OSTI)

This work presents SUTIL, a mechanism for network selection in the context of next generation networks (NGN). SUTIL selection mechanism prioritizes networks with higher relevance to the application and lower energy consumption and it enables full and ... Keywords: Integer linear programming, Mobility management, Network selection, Seamless connectivity, Utility function, Wireless networks

Luci Pirmez; Jaime C. Carvalho, Jr.; Flávia C. Delicato; Fábio Protti; Luiz F. R. C. Carmo; Paulo F. Pires; Marcos Pirmez

2010-09-01T23:59:59.000Z

87

Power-aware linear programming based scheduling for heterogeneous computer clusters  

Science Conference Proceedings (OSTI)

In the past few years, scheduling for computer clusters has become a hot topic. The main focus has been towards achieving better performance. It is true that this goal has been attained to a certain extent, but on the other hand, it has been at the expense ... Keywords: Grid computing, Heterogeneous computing systems, Linear programming, Power-aware scheduling

Hadil Al-Daoud; Issam Al-Azzoni; Douglas G. Down

2012-05-01T23:59:59.000Z

88

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

SciTech Connect

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

Moryakov, A. V., E-mail: sailor@yauza.ru [National Research Centre Kurchatov Institute (Russian Federation)

2012-12-15T23:59:59.000Z

89

On the equivalence of linear complementarity problems  

Science Conference Proceedings (OSTI)

We show that the Extended Linear Complementarity Problem (ELCP) can be recast as a standard Linear Complementarity Problem (LCP) provided that the surplus variables or the feasible set of the ELCP are bounded. Since many extensions of the LCP are special ... Keywords: Complementarity problems, Integer programming, Linear complementarity problem, Nonlinear algorithms, Optimization

B. De Schutter; W. P. M. H. Heemels; A. Bemporad

2002-08-01T23:59:59.000Z

90

Incorporating music into the study of algorithms and computer programming  

Science Conference Proceedings (OSTI)

According to the national syllabus set forth by the Ministry of Education, Culture, Sports, Science and Technology, or hence force MEXT for short, and implemented in senior high schools since the school year of 2003--2004 in Japan, every student is expected ... Keywords: K-12 instruction, compiler / programming languages & paradigms

Takeo Tatsumi; Yoshiaki Nakano; Kiyoshi Tajitsu; Haruhiko Okumura; Yasunari Harada

2009-11-01T23:59:59.000Z

91

Algorithms for the ZIP-Code Program Lebron Stinson  

E-Print Network (OSTI)

, Information, and Computational Sciences Division, Office of Advanced Scientific Computing Research, U Alliance in Math and Science Engineering Science and Technology Mentored by Therese Stovall http the RAMS 2004 students. The Research Alliance in Math and Science program is sponsored by the Mathematical

92

Development of an interval-valued fuzzy linear-programming method based on infinite ?-cuts for water resources management  

Science Conference Proceedings (OSTI)

An interval-valued fuzzy linear-programming (IVFL) method based on infinite @a-cuts is developed for water resources management in this study. The introduction of interval parameters and interval-valued fuzzy parameters into the objective function and ... Keywords: Agricultural irrigation, Fuzzy linear-programming, Infinite ?-cuts, Interval, Uncertainty, Water resources

H. W. Lu; G. H. Huang; L. He

2010-03-01T23:59:59.000Z

93

Annular precision linear shaped charge flight termination system for the ODES program  

SciTech Connect

The work for the development of an Annular Precision Linear Shaped Charge (APLSC) Flight Termination System (FTS) for the Operation and Deployment Experiment Simulator (ODES) program is discussed and presented in this report. The Precision Linear Shaped Charge (PLSC) concept was recently developed at Sandia. The APLSC component is designed to produce a copper jet to cut four inch diameter holes in each of two spherical tanks, one containing fuel and the other an oxidizer that are hyperbolic when mixed, to terminate the ODES vehicle flight if necessary. The FTS includes two detonators, six Mild Detonating Fuse (MDF) transfer lines, a detonator block, detonation transfer manifold, and the APLSC component. PLSCs have previously been designed in ring components where the jet penetrating axis is either directly away or toward the center of the ring assembly. Typically, these PLSC components are designed to cut metal cylinders from the outside inward or from the inside outward. The ODES program requires an annular linear shaped charge. The (Linear Shaped Charge Analysis) LESCA code was used to design this 65 grain/foot APLSC and data comparing the analytically predicted to experimental data are presented. Jet penetration data are presented to assess the maximum depth and reproducibility of the penetration. Data are presented for full scale tests, including all FTS components, and conducted with nominal 19 inch diameter, spherical tanks.

Vigil, M.G.; Marchi, D.L.

1994-06-01T23:59:59.000Z

94

Computer processing of mass-spectral data. Part III. Assignment of formulas to experimental masses. Algorithms and structures of programs DBG, FZM, and FZMIN  

Science Conference Proceedings (OSTI)

A computer method for the assignment of formulas to experimental masses has been developed. Programs FZM, DBG and FZMIN are the main programs controlling the procedures for processing the exprerimental masses. The main purpose of this document is to describe the development of these programs and the associated alborithms. Program FZM assigns formulas to the experimental masses using a pregenerated database. A database is generated by program DBG with respect to one of the homologous units CH/sub 2/, CF/sub 2/, CCl/sub 2/, or CBr/sub 2/ using a formula-acceptability-criterion-based bound and branched combinatorial algorithm as part of the formula-assignment process. Program FZM calculates the correct mass number of a species from its experimental mass on the appropriate Kendrick-mass scale and the truncating factor calculated by program DBG for the current database in order to locate the correct database table. The homologous-unit-mass-scale fractional masses in this table which lie within the user-specified region about the experimental Kendrick fractional mass are retrieved using a binary and linear search algorithm. The formula codes associated with these fractional masses are decoded. Program FZMIN admits on-line acquired mass spectral data to program FZM or remote execution.

Chung, K.C.; Barker, G.A.; Hedrick, G.E.

1982-12-01T23:59:59.000Z

95

An iterative algorithm to produce a positive definite correlation matrix from an approximate correlation matrix (with a program user's guide)  

Science Conference Proceedings (OSTI)

This report contains an explanation of an algorithm that, when executed, will operate on any symmetric approximate correlation matrix by iteratively adjusting the eigenvalues of this matrix. The objective of this algorithm is to produce a valid, positive definite, correlation matrix. Also a description of a program (called POSDEF) which implements the algorithm is given.

Iman, R.L.; Davenport, J.M.

1982-06-01T23:59:59.000Z

96

A Primal-Dual Decomposition Algorithm for Multistage Stochastic Convex Programming  

E-Print Network (OSTI)

This paper presents a new and high performance solution method for multistage stochastic convex programming. Stochastic programming is a quantitative tool developed in the field of optimization to cope with the problem of decision-making under uncertainty. Among others, stochastic programming has found many applications in finance, such as asset-liability and bond-portfolio management. However, many stochastic programming applications still remain computationally intractable because of their overwhelming dimensionality. In this paper we propose a new decomposition algorithm for multistage stochastic programming with a convex objective, based on the path-following interior point method combined with the homogeneous self-dual embedding technique. Our preliminary numerical experiments show that this approach is very promising in many ways for solving generic multistage stochastic programming, including its superiority in terms of numerical e#ciency, as well as the flexibility in testing and analyzing the model.

Arjan Berkelaar; Roy Kouwenberg; Shuzhong Zhang

2000-01-01T23:59:59.000Z

97

Computation of the constrained infinite time linear quadratic regulator  

Science Conference Proceedings (OSTI)

This paper presents an efficient algorithm for computing the solution to the constrained infinite-time, linear quadratic regulator (CLQR) problem for discrete time systems. The algorithm combines multi-parametric quadratic programming with reachability ... Keywords: Constrained infinite horizon control, Invariant Set, Linear quadratic regulator, Model predictive control

Pascal Grieder; Francesco Borrelli; Fabio Torrisi; Manfred Morari

2004-04-01T23:59:59.000Z

98

Duality, thermodynamics, and the linear programming problem in constraint-based models of metabolism  

E-Print Network (OSTI)

It is shown that the dual to the linear programming problem that arises in constraint-based models of metabolism can be given a thermodynamic interpretation in which the shadow prices are chemical potential analogues, and the objective is to minimise free energy consumption given a free energy drain corresponding to growth. The interpretation is distinct from conventional non-equilibrium thermodynamics, although it does satisfy a minimum entropy production principle. It can be used to motivate extensions of constraint-based modelling, for example to microbial ecosystems.

Patrick B. Warren; Janette L. Jones

2007-02-09T23:59:59.000Z

99

Exploring predistortion training algorithms in a Cartesian feedback-trained digital predistortion system for RF power amplifier linearization  

E-Print Network (OSTI)

A Cartesian feedback-trained digital predistortion system for RF power amplifier linearization offers many advantages with its combination of two different linearization techniques. This thesis describes such a system, ...

Huang, Jeffrey B

2006-01-01T23:59:59.000Z

100

118 / JOURNAL OF WATER RESOURCES PLANNING AND MANAGEMENT / MAY/JUNE 2000 LINEAR PROGRAMMING FOR FLOOD CONTROL IN THE IOWA  

E-Print Network (OSTI)

118 / JOURNAL OF WATER RESOURCES PLANNING AND MANAGEMENT / MAY/JUNE 2000 LINEAR PROGRAMMING a popular area of research for >30 years. Yeh (1985) and Wurbs (1993) pre- sented in-depth reviews

Lund, Jay R.

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 impact of parallel programming models on the performance of iterative linear solvers for finite element applications  

Science Conference Proceedings (OSTI)

Parallel iterative linear solvers for unstructured grids in FEM applications, originally developed for the Earth Simulator (ES), are ported to various types of parallel computer. The performance of flat MPI and hybrid parallel programming models is compared ...

Kengo Nakajima

2006-06-01T23:59:59.000Z

102

Obtaining the optimal fuel conserving investment mix: a linear programming hedonic technique approach  

SciTech Connect

The objectives of this study were to: (1) determine how energy efficiency affects the resale value of homes; (2) use this information concerning the implicit price of energy efficiency to estimate the resale value of fuel saving investments; and (3) incorporate these resale values into the investment decision process and determine the efficient investment mix for a household planning to own a given home for three alternative time periods. Two models were used to accomplish these objectives. A hedonic price model was used to determine the impact of energy efficiency on housing prices. The hedonic technique is a method used to attach implicit prices to characteristics that are not themselves bought and sold in markets, but are components of market goods. The hedonic model in this study provided an estimate of the implicit price paid for an increase in energy efficiency in homes on the Des-Moines housing market. In order to determine how the length of time the home is to be owned affects the optimal investment mix, a linear programming model was used to determine the cost minimizing investment mix for a baseline house under the assumption that it would be owned for 6, 20, and 50 years, alternatively. The results of the hedonic technique revealed that a premium is paid for energy efficient homes in Des Moines. The results of the linear programming model reveal that the optimal fuel saving investment mix for a home is sensitive to the time the home is to be owned.

Dinan, T.M.

1984-01-01T23:59:59.000Z

103

Fuzzy linear programming based optimal fuel scheduling incorporating blending/transloading facilities  

Science Conference Proceedings (OSTI)

In this paper the blending/transloading facilities are modeled using an interactive fuzzy linear programming (FLP), in order to allow the decision-maker to solve the problem of uncertainty of input information within the fuel scheduling optimization. An interactive decision-making process is formulated in which decision-maker can learn to recognize good solutions by considering all possibilities of fuzziness. The application of the fuzzy formulation is accompanied by a careful examination of the definition of fuzziness, appropriateness of the membership function and interpretation of results. The proposed concept provides a decision support system with integration-oriented features, whereby the decision-maker can learn to recognize the relative importance of factors in the specific domain of optimal fuel scheduling (OFS) problem. The formulation of a fuzzy linear programming problem to obtain a reasonable nonfuzzy solution under consideration of the ambiguity of parameters, represented by fuzzy numbers, is introduced. An additional advantage of the FLP formulation is its ability to deal with multi-objective problems.

Djukanovic, M.; Babic, B.; Milosevic, B. [Electrical Engineering Inst. Nikola Tesla, Belgrade (Yugoslavia); Sobajic, D.J. [EPRI, Palo Alto, CA (United States). Power System Control; Pao, Y.H. [Case Western Reserve Univ., Cleveland, OH (United States)]|[AI WARE, Inc., Cleveland, OH (United States)

1996-05-01T23:59:59.000Z

104

Mathematical models and algorithms for the computer program 'WOLF'  

SciTech Connect

The computer program FLOW finds the nonrelativistic self- consistent set of two-dimensional ion trajectories and electric fields (including space charges from ions and electrons) for a given set of initial and boundary conditions for the particles and fields. The combination of FLOW with the optimization code PISA gives the program WOLF, which finds the shape of the emitter which is consistent with the plasma forming it, and in addition varies physical characteristics such as electrode position, shapes, and potentials so that some performance characteristics are optimized. The motivation for developing these programs was the desire to design optimum ion source extractor/accelerator systems in a systematic fashion. The purpose of this report is to explain and derive the mathematical models and algorithms which approximate the real physical processes. It serves primarily to document the computer programs. 10 figures. (RWR)

Halbach, K.

1975-12-01T23:59:59.000Z

105

Supplier selection using fuzzy AHP and fuzzy multi-objective linear programming for developing low carbon supply chain  

Science Conference Proceedings (OSTI)

Environmental sustainability of a supply chain depends on the purchasing strategy of the supply chain members. Most of the earlier models have focused on cost, quality, lead time, etc. issues but not given enough importance to carbon emission for supplier ... Keywords: Carbon emission, Fuzzy AHP, Fuzzy multi-objective linear programming, Green house gas, Supplier selection, Textile supply chain

Krishnendu Shaw; Ravi Shankar; Surendra S. Yadav; Lakshman S. Thakur

2012-07-01T23:59:59.000Z

106

Application of linear programming with I-fuzzy sets to matrix games with I-fuzzy goals  

Science Conference Proceedings (OSTI)

In this paper we study a class of linear programming problems having fuzzy goals/constraints that can be described by (Atanassov's) I-fuzzy sets. Duality theory is developed for this class of problems in the I-fuzzy sense which is subsequently applied ... Keywords: Fuzzy duality, Fuzzy goals, Fuzzy optimization, I-fuzzy sets, Zero-sum matrix games

A. Aggarwal; A. Mehra; S. Chandra

2012-12-01T23:59:59.000Z

107

Linear and synchrosqueezed time-frequency representations revisited. Part I: Overview, standards of use, related issues and algorithms  

E-Print Network (OSTI)

Time-frequency representations (TFRs) of signals, such as windowed Fourier transform (WFT), wavelet transform (WT) and their synchrosqueezed variants (SWFT, SWT), provide powerful analysis tools. However, there are many important issues related to the practical use of TFRs that need to be clarified. Here we present a thorough review of these TFRs, summarizing all theoretical, practical and numerical aspects of their use, reconsidering some conventions and introducing new concepts and procedures. The purposes of this work are: (i) to provide a consistent overview of the computation, properties, and use of the (S)WFT/(S)WT methods; (ii) to establish general standards related to their use, both theoretical and practical; and (iii) to provide clean and optimized algorithms and MatLab codes, appropriate for any window or wavelet.

Iatsenko, Dmytro; Stefanovska, Aneta

2013-01-01T23:59:59.000Z

108

A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear Programming  

E-Print Network (OSTI)

Decision making under uncertainty is a challenge faced by many decision makers. Stochastic programming is a major tool developed to deal with optimization with uncertainties that has found applications in, e.g. finance, such as asset-liability and bond-portfolio management. Computationally however, many models in stochastic programming remain unsolvable because of overwhelming dimensionality. For a model to be well solvable, its special structure must be explored. Most of the solution methods are based on decomposing the data. In this paper we propose a new decomposition approach for two-stage stochastic programming, based on a direct application of the path-following method combined with the homogeneous self-dual technique. Numerical experiments show that our decomposition algorithm is very efficient for solving stochastic programs. In particular, we apply our decomposition method to a two-period portfolio selection problem using options on a stock index. In this model the investor ca...

Arjan Berkelaar; Cees Dert; Bart Oldenkamp; Shuzhong Zhang

1999-01-01T23:59:59.000Z

109

Solving combinatorial optimization problems using relaxed linear programming: a high performance computing perspective  

Science Conference Proceedings (OSTI)

Several important combinatorial optimization problems can be formulated as maximum a posteriori (MAP) inference in discrete graphical models. We adopt the recently proposed parallel MAP inference algorithm Bethe-ADMM and implement it using message passing ... Keywords: Markov random field, alternating direction method of multipliers, maximum a posteriori inference, message passing interface

Chen Jin; Qiang Fu; Huahua Wang; Ankit Agrawal; William Hendrix; Wei-keng Liao; Md. Mostofa Ali Patwary; Arindam Banerjee; Alok Choudhary

2013-08-01T23:59:59.000Z

110

Computational Experience with a Software Framework for Parallel Integer Programming  

Science Conference Proceedings (OSTI)

In this paper, we discuss the challenges that arise in parallelizing algorithms for solving generic mixed integer linear programs and introduce a software framework that aims to address these challenges. Although the framework makes few algorithmic assumptions, ... Keywords: branch and bound, branch and cut, integer programming, optimization, parallel algorithm, tree search

Y. Xu; T. K. Ralphs; L. Ladányi; M. J. Saltzman

2009-07-01T23:59:59.000Z

111

Program on Technology Innovation: Central Station Solar Photovoltaic, Linear Fresnel, and Dish-Engine Technology Assessment  

Science Conference Proceedings (OSTI)

This Technology Innovation (TI) project, performed in conjunction with an EPRI feasibility study for a 50 to 500 megawatt (MW) central station solar power (CSSP) plant to be developed in New Mexico by mid-2010, surveyed and characterized photovoltaic (PV), linear Fresnel, and dish-engine solar technology options. The overall feasibility study also assessed the status of parabolic trough and central receiver solar technologies.

2008-05-06T23:59:59.000Z

112

Energy savings from energy-efficient showerheads: REMP case study results, proposed evaluation algorithm, and program design implications  

SciTech Connect

The Bonneville Power Administration (Bonneville) has initiated two field studies of water-saving devices, the Regional End-Use Metering Program (REMP) study conducted by the Pacific Northwest Laboratory (PNL) and the Bonneville/Puget Sound Power and Light (Puget Power) water flow study just being implemented. These studies address the same subject using somewhat different approaches. The objectives of these studies is to provide statistically valid estimates of energy savings from energy-efficient showerheads under known field conditions. These results will be used to infer energy savings from Bonneville`s appliance efficiency program as part of a program impact evaluation. This report has three purposes. The first is to summarize the results of the REMP field study. The second is to introduce and explain the ``energy savings algorithm`` proposed for the Bonneville program impact evaluation. This algorithm will use data from both the REMP and Puget Power studies, as well as appropriate field data offered by participating utilities. The third purpose is to present information that may be useful in reviewing the current Bonneville program design and estimating savings from program design alternatives.

Warwick, W.M.

1993-09-01T23:59:59.000Z

113

Recourse-based stochastic nonlinear programming: properties and Benders-SQP algorithms  

Science Conference Proceedings (OSTI)

In this paper, we study recourse-based stochastic nonlinear programs and make two sets of contributions. The first set assumes general probability spaces and provides a deeper understanding of feasibility and recourse in stochastic nonlinear programs. ... Keywords: Almost-sure feasibility, Benders' decomposition, Nonlinear programming, Recourse, Sequential quadratic programming, Stochastic programming, W-condition

Ankur A. Kulkarni; Uday V. Shanbhag

2012-01-01T23:59:59.000Z

114

Optimization Online - ALGORITHM & DOCUMENTATION: MINRES ...  

E-Print Network (OSTI)

Jan 12, 2013 ... ALGORITHM & DOCUMENTATION: MINRES-QLP for Singular Symmetric and Hermitian Linear Equations and Least-Squares Problems.

115

Integrating program transformations in the memory-based synthesis of image and video algorithms  

Science Conference Proceedings (OSTI)

In this paper we discuss the interaction and integration of two important program transformations in high-level synthesis—Tree Height Reduction and Redundant Memory-access Elimination. Intuitively, these program transformations do not interfere ...

David J. Kolson; Alexandru Nicolau; Nikil Dutt

1994-11-01T23:59:59.000Z

116

A hybrid genetic algorithm for solving a class of nonlinear bilevel programming problems  

Science Conference Proceedings (OSTI)

In this paper, a special nonlinear bilevel programming problem (BLPP), in which the follower's problem is a convex quadratic programming in y, is transformed into an equivalent single-level programming problem by using Karush-Kuhn-Tucker(K-K-T) ...

Hecheng Li; Yuping Wang

2006-10-01T23:59:59.000Z

117

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

SciTech Connect

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

118

Linear control of nearly singularly perturbed hydropower plants  

Science Conference Proceedings (OSTI)

Keywords: linear optimal regulator, order reduction, power station control, recursive algorithms, singular perturbations

Dobrila Skataric; Zoran Gajic

1992-01-01T23:59:59.000Z

119

Short Communication: A simple and better algorithm to solve the vendor managed inventory control system of multi-product multi-constraint economic order quantity model  

Science Conference Proceedings (OSTI)

This research presents an alternative heuristic algorithm to solve the vendor management inventory system with multi-product and multi-constraint based on EOQ with backorders considering two classical backorders costs: linear and fixed. For this type ... Keywords: EOQ, Genetic algorithms, Heuristic algorithms, Nonlinear integer programming, Vendor management inventory

Leopoldo Eduardo Cárdenas-Barrón; Gerardo Treviño-Garza; Hui Ming Wee

2012-02-01T23:59:59.000Z

120

Fair SMG and Linear Time Model Checking  

E-Print Network (OSTI)

SMG is a system designed to generate a finite state model of a program from the program itself and an operational semantics for the programming language. This finite state model can then be model-checked to verify desired temporal properties of the original program. In this paper we first show how we have incorporated notions of fairness into SMG; in particular, a user is now able to define semantics with "fair" constructs, for example, parallel, repetitive choice, etc. The user can, indeed, mix different forms of fairness checking. Secondly we describe a practical approach to model checking of linear temporal formulae over the fair structures generated by SMG. Our approach is a refinement and extension of the fair-satisfiability algorithms, presented earlier by Lichtenstein and Pnueli, together with techniques developed in our practical implementations of decision procedures for linear temporal logic.

Howard Barringer; Michael D. Fisher; Graham D. Gough

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


121

An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application  

Science Conference Proceedings (OSTI)

We addressed the problem of developing a model to simulate at a high level of detail the movements of over 6,000 drivers for Schneider National, the largest truckload motor carrier in the United States. The goal of the model was not to obtain a better ... Keywords: approximate dynamic programming, driver management, fleet management, truckload trucking

Hugo P. Simão; Jeff Day; Abraham P. George; Ted Gifford; John Nienow; Warren B. Powell

2009-05-01T23:59:59.000Z

122

The Speed of Shor's R-algorithm  

E-Print Network (OSTI)

May 8, 2007 ... Key words: Shor's r-algorithm, space dilation, linear convergence, uncon- ... Shor's r-algorithm is an iterative method for unconstrained opti-.

123

A Hybrid Meta-Heuristic Algorithm for Dynamic Spectrum Management in Multiuser Systems: Combining Simulated Annealing and Non-Linear Simplex Nelder-Mead  

Science Conference Proceedings (OSTI)

One of the major sources of performance degradation of current Digital Subscriber Line systems is the electromagnetic coupling among different twisted pairs within the same cable bundle (crosstalk). Several algorithms for Dynamic Spectrum management ... Keywords: DSM, Multi-User Digital Subscriber Line (DSL), Nelder-Mead, NonLlinear Simplex, Simulated Annealing

Hernan X. Cordova; Leo Van Biesen

2011-10-01T23:59:59.000Z

124

An accelerated proximal gradient algorithm for nuclear norm ...  

E-Print Network (OSTI)

Mar 27, 2009 ... algorithm that does not require more than one gradient evaluation at each .... semidefinite program as follows; see [38] for details: .... The expected number svk is set by the following procedure. ...... 12 (1981), 989–1000. ... estimation in multivariate linear regression, Journal of the Royal Statistical Society:.

125

Parallel supercomputing: Advanced methods, algorithms, and software for large-scale linear and nonlinear problems. Final report, August 15, 1993--February 28, 1996  

SciTech Connect

This report gives a quick description of progress on methods, algorithms and software for large-scale parallel supercomputer applications. Focus is on large-scale applications of interest to DOE such as coupled viscous flow and heat or mass transport, and energy-related applications such as 3D petroleum and gas reservoir simulations on massively parallel systems. The interdisciplinary collaboration has been effective since it enhances the development of new iterative schemes for complex problems important to DOE: for example, significant advanced were made with modified forms of generalized gradient and multigrid methods for viscous flow and reservoir problems.

Carey, G.F. [Texas Univ., Austin, TX (United States). Inst. for Computational and Applied Mathematics; Young, D.M. [Texas Univ., Austin, TX (United States). Center for Numerical Analysis

1996-07-01T23:59:59.000Z

126

FilMINT: An Outer Approximation-Based Solver for Convex Mixed-Integer Nonlinear Programs  

Science Conference Proceedings (OSTI)

We describe a new solver for convex mixed-integer nonlinear programs (MINLPs) that implements a linearization-based algorithm. The solver is based on an algorithm of Quesada and Grossmann [Quesada, I., I. E. Grossmann. 1992. An LP/NLP based branch-and-bound ... Keywords: LP/NLP-based branch and bound, mixed-integer nonlinear programming, outer approximation

Kumar Abhishek; Sven Leyffer; Jeff Linderoth

2010-10-01T23:59:59.000Z

127

MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability  

Science Conference Proceedings (OSTI)

Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of clauses in a Boolean formula. A branch and bound algorithm based on the ... Keywords: DPLL, Linear programming, Nonlinear programming, Unit propagation, Variable ordering, Weighted maximum satisfiability

Zhao Xing; Weixiong Zhang

2005-05-01T23:59:59.000Z

128

A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear Programming  

Science Conference Proceedings (OSTI)

Decision making under uncertainty is a challenge faced by many decision makers. Stochastic programming is a major tool developed to deal with optimization with uncertainties which has found applications in, e.g., finance, such as asset--liability and ... Keywords: Programming, stochastic: decomposition and interior point methods

Arjan Berkelaar; Cees Dert; Bart Oldenkamp; Shuzhong Zhang

2002-09-01T23:59:59.000Z

129

Online modelling based on Genetic Programming  

Science Conference Proceedings (OSTI)

Genetic Programming (GP), a heuristic optimisation technique based on the theory of Genetic Algorithms (GAs), is a method successfully used to identify non-linear model structures by analysing a system's measured signals. Mostly, ... Keywords: GP, automatic learning, data driven model identification, fault diagnosis, genetic programming, machine learning, online modelling, real time, self-adaption

Stephan Winkler; Hajrudin Efendic; Luigi Del Re; Michael Affenzeller; Stefan Wagner

2007-06-01T23:59:59.000Z

130

vrue Universiteit amsterdam Econometric A Primal-Dual Decomposition-Based Interior Point Approach to Two-Stage Stochastic Linear Programming  

E-Print Network (OSTI)

Decision making under uncertainty is a challenge faced by many decision makers. Stochastic programming is a major tool developed to deal with optimization with uncertainties that has found applications in, e.g. finance, such as asset-liability and bond-portfolio management. Computationally however, many models in stochastic programming remain unsolvable because of overwhelming dimensionality. For a model to be well solvable, its special structure must be explored. Most of the solution methods are based on decomposing the data. In this paper we propose a new decomposition approach for two-stage stochastic programming, based on a direct application of the path-following method combined with the homogeneous self-dual technique. Numerical experiments show that our decomposition algorithm is very efficient for solving stochastic programs. In particular, we apply our decomposition method to a two-period portfolio selection problem using options on a stock index. In this model the investor can invest in a money-market account, a stock index, and European options on this index with different maturities. We experiment our model with market prices of options on the S&P500.

Arjan Berkelaar; Cees Dert; Bart Oldenkamp; Shuzhong Zhang; Arjan Berkelaar; Cees De; Bart Oldenkampi; Shuzhong Zhangs

1999-01-01T23:59:59.000Z

131

Proof Synthesis and Reflection for Linear Arithmetic  

Science Conference Proceedings (OSTI)

This article presents detailed implementations of quantifier elimination for both integer and real linear arithmetic for theorem provers. The underlying algorithms are those by Cooper (for Z) and by Ferrante and Rackoff ... Keywords: Linear arithmetic, Proof synthesis, Reflection

Amine Chaieb; Tobias Nipkow

2008-07-01T23:59:59.000Z

132

On Iterative Solution for Linear Complementarity Problem with an $H_{+}$-Matrix  

Science Conference Proceedings (OSTI)

The numerous applications of the linear complementarity problem (LCP) in, e.g., the solution of linear and convex quadratic programming, free boundary value problems of fluid mechanics, and moving boundary value problems of economics make ... Keywords: $H_+$-matrices, $M$-matrices, $P$-matrices, (block) modulus algorithm, LCP, iterative schemes, modified AOR method, modulus-based matrix splitting iteration methods, real positive definite matrices, scaled extrapolation, strictly diagonally dominant matrices

A. Hadjidimos; M. Lapidakis; M. Tzoumas

2012-01-01T23:59:59.000Z

133

Final Report---Optimization Under Nonconvexity and Uncertainty: Algorithms and Software  

SciTech Connect

the goal of this work was to develop new algorithmic techniques for solving large-scale numerical optimization problems, focusing on problems classes that have proven to be among the most challenging for practitioners: those involving uncertainty and those involving nonconvexity. This research advanced the state-of-the-art in solving mixed integer linear programs containing symmetry, mixed integer nonlinear programs, and stochastic optimization problems. The focus of the work done in the continuation was on Mixed Integer Nonlinear Programs (MINLP)s and Mixed Integer Linear Programs (MILP)s, especially those containing a great deal of symmetry.

Jeff Linderoth

2011-11-06T23:59:59.000Z

134

Optical linear algebra  

SciTech Connect

Many of the linear algebra operations and algorithms possible on optical matrix-vector processors are reviewed. Emphasis is given to the use of direct solutions and their realization on systolic optical processors. As an example, implicit and explicit solutions to partial differential equations are considered. The matrix-decomposition required is found to be the major operation recommended for optical realization. The pipelining and flow of data and operations are noted to be key issues in the realization of any algorithm on an optical systolic array processor. A realization of the direct solution by householder qr decomposition is provided as a specific case study. 19 references.

Casasent, D.; Ghosh, A.

1983-01-01T23:59:59.000Z

135

On Stable Piecewise Linearization and Generalized Algorithmic ...  

E-Print Network (OSTI)

never empty, independent of the particular function representation in terms of elemen- .... line-search this zig-zagging leads to convergence to a nonstationary point ...... The truly dependent values y do not directly enter into the incremental ...

136

A review of procedures to evolve quantum algorithms  

Science Conference Proceedings (OSTI)

There exist quantum algorithms that are more efficient than their classical counterparts; such algorithms were invented by Shor in 1994 and then Grover in 1996. A lack of invention since Grover's algorithm has been commonly attributed to the non-intuitive ... Keywords: Evolutionary algorithms, Evolving quantum algorithms, Genetic algorithms, Genetic programming, Quantum algorithms, Quantum computing

Adrian Gepp; Phil Stocks

2009-06-01T23:59:59.000Z

137

Intercomparison of In-Flight Icing Algorithms. Part I: WISP94 Real-Time Icing Prediction and Evaluation Program  

Science Conference Proceedings (OSTI)

The purpose of the Federal Aviation Administration’s Icing Forecasting Improvement Program is to conduct research on icing conditions both in flight and on the ground. This paper describes a portion of the in-flight aircraft icing prediction ...

Gregory Thompson; Roelof T. Bruintjes; Barbara G. Brown; Frank Hage

1997-12-01T23:59:59.000Z

138

Choosing the best set of variables in regression analysis using integer programming  

Science Conference Proceedings (OSTI)

This paper is concerned with an algorithm for selecting the best set of s variables out of k(> s) candidate variables in a multiple linear regression model. We employ absolute deviation as the measure of deviation and solve ... Keywords: 0-1 integer programming, Cardinality constraint, Least absolute deviation, Linear regression, Variable selection

Hiroshi Konno; Rei Yamamoto

2009-06-01T23:59:59.000Z

139

The Next Linear Collider Program  

NLE Websites -- All DOE Office Websites (Extended Search)

NLC Navbar Links NLC Navbar Links NLC Home Page NLC News Letter http://www-project.slac.stanford.edu/lc/local/Newsletter/backnumber.htm Standing Meetings http://www-project.slac.stanford.edu/lc/local/notes/Meetings-Schedule.html Notes & Report http://www-project.slac.stanford.edu/lc/home-page_new/meetings-and-notes.html Seminars http://www-project.slac.stanford.edu/lc/local/NLCSeminars/nlc_seminars_index.htm Workshops http://www-project.slac.stanford.edu/lc/wkshp/Wrkshops.htm Image Collections http://www.slac.stanford.edu/cgi-wrap/search-mtg?ABC&L=grp/ad/images/ Legacy Links http://www-project.slac.stanford.edu/lc/home-page_new/nlc-home-us.html NLC-Technical Safety Policy http://www-project.slac.stanford.edu/lc/local/Admin/Safety_Policy.html Video Collaboration Meetings

140

The Next Linear Collider Program  

NLE Websites -- All DOE Office Websites (Extended Search)

8champs1 8champs2 Nancy Yu Power Point Presentation 10212003 Additional: FullBrasslayers.ppt PRN30c-231.875Select3Summary || Text Only | SLAC | Meeting Schedule |...

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

The Next Linear Collider Program  

NLE Websites -- All DOE Office Websites (Extended Search)

SLAC SLAC Phonebook Entire SLAC Web FNAL Telephone Directory Fermilab Search LLNL Phone Book LLNL Web Servers LBNL Directory Services Web Search: A-Z Index KEK E-mail Database...

142

EXACT REGULARIZATION OF LINEAR PROGRAMS  

E-Print Network (OSTI)

Dec 26, 2005 ... instead appealing to Lagrange duality theory. ..... lpi-reactor. 2.0e+ .... A new result in the theory and computation of the least-norm solution of a.

143

LINEAR ACCELERATOR  

DOE Patents (OSTI)

Improvements in linear particle accelerators are described. A drift tube system for a linear ion accelerator reduces gap capacity between adjacent drift tube ends. This is accomplished by reducing the ratio of the diameter of the drift tube to the diameter of the resonant cavity. Concentration of magnetic field intensity at the longitudinal midpoint of the external sunface of each drift tube is reduced by increasing the external drift tube diameter at the longitudinal center region.

Christofilos, N.C.; Polk, I.J.

1959-02-17T23:59:59.000Z

144

Algorithms and FORTRAN programs to calculate classical collision integrals for realistic intermolecular potentials. [Classical transport integrals; SCAN; Coll  

SciTech Connect

Numerical methods and computer programs are given to evaluate, for an arbitrary intermolecular potential, the classical transport collision integrals which appear in the kinetic theory of dilute gases. The method of Gaussian quadrature was employed to integrate the triple integral. A detailed discussion is given of the mathematics necessary to determine the boundaries of the individual integrations as well as a detailed analysis of errors introduced by the numerical procedures. Results for a recently published helium potential, the HFDHE2, are given. 5 references.

Taylor, W.L.

1979-11-29T23:59:59.000Z

145

On the Construction of Linear q-ary Lexicodes  

Science Conference Proceedings (OSTI)

Let V be a list of all vectors of GF(q)n, lexicographically ordered with respect to some basis. Algorithms which search ... Keywords: anticodes, greedy algorithm, lexicodes, linearity, self-duality, self-orthogonality

A. J. Zanten; I. Nengah Suparta

2005-10-01T23:59:59.000Z

146

PLATO: a new piecewise linear simulation tool  

Science Conference Proceedings (OSTI)

This paper describes the basic concepts of a new piecewise linear circuit simulation program called PLATO. Piecewise linear modeling is a very generic and powerful approach to the modeling of electronic components. It allows for the use of macro modeling ...

M. T. van Stiphout; J. T. J. van Eijndhoven; H. W. Buurman

1990-03-01T23:59:59.000Z

147

Multisensor data fusion algorithm development  

Science Conference Proceedings (OSTI)

This report presents a two-year LDRD research effort into multisensor data fusion. We approached the problem by addressing the available types of data, preprocessing that data, and developing fusion algorithms using that data. The report reflects these three distinct areas. First, the possible data sets for fusion are identified. Second, automated registration techniques for imagery data are analyzed. Third, two fusion techniques are presented. The first fusion algorithm is based on the two-dimensional discrete wavelet transform. Using test images, the wavelet algorithm is compared against intensity modulation and intensity-hue-saturation image fusion algorithms that are available in commercial software. The wavelet approach outperforms the other two fusion techniques by preserving spectral/spatial information more precisely. The wavelet fusion algorithm was also applied to Landsat Thematic Mapper and SPOT panchromatic imagery data. The second algorithm is based on a linear-regression technique. We analyzed the technique using the same Landsat and SPOT data.

Yocky, D.A.; Chadwick, M.D.; Goudy, S.P.; Johnson, D.K.

1995-12-01T23:59:59.000Z

148

Adiabatic Quantum Programming: Minor Embedding With Hard Faults  

SciTech Connect

Adiabatic quantum programming defines the time-dependent mapping of a quantum algorithm into the hardware or logical fabric. An essential programming step is the embedding of problem-specific information into the logical fabric to define the quantum computational transformation. We present algorithms for embedding arbitrary instances of the adiabatic quantum optimization algorithm into a square lattice of specialized unit cells. Our methods are shown to be extensible in fabric growth, linear in time, and quadratic in logical footprint. In addition, we provide methods for accommodating hard faults in the logical fabric without invoking approximations to the original problem. These hard fault-tolerant embedding algorithms are expected to prove useful for benchmarking the adiabatic quantum optimization algorithm on existing quantum logical hardware. We illustrate this versatility through numerical studies of embeddabilty versus hard fault rates in square lattices of complete bipartite unit cells.

Klymko, Christine F [ORNL] [ORNL; Sullivan, Blair D [ORNL] [ORNL; Humble, Travis S [ORNL] [ORNL

2013-01-01T23:59:59.000Z

149

Weighted locally linear embedding for dimension reduction  

Science Conference Proceedings (OSTI)

The low-dimensional representation of high-dimensional data and the concise description of its intrinsic structures are central problems in data analysis. In this paper, an unsupervised learning algorithm called weighted locally linear embedding (WLLE) ... Keywords: Feature extraction, Locally linear embedding, Manifold learning, Nonlinear dimensionality reduction

Yaozhang Pan; Shuzhi Sam Ge; Abdullah Al Mamun

2009-05-01T23:59:59.000Z

150

Parametric program slicing  

Science Conference Proceedings (OSTI)

Program slicing is a technique for isolating computational threads in programs. In this paper, we show how to mechanically extract a family of practical algorithms for computing slices directly from semantic specifications. These algorithms are based ...

John Field; G. Ramalingam; Frank Tip

1995-01-01T23:59:59.000Z

151

Towards dense linear algebra for hybrid GPU accelerated manycore systems  

Science Conference Proceedings (OSTI)

We highlight the trends leading to the increased appeal of using hybrid multicore+GPU systems for high performance computing. We present a set of techniques that can be used to develop efficient dense linear algebra algorithms for these systems. We illustrate ... Keywords: Dense linear algebra, Graphics processing units, Hybrid computing, Multicore processors, Parallel algorithms

Stanimire Tomov; Jack Dongarra; Marc Baboulin

2010-06-01T23:59:59.000Z

152

Optimization Online - Integer Programming Submissions - 2013  

E-Print Network (OSTI)

Integer Programming Submissions - 2013. January 2013. (Mixed) Integer Linear Programming On the Augmented Lagrangian Dual for Integer Programming

153

Linear Quadratic  

E-Print Network (OSTI)

The proposal of Reshef et. al. (“MIC”) is an interesting new approach for discovering non-linear dependencies among pairs of measurements in exploratory data mining. However, it has a potentially serious drawback. The authors laud the fact that MIC has no preference for some alternatives over others, but as the authors know, there is no free lunch in Statistics: tests which strive to have high power against all alternatives can have low power in many important situations. To investigate this, we ran simulations to compare the power of MIC to that of standard Pearson correlation and distance correlation (dcor) Székely & Rizzo (2009). We simulated pairs of variables with different relationships (most of which were considered by the Reshef et. al.), but with varying levels of noise added. To determine proper cutoffs for testing the independence hypothesis, we simulated independent data with the appropriate marginals. As one can see from the Figure, MIC has lower power than dcor, in every case except the somewhat pathological

Noah Simon; Robert Tibshirani; Noah Simon; Robert Tibshirani

2011-01-01T23:59:59.000Z

154

Linearized Additive Classifiers  

E-Print Network (OSTI)

We revisit the additive model learning literature and adapt a penalized spline formulation due to Eilers and Marx, to train additive classifiers efficiently. We also propose two new embeddings based two classes of orthogonal basis with orthogonal derivatives, which can also be used to efficiently learn additive classifiers. This paper follows the popular theme in the current literature where kernel SVMs are learned much more efficiently using a approximate embedding and linear machine. In this paper we show that spline basis are especially well suited for learning additive models because of their sparsity structure and the ease of computing the embedding which enables one to train these models in an online manner, without incurring the memory overhead of precomputing the storing the embeddings. We show interesting connections between B-Spline basis and histogram intersection kernel and show that for a particular choice of regularization and degree of the B-Splines, our proposed learning algorithm closely appr...

Maji, Subhransu

2011-01-01T23:59:59.000Z

155

Programming  

NLE Websites -- All DOE Office Websites (Extended Search)

Programming for Exascale Computers William Gropp and Marc Snir April 15, 2013 Abstract Exascale systems will present programmers with many challenges. We review the...

156

Algorithms and Representations for Visual Recognition  

E-Print Network (OSTI)

a uniformly spaced linear B-Spline basis centered at theseinteresting connections between B-Spline basis and histogramand degree of the B-Splines, our proposed learning algorithm

Maji, Subhransu

2011-01-01T23:59:59.000Z

157

Specification-guided controller synthesis for linear systems and safe linear-time temporal logic  

Science Conference Proceedings (OSTI)

In this paper we present and analyze a novel algorithm to synthesize controllers enforcing linear temporal logic specifications on discrete-time linear systems. The central step within this approach is the computation of the maximal controlled invariant ... Keywords: controller synthesis, robustness

Matthias Rungger; Manuel Mazo, Jr.; Paulo Tabuada

2013-04-01T23:59:59.000Z

158

Data streams: algorithms and applications  

Science Conference Proceedings (OSTI)

In the data stream scenario, input arrives very rapidly and there is limited memory to store the input. Algorithms have to work with one or few passes over the data, space less than linear in the input size or time significantly less than the input size. ...

S. Muthukrishnan

2005-08-01T23:59:59.000Z

159

Nonlinear piecewise polynomial approximation: Theory and Algorithms  

E-Print Network (OSTI)

algorithms for compression and quick rendering of Digital Terrain Elevation Data (DTED) maps and implement by these and further theoretical results, we develop eÃ?cient practical algorithms for compression and quick rendering linear approximation 23 2.3. Slim B-spaces 32 2.4. Skinny B-spaces 42 2.5. Fat B-spaces: The link

Karaivanov, Borislav

160

LES algorithm for turbulent reactive flows simulation  

Science Conference Proceedings (OSTI)

The paper presents the development and implementation of a Large Eddy Simulation numerical algorithm for simulating turbulent reactive flows. The numerical algorithm is based on a 5 step modified Runge - Kutta numerical scheme with a dual time stepping ... Keywords: Runge - Kutta numerical scheme, large eddy simulation, linear eddy model

Ionut Porumbel; Cristian Cârl?nescu; Florin Gabriel Florean; Constantin Eusebiu Hritcu

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


161

Solving Systems of Linear Equations with Relaxed Monte Carlo Method  

Science Conference Proceedings (OSTI)

The problem of solving systems of linear algebraic equations by parallel Monte Carlo numerical methods is considered. A parallel Monte Carlo method with relaxation is presented. This is a report of a research in progress, showing the effectiveness of ... Keywords: Monte Carlo method, linear solver, parallel algorithms, systems of linear algebraic equations

Chih Jeng Kenneth Tan

2002-05-01T23:59:59.000Z

162

On the Relative Performance of Linear vs. Piecewise-Linear-Threshold Intertemporal Incentives  

Science Conference Proceedings (OSTI)

This paper employs numerical simulations to compare the relative performance of linear contracts with piecewise-linear-threshold contracts in the case where the agent chooses actions over time. These contracts are restricted to be functions of the ending ... Keywords: dynamic programming, intertemporal incentives, linear contracts, salesforce compensation

Joseph Y. Chen; Bruce L. Miller

2009-10-01T23:59:59.000Z

163

Natural algorithms and influence systems  

E-Print Network (OSTI)

doi:10.1145/2380656.2380679 Algorithms offer a rich, expressive language for modelers of biological and social systems. They lay the grounds for numerical simulations and, crucially, provide a powerful framework for their analysis. The new area of natural algorithms may reprise in the life sciences the role differential equations have long played in the physical sciences. For this to happen, however, an “algorithmic calculus ” is needed. We discuss what this program entails in the context of influence systems, a broad family of multiagent models arising in social dynamics. 1.

Bernard Chazelle

2012-01-01T23:59:59.000Z

164

Linear Thermite Charge  

The Linear Thermite Charge (LTC) is designed to rapidly cut through concrete and steel structural components by using extremely high temperature thermite reactions jetted through a linear nozzle. 

165

Linear Collider Collaboration Tech Notes  

NLE Websites -- All DOE Office Websites (Extended Search)

Notes Notes LCC - 0018, 15/06/99 Rev B, June 2002 Correct Account of RF Deflections in Linac Acceleration June 15, 1999 G.V. Stupakov Stanford Linear Accelerator Center Stanford, California Abstract: During acceleration in the linac structure, the beam not only increases its longitudinal momentum, but also experiences a transverse kick from the accelerating mode which is linear in accelerating gradient. This effect is neglected in such computer codes as LIAR and TRANSPORT. We derived the Hamiltonian equations that describe the effect of RF deflection into the acceleration process and included it into the computational engine of LIAR. By comparing orbits for the NLC main linac, we found that the difference between the two algorithms is about 10\%. The effect will be more pronounced at smaller

166

Independent Oversight Inspection, Stanford Linear Accelerator Center -  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Stanford Linear Accelerator Stanford Linear Accelerator Center - January 2007 Independent Oversight Inspection, Stanford Linear Accelerator Center - January 2007 January 2007 Inspection of Environment, Safety, and Health Programs at the Stanford Linear Accelerator Center The U.S. Department of Energy (DOE) Office of Independent Oversight, within the Office of Health, Safety and Security, conducted an inspection of environment, safety, and health (ES&H) programs at the DOE Stanford Linear Accelerator Center (SLAC) during October and November 2006. The inspection was performed by Independent Oversight's Office of Environment, Safety and Health Evaluations. Since the 2004 Type A electrical accident, SSO and SLAC have made improvements in many aspects of ES&H programs. However, the deficiencies in

167

AMG for linear systems in engine flow simulations  

Science Conference Proceedings (OSTI)

The performance of three fundamentally different AMG solvers for systems of linear equations in CFD simulations using SIMPLE and PISO algorithm is examined. The presented data is discussed with respect to computational aspects of the parallelisation. ...

Maximilian Emans

2009-09-01T23:59:59.000Z

168

Program  

Office of Scientific and Technical Information (OSTI)

Extremophiles 2004 Extremophiles 2004 5th International Conference on Extremophiles SEPTEMBER 19 -23, 2004 CAMBRIDGE, MARYLAND Extremophiles 2004 5th International Conference on Extremophiles © 2004, American Society for Microbiology 1752 N Street, N.W. Washington, DC 20036-2904 Phone: 202-737-3600 World Wide Web: www.asm.org All Rights Reserved Printed in the United States of America ISBN: 1-55581 324-0 TABLE OF CONTENTS General Information Scientific Program Abstracts for Oral Sessions Abstracts for Poster Sessions Index 4 10 18 42 144 4 ASM Conferences EXECUTIVE COMMITTEE Frank Robb, Chair University of Maryland Biotechnology Institute Michael W. Adams University of Georgia Koki Horikoshi Japan Agency for Marine-Earth Science and Technology Robert M. Kelly North Carolina State University Jennifer Littlechild

169

Designing Educationally Effective Algorithm Visualizations  

E-Print Network (OSTI)

Despite the intuitively compelling adage "a picture is worth a thousand words," attempts over the past decade to use animations to explain algorithms to students have produced disappointing results. In most cases interesting algorithm animations were designed, but no formal, systematic evaluations were conducted. When such evaluations were performed the results were mixed, with compelling evidence for the instructional superiority of algorithm animations failing to emerge. It is in this context that we embarked on a research program to develop educationally effective algorithm visualizations. This program was based on the premise that animations needed to be embedded in a knowledge and context providing hypermedia environment in order to effectively harness their power to enhance learning. This paper describes the architecture of the resulting Hypermedia Algorithm Visualization system HalVis. Four empirical studies with HalVis are described, which demonstrated that the extent of learning exhibited by students who used HalVis was significantly greater than that of students who used means of traditional instruction or a typical algorithm animation.

Steven Hansen; N. Hari Narayanan; Mary Hegarty

2002-01-01T23:59:59.000Z

170

A scalable MPI_Comm_split algorithm for exascale computing  

Science Conference Proceedings (OSTI)

Existing algorithms for creating communicators in MPI programs will not scale well to future exascale supercomputers containing millions of cores. In this work, we present a novel communicator-creation algorithm that does scale well into millions of ...

Paul Sack; William Gropp

2010-09-01T23:59:59.000Z

171

Evaluation of RADAP II Severe-Storm-Detection Algorithms  

Science Conference Proceedings (OSTI)

Computer-generated volumetric radar algorithms have been available at a few operational National Weather Service sites since the mid-1970s under the Digitized Radar Experiment (D/RADFX) and Radar Data Processor (RADAP II) programs. The algorithms ...

Herb A. Winston; Larry J. Ruthi

1986-02-01T23:59:59.000Z

172

Optimization Online - Integer Programming Submissions - 2007  

E-Print Network (OSTI)

Friedrich Eisenbrand, Gennady Shmonin. May 2007. (Mixed) Integer Linear Programming An Integer Programming Approach to Equitable Coloring Problems

173

Documentation and analysis of the Schlumberger interactive 1-D inversion program slumb  

DOE Green Energy (OSTI)

This computer program is designed to accept field data from a Schlumberger resistivity array and invert it in terms of a one-dimensional layered geoelectrical model. Because the inverse problem is non-linear, an initial guess model is required. This input model can be obtained by traditional curve matching, or by repeated use of a forward algorithm. This program was written in FORTRAN V and developed on a UNIVAC 1108 computer.

Sandberg, S.

1979-09-01T23:59:59.000Z

174

Generic Optimization Program User Manual Version 3.0.0  

SciTech Connect

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

Wetter, Michael

2009-05-11T23:59:59.000Z

175

Evaluating Heuristic Optimization Phase Order Search Algorithms  

Science Conference Proceedings (OSTI)

Program-specific or function-specific optimization phase sequences are universally accepted to achieve better overall performance than any fixed optimization phase ordering. A number of heuristic phase order space search algorithms have been devised ...

Prasad A. Kulkarni; David B. Whalley; Gary S. Tyson

2007-03-01T23:59:59.000Z

176

An easy-to-use MATLAB program (MamLand) for the assessment of landslide susceptibility using a Mamdani fuzzy algorithm  

Science Conference Proceedings (OSTI)

In this study, landslide susceptibility mapping using a completely expert opinion-based approach was applied for the Sinop (northern Turkey) region and its close vicinity. For this purpose, an easy-to-use program, ''MamLand,'' was developed for the construction ... Keywords: Geographical Information Systems (GIS), Landslide susceptibility, Mamdani fuzzy inference system, Sinop (Turkey)

A. Akgun; E. A. Sezer; H. A. Nefeslioglu; C. Gokceoglu; B. Pradhan

2012-01-01T23:59:59.000Z

177

Exact distribution of individual displacements in linear probing hashing  

Science Conference Proceedings (OSTI)

This paper studies the distribution of individual displacements for the standard and the Robin Hood linear probing hashing algorithms. When the a table of size m has n elements, the distribution of the search cost of a random element is ... Keywords: Linear probing, distributional analysis, individual displacements

Alfredo Viola

2005-10-01T23:59:59.000Z

178

Logic programming with temporal constraints  

Science Conference Proceedings (OSTI)

Combines logic programming and temporal constraint processing techniques in a language called TCLP (Temporal Constraint Logic Programming), which augments logic programs with temporal constraints. Known algorithms for processing disjunctions in temporal ... Keywords: Datalog, Simple TCLP, TCLP language, decidable fragment, disjunction processing algorithms, quantification, relation symbols, syntactic structure, temporal constraint logic programming, temporal constraint networks, temporal constraint satisfaction problems, temporal logic, temporal occurrence intervals

E. Schwalb; L. Vila

1996-05-01T23:59:59.000Z

179

ESS 2012 Peer Review - Linear Analysis of Power Electronics for...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Linear Analysis of Power Electronics for Energy Storage Systems Sandia National Laboratories is a multi-program laboratory managed and operated by Sandia Corporation, a wholly...

180

Global linear convergence of an augmented Lagrangian algorithm ...  

E-Print Network (OSTI)

in the positive orthant to an affine space, on the one hand, and to the .... only limitation on a large value for rk comes from the ill-conditioning that such a value  ...

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

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

E-Print Network (OSTI)

Jun 4, 2007 ... run at a rate of 30 frames per second. For each frame, several ..... It is easy to explain the utility of the point b by interpreting the solution of ...

182

A LINEAR TIME ALGORITHM FOR THE KOOPMANS-BECKMANN ...  

E-Print Network (OSTI)

For symmetric Koopmans-Beckmann QAP, Bookhold [4] gave a sufficient condition .... ith component of vector a is ai, of vector ¯b is ¯bi etc. Rows and columns of ...

183

Linear algebra operators for GPU implementation of numerical algorithms  

Science Conference Proceedings (OSTI)

In this work, the emphasis is on the development of strategies to realize techniques of numerical computing on the graphics chip. In particular, the focus is on the acceleration of techniques for solving sets of algebraic equations as they occur in numerical ... Keywords: graphics hardware, numerical simulation

Jens Krüger; Rüdiger Westermann

2003-07-01T23:59:59.000Z

184

Asynchronous parallel generating set search for linearly-constrained optimization.  

SciTech Connect

Generating set search (GSS) is a family of direct search methods that encompasses generalized pattern search and related methods. We describe an algorithm for asynchronous linearly-constrained GSS, which has some complexities that make it different from both the asynchronous bound-constrained case as well as the synchronous linearly-constrained case. The algorithm has been implemented in the APPSPACK software framework and we present results from an extensive numerical study using CUTEr test problems. We discuss the results, both positive and negative, and conclude that GSS is a reliable method for solving small-to-medium sized linearly-constrained optimization problems without derivatives.

Lewis, Robert Michael (; ); Griffin, Joshua D.; Kolda, Tamara Gibson

2006-08-01T23:59:59.000Z

185

Unifying Condition Numbers for Linear Programming  

E-Print Network (OSTI)

To define conditioning from ill-posedness one needs a norm in the space of data. Let denote such a norm and ? denote the distance to ill-posedness induced by.

186

Shrink-Wrapping trajectories for Linear Programming  

E-Print Network (OSTI)

May 30, 2010 ... expensive due to its implementation as “trial and error” testing on whether a ...... LAB begins to report the numerical ill-conditioning for locating xi ? x(di), the ..... intensity modulated radiation therapy treatment planning under ...

187

Iterative Estimation Maximization for Stochastic Linear Programs ...  

E-Print Network (OSTI)

spanning from May 23rd 2007 to May 22nd 2008, obtained from http://finance. google.com with adjustment for stock splitting. These stocks span a total of 10 ...

188

Optimal portfolios using Linear Programming models  

E-Print Network (OSTI)

Feb 12, 2003 ... three portfolios will then be compared with various utility functions and with out of sample data. ... interest rate, and not allowing short selling.

189

Polynomial Approximations for Continuous Linear Programs  

E-Print Network (OSTI)

v ? Rd+1, where Pd denotes the truncation operator that maps ?(t) to ?d(t). In ...... example problem at hand since the capacity constraints couple the output rates.

190

SDDP FOR MULTISTAGE STOCHASTIC LINEAR PROGRAMS ...  

E-Print Network (OSTI)

functions. This allows us to define a risk-averse nonanticipative feasible policy for the ... stochastic uncertainty in engineering, transportation, finance and energy.

191

Limitations of Linear and Semidefinite Programs  

E-Print Network (OSTI)

2006. [29] Madhur Tulsiani. CSP gaps and reductions in thecannot prove that a random k-CSP over any predicate impliedi j ? } k }) The language k-CSP-P consists of satis?able k-

Schoenebeck, Grant Robert

2010-01-01T23:59:59.000Z

192

Sraffa-von Neumann, linear programming  

E-Print Network (OSTI)

Johann Wolfgang Goethe-Universität, Frankfurt, GermanySummary This paper examines the empirical relevance of the capital controversy between the proponents of the classical and of the neoclassical paradigm in economics. Aggregate capital at the macroeconomic level is regarded as the sum of capital goods employed, measured in terms of normal prices. Hence the price model of Sraffa (1960) and the dual models of the price and quantity systems of von Neumann (1937) become the basis of the investigation. The capital controversy is concerned with consequence of the choice of the cost minimizing technique in the production system for the relationship between distribution and the value of capital. Theoretical examples are easily constructed which contradict the fundamental neoclassical hypothesis of an inverse relationship between the rate of profit and the intensity of capital, differentiating between aggregate and sectoral intensity. This paper for the first time presents empirical examples. To this end, the quantity system of the von Neumann model is here used to model spectra of techniques. 32 input-output tables from 9 countries of the OECD input-output data base serve as data. One input-output table represents one technique (production system). A spectrum of technique, or book of blueprints, consists of two input-output tables from the

Jel Classification C; Zonghie Han; Bertram Schefold; Fachbereich Wirtschaftswissenschaften

2005-01-01T23:59:59.000Z

193

Automated Program Description  

E-Print Network (OSTI)

The Programmer's apprentice (PA) is an automated program development tool. The PA depends upon a library of common algorithms (cliches) as the source of its knowledge about programming. The PA uses these cliches to understand ...

Cyphers, D. Scott

194

Ensemble of niching algorithms  

Science Conference Proceedings (OSTI)

Although niching algorithms have been investigated for almost four decades as effective procedures to obtain several good and diverse solutions of an optimization problem, no effort has been reported on combining different niching algorithms to form ... Keywords: Clearing, Dynamic fitness sharing, Ensemble, Genetic algorithm, Multimodal optimization, Niching, Pattern search, Real-coded sequential niching memetic algorithm, Restricted competition selection, Restricted tournament selection, Spatially-structured evolutionary algorithm, Species conserving genetic algorithm

E. L. Yu; P. N. Suganthan

2010-08-01T23:59:59.000Z

195

Optimization Online - Finite Disjunctive Programming ...  

E-Print Network (OSTI)

Aug 25, 2009 ... Category 2: Integer Programming ((Mixed) Integer Linear Programming ). Citation : Technical report, Data Driven Decisions Lab, The Ohio State ...

196

A Butterfly Algorithm for Synthetic Aperture Radar Imaging  

E-Print Network (OSTI)

In spite of an extensive literature on fast algorithms for synthetic aperture radar (SAR) imaging, it is not currently known if it is possible to accurately form an image from N data points in provable near-linear time ...

Demanet, Laurent

197

A random coordinate descent algorithm for optimization problems ...  

E-Print Network (OSTI)

descent methods based on the Gauss-Southwell rule, the convergence rate is ..... are algorithms for solving the above subproblem in linear-time (i.e., O(ni +nj).

198

Linear collider: a preview  

Science Conference Proceedings (OSTI)

Since no linear colliders have been built yet it is difficult to know at what energy the linear cost scaling of linear colliders drops below the quadratic scaling of storage rings. There is, however, no doubt that a linear collider facility for a center of mass energy above say 500 GeV is significantly cheaper than an equivalent storage ring. In order to make the linear collider principle feasible at very high energies a number of problems have to be solved. There are two kinds of problems: one which is related to the feasibility of the principle and the other kind of problems is associated with minimizing the cost of constructing and operating such a facility. This lecture series describes the problems and possible solutions. Since the real test of a principle requires the construction of a prototype I will in the last chapter describe the SLC project at the Stanford Linear Accelerator Center.

Wiedemann, H.

1981-11-01T23:59:59.000Z

199

Detroit as linear city.  

E-Print Network (OSTI)

??Detroit is a city in decline. Through strategic withdrawal into a linear city its main artery -Woodward Avenue- becomes an assembly line that holds different… (more)

Kuys, J.I.

2012-01-01T23:59:59.000Z

200

Linear phase compressive filter  

DOE Patents (OSTI)

A phase linear filter for soliton suppression is in the form of a laddered series of stages of non-commensurate low pass filters with each low pass filter having a series coupled inductance (L) and a reverse biased, voltage dependent varactor diode, to ground which acts as a variable capacitance (C). L and C values are set to levels which correspond to a linear or conventional phase linear filter. Inductance is mapped directly from that of an equivalent nonlinear transmission line and capacitance is mapped from the linear case using a large signal equivalent of a nonlinear transmission line.

McEwan, Thomas E. (Livermore, CA)

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


201

Focusing in Linear Accelerators  

DOE R&D Accomplishments (OSTI)

Review of the theory of focusing in linear accelerators with comments on the incompatibility of phase stability and first-order focusing in a simple accelerator.

McMillan, E. M.

1950-08-24T23:59:59.000Z

202

Linear Graphene Plasmons  

Science Conference Proceedings (OSTI)

The coupling of the plasmon spectra of graphene and a nearby thick plasma is examined here in detail. The coupled modes include linear plasmons. Keywords: Graphene, plasmons, surface

N. J.M. Horing

2010-11-01T23:59:59.000Z

203

Photon Linear Collider Gamma-Gamma Summary  

SciTech Connect

High energy photon - photon collisions can be achieved by adding high average power short-pulse lasers to the Linear Collider, enabling an expanded physics program for the facility. The technology required to realize a photon linear collider continues to mature. Compton back-scattering technology is being developed around the world for low energy light source applications and high average power lasers are being developed for Inertial Confinement Fusion.

Gronberg, J

2012-02-27T23:59:59.000Z

204

Optimally profiling and tracing programs  

Science Conference Proceedings (OSTI)

This paper describes algorithms for inserting monitoring code to profile and trace programs. These algorithms greatly reduce the cost of measuring programs with respect to the commonly used technique of placing code in each basic block. Program profiling ... Keywords: control-flow graph, instruction tracing, instrumentation, profiling

Thomas Ball; James R. Larus

1994-07-01T23:59:59.000Z

205

Identification and modeling for non-linear dynamic system using neural networks type MLP  

Science Conference Proceedings (OSTI)

In control systems, the model dynamics of linear systems is the principal and most important phase of a project, but when working with dynamic of non-linear systems obtain the model becomes a very complex task can be used techniques of system identification. ... Keywords: LP, algorithms, dynamic backprogation, modeling, multilayer perceptrons, neural networks dynamics, non-linear dynamics, training

Hernán González Acuña; Max Suell Dutra; Omar Lengerke

2009-06-01T23:59:59.000Z

206

Lecture Notes on Classical Linear Logic 15-816: Linear Logic  

E-Print Network (OSTI)

Originally, linear logic was conceived by Girard [Gir87] as a classical system, with one-sided sequents, an involutive negation, and an appropriate law of excluded middle. For a number of the applications, such as functional computation, logic programming, and implicit computational complexity the intuitionistic version is more suitable. In the case of concurrent computation, both classical and intuitionistic systems may be used, although the additional expressiveness afforded by the intuitionistic system seems to have some advantages even in that setting. In this lecture we present classical linear logic and then show that we can easily interpret it intuitionistically. Briefly, classical linear logic can be modeled intuitionistically as deriving a contradiction from linear assumptions. This is shown via a so-called double-negation translation. Its parametric nature allows a number of additional variants of classical linear logic to be explained intuitionistically, in particular the so-called mix rules. 1 Classical Linear Sequents

Frank Pfenning

2012-01-01T23:59:59.000Z

207

An Integer Programming Approach for Linear Programs with ...  

E-Print Network (OSTI)

corresponding to a single row of the probabilistic constraint. We obtain .... tained from a single row in the probabilistic constraint. ... the standard MIP formulation.

208

North Linear Accelerator  

NLE Websites -- All DOE Office Websites (Extended Search)

North Linear Accelerator North Linear Accelerator Building Exterior Beam Enclosure Level Walk to the North Spreader North Recombiner Extras! North Linear Accelerator The North Linear Accelerator is one of the two long, straight sections of Jefferson Lab's accelerator. Electrons gain energy in this section by passing through acceleration cavities. There are 160 cavities in this straightaway, all lined up end to end. That's enough cavities to increase an electron's energy by 400 million volts each time it passes through this section. Electrons can pass though this section as many as five times! The cavities are powered by microwaves that travel down the skinny rectangular pipes from the service buildings above ground. Since the cavities won't work right unless they are kept very cold, they

209

Linear Motor Powered Transportation  

E-Print Network (OSTI)

This special issue on linear-motor powered transportation covers both supporting technologies and innovative transport systems in various parts of the World, as this technology moves from the lab to commercial operations. ...

Thornton, Richard D.

210

Edges and linearization  

E-Print Network (OSTI)

This thesis is concerned with how grammar determines the phonological consequence of syntactic dislocation. It centers on a hypothesis regarding the linearization of movement chains - the Edge Condition on Copy Deletion, ...

Trinh, Tue H. (Tue Huu)

2011-01-01T23:59:59.000Z

211

Information Geometry and Interior-Point Algorithms in SDP and ...  

E-Print Network (OSTI)

Sep 30, 2011 ... admits a rigorous differential geometric expression in view of information geometry. Our result is a direct extension of [10] in linear programming ...

212

An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application  

Science Conference Proceedings (OSTI)

We propose an interior point constraint generation (IPCG) algorithm for semi-infinite linear optimization (SILO) and prove that the algorithm converges to an ?-solution of SILO after a finite number of constraints is generated. We derive a complexity ... Keywords: second-order cone optimization, sector duration optimization, semi-infinite linear optimization

Mohammad R. Oskoorouchi; Hamid R. Ghaffari; Tamás Terlaky; Dionne M. Aleman

2011-09-01T23:59:59.000Z

213

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

214

Grover search algorithm  

E-Print Network (OSTI)

A quantum algorithm is a set of instructions for a quantum computer, however, unlike algorithms in classical computer science their results cannot be guaranteed. A quantum system can undergo two types of operation, measurement and quantum state transformation, operations themselves must be unitary (reversible). Most quantum algorithms involve a series of quantum state transformations followed by a measurement. Currently very few quantum algorithms are known and no general design methodology exists for their construction.

Borbely, Eva

2007-01-01T23:59:59.000Z

215

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   

216

Quantum Algorithm Zoo  

Science Conference Proceedings (OSTI)

... 27 Andrew M. Childs, Richard Cleve, Stephen P. Jordan, and David Yeung Discrete-query quantum algorithm for NAND trees. ...

2013-11-11T23:59:59.000Z

217

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

Science Conference Proceedings (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

218

Linear scaling 3D fragment method for large-scale electronic structure calculations  

Science Conference Proceedings (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 39% 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 DFT calculation, 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(N{sup 3}) methods, and the potential for petascale computation using the LS3DF method.

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

2008-07-11T23:59:59.000Z

219

A cooperative control algorithm for camera based observational systems.  

SciTech Connect

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

220

Robust algorithm for tunnel closing in 3D volumetric objects based on topological characteristics of points  

Science Conference Proceedings (OSTI)

In this letter, we propose a robust, linear in time modification of Aktouf, Bertrand and Perroton's algorithm for tunnel (3D hole) closing in 3D volumetric objects. Our algorithm is insensitive to small distortions and branches. The algorithm has been ... Keywords: 3D image processing, Crack bridging, Skeletonisation, Topological numbers, Tunnel closing

Marcin Janaszewski; Micha? Postolski; Laurent Babout

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


221

Population Monte Carlo algorithms  

E-Print Network (OSTI)

We give a cross-disciplinary survey on ``population'' Monte Carlo algorithms. In these algorithms, a set of ``walkers'' or ``particles'' is used as a representation of a high-dimensional vector. The computation is carried out by a random walk and split/deletion of these objects. The algorithms are developed in various fields in physics and statistical sciences and called by lots of different terms -- ``quantum Monte Carlo'', ``transfer-matrix Monte Carlo'', ``Monte Carlo filter (particle filter)'',``sequential Monte Carlo'' and ``PERM'' etc. Here we discuss them in a coherent framework. We also touch on related algorithms -- genetic algorithms and annealed importance sampling.

Yukito IBA

2000-08-16T23:59:59.000Z

222

A conception for creating a system of parametric design of parallel algorithms and their software implementations  

Science Conference Proceedings (OSTI)

A conception is proposed for the creation of a system for parametric design of parallel algorithms. The following functional components of the system are described: transformation of SAA-M schemes, program synthesis, and execution and statistics gathering. ... Keywords: Java Multithreading, SAA-M scheme, algorithm, flow, formalization, modified system of algorithmic algebras, paradigm of parallel programming, parallelism, process

S. D. Pogorilyy; I. Yu. Shkulipa

2009-11-01T23:59:59.000Z

223

Stochastic integer programming based algorithms for adaptable ...  

E-Print Network (OSTI)

Apr 22, 2012 ... assuming that the durations of each surgery, setup, and clean-up are random variables with known distributions. Decisions made the day prior ...

224

An Improved Algorithm for Biobjective Integer Programs  

E-Print Network (OSTI)

the decision maker's utility function is known, then the final outcome ... rates. A global view of tradeoffs for continuous Pareto sets, based on the pairwise ...

225

A Sequential Convex Semidefinite Programming Algorithm for ...  

E-Print Network (OSTI)

(kocvara@maths.bham.ac.uk). ‡Institute of Applied ... constraints play an important role in many real-world applications (compare [9, 13]). A direct treatment of ...

226

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. Motivated by ... functions with penalty terms which adjustment can be problematic. The filter ..... Otherwise, when (?(xk), f(xk)) is entered to the filter, either at ...

227

Programming Cliches and Cliche Extraction  

E-Print Network (OSTI)

The programmer's apprentice (PA) is an automated program development tool. The PA depends upon a library of common algorithms (cliches) as the source of its knowledge about programming. The PA can be made more usable if ...

Cyphers, D. Scott

228

Next Linear Collider Home Page  

NLE Websites -- All DOE Office Websites (Extended Search)

Welcome to the Next Linear Collider NLC Home Page If you would like to learn about linear colliders in general and about this next-generation linear collider project's mission,...

229

Linear Collider Collaboration Tech Notes LCC-0108  

NLE Websites -- All DOE Office Websites (Extended Search)

8 8 TESLA 2002-10 CBP Tech Note-268 November 2002 Comparison of Emittance Tuning Simulations in the NLC and TESLA Damping Rings Andrej Wolski Lawrence Berkeley National Laboratory University of California Berkeley, CA Winfried Decking Deutsches Elektron Synchrotron (DESY) Hamburg, Germany Abstract: Vertical emittance is a critical issue for future linear collider damping rings. Both NLC and TESLA specify vertical emittance of the order of a few picometers, below values currently achieved in any storage ring. Simulations show that algorithms based on correcting the closed orbit and the vertical dispersion can be effective in reducing the vertical emittance to the required levels, in the presence of a limited subset of

230

Experimental quantum private queries with linear optics  

Science Conference Proceedings (OSTI)

The quantum private query is a quantum cryptographic protocol to recover information from a database, preserving both user and data privacy: the user can test whether someone has retained information on which query was asked and the database provider can test the amount of information released. Here we discuss a variant of the quantum private query algorithm that admits a simple linear optical implementation: it employs the photon's momentum (or time slot) as address qubits and its polarization as bus qubit. A proof-of-principle experimental realization is implemented.

De Martini, Francesco [Dipartimento di Fisica, dell'Universita 'La Sapienza', Roma 00185 (Italy); Accademia Nazionale dei Lincei, via della Lungara 10, Roma 00165 (Italy); Giovannetti, Vittorio [NEST-CNR-INFM and Scuola Normale Superiore, Piazza dei Cavalieri 7, 56126 Pisa (Italy); Lloyd, Seth [MIT, RLE, and Department of Mechanical Engineering, MIT 3-160, 77 Massachusetts Avenue, Cambridge, Massachusetts 02139 (United States); Maccone, Lorenzo [Institute for Scientific Interchange, 10133 Torino (Italy); QUIT, Dip. Fisica A. Volta, 27100 Pavia (Italy); Nagali, Eleonora; Sansoni, Linda; Sciarrino, Fabio [Dipartimento di Fisica, dell'Universita 'La Sapienza', Roma 00185 (Italy)

2009-07-15T23:59:59.000Z

231

Linear Collider Collaboration Tech Notes  

NLE Websites -- All DOE Office Websites (Extended Search)

0 0 April 2001 Rev.1 July 2003 Guide to LIBXSIF, a Library for Parsing the Extended Standard Input Format of Accelerated Beamlines Peter G. Tenenbaum Stanford Linear Accelerator Center Stanford University Stanford, CA Abstract: We describe LIBXSIF, a standalone library for parsing the Extended Standard Input Format of accelerator beamlines. Included in the description are: documentation of user commands; full description of permitted accelerator elements and their attributes; the construction of beamline lists; the mechanics of adding LIBXSIF to an existing program; and "under the hood" details for users who wish to modify the library or are merely morbidly curious. Guide to LIBXSIF, a Library for Parsing the Extended Standard Input Format of

232

Portable Linear Accelerator Development  

Science Conference Proceedings (OSTI)

This report describes Minac-3, a miniaturized linear accelerator system. It covers the current equipment capabilities and achievable modifications, applications information for prospective users, and technical information on high-energy radiography that is useful for familiarization and planning. The design basis, development, and applications history of Minac are also summarized.

1982-12-01T23:59:59.000Z

233

Automatic stability checking for large linear analog integrated circuits  

Science Conference Proceedings (OSTI)

Stability analysis is one of the key challenges in the design of large linear analog circuits with complex multi-loop structures. In this paper, we present an efficient loop finder algorithm to identify potentially unstable loops in such circuits. At ... Keywords: analog circuit design, eigenvalue problem, model order reduction, small-signal analysis, stability analysis

Parijat Mukherjee; G. Peter Fang; Rod Burt; Peng Li

2011-06-01T23:59:59.000Z

234

The synthesis of structure-changing programs  

Science Conference Proceedings (OSTI)

Deductive techniques are presented for deriving programs systematically from given specifications. The specifications express the purpose of the desired program without giving any hint of the algorithm to be employed. The desired program is intended ...

Zohar Manna; Richard Waldinger

1978-05-01T23:59:59.000Z

235

Piecewise linear car-following modeling  

E-Print Network (OSTI)

We present a traffic model which extends the linear car-following model as well as the min-plus traffic model (a model based on the min-plus algebra). A discrete-time car-dynamics describing the traffic on a 1-lane road without passing is interpreted as a dynamic programming equation of a stochastic optimal control problem of a Markov chain. This variational formulation permits to characterize the stability of the car-dynamics and to calculte the stationary regimes when they exist. The model is based on a piecewise linear approximation of the fundamental traffic diagram.

Farhi, Nadir

2011-01-01T23:59:59.000Z

236

Smoothing Problems in a Bayesian Framework and Their Linear Gaussian Solutions  

Science Conference Proceedings (OSTI)

Smoothers are increasingly used in geophysics. Several linear Gaussian algorithms exist, and the general picture may appear somewhat confusing. This paper attempts to stand back a little, in order to clarify this picture by providing a concise ...

Emmanuel Cosme; Jacques Verron; Pierre Brasseur; Jacques Blum; Didier Auroux

2012-02-01T23:59:59.000Z

237

Synthesis of quantized feedback control software for discrete time linear hybrid systems  

Science Conference Proceedings (OSTI)

We present an algorithm that given a Discrete Time Linear Hybrid System${\\cal H}$ returns a correct-by-construction software implementation K for a (near time optimal) robust quantized feedback controller for ${\\cal H}$ along with ...

Federico Mari; Igor Melatti; Ivano Salvo; Enrico Tronci

2010-07-01T23:59:59.000Z

238

Exceptional situations and program reliability  

Science Conference Proceedings (OSTI)

It is difficult to write programs that behave correctly in the presence of run-time errors. Proper behavior in the face of exceptional situations is important to the reliability of long-running programs. Existing programming language features often provide ... Keywords: Error handling, compensating transactions, linear sagas, linear types, resource management

Westley Weimer; George C. Necula

2008-03-01T23:59:59.000Z

239

Cryptographic Hash Algorithm Competition  

Science Conference Proceedings (OSTI)

... NIST opened a public competition on November 2, 2007 to develop a new cryptographic hash algorithm, which converts a variable length message ...

2013-08-01T23:59:59.000Z

240

Algorithms for Marketing-Mix Optimization  

E-Print Network (OSTI)

Algorithms for determining quality/cost/price tradeoffs in saturated markets are considered. A product is modeled by $d$ real-valued qualities whose sum determines the unit cost of producing the product. This leads to the following optimization problem: given a set of $n$ customers, each of whom has certain minimum quality requirements and a maximum price they are willing to pay, design a new product and select a price for that product in order to maximize the resulting profit. An $O(n\\log n)$ time algorithm is given for the case, $d=1$, of linear products, and $O(n(\\log n)^{d+1})$ time approximation algorithms are given for products with any constant number, $d$, of qualities. To achieve the latter result, an $O(nk^{d-1})$ bound on the complexity of an arrangement of homothetic simplices in $\\R^d$ is given, where $k$ is the maximum number of simplices that all contain a single points.

Gudmundsson, Joachim; Smid, Michiel

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


241

Efficient scalable algorithms for hierarchically semiseparable matrices  

SciTech Connect

Hierarchically semiseparable (HSS) matrix algorithms are emerging techniques in constructing the superfast direct solvers for both dense and sparse linear systems. Here, we develope a set of novel parallel algorithms for the key HSS operations that are used for solving large linear systems. These include the parallel rank-revealing QR factorization, the HSS constructions with hierarchical compression, the ULV HSS factorization, and the HSS solutions. The HSS tree based parallelism is fully exploited at the coarse level. The BLACS and ScaLAPACK libraries are used to facilitate the parallel dense kernel operations at the ne-grained level. We have appplied our new parallel HSS-embedded multifrontal solver to the anisotropic Helmholtz equations for seismic imaging, and were able to solve a linear system with 6.4 billion unknowns using 4096 processors, in about 20 minutes. The classical multifrontal solver simply failed due to high demand of memory. To our knowledge, this is the first successful demonstration of employing the HSS algorithms in solving the truly large-scale real-world problems. Our parallel strategies can be easily adapted to the parallelization of the other rank structured methods.

Wang, Shen; Xia, Jianlin; Situ, Yingchong; Hoop, Maarten V. de

2011-09-14T23:59:59.000Z

242

The TESLA superconducting linear collider  

Science Conference Proceedings (OSTI)

This paper summarizes the present status of the studies for a superconducting Linear Collider (TESLA).

R. Brinkmann; the TESLA Collaboration

1997-01-01T23:59:59.000Z

243

Expressing graph algorithms using generalized active messages  

Science Conference Proceedings (OSTI)

Recently, graph computation has emerged as an important class of high-performance computing application whose characteristics differ markedly from those of traditional, compute-bound, kernels. Libraries such as BLAS, LAPACK, and others have been successful ... Keywords: active messages, parallel graph algorithms, parallel programming models

Nick Edmonds; Jeremiah Willcock; Andrew Lumsdaine

2013-08-01T23:59:59.000Z

244

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

Science Conference Proceedings (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

245

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

246

Confirming the Lanchestrian linear-logarithmic model of attrition  

Science Conference Proceedings (OSTI)

This paper is the fourth in a series of reports on the breakthrough research in historical validation of attrition in conflict. Significant defense policy decisions, including weapons acquisition and arms reduction, are based in part on models of conflict. Most of these models are driven by their attrition algorithms, usually forms of the Lanchester square and linear laws. None of these algorithms have been validated. The results of this paper confirm the results of earlier papers, using a large database of historical results. The homogeneous linear-logarithmic Lanchestrian attrition model is validated to the extent possible with current initial and final force size data and is consistent with the Iwo Jima data. A particular differential linear-logarithmic model is described that fits the data very well. A version of Helmbold's victory predicting parameter is also confirmed, with an associated probability function. 37 refs., 73 figs., 68 tabs.

Hartley, D.S. III.

1990-12-01T23:59:59.000Z

247

Linear Solar Models  

E-Print Network (OSTI)

We present a new approach to study the properties of the sun. We consider small variations of the physical and chemical properties of the sun with respect to Standard Solar Model predictions and we linearize the structure equations to relate them to the properties of the solar plasma. By assuming that the (variation of) the present solar composition can be estimated from the (variation of) the nuclear reaction rates and elemental diffusion efficiency in the present sun, we obtain a linear system of ordinary differential equations which can be used to calculate the response of the sun to an arbitrary modification of the input parameters (opacity, cross sections, etc.). This new approach is intended to be a complement to the traditional methods for solar model calculation and allows to investigate in a more efficient and transparent way the role of parameters and assumptions in solar model construction. We verify that these Linear Solar Models recover the predictions of the traditional solar models with an high...

Villante, F L

2009-01-01T23:59:59.000Z

248

Brief paper: Suboptimal control of linear stochastic multivariable systems with unknown parameters  

Science Conference Proceedings (OSTI)

An algorithm is proposed for suboptimal control of linear multivariable systems with unknown parameters and output noise covariances. This algorithm is based on the idea of explicitly separating the functions of identification, estimation and control. ... Keywords: Kalman filters, Multivariable control systems, canonical forms, controllability, discrete time systems, observability, parameter estimation, state estimation, state space methods, stochastic control

H. El-Sherief; N. K. Sinha

1982-01-01T23:59:59.000Z

249

Genetic Programs Constructed from Layered Logic Gates in Single Cells  

E-Print Network (OSTI)

Genetic programs function to integrate environmental sensors, implement signal processing algorithms and control expression dynamics[1]. These programs consist of integrated genetic circuits that individually implement ...

Moon, Tae Seok

250

Designing Effective Algorithm Visualizations  

E-Print Network (OSTI)

Advances in computing technology and the aordability of software and high-performance graphics hardware enabled rapid growth of visual tools. Today, not only very expensive workstations, but also low-cost PCs are capable of running computationally demanding visualization systems. Algorithm visualizations or the graphic depiction of algorithms in execution have been used in explaining, designing and analyzing algorithms since the early 1980s. Although many tools have been developed over the past twenty years, not enough attention has been paid to the analysis of users, their needs, tasks, and goals. This paper provides an overview of algorithm visualization techniques, based on the premise that a rethinking of algorithm animation design is required in order to harness its power for enhancing learning. More information about the topic can be found on the author's web page. 1

Sami Khuri

2001-01-01T23:59:59.000Z

251

Algorithms to Automate LCLS Undulator Tuning  

Science Conference Proceedings (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

252

Motif Discovery Using Evolutionary Algorithms  

Science Conference Proceedings (OSTI)

The bacterial foraging optimization (BFO) algorithm is a nature and biologically inspired computing method. We propose an alternative solution integrating bacterial foraging optimization algorithm and tabu search (TS) algorithm namely TS-BFO. We modify ...

Linlin Shao; Yuehui Chen; Ajith Abraham

2009-12-01T23:59:59.000Z

253

Statistics of voltage drop in radial distribution circuits: a dynamic programming approach  

E-Print Network (OSTI)

We analyze a power distribution line with high penetration of distributed generation and strong variations of power consumption and generation levels. In the presence of uncertainty the statistical description of the system is required to assess the risks of power outages. In order to find the probability of exceeding the constraints for voltage levels we introduce the probability distribution of maximal voltage drop and propose an algorithm for finding this distribution. The algorithm is based on the assumption of random but statistically independent distribution of loads on buses. Linear complexity in the number of buses is achieved through the dynamic programming technique. We illustrate the performance of the algorithm by analyzing a simple 4-bus system with high variations of load levels.

Turitsyn, Konstantin S

2010-01-01T23:59:59.000Z

254

Piecewise Linear Modeling and Analysis  

Science Conference Proceedings (OSTI)

From the Publisher:Piecewise Linear Modeling and Analysis explains in detail all possible model descriptions to efficiently store piecewise linear functions starting with the Chua descriptions. Detailed explanation on how the model parameter can be obtained ...

Domine M. W. Leenaerts; Wim M. Van Bokhoven

1998-07-01T23:59:59.000Z

255

History of Proton Linear Accelerators  

DOE R&D Accomplishments (OSTI)

Some personal recollections are presented that relate to the author`s experience developing linear accelerators, particularly for protons. (LEW)

Alvarez, L. W.

1987-01-00T23:59:59.000Z

256

HEAVY ION LINEAR ACCELERATOR  

DOE Patents (OSTI)

A linear accelerator of heavy ions is described. The basic contributions of the invention consist of a method and apparatus for obtaining high energy particles of an element with an increased charge-to-mass ratio. The method comprises the steps of ionizing the atoms of an element, accelerating the resultant ions to an energy substantially equal to one Mev per nucleon, stripping orbital electrons from the accelerated ions by passing the ions through a curtain of elemental vapor disposed transversely of the path of the ions to provide a second charge-to-mass ratio, and finally accelerating the resultant stripped ions to a final energy of at least ten Mev per nucleon.

Van Atta, C.M.; Beringer, R.; Smith, L.

1959-01-01T23:59:59.000Z

257

ACME algorithms for contact in a multiphysics environment API version 2.2.  

Science Conference Proceedings (OSTI)

An effort is underway at Sandia National Laboratories to develop a library of algorithms to search for potential interactions between surfaces represented by analytic and discretized topological entities. This effort is also developing algorithms to determine forces due to these interactions for transient dynamics applications. This document describes the Application Programming Interface (API) for the ACME (Algorithms for Contact in a Multiphysics Environment) library.

Heinstein, Martin Wilhelm; Glass, Micheal W.; Gullerud, Arne S.; Brown, Kevin H.; Voth, Thomas Eugene; Jones, Reese E.

2004-07-01T23:59:59.000Z

258

Nonlinear Multichannel Algorithms for Estimating Sea Surface Temperature with AVHRR Satellite Data  

Science Conference Proceedings (OSTI)

The familiar linear multichannel sea surface temperature algorithms (MCSST) for estimating sea surface temperature with AVHRR satellite data describe the solution in terms of a constant gamma parameter multiplied by the measured brightness ...

Charles C. Walton

1988-02-01T23:59:59.000Z

259

Comparison of control algorithms for a MEMS-based adaptive optics scanning laser ophthalmoscope  

Science Conference Proceedings (OSTI)

We compared four algorithms for controlling a MEMS deformable mirror of an adaptive optics (AO) scanning laser ophthalmoscope. Interferometer measurements of the static nonlinear response of the deformable mirror were used to form an equivalent linear ...

Kaccie Y. Li; Sandipan Mishra; Pavan Tiruveedhula; Austin Roorda

2009-06-01T23:59:59.000Z

260

Comparison of Two Satellite-based Rainfall Algorithms Using Pacific Atoll Raingage Data  

Science Conference Proceedings (OSTI)

Rainfall estimates for two simple satellite-based rainfall algorithms are verified over the tropical Pacific using a new method that incorporates sparsely distributed raingages. The resulting linear regression relationship between monthly areal ...

Mark L. Morrissey; J. Scott Greene

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


261

Phase and amplitude detection system for the Stanford Linear Accelerator  

Science Conference Proceedings (OSTI)

A computer controlled phase and amplitude detection system to measure and stabilize the rf power sources in the Stanford Linear Accelerator is described. This system measures the instantaneous phase and amplitude of a 1 microsecond 2856 MHz rf pulse and will be used for phase feedback control and for amplitude and phase jitter detection. This paper discusses the measurement system performance requirements for the operation of the Stanford Linear Collider, and the design and implementation of the phase and amplitude detection system. The fundamental software algorithms used in the measurement are described, as is the performance of the prototype phase and amplitude detector system.

Fox, J.D.; Schwarz, H.D.

1983-01-01T23:59:59.000Z

262

Efficient algorithms for pattern matching with general gaps, character classes, and transposition invariance  

Science Conference Proceedings (OSTI)

We develop efficient dynamic programming algorithms for pattern matching with general gaps and character classes. We consider patterns of the form p 0 g( Keywords: Bounded length gaps, Character classes, Sparse dynamic programming, String matching, Transposition invariance

Kimmo Fredriksson; Szymon Grabowski

2008-08-01T23:59:59.000Z

263

Linear induction pump  

DOE Patents (OSTI)

Electromagnetic linear induction pump for liquid metal which includes a unitary pump duct. The duct comprises two substantially flat parallel spaced-apart wall members, one being located above the other and two parallel opposing side members interconnecting the wall members. Located within the duct are a plurality of web members interconnecting the wall members and extending parallel to the side members whereby the wall members, side members and web members define a plurality of fluid passageways, each of the fluid passageways having substantially the same cross-sectional flow area. Attached to an outer surface of each side member is an electrically conductive end bar for the passage of an induced current therethrough. A multi-phase, electrical stator is located adjacent each of the wall members. The duct, stators, and end bars are enclosed in a housing which is provided with an inlet and outlet in fluid communication with opposite ends of the fluid passageways in the pump duct. In accordance with a preferred embodiment, the inlet and outlet includes a transition means which provides for a transition from a round cross-sectional flow path to a substantially rectangular cross-sectional flow path defined by the pump duct.

Meisner, John W. (Newbury Park, CA); Moore, Robert M. (Canoga Park, CA); Bienvenue, Louis L. (Chatsworth, CA)

1985-03-19T23:59:59.000Z

264

Berkeley Proton Linear Accelerator  

DOE R&D Accomplishments (OSTI)

A linear accelerator, which increases the energy of protons from a 4 Mev Van de Graaff injector, to a final energy of 31.5 Mev, has been constructed. The accelerator consists of a cavity 40 feet long and 39 inches in diameter, excited at resonance in a longitudinal electric mode with a radio-frequency power of about 2.2 x 10{sup 6} watts peak at 202.5 mc. Acceleration is made possible by the introduction of 46 axial "drift tubes" into the cavity, which is designed such that the particles traverse the distance between the centers of successive tubes in one cycle of the r.f. power. The protons are longitudinally stable as in the synchrotron, and are stabilized transversely by the action of converging fields produced by focusing grids. The electrical cavity is constructed like an inverted airplane fuselage and is supported in a vacuum tank. Power is supplied by 9 high powered oscillators fed from a pulse generator of the artificial transmission line type.

Alvarez, L. W.; Bradner, H.; Franck, J.; Gordon, H.; Gow, J. D.; Marshall, L. C.; Oppenheimer, F. F.; Panofsky, W. K. H.; Richman, C.; Woodyard, J. R.

1953-10-13T23:59:59.000Z

265

Linear Collider Physics Resource Book Snowmass 2001  

Science Conference Proceedings (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

266

An environment to improve programming education  

Science Conference Proceedings (OSTI)

Computer Programming learning is a difficult process. Experience has demonstrated that many students find difficult to use programming languages to write programs to solve problems. Student failure and commonly expressed difficulties in programming disciplines ... Keywords: algorithm animation, educational technology, learning styles, programming teaching and learning, software visualization

Anabela Gomes; António José Mendes

2007-06-01T23:59:59.000Z

267

An integrated approach to algorithmic design and environmental analysis  

Science Conference Proceedings (OSTI)

This paper describes the motivation and design of DesignScript, an end-user domain-specific programming language for algorithmic architectural and geometric design. Furthermore, the integration and use of DesignScript within the context of an environmental ... Keywords: design computation, end-user programming, environmental analysis, geometric modelling

Robert Aish; Andrew Marsh

2011-04-01T23:59:59.000Z

268

Experimental evaluation of a generic abstract interpretation algorithm for PROLOG  

Science Conference Proceedings (OSTI)

Abstract interpretation of PROLOG programs has attracted many researchers in recent years, partly because of the potential for optimization in PROLOG compilers and partly because of the declarative nature of logic programming languages that make them ... Keywords: PROLOG, abstract interpretation, fixpoint algorithm

Baudouin Le Charlier; Pascal Van Hentenryck

1994-01-01T23:59:59.000Z

269

Assignment #1: Developing Algorithms  

E-Print Network (OSTI)

The purpose of this assignment is to give you some experience developing algorithms. According to Wikipedia, an algorithm is “a finite list of well-defined instructions for accomplishing some task that, given an initial state, will terminate in a defined end-state ” [1]. 1. Consider the following initial state: • A bag containing sliced bread • A jar containing peanut butter • A jar containing jelly • A plastic knife Develop an algorithm for producing, as an end-state, a peanut butter and jelly sandwich. Be as precise as possible when developing your list of instructions. 2 Hand-In Instructions The assignment is due at the start of class on August 27 th. You are required to turn in a typed document. The document should include your name, your username, the date, the course number, and the assignment number. For example:

Andrew R. Dalton; Andy Dalton (adalton

2007-01-01T23:59:59.000Z

270

Programming Languages For Interactive Computing  

Science Conference Proceedings (OSTI)

Traditional programming languages are algorithmic: they are best suited to writing programs that acquire all their inputs before executing and only produce a result on termination. By contrast most applications are interactive: they maintain ongoing ... Keywords: declarative concurrency, incremental computation, interaction, interactive programming languages, modal languages, persistent computation, retroactive data structures, semantic computing, transactional concurrency

Roly Perera

2008-05-01T23:59:59.000Z

271

A Fast Algorithm in Exponential Change-Points Model with Comparison  

Science Conference Proceedings (OSTI)

The dynamic programming (DP) algorithm can be used to find an exact solution of the maximum likelihood estimation of change points in a sequence of data from exponential family. Since the algorithm has a quadratic complexity in data size n, it is computationally ... Keywords: Change points, Exponential family, Dynamic programming, Segmental K-means

Kuo-Ching Chang; Chui-liang Chiang; Chung-Bow lee

2010-12-01T23:59:59.000Z

272

Local Linear Convergence of Approximate Projections onto Regularized Sets  

E-Print Network (OSTI)

The numerical properties of algorithms for finding the intersection of sets depend to some extent on the regularity of the sets, but even more importantly on the regularity of the intersection. The alternating projection algorithm of von Neumann has been shown to converge locally at a linear rate dependent on the regularity modulus of the intersection. In many applications, however, the sets in question come from inexact measurements that are matched to idealized models. It is unlikely that any such problems in applications will enjoy metrically regular intersection, let alone set intersection. We explore a regularization strategy that generates an intersection with the desired regularity properties. The regularization, however, can lead to a significant increase in computational complexity. In a further refinement, we investigate and prove linear convergence of an approximate alternating projection algorithm. The analysis provides a regularization strategy that fits naturally with many ill-posed inverse problems, and a mathematically sound stopping criterion for extrapolated, approximate algorithms. The theory is demonstrated on the phase retrieval problem with experimental data. The conventional early termination applied in practice to unregularized, consistent problems in diffraction imaging can be justified fully in the framework of this analysis providing, for the first time, proof of convergence of alternating approximate projections for finite dimensional, consistent phase retrieval problems.

D. Russell Luke

2011-08-10T23:59:59.000Z

273

Influence of machine organization on algorithms  

SciTech Connect

A comparative analysis of the CDC STAR-100 and the ILLIAC IV for a given code is given. A large two-dimensional Lagrangian hydrodynamic model for the STAR-100 computer was programmed. Some theoretical considerations concerning execution rates are Presented. Some examples are given of where these theoretical considerations were important considerations in the design of the algorithms. Finally, several observations and opinions, many of which may be controversial but which should be considered by the programming world at large, are described. (MOW)

Owens, J.L.

1973-05-01T23:59:59.000Z

274

Linear Accelerator | Advanced Photon Source  

NLE Websites -- All DOE Office Websites (Extended Search)

electrons emitted from a cathode heated to 1100 C. The electrons are accelerated by high-voltage alternating electric fields in a linear accelerator (linac; photo below)....

275

Novel linear algebraic theory and one-hundred-million-atom electronic structure calculation on the K computer  

E-Print Network (OSTI)

A novel linear-algebraic algorithm, multiple Arnoldi method, was developed in an interdisciplinary study between physics and applied mathematics and realized one-hundred-million-atom (100-nm-scale) electronic state calculations on the K computer. The algorithms are Krylov-subspace solvers for generalized shifted linear equations and were implemented in our order-N calculation code ELSES (http://www.elses.jp/). Moreover, a method for calculating eigen states is presented as a theoretical extension.

Hoshi, Takeo; Akiyama, Yohei

2013-01-01T23:59:59.000Z

276

A three-level BDDC algorithm for Mortar discretizations  

SciTech Connect

In this paper, a three-level BDDC algorithm is developed for the solutions of large sparse algebraic linear systems arising from the mortar discretization of elliptic boundary value problems. The mortar discretization is considered on geometrically non-conforming subdomain partitions. In two-level BDDC algorithms, the coarse problem needs to be solved exactly. However, its size will increase with the increase of the number of the subdomains. To overcome this limitation, the three-level algorithm solves the coarse problem inexactly while a good rate of convergence is maintained. This is an extension of previous work, the three-level BDDC algorithms for standard finite element discretization. Estimates of the condition numbers are provided for the three-level BDDC method and numerical experiments are also discussed.

Kim, H.; Tu, X.

2007-12-09T23:59:59.000Z

277

Evaluating program analysis and testing tools with the RUGRAT random benchmark application generator  

Science Conference Proceedings (OSTI)

Benchmarks are heavily used in different areas of computer science to evaluate algorithms and tools. In program analysis and testing, open-source and commercial programs are routinely used as bench- marks to evaluate different aspects of algorithms ...

Ishtiaque Hussain; Christoph Csallner; Mark Grechanik; Chen Fu; Qing Xie; Sangmin Park; Kunal Taneja; B. M. Mainul Hossain

2012-07-01T23:59:59.000Z

278

PID control of MIMO process based on rank niching genetic algorithm  

Science Conference Proceedings (OSTI)

Non-linear multiple-input multiple-output (MIMO) processes which are common in industrial plants are characterized by significant interactions and non- linearities among their variables. Thus, tuning several controllers in complex industrial plants ... Keywords: Genetic Algorithm, Multiobjective Optimization, Multiple-input multiple-output (MIMO) process, Niching, PID control, Pareto optimality

L. V. Arruda; M. C. Swiech; M. R. Delgado; F. Neves-Jr

2008-12-01T23:59:59.000Z

279

Implementing Distributed Systems Using Linear Naming  

E-Print Network (OSTI)

Linear graph reduction is a simple computational model in which the cost of naming things is explicitly represented. The key idea is the notion of "linearity". A name is linear if it is only used once, so with linear ...

Bawden, Alan

1993-03-01T23:59:59.000Z

280

Genetic algorithms and artificial life  

Science Conference Proceedings (OSTI)

Genetic algorithms are computational models of evolution that play a central role in many artificial-life models. We review the history and current scope of research on genetic algorithms in artificial life, giving illustrative examples in which the ...

Melanie Mitchell; Stephanie Forrest

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


281

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

282

Estimating VaR in crude oil market: A novel multi-scale non-linear ensemble approach incorporating wavelet analysis and neural network  

Science Conference Proceedings (OSTI)

Facing the complicated non-linear nature of risk evolutions, current risk measurement approaches offer insufficient explanatory power and limited performance. Thus this paper proposes wavelet decomposed non-linear ensemble value at risk (WDNEVaR), a ... Keywords: C45, C53, F31, Multi-resolution analysis, Neural networks, Non-linear ensemble algorithm, Value at risk, Wavelet analysis

Kaijian He; Chi Xie; Shou Chen; Kin Keung Lai

2009-10-01T23:59:59.000Z

283

Algorithm Shootout: R versus RHMC  

E-Print Network (OSTI)

We present initial results comparing the RHMC and R algorithms on large lattices with small quark masses using chiral fermions. We also present results concerning staggered fermions near the deconfinement/chiral phase transition. We find that the RHMC algorithm not only eliminates the step-size error of the R algorithm, but is also considerably more efficient. We discuss several possibilities for further improvement to the RHMC algorithm.

M. A. Clark; Ph. de Forcrand; A. D. Kennedy

2005-09-30T23:59:59.000Z

284

Order acceptance using genetic algorithms  

Science Conference Proceedings (OSTI)

This paper uses a genetic algorithm to solve the order-acceptance problem with tardiness penalties. We compare the performance of a myopic heuristic and a genetic algorithm, both of which do job acceptance and sequencing, using an upper bound based on ... Keywords: Genetic algorithms, Order acceptance, Scheduling

Walter O. Rom; Susan A. Slotnick

2009-06-01T23:59:59.000Z

285

A penalized fuzzy clustering algorithm  

Science Conference Proceedings (OSTI)

In this paper, we propose a penalized inter-cluster separation (PICS) fuzzy clustering algorithm by adding a penalty term to the inter-cluster separation (ICS) algorithm. Numerical comparisons are made for several fuzzy clustering algorithms according ... Keywords: fuzzy c-means (FCM), fuzzy clustering, image segmentation, inter-cluster separation (ICS), magnetic resonance image (MRI), penalized ICS

Miin-Shen Yang; Wen-Liang Hung; Chia-Hsuan Chang

2006-12-01T23:59:59.000Z

286

Errors in graph embedding algorithms  

Science Conference Proceedings (OSTI)

One major area of difficulty in developing an algorithm for embedding a graph on a surface is handling bridges which have more than one possible placement. This paper addresses a number of published algorithms where this has not been handled correctly. ... Keywords: Algorithm, Graph embedding, Graph genus, Torus

Wendy Myrvold; William Kocay

2011-03-01T23:59:59.000Z

287

Fast Conversion Algorithms for Orthogonal Polynomials - Computer ...  

E-Print Network (OSTI)

Nov 13, 2008 ... a known conversion algorithm from an arbitrary orthogonal basis to the ... Fast algorithms, transposed algorithms, basis conversion, orthogonal.

288

Development of Algorithms for Decision Analysis with Interval Information  

Science Conference Proceedings (OSTI)

Multi-criteria decision analysis can be a useful tool in routing out and ranking different alternatives. However, many such analyses involve imprecise information, including estimates of utilities, outcome probabilities and criteria weights. This paper ... Keywords: Decision Analysis, Multi-Linear Programming, Optimisation, Program Efficiency

Mats Danielson; Love Ekenberg

2009-07-01T23:59:59.000Z

289

Solving large-scale sparse eigenvalue problems and linear systems of equations for accelerator modeling  

SciTech Connect

The solutions of sparse eigenvalue problems and linear systems constitute one of the key computational kernels in the discretization of partial differential equations for the modeling of linear accelerators. The computational challenges faced by existing techniques for solving those sparse eigenvalue problems and linear systems call for continuing research to improve on the algorithms so that ever increasing problem size as required by the physics application can be tackled. Under the support of this award, the filter algorithm for solving large sparse eigenvalue problems was developed at Stanford to address the computational difficulties in the previous methods with the goal to enable accelerator simulations on then the world largest unclassified supercomputer at NERSC for this class of problems. Specifically, a new method, the Hemitian skew-Hemitian splitting method, was proposed and researched as an improved method for solving linear systems with non-Hermitian positive definite and semidefinite matrices.

Gene Golub; Kwok Ko

2009-03-30T23:59:59.000Z

290

Algorithmic information theory  

E-Print Network (OSTI)

We introduce algorithmic information theory, also known as the theory of Kolmogorov complexity. We explain the main concepts of this quantitative approach to defining `information'. We discuss the extent to which Kolmogorov's and Shannon's information theory have a common purpose, and where they are fundamentally different. We indicate how recent developments within the theory allow one to formally distinguish between `structural' (meaningful) and `random' information as measured by the Kolmogorov structure function, which leads to a mathematical formalization of Occam's razor in inductive inference. We end by discussing some of the philosophical implications of the theory.

Grunwald, Peter D

2008-01-01T23:59:59.000Z

291

A normal form for linear temporal equilibrium logic  

Science Conference Proceedings (OSTI)

In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbitrary theories in the syntax of Linear Temporal Logic. It has already been shown ...

Pedro Cabalar

2010-09-01T23:59:59.000Z

292

Constructions of fault tolerant linear compressors and linear decompressors  

E-Print Network (OSTI)

Abstract — The constructions of optical buffers is one of the most critically sought after optical technologies in all-optical packet-switched networks, and constructing optical buffers directly via optical Switches and fiber Delay Lines (SDL) has received a lot of attention recently in the literature. A practical and challenging issue of the constructions of optical buffers that has not been addressed before is on the fault tolerant capability of such constructions. In this paper, we focus on the constructions of fault tolerant linear compressors and linear decompressors. The basic network element for our constructions is scaled optical memory cell, which is constructed by a 2 × 2 optical crossbar switch and a fiber delay line. We give a multistage construction of a self-routing linear compressor by a concatenation of scaled optical memory cells. We also show that if the delays, say d1, d2,..., dM, of the fibers in the scaled optical memory cells satisfy a certain condition (specifically, the condition in (A2) given in Section I), then our multistage construction can be operated as a self-routing linear compressor with maximum delay ? M?F even after up to F of the M scaled optical memory cells fail to function properly, where 0 ? F ? M ? 1. Furthermore, we prove that our multistage construction with the fiber delays d1, d2,..., dM given by the generalized Fibonacci series of order F is the best among all constructions of a linear compressor that can tolerate up to F faulty scaled optical memory cells by using M scaled optical memory cells. Similarly results are also obtained for the constructions of fault tolerant linear decompressors. I.

Cheng-shang Chang; Tsz-hsuan Chao; Jay Cheng; Duan-shin Lee

2007-01-01T23:59:59.000Z

293

Study of Proposed Internet Congestion Control Algorithms*  

Science Conference Proceedings (OSTI)

... Algorithms* Kevin L. Mills, NIST (joint ... Page 2. Study of Proposed Internet Congestion Control Algorithms – Mills et al. Innovations ...

2013-04-01T23:59:59.000Z

294

Application of a New Adjoint Newton Algorithm to the 3D ARPS Storm-Scale Model Using Simulated Data  

Science Conference Proceedings (OSTI)

The adjoint Newton algorithm (ANA) is based on the first- and second-order adjoint techniques allowing one to obtain the “Newton line search direction” by integrating a “tangent linear model” backward in time (with negative time steps). Moreover, ...

Zhi Wang; Kelvin K. Droegemeier; L. White; I. M. Navon

1997-10-01T23:59:59.000Z

295

SunShot Initiative: Linear Fresnel  

NLE Websites -- All DOE Office Websites (Extended Search)

Linear Fresnel to someone by Linear Fresnel to someone by E-mail Share SunShot Initiative: Linear Fresnel on Facebook Tweet about SunShot Initiative: Linear Fresnel on Twitter Bookmark SunShot Initiative: Linear Fresnel on Google Bookmark SunShot Initiative: Linear Fresnel on Delicious Rank SunShot Initiative: Linear Fresnel on Digg Find More places to share SunShot Initiative: Linear Fresnel on AddThis.com... Concentrating Solar Power Systems Parabolic Trough Linear Fresnel Power Tower Dish Engine Components Competitive Awards Staff Photovoltaics Systems Integration Balance of Systems Linear Fresnel DOE funds solar research and development (R&D) in linear Fresnel systems as one of four CSP technologies aiming to meet the goals of the SunShot Initiative. Linear Fresnel systems, which are a type of linear

296

Non-linear image processing  

SciTech Connect

Processing of nuclear medicine images is generally performed by essentially linear methods with the non-negativity condition being applied as the only non-linear process. The various methods used: matrix methods in signal space and Fourier or Hadamard transforms in frequency or sequency space are essentially equivalent. Further improvement in images can be obtained by the use of inherently non-linear methods. The recent development of an approximation to a least-difference method (as opposed to a least-square method) has led to an appreciation of the effects of data bounding and to the development of a more powerful process. Data bounding (modification of statistically improbable data values) is an inherently non-linear method with considerable promise. Strong bounding depending on two-dimensional least-squares fitting yields a reduction of mottling (buttermilk effect) not attainable with linear processes. A pre- bounding process removing very bad points is used to protect the strong bounding process from incorrectly modifying data points due to the weight of an extreme but yet unbounded point as the fitting area approaches it. (auth)

Bell, P.R.; Dillon, R.S.; Bell, M.R.

1976-01-01T23:59:59.000Z

297

Linear Collider Collaboration Tech Notes  

NLE Websites -- All DOE Office Websites (Extended Search)

6, 27/05/99 6, 27/05/99 Tolerances of Random RF Jitters in X-Band Main Linacs May 27, 1999 Kiyoshi KUBO KEK Tsukuba, Japan Abstract: Tracking simulations have been performed for the main linacs of an X-band linear collider. We discuss the choice of phase of the accelerating field relative to the bunches. The tolerances of the phase and the amplitude errors are studied. Tolerances of Random RF Jitters in X-Band Main Linacs K. Kubo, KEK Abstract Tracking simulations have been performed for main linacs of X-band linear collider. We discuss about choice of the phase of the accelerating field relative to the bunches. The tolerances of the phase and the amplitude errors are studied. 1 INTRODUCTION In order to preserve the low emittance through the main linacs of future linear colliders, various effects

298

LINEAR COUNT-RATE METER  

DOE Patents (OSTI)

A linear count-rate meter is designed to provide a highly linear output while receiving counting rates from one cycle per second to 100,000 cycles per second. Input pulses enter a linear discriminator and then are fed to a trigger circuit which produces positive pulses of uniform width and amplitude. The trigger circuit is connected to a one-shot multivibrator. The multivibrator output pulses have a selected width. Feedback means are provided for preventing transistor saturation in the multivibrator which improves the rise and decay times of the output pulses. The multivibrator is connected to a diode-switched, constant current metering circuit. A selected constant current is switched to an averaging circuit for each pulse received, and for a time determined by the received pulse width. The average output meter current is proportional to the product of the counting rate, the constant current, and the multivibrator output pulse width.

Henry, J.J.

1961-09-01T23:59:59.000Z

299

A semidefinite programming based polyhedral cut and price ...  

E-Print Network (OSTI)

May 17, 2004 ... A semidefinite programming based polyhedral cut and price algorithm for the maxcut problem. Kartik Krishnan (kartik ***at*** rice.edu)

300

An Application of Linear Programming Techniques to ARM Polarimetric...  

NLE Websites -- All DOE Office Websites (Extended Search)

sciencehighlights Research Highlight Detailed microphysical insights from weather radar systems are in demand within weather and climate agencies for the evaluation of...

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

An Effective Heuristic for Multistage Stochastic Linear Programming  

E-Print Network (OSTI)

May 28, 2013 ... product/service, such as seats on a single flight leg or hotel rooms for a given date. ...... Multi-stage stochastic optimization applied to energy.

302

Multi-stage Stochastic Linear Programming: Scenarios Versus Events  

E-Print Network (OSTI)

Manufacturing and service operations management, 4(3):171–207, 2002. [4] A. Berkelaar ... Multi-stage stochastic optimization applied to energy planning.

303

Efficient formal verification of bounds of linear programs  

Science Conference Proceedings (OSTI)

One of the challenging problems in the formalization of mathematics is a formal verification of numerical computations. Many theorems rely on numerical results, the verification of which is necessary for producing complete formal proofs. The formal verification ...

Alexey Solovyev; Thomas C. Hales

2011-07-01T23:59:59.000Z

304

PuLP: A Linear Programming Toolkit for Python  

E-Print Network (OSTI)

Sep 5, 2011 ... This required that PuLP be affordable, easily licensed, and ... trast to Pyomo ( section 4), another Python-based modelling language, PuLP does.

305

Efficiently finding the most parsimonious phylogenetic tree via linear programming  

Science Conference Proceedings (OSTI)

Reconstruction of phylogenetic trees is a fundamental problem in computational biology. While excellent heuristic methods are available for many variants of this problem, new advances in phylogeny inference will be required if we are to be able to continue ...

Srinath Sridhar; Fumei Lam; Guy E. Blelloch; R. Ravi; Russell Schwartz

2007-05-01T23:59:59.000Z

306

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

E-Print Network (OSTI)

the vector space Kn with its fixed standard basis. Here K is any field. Typically, L will be given to us as the row space of an r ×n-matrix. The kernel of that matrix is ...

307

Risk-Averse Two-Stage Stochastic Linear Programming: Modeling ...  

E-Print Network (OSTI)

way; here, we derive it from the property of time-consistency. For a more ..... the right hand side of (27) is the optimal value of the dual problem. Applying this ... both ?1(·) and V(·) were finite-valued, we could simply invoke standard results on.

308

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

E-Print Network (OSTI)

Included is the possibility that emissions of green- house gases will be required to ... Energy is supplied by many different technologies, including hydro power ...

309

Scheduling Smart Home Appliances Using Mixed Integer Linear Programming  

E-Print Network (OSTI)

electrical corporation to file a standard tariff with the PUC for the purchase of excess electricity from an eligible customer-generator, as defined, would require the electrical corporation to make the tariff request, and would authorize the electrical corporation to make the terms of the tariff available

Johansson, Karl Henrik

310

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

E-Print Network (OSTI)

Nov 6, 2008 ... The concept of stochastic dominance is fundamental when comparing two random variables. In particular ...... Handbook of Global Optimization.

311

A Linear Programming-Based Method for Job Shop Scheduling  

E-Print Network (OSTI)

processing on a unique subset of available resources, is a fundamental operations ...... P., editors, Handbook of Computational Intelligence in Manufacturing and ...

312

Sensitivity analysis in linear semi-infinite programming via partitions  

E-Print Network (OSTI)

... of Physics and Mathematics, UDLA, 72820 San Andrés Cholula, Puebla, Mex- ico. On leave from IMI-BAS, Sofia, Bulgaria. E-Mail: maxim.todorov@udlap.mx.

313

Swamy class of two-stage linear stochastic programming problems  

E-Print Network (OSTI)

Jul 28, 2006 ... 1 ? ? is polynomial in ?, log(??1), dimensions of the problem and a certain ..... Continuous Optimization: Current Trends and Applications, pp.

314

Multi-stage Stochastic Linear Programming: An Approach by Events  

E-Print Network (OSTI)

Jul 28, 2008 ... investor problem [4], whose objective consists of obtaining an investment policy which maximizes the utility of the ...... C05-05 from the Spanish government. References ... Multi-stage stochastic optimization applied to energy.

315

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

E-Print Network (OSTI)

Karanataka, India – 570 011. Ph: 9885430036. D.Dutta. Department of ... results of sport matches, wind speed and so on. Basically, anything that may have a.

316

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

E-Print Network (OSTI)

Abstract This work addresses the computation of free-energy differences ... Conformational free energy is also an essential notion ..... The saving in computing.

317

Two-stage allocations for stochastic linear programming games with ...  

E-Print Network (OSTI)

which include minimum cost spanning trees (Granot and Huberman 1981) as a special case. .... for all S ? 2N \\ {?}, there does not exist an allocation ? ? ZS ...... In Proceedings of the Computer Science and Statistics Seventh Symposium at.

318

An Augmented Primal-Dual Method for Linear Conic Programs  

E-Print Network (OSTI)

Apr 11, 2007 ... the form (1)) does not enter the representation of ?. In other .... A steepest descent step with line search for minimizing ˜? starting at a point ˜z = zk ? A is the same as the ..... For small ?, the fourth order term is dominated, and.

319

Linearized Functional Minimization for Inverse Modeling  

SciTech Connect

Heterogeneous aquifers typically consist of multiple lithofacies, whose spatial arrangement significantly affects flow and transport. The estimation of these lithofacies is complicated by the scarcity of data and by the lack of a clear correlation between identifiable geologic indicators and attributes. We introduce a new inverse-modeling approach to estimate both the spatial extent of hydrofacies and their properties from sparse measurements of hydraulic conductivity and hydraulic head. Our approach is to minimize a functional defined on the vectors of values of hydraulic conductivity and hydraulic head fields defined on regular grids at a user-determined resolution. This functional is constructed to (i) enforce the relationship between conductivity and heads provided by the groundwater flow equation, (ii) penalize deviations of the reconstructed fields from measurements where they are available, and (iii) penalize reconstructed fields that are not piece-wise smooth. We develop an iterative solver for this functional that exploits a local linearization of the mapping from conductivity to head. This approach provides a computationally efficient algorithm that rapidly converges to a solution. A series of numerical experiments demonstrates the robustness of our approach.

Wohlberg, Brendt [Los Alamos National Laboratory; Tartakovsky, Daniel M. [University of California, San Diego; Dentz, Marco [Institute of Environmental Assessment and Water Research, Barcelona, Spain

2012-06-21T23:59:59.000Z

320

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

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

A Study on the Application of GPC Implicit PID Algorithm in the Heat Exchanging Station Control System  

Science Conference Proceedings (OSTI)

This paper proposes a GPC (generaLized predictive control) impLicit PID control algorithm to the heat exchanging station control system, which has features of long time delay, time varying and non-Linearity. In this study, the PID control plays a main ... Keywords: GPC, ImpLicit Algorithm, PID Control, OnLine Analysis, District Heating

Lin Zhu; Yan Wu; Qi Li

2011-08-01T23:59:59.000Z

322

Image fusion algorithms for color and gray level images based on LCLS method and novel artificial neural network  

Science Conference Proceedings (OSTI)

In this paper, two neural image fusion algorithms for color and gray level images are proposed. These algorithms are based on a linearly constrained least square (LCLS) method and a novel projection recurrent artificial neural network. The theoretical ... Keywords: Image fusion, LCLS method, Neural networks, Real-time applications, Stability and convergence analysis

Alaeddin Malek; Maryam Yashtini

2010-01-01T23:59:59.000Z

323

Annual Planning Summaries: Stanford Linear Accelerator (SLAC...  

Energy.gov (U.S. Department of Energy (DOE)) Indexed Site

Stanford Linear Accelerator (SLAC) Annual Planning Summaries: Stanford Linear Accelerator (SLAC) Document(s) Available For Download January 11, 2012 2012 Annual Planning Summary...

324

Linear Circuits Designation: Required course  

E-Print Network (OSTI)

circuits. Node and mesh analysis. Operational amplifiers. Signal acquisition and conditioning. Electric, 11k). Objective 4: To acquaint students with the rudiments of electrical-to-mechanical energy) Steady-state and dynamic behavior of linear, lumped-parameter electrical circuits. Kirchoff's laws. RLC

Krstic, Miroslav

325

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

326

Linear electric field mass spectrometry  

DOE Patents (OSTI)

A mass spectrometer and methods for mass spectrometry. 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.

McComas, David J. (Los Alamos, NM); Nordholt, Jane E. (Los Alamos, NM)

1992-01-01T23:59:59.000Z

327

Linear electric field mass spectrometry  

DOE Patents (OSTI)

A mass spectrometer is described having a low weight and low power requirement, for use in space. It can be used to analyze the ionized particles in the region of the spacecraft on which it is mounted. High mass resolution measurements are made by timing ions moving through a gridless cylindrically sysmetric linear electric field.

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

1991-03-29T23:59:59.000Z

328

Frequency scaling of linear super-colliders  

SciTech Connect

The development of electron-positron linear colliders in the TeV energy range will be facilitated by the development of high-power rf sources at frequencies above 2856 MHz. Present S-band technology, represented by the SLC, would require a length in excess of 50 km per linac to accelerate particles to energies above 1 TeV. By raising the rf driving frequency, the rf breakdown limit is increased, thereby allowing the length of the accelerators to be reduced. Currently available rf power sources set the realizable gradient limit in an rf linac at frequencies above S-band. This paper presents a model for the frequency scaling of linear colliders, with luminosity scaled in proportion to the square of the center-of-mass energy. Since wakefield effects are the dominant deleterious effect, a separate single-bunch simulation model is described which calculates the evolution of the beam bunch with specified wakefields, including the effects of using programmed phase positioning and Landau damping. The results presented here have been obtained for a SLAC structure, scaled in proportion to wavelength.

Mondelli, A.; Chernin, D.; Drobot, A.; Reiser, M.; Granatstein, V.

1986-06-01T23:59:59.000Z

329

An optimal coarse-grained arc consistency algorithm  

Science Conference Proceedings (OSTI)

The use of constraint propagation is the main feature of any constraint solver. It is thus of prime importance to manage the propagation in an efficient and effective fashion. There are two classes of propagation algorithms for general constraints: fine-grained ... Keywords: Arc consistency, Constraint networks, Constraint programming systems, Non-binary constraints, Path consistency

Christian Bessière; Jean-Charles Régin; Roland H. C. Yap; Yuanlin Zhang

2005-07-01T23:59:59.000Z

330

A parallel hybrid optimization algorithm for fitting interatomic potentials  

Science Conference Proceedings (OSTI)

In this work we present the parallel implementation of a hybrid global optimization algorithm assembled specifically to tackle a class of time consuming interatomic potential fitting problems. The resulting objective function is characterized by large ... Keywords: Cluster programming, Hybrid global optimization, Interatomic potential, Irregular task parallelism, Multidimensional search, Particle swarm

C. Voglis, P. E. Hadjidoukas, D. G. Papageorgiou, I. E. Lagaris

2013-12-01T23:59:59.000Z

331

Automatic discovery of algorithms for multi-agent systems  

Science Conference Proceedings (OSTI)

Automatic algorithm generation for large-scale distributed systems is one of the holy grails of artificial intelligence and agent-based modeling. It has direct applicability in future engineered (embedded) systems, such as mesh networks of sensors and ... Keywords: genetic programming

Sjors van Berkel; Daniel Turi; Andrei Pruteanu; Stefan Dulman

2012-07-01T23:59:59.000Z

332

Electrical load management in smart homes using evolutionary algorithms  

Science Conference Proceedings (OSTI)

In this paper, we focus on a real world scenario of energy management of a smart home. External variable signals, reflecting the low voltage grid's state, are used to address the challenge of balancing energy demand and supply. The problem is formulated ... Keywords: energy management, evolutionary algorithms, nonlinear integer program

Florian Allerding; Marc Premm; Pradyumn Kumar Shukla; Hartmut Schmeck

2012-04-01T23:59:59.000Z

333

Simulation of Mobile Wireless Networks with Accurate Modelling of Non-linear Battery Effects  

E-Print Network (OSTI)

For the simulation of protocols and algorithms of mobile devices, an ideal energy source, i.e. a battery with linear charge and discharge characteristics, is often assumed. However, real batteries like lithium-ion cells show nonlinear behavior, taking Rate Capacity Effect and Recovery Effect into account. The battery model presented by Rakhmatov and Vrudhula models non-linear battery behavior and can be utilized for lifetime optimization strategies since it provides a formal cost metric. A drawback of this lifetime optimization algorithm is that the load profile of the battery has to be known completely in advance. An estimation of battery lifetime at simulation runtime is not feasible. We present an algorithm for a runtime estimation of battery lifetime of lithium-ion cells. Our algorithm allows the integration of a non-linear battery model into network simulation environments for mobile devices. As an example, we describe the integration of our algorithm for battery lifetime estimation into a popular network simulation tool.

D. Timmermann

2003-01-01T23:59:59.000Z

334

Design of robust fuzzy logic controllers for complex non-linear processes with time delay  

Science Conference Proceedings (OSTI)

The progress of industrial applications of fuzzy logic controllers (FLCs) for high performance control of complex, non-linear, time-varying processes, sets demands for their design - to be laid on theoretical grounds, to be general and simple, to bind ... Keywords: PI-like FLC design, frequency domain, robust performance, time delay, tuning algorithm

Snejana Yordanova

2009-02-01T23:59:59.000Z

335

Online learning of single-and multivalued functions with an infinite mixture of linear experts  

Science Conference Proceedings (OSTI)

We present a supervised learning algorithm for estimation of generic input-output relations in a real-time, online fashion. The proposed method is based on a generalized expectation-maximization approach to fit an infinite mixture of linear experts IMLE ...

Bruno Damas, José Santos-Victor

2013-11-01T23:59:59.000Z

336

DDoS attack detection method based on linear prediction model  

Science Conference Proceedings (OSTI)

Distributed denial of service (DDoS) attack is one of the major threats to the current Internet. The IP Flow feature value (FFV) algorithm is proposed based on the essential features of DDoS attacks, such as the abrupt traffic change, flow dissymmetry, ... Keywords: ARMA model, attack features, distributed denial of service, linear prediction, network security

Jieren Cheng; Jianping Yin; Chengkun Wu; Boyun Zhang; Yun Liu

2009-09-01T23:59:59.000Z

337

SuperLU_DIST: A scalable distributed-memory sparse direct solver for unsymmetric linear systems  

Science Conference Proceedings (OSTI)

We present the main algorithmic features in the software package SuperLU_DIST, a distributed-memory sparse direct solver for large sets of linear equations. We give in detail our parallelization strategies, with a focus on scalability issues, and demonstrate ... Keywords: Sparse direct solver, distributed-memory computers, parallelism, scalability, supernodal factorization

Xiaoye S. Li; James W. Demmel

2003-06-01T23:59:59.000Z

338

A multivariate linear regression analysis using finite mixtures of t distributions  

Science Conference Proceedings (OSTI)

Recently, finite mixture models have been used to model the distribution of the error terms in multivariate linear regression analysis. In particular, Gaussian mixture models have been employed. A novel approach that assumes that the error terms follow ... Keywords: EM algorithm, Maximum likelihood, Model identifiability, Non-normal error distribution, Unobserved heterogeneity

Giuliano Galimberti, Gabriele Soffritti

2014-03-01T23:59:59.000Z

339

Physics and technology of the Next Linear Collider  

E-Print Network (OSTI)

We present the current expectations for the design and physics program of an e+e- linear collider of center of mass energy 500 GeV -- 1 TeV. We review the experiments that would be carried out at this facility and demonstrate its key role in exploring physics beyond the Standard Model over the full range of theoretical possibilities. We then show the feasibility of constructing this machine, by reviewing the current status of linear collider technology and by presenting a precis of our `zeroth- order' design.

Kuhlman, S; Aiello, R; Akemoto, M; Alley, R; Assmann, R W; Baer, Howard W; Baltay, C; Bane, Karl Leopold Freitag; Barakat, B; Barker, A; Barklow, Timothy L; Barletta, W A; Bauer, D A; Bertolini, L R; Bharadwaj, V K; Bogart, J R; Bowden, G B; Bower, G; Brau, J E; Breidenbach, M; Brown, K L; Burke, D L; Burrows, P N; Byrd, J M; Cai, Y; Caryotakis, G; Cassel, R L; Chattopadhyay, S; Chen, P; Clark, S L; Cleaver, G B; Clem, D; Clendenin, J E; Corlett, J N; Corvin, C; Couture, G; Cuypers, F; Danielson, M; Deadrick, F J; Decker, Franz Josef; Donaldson, A R; Dragt, A J; Dubois, R; Early, R A; Ecklund, S D; Eichner, J; Einhorn, Martin B; Emma, P; Eppley, K R; Eriksson, L; Fahey, S; Farkas, Z D; Fawley, W M; Feng, J L; Fero, M J; Fisher, A S; Foundoulis, C; Fowkes, W R; Frey, R E; Frisch, J; Fuller, R W; Furman, M A; Genova, L F; Gintner, M; Giordano, G; Gluckstern, R L; Godfrey, S; Gold, S; Goluboff, M; Gross, G; Gunion, J F; Haber, Howard E; Han, T; Hanna, S; Hartman, S; Heifets, S A; Helm, R H; Hendrickson, L; Henestroza, E; Hertzbach, S S; Heusch, C A; Hewett, J L; Higashi, K; Higo, T; Hoag, H A; Hodgson, J; Hollebeek, R J; Holt, J A; Houck, T L; Humphrey, J W; Humphrey, R; Irwin, J; Jackson, A; Jacobsen, R A; Jaros, J A; Jobe, R Keith; Jones, R M; Kalyniak, P A; Kane, G L; Keller, L P; Kim, K J; Klem, D E; Ko, K; Koontz, R F; Kraft, E; Krejcik, P; Kroll, N M; Kubo, K; Kulikov, A; Lavine, T L; Li, H; Li, Z; Lidia, S M; Linebarger, W A; Loew, G A; Loewen, R J; Maeshima, K; Manly, S L; Marciano, W J; Markiewicz, T W; Maruyama, T; Mattison, T S; McDonald, K F; McKee, B; Messner, R; Meyerhofer, D D; Miller, R H; Minkowski, Peter; Minty, Michiko G; Moshammer, W; Munro, M H; Munroe, R; Murayama, H; Nantista, C D; Nauenberg, U; Nelson, E M; Nelson, H; Nelson, W R; Ng, C K; Nosochkov, Yu M; Ohgaki, T; Oide, K; Paige, Frank E; Palmer, D; Palmer, R B; Paterson, J M; Pearson, C; Perry, M; Peskin, Michael E; Phillips, R M; Phinney, N; Pope, R S; Raja, R; Raubenheimer, T O; Reginato, L; Rifkin, J; Riles, K; Rimmer, R A; Rinolfi, Louis; Rizzo, T; Robin, D; Rokni, S H; Ronan, Michael T; Rosenzweig, J; Ross, M C; Rowson, P C; Ruland, R E; Ruth, Ronald D; Saab, A; Sawyer, L; Schumm, B; Schwarz, H; Scott, B; Sessler, Andrew M; Sheppard, J C; Shoaee, H; Smith, S; Spence, W L; Spencer, C M; Spencer, J E; Sprehn, D; Strom, D; Stupakov, G; Takahashi, T; Tanaka, K; Tang, H; Tantawi, S G; Tata, Xerxes; Telnov, V I; Tenenbaum, P G; Thomas, S; Thompson, K A; Tian, F; Turner, J; Usher, T; Van Bibber, K; Van Kooten, R; Vanecek, D L; Vlieks, A E; Wagner, D L; Walz, D R; Wang, J W; Ward, B F L; Weidemann, A W; Westenskow, G A; White, T; Whittum, D H; Wilson, P B; Wilson, Z; Woodley, M; Woods, M; Wudka, J; Wurtele, J S; Xie, M; Yan, Y T; Yeremian, A D; Yokoya, K; Yu, S S; Zholents, A A; Zimmermann, Frank

1996-01-01T23:59:59.000Z

340

Evaluating learning algorithms and classifiers  

Science Conference Proceedings (OSTI)

We analyse 18 evaluation methods for learning algorithms and classifiers, and show how to categorise these methods with the help of an evaluation method taxonomy based on several criteria. We also define a formal framework that make it possible to describe ... Keywords: classification, classifiers, evaluation methods, learning algorithms, supervised learning, taxonomy

Niklas Lavesson; Paul Davidsson

2007-04-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

FINANCIAL FORECASTING USING GENETIC ALGORITHMS  

E-Print Network (OSTI)

predecessors to forecast stock prices and manage portfolios for approximately 3 years.) We examineFINANCIAL FORECASTING USING GENETIC ALGORITHMS SAM MAHFOUD and GANESH MANI LBS Capital Management entitled Genetic Algorithms for Inductive Learning). Time-series forecasting is a special type

Boetticher, Gary D.

342

A heuristic algorithm for pattern identification in large multivariate analysis of geophysical data sets  

Science Conference Proceedings (OSTI)

This paper aims to present a heuristic algorithm with factor analysis and a local search optimization system for pattern identification problems as applied to large and multivariate aero-geophysical data. The algorithm was developed in MATLAB code using ... Keywords: Aero-geophysical data, Factor analysis, Local search system, MATLAB program, Patterns identification

João Eduardo da Silva Pereira; Adelir José Strieder; Janete Pereira Amador; José Luiz Silvério da Silva; Leônidas Luiz Volcato Descovi Filho

2010-01-01T23:59:59.000Z

343

A genetic algorithm for the simultaneous delivery and pickup problems with time window  

Science Conference Proceedings (OSTI)

This paper concerns a Simultaneous Delivery and Pickup Problem with Time Windows (SDPPTW). A mixed binary integer programming model was developed for the problem and was validated. Due to its NP nature, a co-evolution genetic algorithm with variants ... Keywords: Bi-directional logistics, Co-evolution genetic algorithm, Simultaneous delivery and pickup, Vehicle routing problem with time windows

Hsiao-Fan Wang; Ying-Yen Chen

2012-02-01T23:59:59.000Z

344

Model and algorithm of fuzzy joint replenishment problem under credibility measure on fuzzy goal  

Science Conference Proceedings (OSTI)

The joint replenishment problem (JRP) has received considerable attention and all of the work on JRP is under explicit environment. In fact, the decision makers often have to face vague operational conditions. In this paper, a novel JRP model with fuzzy ... Keywords: Dependent-chance programming, Differential evolution algorithm, Fuzzy simulation, Hybrid intelligent algorithm, Joint replenishment

Lin Wang; Qing-Liang Fu; Chi-Guhn Lee; Yu-Rong Zeng

2013-02-01T23:59:59.000Z

345

Models and algorithms for a multilevel control system of primary oil refinery installations  

Science Conference Proceedings (OSTI)

Algorithms and mathematical models for the technological process of primary oil refinery operating in the uncertain conditions are developed; the solution of the optimal control problem in the form of stochastic programming with probabilistic characteristics ...

I. A. Guseinov; E. A. Melikov; N. A. Khanbutaeva; I. R. Efendiev

2012-02-01T23:59:59.000Z

346

Distinguishing Aerosols from Clouds in Global, Multispectral Satellite Data with Automated Cloud Classification Algorithms  

Science Conference Proceedings (OSTI)

A new approach is presented to distinguish between clouds and heavy aerosols with automated cloud classification algorithms developed for the National Polar-orbiting Operational Environmental Satellite System (NPOESS) program. These new ...

Keith D. Hutchison; Barbara D. Iisager; Thomas J. Kopp; John M. Jackson

2008-04-01T23:59:59.000Z

347

Solving Fuzzy Linear Regression with Hybrid Optimization  

Science Conference Proceedings (OSTI)

Fuzzy linear regression is an important tool to find the linear inexact relationship between uncertain data. We then propose a hybrid optimization method based on tabu search and harmony search as a potential way of solving fuzzy linear regression. The ... Keywords: Fuzzy linear regression, Harmony search, Hybrid optimization, Tabu search

M. H. Mashinchi; M. A. Orgun; M. Mashinchi

2009-12-01T23:59:59.000Z

348

Brief Linear MPC with optimal prioritized infeasibility handling: application, computational issues and stability  

Science Conference Proceedings (OSTI)

All practical MPC implementations should have a means to recover from infeasibility. We present a recently developed infeasibility handler which computes optimal relaxations of the relaxable constraints subject to a user-defined prioritization, by solving ... Keywords: Infeasibility handling, Linear programming, Linear systems, Model-based control

Jostein Vada; Olav Slupphaug; Tor A. Johansen; Bjarne A. Foss

2001-11-01T23:59:59.000Z

349

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

350

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

351

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

352

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

353

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)

354

The Computational Physics Program of the national MFE Computer Center  

Science Conference Proceedings (OSTI)

Since June 1974, the MFE Computer Center has been engaged in a significant computational physics effort. The principal objective of the Computational Physics Group is to develop advanced numerical models for the investigation of plasma phenomena and the simulation of present and future magnetic confinement devices. Another major objective of the group is to develop efficient algorithms and programming techniques for current and future generations of supercomputers. The Computational Physics Group has been involved in several areas of fusion research. One main area is the application of Fokker-Planck/quasilinear codes to tokamaks. Another major area is the investigation of resistive magnetohydrodynamics in three dimensions, with applications to tokamaks and compact toroids. A third area is the investigation of kinetic instabilities using a 3-D particle code; this work is often coupled with the task of numerically generating equilibria which model experimental devices. Ways to apply statistical closure approximations to study tokamak-edge plasma turbulence have been under examination, with the hope of being able to explain anomalous transport. Also, we are collaborating in an international effort to evaluate fully three-dimensional linear stability of toroidal devices. In addition to these computational physics studies, the group has developed a number of linear systems solvers for general classes of physics problems and has been making a major effort at ascertaining how to efficiently utilize multiprocessor computers. A summary of these programs are included in this paper. 6 tabs.

Mirin, A.A.

1989-01-01T23:59:59.000Z

355

The inversion algorithm for digital simulation  

Science Conference Proceedings (OSTI)

The inversion algorithm is an event-driven algorithm, whose performance rivals or exceeds that of levelized compiled code simulation, even at activity rates of 50% or more. The inversion algorithm has several unique features, the most remarkable of which ...

P. M. Maurer

2006-11-01T23:59:59.000Z

356

Hyperspectral detection algorithms: Use covariances or subspaces?  

E-Print Network (OSTI)

There are two broad classes of hyperspectral detection algorithms.1, 2 Algorithms in the first class use the spectral covariance matrix of the background clutter; in contrast, algorithms in the second class characterize ...

Manolakis, Dimitris G.

357

Nonferromagnetic linear variable differential transformer  

DOE Patents (OSTI)

A nonferromagnetic linear variable differential transformer for accurately measuring mechanical displacements in the presence of high magnetic fields is provided. The device utilizes a movable primary coil inside a fixed secondary coil that consists of two series-opposed windings. Operation is such that the secondary output voltage is maintained in phase (depending on polarity) with the primary voltage. The transducer is well-suited to long cable runs and is useful for measuring small displacements in the presence of high or alternating magnetic fields.

Ellis, James F. (Powell, TN); Walstrom, Peter L. (Oak Ridge, TN)

1977-06-14T23:59:59.000Z

358

Linearized gyro-kinetic equation  

SciTech Connect

An ordering of the linearized Fokker-Planck equation is performed in which gyroradius corrections are retained to lowest order and the radial dependence appropriate for sheared magnetic fields is treated without resorting to a WKB technique. This description is shown to be necessary to obtain the proper radial dependence when the product of the poloidal wavenumber and the gyroradius is large (k rho much greater than 1). A like particle collision operator valid for arbitrary k rho also has been derived. In addition, neoclassical, drift, finite $beta$ (plasma pressure/magnetic pressure), and unperturbed toroidal electric field modifications are treated. (auth)

Catto, P.J.; Tsang, K.T.

1976-01-01T23:59:59.000Z

359

Some Abstract Pivot Algorithms (REVISED)  

E-Print Network (OSTI)

Several problems in the theory of combinatorial geometries (or matroids) are solved by means of algorithms which involve the notion of "abstract pivots". The main example is the Edmonds-Fulkerson partition theorem, which ...

Green, Curtis

360

Bayesian inference algorithm on Raw  

E-Print Network (OSTI)

This work explores the performance of Raw, a parallel hardware platform developed at MIT, running a Bayesian inference algorithm. Motivation for examining this parallel system is a growing interest in creating a self-learning ...

Luong, Alda

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


361

A combinatorial algorithm for Pfaffians  

Science Conference Proceedings (OSTI)

The Pfaffian of a graph is closely linked to Perfect Matching. It is also naturally related to the determinant of an appropriately defined matrix. This relation between Pfaffian and determinant is usually exploited to give a fast algorithm for computing ...

Meena Mahajan; P. R. Subramanya; V. Vinay

1999-07-01T23:59:59.000Z

362

International linear collider reference design report  

Science Conference Proceedings (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

363

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-

364

Multithreaded Algorithms for Graph Coloring  

SciTech Connect

Graph algorithms are challenging to parallelize when high performance and scalability are primary goals. Low concurrency, poor data locality, irregular access pattern, and high data access to computation ratio are among the chief reasons for the challenge. The performance implication of these features is exasperated on distributed memory machines. More success is being achieved on shared-memory, multi-core architectures supporting multithreading. We consider a prototypical graph problem, coloring, and show how a greedy algorithm for solving it can be e*ectively parallelized on multithreaded architectures. We present in particular two di*erent parallel algorithms. The first relies on speculation and iteration, and is suitable for any shared-memory, multithreaded system. The second uses data ow principles and is targeted at the massively multithreaded Cray XMT system. We benchmark the algorithms on three di*erent platforms and demonstrate scalable runtime performance. In terms of quality of solution, both algorithms use nearly the same number of colors as the serial algorithm.

Catalyurek, Umit V.; Feo, John T.; Gebremedhin, Assefaw H.; Halappanavar, Mahantesh; Pothen, Alex

2012-10-21T23:59:59.000Z

365

Numerical simulation of non-linear wave tank based on the ALE algorithm  

Science Conference Proceedings (OSTI)

Numerical Wave Tank NWT becomes more and more prominent in the corresponding scientific research. On the basis of the Navier-Stokes N-S equation, the early application be adopted for discretising and calculating the specific region is by Volume of Fluid ...

Feng Zhu; Weihua Zhu; Y. N. Wang; B. Fang; S. L. Zhao

2013-07-01T23:59:59.000Z

366

Dynamic Task Scheduling for Linear Algebra Algorithms on Distributed-Memory Multicore Systems  

E-Print Network (OSTI)

. Nguyen, B. J. Ronchetti, W. M. Sauer, E. M. Schwarz, and M. T. Vaden. IBM Power6 microarchitecture. IBM J. Suppose a deadlock occurs between m processes {Pi1 , Pi2 , . . ., Pim } 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 be the first task in Qid , where d [1, m]. Suppose ti1 Qi1 is unable to execute because ti1 is waiting

Dongarra, Jack

367

A ray-based algorithm for multi-dimensional linear conversion  

E-Print Network (OSTI)

Plasmas 3 (1996) 1976. [II] Conversion can also occur when awith this type of conversion. [12] B. O'Neill, Elementaryspace diagram of the conversion region. The incoming ray

Tracy, Eugene R.; Kaufman, Allan N.; Jaun, Andre

2004-01-01T23:59:59.000Z

368

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

E-Print Network (OSTI)

Feb 5, 2005 ... most O(n) (inner) iterations suffice to reduce the duality gap and the ... that further investigation will improve the above bound to O(?n).

369

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

E-Print Network (OSTI)

most O(n) (inner) iterations suffice to reduce the duality gap and the residuals ... It is conjectured that further investigation will improve the above bound to O(?n).

370

Architecture-Aware Algorithms for Scalable Performance and Resilience on Heterogeneous Architectures  

SciTech Connect

The goal of the Extreme-scale Algorithms & Software Institute (EASI) is to close the ?application-architecture performance gap? by exploring algorithms and runtime improvements that will enable key science applications to better exploit the architectural features of DOE extreme-scale systems. For the past year of the project, our efforts at the University of Tennessee have concentrated on, and made significant progress related to, the following high-level EASI goals: ? Develop multi-precision and architecture-aware implementations of Krylov, Poisson, Helmholtz solvers, and dense factorizations for heterogeneous multi-core systems; ? Explore new methods of algorithm resilience, and develop new algorithms with these capabilities; ? Develop runtime support for adaptable algorithms that are dealing with resilience, scalability; ? Distribute the new algorithms and runtime support through widely used software packages; ? Establish a strong outreach program to disseminate results, interact with colleagues and train students and junior members of our community.

Dongarra, Jack [University of Tennessee, Knoxville] [University of Tennessee, Knoxville

2013-10-15T23:59:59.000Z

371

Linear Concentrator Systems for Concentrating Solar Power  

Energy.gov (U.S. Department of Energy (DOE))

Linear concentrating solar power (CSP) collectors capture the sun's energy with large mirrors that reflect and focus the sunlight onto a linear receiver tube. The receiver contains a fluid that is...

372

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

373

Linear Stability of Modons on a Sphere  

Science Conference Proceedings (OSTI)

The linear stability of two stationary dipolar modon solutions of the nondivergent barotropic vorticity equation on a rotating sphere is investigated. A numerical normal mode analysis of the linearized equation is performed by solving the ...

E. C. Neven

2001-08-01T23:59:59.000Z

374

Summary of Linear Elastic Fracture Mechanics Concepts  

Science Conference Proceedings (OSTI)

...in this Volume."Stress Intensity Factors"A brief summary of linear elastic fracture mechanics (LEFM) concepts

375

Energy Basics: Linear Concentrator Systems for Concentrating...  

Office of Energy Efficiency and Renewable Energy (EERE) Indexed Site

Energy Basics Renewable Energy Printable Version Share this resource Biomass Geothermal Hydrogen Hydropower Ocean Solar Photovoltaics Concentrating Solar Power Linear...

376

(Stanford Linear Accelerator Center) annual environmental monitoring report, January--December 1989  

SciTech Connect

This progress report discusses environmental monitoring activities at the Stanford Linear Accelerator Center for 1989. Topics include climate, site geology, site water usage, land use, demography, unusual events or releases, radioactive and nonradioactive releases, compliance summary, environmental nonradiological program information, environmental radiological program information, groundwater protection monitoring ad quality assurance. 5 figs., 7 tabs. (KJD)

Not Available

1990-05-01T23:59:59.000Z

377

Linearized Alternating Direction Method with Gaussian Back ...  

E-Print Network (OSTI)

Oct 28, 2011 ... [14] M. Fukushima, Application of the alternating direction method of ... [15] M. Fukushima, The primal Douglas-Rachford splitting algorithm for a ...

378

Linear Collider Collaboration Tech Notes  

NLE Websites -- All DOE Office Websites (Extended Search)

1 1 May 2001 Lattice Description for NLC Damping Rings at 120 Hz Andrzej Wolski Lawrence Berkeley National Laboratory Abstract: We present a lattice design for the NLC Main Damping Rings at 120 Hz repe tition rate. A total wiggler length of a little over 46 m is needed to achieve the damping time required for extracted, normalized, vertical emittance below 0.02 mm mrad. The dynamic aperture (using a linear model for the wiggler) is in excess of 15 times the injected beam size. The principal lattice parameters and characteristics are presented in this note; we also outline results of studies of alignment and field quality tolerances. CBP Tech Note-227 LCC-0061 Lattice Description for NLC Main Damping Rings at 120 Hz Andrzej Wolski Lawrence Berkeley National Laboratory

379

Linear Collider Collaboration Tech Notes  

NLE Websites -- All DOE Office Websites (Extended Search)

NLC Home Page NLC Technical SLAC The LCC Tech Note series was started in July 1998 to document the JLC/NLC collaborative design effort. The notes are numbered sequentially and may also be given a SLAC, FNAL, LBNL, LLNL and/or KEK publication number. The LCC notes will be distributed through the Web in electronic form as PDF files -- the authors are responsible for keeping the original documents. Other document series are the NLC Notes that were started for the SLAC ZDR, the KEK ATF Notes, and at some future time there should be a series of Technical (NLD) Notes to document work on detector studies for the next-generation linear collider. LCC-0001 "Memorandum of Understanding between KEK and SLAC," 2/98. LCC-0002 "Transparencies and Summaries from the 1st ISG meeting: January 1998," G. Loew, ed., 2/98.

380

Linear Collider Collaboration Tech Notes  

NLE Websites -- All DOE Office Websites (Extended Search)

5 08//00 5 08//00 Study of Beam Energy Spectrum Measurement in the NLC Extraction Line August 2000 Yuri Nosochkov and Tor Raubenheimer Stanford Linear Accelerator Center Stanford, CA Abstract: The NLC extraction line optics includes a secondary focal point with a very small _- function and 2 cm dispersion which can be used for measurement of outgoing beam energy spread. In this study, we performed tracking simulations to transport the NLC disrupted beam from the Interaction Point (IP) to the extraction line secondary focus (the IP image), `measure' the transverse beam pro_le at the IP image and reconstruct the beam energy spectrum. The resultant distribution was compared with the original energy spectrum at the IP. Study of Beam Energy Spectrum Measurement

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

Linear Collider Collaboration Tech Notes  

NLE Websites -- All DOE Office Websites (Extended Search)

2 03/12/99 2 03/12/99 PEP-II RF Cavity Revisited December 3, 1999 R. Rimmer, G. Koehler, D. Li, N. Hartmann, N. Folwell, J. Hodgson, B. McCandless Lawrence Berkeley National Laboratory Stanford Linear Accelerator Center Berkeley, CA, USA Stanford, CA, USA Abstract: This report describes the results of numerical simulations of the PEP-II RF cavity performed after the completion of the construction phase of the project and comparisons are made to previous calculations and measured results. These analyses were performed to evaluate new calculation techniques for the HOM distribution and RF surface heating that were not available at the time of the original design. These include the use of a high frequency electromagnetic element in ANSYS and the new Omega 3P code to study wall

382

Linear Collider Collaboration Tech Notes  

NLE Websites -- All DOE Office Websites (Extended Search)

4, 10/03/00 4, 10/03/00 Luminosity for NLC Design Variations March 10, 1999 K.A. Thompson and T.O. Raubenheimer Stanford Linear Accelerator Center Stanford, CA, USA Abstract: In this note we give Guineapig simulation results for the luminosity and luminosity spectrum of three baseline NLC designs at 0.5~TeV and 1.0~TeV and compare the simulation results with analytic approximations. We examine the effects of varying several design parameters away from the NLC-B-500 and NLC-B-1000 designs, in order to study possible trade-offs of parameters that could ease tolerances, increase luminosity, or help to optimize machine operation for specific physics processes. Luminosity for NLC Design Variations K.A. Thompson and T.O.Raubenheimer INTRODUCTION In this note we give Guineapig [l] simulation results for the luminosity and

383

Linear Collider Collaboration Tech Notes  

NLE Websites -- All DOE Office Websites (Extended Search)

Notes Notes LCC - 0038 29/04/00 CBP Tech Note - 234 Transverse Field Profile of the NLC Damping Rings Electromagnet Wiggler 29 April 2000 17 J. Corlett and S. Marks Lawrence Berkeley National Laboratory M. C. Ross Stanford Linear Accelerator Center Stanford, CA Abstract: The primary effort for damping ring wiggler studies has been to develop a credible radiation hard electromagnet wiggler conceptual design that meets NLC main electron and positron damping ring physics requirements [1]. Based upon an early assessment of requirements, a hybrid magnet similar to existing designs satisfies basic requirements. However, radiation damage is potentially a serious problem for the Nd-Fe-B permanent magnet material, and cost remains an issue for samarium cobalt magnets. Superconducting magnet designs have not been

384

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

385

The measurement of non-linear damping in metal-matrix composites  

E-Print Network (OSTI)

This thesis is concerned with the measurement of non-linear (i.e. strain amplitude dependent) intrinsic material damping in continuous fiber reinforced metalmatrix composites. The particular MMC studied is a 4-ply, [O?]S, (O = 0, 15, 30, 45, 60, 75 degree), P55Gr/Al-6061 composite. A popular method for measuring damping is the free-decay of flexural vibrations of a cantilevered beam. The strain field in a cantilevered beam is inhomogeneous. For materials whose damping is non-linear, the measured damping is not equal to the intrinsic material damping. Using an elementary algorithm developed by Lazan, we extract non-linear intrinsic material damping from non-linear specimen damping. In general, damping is a function of temperature, strain amplitude and strain rate. For the measurements reported herein, the range of these parameters is: [ ] where T is the absolute temperature, Er is the root strain and f is the frequency in Hz.

Ray, Sourav

1994-01-01T23:59:59.000Z

386

Hybrid algorithms in quantum Monte Carlo  

SciTech Connect

With advances in algorithms and growing computing powers, quantum Monte Carlo (QMC) methods have become a leading contender for high accuracy calculations for the electronic structure of realistic systems. The performance gain on recent HPC systems is largely driven by increasing parallelism: the number of compute cores of a SMP and the number of SMPs have been going up, as the Top500 list attests. However, the available memory as well as the communication and memory bandwidth per element has not kept pace with the increasing parallelism. This severely limits the applicability of QMC and the problem size it can handle. OpenMP/MPI hybrid programming provides applications with simple but effective solutions to overcome efficiency and scalability bottlenecks on large-scale clusters based on multi/many-core SMPs. We discuss the design and implementation of hybrid methods in QMCPACK and analyze its performance on current HPC platforms characterized by various memory and communication hierarchies.

Esler, Kenneth P [ORNL; Mcminis, Jeremy [University of Illinois, Urbana-Champaign; Morales, Miguel A [Lawrence Livermore National Laboratory (LLNL); Clark, Bryan K. [Princeton University; Shulenburger, Luke [Sandia National Laboratory (SNL); Ceperley, David M [ORNL

2012-01-01T23:59:59.000Z

387

The message management asynchronous backtracking algorithm  

Science Conference Proceedings (OSTI)

In this paper we show how the asynchronous backtracking algorithm, a well-known distributed constraint satisfaction algorithm, produces unnecessary messages and introduce our optimized algorithm, message management asynchronous backtracking, which reduces ... Keywords: Backtracking algorithm, Constraint satisfaction problem, Distributed, Hyper-resolution, Multiagent system

Hong Jiang; Jose M. Vidal

2008-06-01T23:59:59.000Z

388

Combining Genetic Algorithms & Simulation to Search for ...  

Science Conference Proceedings (OSTI)

... GA Checkpoint Database Node Manager Job Manager GA Controller ... GENETIC ALGORITHM Principal Components Analysis, Clustering, … ...

2013-10-24T23:59:59.000Z

389

The powerrank web link analysis algorithm  

Science Conference Proceedings (OSTI)

The web graph follows the power law distribution and has a hierarchy structure. But neither the PageRank algorithm nor any of its improvements leverage these attributes. In this paper, we propose a novel link analysis algorithm "the PowerRank algorithm", ... Keywords: hierarchy structure, page rank algorithm, power distribution

Yizhou Lu; Benyu Zhang; Wensi Xi; Zheng Chen; Yi Liu; Michael R. Lyu; Wei-ying Ma

2004-05-01T23:59:59.000Z

390

Formal verification of change making algorithms  

Science Conference Proceedings (OSTI)

We present progress on a project to formally verify properties of various algorithms related to the change making problem. In particular, we formalize proofs of the classic greedy algorithm's behavior as well as an algorithm to verify its optimality ... Keywords: Coq proof assistant, canonical coin system, change making, formal methods, greedy algorithm

Nadeem Abdul Hamid, Brook Bowers

2013-04-01T23:59:59.000Z

391

Management Programs  

NLE Websites -- All DOE Office Websites (Extended Search)

3MS Environment and Waste Management Programs Environment and Waste Management Programs Environment and Waste Management Programs AN L-934 Surveillance of Site A and Plot M...

392

Management Programs  

NLE Websites -- All DOE Office Websites (Extended Search)

Environment and Waste Management Programs Environment and Waste Management Programs Environment and Waste Management Programs AN L-9213 Surveillance of Site A and Plot M Report...

393

Management Programs  

NLE Websites -- All DOE Office Websites (Extended Search)

r Environment and Waste Management Programs Environment and Waste Management Programs Environment and Waste Management Programs ANL-949 Surveillance of Site A and Plot M Report...

394

On Duality Theory for Non-Convex Semidefinite Programming ?  

E-Print Network (OSTI)

ences of the USA, vol. 39, No.1, (1953). [4] C. Kanzow, C. Nagel, H. Kato, M. Fukushima, Successive linearization methods for nonlinear semidefinite programs.

395

A Mixed Integer Nonlinear Programming Framework for Fixed Path ...  

E-Print Network (OSTI)

paths of the robots are represented by piecewise cubic spline curves. ...... programming, linear and nonlinear systems theory, statistics, and machine learning.

396

A class of stochastic gradient algorithms with exponentiated error cost functions  

Science Conference Proceedings (OSTI)

A novel class of stochastic gradient descent algorithms is introduced based on the minimisation of convex cost functions with exponential dependence on the adaptation error, instead of the conventional linear combinations of even moments. The derivation ... Keywords: Adaptive filtering, Cost functions, Online optimisation, Stochastic gradient descent

C. Boukis; D. P. Mandic; A. G. Constantinides

2009-03-01T23:59:59.000Z

397

Support vector regression with chaos-based firefly algorithm for stock market price forecasting  

Science Conference Proceedings (OSTI)

Due to the inherent non-linearity and non-stationary characteristics of financial stock market price time series, conventional modeling techniques such as the Box-Jenkins autoregressive integrated moving average (ARIMA) are not adequate for stock market ... Keywords: Chaotic mapping, Firefly algorithm, Stock market price forecasting, Support vector regression

Ahmad Kazem; Ebrahim Sharifi; Farookh Khadeer Hussain; Morteza Saberi; Omar Khadeer Hussain

2013-02-01T23:59:59.000Z

398

Parallel numerical algorithms based on tensor notation and Co-Array Fortran syntax  

Science Conference Proceedings (OSTI)

Co-Array Fortran represents a correspondence between tensor notation and an extended Fortran array syntax. It uses normal Fortran array indices to point to data in local memory and adds co-array indices to point to data in remote memory. By writing algorithms ... Keywords: Co-Array Fortran, Numerical linear algebra, Tensor algebra

Robert W. Numrich

2005-06-01T23:59:59.000Z

399

Predicting EU Energy Industry Excess Returns on EU Market Index via a Constrained Genetic Algorithm  

Science Conference Proceedings (OSTI)

This article introduces an automated procedure to simultaneously select variables and detect outliers in a dynamic linear model using information criteria as objective functions and diagnostic tests as constraints for the distributional properties of ... Keywords: C32, C52, C53, C61, C63, Excess return, Genetic algorithm, Information criteria, Model selection, Penalty function method

Massimiliano Kaucic

2009-09-01T23:59:59.000Z

400

An overview of SuperLU: Algorithms, implementation, and user interface  

Science Conference Proceedings (OSTI)

We give an overview of the algorithms, design philosophy, and implementation techniques in the software SuperLU, for solving sparse unsymmetric linear systems. In particular, we highlight the differences between the sequential SuperLU (including its ... Keywords: Sparse direct solver, distributed-memory computers, parallelism, scalability, supernodal factorization

Xiaoye S. Li

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


401

Parallel Algorithms for Graph Optimization using Tree Decompositions  

SciTech Connect

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

402

A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing  

Science Conference Proceedings (OSTI)

A branch-price-and-cut algorithm is developed for a complex maritime inventory-routing problem with varying storage capacities and production/consumption rates at facilities. The resulting mixed-integer pricing problem is solved exactly and efficiently ... Keywords: column generation, dynamic programming, integer programming, maritime inventory routing

Faramroze G. Engineer; Kevin C. Furman; George L. Nemhauser; Martin W. P. Savelsbergh; Jin-Hwa Song

2012-01-01T23:59:59.000Z

403

An study of the tree generation algorithms in equation based model learning with low quality data  

Science Conference Proceedings (OSTI)

The undesired effects of data gathered from real world can be produced by the noise in the process, the bias of the sensors and the presence of hysteresis, among other uncertainty sources. In previous works the learning models using the so-called Low ... Keywords: genetic algorithm and programming, genetic programming, low quality data, multiobjective simulated annealing

Alba Berzosa; José R. Villar; Javier Sedano; Marco García-Tamargo; Enrique de la Cal

2011-05-01T23:59:59.000Z

404

Dynamic sampling algorithms for multi'stage stochastic programs ...  

E-Print Network (OSTI)

Feb 9, 2011 ... hydro'electricity generation and generating from thermal plant over some ... carried out during a visit by the second author to the Electric Power ...

405

A Feasible Trust-Region Sequential Quadratic Programming Algorithm  

E-Print Network (OSTI)

Citation: Optimization Technical Report 02-05, August, 2002, Computer Sciences Department, University of Wisconsin. Texas-Wisconsin Modeling and Control ...

406

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

E-Print Network (OSTI)

Jun 16, 2013 ... convex benchmark problems and distributionally robust utility maximization problems, follow ..... model with an adjustable rate of risk-aversion.

407

Feasible and accurate algorithms for covering semidefinite programs  

E-Print Network (OSTI)

The Department of Industrial Engineering & Operations Research, Columbia University, cliff,garud@ieor.columbia.edu, Mathematics Department, The College of ...

408

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.

409

Elastic-Mode Algorithms for Mathematical Programs with Equilibrium ...  

E-Print Network (OSTI)

Advanced Scientific Computing Research, Office of Science, U.S. Department of. Energy, under Contract W-31-109-ENG-38. Stephen Wright was supported by.

410

Dictionary preconditioning for greedy algorithms  

E-Print Network (OSTI)

This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their performance in finding sparse signal representations in redundant dictionaries while maintaining the same complexity. These algorithms can be split into a sensing and a reconstruction step, and the former will fail to identify correct atoms if the cumulative coherence of the dictionary is too high. We thus modify the sensing step by introducing a special sensing dictionary. The correct selection of components is then determined by the cross cumulative coherence which can be considerably lower than the cumulative coherence. We characterise the optimal sensing matrix and develop a constructive method to approximate it. Finally we compare the performance of thresholding and OMP using the original and modified algorithms.

Karin Schnass; Pierre Vandergheynst

1994-01-01T23:59:59.000Z

411

A hybrid evolutionary programming approach for optimal worst case tolerance design of magnetic devices  

Science Conference Proceedings (OSTI)

This paper presents a hybrid evolutionary programming approach to solve the worst case tolerance design problem (WCTDP) in magnetic devices. The hybrid algorithm is formed by a basic evolutionary programming approach, mixed with a gradient-guided local ... Keywords: Evolutionary programming, Hybrid algorithms, Tolerance analysis, Tolerance design

Sancho Salcedo-Sanz; Angel M. PéRez-Bellido; Emilio G. Ortiz-GarcíA; Jose A. Portilla-Figueras; Silvia JiméNez-FernáNdez

2012-08-01T23:59:59.000Z

412

Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic ...  

E-Print Network (OSTI)

large, e.g., in economics, energy, finance or transportation (see [45] for a survey of applied models). ..... For further information on linear parametric programming ...... providers or markets at stochastic prices ?t, t = 1,...,T, and aims at minimizing.

413

Educational Programs  

NLE Websites -- All DOE Office Websites (Extended Search)

Sustainability Workshops Highlights of our Programs Named Postdoctoral Fellowship Program Spring Science Undergraduate Laboratory Internship Faculty opportunities Learning Lab...

414

Adaptive protection algorithm and system  

Science Conference Proceedings (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); Toms, Helen L. (Irwin, PA); Miller, Roger M. (Mars, PA)

2009-04-28T23:59:59.000Z

415

Experimental optimization by evolutionary algorithms  

Science Conference Proceedings (OSTI)

This tutorial addresses applications of evolutionary algorithms to optimization tasks where the function evaluation cannot be done through a computer simulation, but requires the execution of an experiment in the real world (i.e., cosmetics, detergents, ... Keywords: biological experiments, experimental optimization, history, quantum control

Thomas Bäck; Joshua Knowles; Ofer M. Shir

2010-07-01T23:59:59.000Z

416

Robust Algorithms for Object Localization  

Science Conference Proceedings (OSTI)

Model-based localization, the task of estimating an object‘s pose from sensed and corresponding model features, is a fundamental task in machine vision. Exact constant time localization algorithms have been developed for the case where the sensed ... Keywords: object localization, object registration, resultants

Aaron Wallack; Dinesh Manocha

1998-05-01T23:59:59.000Z

417

Multi-objective reliability optimization for dissimilar-unit cold-standby systems using a genetic algorithm  

Science Conference Proceedings (OSTI)

A genetic algorithm approach is used to solve a multi-objective discrete reliability optimization problem in a k dissimilar-unit non-repairable cold-standby redundant system. Each unit is composed of a number of independent components with generalized ... Keywords: Genetic algorithm, Graph theory, Markov processes, Multiple objective programming, Reliability optimization

Amir Azaron; Cahit Perkgoz; Hideki Katagiri; Kosuke Kato; Masatoshi Sakawa

2009-05-01T23:59:59.000Z

418

Computation of maximum likelihood estimates for multiresponse generalized linear mixed models with non-nested, correlated random effects  

Science Conference Proceedings (OSTI)

Estimation of generalized linear mixed models (GLMMs) with non-nested random effects structures requires the approximation of high-dimensional integrals. Many existing methods are tailored to the low-dimensional integrals produced by nested designs. ... Keywords: EM algorithm, Fully exponential Laplace approximation, Joint model, Multiple membership, Multivariate, Sparse matrix

Andrew T. Karl, Yan Yang, Sharon L. Lohr

2014-05-01T23:59:59.000Z

419

Hanford External Dosimetry Program  

Science Conference Proceedings (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

420

Why is Boris Algorithm So Good?  

SciTech Connect

Due to its excellent long term accuracy, the Boris algorithm is the de facto standard for advancing a charged particle. Despite its popularity, up to now there has been no convincing explanation why the Boris algorithm has this advantageous feature. In this letter, we provide an answer to this question. We show that the Boris algorithm conserves phase space volume, even though it is not symplectic. The global bound on energy error typically associated with symplectic algorithms still holds for the Boris algorithm, making it an effective algorithm for the multi-scale dynamics of plasmas.

et al, Hong Qin

2013-03-03T23: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

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

E-Print Network (OSTI)

solved with a branch-and-price algorithm, which, when run to completion, ... small restricted integer programs, and a branch-and-price approach for solving it.

422

A simple and effective Verlet-type algorithm for simulating Langevin dynamics  

E-Print Network (OSTI)

We present a revision to the well known Stormer-Verlet algorithm for simulating second order differential equations. The revision addresses the inclusion of linear friction with associated stochastic noise, and we analytically demonstrate that the new algorithm correctly reproduces diffusive behavior of a particle in a flat potential. For a harmonic oscillator, our algorithm provides the exact Boltzmann distribution for any value of damping, frequency, and time step for both underdamped and over damped behavior within the usual the stability limit of the Verlet algorithm. Given the structure and simplicity of the method we conclude this approach can trivially be adapted for contemporary applications, including molecular dynamics with extensions such as molecular constraints.

Grønbech-Jensen, Niels

2013-01-01T23:59:59.000Z

423

A simple and effective Verlet-type algorithm for simulating Langevin dynamics  

E-Print Network (OSTI)

We present a revision to the well known Stormer-Verlet algorithm for simulating second order differential equations. The revision addresses the inclusion of linear friction with associated stochastic noise, and we analytically demonstrate that the new algorithm correctly reproduces diffusive behavior of a particle in a flat potential. For a harmonic oscillator, our algorithm provides the exact Boltzmann distribution for any value of damping, frequency, and time step for both underdamped and over damped behavior within the usual the stability limit of the Verlet algorithm. Given the structure and simplicity of the method we conclude this approach can trivially be adapted for contemporary applications, including molecular dynamics with extensions such as molecular constraints.

Niels Grønbech-Jensen; Oded Farago

2012-12-06T23:59:59.000Z

424

Dynamic Linear Production Games under Uncertainty  

E-Print Network (OSTI)

Oct 2, 2013 ... Abstract: In situations where uncertain costs are shared over time, static ... under uncertainty, generalizing classical linear production games to ...

425

Siting the International Linear Collider at Hanford  

SciTech Connect

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

426

Siting the International Linear Collider at Hanford  

SciTech Connect

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

427

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

428

18.06 Linear Algebra, Fall 2002  

E-Print Network (OSTI)

Basic subject on matrix theory and linear algebra, emphasizing topics useful in other disciplines, including systems of equations, vector spaces, determinants, eigenvalues, similarity, and positive definite matrices. ...

Strang, Gilbert

429

Panel discussion on laboratory accelerator programs: present and future  

SciTech Connect

The present SLAC accelerator program is summarized briefly, and the future of electron-positron colliders is discussed. Present activities discussed include the PEP storage ring, the SPEAR storage ring, the Linear Accelerator, and the SLAC Linear Collider (SLC) project. Future prospects include a larger scale linear collider. The stability requirements on acceleration are briefly discussed. (LEW)

Richter, B.

1986-09-01T23:59:59.000Z

430

A Deterministic Rescaled Perceptron Algorithm  

E-Print Network (OSTI)

Jun 25, 2013 ... Program. 114 (2006), ... training support-vector machines. .... Some straightforward calculations show that for all v ? int(Bm?1). |||(? ? ?) (v)||| =.

431

n-Linear Algebra of type II  

E-Print Network (OSTI)

This book is a continuation of the book n-linear algebra of type I and its applications. Most of the properties that could not be derived or defined for n-linear algebra of type I is made possible in this new structure: n-linear algebra of type II which is introduced in this book. In case of n-linear algebra of type II we are in a position to define linear functionals which is one of the marked difference between the n-vector spaces of type I and II. However all the applications mentioned in n-linear algebras of type I can be appropriately extended to n-linear algebras of type II. Another use of n-linear algebra (n-vector spaces) of type II is that when this structure is used in coding theory we can have different types of codes built over different finite fields whereas this is not possible in the case of n-vector spaces of type I. Finally in the case of n-vector spaces of type II, we can obtain n-eigen values from distinct fields; hence, the n-characteristic polynomials formed in them are in distinct different fields. An attractive feature of this book is that the authors have suggested 120 problems for the reader to pursue in order to understand this new notion. This book has three chapters. In the first chapter the notion of n-vector spaces of type II are introduced. This chapter gives over 50 theorems. Chapter two introduces the notion of n-inner product vector spaces of type II, n-bilinear forms and n-linear functionals. The final chapter suggests over a hundred problems. It is important that the reader is well-versed not only with linear algebra but also n-linear algebra of type I.

W. B. Vasantha Kandasamy; Florentin Smarandache

2009-02-01T23:59:59.000Z

432

Non-linear volume photon mapping  

Science Conference Proceedings (OSTI)

This paper describes a novel extension of the photon mapping algorithm, capable of handling both volume multiple inelastic scattering and curved light paths simultaneously. The extension is based on the Full Radiative Transfer Equation (FRTE) and Fermat's ...

Diego Gutierrez; Adolfo Munoz; Oscar Anson; Francisco J. Seron

2005-06-01T23:59:59.000Z

433

The WSR-88D Rainfall Algorithm  

Science Conference Proceedings (OSTI)

A detailed description of the operational WSR-88D rainfall estimation algorithm is presented. This algorithm, called the Precipitation Processing System, produces radar-derived rainfall products in real time for forecasters in support of the ...

Richard A. Fulton; Jay P. Breidenbach; Dong-Jun Seo; Dennis A. Miller; Timothy O’Bannon

1998-06-01T23:59:59.000Z

434

The bidimensionality theory and its algorithmic applications  

E-Print Network (OSTI)

Our newly developing theory of bidimensional graph problems provides general techniques for designing efficient fixed-parameter algorithms and approximation algorithms for NP- hard graph problems in broad classes of graphs. ...

Hajiaghayi, MohammadTaghi

2005-01-01T23:59:59.000Z

435

Evaluation of TCP Congestion Control Algorithms on the Windows Vista Platform  

Science Conference Proceedings (OSTI)

CTCP, an innovative TCP congestion control algorithm developed by Microsoft, is evaluated and compared to HSTCP and StandardTCP. Tests were performed on the production Internet from Stanford Linear Accelerator Center (SLAC) to various geographically located hosts to give a broad overview of the performances. We find that certain issues were apparent during testing (not directly related to the congestion control algorithms) which may skew results. With this in mind, we find that CTCP performed similarly to HSTCP across a multitude of different network environments. However, to improve the fairness and to reduce the impact of CTCP upon existing StandardTCP traffic, two areas of further research were investigated. Algorithmic additions to CTCP for burst control to reduce the aggressiveness of its cwnd increments demonstrated beneficial improvements in both fairness and throughput over the original CTCP algorithm. Similarly, {gamma} auto-tuning algorithms were investigated to dynamically adapt CTCP flows to their network conditions for optimal performance. While the effects of these auto-tuning algorithms when used in addition to burst control showed little to no benefit to fairness nor throughput for the limited number of network paths tested, one of the auto-tuning algorithms performed such that there was negligible impact upon StandardTCP. With these improvements, CTCP was found to perform better than HSTCP in terms of fairness and similarly in terms of throughput under the production environments tested.

Li, Yee-Ting; /SLAC

2006-07-07T23:59:59.000Z

436

Advanced Encryption Standard Algorithm Validation List  

Science Conference Proceedings (OSTI)

Advanced Encryption Standard Algorithm Validation List. Last Update: 8/28/2013. The page provides technical information ...

437

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

2009-10-12T23:59:59.000Z

438

On the representation by linear superpositions  

Science Conference Proceedings (OSTI)

In a number of papers, Y. Sternfeld investigated the problems of representation of continuous and bounded functions by linear superpositions. In particular, he proved that if such representation holds for continuous functions, then it holds for bounded ... Keywords: 26B40, 41A05, 41A63, Closed path, Linear superposition, Ridge function

Vugar E. Ismailov

2008-04-01T23:59:59.000Z

439

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 when it 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, W.M.

1991-03-19T23:59:59.000Z

440

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

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

Exact acceleration of linear object detectors  

Science Conference Proceedings (OSTI)

We describe a general and exact method to considerably speed up linear object detection systems operating in a sliding, multi-scale window fashion, such as the individual part detectors of part-based models. The main bottleneck of many of those systems ... Keywords: linear object detection, part-based models

Charles Dubout; Fran$#231;ois Fleuret

2012-10-01T23:59:59.000Z

442

Branching vs. Linear Time: Final Showdown  

Science Conference Proceedings (OSTI)

The discussion of the relative merits of linear- versus branching-time frameworks goes back to early 1980s. One of the beliefs dominating this discussion has been that "while specifying is easier in LTL (linear-temporal logic), verification is easier ...

Moshe Y. Vardi

2001-04-01T23:59:59.000Z

443

Smart Suspension System for Linear Guideways  

Science Conference Proceedings (OSTI)

This paper presents a new method for the semi-active control of the span system of linear guideways subjected to a travelling load. Two elastic beams are coupled by a set of controlled dampers. The relative velocity of the spans provides an opportunity ... Keywords: Linear guideway, Moving load, Semi-active control, Smart suspension system, Vibration control

Dominik Pisarski; Czeslaw I. Bajer

2011-06-01T23:59:59.000Z

444

On linear models for nonlinear systems  

Science Conference Proceedings (OSTI)

Best linear time-invariant (LTI) approximations are analysed for several interesting classes of discrete nonlinear time-invariant systems. These include nonlinear finite impulse response systems and a class of nonsmooth systems called bi-gain systems. ... Keywords: Approximation, Discrete-time systems, Fréchet derivative, Linear models, Nonlinear systems, System identification, Wiener systems

P. M. MäKilä; J. R. Partington

2003-01-01T23:59:59.000Z

445

Piecewise Linear Modeling: Theory, Guidelines, and Applications  

E-Print Network (OSTI)

Statistical analysis underlies most published research in every scientific field of study. A common statistical tool for the analysis of cross-sectional data is the general linear model, or multiple regression. For the analysis of time series data, the most commonly employed tool is autoregressive integrated moving averages (ARIMA), which also is implicitly linear.

Kenneth O. Cogger

2006-01-01T23:59:59.000Z

446

On extremal cases of Hopcroft's algorithm  

Science Conference Proceedings (OSTI)

In this paper we consider the problem of minimization of deterministic finite automata (DFA) with reference to Hopcroft's algorithm. Hopcroft's algorithm has several degrees of freedom, so there can exist different executions that can lead to different ... Keywords: Deterministic finite state automata, Hopcroft's minimization algorithm, Standard trees, Word trees

G. Castiglione; A. Restivo; M. Sciortino

2010-08-01T23:59:59.000Z

447

Optimizing genetic algorithm for motif discovery  

Science Conference Proceedings (OSTI)

Planted (l,d)-motif identification is an important and challenging problem in computational biology. In this paper, we present an original algorithm (GARPS) that combines Genetic Algorithm (GA) and Random Projection Strategy (RPS) to identify (l,d)-motifs. ... Keywords: (l,d)-motif, Genetic algorithm, Motif identification, Position-weighted function, Random projection

Hongwei Huo; Zhenhua Zhao; Vojislav Stojkovic; Lifang Liu

2010-12-01T23:59:59.000Z

448

Opposition-based artificial bee colony algorithm  

Science Conference Proceedings (OSTI)

The Artificial Bee Colony (ABC) algorithm is a relatively new algorithm for function optimization. The algorithm is inspired by the foraging behavior of honey bees. In this work, the performance of ABC is enhanced by introducing the concept of opposition-based ... Keywords: benchmarking, black-box optimization, opposition-based learning, swarm intelligence

Mohammed El-Abd

2011-07-01T23:59:59.000Z

449

Applying Adaptive Evolutionary Algorithms to Hard Problems  

E-Print Network (OSTI)

Applying Adaptive Evolutionary Algorithms to Hard Problems J.I. van Hemert1 jvhemert into two distinct parts. The main theme is adaptive evolutionary algorithms. The rst part covers. The second part mainly consists of the development of a library. Its use is aimed at evolutionary algorithms

Emmerich, Michael

450

Parallelizable Bayesian Tomography Algorithms with Rapid, Guaranteed Convergence  

E-Print Network (OSTI)

Bayesian tomographic reconstruction algorithms generally require the efficient optimization of a functional of many variables. In this setting, as well as in many other optimization tasks, functional substitution (FS) has been widely applied to simplify each step of the iterative process. The function to be minimized is replaced locally by an approximation having a more easily manipulated form, e.g., quadratic, but which maintains sufficient similarity to descend the true functional while computing only the substitute. In this paper, we provide two new applications of FS methods in iterative coordinate descent for Bayesian tomography. The first is a modification of our coordinate descent algorithm with one-dimensional (1-D) Newton--Raphson approximations to an alternative quadratic which allows convergence to be proven easily. In simulations, we find essentially no difference in convergence speed between the two techniques. We also present a new algorithm which exploits the FS method to allow parallel updates of arbitrary sets of pixels using computations similar to iterative coordinate descent. The theoretical potential speed up of parallel implementations is nearly linear with the number of processors if communication costs are neglected.

Jun Zheng; Suhail S. Saquib; Ken Sauer; Charles A. Bouman

2000-01-01T23:59:59.000Z

451

Non-linear Evolution of Rayleigh-Taylor Instability in a Radiation Supported Atmosphere  

E-Print Network (OSTI)

The non-linear regime of Rayleigh-Taylor instability (RTI) in a radiation supported atmosphere, consisting of two uniform fluids with different densities, is studied numerically. We perform simulations using our recently developed numerical algorithm for multi-dimensional radiation hydrodynamics based on a variable Eddington tensor as implemented in Athena, focusing on the regime where scattering opacity greatly exceeds absorption opacity. We find that the radiation field can reduce the growth and mixing rate of RTI, but this reduction is only significant when radiation pressure significantly exceeds gas pressure. Small scale structures are also suppressed in this case. In the non-linear regime, dense fingers sink faster than rarefied bubbles can rise, leading to asymmetric structures about the interface. By comparing the calculations that use a variable Eddington tensor (VET) versus the Eddington approximation, we demonstrate that anisotropy in the radiation field can affect the non-linear development of RTI...

Jiang, Yan-Fei; Stone, James

2012-01-01T23:59:59.000Z

452

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 Collector (PTSC). This steady state, single dimensional model comprises the fundamental radiative and convective heat transfer and mass and energy balance relations programmed in the Engineering Equation Solver, EES. It considers the effects of solar intensity and incident angle, collector dimensions, material properties, fluid properties, ambient conditions, and operating conditions on the performance of the collector: the PTSC. Typical performance calculations show that when hot-water at 165C flows through a 6m by 2.3m PTSC with 900 w/m^2 solar insulation and 0 incident angle, the estimated collector efficiency is about 55% The model predictions will be confirmed by the operation of PTSCs now being installed at Carnegie Mellon.

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

2006-01-01T23:59:59.000Z

453

Parallel GPU Algorithms for Mechanical CAD  

E-Print Network (OSTI)

16 Computations Using Shaderalgorithm. Computations Using Shader Programs We performgeometric computations using Shader Programs. These are

Krishnamurthy, Adarsh

2010-01-01T23:59:59.000Z

454

Banquet Program  

Science Conference Proceedings (OSTI)

... Annual Banquet Program 5:30 pm Social Hour (Cash Bar) 6:30 pm Dinner 7:15 pm Program • Remarks & Introduction of Current Officers John ...

2008-09-15T23:59:59.000Z

455

Program Accomplishments  

Fuel Cell Technologies Publication and Product Library (EERE)

Progress and accomplishments in hydrogen and fuel cells. A Fuel Cell Technologies Program fact sheet that outlines current progress in key program goals.

456

Educational Programs  

NLE Websites -- All DOE Office Websites (Extended Search)

program . If you need assistance with the DOE application, please e-mail SC.WDTS@science.doe.gov. For the Argonne Student Research Participation Program, apply only...

457

Educational Programs  

NLE Websites -- All DOE Office Websites (Extended Search)

program. If you need assistance with the DOE application, please e-mail SC.WDTS@science.doe.gov. For the Argonne Student Research Participation Program, apply only...

458

SRS - Programs - Nonproliferation Programs  

NLE Websites -- All DOE Office Websites (Extended Search)

3/2012 3/2012 SEARCH GO spacer SRS Home Nonproliferation Programs In the crucial field of nuclear nonproliferation, SRS employee contributions helped to advance all three of the planned plutonium disposition facilities at the Savannah River Site: the Pit Disassembly and Conversion Facility (PDCF); Waste Solidification Building (WSB); and the Mixed Oxide (MOX) Fuel Fabrication Facility. A $345 million project, the WSB will process liquid waste from the MOX facility. After material is processed at the WSB, transuranic waste will be packaged and sent to the Waste Isolation Pilot Plant in New Mexico, and low-level waste will be packaged and sent to onsite or commercial off-site low-level waste disposal facilities. The mixed oxide fuel fabrication facility will be a major component in the United States' program to dispose of excess weapons grade plutonium.

459

Linear reachability problems and minimal solutions to linear Diophantine equation systems  

Science Conference Proceedings (OSTI)

The linear reachability problem for finite state transition systems is to decide whether there is an execution path in a given finite state transition system such that the counts of labels on the path satisfy a given linear constraint. Using some known ... Keywords: linear diophantine equation systems, minimal solutions, model-checking, reachability, timed automata

Gaoyan Xie; Cheng Li; Zhe Dang

2004-11-01T23:59:59.000Z

460

The Rational Hybrid Monte Carlo Algorithm  

E-Print Network (OSTI)

The past few years have seen considerable progress in algorithmic development for the generation of gauge fields including the effects of dynamical fermions. The Rational Hybrid Monte Carlo (RHMC) algorithm, where Hybrid Monte Carlo is performed using a rational approximation in place the usual inverse quark matrix kernel is one of these developments. This algorithm has been found to be extremely beneficial in many areas of lattice QCD (chiral fermions, finite temperature, Wilson fermions etc.). We review the algorithm and some of these benefits, and we compare against other recent algorithm developements. We conclude with an update of the Berlin wall plot comparing costs of all popular fermion formulations.

M. A. Clark

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


461

Dynamic Algorithm for Space Weather Forecasting System  

E-Print Network (OSTI)

We propose to develop a dynamic algorithm that intelligently analyzes existing solar weather data and constructs an increasingly more accurate equation/algorithm for predicting solar weather accurately in real time. This dynamic algorithm analyzes a wealth of data derived from scientific research and provides increasingly accurate solar forecasts. As the database of information grows over time, this algorithm perfects itself and reduces forecast uncertainties. This will provide a vastly more effective way of processing existing data for practical use in the public and private sectors. Specifically, we created an algorithm that stores data from several sources in a way that is useable, we created the ?dynamic algorithm? used for creating accurate/effective forecasts, and we have performed preliminary benchmarks on this algorithm. The preliminary benchmarks yield surprisingly effective results thus far?forecasts have been made 8-16 hours into the future with significant magnitude and trend accuracy, which is a vast improvement over current methods employed.

Fischer, Luke D.

2010-05-01T23:59:59.000Z

462

Linear Collider Collaboration Tech Notes LCC-0104  

NLE Websites -- All DOE Office Websites (Extended Search)

4 4 October 2002 Beamstrahlung Photon Load on the TESLA Extraction Septum Blade Andrei Seryi Stanford Linear Accelerator Center Stanford, CA 94309, USA Abstract: This note describes work performed in the framework of the International Linear Collider Technical Review Committee [1] to estimate the power load on the TESLA extraction septum blade due to beamstrahlung photons. It is shown, that under realistic conditions the photon load can be several orders of magnitude higher than what was estimated in the TESLA TDR [2] for the ideal Gaussian beams, potentially representing a serious limitation of the current design. Beamstrahlung Photon Load on the TESLA Extraction Septum Blade ANDREI SERYI STANFORD LINEAR

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

An algorithm for map enumeration  

E-Print Network (OSTI)

Bauer and Itzykson showed that associated to each labeled map embedded on an oriented Riemann surface there was a group generated by a pair of permutations. From this result an algorithm may be constructed for enumerating labeled maps, and this construction is easily augmented to bin the numbers by the genus of the surface the map is embedded in. The results agree with the calculations of Harer and Zagier of 1-vertex maps; with those of Bessis, Itzykson, and Zuber of 4-valent maps; and with those of Ercolani, McLaughlin, and Pierce for $2\

Virgil U. Pierce

2006-10-19T23:59:59.000Z

465

Identifying semantic differences in AspectJ programs  

Science Conference Proceedings (OSTI)

Program differencing is a common means of software debugging. Although many differencing algorithms have been proposed for procedural and object-oriented languages like C and Java, there is no differencing algorithm for aspect-oriented languages so far. ... Keywords: aop, aspectj, difference analysis, disjunctive matching, semantic analysis, static analysis

Martin Th Görg; Jianjun Zhao

2009-07-01T23:59:59.000Z

466

Algorithmic support for commodity-based parallel computing systems.  

SciTech Connect

The Computational Plant or Cplant is a commodity-based distributed-memory supercomputer under development at Sandia National Laboratories. Distributed-memory supercomputers run many parallel programs simultaneously. Users submit their programs to a job queue. When a job is scheduled to run, it is assigned to a set of available processors. Job runtime depends not only on the number of processors but also on the particular set of processors assigned to it. Jobs should be allocated to localized clusters of processors to minimize communication costs and to avoid bandwidth contention caused by overlapping jobs. This report introduces new allocation strategies and performance metrics based on space-filling curves and one dimensional allocation strategies. These algorithms are general and simple. Preliminary simulations and Cplant experiments indicate that both space-filling curves and one-dimensional packing improve processor locality compared to the sorted free list strategy previously used on Cplant. These new allocation strategies are implemented in Release 2.0 of the Cplant System Software that was phased into the Cplant systems at Sandia by May 2002. Experimental results then demonstrated that the average number of communication hops between the processors allocated to a job strongly correlates with the job's completion time. This report also gives processor-allocation algorithms for minimizing the average number of communication hops between the assigned processors for grid architectures. The associated clustering problem is as follows: Given n points in {Re}d, find k points that minimize their average pairwise L{sub 1} distance. Exact and approximate algorithms are given for these optimization problems. One of these algorithms has been implemented on Cplant and will be included in Cplant System Software, Version 2.1, to be released. In more preliminary work, we suggest improvements to the scheduler separate from the allocator.

Leung, Vitus Joseph; Bender, Michael A. (State University of New York, Stony Brook, NY); Bunde, David P. (University of Illinois, Urbna, IL); Phillips, Cynthia Ann

2003-10-01T23:59:59.000Z

467

Linac Alignment Algorithm: Analysis on 1-to-1 Steering  

SciTech Connect

In a linear accelerator, it is important to achieve a good alignment between all of its components (such as quadrupoles, RF cavities, beam position monitors et al.), in order to better preserve the beam quality during acceleration. After the survey of the main linac components, there are several beam-based alignment (BBA) techniques to be applied, to further optimize the beam trajectory and calculate the corresponding steering magnets strength. Among these techniques the most simple and straightforward one is the one-to-one (1-to-1) steering technique, which steers the beam from quad center to center, and removes the betatron oscillation from quad focusing. For a future linear collider such as the International Linear Collider (ILC), the initial beam emittance is very small in the vertical plane (flat beam with {gamma}{epsilon}{sub y} = 20-40nm), which means the alignment requirement is very tight. In this note, we evaluate the emittance growth with one-to-one correction algorithm employed, both analytically and numerically. Then the ILC main linac accelerator is taken as an example to compare the vertical emittance growth after 1-to-1 steering, both from analytical formulae and multi-particle tracking simulation. It is demonstrated that the estimated emittance growth from the derived formulae agrees well with the results from numerical simulation, with and without acceleration, respectively.

Sun, Yipeng; Adolphsen, Chris; /SLAC

2011-08-19T23:59:59.000Z

468

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

Science Conference Proceedings (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

469

Linear Concentrator Systems | Open Energy Information  

Open Energy Info (EERE)

Linear Concentrator Systems Linear Concentrator Systems Jump to: navigation, search Introduction Linear concentrating collector fields consist of a large number of collectors in parallel rows that are typically aligned in a north-south orientation to maximize both annual and summertime energy collection. With a single-axis sun-tracking system, this configuration enables the mirrors to track the sun from east to west during the day, ensuring that the sun reflects continuously onto the receiver tubes. Parabolic Trough Systems The predominant CSP systems currently in operation in the United States are linear concentrators using parabolic trough collectors. In such a system, the receiver tube is positioned along the focal line of each parabola-shaped reflector. The tube is fixed to the mirror structure and

470

Linear Anelastic Equations for Atmospheric Vortices  

Science Conference Proceedings (OSTI)

A linear anelastic-vortex model is derived using assumptions appropriate to waves on vortices with scales similar to tropical cyclones. The equation set is derived through application of a multiple-scaling technique, such that the radial ...

Daniel Hodyss; David S. Nolan

2007-08-01T23:59:59.000Z

471

Linear Prediction of Indian Monsoon Rainfall  

Science Conference Proceedings (OSTI)

This paper proposes a strategy for selecting the best linear prediction model for Indian monsoon rainfall. In this strategy, a cross-validation procedure first screens out all models that perform poorly on independent data, then the error ...

Timothy DelSole; J. Shukla

2002-12-01T23:59:59.000Z

472

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

473

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

474

Linear Baroclinic Instability in the Martian Atmosphere  

Science Conference Proceedings (OSTI)

The linear baroclinic instability of zonal-mean flows like those in the wintertime Martian atmosphere under both relatively nondusty and highly dusty conditions is examined using a spherical quasi-geostrophic model. The basic states are idealized,...

Jeffrey R. Barnes

1984-05-01T23:59:59.000Z

475

General linear cameras : theory and applications  

E-Print Network (OSTI)

I present a General Linear Camera (GLC) model that unifies many previous camera models into a single representation. The GLC model describes all perspective (pinhole), orthographic, and many multiperspective (including ...

Yu, Jingyi, 1978-

2005-01-01T23:59:59.000Z

476

The development of new algorithms for remote sensing of snow ...  

Science Conference Proceedings (OSTI)

Mar 14, 2010 ... remote sensing algorithm development, calibration and validation in ... Keywords Remote sensing Á Retrieval algorithms Á. Fractional snow ...

477

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

478

Generic Optimization Program User Manual Version 3.0.0  

E-Print Network (OSTI)

Optimization Program User Manual Version 3.0.0 SimulationIt is clear that such a manual procedure is very time-optimization algorithm. This manual is structured as

Wetter, Michael

2009-01-01T23:59:59.000Z

479

Deterministic Ensemble Forecasts Using Gene-Expression Programming  

Science Conference Proceedings (OSTI)

A method called gene-expression programming (GEP), which uses symbolic regression to form a nonlinear combination of ensemble NWP forecasts, is introduced. From a population of competing and evolving algorithms (each of which can create a ...

Atoossa Bakhshaii; Roland Stull

2009-10-01T23:59:59.000Z

480

Complex bodies with memory: linearized setting  

E-Print Network (OSTI)

The mechanics of complex bodies with memory effects is discussed in linearized setting. The attention is focused on the characterization of free energies in terms of minimum work and maximum recoverable work in the bulk and along a discontinuity surface endowed with its own surface energy, a surface internal to the body. To this aim, use is made of techniques proposed by Del Piero. Consequences of the Clausius-Duhem inequality are investigated for complex bodies with instantaneous linear elastic response.

Paolo Maria Mariano; Paolo Paoletti

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


481

The Pandora Particle Flow Algorithm  

E-Print Network (OSTI)

A high-energy e+e- collider, such as the ILC or CLIC, is arguably the best option to complement and extend the LHC physics programme. A lepton collider will allow for exploration of Standard Model Physics, such as precise measurements of the Higgs, top and gauge sectors, in addition to enabling a multitude of New Physics searches. However, physics analyses at such a collider will place unprecedented demands on calorimetry, with a required jet energy resolution of \\sigma(E)/E energy resolution by fully reconstructing the paths of individual particles through the detector. The energies of charged particles can then be extracted from precise inner detector tracker measurements, whilst photon energies will be measured in the ECAL, and only neutral hadron energies (10% of jet energies) will be measured in the HCAL, largely avoiding the typically poor HCAL resolution. This document introduces the Pandora particle flow algorithms, which offer the current state of the art in particle flow calorimetry for the ILC and CLIC. The performance of the algorithms is investigated by examining the reconstructed jet energy resolution and the ability to separate the hadronic decays of W and Z bosons.

J. S. Marshall; M. A. Thomson

2013-08-21T23:59:59.000Z

482

Hardness of approximation and integer programming frameworks for searching for caterpillar trees  

Science Conference Proceedings (OSTI)

We consider the problems of finding a caterpillar tree in a graph. We first prove that, unless P=NP, there is no approximation algorithms for finding a minimum spanning caterpillar in a graph within a factor of f(n); where f(n) ... Keywords: approximation algorithm, caterpillar trees, integer programming, optimization, semidefinite programming

Micheal J. Dinneen, Masoud Khosravani

2011-01-01T23:59:59.000Z

483

DCal: A custom integrated circuit for calorimetry at the International Linear Collider  

SciTech Connect

A research and development collaboration has been started with the goal of producing a prototype hadron calorimeter section for the purpose of proving the Particle Flow Algorithm concept for the International Linear Collider. Given the unique requirements of a Particle Flow Algorithm calorimeter, custom readout electronics must be developed to service these detectors. This paper introduces the DCal or Digital Calorimetry Chip, a custom integrated circuit developed in a 0.25um CMOS process specifically for this International Linear Collider project. The DCal is capable of handling 64 channels, producing a 1-bit Digital-to-Analog conversion of the input (i.e. hit/no hit). It maintains a 24-bit timestamp and is capable of operating either in an externally triggered mode or in a self-triggered mode. Moreover, it is capable of operating either with or without a pipeline delay. Finally, in order to permit the testing of different calorimeter technologies, its analog front end is capable of servicing Particle Flow Algorithm calorimeters made from either Resistive Plate Chambers or Gaseous Electron Multipliers.

Hoff, James R.; Mekkaoui, Abderrazek; Yarema, Ray; /Fermilab; Drake, Gary; Repond, Jose; /Argonne

2005-10-01T23:59:59.000Z

484

Blind channel identification algorithms based on the Parafac decomposition of cumulant tensors: The single and multiuser cases  

Science Conference Proceedings (OSTI)

In this paper, we exploit the symmetry properties of 4th-order cumulants to develop new blind channel identification algorithms that utilize the parallel factor (Parafac) decomposition of cumulant tensors by solving a single-step (SS) least squares (LS) ... Keywords: Channel identification, Parameter estimation, Tensor decomposition, Underdetermined linear mixtures

Carlos Estêvão R. Fernandes; Gérard Favier; João Cesar M. Mota

2008-06-01T23:59:59.000Z

485

A variable spread fuzzy linear regression model with higher explanatory power and forecasting accuracy  

Science Conference Proceedings (OSTI)

Fuzzy regression models have been applied to operational research (OR) applications such as forecasting. Some of previous studies on fuzzy regression analysis obtain crisp regression coefficients for eliminating the problem of increasing spreads for ... Keywords: Forecasting, Fuzzy inference, Fuzzy sets, Linear regression, Mathematical programming

Shih-Pin Chen; Jr-Fong Dang

2008-10-01T23:59:59.000Z

486

Educational Programs  

NLE Websites -- All DOE Office Websites (Extended Search)

Programs Programs Argonne National Laboratory Educational Programs Search Argonne ... Search Argonne Home > Educational Programs > Welcome Type of Appointments Postdoctoral Newsletters Postdoctoral Office Activities Postdoctoral Programs Alumni Postdoctoral Society of Argonne Newcomers Assistance Office Postdoctoral Resources Postdoctoral Mentoring Program Contact Us Schedule of Career Development Seminars Organized by the Postdoctoral Office for 2011 Here is a schedule of all of our Career Development Seminars and Workshops! Normally, the events happen at lunchtime and food is provided. The topics of these events include: Journal Clubs Career Development Networking We welcome all of our Postdocs and colleagues to and join us! Wednesday January 19 Postdoc Journal Club and pizza lunch. Magnetic Domain-Wall Racetrack Memory

487

Parallel Algorithms for Image Processing on OMC  

Science Conference Proceedings (OSTI)

The author studies a class of VLSI organizations with optical interconnects for fast solutions to several image processing tasks. The organization and operation of these architectures are based on a generic model called OMC, which is used to understand ... Keywords: OMC, computational complexity, computational limits, computerised picture processing, constant time algorithms, fine grain image computing, free space optics, generic model, image processing, optical information processing, optical interconnects, parallel algorithms, parallel algorithms.

Mary Mehrnoosh Eshaghian

1991-07-01T23:59:59.000Z

488

A prolongation-projection algorithm for computing the finite real variety of an ideal  

Science Conference Proceedings (OSTI)

We provide a real algebraic symbolic-numeric algorithm for computing the real variety V"R(I) of an ideal I@?R[x], assuming V"R(I) is finite (while V"C(I) could be infinite). Our approach uses sets of linear functionals on R[x], vanishing on a given set ... Keywords: Finite real variety, Numerical algebraic geometry, Real solving, Semidefinite optimization

Jean B. Lasserre; Monique Laurent; Philipp Rostalski

2009-06-01T23:59:59.000Z

489

Efficient Algorithms for Modeling Reacting Flows  

NLE Websites -- All DOE Office Websites (Extended Search)

the development of efficient numerical algorithms that reduce the time required to model combustion phenomena are of great interest. In this talk I will present the development...

490

IMPROVED ALGORITHMS FOR CONVEX MINIMIZATION IN ...  

E-Print Network (OSTI)

are devoted to the description and analysis of algorithms. In Section ..... constant value and then “finish the job” by taking O(??2??2) additional subgradient steps

491

Dictionary of Algorithms and Data Structures  

Science Conference Proceedings (OSTI)

... [GBY91] Gaston H. Gonnet and Ricardo Baeza-Yates, Handbook of Algorithms and ... [HS83] Ellis Horowitz and Sartaj Sahni, Fundamentals of Data ...

2013-08-23T23:59:59.000Z

492

Dictionary of Algorithms and Data Structures  

Science Conference Proceedings (OSTI)

... Some terms with a leading variable, such as n ... To look up words or phrases, enter them in ... paths alphabet Alpha Skip Search algorithm alternating ...

2013-11-08T23:59:59.000Z

493

BIASED RANDOM-KEY GENETIC ALGORITHMS WITH ...  

E-Print Network (OSTI)

Handbook of Metaheuristics. Kluwer. Academic Publishers, 2003. J.F. Gonçalves and M.G.C. Resende. Biased random-key genetic algorithms for combinatorial ...

494

Solar and Moon Position Algorithm (SAMPA)  

This algorithm calculates the solar and lunar zenith and azimuth angles in the period from the year -2000 to 6000, with uncertainties of +/- 0.0003 ...

495

B. The Multi-objective Genetic Algorithm  

E-Print Network (OSTI)

was no cooperation, then the upper-right part of the boundary curve in between ...... experiments in machine learning using vector evaluated genetic algorithms.

496

?1 Minimization via Randomized First Order Algorithms  

E-Print Network (OSTI)

In this paper we propose randomized first-order algorithms for solving bilinear ...... does not require knowledge of ?) is not worse that the “theoretically optimal” ...

497

Evaluation of On-ramp Control Algorithms  

E-Print Network (OSTI)

metering algorithm - high level design, Final Report, Prepared by NETmetering (SWARM) SWARM (Paesani et al. , 1997; Report 3, 1996) is developed by NET and

Jin, Wenlong; Zhang, Michael

2001-01-01T23:59:59.000Z

498

Available Technologies: Algorithm for Flexible Bandwidth ...  

The general solution to such analysis requires exponential ... the algorithm is of polynomial-time complexity in the worst case scenario, and it is bounded by ...

499

MEMORANDUM OF UNDERSTANDING Between The Numerical Algorithms...  

NLE Websites -- All DOE Office Websites (Extended Search)

Numerical Algorithms Group Ltd (NAG) with a registered address at: Wilkinson House, Jordan hill Road, Oxford, UK and the University of California, as Management and Operating...

500

Student's algorithm solves real-world problem  

NLE Websites -- All DOE Office Websites (Extended Search)

how to use powerful computers to analyze, model, and solve real-world problems," Jordan Medlock wins supercomputer challenge with his algorithm that automates counting and...