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 NEW POLYNOMIAL-TIME ALGORITHM FOR LINEAR PROGRAMMING  

E-Print Network [OSTI]

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

N. Karmarkar

1984-01-01T23:59:59.000Z

2

a nonstandard simplex algorithm for linear programming 1.  

E-Print Network [OSTI]

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

2008-12-29T23:59:59.000Z

3

Linear Programming Environmental  

E-Print Network [OSTI]

Linear Program to control air pollution was developed in 1968 by Teller, which minimized cost Fall 2006 #12;Topics · Introduction · Background · Air · Land · Water #12;Introduction · "The United States spends more than 2% of its gross domestic product on pollution control, and this is more than any

Nagurney, Anna

4

Research on infeasible interior-point algorithms for linear and nonlinear programming. Final technical report, August 1995--August 1997  

SciTech Connect (OSTI)

The current project is a renewal of the PI`s previous projects supported by the Department of Energy. The original funding period for this project was from August 15, 1995 to August 14, 1996. The expiration date of the project was extended at no cost to August 14, 1997 in order to ensure a adequate completion of the original scope of work within the available funds. During this extended project period, the PI moved from the University of Maryland Baltimore County to Rice University. The primary objective of the project was to bring a successful conclusion to an effort of transferring years of research into a freely available software package that are more accessible and user-friendly than then existing technologies in the field. Another objective of the project was to facilitate the transition of the PI`s research concentrations to other areas of practical importance: in particular, to the area of semidefinite programming where interior-point methodology has proven to be most promising. Both the objectives have been successfully accomplished. The software package LIPSOL, a centerpiece of the project, has recently been licensed to The MathWorks Inc. by the University of Maryland Baltimore County for planned incorporation into Matlab as the linear-program solver of Matlab. The PI has also made a number of contributions to the on-going research activities on semidefinite programming and other areas.

Zhang, Yin

1997-09-01T23:59:59.000Z

5

Enhanced algorithms for stochastic programming  

SciTech Connect (OSTI)

In this dissertation, we present some of the recent advances made in solving two-stage stochastic linear programming problems of large size and complexity. Decomposition and sampling are two fundamental components of techniques to solve stochastic optimization problems. We describe improvements to the current techniques in both these areas. We studied different ways of using importance sampling techniques in the context of Stochastic programming, by varying the choice of approximation functions used in this method. We have concluded that approximating the recourse function by a computationally inexpensive piecewise-linear function is highly efficient. This reduced the problem from finding the mean of a computationally expensive functions to finding that of a computationally inexpensive function. Then we implemented various variance reduction techniques to estimate the mean of a piecewise-linear function. This method achieved similar variance reductions in orders of magnitude less time than, when we directly applied variance-reduction techniques directly on the given problem. In solving a stochastic linear program, the expected value problem is usually solved before a stochastic solution and also to speed-up the algorithm by making use of the information obtained from the solution of the expected value problem. We have devised a new decomposition scheme to improve the convergence of this algorithm.

Krishna, A.S.

1993-09-01T23:59:59.000Z

6

Inverse Stochastic Linear Programming  

E-Print Network [OSTI]

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

2007-01-05T23:59:59.000Z

7

Genetic Algorithms Genetic Programming  

E-Print Network [OSTI]

-Locating Robots using Genetic Programming on Evolvable Hardware, Proc. of the Fifth Int. Symp. on Artificial Life node 6 . XILINX XC6216 FPGA V.C.C. H.O.T. (Hardware Object Technology) . host PC PCI slot , serial-0920-107-2) 5. [1] T. Higuchi, et al. Real-world Applications of Analog and Digital Evolvable Hardware, IEEE

8

A linearly constrained adaptive algorithm for seismic array processing  

E-Print Network [OSTI]

is described. The constrained IPS adaptive algorithm of Frost ( 1972) is derived from this linearly constrained LNS algorithm and compared with other algorithms. Theoretical analyses show that the constrained LMS adaptive algorithm is able to provide1 a... better than simple channel-averaging. hut in the case of the real seismic data, it takes advantage of the coher- ence feature of noise between channels to reduce the noise power. Further experiments indicate that the constrained LNS adaptive algorithm...

Byun, Bok Sub

2012-06-07T23:59:59.000Z

9

An Efficient Dual Algorithm for Vectorless Power Grid Verification under Linear Current Constraints  

E-Print Network [OSTI]

An Efficient Dual Algorithm for Vectorless Power Grid Verification under Linear Current Constraints, Chicago, IL 60616, USA ABSTRACT Vectorless power grid verification makes it possible to eval- uate worst, the vectorless power grid verification problem can be formulated and solved as a linear programming (LP) problem

Wang, Jia

10

Decomposing Linear Programs for Parallel Solution?  

E-Print Network [OSTI]

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

?atalyürek, ?mit V.

11

Decomposing Linear Programs for Parallel Solution ?  

E-Print Network [OSTI]

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

?atalyürek, ?mit V.

12

Algorithmics Towards programming as a mathematical activity  

E-Print Network [OSTI]

Algorithmics Towards programming as a mathematical activity Lambert Meenens Centre for Mathematics inefficient--algorithm, and to improve it by successively applying correctness-preserving transformations to this method are the verbosity of algorithmic notations, making the process cumber- some, and the semantic

Meertens, Lambert

13

The Next Linear Collider Program  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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 |

14

Safe bounds in linear and mixed-integer programming  

E-Print Network [OSTI]

Abstract: Current mixed-integer linear programming solvers are based on linear programming routines that use floating point arithmetic. Occasionally, this leads...

Arnold Neumaier

15

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

E-Print Network [OSTI]

Since problems of the form (5) mostly include high-dimensional data, optimization schemes should avoid ..... applying linear mappings, the complexity of an algorithm can be measured by counting the number of ..... Two standard choices of discrete ...... The interface to each subprogram in the package is fully documented in.

2014-05-26T23:59:59.000Z

16

APPLICATION OF NEURAL NETWORK ALGORITHMS FOR BPM LINEARIZATION  

SciTech Connect (OSTI)

Stripline BPM sensors contain inherent non-linearities, as a result of field distortions from the pickup elements. Many methods have been devised to facilitate corrections, often employing polynomial fitting. The cost of computation makes real-time correction difficult, particulalry when integer math is utilized. The application of neural-network technology, particularly the multi-layer perceptron algorithm, is proposed as an efficient alternative for electrode linearization. A process of supervised learning is initially used to determine the weighting coefficients, which are subsequently applied to the incoming electrode data. A non-linear layer, known as an ?activation layer,? is responsible for the removal of saturation effects. Implementation of a perceptron in an FPGA-based software-defined radio (SDR) is presented, along with performance comparisons. In addition, efficient calculation of the sigmoidal activation function via the CORDIC algorithm is presented.

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

2012-11-01T23:59:59.000Z

17

A scenario decomposition algorithm for 0-1 stochastic programs  

E-Print Network [OSTI]

Jul 19, 2013 ... Abstract: We propose a scenario decomposition algorithm for stochastic 0-1 programs. The algorithm recovers an optimal solution by iteratively...

Shabbir Ahmed

2013-07-19T23:59:59.000Z

18

Evolving Distributed Algorithms with Genetic Programming: Election  

E-Print Network [OSTI]

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

Fernandez, Thomas

19

Optimized groundwater containment using linear programming  

SciTech Connect (OSTI)

Groundwater extraction systems are typically installed to contain contaminant plumes. These systems are expensive to install and maintain. A traditional approach to designing such a wellfield is to use a series of trial-and-error simulations to test the effects of various well locations and pump rates. However, optimal locations and pump rates of extraction wells are difficult to determine when the objectives of the potential pumping scheme and the site hydrogeology are considered. This paper describes a case study of an application of linear programming theory to determine optimal well placement and pump rates. Calculations were conducted by using ModMan to link a calibrated MODFLOW flow model with LINDO, a linear programming package. Past activities at the site under study included disposal of contaminants in pits. Several groundwater plumes have been identified, and others may be present. The area of concern is bordered on three sides by a wetland, which receives a portion of its input water budget as groundwater discharge from the disposal area. The objective function of the optimization was to minimize the rate of groundwater extraction while preventing discharge to the marsh across a user-specified boundary. In this manner, the optimization routine selects well locations and pump rates to produce a groundwater divide along this boundary.

Quinn, J.J.; Johnson, R.L.; Durham, L.A.

1998-07-01T23:59:59.000Z

20

An Augmented Primal-Dual Method for Linear Conic Programs  

E-Print Network [OSTI]

Apr 11, 2007 ... We propose a new iterative approach for solving linear programs over ...... for the random number generator to make the data reproducible.

2007-04-11T23:59:59.000Z

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


21

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

E-Print Network [OSTI]

Large-Scale Linear Programming Techniques for the Design of Protein Folding Potentials. Michael Wagner (mwagner ***at*** odu.edu) Jaroslaw Meller (jmeller

Michael Wagner

22

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

E-Print Network [OSTI]

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

Aleksandra Petrovic

2014-05-22T23:59:59.000Z

23

On a new collection of stochastic linear programming test problems  

E-Print Network [OSTI]

Abstract: The purpose of this paper is to introduce a new test problem collection for stochastic linear programming that the authors have recently begun to...

K. A. Ariyawansa

24

Optimized remedial groundwater extraction using linear programming  

SciTech Connect (OSTI)

Groundwater extraction systems are typically installed to remediate contaminant plumes or prevent further spread of contamination. These systems are expensive to install and maintain. A traditional approach to designing such a wellfield uses a series of trial-and-error simulations to test the effects of various well locations and pump rates. However, the optimal locations and pump rates of extraction wells are difficult to determine when objectives related to the site hydrogeology and potential pumping scheme are considered. This paper describes a case study of an application of linear programming theory to determine optimal well placement and pump rates. The objectives of the pumping scheme were to contain contaminant migration and reduce contaminant concentrations while minimizing the total amount of water pumped and treated. Past site activities at the area under study included disposal of contaminants in pits. Several groundwater plumes have been identified, and others may be present. The area of concern is bordered on three sides by a wetland, which receives a portion of its input budget as groundwater discharge from the pits. Optimization of the containment pumping scheme was intended to meet three goals: (1) prevent discharge of contaminated groundwater to the wetland, (2) minimize the total water pumped and treated (cost benefit), and (3) avoid dewatering of the wetland (cost and ecological benefits). Possible well locations were placed at known source areas. To constrain the problem, the optimization program was instructed to prevent any flow toward the wetland along a user-specified border. In this manner, the optimization routine selects well locations and pump rates so that a groundwater divide is produced along this boundary.

Quinn, J.J.

1995-12-31T23:59:59.000Z

25

The Next Linear Collider Klystron Development Program  

E-Print Network [OSTI]

Klystrons capable of 75 MW output power at 11.4 GHz have been under development at SLAC for the last decade. The work has been part of the program to realize all the components necessary for the construction of the Next Linear Collider (NLC). The effort has produced a family of solenoid-focused 50 MW klystrons, which are currently powering a 0.5 GeV test accelerator at SLAC and several test stands, where high power components are evaluated and fundamental research is performed studying rf breakdown and dark current production. Continuing development has resulted in a Periodic Permanent Magnet (PPM) focused 50 MW klystron, tested at SLAC and subsequently contracted for manufacture by industry in England and Japan. A 75 MW version of that PPM klystron was built at SLAC and reached 75 MW, with 2.8 microsecond pulses. Based on this design, a prototype 75 MW klystron, designed for low-cost manufacture, is currently under development at SLAC, and will eventually be procured from industry in modest quantities for ad...

Jongewaard, E; Pearson, C; Phillips, R M; Sprehn, D; Vlieks, A E

2000-01-01T23:59:59.000Z

26

Linear Programming: Penn State Math 484 Lecture Notes  

E-Print Network [OSTI]

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

Squicciarini, Anna Cinzia

27

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

E-Print Network [OSTI]

High Performance Computing linear algorithms for two-phase flow in porous media Robert Eymard High Performance Computing techniques. This implies to handle the difficult problem of solving

Paris-Sud XI, Université de

28

Solutions of differential equations by linear programming techniques  

E-Print Network [OSTI]

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

Saye, Jake Lee

2012-06-07T23:59:59.000Z

29

On Programs with Linearly Ordered Multiple Preferences  

E-Print Network [OSTI]

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

Vermeir, Dirk

30

Approximate Linear Programming for Firstorder MDPs Scott Sanner  

E-Print Network [OSTI]

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

Sanner, Scott

31

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

2012-01-15T23:59:59.000Z

32

On Programs with Linearly Ordered Multiple Preferences  

E-Print Network [OSTI]

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

Vermeir, Dirk

33

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

SciTech Connect (OSTI)

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

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

1993-12-31T23:59:59.000Z

34

Application of linear programming redispatch technique to dynamic generation allocation  

SciTech Connect (OSTI)

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

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

1990-02-01T23:59:59.000Z

35

DYNAMIC PROGRAMMING ALGORITHM FOR RATE-DISTORTION OPTIMIZED MEDIA STREAMING  

E-Print Network [OSTI]

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

Reiterer, Harald

36

Representing the space of linear programs as a Grassmannian  

E-Print Network [OSTI]

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

2006-03-01T23:59:59.000Z

37

Capacity expansion analysis in a chemical plant using linear programming  

Science Journals Connector (OSTI)

An analysis of the fuel additive production process of a US mid-western chemical manufacturer is described. Material balance constraints for each potential bottleneck of the manufacturing process are included as part of a linear programming model. Several capacity expansion scenarios are evaluated. The optimal way of modifying and expanding manufacturing capacity to meet forecast demand is determined.

Kenneth H. Myers; Reuven R. Levary

1996-01-01T23:59:59.000Z

38

Prismatic Algorithm for Discrete D.C. Programming Problems  

E-Print Network [OSTI]

In this paper, we propose the first exact algorithm for minimizing the difference of two submodular functions (D.S.), i.e., the discrete version of the D.C. programming problem. The developed algorithm is a branch-and-bound-based algorithm which responds to the structure of this problem through the relationship between submodularity and convexity. The D.S. programming problem covers a broad range of applications in machine learning because this generalizes the optimization of a wide class of set functions. We empirically investigate the performance of our algorithm, and illustrate the difference between exact and approximate solutions respectively obtained by the proposed and existing algorithms in feature selection and discriminative structure learning.

Kawahara, Yoshinobu

2011-01-01T23:59:59.000Z

39

TWO-PHASE NONPARAMETRIC ICA ALGORITHM FOR BLIND SEPARATION OF INSTANTANEOUS LINEAR MIXTURES  

E-Print Network [OSTI]

We propose a nonparametric independent component analysis (ICA) algorithm for the problem of blind source separation with instantaneous, time-invariant and linear mixtures. Our Init-NLE algorithm combines minimization of correlation among nonlinear expansions of the output signals with a good initialization derived from search guided by statistical tests for independence based on the power-divergent family of test statistics. Such initialization is critical to reliable separation. The simulation results obtained from both synthetic and real-life data show that our method yields consistent results and compares favorably to the existing ICA algorithms. 1.

Chin-jen Ku; Terrence L. Fine

40

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

E-Print Network [OSTI]

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

Fowler, Mark

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

EECS 495: Randomized Algorithms Lecture 10 Semi-definite Programming  

E-Print Network [OSTI]

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

Immorlica, Nicole

42

How bad is a gradient algorithm for linear programming?  

E-Print Network [OSTI]

Apr 20, 2011 ... As extensively discussed in the literature several pivot selection criteria .... The presentation in the preceding material has been rather loose,...

peter

2011-04-20T23:59:59.000Z

43

An Algorithm for Nonlinear Optimization Using Linear Programming ...  

E-Print Network [OSTI]

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

44

Coupling Climate Damages and GHG Abatement Costs in a Linear Programming Framework  

Science Journals Connector (OSTI)

The paper discusses the coupling of non-linear non-convex damage costs due to climate change with a cost-efficiency analysis based on a technical-economic linear programming model like MARKAL and studies the impl...

M. Labriet; R. Loulou

2003-09-01T23:59:59.000Z

45

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

E-Print Network [OSTI]

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

Wismath, Stephen

46

Invited Review Article: Measurement uncertainty of linear phase-stepping algorithms  

SciTech Connect (OSTI)

Phase retrieval techniques are widely used in optics, imaging and electronics. Originating in signal theory, they were introduced to interferometry around 1970. Over the years, many robust phase-stepping techniques have been developed that minimize specific experimental influence quantities such as phase step errors or higher harmonic components of the signal. However, optimizing a technique for a specific influence quantity can compromise its performance with regard to others. We present a consistent quantitative analysis of phase measurement uncertainty for the generalized linear phase stepping algorithm with nominally equal phase stepping angles thereby reviewing and generalizing several results that have been reported in literature. All influence quantities are treated on equal footing, and correlations between them are described in a consistent way. For the special case of classical N-bucket algorithms, we present analytical formulae that describe the combined variance as a function of the phase angle values. For the general Arctan algorithms, we derive expressions for the measurement uncertainty averaged over the full 2{pi}-range of phase angles. We also give an upper bound for the measurement uncertainty which can be expressed as being proportional to an algorithm specific factor. Tabular compilations help the reader to quickly assess the uncertainties that are involved with his or her technique.

Hack, Erwin [EMPA, Laboratory Electronics/Metrology/Reliability, Ueberlandstrasse 129, CH-8600 Duebendorf (Switzerland); Burke, Jan [Australian Centre for Precision Optics, CSIRO (Commonwealth Scientific and Industrial Research Organisation) Materials Science and Engineering, P.O. Box 218, Lindfield, NSW 2070 (Australia)

2011-06-15T23:59:59.000Z

47

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

E-Print Network [OSTI]

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

peter bruijs

2015-01-06T23:59:59.000Z

48

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

E-Print Network [OSTI]

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

Dennis, Brian

49

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

E-Print Network [OSTI]

the nominal data, and not data in a neighborhood) for computing or estimating the calmness modulus of the optimal set (argmin) mapping in linear optimization

2014-06-18T23:59:59.000Z

50

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

E-Print Network [OSTI]

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

Watson, Warren Wallace

2012-06-07T23:59:59.000Z

51

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

E-Print Network [OSTI]

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

2005-04-19T23:59:59.000Z

52

The Slater condition is generic in linear conic programming  

E-Print Network [OSTI]

Nov 9, 2012 ... of the ball does not contain points of T . Therefore, ...... Pataki G., The geometry of semidefinite programming, 2965, Handbook of Semidefinite.

2012-11-09T23:59:59.000Z

53

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

E-Print Network [OSTI]

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

2013-06-16T23:59:59.000Z

54

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

E-Print Network [OSTI]

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

Marco Colombo

2006-08-29T23:59:59.000Z

55

A fuzzy linear programming approach to the load shedding and generation reallocation problem  

Science Journals Connector (OSTI)

In this article, an effective method to control a power system during emergency conditions is presented. Based on Fuzzy Linear Programming (FLP), a new technique is developed to solve the Load Shedding and Generation Reallocation (LSGR) optimization ...

R. Hooshmand; V. Tahani; H. Seifi

1998-12-01T23:59:59.000Z

56

Linear Program to Select Energy Conservation Projects in an Existing Facility  

E-Print Network [OSTI]

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

Mak, J. Y.

1983-01-01T23:59:59.000Z

57

Advanced Algorithms Course. Lecture Notes. Part 4  

E-Print Network [OSTI]

algorithms for Weighted Vertex Cover, but this was only an example to demonstrate the technique of LP for Vertex Cover. In general (for any set miniAdvanced Algorithms Course. Lecture Notes. Part 4 Using Linear Programming for Approximation

Damaschke, Peter

58

Mirage: an interpreted programming environment for algorithm animation  

E-Print Network [OSTI]

occurs uautomai really' as thc algorithm ih executed. Th~re ar&. tlvo levels of binding 1)ettveen cence]drual al oriihrnil' operations autl alllnldtlon d(:I Icosa 20 Firstly, both particular variables in an algorithm and entire datatypes can... occurs uautomai really' as thc algorithm ih executed. Th~re ar&. tlvo levels of binding 1)ettveen cence]drual al oriihrnil' operations autl alllnldtlon d(:I Icosa 20 Firstly, both particular variables in an algorithm and entire datatypes can...

Smith, Bryan Craig

2012-06-07T23:59:59.000Z

59

Non-linear multiparameter inversion using a hybrid global search algorithm: applications in reflection seismology  

Science Journals Connector (OSTI)

......global search algorithm: applications in reflection seismology Pengcheng Liu 1 Stephen Hartzell 2 William Stephenson 2 1 Institute...global search algorithm: applications in reflection seismology Pengcheng Liu,' Stephen Hartzel12and William Stephenson2 'lnstiture......

Pengcheng Liu; Stephen Hartzell; William Stephenson

1995-12-01T23:59:59.000Z

60

The MARX Modulator Development Program for the International Linear Collider  

SciTech Connect (OSTI)

The ILC Marx Modulator Development Program at SLAC is working towards developing a full-scale ILC Marx ''Reference Design'' modulator prototype, with the goal of significantly reducing the size and cost of the ILC modulator while improving overall modulator efficiency and availability. The ILC Reference Design prototype will provide a proof-of-concept model to industry in advance of Phase II SBIR funding, and also allow operation of the new 10MW L-Band Klystron prototypes immediately upon their arrival at SLAC.

Leyh, G.E.; /SLAC

2006-06-12T23: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

On the integer max-linear programming problem Peter Butkovic1,  

E-Print Network [OSTI]

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

Butkovic, Peter

62

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

SciTech Connect (OSTI)

The technique that was used to build the EigCG algorithm for sparse symmetric linear systems is extended to the nonsymmetric case using the BiCG algorithm. We show that, similarly to the symmetric case, we can build an algorithm that is capable of computing a few smallest magnitude eigenvalues and their corresponding left and right eigenvectors of a nonsymmetric matrix using only a small window of the BiCG residuals while simultaneously solving a linear system with that matrix. For a system with multiple right-hand sides, we give an algorithm that computes incrementally more eigenvalues while solving the first few systems and then uses the computed eigenvectors to deflate BiCGStab for the remaining systems. Our experiments on various test problems, including Lattice QCD, show the remarkable ability of EigBiCG to compute spectral approximations with accuracy comparable to that of the unrestarted, nonsymmetric Lanczos. Furthermore, our incremental EigBiCG followed by appropriately restarted and deflated BiCGStab provides a competitive method for systems with multiple right-hand sides.

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

2014-08-01T23:59:59.000Z

63

ANGEL program: Solution of large systems of linear differential equations describing nonstationary processes using CUDA technology  

SciTech Connect (OSTI)

This paper presents the formulation of the problem and the methodical approach for solving large systems of linear differential equations describing nonstationary processes with the use of CUDA technology; this approach is implemented in the ANGEL program. Results for a test problem on transport of radioactive products over loops of a nuclear power plant are given. The possibilities for the use of the ANGEL program for solving various problems that simulate arbitrary nonstationary processes are discussed.

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

2012-12-15T23:59:59.000Z

64

A Dynamic Programming Algorithm for RNA Structure Prediction Including Pseudoknots  

E-Print Network [OSTI]

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

Eddy, Sean

65

A dynamic programming algorithm for RNA structure prediction including pseudoknots  

E-Print Network [OSTI]

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

Eddy, Sean

66

How to Analyze the Results of Linear Programs-Part 2: Price Interpretation  

E-Print Network [OSTI]

as total demand: 2,sl 2 C,d,. The cost to ship one unit from the i-th supplier to the j-th consumer is c, the dual linear program is given by maximize C dlrl - C SIX, I I The dual constraint says, in effect: (1) 'Two suppliers that ship t

Greenberg, Harvey J.

67

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

SciTech Connect (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

68

An Algorithm for Large-Scale Quadratic Programming  

Science Journals Connector (OSTI)

......QUADRATIC PROGRAMMING 3 1 9 TABLE 6.5 Results for test problem class 4 Test problem Blend (A) Blend (B) Boeing 1 (A) Boeing 1 (B) Boeing 2 (A) Boeing 2 (B) Stair (A) Stair (B) 7. Conclusions n 114 114 726 726 304 304 532 532 m 74 74......

NICHOLAS I. M. GOULD

1991-07-01T23:59:59.000Z

69

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

E-Print Network [OSTI]

variable boundary conditions. A model of the calculus ot variations approach to solving these problems was deve]oped in the past two years by R. G. Thompson snd N. D. George at the Ifniversity of Missouri. This re. catch investigates the feasibility.... '"he linear programming problems from the Thompson-George ", . odel were computed on the 1BM 360/65, using Mathematical Proeram- miug System/360. The solutions aro compared with solutions provided through the calculus of variations technique, which...

Goeble, Harold Everett

2012-06-07T23:59:59.000Z

70

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

E-Print Network [OSTI]

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

Malik, Ejaz

2009-05-15T23:59:59.000Z

71

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

E-Print Network [OSTI]

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

Powell, Warren B.

72

Tafel Musik: Formatting algorithm of tables  

Science Journals Connector (OSTI)

This paper provides a description on the formatting algorithm of tables that the authors have developed. This algorithm is an important component of the so called TafeMusik (Tafel Musik) environment. TafeMusikprovides the user with an environment to ... Keywords: First-fit algorithm, Linear programming, Optimization, Tables, Tabular formatting, Tabular layout

K. -H. Shin; K. Kobayashi; A. Suzuki

1997-07-01T23:59:59.000Z

73

A GIS-LIKE TRAINING ALGORITHM FOR LOG-LINEAR MODELS WITH HIDDEN Georg Heigold, Thomas Deselaers, Ralf Schluter, and Hermann Ney  

E-Print Network [OSTI]

A GIS-LIKE TRAINING ALGORITHM FOR LOG-LINEAR MODELS WITH HIDDEN VARIABLES Georg Heigold, Thomas with Generalized Iterative Scal- ing (GIS). GIS offers, upon others, the immediate advantages that it is locally convergent, completely parameter free, and guarantees an improvement of the criterion in each step. GIS

Deselaers, Thomas

74

Heuristic algorithms vs. linear programs for designing efficient conservation reserve networks: Evaluation of solution  

E-Print Network [OSTI]

.vanderkam@ec.gc.ca (R.P.D. Vanderkam), ywiersma@mun.ca (Y.F. Wiersma), doug_king@carleton.ca (D.J. King). B I O L O G I

75

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

E-Print Network [OSTI]

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

Scott, Alexander Alexander

76

Primal-Dual Combinatorial Algorithms May 8, 2009  

E-Print Network [OSTI]

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3 Primal Dual Algorithms for Fractional Packing and Covering 9 3.1 Feasibility Problem algorithm for fractional packing and covering, which greatly outperformed previous approaches on the a largePrimal-Dual Combinatorial Algorithms Qihui Zhu May 8, 2009 #12;ABSTRACT Linear program and its

Plotkin, Joshua B.

77

Approximation Algorithms for Maximization Problems arising in  

E-Print Network [OSTI]

Approximation Algorithms for Maximization Problems arising in Graph Partitioning Thesis for the M of size k that maximizes : Max­k­Vertex Cover : the weight of edges incident with vertices in U . Max a number of approximation algorithms based on linear and semidefinite programming, and obtain approximation

Langberg, Michael

78

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

E-Print Network [OSTI]

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

Grossmann, Ignacio E.

79

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

E-Print Network [OSTI]

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

Yong, Alexander

80

Priority Based Reservoir Optimization using Linear Programming: Application to Flood Operation of the Iowa/Des Moines River System  

E-Print Network [OSTI]

for preservation of selected operating priorities and the effect that operating constraints have on systemPriority Based Reservoir Optimization using Linear Programming: Application to Flood Operation of the Iowa/Des Moines River System By MATTHEW JASON BROWN B.S. (The Pennsylvania State University) 1995

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.


81

Assessing plantation biomass for co-firing with coal in northern Indiana: A linear programming approach  

Science Journals Connector (OSTI)

Tightening environmental regulations and the signing of the Kyoto Protocol have prompted electric utilities to consider co-firing biomass with coal to reduce the levels of CO2, SO2, and \\{NOx\\} in stack emissions. This analysis examines the cost competitiveness of plantation produced woody biomass and waste wood with coal in electricity production. A case study of woody biomass production and co-firing in northern Indiana is presented. A Salix (willow) production budget was created to assess the feasibility of plantation tree production to supply biomass to the utility for fuel blending. Co-firing with waste wood from primary and secondary wood processing activities and local municipalities also is considered. A linear programming model was developed to examine the optimal co-firing blend of coal and biomass while minimizing variable cost, including the cost of ash disposal and material procurement costs. This model was used to examine situations where coal is the primary fuel and waste wood, willow trees, or both are available for fuel blending. The results indicate that co-firing woody biomass is cost-effective for the power plant. Sensitivity analysis explored the effect of waste wood prices on co-firing cost.

Sara Nienow; Kevin T McNamara; Andrew R Gillespie

2000-01-01T23:59:59.000Z

82

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

SciTech Connect (OSTI)

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

Hart, W.E.

1999-02-10T23:59:59.000Z

83

Finding Space-Time Transformations for Uniform Recurrences viaBranching Parametric Linear Programming  

Science Journals Connector (OSTI)

Many important algorithms in signal and image processing can be described by uniform recurrences. A common method for the synthesis of systolic arrays from uniform recurrences is based on space-time transformations each of which consisting of two ...

Karl-Heinz Zimmermann; Wolfgang Achtziger

1997-03-01T23:59:59.000Z

84

Application of a dynamic linear programming model for optimum use of range resources over time  

E-Print Network [OSTI]

of Native Rangeland by Sites? 69 8 Program I-A: Optimum Solution for 2, 250 Acre Ranch With No Cropland, All Livestock Activities Considered and Income Discounted at 16 Peroent? 85 9 Program I-B: Optimum Solution for 2, 250 Acre Ranch With 15 Percent... Cropland, All Livestock Activities Considered and. Income Discounted at 16 Percent 89 10 Chaining and Spraying Compared for Programs I-A and I-B -~ ? - 93 11 Program II-A: Optimum Solution for 2, 250 Acre Ranch with No Cropland, Stocker Activities...

Sharp, Wayne Winston

2012-06-07T23:59:59.000Z

85

Progress in the dual simplex method for large scale LP problems: practical dual phase 1 algorithms  

Science Journals Connector (OSTI)

The dual simplex algorithm has become a strong contender in solving large scale LP problems. One key problem of any dual simplex algorithm is to obtain a dual feasible basis as a starting point. We give an overview of methods which have been proposed ... Keywords: Dual simplex algorithm, Linear programming, Mathematical optimization system (MOPS)

Achim Koberstein; Uwe H. Suhl

2007-05-01T23:59:59.000Z

86

Computer-assisted Modelling and Analysis of Linear Programming Problems: Towards a Unified Framework  

Science Journals Connector (OSTI)

......Institute, ULCA. Also to appear in Management Science. [8] GEOFFRION, A. M...Working Paper No. 338, Western Management Science Institute, UCLA. [9] GREENBERG...programming problems: A unified approach towards automatic reformulation......

HARVEY J. GREENBERG; CORMAC LUCAS; GAUTAM MITRA

1986-01-01T23:59:59.000Z

87

A simple algorithm improves mass accuracy to 50-100 ppm for delayed extraction linear MALDI-TOF mass spectrometry  

SciTech Connect (OSTI)

A simple mathematical technique for improving mass calibration accuracy of linear delayed extraction matrix assisted laser desorption ionization time-of-flight mass spectrometry (DE MALDI-TOF MS) spectra is presented. The method involves fitting a parabola to a plot of Dm vs. mass data where Dm is the difference between the theoretical mass of calibrants and the mass obtained from a linear relationship between the square root of m/z and ion time of flight. The quadratic equation that describes the parabola is then used to correct the mass of unknowns by subtracting the deviation predicted by the quadratic equation from measured data. By subtracting the value of the parabola at each mass from the calibrated data, the accuracy of mass data points can be improved by factors of 10 or more. This method produces highly similar results whether or not initial ion velocity is accounted for in the calibration equation; consequently, there is no need to depend on that uncertain parameter when using the quadratic correction. This method can be used to correct the internally calibrated masses of protein digest peaks. The effect of nitrocellulose as a matrix additive is also briefly discussed, and it is shown that using nitrocellulose as an additive to a CHCA matrix does not significantly change initial ion velocity but does change the average position of ions relative to the sample electrode at the instant the extraction voltage is applied.

Hack, Christopher A.; Benner, W. Henry

2001-10-31T23:59:59.000Z

88

Interfacing Matlab algorithms and functions to Scala programming language using Matlab standalone packages.  

E-Print Network [OSTI]

??Scala is a modern multi-paradigm programming language which combines the features of functional and object-oriented programming. Matlab is widely used by academic, research institutions as (more)

Nalamalapu, Sravanthi

2014-01-01T23:59:59.000Z

89

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

SciTech Connect (OSTI)

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

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

2011-08-15T23:59:59.000Z

90

Commissioning of Photon Beams of a Flattening Filter-Free Linear Accelerator and the Accuracy of Beam Modeling Using an Anisotropic Analytical Algorithm;TrueBeam; Flattening filter free; Commissioning; Anisotropic analytical algorithm  

SciTech Connect (OSTI)

Purpose: To investigate dosimetric characteristics of a new linear accelerator designed to deliver flattened, as well as flattening filter-free (FFF), beams. To evaluate the accuracy of beam modeling under physical conditions using an anisotropic analytical algorithm. Methods and Materials: Dosimetric data including depth dose curves, profiles, surface dose, penumbra, out-of-field dose, output, total and scatter factors were examined for four beams (X6, X6FFF, X10, and X10FFF) of Varian's TrueBeam machine. Beams modeled by anisotropic analytical algorithm were compared with measured dataset. Results: FFF beams have lower mean energy (tissue-phantom ratio at the depths of 20 and 10 cm (TPR 20/10): X6, 0.667; X6FFF, 0.631; X10, 0.738; X10FFF, 0.692); maximum dose is located closer to the surface; and surface dose increases by 10%. FFF profiles have sharper but faster diverging penumbra. For small fields and shallow depths, dose outside a field is lower for FFF beams; however, the advantage fades with increasing phantom scatter. Output increases 2.26 times for X6FFF and 4.03 times for X10FFF and is less variable with field size; collimator exchange effect is reduced. A good agreement between modeled and measured data is observed. Criteria of 2% depth-dose and 2-mm distance-to-agreement are always met. Conclusion: Reference dosimetric characteristics of TrueBeam photon bundles were obtained, and successful modeling of the beams was achieved.

Hrbacek, Jan, E-mail: jan.hrbacek@usz.ch [Department of Radiation Oncology, University Hospital Zuerich, Zuerich (Switzerland); Lang, Stephanie; Kloeck, Stephan [Department of Radiation Oncology, University Hospital Zuerich, Zuerich (Switzerland)

2011-07-15T23:59:59.000Z

91

DSDP3: Dual Scaling Algorithm for General Positive Semide nite Programming  

E-Print Network [OSTI]

of Management Sciences The University of Iowa Iowa City, IA 52242, U.S.A. February 12, 2001 Abstract We Computing Research, U.S. Department of Energy, under Contract W-31-109-Eng-38. 1 #12; 1 Introduction assume the matrices A i are linearly independent, meaning that P m i=1 y i A i = 0 implies y 1

Ye, Yinyu

92

A Set of Dynamic Programming Algorithms for Haplotype Block Partitioning and Tag SNP Selection via Haplotype  

E-Print Network [OSTI]

and Computational Biology Program Department of Biological Sciences University of Southern California 1042 West 36thD Department of Biological Sciences University of Southern California 1042 W. 36th Place DRB-288 Los Angeles variation in LD patterns across the human genome (Dunning et al., 2000; Taillon-Miller et al., 2000

Sun, Fengzhu - Sun, Fengzhu

93

ALGORITHMS FOR CONSTRUCTING COMPARATIVE MAPS  

E-Print Network [OSTI]

. In this paper we present e#cient algorithms that help in automating this e#ort and o#er an explicit setALGORITHMS FOR CONSTRUCTING COMPARATIVE MAPS Debra S. Goldberg Susan McCouch Jon Kleinberg expert analysis, a simple linear algorithm, and a more complex stack­based algorithm. All three methods

Kleinberg, Jon

94

Randomized Algorithms Robert Elsasser  

E-Print Network [OSTI]

Randomized Algorithms Robert Els¨asser 15. June 2011 Program of the day: · Random walks on graphs Robert Els¨asser Universit¨at Paderborn Randomized Algorithms SS 11 0 #12;Markov Chains and Random Walks¨asser Universit¨at Paderborn Randomized Algorithms SS 11 1 #12;Markov Chains and Random Walks A Markov chain M

Elsässer, Robert

95

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

SciTech Connect (OSTI)

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

96

E-Print Network 3.0 - application genetic algorithms Sample Search...  

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

algorithms Page: << < 1 2 3 4 5 > >> 1 Foundations Algorithm Components Numerical Optimization Genetic Programming Genetic Algorithms Summary: Algorithm Components Numerical...

97

Independent Oversight Inspection, Stanford Linear Accelerator...  

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

Stanford Linear Accelerator Center - January 2007 January 2007 Inspection of Environment, Safety, and Health Programs at the Stanford Linear Accelerator Center This report...

98

Local Linear Learned Image Processing Pipeline  

Science Journals Connector (OSTI)

The local linear learned (L3) algorithm is presented that simultaneously performs the demosaicking, denoising, and color transform calculations of an image processing pipeline for a...

Lansel, Steven; Wandell, Brian

99

CUDA programs for GPU computing of Swendsen-Wang multi-cluster spin flip algorithm: 2D and 3D Ising, Potts, and XY models  

E-Print Network [OSTI]

We present sample CUDA programs for the GPU computing of the Swendsen-Wang multi-cluster spin flip algorithm. We deal with the classical spin models; the Ising model, the $q$-state Potts model, and the classical XY model. As for the lattice, both the 2D (square) lattice and the 3D (simple cubic) lattice are treated. We already reported the idea of the GPU implementation for 2D models [Comput. Phys. Commun. 183 (2012) 1155-1161]. We here explain the details of sample programs, and discuss the performance of the present GPU implementation for the 3D Ising and XY models. We also show the calculated results of the moment ratio for these models, and discuss phase transitions.

Komura, Yukihiro

2014-01-01T23:59:59.000Z

100

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

E-Print Network [OSTI]

A Smart Algorithm for the Diagnosis of Short-Circuit Faults in a Photovoltaic Generator Wail Rezgui observations distributed over classes is used for simulation purposes. Keywords--Photovoltaic generator, SVM, k-NN, short-circuit fault, smart classification, linear programming. NOMENCLATURE PV = Photovoltaic; SVM

Paris-Sud XI, Université de

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

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

-regular bipartite graph has a perfect matching. Definition 3: A vertex cover of a graph G = (V, E) is a set Q VGraph Algorithms Robert Els¨asser 10 November 2011 Program of the day: · Matchings in bipartite graphs Robert Els¨asser Universit¨at Paderborn Graph Algorithms WS 11/12 0 #12;5. Matchings in bipartite

Elsässer, Robert

102

Studienarbeit Tuning Algorithms for  

E-Print Network [OSTI]

-time algorithms when k is fixed. (For example, given a graph, decide if it has a Vertex Cover of size at most k solution for Vertex Cover or Dominating Set is determined with the help of dynamic programming, whichStudienarbeit Tuning Algorithms for Hard Planar Graph Problems Frederic Dorn Betreuer: Dipl

Fomin, Fedor V.

103

Linear Accelerator  

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

Linear Accelerator (LINAC) The core of the LANSCE facility is one of the nation's most powerful proton linear accelerators or LINAC. The LINAC at LANSCE has served the nation since...

104

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

SciTech Connect (OSTI)

The goal of this research 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.

Jeff Linderoth

2008-10-10T23:59:59.000Z

105

The Next Linear Collider Program  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

106

Decomposition in Integer Linear Programming  

E-Print Network [OSTI]

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

2005-08-16T23:59:59.000Z

107

Multiparametric linear fractional functionals programming  

Science Journals Connector (OSTI)

En este trabajo se genera un programa de funciones multiparamtricas lneo-fraccionales cuyos parmetros aparecen slo en la funcin objetiva. La solucin ptima de este programa paramtrico trata de mantener ...

S. S. Chada

1989-12-01T23:59:59.000Z

108

. MILP (Mixed Integer Linear Programming)  

E-Print Network [OSTI]

f yi f ~T . N , , , , . eui k = uj k|(i,j) A ¯ , eUi k = ^ ui k eui k ~T , eUi = h eUi 0 · · · eUi N-1 iT , Qu, Qp, Qv, eQp, eQv, Qrp, Qrv, eQrp, eQrv , i . Ji = min eUi N-1X k=0 li k li k = Qu eUi k

109

Programming  

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

provided on the Cray systems at NERSC. The Programming Environment is managed by a meta-module named similar to "PrgEnv-gnu4.6". The "gnu" indicates that it is providing the GNU...

110

Standards for graph algorithm primitives  

E-Print Network [OSTI]

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

Mattson, Tim

111

An Algorithm for Bootstrapping Communications  

E-Print Network [OSTI]

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

Beal, Jacob

2001-08-13T23:59:59.000Z

112

Graph Algorithms Robert Elsasser  

E-Print Network [OSTI]

. Definition 3: A vertex cover of a graph G = (V, E) is a set Q V , such that each edge of E is incidentGraph Algorithms Robert Els¨asser 17 November 2011 Program of the day: · Matchings in bipartite graphs Robert Els¨asser Universit¨at Paderborn Graph Algorithms WS 11/12 0 #12;5. Matchings in bipartite

Elsässer, Robert

113

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

114

A FAST ALGORITHM FOR PROVING TERMINATING HYPERGEOMETRIC IDENTITIES *  

E-Print Network [OSTI]

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

Zeilberger, Doron

115

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

SciTech Connect (OSTI)

Although lensed troffers are numerous, there are many other types of optical systems as well. This report looked at the performance of three linear (T8) LED lamps chosen primarily based on their luminous intensity distributions (narrow, medium, and wide beam angles) as well as a benchmark fluorescent lamp in five different troffer types. Also included are the results of a subjective evaluation. Results show that linear (T8) LED lamps can improve luminaire efficiency in K12-lensed and parabolic-louvered troffers, effect little change in volumetric and high-performance diffuse-lensed type luminaires, but reduce efficiency in recessed indirect troffers. These changes can be accompanied by visual appearance and visual comfort consequences, especially when LED lamps with clear lenses and narrow distributions are installed. Linear (T8) LED lamps with diffuse apertures exhibited wider beam angles, performed more similarly to fluorescent lamps, and received better ratings from observers. Guidance is provided on which luminaires are the best candidates for retrofitting with linear (T8) LED lamps.

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

2014-05-20T23:59:59.000Z

116

A new hybrid algorithm for analysis of HVdc and FACTs systems  

SciTech Connect (OSTI)

Hybrid stability programs use a transient stability analysis for ac systems, in conjunction with detailed state variable or EMTP type modelling for fast dynamic devices. This paper presents a new hybrid algorithm that uses optimized techniques based on previously proposed methods. The hybrid provides a useful analysis tool to examine systems incorporating fast dynamic non-linear components such as HVdc links and FACTs devices.

Anderson, G.W.J. [New Zealand Aluminium Smelters Ltd., Invercargill (New Zealand); Watson, N.R.; Arnold, C.P.; Arrillaga, J. [Univ. of Canterbury, Christchurch (New Zealand)

1995-12-31T23:59:59.000Z

117

The consequences of alternative environmental management goals: A non-linear programming analysis of nuclear weapons legacy clean-up at Oak Ridge National Laboratory  

Science Journals Connector (OSTI)

Prioritization of projects within the U.S. Department of Energy's (DOE) Weapons Complex Clean-up Program, exemplified with data from the Oak Ridge National Laboratory, is quite sensitive to overall goals. Non-...

Donald W. Jones; Kenneth S. Redus

118

Nonlocality improves Deutsch algorithm  

E-Print Network [OSTI]

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

Koji Nagata; Sangkyung Lee; Jaewook Ahn

2007-03-15T23:59:59.000Z

119

SCCMulti: an improved parallel strongly connected components algorithm  

Science Journals Connector (OSTI)

Tarjan's famous linear time, sequential algorithm for finding the strongly connected components (SCCs) of a graph relies on depth first search, which is inherently sequential. Deterministic parallel algorithms solve this problem in logarithmic time using ... Keywords: parallel graph algorithms, randomized algorithms, strongly connected components

Daniel Tomkins; Timmie Smith; Nancy M. Amato; Lawrence Rauchwerger

2014-02-01T23:59:59.000Z

120

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

E-Print Network [OSTI]

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

Hadi Charkhgard

2014-12-28T23:59:59.000Z

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


121

Towards a Definition of an Algorithm  

Science Journals Connector (OSTI)

......Although the set of programs does not even form a category, the...and function algebras. In: Handbook of Computability Theory, Vol...Although the set of programs does not even form a category, the...algorithms, e.g. `There does not exist an algorithm to solve......

Noson S. Yanofsky

2011-04-01T23:59:59.000Z

122

Variational inferences for partially linear additive models with variable selection  

Science Journals Connector (OSTI)

This article develops a mean field variational Bayes approximation algorithm for posterior inferences of the recently proposed partially linear additive models with simultaneous and automatic variable selection and linear/nonlinear component identification ... Keywords: Bayesian inference, Mean field variational Bayes, Model selection, Partially linear additive model

Kaifeng Zhao, Heng Lian

2014-12-01T23:59:59.000Z

123

Comparison of emerging metaheuristic algorithms for optimal hydrothermal system operation  

Science Journals Connector (OSTI)

Abstract Optimal hydrothermal system operation (OHSO) is one of the complex and hard-to-solve problems in power system field due to its nonlinear, dynamic, stochastic, non-separable and non-convex nature. Traditionally, this problem has been solved through classical optimization algorithms, which require some approximations to tackle a more tractable variant of the original problem formulation. Metaheuristic optimization has undergone a significant development in recent years, thus, there is a variety of tools with different conceptual differences, which offer a great potential for solving OHSO without extensive simplifications. This paper provides a comparative study on the application of six emerging metaheuristic algorithms to OHSO, namely, the Comprehensive Learning Particle Swarm Optimizer (CLPSO), Genetic algorithm with Multi-Parent Crossover (GA-MPC), Differential Evolution with Adaptive Crossover Operator (DE-ACO), Covariance Matrix Adaptation Evolution Strategy (CMA-ES), Linearized Biogeography-based Optimization (LBBO), and the Hybrid Median-Variance Mapping Optimization (MVMO-SH). Since these tools have been successfully applied to other hard-to-solve optimization problems, the goal is to ascertain their effectiveness when adapted to tackle the OHSO problem by evaluating their performance in terms of convergence speed, achieved optimum solutions, and computing effort. Numerical experiments, performed on a test system composed by four cascaded hydro plants and an equivalent thermal plant, highlight the relevance of the adopted global search mechanisms, especially for LBBO and MVMO-SH. A nonlinear programming (NLP) algorithm is used as reference to validate the results.

Martha P. Camargo; Jos L. Rueda; Istvn Erlich; Osvaldo A

2014-01-01T23:59:59.000Z

124

Feedrate scheduling and jerk control algorithm for high-speed CNC machining  

Science Journals Connector (OSTI)

High-speed CNC machining usually slows down around corners and vibrates so much because of limits on processing large amount of consecutive small line blocks with high speed and inability changing directions fast enough. Aiming at adjusting the feedrate automatically and providing smoother acceleration to achieve maximum productivity, this research presents a feedrate scheduling and jerk control interpolation algorithm to seek the optimal feedrate by evaluating the tool path ahead. After generating a smooth path within error allowance by B-spline fitting algorithm, we calculate the safe, highest, continuous linear velocity while simultaneously accommodating the machine's Acceleration/Deceleration (Acc/Dec) limits. Smooth jerk motion is obtained by modulating the acceleration profiles along the tool path. A look-ahead interpolation scheme is also presented for the purpose of fast controls. Simulation results indicate that the proposed adaptive algorithm speeds feedrates, limits distortion to the programmed path, maintains high speed without sacrificing accuracy while going around corners.

Daping Wan; ShiLong Wang; CaiChao Zhu; Fanming Meng

2009-01-01T23:59:59.000Z

125

Independent Oversight Inspection, Stanford Linear Accelerator Center -  

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

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

126

An Improved Approximation Algorithm For Vertex Cover with Hard Capacities  

E-Print Network [OSTI]

as hard as set cover; they have also developed a 3-approximation algorithm for the unweighted version. We Words and Phrases: Approximation algorithms, capacitated covering, set cover, vertex cover, linearAn Improved Approximation Algorithm For Vertex Cover with Hard Capacities (Extended Abstract) Rajiv

Srinivasan, Aravind

127

Genetic algorithms  

SciTech Connect (OSTI)

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

Grefenstette, J.J.

1994-12-31T23:59:59.000Z

128

Solving second order linear differential equations with Klein's theorem  

Science Journals Connector (OSTI)

Given a second order linear differential equations with coefficients in a field k=C(x), the Kovacic algorithm finds all Liouvillian solutions, that is, solutions that one can write in terms of exponentials, logarithms, integration ...

M. van Hoeij; J.-A. Weil

2005-07-01T23:59:59.000Z

129

The Lie point symmetry generators admitted by systems of linear differential equations  

Science Journals Connector (OSTI)

...1008 59 112 4 The Lie point symmetry generators admitted by systems of linear differential...existence of a basis of infinitesimal generators (as determined by Lie's algorithm...symmetry|linear system|infinitesimal generator|fibre-preserving|affine bundle...

2014-01-01T23:59:59.000Z

130

Regularization and improved interpretation of linear data mappings and adaptive distance measures  

E-Print Network [OSTI]

Regularization and improved interpretation of linear data mappings and adaptive distance measures dimensional data sets linear transformations are not necessarily uniquely determined, though, and alternative learning algorithms. Principal component analysis (PCA) is a good example of a standard technique

Biehl, Michael

131

Linear Collider Collaboration Tech Notes  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

132

lgebra Linear Mauro Rincon  

E-Print Network [OSTI]

8.1 Álgebra Linear Mauro Rincon Márcia Fampa Aula 8: Soluções de Sistemas de Equações Lineares #12

Cabral, Marco

133

A Generate-Test-Aggregate parallel programming library for systematic parallel programming  

Science Journals Connector (OSTI)

The Generate-Test-Aggregate (GTA for short) algorithm is modeled following a simple and straightforward programming pattern, for combinatorial problems. First, generate all candidates; second, test and filter out invalid ones; finally, aggregate valid ... Keywords: Functional programming, Generate-Test-Aggregate algorithm, High-level parallel programming, MapReduce, Program calculation, Program transformation

Yu Liu; Kento Emoto; Zhenjiang Hu

2014-02-01T23:59:59.000Z

134

Computational problems algorithmsComputational problems, algorithms, runtime, hardness  

E-Print Network [OSTI]

we model set cover as an integer program? · See examples Algorithms and runtime · We would see (a brief introduction to theoretical computer science) slides by Vincent Conitzer Set Cover (a a T of size at most k will suffice Set Cover (a computational problem) · One instance of the set cover problem

Allan, Vicki H.

135

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

E-Print Network [OSTI]

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

2012-02-13T23:59:59.000Z

136

Derivation of parallel algorithms from functional specifications to CSP processes  

Science Journals Connector (OSTI)

A transformational programming approach is proposed as a means for developing a class of parallel algorithms from clear functional specifications to efficient networks of communicating sequential processes (CSP)....

Ali E. Abdallah

1995-01-01T23:59:59.000Z

137

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

E-Print Network [OSTI]

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

Alfredo Canelas

2014-08-21T23:59:59.000Z

138

Polynomial Approximations for Continuous Linear Programs  

E-Print Network [OSTI]

where the cost rate c(t), the right hand side vector b(t) as well as the matrices. G(t) and H(t, ...... the jth industry in order to produce a unit output of good j. Thus, in...

2012-04-05T23:59:59.000Z

139

A computer program for linear models  

E-Print Network [OSTI]

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

Zerbe, Manfred Rudolf

2012-06-07T23:59:59.000Z

140

Shrink-Wrapping trajectories for Linear Programming  

E-Print Network [OSTI]

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

2010-05-30T23:59:59.000Z

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

SDDP FOR MULTISTAGE STOCHASTIC LINEAR PROGRAMS ...  

E-Print Network [OSTI]

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

2012-08-20T23:59:59.000Z

142

Limitations of Linear and Semidefinite Programs  

E-Print Network [OSTI]

of Computer Science, pages 593692, [25] Grant Schoenebeck,by Grant Robert Schoenebeck Doctor of Philosophy in ComputerGrant Robert Schoenebeck A dissertation submitted in partial satisfaction of the requirements for the degree of Doctor of Philosophy in Computer

Schoenebeck, Grant Robert

2010-01-01T23:59:59.000Z

143

New linear and positive semidefinite programming based ...  

E-Print Network [OSTI]

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

2014-04-18T23:59:59.000Z

144

TOWARDS AFFECTIVE ALGORITHMIC COMPOSITION  

E-Print Network [OSTI]

TOWARDS AFFECTIVE ALGORITHMIC COMPOSITION Duncan Williams* , Alexis Kirke* , Eduardo Reck Miranda are driving an emerging field: affective algorithmic composition. Strate- gies for algorithmic composition within the last decade) implementing systems for algorithmic composition with the intention of targeting

Miranda, Eduardo Reck

145

Solutions diversification in a column generation algorithm  

E-Print Network [OSTI]

Solutions diversification in a column generation algorithm N. Touati a L. L´etocart a A. Nagih b a Column generation algorithms have been specially designed for solving mathemat- ical programs with a huge-based techniques. A more classical approach, known as "intensification", consists in inserting a set of columns

Létocart, Lucas

146

Sommersemester 2002 Algorithms on Railway Optimisation  

E-Print Network [OSTI]

Sommersemester 2002 Seminar Algorithms on Railway Optimisation Miriam Walter 01/423731 SHUNTING. The topic shunting covers the routing of train units, the scheduling of personnel, cleaning and maintainance integer program of (MSP) and have a look at two online algorithms. Finally we will show

Brandes, Ulrik

147

Linear chain magnetism  

Science Journals Connector (OSTI)

Linear chain magnetism ... A brief introduction to this concept, which is also called lower dimensional magnetism. ...

Richard L. Carlin

1991-01-01T23:59:59.000Z

148

Faster PDE-based simulations using robust composite linear solvers  

Science Journals Connector (OSTI)

Many large-scale scientific simulations require the solution of nonlinear partial differential equations (PDEs). The effective solution of such nonlinear PDEs depends to a large extent on efficient and robust sparse linear system solution. In this paper, ... Keywords: Newton-Krylov methods, composite methods, large-scale PDE-based simulations, multi-algorithms, sparse linear solution

S. Bhowmick; P. Raghavan; L. McInnes; B. Norris

2004-04-01T23:59:59.000Z

149

Improved Approximation Algorithms for the Partial Vertex Cover Problem  

E-Print Network [OSTI]

Improved Approximation Algorithms for the Partial Vertex Cover Problem Eran Halperin 1? and Aravind words and phrases. Partial vertex cover, approximation algorithms, semide#12;nite programming edges are covered. Just as for the vertex cover problem, 2-approximation algorithms are known

Srinivasan, Aravind

150

Piecewise Linear Phase Transitions  

E-Print Network [OSTI]

It is shown how simple assumptions lead to piecewise linear behavior, which is observed in certain phase transitions.

Joseph B. Keller

2007-11-26T23:59:59.000Z

151

Algorithm Development & Stepwise Refinement Algorithm Development  

E-Print Network [OSTI]

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

Murphy, John

152

New Hybrid Optimization Algorithms for Machine Scheduling Problems  

E-Print Network [OSTI]

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

2006-12-03T23:59:59.000Z

153

Introduction to Linear Bialgebra  

E-Print Network [OSTI]

The algebraic structure, linear algebra happens to be one of the subjects which yields itself to applications to several fields like coding or communication theory, Markov chains, representation of groups and graphs, Leontief economic models and so on. This book has for the first time, introduced a new algebraic structure called linear bialgebra, which is also a very powerful algebraic tool that can yield itself to applications. With the recent introduction of bimatrices (2005)we have ventured in this book to introduce new concepts like linear bialgebra and Smarandache neutrosophic linear bialgebra and also give the applications of these algebraic structures. It is important to mention here it is a matter of simple exercise to extend these to linear n-algebra for any n greater than 2; for n = 2 we get the linear bialgebra. This book has five chapters. In the first chapter we just introduce some basic notions of linear algebra and Slinear algebra and their applications. Chapter two introduces some new algebraic bistructures. In chapter three we introduce the notion of linear bialgebra and discuss several interesting properties about them. Also, application of linear bialgebra to bicodes is given. A remarkable part of our research in this book is the introduction of the notion of birepresentation of bigroups. The fourth chapter introduces several neutrosophic algebraic structures since they help in defining the new concept of neutrosophic linear bialgebra, neutrosophic bivector spaces, Smarandache neutrosophic linear bialgebra and Smarandache neutrosophic bivector spaces. Theirprobable applications to real-world models are discussed.

W. B. Vasantha Kandasamy; Florentin Smarandache; K. Ilanthenral

2005-08-15T23:59:59.000Z

154

LED Linear Lamps and Troffer Lighting  

Broader source: Energy.gov [DOE]

The CALiPER program performed a series of investigations on linear LED lamps. Each report in the series covers the performance of up to 31 linear LED lamps, which were purchased in late 2012 or 2013. The first report focuses on bare lamp performance of LED T8 replacement lamps and subsequent reports examine performance in various troffers, as well as cost-effectiveness. There is also a concise guidance document that describes the findings of the Series 21 studies and provides practical advice to manufacturers, specifiers, and consumers (Report 21.4: Summary of Linear (T8) LED Lamp Testing , 5 pages, June 2014).

155

Deductive Algorithmic Knowledge  

Science Journals Connector (OSTI)

......Original Articles Deductive Algorithmic Knowledge Riccardo Pucella Northeastern University...June 2005. The framework of algorithmic knowledge assumes that agents use algorithms to...reasoning about both implicit and explicit knowledge with the latter defined with respect......

Riccardo Pucella

2006-04-01T23:59:59.000Z

156

A robustness application for linear estimation  

E-Print Network [OSTI]

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

Kitzman, Kenneth Victor

1990-01-01T23:59:59.000Z

157

Linear Sum Assignment Algorithms for Distributed Multi-robot Systems  

E-Print Network [OSTI]

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

Liu, Lantao

2013-04-30T23:59:59.000Z

158

General Realization Algorithm for Modal Identification of Linear Dynamic Systems  

E-Print Network [OSTI]

2- 30 sec) of the Imperial Valley, 1940 earthquake groundTime [sec] Fig. 4 Imperial Valley, El Centro 1940 earthquakeat different phases Fig. 4 Imperial Valley, El Centro 1940

De Callafon, Raymond A.; Moaveni, Babak; Conte, Joel P; He, Xianfei; Udd, Eric

2008-01-01T23:59:59.000Z

159

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

E-Print Network [OSTI]

forward properties related with Kn which will be frequently used in this paper. ...... S. Hayashi, N. Yamashita and M. Fukushima, A combined smoothing and...

2013-01-28T23:59:59.000Z

160

General Realization Algorithm for Modal Identification of Linear Dynamic Systems  

E-Print Network [OSTI]

impulse (free vibration) response measurements. The explicitduring a vibration period. Simulation of Measurement Datameasurement noise (4% in root-mean-square ratio) is to allow for the higher vibration

De Callafon, Raymond A.; Moaveni, Babak; Conte, Joel P; He, Xianfei; Udd, Eric

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


161

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

E-Print Network [OSTI]

The BLACS and ScaLAPACK libraries are used to facilitate the parallel ...... [6] S. Chandrasekaran, P. Dewilde, M. Gu, T. Pals, X. Sun, A.-J. van der Veen, and.

2013-12-11T23:59:59.000Z

162

Revisiting Algorithms for Generating Surrogate Time Series  

Science Journals Connector (OSTI)

The method of surrogates is one of the key concepts of nonlinear data analysis. Here, we demonstrate that commonly used algorithms for generating surrogates often fail to generate truly linear time series. Rather, they create surrogate realizations with Fourier phase correlations leading to nondetections of nonlinearities. We argue that reliable surrogates can only be generated, if one tests separately for static and dynamic nonlinearities.

C. Rth, M. Gliozzi, I. E. Papadakis, and W. Brinkmann

2012-10-05T23:59:59.000Z

163

History of Proton Linear Accelerators  

E-Print Network [OSTI]

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

Alvarez, Luis W.

1987-01-01T23:59:59.000Z

164

Design of Sustainable Product Systems and Supply Chains with Life Cycle Optimization Based on Functional Unit: General Modeling Framework, Mixed-Integer Nonlinear Programming Algorithms and Case Study on Hydrocarbon Biofuels  

Science Journals Connector (OSTI)

The stopping tolerance for the parametric algorithm is set to 1%. ... The model covers the biomass feedstock supply system, integrated biorefineries, preconversion facilities, upgrading facilities, and the liquid fuel distribution system. ... As can be observed, the parametric algorithm is demonstrated to be the most efficient among the five algorithms, of which the solution time for all 10 instances ranges from 1.5 to 373.5 CPUs. ...

Dajun Yue; Min Ah Kim; Fengqi You

2013-05-21T23:59:59.000Z

165

Unit I-2 Linear Maps 1 Linear maps  

E-Print Network [OSTI]

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

Birkett, Stephen

166

lgebra Linear Mauro Rincon  

E-Print Network [OSTI]

10.1 Álgebra Linear Mauro Rincon Márcia Fampa Aula 10: Determinantes #12;10.2 8.1 - Definições #12

Cabral, Marco

167

Linear Graphene Plasmons  

Science Journals Connector (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

168

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

169

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

170

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

SciTech Connect (OSTI)

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

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

2008-07-01T23:59:59.000Z

171

Graph Algorithms Edge Coloring  

E-Print Network [OSTI]

: Perfect Matching Graph Algorithms 6 #12;Edge Covering An edge covering, EC E, is a set of edges #12;Example: Edge Covering Graph Algorithms 8 #12;Example: Minimal Edge Covering Graph Algorithms 9 #12;Example: Minimum Size Edge Covering Graph Algorithms 10 #12;Matching and Edge Covering Definition

Bar-Noy, Amotz

172

Using Linearity Web Copyright 2007  

E-Print Network [OSTI]

Using Linearity Web Rev. 2.0 May 2007 Copyright © 2007 #12;Using Linearity Web i Contents Introduction to Linearity Web.............................................................................1 Features, Benefits, and Value of Linearity Web..............................................1 Before You

Rodriguez, Carlos

173

Semidefinite Programming Based Algorithms for Sensor Network ...  

E-Print Network [OSTI]

Dept of Management Science and Engineering and by courtesy, Electrical Engineering,. Stanford University, yinyu-ye@stanford.edu. An SDP relaxation based...

2005-10-04T23:59:59.000Z

174

SLAC linear collider  

SciTech Connect (OSTI)

A brief description of the proposed SLAC Linear Collider is given. This machine would investigate the possibilities and limitations of Linear Colliders while at the same time producing thousands of Z/sup 0/ particles per day for the study of the weak interactions.

Hollebeek, R.

1980-06-01T23:59:59.000Z

175

A cooperative control algorithm for camera based observational systems.  

SciTech Connect (OSTI)

Over the last several years, there has been considerable growth in camera based observation systems for a variety of safety, scientific, and recreational applications. In order to improve the effectiveness of these systems, we frequently desire the ability to increase the number of observed objects, but solving this problem is not as simple as adding more cameras. Quite often, there are economic or physical restrictions that prevent us from adding additional cameras to the system. As a result, we require methods that coordinate the tracking of objects between multiple cameras in an optimal way. In order to accomplish this goal, we present a new cooperative control algorithm for a camera based observational system. Specifically, we present a receding horizon control where we model the underlying optimal control problem as a mixed integer linear program. The benefit of this design is that we can coordinate the actions between each camera while simultaneously respecting its kinematics. In addition, we further improve the quality of our solution by coupling our algorithm with a Kalman filter. Through this integration, we not only add a predictive component to our control, but we use the uncertainty estimates provided by the filter to encourage the system to periodically observe any outliers in the observed area. This combined approach allows us to intelligently observe the entire region of interest in an effective and thorough manner.

Young, Joseph G.

2012-01-01T23:59:59.000Z

176

Structured Wide-Area Programming: Orc Programming Examples  

E-Print Network [OSTI]

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

Misra, Jayadev

177

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

E-Print Network [OSTI]

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

2009-04-08T23:59:59.000Z

178

North Linear Accelerator  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

179

Syntactic edges and linearization  

E-Print Network [OSTI]

In this thesis, I investigate the question of how the units of a linguistic expression are linearly ordered in syntax. In particular, I examine interactions between locality conditions on movement and the mapping between ...

Ko, Heejeong

2005-01-01T23:59:59.000Z

180

An elementary derivation of the Deutsch-Jozsa algorithm  

E-Print Network [OSTI]

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

Neda Amin; Patrick Labelle

2008-10-13T23:59:59.000Z

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

DSDP5 user guide - software for semidefinite programming.  

SciTech Connect (OSTI)

DSDP implements the dual-scaling algorithm for semidefinite programming. The source code of this interior-point solver, written entirely in ANSI C, is freely available. The solver can be used as a subroutine library, as a function within the Matlab environment, or as an executable that reads and writes to files. Initiated in 1997, DSDP has developed into an efficient and robust general-purpose solver for semidefinite programming. Although the solver is written with semidefinite programming in mind, it can also be used for linear programming and other constraint cones. The features of DSDP include the following: a robust algorithm with a convergence proof and polynomially bounded complexity under mild assumptions on the data, primal and dual solutions, feasible solutions when they exist or approximate certificates of infeasibility, initial points that can be feasible or infeasible, relatively low memory requirements for an interior-point method, sparse and low-rank data structures, extensibility that allows applications to customize the solver and improve its performance, a subroutine library that enables it to be linked to larger applications, scalable performance for large problems on parallel architectures, and a well-documented interface and examples of its use. The package has been used in many applications and tested for efficiency, robustness, and ease of use. We welcome and encourage further use under the terms of the license included in the distribution.

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

2006-01-24T23:59:59.000Z

182

A scenario driven multiobjective PrimarySecondary Distribution System Expansion Planning algorithm in the presence of wholesaleretail market  

Science Journals Connector (OSTI)

This paper presents a novel approach for Integrated Generation and PrimarySecondary Distribution System Expansion Planning (IGDSEP) in the presence of wholesale and retail markets. The proposed method uses a model to explore the impacts of wholesale and retail market on IGDSEP procedure. This algorithm decomposes the IGDSEP problem into six subproblems to achieve an optimal expansion planning of a system, in which the investment and operational costs are minimized, while the reliability of the system is maximized. The proposed model of IGDSEP is a Mixed Integer Non Linear Programming (MINLP) problem and a Scenario Driven MINLP (SCMINLP) method is proposed for solving the problem. The algorithm was successfully tested for an urban distribution system.

Mehrdad Setayesh Nazar; Mahmood R. Haghifam; Mhran Naar

2012-01-01T23:59:59.000Z

183

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

184

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

185

Distributed Algorithms Distributed Transactions  

E-Print Network [OSTI]

Algorithms© Gero Mühl 8 Concurrency Control serial RC (ReCoverable) ACA (Avoiding Cascading Aborts) ST (StricDistributed Algorithms Distributed Transactions PD Dr.-Ing. Gero Mühl Kommunikations- und Betriebssysteme Fakultät für Elektrotechnik u. Informatik Technische Universität Berlin #12;Distributed Algorithms

Wichmann, Felix

186

Assignment: Greedy Algorithms Name: . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .  

E-Print Network [OSTI]

Algorithms Assignment: Greedy Algorithms Name to finding the largest set of jobs that can be scheduled on one machine. · Ordering by a non-decreasing order, there are inputs for which this greedy algorithm produces a solution whose profit is almost 1/n of the optimal

Bar-Noy, Amotz

187

Network Algorithms (Lecture Notes)  

E-Print Network [OSTI]

Network Algorithms (Lecture Notes) Dr. Stefan Schmid Thanks to Prof. Dr. Roger Wattenhofer and Prof to the Network Algorithms course! Computer systems are becoming more distributed and networked. This has two main, in order to fully exploit the distributed resource network, efficient algorithms need to be designed

Schmid, Stefan

188

Linear Collider Collaboration Tech Notes  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

189

Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel  

E-Print Network [OSTI]

Coded Adaptive Linear Precoded Discrete Multitone Over PLC Channel Fahad Syed Muhammmad, Jean- DMT system is presented in the power line communication (PLC) context with a loading algorithm which spectral density constraint. Using a multipath model of PLC channel, it is shown that the proposed coded

Boyer, Edmond

190

Conformational properties of blends of cyclic and linear polymer melts  

Science Journals Connector (OSTI)

An adapted version of the annealing algorithm to identify primitive paths of a melt of ring polymers is presented. This algorithm ensures that the primitive path length becomes zero for nonconcatenated rings, and that no entanglements are observed. The bond-fluctuation model was used to simulate ring-linear blends with N=150 and 300 monomers. The primitive path length and the average number of entanglements of the linear component were found to be independent of the blend composition. In contrast, the primitive path length and the average number of entanglements on a ring molecule increased approximately linearly with the fraction of linear chains, and for large N, they approached values comparable with linear chains. Threading of ring molecules by linear chains, and ring-ring interactions were observed only in the presence of linear chains. It is conjectured that for large N, these latter interactions facilitate the formation of a percolating entangled network, thereby resulting in a disproportionate retardation of the dynamical processes.

Gopinath Subramanian and Sachin Shanbhag

2008-01-14T23:59:59.000Z

191

Linear Collider Collaboration Tech Notes LCC-0108  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

192

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

E-Print Network [OSTI]

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

Mohaghegh, Shahab

193

Top 10 Algorithms in Data Mining Xindong Wu ( )  

E-Print Network [OSTI]

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

Wu, Xindong

194

The automatic generation of mutation operators for genetic algorithms  

Science Journals Connector (OSTI)

We automatically generate mutation operators for Genetic Algorithms (GA) and tune them to problem instances drawn from a given problem class. By so doing, we perform metalearning in which the base-level contains GAs (which learn about problem instances), ... Keywords: automatic design, genetic algorithms, genetic programming, hyper-heuristics

John R. Woodward; Jerry Swan

2012-07-01T23:59:59.000Z

195

Sorghum Program BIOENERGY PROGRAM  

E-Print Network [OSTI]

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

196

Algorithms to Automate LCLS Undulator Tuning  

SciTech Connect (OSTI)

Automation of the LCLS undulator tuning offers many advantages to the project. Automation can make a substantial reduction in the amount of time the tuning takes. Undulator tuning is fairly complex and automation can make the final tuning less dependent on the skill of the operator. Also, algorithms are fixed and can be scrutinized and reviewed, as opposed to an individual doing the tuning by hand. This note presents algorithms implemented in a computer program written for LCLS undulator tuning. The LCLS undulators must meet the following specifications. The maximum trajectory walkoff must be less than 5 {micro}m over 10 m. The first field integral must be below 40 x 10{sup -6} Tm. The second field integral must be below 50 x 10{sup -6} Tm{sup 2}. The phase error between the electron motion and the radiation field must be less than 10 degrees in an undulator. The K parameter must have the value of 3.5000 {+-} 0.0005. The phase matching from the break regions into the undulator must be accurate to better than 10 degrees. A phase change of 113 x 2{pi} must take place over a distance of 3.656 m centered on the undulator. Achieving these requirements is the goal of the tuning process. Most of the tuning is done with Hall probe measurements. The field integrals are checked using long coil measurements. An analysis program written in Matlab takes the Hall probe measurements and computes the trajectories, phase errors, K value, etc. The analysis program and its calculation techniques were described in a previous note. In this note, a second Matlab program containing tuning algorithms is described. The algorithms to determine the required number and placement of the shims are discussed in detail. This note describes the operation of a computer program which was written to automate LCLS undulator tuning. The algorithms used to compute the shim sizes and locations are discussed.

Wolf, Zachary

2010-12-03T23:59:59.000Z

197

Brief paper: Risk-sensitive filtering for jump Markov linear systems  

Science Journals Connector (OSTI)

In this paper, a risk-sensitive multiple-model filtering algorithm is derived using the reference probability methods. First, the approximation of the interacting multiple-model (IMM) algorithm is identified in the reference probability domain. Then, ... Keywords: IMM, Jump Markov linear system, Multiple-model estimation, Risk-sensitive estimation

Umut Orguner; Mbeccel Demirekler

2008-01-01T23:59:59.000Z

198

Linear Logic as CSP  

Science Journals Connector (OSTI)

......research-article Original Articles Linear Logic as CSP ERIC MONTEIRO Department of Informatics...translation from such proofs into a corresponding CSP process is offered. It is shown that the...between the cut elimination process and the CSP execution. Generalizations and related......

ERIC MONTEIRO

1994-08-01T23:59:59.000Z

199

Control algorithms for dynamic attenuators  

SciTech Connect (OSTI)

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

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

2014-06-15T23:59:59.000Z

200

Rank-Constrained Solutions to Linear Matrix Equations using PowerFactorization  

E-Print Network [OSTI]

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

Leahy, Richard M.

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

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

E-Print Network [OSTI]

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

Stephen C. Anco; George Bluman; Thomas Wolf

2008-01-26T23:59:59.000Z

202

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

203

Combustion powered linear actuator  

DOE Patents [OSTI]

The present invention provides robotic vehicles having wheeled and hopping mobilities that are capable of traversing (e.g. by hopping over) obstacles that are large in size relative to the robot and, are capable of operation in unpredictable terrain over long range. The present invention further provides combustion powered linear actuators, which can include latching mechanisms to facilitate pressurized fueling of the actuators, as can be used to provide wheeled vehicles with a hopping mobility.

Fischer, Gary J. (Albuquerque, NM)

2007-09-04T23:59:59.000Z

204

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

E-Print Network [OSTI]

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

Fernandez, Thomas

205

ACME: Algorithms for Contact in a Multiphysics Environment API Version 1.3  

SciTech Connect (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.

BROWN, KEVIN H.; VOTH, THOMAS E.; GLASS, MICHEAL W.; GULLERUD, ARNE S.; HEINSTEIN, MARTIN W.; JONES, REESE E.

2003-05-01T23:59:59.000Z

206

ACME - Algorithms for Contact in a Multiphysics Environment API Version 1.0  

SciTech Connect (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.

BROWN, KEVIN H.; SUMMERS, RANDALL M.; GLASS, MICHEAL W.; GULLERUD, ARNE S.; HEINSTEIN, MARTIN W.; JONES, REESE E.

2001-10-01T23:59:59.000Z

207

ACME Algorithms for Contact in a Multiphysics Environment API Version 0.3a  

SciTech Connect (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.

BROWN, KEVIN H.; GLASS, MICHEAL W.; GULLERUD, ARNE S.; HEINSTEIN, MARTIN W.; JONES, REESE E.; SUMMERS, RANDALL M.

2001-04-01T23:59:59.000Z

208

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

SciTech Connect (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

209

Genetic Algorithms: Applications  

E-Print Network [OSTI]

Independent Set Problem ffl Bin Packing Problem ffl Maximum Set Covering Problem ffl Terminal AssignmentGenetic Algorithms: Applications Sami Khuri Dept. of Math. & Computer Science San Jos'e State; GA Applications: Topics Today's Topics ffl Brief Introduction to the Simple Genetic Algorithm. ffl

Khuri, Sami

210

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

E-Print Network [OSTI]

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

Lau, Kung-Kiu

211

Linear Fresnel | Department of Energy  

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

Linear Fresnel systems, which are a type of linear concentrator, are active in Germany, Spain, Australia, India, and the United States. The SunShot Initiative funds R&D on...

212

History of Proton Linear Accelerators  

E-Print Network [OSTI]

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

Alvarez, Luis W.

1986-01-01T23:59:59.000Z

213

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

214

Synthesis of linear quantum stochastic systems via quantum feedback networks  

E-Print Network [OSTI]

Recent theoretical and experimental investigations of coherent feedback control, the feedback control of a quantum system with another quantum system, has raised the important problem of how to synthesize a class of quantum systems, called the class of linear quantum stochastic systems, from basic quantum optical components and devices in a systematic way. The synthesis theory sought in this case can be naturally viewed as a quantum analogue of linear electrical network synthesis theory and as such has potential for applications beyond the realization of coherent feedback controllers. In earlier work, Nurdin, James and Doherty have established that an arbitrary linear quantum stochastic system can be realized as a cascade connection of simpler one degree of freedom quantum harmonic oscillators, together with a direct interaction Hamiltonian which is bilinear in the canonical operators of the oscillators. However, from an experimental perspective and based on current methods and technologies, direct interaction Hamiltonians are challenging to implement for systems with more than just a few degrees of freedom. In order to facilitate more tractable physical realizations of these systems, this paper develops a new synthesis algorithm for linear quantum stochastic systems that relies solely on field-mediated interactions, including in implementation of the direct interaction Hamiltonian. Explicit synthesis examples are provided to illustrate the realization of two degrees of freedom linear quantum stochastic systems using the new algorithm.

H. I. Nurdin

2009-05-06T23:59:59.000Z

215

Systolic algorithms: concepts, synthesis, and evolution Siang W. Song  

E-Print Network [OSTI]

-990 ­ Brazil e-mail: song@ime.usp.br Abstract In this mini-course we present the main concepts of systolic. In the first part of this mini-course we present the main ideas involved in these systolic algorithm synthesis chips are typically laid out in a linear array or bi- dimensional grid of cells. The first examples

Song, Siang Wun

216

Algorithms to Compute Minimum Cycle Basis in Directed Graphs #  

E-Print Network [OSTI]

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

Mehlhorn, Kurt

217

CHARM: An Efficient Algorithm for Closed Itemset Mining  

E-Print Network [OSTI]

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

Zaki, Mohammed Javeed

218

Asymptotic properties of some underdiagonal walks generation algorithms  

E-Print Network [OSTI]

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

Louchard, Guy

219

Linear concentrating solar collector  

SciTech Connect (OSTI)

The present invention relates to a segment of a linear concentrating solar collector which includes two plates distanced from each other and extending parallel to each other; a member connects the plates to each other and holes are bored in each of the plates in a parallel manner along a parabolic curve. A member passes through the holes each holding a small strip made of a reflecting material all strips together forming a parabolic surface. The invention relates also to a collector comprising at least two of each segments and an absorber extending along the focus line of the entire collector. The collector is advantageously provided with horizontal and/or vertical members which ascertains that the collector can follow the position of the sun.

Aharon, N. B.

1985-08-06T23:59:59.000Z

220

Graph Algorithms Vertex Coloring  

E-Print Network [OSTI]

Coloring Definition I: A disjoint collection of independent sets that cover all the vertices in the graphGraph Algorithms Vertex Coloring Graph Algorithms #12;The Input Graph G = (V, E) a simple and undirected graph: V : a set of n vertices. E: a set of m edges. A B EF C D A B C D E F A 0 1 1 1 0 0 B 1 0

Bar-Noy, Amotz

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

Algorithms With Impact (CpSc 940: Advanced Algorithms)  

E-Print Network [OSTI]

Algorithms With Impact (CpSc 940: Advanced Algorithms) Instructor: Dr. Brian Dean Fall 2011 Webpage and Course Goals The study of algorithms is a significant part of the foundation for the discipline of computer science. Over the past several decades, research in algorithmic computer science has advanced

Dean, Brian C.

222

12.010 Computational Methods of Scientific Programming, Fall 2002  

E-Print Network [OSTI]

This course introduces programming languages and techniques used by physical scientists: FORTRAN, C, C++, MATLAB, and Mathematica. Emphasis is placed on program design, algorithm development and verification, and comparative ...

Herring, T. (Thomas)

223

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)

224

Linear and Non Linear Analysis of the Hadley Circulation  

Science Journals Connector (OSTI)

We present a synthesis of results obtained with the linear stability of the one-cell Hadley circulation. This flow is observe in the...

P. Laure; B. Roux

1990-01-01T23:59:59.000Z

225

Ant Algorithms for Discrete Optimization  

E-Print Network [OSTI]

Ant Algorithms for Discrete Optimization Marco Dorigo and Gianni Di Caro IRIDIA, Universit´e Libre, Switzerland luca@idsia.ch Abstract This paper overviews recent work on ant algorithms, that is, algorithms and of some of the most important aspects of the ACO meta-heuristic. 1 Introduction Ant algorithms were first

Gambardella, Luca Maria

226

SWAP: PARALLELIZATION THROUGH ALGORITHM SUBSTITUTION  

E-Print Network [OSTI]

://code.google.com/p/ thrust). There is a vast set of tasks that pro- grammers want to perform, and few of the algorithms: PARALLELIZATION THROUGH ALGORITHM SUBSTITUTION ................................................................................................................................................................................................................... BY EXPLICITLY INDICATING WHICH ALGORITHMS THEY USE AND ENCAPSULATING THESE ALGORITHMS WITHIN SOFTWARE COMPONENTS

Eeckhout, Lieven

227

Ant Algorithms for Discrete Optimization  

E-Print Network [OSTI]

Ant Algorithms for Discrete Optimization Marco Dorigo Gianni Di Caro IRIDIA CP 194/6 Universit algorithms, ant colony optimiza- tion, swarm intelligence, metaheuris- tics, natural computation Abstract This article presents an overview of recent work on ant algorithms, that is, algorithms for discrete

Hutter, Frank

228

Ant Algorithms for Discrete Optimization  

E-Print Network [OSTI]

Ant Algorithms for Discrete Optimization Marco Dorigo and Gianni Di Caro IRIDIA, Universit#19;e, Switzerland luca@idsia.ch Abstract This paper overviews recent work on ant algorithms, that is, algorithms work and of some of the most important aspects of the ACO meta-heuristic. 1 Introduction Ant algorithms

Ducatelle, Frederick

229

A quadratic algorithm for road coloring  

E-Print Network [OSTI]

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

Bal, Marie-Pierre

2008-01-01T23:59:59.000Z

230

A Sparse Common Spatial Pattern Algorithm for Brain-Computer Interface  

E-Print Network [OSTI]

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

Lu, Bao-Liang

231

The Computational Physics Program of the national MFE Computer Center  

SciTech Connect (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

232

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

233

Improving Quantum Algorithms for Quantum Chemistry  

E-Print Network [OSTI]

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

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

2014-03-23T23:59:59.000Z

234

Community Programs  

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

Programs Friends of Berkeley Lab Navigate Section Community Richmond Bay Campus Planning Tours Community Programs Friends of Berkeley Lab Community Education Programs...

235

Technical Report: Scalable Parallel Algorithms for High Dimensional Numerical Integration  

SciTech Connect (OSTI)

We implemented a scalable parallel quasi-Monte Carlo numerical high-dimensional integration for tera-scale data points. The implemented algorithm uses the Sobol s quasi-sequences to generate random samples. Sobol s sequence was used to avoid clustering effects in the generated random samples and to produce low-discrepancy random samples which cover the entire integration domain. The performance of the algorithm was tested. Obtained results prove the scalability and accuracy of the implemented algorithms. The implemented algorithm could be used in different applications where a huge data volume is generated and numerical integration is required. We suggest using the hyprid MPI and OpenMP programming model to improve the performance of the algorithms. If the mixed model is used, attention should be paid to the scalability and accuracy.

Masalma, Yahya [Universidad del Turabo; Jiao, Yu [ORNL

2010-10-01T23:59:59.000Z

236

Linear wave propagation in relativistic magnetohydrodynamics  

Science Journals Connector (OSTI)

The properties of linear Alfvn slow and fast magnetoacoustic waves for uniform plasmas in relativistic magnetohydrodynamics(MHD) are discussed augmenting the well-known expressions for their phase speeds with knowledge on the group speed. A 3 + 1 formalism is purposely adopted to make direct comparison with the Newtonian MHD limits easier and to stress the graphical representation of their anisotropic linear wave properties using the phase and group speed diagrams. By drawing these for both the fluid rest frame and for a laboratory Lorentzian frame which sees the plasma move with a three-velocity having an arbitrary orientation with respect to the magnetic field a graphical view of the relativistic aberrationeffects is obtained for all three MHD wave families. Moreover it is confirmed that the classical Huygens construction relates the phase and group speed diagram in the usual way even for the lab frame viewpoint. Since the group speed diagrams correspond to exact solutions for initial conditions corresponding to a localized point perturbation their formulae and geometrical construction can serve to benchmark current high-resolution algorithms for numerical relativistic MHD.

R. Keppens; Z. Meliani

2008-01-01T23:59:59.000Z

237

Linear wave propagation in relativistic magnetohydrodynamics  

SciTech Connect (OSTI)

The properties of linear Alfven, slow, and fast magnetoacoustic waves for uniform plasmas in relativistic magnetohydrodynamics (MHD) are discussed, augmenting the well-known expressions for their phase speeds with knowledge on the group speed. A 3+1 formalism is purposely adopted to make direct comparison with the Newtonian MHD limits easier and to stress the graphical representation of their anisotropic linear wave properties using the phase and group speed diagrams. By drawing these for both the fluid rest frame and for a laboratory Lorentzian frame which sees the plasma move with a three-velocity having an arbitrary orientation with respect to the magnetic field, a graphical view of the relativistic aberration effects is obtained for all three MHD wave families. Moreover, it is confirmed that the classical Huygens construction relates the phase and group speed diagram in the usual way, even for the lab frame viewpoint. Since the group speed diagrams correspond to exact solutions for initial conditions corresponding to a localized point perturbation, their formulae and geometrical construction can serve to benchmark current high-resolution algorithms for numerical relativistic MHD.

Keppens, R. [Centre for Plasma-Astrophysics, K.U. Leuven, Celestijnenlaan 200B, 3001 Heverlee (Belgium); Leuven Mathematical Modeling and Computational Science Centre, K.U. Leuven (Belgium); FOM-Institute for Plasma Physics, P.O. Box 1207, 3430 BE Nieuwegein (Netherlands) and Astronomical Institute, Utrecht University (Netherlands); Meliani, Z. [Centre for Plasma-Astrophysics, K.U. Leuven, Celestijnenlaan 200B, 3001 Heverlee (Belgium)

2008-10-15T23:59:59.000Z

238

Linear wave propagation in relativistic magnetohydrodynamics  

E-Print Network [OSTI]

The properties of linear Alfv\\'en, slow, and fast magnetoacoustic waves for uniform plasmas in relativistic magnetohydrodynamics (MHD) are discussed, augmenting the well-known expressions for their phase speeds with knowledge on the group speed. A 3+1 formalism is purposely adopted to make direct comparison with the Newtonian MHD limits easier and to stress the graphical representation of their anisotropic linear wave properties using the phase and group speed diagrams. By drawing these for both the fluid rest frame and for a laboratory Lorentzian frame which sees the plasma move with a three-velocity having an arbitrary orientation with respect to the magnetic field, a graphical view of the relativistic aberration effects is obtained for all three MHD wave families. Moreover, it is confirmed that the classical Huygens construction relates the phase and group speed diagram in the usual way, even for the lab frame viewpoint. Since the group speed diagrams correspond to exact solutions for initial conditions corresponding to a localized point perturbation, their formulae and geometrical construction can serve to benchmark current high-resolution algorithms for numerical relativistic MHD.

R. Keppens; Z. Meliani

2008-10-14T23:59:59.000Z

239

Unit I-3 Linear Independence & Bases 1 Linear independence & bases  

E-Print Network [OSTI]

} ­ so we can write u1 = c2u2 + c3u3 + ... + crur with not all ci = 0 ­ re-arranging gives a non-zero lc u1 - c2u2 - c3u3 - ... - crur = 0 so the vectors are linearly dependent ! Unit I-3 Linear

Birkett, Stephen

240

Student Internship Programs Program Description  

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

Student Internship Programs Program Description The objective of the Laboratory's student internship programs is to provide students with opportunities for meaningful hands- on...

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

MATH 1503 Introduction to Linear Algebra Notes on MATLAB  

E-Print Network [OSTI]

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

Monson, Barry

242

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

E-Print Network [OSTI]

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

Kepner, Jeremy

243

Approximation Algorithms Tandy Warnow  

E-Print Network [OSTI]

size and 1 / . #12;Approximation algorithms for: Minimum Vertex Cover (finding a set of vertices-SAT 3-SAT DIR-HAM-CYCLEINDEPENDENT SET VERTEX COVER GRAPH 3-COLOR HAM-CYCLE TSP SUBSET-SUM SCHEDULINGPLANAR 3-COLOR SET COVER NP-Completeness by definition of NP-completeness #12;NP-hard Optimization

Warnow,Tandy

244

Genetic algorithm eclipse mapping  

E-Print Network [OSTI]

In this paper we analyse capabilities of eclipse mapping technique, based on genetic algorithm optimization. To model of accretion disk we used the "fire-flies" conception. This model allows us to reconstruct the distribution of radiating medium in the disk using less number of free parameters than in other methods. Test models show that we can achieve good approximation without optimizing techniques.

Halevin, A V

2008-01-01T23:59:59.000Z

245

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-

246

The Concept of Recoverable Robustness, Linear Programming Recovery,  

E-Print Network [OSTI]

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

Lübbecke, Marco

247

A Binary Linear Programming Approach for LCA System Boundary Identification  

Science Journals Connector (OSTI)

One of the very first steps in conducting life cycle assessment (LCA) is system boundaries identification. A binary ... boundary between significant and insignificant processes in a LCA study. The proposed model ...

Feri Afrinaldi; Hong-Chao Zhang

2013-01-01T23:59:59.000Z

248

An application of linear programming to a Mississippi Delta farm  

E-Print Network [OSTI]

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

Cooke, Fred Thomas

1957-01-01T23:59:59.000Z

249

Microgrid Reliability Modeling and Battery Scheduling Using Stochastic Linear Programming  

E-Print Network [OSTI]

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

Cardoso, Goncalo

2014-01-01T23:59:59.000Z

250

On Solving Single-objective Fuzzy Integer Linear Fractional Programs  

E-Print Network [OSTI]

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

Omar Saad

2009-06-05T23:59:59.000Z

251

Objective space for multiple objectives linear fractional programming  

E-Print Network [OSTI]

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

Said Tantawy

2007-04-13T23:59:59.000Z

252

Linear programming optimization for aquifer influence functions on microcomputers  

E-Print Network [OSTI]

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

Brown, Don L

2012-06-07T23:59:59.000Z

253

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

E-Print Network [OSTI]

the selection of a compatible variable to enter the basis ensures a nondegenerate pivot, PE .... At the heart of this framework lies the search for so-

2014-10-01T23:59:59.000Z

254

New Semidefinite Programming Relaxations for the Linear Ordering ...  

E-Print Network [OSTI]

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

2015-01-15T23:59:59.000Z

255

Designing AC Power Grids using Integer Linear Programming  

E-Print Network [OSTI]

A power grid is a transmission network transporting electrical energy from power ... cost factor for the active power losses, Re the line resistance, and Xe the...

2011-02-18T23:59:59.000Z

256

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

E-Print Network [OSTI]

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

2008-11-06T23:59:59.000Z

257

An Effective Heuristic for Multistage Stochastic Linear Programming  

E-Print Network [OSTI]

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

2013-05-28T23:59:59.000Z

258

Multi-stage Stochastic Linear Programming: Scenarios Versus Events  

E-Print Network [OSTI]

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

2010-05-17T23:59:59.000Z

259

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

E-Print Network [OSTI]

then s? is the unique zero of F in N (s0,r1), where r1 := min[r,(1 + ?1 ? 2? )/(??)] and sk ? s? ? (2?)2k ? ?. , k = 0,1,.... We follow the notation in Dennis and...

2007-12-13T23:59:59.000Z

260

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

E-Print Network [OSTI]

May 31, 2014 ... researchers, the only valuable scientific content of that paper seems to .... proposed by Church & Cohon (1976) for siting energy facilities and...

2014-05-31T23:59:59.000Z

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


261

Uniform Linear Transformation with Repair and Alternation in Genetic Programming  

E-Print Network [OSTI]

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

Spector, Lee

262

mixed zero-one linear programs under objective uncertainty  

E-Print Network [OSTI]

To show that (C) and (P) are equivalent, we construct a sequence of ...... Y. Peres (1999) Resistance bounds for first-passage percolation and maximum.

2010-10-28T23:59:59.000Z

263

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

E-Print Network [OSTI]

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

Jean-Bertrand Gauthier

2014-10-08T23:59:59.000Z

264

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

E-Print Network [OSTI]

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

2001-05-31T23:59:59.000Z

265

Protein Helical Topology Prediction Using Mixed-Integer Linear Programming  

E-Print Network [OSTI]

Allister Department of Chemical Engineering Princeton University The protein folding problem represents one enhances the ASTRO-FOLD protein folding approach of Klepeis and Floudas (2003), which finds the structure

Singh, Jaswinder Pal

266

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

E-Print Network [OSTI]

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

Butkovic, Peter

267

CS 105: Algorithms (Grad) Approximation Algorithms (continued) Feb 21, 2005  

E-Print Network [OSTI]

.g. Clique. = O(log n), e.g. Set Cover. = O(1), e.g. Vertex Cover. Page 1 of 7 #12;CS 105: Algorithms (Grad Algorithms: Vertex Cover 1.1 Introduction to Approximation Algorithms There are several optimization problems (TSP) - finding a minimum cost tour of all cities � Vertex Cover - find minimum set of vertex

Chakrabarti, Amit

268

The optimization problem Genetic Algorithm  

E-Print Network [OSTI]

The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results for time-power optimization META, October 27-31, 2014 1 / 25 #12;The optimization problem Genetic Algorithm Particle Swarm Optimization Experimental results Conclusions Time and energy optimization Traditionally

Giménez, Domingo

269

Deutsch and Jozsa's Algorithm Revisited  

E-Print Network [OSTI]

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

John W. Cooper

2006-03-27T23:59:59.000Z

270

Shrinking Procedures and Optimal Algorithms  

E-Print Network [OSTI]

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

Saeed Ghadimi

2012-06-18T23:59:59.000Z

271

Primitives for animation of algorithms  

E-Print Network [OSTI]

are the difficulty to animate algorithms automatically (or even manually) and the lack of color which is an important visual attribute. TANGO [23] (transition-based animation generation) is another algorithm animation system developed using a path... are the difficulty to animate algorithms automatically (or even manually) and the lack of color which is an important visual attribute. TANGO [23] (transition-based animation generation) is another algorithm animation system developed using a path...

Sudarsky, Sandra

2012-06-07T23:59:59.000Z

272

On complexity of Shmoys - Swamy class of two-stage linear ...  

E-Print Network [OSTI]

Jul 28, 2006 ... We consider a class of two-stage linear stochastic programming problems, ..... the second-stage cost associated with (x?,r?) is greater than the...

2006-07-28T23:59:59.000Z

273

Multipartite entanglement in quantum algorithms  

SciTech Connect (OSTI)

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

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

2011-05-15T23:59:59.000Z

274

Graph Algorithms Tours in Graphs  

E-Print Network [OSTI]

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

Bar-Noy, Amotz

275

A simple approach to lifetime learning in genetic programming-based symbolic regression  

Science Journals Connector (OSTI)

Genetic programming GP coarsely models natural evolution to evolve computer programs. Unlike in nature, where individuals can often improve their fitness through lifetime experience, the fitness of GP individuals generally does not change during their ... Keywords: Genetic programming, hybrid genetic algorithms, lifetime learning, local search, memetic algorithms, symbolic regression

Raja Muhammad Atif Azad; Conor Ryan

2014-06-01T23:59:59.000Z

276

[New technology for linear colliders  

SciTech Connect (OSTI)

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

McIntyre, P.M.

1992-08-12T23:59:59.000Z

277

Linear actuator powered flapping wing  

E-Print Network [OSTI]

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

Benson, Christopher Lee

2010-01-01T23:59:59.000Z

278

linear-elements-code.scm  

E-Print Network [OSTI]

(o Linear-finite-element-operator)) ;; initialize various fields that depend on the space ;; if coefficients is not defined, we set it to arrays of floating-point ;; zeros...

279

Highly linear low noise amplifier  

E-Print Network [OSTI]

, the Low Noise Amplifier (LNA) is expected to provide high linearity, thus preventing the intermodulation tones created by the interference signal from corrupting the carrier signal. The research focuses on designing a novel LNA which achieves high...

Ganesan, Sivakumar

2007-09-17T23:59:59.000Z

280

Linear Accelerator | Advanced Photon Source  

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

(MeV). At 450 MeV, the electrons are relativistic: they are traveling at >99.999% of the speed of light, which is 299,792,458 meters second (186,000 milessecond). Photo: Linear...

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

Quantum Algorithms for Approximating the Effective Resistances in Electrical Networks  

E-Print Network [OSTI]

The theory of electrical network has many applications in algorithm design and analysis. It is an important task to compute the basic quantities about electrical networks, such as electrical flows and effective resistances, as quickly as possible. Classically, to compute these quantities, one basically need to solve a Laplacian linear system, and the best known algorithms take $\\tilde{O}(m)$ time, where $m$ is the number of edges. In this paper, we present two quantum algorithms for approximating the effective resistance between any two vertices in an electrical network. Both of them have time complexity polynomial in $\\log{n}$, $d$, $c$, $1/\\phi$ and $1/\\epsilon$, where $n$ is the number of vertices, $d$ is the maximum degree of the vertices, $c$ is the ratio of the largest to the smallest edge resistance, $\\phi$ is the expansion of the network, and $\\epsilon$ is the relative error. In particular, when $d$ and $c$ are small and $\\phi$ is large, our algorithms run very fast. In contrast, it is unknown whether classical algorithms can solve this case very fast. Furthermore, we prove that the polynomial dependence on the inverse expansion (i.e. $1/\\phi$) is necessary. As a consequence, our algorithms cannot be significantly improved. Finally, as a by-product, our second algorithm also produces a quantum state approximately proportional to the electrical flow between any two vertices, which might be of independent interest. Our algorithms are based on using quantum tools to analyze the algebraic properties of graph-related matrices. While one of them relies on inverting the Laplacian matrix, the other relies on projecting onto the kernel of the weighted incidence matrix. It is hopeful that more quantum algorithms can be developed in similar way.

Guoming Wang

2013-11-08T23:59:59.000Z

282

Stability of Coupling Algorithms  

E-Print Network [OSTI]

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

Akkasale, Abhineeth

2012-07-16T23:59:59.000Z

283

SunShot Initiative: Linear Fresnel  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

284

NASA/CR2003212153 A Stochastic Collocation Algorithm  

E-Print Network [OSTI]

NASA/CR­2003­212153 A Stochastic Collocation Algorithm for Uncertainty Analysis Lionel Mathelin and M. Yousuff Hussaini Florida State University, Tallahassee, Florida February 2003 #12;The NASA STI Program Office . . . in Profile Since its founding, NASA has been dedicated to the advancement

Mathelin, Lionel

285

NASA/TM2010216190 A General Algorithm for Reusing Krylov  

E-Print Network [OSTI]

NASA/TM­2010­216190 A General Algorithm for Reusing Krylov Subspace Information. I. Unsteady Navier, and Hester Bijl Delft University of Technology, Delft, The Netherlands January 2010 #12;NASA STI Program . . . in Profile Since its founding, NASA has been dedicated to the advancement of aeronautics and space science

Vuik, Kees

286

Efficient spectral and pseudospectral algorithms for 3D simulations of whistler-mode waves in a plasma  

Science Journals Connector (OSTI)

Efficient spectral and pseudospectral algorithms for simulation of linear and nonlinear 3D whistler waves in a cold electron plasma are developed. These algorithms are applied to the simulation of whistler waves generated by loop antennas and spheromak-like ... Keywords: Graphics processors, Pseudospectral methods, Waves in plasma, Whistler waves

Nail A. Gumerov; Alexey V. Karavaev; A. Surjalal Sharma; Xi Shao; Konstantinos D. Papadopoulos

2011-04-01T23:59:59.000Z

287

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

E-Print Network [OSTI]

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

Jordan, King

288

Biochemistry 218 A critical review of PCR primer design algorithms and cross-  

E-Print Network [OSTI]

__________________________________________________________________________________ 1 A critical review of PCR primer design algorithms and cross- hybridization case study F. John used primer design programs rely upon a core set of parameters such as melting temperature, primer algorithms ,and other available PCR primer analysis software, was conducted to find the best means

289

Program Manager  

Broader source: Energy.gov [DOE]

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

290

Program Managers  

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

Program Managers Program Managers Enabling remarkable discoveries and tools that transform our understanding of energy and matter and advance national, economic, and energy...

291

Retiree Program  

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

Library Services Retiree Program Retiree Program The Research Library offers a 1 year library card to retired LANL employees that allows usage of Library materials. This service...

292

Educational Programs  

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

Educational Programs Educational Programs A collaboration between Los Alamos National Laboratory and the University of California at San Diego (UCSD) Jacobs School of Engineering...

293

An improved proof-theoretic compilation of logic programs  

Science Journals Connector (OSTI)

In prior work, we showed that logic programming compilation can be given a proof-theoretic justification for generic abstract logic programming languages, and demonstrated this technique in the case of hereditary Harrop formulas and their linear variant. ... Keywords: Abstract Logic Programming, Compilation, Hereditary Harrop Formulas, Well-Moded Logic Programs

Iliano Cervesato

2012-09-01T23:59:59.000Z

294

LINEAR COUPLING CORRECTION WITH N-TURN MAPS.  

SciTech Connect (OSTI)

The linear one-turn map of a storage ring contains coupling information on which a correction algorithm can be based. In principal, the one-turn matrix can be fitted from turn-by-turn data of beam position monitors after a kick was applied. However, the so obtained coupling information often sinks into the noise floor. The signal-to-noise ratio of the coupling information can be greatly enhanced by fitting maps for larger turn numbers N, equal to half the beat period. With the so obtained N-turn map an automated global coupling correction is possible without the need for a tune change. This is demonstrated for the Relativistic Heavy Ion Collider where the algorithm is implemented for operational use at injection.

FISCHER,W.

2003-05-12T23:59:59.000Z

295

Shor's algorithm on a nearest-neighbor machine  

E-Print Network [OSTI]

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

Samuel A. Kutin

2006-08-31T23:59:59.000Z

296

Environmental Programs Environmental Programs Committee  

E-Print Network [OSTI]

(Architecture) The Environmental Programs Committee coordinates courses and curricula on environmental topics. Wiesner (Civil and Environmental Engineering) Gordon G. Wittenberg (Architecture) #12;162 Environmental Programs Environmental Programs Committee Walter Whitfield Isle, Chair (English

Richards-Kortum, Rebecca

297

SRS - Programs - Nonproliferation Programs  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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.

298

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

E-Print Network [OSTI]

Linearly Scaling 3D Fragment Method for Large-Scale Electronic Structure Calculations Lin-Wang Wang-dimensional fragment (LS3DF) method for large scale ab initio electronic structure calculations. LS3DF is based. The fragments of the LS3DF algorithm can be calculated separately with different groups of processors

Bailey, David H.

299

Spherical Harmonic Transform Algorithms  

SciTech Connect (OSTI)

A collection of MATLAB classes for computing spherical harmonic transforms are presented and used to solve simple partial differential equations on the sphere. The spectral synthesis and analysis using fast Fourier transforms and Legendre transforms with the associated Legendre functions are presented in depth. A set of methods associated with a spectral\\_field class provides spectral approximation to the $\\DIV$, $\\CURL$, $\\GRAD$, and $\\LAPL$ in spherical geometr y. Laplace inversion and Helmholtz equation solvers are also methods for this clas s. Investigation of algorithms and analysis for spherical harmonic transform optio ns for parallel high performance computers are discussed in the context of global climate and weather models.

Drake, John B [ORNL; Worley, Patrick H [ORNL; D'Azevedo, Eduardo [ORNL

2008-01-01T23:59:59.000Z

300

COSET: a program for deriving and testing merohedral and pseudo-merohedral twin laws  

Science Journals Connector (OSTI)

A new computer program which implements left coset decomposition algorithms to derive possible merohedral and pseudo-merohedral twin laws is presented.

Boyle, P.D.

2014-01-30T23:59:59.000Z

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


301

SciTech Connect: Final Report for Enhancing the MPI Programming...  

Office of Scientific and Technical Information (OSTI)

Message Passing Interface; Scalable Algorithms; Parallel Programming Models Word Cloud More Like This Full Text preview image File size NAView Full Text View Full Text DOI:...

302

Linear Collider Collaboration Tech Notes  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

303

Linearized Functional Minimization for Inverse Modeling  

SciTech Connect (OSTI)

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

304

Linear operator inequalities for strongly stable weakly regular linear systems  

E-Print Network [OSTI]

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

Curtain, Ruth F.

305

Non adiabatic quantum search algorithms  

E-Print Network [OSTI]

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

A. Perez; A. Romanelli

2007-06-08T23:59:59.000Z

306

Online scheduling of simple linear deteriorating jobs to minimize the total general completion time  

Science Journals Connector (OSTI)

Abstract Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations in which the processing time increases (deteriorates) as the start time increases. In particular, lots of work has been devoted to jobs with simple linear deterioration. The processing time p j of job J j is a simple linear function of its start time s j , precisely, p j = b j s j , where b j is the deteriorating rate. In this paper, we study the problem of online non-preemptive scheduling of jobs with arbitrary release times and simple linear deteriorating rates on a single machine to minimize the total general completion time. We present an algorithm DSDR (Delayed Smallest Deteriorating Rate) and prove that it achieves the best-possible competitive ratio ( 1 + b max ) ? for all deterministic online algorithms, where ? is the general index of completion time and ? > 0 .

Sheng Yu; Prudence W.H. Wong

2013-01-01T23:59:59.000Z

307

Wheat Improvement Programs WHEAT PROGRAM  

E-Print Network [OSTI]

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

308

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

309

Optimization Online - Coordinate descent algorithms  

E-Print Network [OSTI]

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

Stephen Wright

2014-12-01T23:59:59.000Z

310

Messy genetic algorithms: Recent developments  

SciTech Connect (OSTI)

Messy genetic algorithms define a rare class of algorithms that realize the need for detecting appropriate relations among members of the search domain in optimization. This paper reviews earlier works in messy genetic algorithms and describes some recent developments. It also describes the gene expression messy GA (GEMGA)--an {Omicron}({Lambda}{sup {kappa}}({ell}{sup 2} + {kappa})) sample complexity algorithm for the class of order-{kappa} delineable problems (problems that can be solved by considering no higher than order-{kappa} relations) of size {ell} and alphabet size {Lambda}. Experimental results are presented to demonstrate the scalability of the GEMGA.

Kargupta, H. [Los Alamos National Lab., NM (United States). Computational Science Methods Group

1996-09-01T23:59:59.000Z

311

Transformations for densities Linear transformations  

E-Print Network [OSTI]

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

Adler, Robert J.

312

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

E-Print Network [OSTI]

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

Acep Purqon; Sparisoma Viridi

2014-11-01T23:59:59.000Z

313

Localized overlap algorithm for unexpanded dispersion energies  

SciTech Connect (OSTI)

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

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

2014-03-21T23:59:59.000Z

314

Educational Programs  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

315

The total adjustment cost problem: Applications, models, and solution algorithms  

Science Journals Connector (OSTI)

Resource leveling problems arise whenever it is expedient to reduce the fluctuations in resource utilization over time, while maintaining a prescribed project completion deadline. Several resource leveling objective functions may be defined, consideration ... Keywords: Minimum and maximum time lags, Mixed-integer linear programming formulations, Project scheduling, Resource adjustment

Stefan Kreter; Julia Rieck; Jrgen Zimmermann

2014-04-01T23:59:59.000Z

316

Fixed Parameter Algorithms Daniel Marx  

E-Print Network [OSTI]

, for example k-CLIQUE and k-INDEPENDENT SET, no FPT algorithm is known. Can we show that these problems if and only if it has a vertex cover of size n - k. Transforming an INDEPENDENT SET instance (G, k, but INDEPENDENT SET is not known to be FPT. Fixed Parameter Algorithms ­ p.5/41 #12;Parameterized reduction

Fondements et Applications, Université Paris 7

317

ALGEBRAIC AND NUMERICAL ALGORITHMS 1  

E-Print Network [OSTI]

ALGEBRAIC AND NUMERICAL ALGORITHMS 1 Ioannis Z. Emiris National Kapodistrian University of Athens as manipulation with truncated series and algebraic sets. Such problems can be solved based on the error by employing various nontrivial computational techniques such as the Euclidean algorithm and continuous

Tsigaridas, Elias

318

Accidental Algorithms Leslie G. Valiant  

E-Print Network [OSTI]

Accidental Algorithms Leslie G. Valiant Division of Engineering and Applied Sciences Harvard also show a similar dichtomy for a vertex cover problem. To derive completeness results we use a new show in this way that 2CNF, the parity problem for 2CNF, is P-complete. To derive efficient algorithms

Valiant, Leslie

319

L21: "Irregular" Graph Algorithms  

E-Print Network [OSTI]

11/11/10 1 L21: "Irregular" Graph Algorithms November 11, 2010 Administrative ·Class cancelled Monday, November 22, 11:59 PM Today we will cover Successive Over Relaxation. Here is the sequential code ·Irregular parallel computation - Sparse matrix operations (last time) and graph algorithms (this time

Hall, Mary W.

320

ALGEBRAIC AND NUMERICAL ALGORITHMS1  

E-Print Network [OSTI]

ALGEBRAIC AND NUMERICAL ALGORITHMS1 Ioannis Z. Emiris National Kapodistrian University of Athens as manipulation with truncated series and algebraic sets. Such problems can be solved based on the error by employing various nontrivial computational techniques such as the Euclidean algorithm and continuous

Tsigaridas, Elias

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

international programs  

National Nuclear Security Administration (NNSA)

9%2A en International Programs http:nnsa.energy.govaboutusourprogramsemergencyoperationscounterterrorisminternationalprograms

322

A Genetic Algorithm for Coverage Problems  

E-Print Network [OSTI]

or all classes covered) Genetic Algorithm step on P producing child population C: Roulette genetic algorithm 2. A GENETIC ALGORITHM FOR COVER- AGE PROBLEMS We have devised a genetic algorithmA Genetic Algorithm for Coverage Problems Colin Johnson Computing Laboratory, University of Kent

Kent, University of

323

Generalized Greedy Algorithm for Shortest Superstring  

E-Print Network [OSTI]

an approximation factor of 2. The greedy set covering algorithm. To see that the approximation factor of GreedyHn factor approximation algorithm, using the greedy set cover algorithm [11], where Hn = 1 + 1 2 + 1 of optimal set and generalize the primitive greedy algorithm. The generalized algorithm can be reduced

Markowitch, Olivier

324

A combinatorial algorithm for MAX CSP  

Science Journals Connector (OSTI)

We consider the problem MAX CSP over multi-valued domains with variables ranging over sets of size si ? s and constraints involving kj ? k variables. We study two algorithms with approximation ratios A ... Keywords: algorithmical approximation, analysis of algorithms, combinatorial problems, databases, design of algorithms, graph algorithms

Mayur Datar; Toms Feder; Aristides Gionis; Rajeev Motwani; Rina Panigrahy

2003-03-01T23:59:59.000Z

325

A Parametric Mixed-Integer Optimization Algorithm for Multiobjective Engineering Problems Involving Discrete Decisions  

Science Journals Connector (OSTI)

When the multiobjective problem involves continuous and discrete decisions, as is usually the case in process decision making, it can be formulated as follows: ... The parametric programming theory has mostly focused on linear problems (Gal, 1979). ...

Katerina P. Papalexandri; Theodora I. Dimkou

1998-04-16T23:59:59.000Z

326

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

E-Print Network [OSTI]

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

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

327

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

328

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

329

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

330

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

331

Algorithm and intelligent tutoring system design for ladder logic programming  

E-Print Network [OSTI]

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

Cheng, Yuan-Teng

2009-05-15T23:59:59.000Z

332

Toward a molecular programming language for algorithmic self-assembly.  

E-Print Network [OSTI]

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

Patitz, Matthew John

2010-01-01T23:59:59.000Z

333

Toward a molecular programming language for algorithmic self-assembly.  

E-Print Network [OSTI]

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

Patitz, Matthew John

2010-01-01T23:59:59.000Z

334

DYNAMIC PROGRAMMING VERSUS GRAPH CUT ALGORITHMS Chris Glasbey  

E-Print Network [OSTI]

¨¨ ¨¨ ¨¨ ¨¨ ¨¨¨% uA u c 3 u c 1 u c 4 u c 4 u c 2 u c 5 u c 5 u c 3 u c 5 u c 3 u c 1 u c 2 u c 1 u c 2 u c 3 u c 5 u c 3 u c 1 u c 4 u c 4 u c 1 u c 2 u c 4 u c 4 u c 2 u c 5 u c 2 u c 1 u c 5 u c 3 sourceu rr rrrj u d d d d dd u c u © u ¨¨ ¨¨ ¨¨ ¨¨ ¨¨¨% uA u c 3 u c 1 u c 4 u c 4 u c 2 u c 5 u c

Stone, J. V.

335

An Implementation of an Algorithm for Nonlinear Programming ...  

E-Print Network [OSTI]

Apr 21, 2011 ... where ?k ? [0,1] is a truncation factor used to ensure that the trial point satisfies all the ...... This is a progress report on the development of a production-quality .... PhD thesis, University of London, London, England, 1978.

2011-04-21T23:59:59.000Z

336

IISc BS Program: Engineering Curriculum Why an Engineering Curriculum in a Science Degree? Engineering is concerned  

E-Print Network [OSTI]

:1) : Introduction to Electrical and Electronics Engineering In addition, given the increasing importance Content · Notions of algorithm, data abstraction, data structures; Importance of data structures and algorithms in programming; Notion of complexity of algorithms and the big Oh notation. (3 Hours) · Iteration

Srinivasan, N.

337

Mathematical Programming Models and Their Relaxations for The ...  

E-Print Network [OSTI]

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

Birbil

2014-08-20T23:59:59.000Z

338

An Augmented Lagrangian Method for Conic Convex Programming  

E-Print Network [OSTI]

Feb 26, 2013 ... ... first-order augmented Lagrangian algorithm ALCC for solving convex conic programs of the form min{rho(x)+gamma(x): Ax-b in K, x in chi},...

Necdet Serhat Aybat

2013-02-26T23:59:59.000Z

339

Scalable Load Distribution and Load Balancing for Dynamic Parallel Programs  

E-Print Network [OSTI]

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

Berger, Emery

340

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

Fischer, Luke D.

2011-08-08T23: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

Better Buildings Neighborhood Program: Related Federal Programs  

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

About About Printable Version Share this resource Send a link to Better Buildings Neighborhood Program: Related Federal Programs to someone by E-mail Share Better Buildings Neighborhood Program: Related Federal Programs on Facebook Tweet about Better Buildings Neighborhood Program: Related Federal Programs on Twitter Bookmark Better Buildings Neighborhood Program: Related Federal Programs on Google Bookmark Better Buildings Neighborhood Program: Related Federal Programs on Delicious Rank Better Buildings Neighborhood Program: Related Federal Programs on Digg Find More places to share Better Buildings Neighborhood Program: Related Federal Programs on AddThis.com... Our History Related Federal Programs Why Energy Efficiency Upgrades Contacts Related Federal Programs Related Links

342

Weatherization and Intergovernmental Program: Program Guidance  

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

Program Guidance Program Guidance Site Map Printable Version Share this resource Send a link to Weatherization and Intergovernmental Program: Program Guidance to someone by E-mail Share Weatherization and Intergovernmental Program: Program Guidance on Facebook Tweet about Weatherization and Intergovernmental Program: Program Guidance on Twitter Bookmark Weatherization and Intergovernmental Program: Program Guidance on Google Bookmark Weatherization and Intergovernmental Program: Program Guidance on Delicious Rank Weatherization and Intergovernmental Program: Program Guidance on Digg Find More places to share Weatherization and Intergovernmental Program: Program Guidance on AddThis.com... Closeout Guidance Recovery Act Monitoring & Reporting National Environmental Policy Act

343

Geospatial Science Program | Department of Energy  

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

Geospatial Science Program Geospatial Science Program Geospatial Science Program June 21, 2011 - 3:50pm Addthis The overarching mission of the Department of Energy (DOE) is to discover solutions to power and secure America's future. DOE's Geospatial Science Program was established to optimize geospatial investments across our complex and to enable prudent stewardship of the resources provided by the American taxpayer. The term 'geospatial science' encompasses both the concepts of geographic information science and geographic information systems. Geographic information science is the study of spatially-referenced data, including geographic theory, technological design, and analytical algorithms. Geographic Information Systems (GIS) are specialized software and hardware used to manage, manipulate, query, and

344

Berkeley Algorithms Help Researchers Understand Dark Energy  

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

Berkeley Algorithms Help Researchers Understand Dark Energy Berkeley Algorithms Help Researchers Understand Dark Energy November 24, 2014 | Tags: Astrophysics Contact: Linda Vu, +1...

345

Dereverberation by linear systems techniques  

E-Print Network [OSTI]

- sentation by a finite number of thin layers and wave propagation normal to these layers. A linear, recursive mathematical model is developed and a method for the identification of parameters in the absence of noise i. , discussed. Appli ations are made...--Final System Configuration 29 16. Water Model--System Flow Diagram 17. The A Matrix 18. The B, C, and D Matrices 31 32 33 I. INTROD&JCTIO22 The removal of deleterious effects which arise in the transmission of waves through layered media is a problem...

Schell, John August

1970-01-01T23:59:59.000Z

346

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

E-Print Network [OSTI]

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

Birkett, Stephen

347

Weatherization and Intergovernmental Program: Tribal Energy Program  

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

About About Site Map Printable Version Share this resource Send a link to Weatherization and Intergovernmental Program: Tribal Energy Program to someone by E-mail Share Weatherization and Intergovernmental Program: Tribal Energy Program on Facebook Tweet about Weatherization and Intergovernmental Program: Tribal Energy Program on Twitter Bookmark Weatherization and Intergovernmental Program: Tribal Energy Program on Google Bookmark Weatherization and Intergovernmental Program: Tribal Energy Program on Delicious Rank Weatherization and Intergovernmental Program: Tribal Energy Program on Digg Find More places to share Weatherization and Intergovernmental Program: Tribal Energy Program on AddThis.com... Plans, Implementation, & Results Weatherization Assistance Program

348

Cryogenic technology boosts linear accelerator capability  

Science Journals Connector (OSTI)

Cryogenic technology boosts linear accelerator capability ... Two critical properties of matter at cryogenic temperaturessuperconductivity and superfluidityshould open the way for a major advance in electron linear accelerator capability. ...

1968-05-06T23:59:59.000Z

349

Ultrashort Pulse Propagation in the Linear Regime  

E-Print Network [OSTI]

First, we investigate the Bouguer-Lambert-Beer (BLB) law as applied to the transmission of ultrashort pulses through water in the linear absorption regime. We present a linear theory for propagation of ultrashort laser pulses, and related...

Wang, Jieyu

2010-07-14T23:59:59.000Z

350

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

351

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

SciTech Connect (OSTI)

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

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

1996-11-01T23:59:59.000Z

352

Grid Monitoring: Bounds on Performances of Sensor Placement Algorithms Muhammad Uddin  

E-Print Network [OSTI]

matrix, we use a linear minimum mean squared error estimator as the state estimator to formulate the PMU estimators rely on the redundant mea- surements captured by supervisory control and data acqui- sition (SCADA iterative algorithms [3]. The PMUs, on the other hand, can directly measure the states at the PMU

Kavcic, Aleksandar

353

Further Program Development for the Cost Minimizing Global Energy System Model GET-RC.  

E-Print Network [OSTI]

??The linear programming Global Energy Transition (GET) model covers the global energy system and is designed to meet exogenously given energy demand levels, subject to (more)

Andersson, Magnus

2013-01-01T23:59:59.000Z

354

An algorithm for scheduling a large pumped storage plant  

SciTech Connect (OSTI)

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

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

1985-08-01T23:59:59.000Z

355

Approximation Algorithms Vijay V. Vazirani  

E-Print Network [OSTI]

: : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 I COMBINATORIAL ALGORITHMS 2 Set cover and its application to shortest superstring­duality : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 52 11 Rounding applied to set cover : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 59 12 LP­duality based analysis for set cover

Porat, Ely

356

Randomized algorithms for reliable broadcast  

E-Print Network [OSTI]

In this thesis, we design randomized algorithms for classical problems in fault tolerant distributed computing in the full-information model. The full-information model is a strong adversarial model which imposes no ...

Vaikuntanathan, Vinod

2009-01-01T23:59:59.000Z

357

SECO Programs  

E-Print Network [OSTI]

maximum of $50,000 per grant ? Funded on a reimbursement basis Renewable Energy Technology Grants ? Fort Worth ISD ? South Sills High School ? 5KW Wind Turbine Alternative Fuel Grants ? Grant program to convert city/county and ISD vehicle... fleets to alternative fuels and hybrid- electric vehicles ? Competitive equipment grant program ? Maximum grant per vehicle - $5,000 ? Maximum total grant per applicant - $50,000 ? Funded on a reimbursement basis The LoanSTAR Revolving Loan Program...

Trevino, E.

2011-01-01T23:59:59.000Z

358

Challenges in future linear colliders  

SciTech Connect (OSTI)

For decades, electron-positron colliders have been complementing proton-proton colliders. But the circular LEP, the largest e-e+ collider, represented an energy limit beyond which energy losses to synchrotron radiation necessitate moving to e-e+ linear colliders (LCs), thereby raising new challenges for accelerator builders. Japanese-American, German, and European collaborations have presented options for the Future Linear Collider (FLC). Key accelerator issues for any FLC option are the achievement of high enough energy and luminosity. Damping rings, taking advantage of the phenomenon of synchrotron radiation, have been developed as the means for decreasing beam size, which is crucial for ensuring a sufficiently high rate of particle-particle collisions. Related challenges are alignment and stability in an environment where even minute ground motion can disrupt performance, and the ability to monitor beam size. The technical challenges exist within a wider context of socioeconomic and political challenges, likely necessitating continued development of international collaboration among parties involved in accelerator-based physics.

Swapan Chattopadhyay; Kaoru Yokoya

2002-09-02T23:59:59.000Z

359

Repair of overheating linear accelerator  

SciTech Connect (OSTI)

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

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

2004-01-01T23:59:59.000Z

360

Fully relativistic lattice Boltzmann algorithm  

SciTech Connect (OSTI)

Starting from the Maxwell-Juettner equilibrium distribution, we develop a relativistic lattice Boltzmann (LB) algorithm capable of handling ultrarelativistic systems with flat, but expanding, spacetimes. The algorithm is validated through simulations of a quark-gluon plasma, yielding excellent agreement with hydrodynamic simulations. The present scheme opens the possibility of transferring the recognized computational advantages of lattice kinetic theory to the context of both weakly and ultrarelativistic systems.

Romatschke, P. [Frankfurt Institute for Advanced Studies, D-60438 Frankfurt (Germany); Mendoza, M. [ETH Zuerich, Computational Physics for Engineering Materials, Institute for Building Materials, Schafmattstrasse 6, HIF, CH-8093 Zuerich (Switzerland); Succi, S. [Istituto per le Applicazioni del Calcolo C.N.R., Via dei Taurini, 19 I-00185, Rome (Italy); Freiburg Institute for Advanced Studies, Albertstrasse, 19, D-79104, Freiburg (Germany)

2011-09-15T23:59:59.000Z

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


361

Program Evaluation  

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

Evaluation: Background and Methods Evaluation: Background and Methods Definition of evaluation: the process of determining the worth or merit of something; if "something" is a program, then it's "program evaluation." Other types of evaluation include: product evaluation (most widely practiced, e.g., Consumer Reports); personnel evaluation; research evaluation; policy studies; art, movie, play, and book reviews. Program evaluation is NOT the same as research although they share many characteristics--Both: Start with questions Use similar methods Provide similar information Program evaluation focuses on decisions. Research focuses on answering questions about phenomena to discover new knowledge and test theories/hypotheses. Research is aimed at truth. Evaluation is aimed at

362

Program Description  

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

Program Description Program Description SAGE, the Summer of Applied Geophysical Experience, is a unique educational program designed to introduce students in geophysics and related fields to "hands on" geophysical exploration and research. The program emphasizes both teaching of field methods and research related to basic science and a variety of applied problems. SAGE is hosted by the National Security Education Center and the Earth and Environmental Sciences Division of the Los Alamos National Laboratory. * teaches modern geophysical exploration techniques: seismic reflection and refraction, gravity and magnetics, electromagnetics (including magnetotellurics), and electrical resistivity * involves extensive hands-on field experience * integrates geophysical methods to solve real

363

Counterintelligence Program  

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

The Order establishes Counterintelligence Program requirements and responsibilities for the Department of Energy, including the National Nuclear Security Administration. Cancels: DOE 5670.3.

2004-12-10T23:59:59.000Z

364

Program Planning  

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

In practice, organization is fluid, highly matrixed; scientists work in multiple areas - Ad hoc Task Forces form to address specific problems or issues * Experimental Program...

365

Counterintelligence Program  

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

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

1992-09-04T23:59:59.000Z

366

Programming Stage  

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

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

1997-05-21T23:59:59.000Z

367

tentative program  

E-Print Network [OSTI]

Sep 28, 2014 ... with Jon Brown, Gabriel Nagy, Aidan Sims, and Dana Williams. David Fisher Groups acting on Manifolds: Around the Zimmer Program.

2014-09-19T23:59:59.000Z

368

LWRS Program  

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

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

369

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

SciTech Connect (OSTI)

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

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

1991-08-01T23:59:59.000Z

370

General linear methods for Volterra integral equations  

Science Journals Connector (OSTI)

We investigate the class of general linear methods of order p and stage order q=p for the numerical solution of Volterra integral equations of the second kind. Construction of highly stable methods based on the Schur criterion is described and examples ... Keywords: Convolution test equation, General linear methods, Linear stability analysis, Order conditions, Volterra integral equations

G. Izzo; Z. Jackiewicz; E. Messina; A. Vecchio

2010-09-01T23:59:59.000Z

371

Linear-Time Algorithm for the Paired-Domination Problem in Convex Bipartite Graphs  

Science Journals Connector (OSTI)

Variations of the domination problem seek to find a minimum dominating set with some additional properties, e.g., ... network applications, where the problem is to locate the smallest number of centers in network...

Ruo-Wei Hung

2012-05-01T23:59:59.000Z

372

A fast randomized algorithm for overdetermined linear least-squares regression  

Science Journals Connector (OSTI)

...SIAM J Comput , in press . 7 Liberty E Woolfe F Martinsson P-G...20167 20172 . 8 Woolfe F Liberty E Rokhlin V Tygert M ( 2007...Anal , in press . 9 Ailon N Liberty E ( 2007 ) Fast dimension...Defense Advanced Research Projects Agency Grant FA9550-07-1-0541...

Vladimir Rokhlin; Mark Tygert

2008-01-01T23:59:59.000Z

373

New algorithm to construct a stabilizing controller for linear systems over integral domains  

Science Journals Connector (OSTI)

......expressed as either P = ND ? 1 with N ? A n x m and D ? (A) m or P = ? D ? 1 ? N with ? N ? A n x m and ? D ? (A) n.Now we rede fi ne the matrices T, W as T = ? N t D t ? t and W = ? ? N ? D ?. Further we consider that t I and w J are de fi ned with the......

Kazuyoshi Mori

2002-09-01T23:59:59.000Z

374

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

E-Print Network [OSTI]

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

van der Meyden, Ron

375

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

E-Print Network [OSTI]

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

Rojas, Marielba

376

Predictive multiple sampling algorithm with overlapping integration intervals for linear wide dynamic range integrating image sensors  

E-Print Network [OSTI]

Machine vision systems are used in a wide range of applications such as security, automated quality control and intelligent transportation systems. Several of these systems need to extract information from natural scenes ...

Acosta Serafini, Pablo M. (Pablo Manuel), 1971-

2004-01-01T23:59:59.000Z

377

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

E-Print Network [OSTI]

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

Guo, Minyi

378

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

E-Print Network [OSTI]

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

Zeng, Jianyang "Michael"

379

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

E-Print Network [OSTI]

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

Zeng, Jianyang "Michael"

380

Advanced Control Algorithms for Discrete Linear Repetitive Processes in Self-servowriting of Hard Disk Drives  

E-Print Network [OSTI]

NRTE) on the Performance of PAA 89 6.4.3 Error Shaping91 6.5.1 PAA with and without92 6.5.2 PAA with Error Shaping

Dong, Feng Dan

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


381

Patch-Levy-based initialization algorithm for Bees Algorithm  

Science Journals Connector (OSTI)

Abstract The Bees Algorithm (BA) is a population-based metaheuristic algorithm inspired by the foraging behavior of honeybees. This algorithm has been successfully used as an optimization tool in combinatorial and functional optimization fields. In addition, its behavior very closely mimics the actual behavior that occurs in nature, and it is very simple and easy to implement. However, its convergence speed to the optimal solution still needs further improvement and it also needs a mechanism to obviate getting trapped in local optima. In this paper, a novel initialization algorithm based on the patch concept and Levy flight distribution is proposed to initialize the population of bees in BA. Consequently, we incorporate this initialization procedure into a proposed enhanced BA variant. The proposed variant is more natural than conventional variants of BA. It mimics the patch environment in nature and Levy flight, which is believed to characterize the foraging patterns of bees in nature. The results of experiments conducted on several widely used high-dimensional benchmarks indicate that our proposed enhanced BA variant significantly outperforms other BA variants and state-of-the-art variants of the Artificial Bee Colony (ABC) algorithm in terms of solution quality, convergence speed, and success rate. In addition, the results of experimental analyses conducted indicate that our proposed enhanced BA is very stable, has the ability to deal with differences in search ranges, and rapidly converges without getting stuck in local optima.

Wasim A. Hussein; Shahnorbanun Sahran; Siti Norul Huda Sheikh Abdullah

2014-01-01T23:59:59.000Z

382

Linear Collider Collaboration Tech Notes  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

383

Linear Collider Collaboration Tech Notes  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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.

384

Linear Collider Collaboration Tech Notes  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

385

Linear Collider Collaboration Tech Notes  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

386

Linear Collider Collaboration Tech Notes  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

387

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

388

Linear Collider Collaboration Tech Notes  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

389

On extreme Bosonic linear channels  

E-Print Network [OSTI]

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

A. S. Holevo

2011-11-15T23:59:59.000Z

390

Advanced Algorithms Course. Lecture Notes. Part 2  

E-Print Network [OSTI]

Advanced Algorithms Course. Lecture Notes. Part 2 Set Cover This is a very fundamental problem approximation algorithm. A natural greedy rule is to successively add sets Si to the solution, that cover Si be the set that covers this sj in the greedy algorithm. Since the algorithm always picks an Si

Damaschke, Peter

391

ZART: A Multifunctional Itemset Mining Algorithm  

E-Print Network [OSTI]

ZART: A Multifunctional Itemset Mining Algorithm Laszlo Szathmary1 , Amedeo Napoli1 , and Sergei O independent, multi-purposed data mining platform, incorporating a rich collection of data mining algorithms. One of these algorithms is a multifunctional itemset mining algorithm called Zart, which is based

Boyer, Edmond

392

The Observer Algorithm for Visibility Approximation  

E-Print Network [OSTI]

other algorithms do. We test this algorithm in several settings: rural, mountainous and urban areasThe Observer Algorithm for Visibility Approximation Per-Magnus OLSSON a and Patrick DOHERTY present a novel algorithm for visibility approximation that is sub- stantially faster than ray casting

Doherty, Patrick

393

Introduction to Algorithms April 8, 2014  

E-Print Network [OSTI]

1 CS38 Introduction to Algorithms Lecture 3 April 8, 2014 April 8, 2014 CS38 Lecture 3 2 Outline · greedy algorithms... ­ Dijkstra's algorithm for single-source shortest paths · guest lecturer (this lecture and next) ­ coin changing ­ interval scheduling ­ MCST (Prim and Kruskal) Greedy algorithms

Umans, Chris

394

Graph Algorithms Special Sets in Graphs  

E-Print Network [OSTI]

{u e}. Graph Algorithms 8 #12;Example: A Vertex Cover Set Graph Algorithms 9 #12;Example: A Minimum Size Vertex Cover Set Graph Algorithms 10 #12;A Clique A set of vertices for which all possible edges * * * * * Graph Algorithms 20 #12;Independent Sets and Vertex Cover Sets Observation: I is an independent set

Bar-Noy, Amotz

395

Improved approximation algorithm for the jump number of interval orders  

Science Journals Connector (OSTI)

Abstract The jump number problem for posets is to find a linear extension in which the number of incomparable adjacent pairs is minimized. In this paper the class of interval orders is considered. Three 3/2-approximation algorithms for this problem have been known for some time. By a previous work of Mitas, the problem may be reformulated as a subgraph packing task. We prove that the problem reduces also to a set cover task, and we establish an improved bound of 1.484 to the approximation ratio of the jump number on interval orders.

Przemys?aw Krysztowiak

2013-01-01T23:59:59.000Z

396

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

E-Print Network [OSTI]

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

Kozick, Richard J.

397

Optimal linear phase FIR filter design using particle swarm optimization with constriction factor and inertia weight approach with wavelet mutation  

Science Journals Connector (OSTI)

In this paper, Particle Swarm Optimization with Constriction Factor and Inertia Weight Approach is hybridized with Wavelet Mutation PSOCFIWA-WM strategy for the optimal design of linear phase FIR filters. Real coded genetic algorithm RGA, particle swarm ... Keywords: Band Pass, Band Stop, Convergence, Evolutionary Optimization Technique, Fir Filter, High Pass, Low Pass, Magnitude Response, Pso, Psocfiwa, Psocfiwa-Wm, Rga

S. K. Saha; R. Kar; D. Mandal; S. P. Ghoshal

2014-04-01T23:59:59.000Z

398

Global Optimization in Generalized Geometric Programming  

E-Print Network [OSTI]

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

Maranas, Costas

399

Program performs vapor-liquid equilibrium calculations  

SciTech Connect (OSTI)

A program designed for the Hewlett-Packard HP-41CV or 41C calculators solves basic vapor-liquid equilibrium problems, including figuring the dewpoint, bubblepoint, and equilibrium flash. The algorithm uses W.C. Edmister's method for predicting ideal-solution K values.

Rice, V.L.

1982-06-28T23:59:59.000Z

400

Linear Fresnel Collector Receiver: Heat Loss and Temperatures  

Science Journals Connector (OSTI)

Abstract For design and component specification of a Linear Fresnel Collector (LFC) cavity receiver, the prediction of temperature distribution and heat loss is of great importance. In this paper we present a sensitivity analysis for a range of geometry and material parameters. For the LFC receiver analysis we use two models developed at Fraunhofer ISE. One is a detailed model, combining the spatial distribution of reflected radiation via ray tracing with detailed convective simulations through computational fluid dynamics. The second one is a fast algorithm based on a thermal resistance model. It is applying a similar methodology as the well-known model for vacuum absorber, enhancing an absorber tube model by parameters describing the influence of the secondary mirror and cover glass. The thermal resistance model is described in detail. Obtained results indicate a significant effect of the secondary mirror temperature on heat loss for specific geometries.

A. Heimsath; F. Cuevas; A. Hofer; P. Nitz; W.J. Platzer

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


401

Linear multistep methods for integrating reversible differential equations  

E-Print Network [OSTI]

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

Wyn Evans; Scott Tremaine

1999-06-24T23:59:59.000Z

402

A Cavity QED Implementation of Deutsch-Jozsa Algorithm  

E-Print Network [OSTI]

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

E. S. Guerra

2004-10-23T23:59:59.000Z

403

A preliminary evaluation of a speed threshold incident detection algorithm  

E-Print Network [OSTI]

detection algorithm. San Antonio's new traffic management center, TransGuide, uses a new speed based algorithm, The TXDOT (Texas Department of Transportation) Speed algorithm. This research compares the TXDOT Speed algorithm with California algorithm #8...

Kolb, Stephanie Lang

1996-01-01T23:59:59.000Z

404

Better Buildings Neighborhood Program: Run a Program  

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

Run a Program Run a Program Printable Version Share this resource Send a link to Better Buildings Neighborhood Program: Run a Program to someone by E-mail Share Better Buildings Neighborhood Program: Run a Program on Facebook Tweet about Better Buildings Neighborhood Program: Run a Program on Twitter Bookmark Better Buildings Neighborhood Program: Run a Program on Google Bookmark Better Buildings Neighborhood Program: Run a Program on Delicious Rank Better Buildings Neighborhood Program: Run a Program on Digg Find More places to share Better Buildings Neighborhood Program: Run a Program on AddThis.com... Getting Started Driving Demand Financing Workforce Development Run a Program Energy efficiency upgrade programs provide communities with many benefits. In addition to helping homeowners, businesses, and institutions save money

405

GPU programming for real-time watercolor simulation  

E-Print Network [OSTI]

, Moravanszky [11] presents detailed information about matrix representation and linear algebra operations, though in a more detailed and practical tutorial format. 17 CHAPTER III METHODS Structure of the watercolor program The watercolor simulation tool...

Scott, Jessica Stacy

2005-02-17T23:59:59.000Z

406

CHRG Programs  

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

Programs Programs Work Force Information Systems (WFIS): Acquisition Letter 2009-10, Displaced Worker Medical Benefit Program - Friday, July 10, 2009 Acquisition Letter 2009-10, which provides informaiton and guidance to Department of Energy (DOE) Contracting Officers pertaining to the DOE's Displaced Worker Medical Benefit Program (DWMBP) and similar benefits provided under the American Recovery and Reinvestment Act. read more ... Computer Account Registration Form - Tuesday, July 28, 2009 All computer users must complete this form whenever a change in multi-user system access is necessary. read more ... Computer Security Awareness Acknowledgement Form - Tuesday, July 28, 2009 Computer Security Rules of Behavior Office of Legacy Management read more ... Remote Access Procedures for Systems at Grand Junction - Monday, January 23, 2006

407

PROGRAM ABSTRACTS  

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

& DEVELOPMENT: & DEVELOPMENT: PROGRAM ABSTRACTS Energy Efficiency and Renewable Energy Office of Transportation Technologies Office of Advanced Automotive Technologies Catalyst Layer Bipolar Plate Electrode Backing Layers INTEGRATED SYSTEMS Polymer Electrolyte Membrane Fuel Cells Fuel Cell Stack

408

Program Summaries  

Office of Science (SC) Website

Program Summaries Program Summaries Basic Energy Sciences (BES) BES Home About Research Facilities Science Highlights Benefits of BES Funding Opportunities Basic Energy Sciences Advisory Committee (BESAC) News & Resources Program Summaries Brochures Reports Accomplishments Presentations BES and Congress Science for Energy Flow Seeing Matter Scale of Things Chart Contact Information Basic Energy Sciences U.S. Department of Energy SC-22/Germantown Building 1000 Independence Ave., SW Washington, DC 20585 P: (301) 903-3081 F: (301) 903-6594 E: sc.bes@science.doe.gov More Information » News & Resources Program Summaries Print Text Size: A A A RSS Feeds FeedbackShare Page Bes Summaries 2012 thumbnail JPG .jpg file (469KB) Basic Energy Sciences FY 2012 Research Summaries This report provides a collection of research abstracts and highlights for

409

Program Overview  

Broader source: Energy.gov [DOE]

The culture of the DOE community will be based on standards. Technical standards will formally integrate part of all DOE facility, program and project activities. The DOE will be recognized as a...

410

RERTR program  

SciTech Connect (OSTI)

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

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

1997-12-01T23:59:59.000Z

411

Audio Binary Halftone Watermarking Algorithm  

Science Journals Connector (OSTI)

Conventional audio watermarking method has the following deficiencies: the embedded watermarking signal bits are too less; the image watermarking pre-process is too simple which reduce the security; the embedded audio watermarking is meaningless binary sequence. To address these problems, we propose a robust audio watermarking algorithm based on audio binary halftone pre-process. The meaningful audio watermarking can be preprocessed to high-fidelity binary audio. The variable dimension operation is used to scramble the host audio. Experiments show the proposed algorithm has big embedding quantity, high security, strong practicability and robustness in enduring common attacks.

Huan Li; Zheng Qin; Xuanping Zhang; Xu Wang

2011-01-01T23:59:59.000Z

412

Linear Optics From Closed Orbits (LOCO): An Introduction  

SciTech Connect (OSTI)

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

Safranek, James; /SLAC

2009-06-18T23:59:59.000Z

413

Machinist Pipeline/Apprentice Program Program Description  

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

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

414

LINEAR COLLIDER PHYSICS RESOURCE BOOK FOR SNOWMASS 2001.  

SciTech Connect (OSTI)

The American particle physics community can look forward to a well-conceived and vital program of experimentation for the next ten years, using both colliders and fixed target beams to study a wide variety of pressing questions. Beyond 2010, these programs will be reaching the end of their expected lives. The CERN LHC will provide an experimental program of the first importance. But beyond the LHC, the American community needs a coherent plan. The Snowmass 2001 Workshop and the deliberations of the HEPAP subpanel offer a rare opportunity to engage the full community in planning our future for the next decade or more. A major accelerator project requires a decade from the beginning of an engineering design to the receipt of the first data. So it is now time to decide whether to begin a new accelerator project that will operate in the years soon after 2010. We believe that the world high-energy physics community needs such a project. With the great promise of discovery in physics at the next energy scale, and with the opportunity for the uncovering of profound insights, we cannot allow our field to contract to a single experimental program at a single laboratory in the world. We believe that an e{sup +}e{sup {minus}} linear collider is an excellent choice for the next major project in high-energy physics. Applying experimental techniques very different from those used at hadron colliders, an e{sup +}e{sup {minus}} linear collider will allow us to build on the discoveries made at the Tevatron and the LHC, and to add a level of precision and clarity that will be necessary to understand the physics of the next energy scale. It is not necessary to anticipate specific results from the hadron collider programs to argue for constructing an e{sup +}e{sup {minus}} linear collider; in any scenario that is now discussed, physics will benefit from the new information that e{sup +}e{sup {minus}} experiments can provide.

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

2001-05-03T23:59:59.000Z

415

International Workshop on Linear Colliders 2010  

ScienceCinema (OSTI)

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

None

2011-10-06T23:59:59.000Z

416

Linear degeneracy in the semiclassical atom  

Science Journals Connector (OSTI)

If the angular and radial quantum numbers of states with the same binding energy satisfy a linear relation, as is the situation in the Coulomb potential, the spectrum is said to be linearly degenerate. We present a detailed study of the consequences of such linear degeneracy in atomic potentials. One of the results is a new, and more general, derivation of Scotts correction to the Thomas-Fermi energy.

Berthold-Georg Englert and Julian Schwinger

1985-07-01T23:59:59.000Z

417

Characteristics of Strong Programs  

Broader source: Energy.gov [DOE]

Existing financing programs offer a number of important lessons on effective program design. Some characteristics of strong financing programs drawn from past program experience are described below.

418

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

419

Linear PM Generator for Wave Energy Conversion.  

E-Print Network [OSTI]

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

Parthasarathy, Rajkumar

2012-01-01T23:59:59.000Z

420

Ultra-high vacuum photoelectron linear accelerator  

DOE Patents [OSTI]

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

Yu, David U.L.; Luo, Yan

2013-07-16T23:59:59.000Z

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

Huge market forecast for linear LDPE  

Science Journals Connector (OSTI)

Huge market forecast for linear LDPE ... It now appears that the success of the new technology, which rests largely on energy and equipment cost savings, could be overwhelming. ...

1980-08-25T23:59:59.000Z

422

LED Replacements for Linear Fluorescent Lamps Webcast  

Broader source: Energy.gov [DOE]

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

423

Optimization Online - Accelerated Linearized Bregman Method  

E-Print Network [OSTI]

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

Bo Huang

2011-06-27T23:59:59.000Z

424

The Linear Engine Pathway of Transformation  

Broader source: Energy.gov [DOE]

This poster highlights the major milestones in the history of the linear engine in terms of technological advances, novel designs, and economic/social impact.

425

Linear conic optimization for nonlinear optimal control  

E-Print Network [OSTI]

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

2014-07-07T23:59:59.000Z

426

The computational physics program of the National MFE Computer Center  

SciTech Connect (OSTI)

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 generation of supercomputers. The computational physics group is 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 compact toroids. Another major 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 are being examined. 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.

Mirin, A.A.

1988-01-01T23:59:59.000Z

427

NREL: Education Programs - Teacher Programs  

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

Teacher Programs Teacher Programs Photo of a man and woman working together in a laboratory. They are both wearing safety glasses as they look at a small white box the man is holding. NREL promotes excellence in teaching and learning and contributes to improving critical elements of the science, mathematics, and technology education system. Teachers are offered research and development opportunities to enhance their content knowledge, instructional strategies, and leadership abilities. Visiting Faculty Program (VFP) Visiting Faculty Program (VFP), formerly called Faculty and Student Teams (FaST), seeks to increase the research competitiveness of faculty members and their students at institutions historically underrepresented in the research community in order to expand the workforce vital to the Department

428

GEET DUGGAL Algorithms for Determining  

E-Print Network [OSTI]

Relationship to Gene Regulation Final Public Oral Examination Doctor of Philosophy Recent genome sequencing. Analyses from them have shown that the 3D structure of DNA may be closely linked to genome functions structure of DNA and genome function on the scale of the whole genome. Specifically, we designed algorithms

429

CIPRES: Algorithmic Challenges Bernard Moret  

E-Print Network [OSTI]

CIPRES: Algorithmic Challenges Bernard Moret University of New Mexico Phylogenetic Reconstruction difference in the two sets of induced bipartitions. � RF distance treats all bipartitions equally in most settings. � Maximum likelihood (ML): maximize probability that the data could have been produced

Moret, Bernard

430

5 Hyperspectral Data Processing Algorithms  

E-Print Network [OSTI]

121 5 Hyperspectral Data Processing Algorithms Antonio Plaza, Javier Plaza, Gabriel Martín), able to cover the wavelength region from 400 to 2500nm using more than 200 spec- tral channels. The special characteristics of hyperspectral data sets pose different processing problems [3], which must

Plaza, Antonio J.

431

Fixed Parameter Algorithms Dniel Marx  

E-Print Network [OSTI]

complexity Problem: VERTEX COVER INDEPENDENT SET Input: Graph G, integer k Graph G, integer k Question-complete NP-complete Fixed Parameter Algorithms ­ p.3/40 #12;Parameterized complexity Problem: VERTEX COVER INDEPENDENT SET Input: Graph G, integer k Graph G, integer k Question: Is it possible to cover the edges

Narasayya, Vivek

432

Parrondo Games and Quantum Algorithms  

E-Print Network [OSTI]

We pursue the possible connections between classical games and quantum computation. The Parrondo game is one in which a random combination of two losing games produces a winning game. We introduce novel realizations of this Parrondo effect in which the player can `win' via random reflections and rotations of the state-vector, and connect these to known quantum algorithms.

Chiu Fan Lee; Neil Johnson

2002-03-10T23:59:59.000Z

433

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

E-Print Network [OSTI]

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

A. Shabani; D. A. Lidar

2009-02-14T23:59:59.000Z

434

Stabilising the triple inverted pendulum by variable gain linear quadratic regulator  

Science Journals Connector (OSTI)

A variable gain linear quadratic regulator (VGLQR) for multivariable non-linear control systems is designed. This control scheme, which can be viewed as a novel gain scheduling controller, consists of linearising the non-linear system to a family of time-invariant systems about sampling points and using LQR method to obtain optimal feedback gain in every sampling interval. In addition, a fast algorithm based on Schur method for online solving the algebraic Riccati equation is discussed in detail, and a software package, which is used to solve algebraic Riccati equation at each sampling point, is developed during the present research. A triple inverted pendulum is stabilised by using the VGLQR method and the results of simulation and physical experiments are displayed. The results of experiments demonstrate that the present control scheme is of good stability and robustness.

Yongli Zhang; Zhihong Miao; Hongxing Li; Fuzhong Nian

2012-01-01T23:59:59.000Z

435

15.053 Optimization Methods in Management Science, Spring 2007  

E-Print Network [OSTI]

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

Mamani, Hamed

436

Why is Boris algorithm so good?  

SciTech Connect (OSTI)

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

Qin, Hong [Department of Modern Physics and Collaborative Innovation Center for Advanced Fusion Energy and Plasma Sciences, University of Science and Technology of China, Hefei, Anhui 230026 (China) [Department of Modern Physics and Collaborative Innovation Center for Advanced Fusion Energy and Plasma Sciences, University of Science and Technology of China, Hefei, Anhui 230026 (China); Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543 (United States); Zhang, Shuangxi; Xiao, Jianyuan; Liu, Jian [Department of Modern Physics and Collaborative Innovation Center for Advanced Fusion Energy and Plasma Sciences, University of Science and Technology of China, Hefei, Anhui 230026 (China)] [Department of Modern Physics and Collaborative Innovation Center for Advanced Fusion Energy and Plasma Sciences, University of Science and Technology of China, Hefei, Anhui 230026 (China); Sun, Yajuan [LSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, P.O. Box 2719, Beijing 100190 (China)] [LSEC, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, P.O. Box 2719, Beijing 100190 (China); Tang, William M. [Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543 (United States)] [Plasma Physics Laboratory, Princeton University, Princeton, New Jersey 08543 (United States)

2013-08-15T23:59:59.000Z

437

Why is Boris Algorithm So Good?  

SciTech Connect (OSTI)

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

438

Efficiency United (Gas) - Residential Efficiency Program | Department of  

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

Efficiency United (Gas) - Residential Efficiency Program Efficiency United (Gas) - Residential Efficiency Program Efficiency United (Gas) - Residential Efficiency Program < Back Eligibility Low-Income Residential Multi-Family Residential Residential Savings Category Heating & Cooling Commercial Heating & Cooling Heating Home Weatherization Commercial Weatherization Sealing Your Home Appliances & Electronics Construction Design & Remodeling Other Ventilation Manufacturing Water Heating Windows, Doors, & Skylights Maximum Rebate Weatherization Measures: 50% of the cost Windows: $150 Water Heaters/Clothes Washers: 1 Pipe Wrap: Limit of 10 linear ft. Faucet Aerators: 2 High Efficiency Shower Head: 2 Program Info State Michigan Program Type Utility Rebate Program Rebate Amount Boiler: $200 Furnace: $100 - $200

439

Federal Energy Management Program: Energy Incentive Programs  

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

Energy Incentive Energy Incentive Programs to someone by E-mail Share Federal Energy Management Program: Energy Incentive Programs on Facebook Tweet about Federal Energy Management Program: Energy Incentive Programs on Twitter Bookmark Federal Energy Management Program: Energy Incentive Programs on Google Bookmark Federal Energy Management Program: Energy Incentive Programs on Delicious Rank Federal Energy Management Program: Energy Incentive Programs on Digg Find More places to share Federal Energy Management Program: Energy Incentive Programs on AddThis.com... Energy Savings Performance Contracts ENABLE Utility Energy Service Contracts On-Site Renewable Power Purchase Agreements Energy Incentive Programs Recovery Act Energy Incentive Programs Most states offer energy incentive programs to help offset energy costs.

440

ARRA Program Summary: Energy Smart Jobs Program  

E-Print Network [OSTI]

ARRA Program Summary: Energy Smart Jobs Program Statewide Program (Initially targeting urban Description: The Program focuses on both job creation and energy efficiency. Just over one third, utilities and customers to ensure both job creation and energy efficiency opportunities continue

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

Daylighting simulation: methods, algorithms, and resources  

SciTech Connect (OSTI)

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

Carroll, William L.

1999-12-01T23:59:59.000Z

442

CANCER PROGRAM ANNUAL REPORT CANCER PROGRAM  

E-Print Network [OSTI]

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

Illinois at Chicago, University of

443

SCIENCE Program  

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

SCIENCE Program SCIENCE Program early science program Early at the Argonne Leadership Computing Facility CONTACT  Argonne Leadership Computing Facility | www.alcf.anl.gov | (877) 737-8615 Climate-Weather Modeling Studies Using a Prototype Global Cloud-System Resolving Model PI: Venkatramani Balaji Geophysical Fluid Dynamics Laboratory Award: 150 Million Hours Materials Design and Discovery: Catalysis and Energy Storage PI: Larry Curtiss Argonne National Laboratory Award: 50 Million Hours Direct Numerical Simulation of Autoignition in a Jet in a Cross-Flow PI: Christos Frouzakis Swiss Federal Institute of Technology Award: 150 Million Hours High-Accuracy Predictions of the Bulk Properties of Water PI: Mark Gordon Iowa State University Award: 150 Million Hours Cosmic Structure Probes

444

Educational Programs  

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

Program Program The program of the school focuses on the following areas: The fundamentals of the interaction of X-rays and neutrons with matter X-ray and neutron production and experimental instrumentation Theory and practical application of various X-ray and neutron experimental techniques Hands on experience gained through experiments at the Advanced Photon Source (APS), Spallation Neutron Source (SNS), and High Flux Isotope Reactor (HFIR). Lectures are given by prominent scientists drawn from universities, several national laboratories, and industry. Subjects for lectures include: Interactions of X-rays and Neutrons with Matter Neutron Generation and Detection Neutron Instrumentation X-ray Generation and Detection X-ray Instrumentation Single-Crystal and Surface Diffraction

445

Oscillation Detection Algorithm Development Summary Report and Test Plan  

SciTech Connect (OSTI)

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

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

2009-10-03T23:59:59.000Z

446

Voltage regulation in linear induction accelerators  

DOE Patents [OSTI]

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

Parsons, William M. (Santa Fe, NM)

1992-01-01T23:59:59.000Z

447

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

448

NONEQUILIBRIUM LINEAR BEHAVIOR OF BIOLOGICAL SYSTEMS  

E-Print Network [OSTI]

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

Stanley, H. Eugene

449

Soft materials for linear electromechanical energy conversion  

E-Print Network [OSTI]

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

Antal Jakli; Nandor Eber

2014-07-29T23:59:59.000Z

450

Non-linear wave equations Hans Ringstrom  

E-Print Network [OSTI]

105 3. Power type non-linearities 108 4. Global existence for small data 109 5. Observations the Maxwell vacuum equations for an electric and magnetic potential also yields wave equations. In order differential equations (PDE:s) is quite big. The linear theory is based on the fact that by adding two

Ringström, Hans

451

Non-linear wave equations Hans Ringstrom  

E-Print Network [OSTI]

105 3. Power type non-linearities 108 4. Global existence for small data 109 5. Observations boundary conditions. Formulating the Maxwell vacuum equations for an electric and magnetic potential also di#11;erential equations (PDE:s) is quite big. The linear theory is based on the fact that by adding

Ringström, Hans

452

Limma: Linear Models for Microarray Data  

E-Print Network [OSTI]

397 23 Limma: Linear Models for Microarray Data Gordon K. Smyth Abstract A survey is given correction and control spots in conjunction with linear modelling is illustrated on the 7 data. 23.1 Introduction Limma1 is a package for differential expression analysis of data arising from microarray

Smyth, Gordon K.

453

Hybrid and optical implementation of the Deutsch-Jozsa algorithm  

E-Print Network [OSTI]

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

Luis A. Garcia; Jagdish R. Luthra

2009-12-31T23:59:59.000Z

454

Time parallelization of plasma simulations using the parareal algorithm  

SciTech Connect (OSTI)

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

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

2011-01-01T23:59:59.000Z

455

Program Description  

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

Program Description Program Description Discover E (Engineering) is an evening of interesting, interactive and fun engineering, science, math, and technology demonstrations for K-12 students and their parents or guardians. It is held in conjunction with National Engineers Week which is celebrated at the time of George Washington's birthday, our nation's first President, who was a military engineer and land surveyor. Activities include 30-50 interactive demonstrations of basic engineering, science, technology and math principles that may include robots, reverse engineering, casting, crystal structures, forensic science, the effects of liquid nitrogen, slide rule, sound waves, electrostatics, mechanics, materials properties and materials

456

Sequestration Program  

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

NETL's NETL's Carbon Capture and Sequestration Program Advances of Multi-pollutant and CO 2 Control Technologies Chicago, IL April 30, 2007 Timothy Fout Project Manager National Energy Technology Laboratory T. Fout, Apr. 2007 Outline for Presentation * NETL Overview * The Issue * The Solutions * What is Carbon Capture and Storage (CCS) * DOE's Sequestration Program Structure * CO 2 Capture Research Projects T. Fout, Apr. 2007 National Energy Technology Laboratory * Only DOE national lab dedicated to fossil energy - Fossil fuels provide 85% of U.S. energy supply * One lab, five locations, one management structure * 1,100 Federal and support-contractor employees * Research spans fundamental science to technology demonstrations West Virginia

457

Implementing wide baseline matching algorithms on a graphics processing unit.  

SciTech Connect (OSTI)

Wide baseline matching is the state of the art for object recognition and image registration problems in computer vision. Though effective, the computational expense of these algorithms limits their application to many real-world problems. The performance of wide baseline matching algorithms may be improved by using a graphical processing unit as a fast multithreaded co-processor. In this paper, we present an implementation of the difference of Gaussian feature extractor, based on the CUDA system of GPU programming developed by NVIDIA, and implemented on their hardware. For a 2000x2000 pixel image, the GPU-based method executes nearly thirteen times faster than a comparable CPU-based method, with no significant loss of accuracy.

Rothganger, Fredrick H.; Larson, Kurt W.; Gonzales, Antonio Ignacio; Myers, Daniel S.

2007-10-01T23:59:59.000Z

458

Rigorous Design of Complex Distillation Columns Using Process Simulators and the Particle Swarm Optimization Algorithm  

Science Journals Connector (OSTI)

Rigorous Design of Complex Distillation Columns Using Process Simulators and the Particle Swarm Optimization Algorithm ... Many free-derivative search algorithms are population-based procedures, where an individual represents a particular solution to the optimization problem and a population is a set of individuals competing with each other with respect to their objective function values. ... The initial NLP sub-problems, that provide linearizations for all the terms in the disjunctions, are selected through a set-covering problem for which both the cases of disjunctive and conjunctive normal form logic are considered. ...

J. Javaloyes-Antn; R. Ruiz-Femenia; J. A. Caballero

2013-09-26T23:59:59.000Z

459

Algorithm for calculation of characterisitcs of thermionic electricity-generating assemblies  

SciTech Connect (OSTI)

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

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

1981-01-01T23:59:59.000Z

460

An optimal filtering algorithm for table constraints  

Science Journals Connector (OSTI)

Filtering algorithms for table constraints are constraint-based, which means that the propagation queue only contains information on the constraints that must be reconsidered. This paper proposes four efficient value-based algorithms for table constraints, ...

Jean-Baptiste Mairy; Pascal Van Hentenryck; Yves Deville

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


461

The IMAGETCL multimedia algorithm development system  

Science Journals Connector (OSTI)

The IMAGETCL multimedia development system is a new Tcl/Tk-based development environment specifically targeting development of high-performance multimedia data analysis algorithms. Multimedia algorithm development is complicated by large volumes of data, ...

Charles B. Owen

1997-07-01T23:59:59.000Z

462

Residential Buildings Integration Program  

Broader source: Energy.gov [DOE]

Residential Buildings Integration Program Presentation for the 2013 Building Technologies Office's Program Peer Review

463

Maryland Efficiency Program Options  

Broader source: Energy.gov [DOE]

Maryland Efficiency Program Options, from the Tool Kit Framework: Small Town University Energy Program (STEP).

464

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

465

Repetitions in strings: algorithms and combinatorics  

E-Print Network [OSTI]

is that stuttering is likely to slow down any string-matching algorithm. The analysis of periods is even more

Paris-Sud XI, Université de

466

Limit theorems for stochastic approximation algorithms  

E-Print Network [OSTI]

We prove a central limit theorem applicable to one dimensional stochastic approximation algorithms that converge to a point where the error terms of the algorithm do not vanish. We show how this applies to a certain class of these algorithms that in particular covers a generalized P\\'olya urn model, which is also discussed. In addition, we show how to scale these algorithms in some cases where we cannot determine the limiting distribution but expect it to be non-normal.

Renlund, Henrik

2011-01-01T23:59:59.000Z

467

Gordon Research Conferences: Program for 1969  

Science Journals Connector (OSTI)

...Haubach, "Thermal diffusion research...scattering from thermal fluctuations of...20 August. Non-linear programming...search theory to large scale operations...Stuidies of hydro-thermal deposits"; B...Heights College Plasma Physics Burton...vice chairman. Atmospheric Aerosols 30 Jutne-4...

Alexander M. Cruickshank

1969-03-07T23:59:59.000Z

468

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

E-Print Network [OSTI]

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

Carrell, Jim

469

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

E-Print Network [OSTI]

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

Clarke, Edmund M.

470

RESEARCHCONTRIBUTIONS Programming  

E-Print Network [OSTI]

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

Atkinson, Mike

471

Automated Architectural Exploration for Signal Processing Algorithms  

E-Print Network [OSTI]

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

Davis, Rhett

472

Presenting Data from Experiments in Algorithmics  

E-Print Network [OSTI]

Presenting Data from Experiments in Algorithmics Peter Sanders 1? Max�Planck�Institut f�ur Informatik Saarbr�ucken, Germany sanders@mpi�sb.mpg.de Abstract. Algorithmic experiments yield large amounts tools such as gnuplot 1 . 1 Introduction A paper in experimental algorithmics will often start

Sanders, Peter

473

An efficient algorithm for minimumweight bibranching  

E-Print Network [OSTI]

that the following algorithm finds a minimum car­ dinality bibranching in a digraph: determine a minimum edge cover]. Presently, an O(m+n log n)­algorithm is known (cf. [5]). The minimum­weight edge cover problem canAn efficient algorithm for minimum­weight bibranching J. Keijsper and R. Pendavingh Faculteit der

Keijsper, Judith

474

DYNAMIC ALGORITHMS FOR THE DYCK LANGUAGES  

E-Print Network [OSTI]

DYNAMIC ALGORITHMS FOR THE DYCK LANGUAGES GUDMUND SKOVBJERG FRANDSEN, THORE HUSFELDT, PETER BRO the Dy­ namic Word problem for the free group. We present deterministic algorithms and data structures Las Vegas­ and Monte Carlo­type randomised algorithms to achieve better running times, and present

Miltersen, Peter Bro

475

Introduction to Algorithms May 29, 2014  

E-Print Network [OSTI]

· Greedy approximation algorithm: ­ at each step, pick set covering largest number of remaining uncovered items Theorem: greedy set cover algorithm achieves an approximation ratio of (ln m + 1) May 29, 2014 CS38 Lecture 18 6 #12;5/29/2014 2 Set cover Theorem: greedy set cover algorithm achieves

Umans, Chris

476

Using Cycles and Scaling Parallel Algorithms  

E-Print Network [OSTI]

graph by finding a max­ imal set of edge­disjoint cycles. We give a parallel algorithm to find the first efficient parallel algorithm for finding an approximation to a min­ imum cycle cover. Our algorithm finds a cycle cover whose size is within a factor of O(1 + n log n m+n ) of the minimum sized

Yang, Junfeng

477

Distributed algorithms for edge dominating sets  

E-Print Network [OSTI]

Distributed algorithms for edge dominating sets Jukka Suomela Helsinki Institute for Information problem · Simple 2-approximation algorithm: find any maximal matching 5 #12;Edge dominating sets · NP dominating sets · using deterministic distributed algorithms, in the port-numbering model · But why would we

Suomela, Jukka

478

Mechanical Verification of Clock Synchronization Algorithms ?  

E-Print Network [OSTI]

functions, in addition to averaging algorithms. The generic theory is presented as a set of param­ eterizedMechanical Verification of Clock Synchronization Algorithms ? D. Schwier and F. von Henke schwier,vhenke@informatik.uni­ulm.de Universit¨at Ulm, Fakult¨at f¨ur Informatik, D­89069 Ulm, Germany Abstract. Clock synchronization algorithms

Biundo, Susanne

479

An Analysis of Algorithms Laboratory Utilizing the  

E-Print Network [OSTI]

An Analysis of Algorithms Laboratory Utilizing the Maximum Segment Sum Problem Robert Mc a laboratory/homework exercise, appropriate for the traditional CS 2 or Data Structures & Algorithms course (CS 7) [1], that gives students practice in analyzing algorithms to determine their asymptotic run­ ning

McCloskey, Robert

480

CMPSCI 791N: Algorithms for Communication  

E-Print Network [OSTI]

: traditional algorithms. ffl Inputs: -- Multinode network (graph). -- Set of packets specified by: \\LambdaCMPSCI 791N: Algorithms for Communication Networks Seminar for Fall 1999 Instructor: Micah Adler of seminar: ffl To learn about networking research conducted in the algorithms community. ffl To explore

Adler, Micah

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 Design and Analysis of Algorithms  

E-Print Network [OSTI]

serves a dual purpose: to cover core material in algorithms for graduate students in computer scienceThe Design and Analysis of Algorithms Dexter C. Kozen Cornell University December 1990 c Copyright in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At rst I

Kozen, Dexter

482

The Weak Aggregating Algorithm and Weak Mixability  

E-Print Network [OSTI]

of the Weak Aggregating Algorithm that covers unbounded games is also described. #12; CONTENTS 2 Contents 1The Weak Aggregating Algorithm and Weak Mixability Yuri Kalnishkan Michael V. Vyugin 1 fyura the Weak Aggregating Algorithm that allows us to obtain additive terms of the form C p n. A modification

Kalnishkan, Yuri

483

Proceedings from Workshop on Experimental Algorithmics  

E-Print Network [OSTI]

Proceedings from Workshop on Experimental Algorithmics ALCOM­FT Deliverable D4 Rolf Fagerberg BRICS on Experimental Algorithmics held at Schlo? Dagstuhl, Wadern, Germany. The workshop took place in the period, to start establishing a methodology of experimental algorithmics by discussing problems like . What

Brodal, Gerth Stølting

484

Proceedings from Workshop on Experimental Algorithmics  

E-Print Network [OSTI]

Proceedings from Workshop on Experimental Algorithmics ALCOM-FT Deliverable D4 Rolf Fagerberg BRICS on Experimental Algorithmics held at Schlo? Dagstuhl, Wadern, Germany. The workshop took place in the period, to start establishing a methodology of experimental algorithmics by discussing problems like · What

Brodal, Gerth Stølting

485

Lattice Completion Algorithms for Distributed Computations  

E-Print Network [OSTI]

Lattice Completion Algorithms for Distributed Computations Vijay K. Garg Parallel and Distributed is usually modeled as a finite par- tially ordered set (poset) of events. Many operations on this poset new algorithms to construct or enumerate the lattice of normal cuts. Our algorithms are designed

Garg, Vijay

486

Fast algorithms for triangular Josephson junction arrays  

SciTech Connect (OSTI)

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

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

1997-04-01T23:59:59.000Z

487

Deutsch Algorithm on Classical Circuits  

E-Print Network [OSTI]

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

Osman Kaan Erol

2008-03-21T23:59:59.000Z

488

Near Optimal Online Algorithms and Fast Approximation Algorithms for Resource Allocation Problems  

E-Print Network [OSTI]

algorithm to solve very large LPs with both packing and covering constraints. We give algo- rithms to the ratio described for the online setting. We discuss several applications, and how our algorithms improve Algorithms, Economics, Theory Keywords Online algorithms, Stochastic input, Packing-Covering 1. INTRODUCTION

Sandholm, Tuomas W.

489

Optimization of biochemical systems through mathematical programming: Methods and applications  

Science Journals Connector (OSTI)

In this work we present a general (mono and multiobjective) optimization framework for the technological improvement of biochemical systems. The starting point of the method is a mathematical model in ordinary differential equations (ODEs) of the investigated ... Keywords: Biochemical systems, Generalized mass action, Geometric programming, Linear programming, Multiobjective optimization, Power-law formalism, S-systems

Julio Vera; Carlos Gonzlez-Alcn; Alberto Marn-Sanguino; Nstor Torres

2010-08-01T23:59:59.000Z

490

Approximation Algorithms for Covering Problems  

E-Print Network [OSTI]

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

Koufogiannakis, Christos

2009-01-01T23:59:59.000Z

491

Linear Collider Collaboration Tech Notes LCC-0104  

Broader source: All U.S. Department of Energy (DOE) Office Webpages (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

492

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

493

Linear chain tensioning of moored production vessels  

SciTech Connect (OSTI)

Part 1 of this two-part series discussed the worldwide floating production vessel (FPV) market and evolution of the linear puller concept. The three principal types of chain jack systems - hollow ram, single and twin cylinders - were introduced. And advantages of this relatively new form of passive mooring were outlined. This concluding article covers applications of linear chain pullers on various vessels, including use on an example 35,000-t North Sea semi-submersible. Chain wear and how linear pullers avoid wear associated with windlass-type systems are discussed, along with the optimization possible through use of a swiveling chain fair-lead latch (SCFL).

Peters, B. (Bardex Corp., London (United Kingdom))

1993-06-01T23:59:59.000Z

494

A Practical Access to the Theory of Parallel Algorithms Christoph Kessler  

E-Print Network [OSTI]

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

Kessler, Christoph

495

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

E-Print Network [OSTI]

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

California at Davis, University of

496

Parallelism Extraction Algorithm from Stream-Based Processing Flow Applying Spanning Tree  

Science Journals Connector (OSTI)

Manycore architecture promotes a massively parallel computing on the accelerators. Especially GPU is one of the main series of the high performance computing, which is also employed by top supercomputers in the world. The programming method on such accelerators ... Keywords: High Performance Computing, Stream Computing, GPUs, Caravela, Spanning Tree Algorithm

Guyue Wang, Shinichi Yamagiwa, Koichi Wada

2014-05-01T23:59:59.000Z

497

Polynomial time algorithms for constant capacitated single-item lot sizing problem with stepwise production cost  

E-Print Network [OSTI]

production cost Ayse Akbalik , Christophe Rapine LGIPM, Université de Lorraine, Ile du Saulcy, 57045 Metz. Assuming constant production capacity, constant batch size and Wagner- Whitin cost structure, we derive O sizing problem, stepwise costs, polynomial time algorithm, dynamic programming. 1. Introduction We study

Paris-Sud XI, Université de

498

An object-oriented framework for simulation-based green building design optimization with genetic algorithms  

Science Journals Connector (OSTI)

Simulation-based optimization can assist green building design by overcoming the drawbacks of trial-and-error with simulation alone. This paper presents an object-oriented framework that addresses many particular characteristics of green building design ... Keywords: Genetic algorithm, Green building, Object-oriented framework, Optimization, Simulation programs, Sustainable development

Weimin Wang; Hugues Rivard; Radu Zmeureanu

2005-01-01T23:59:59.000Z

499

Maximum Utility Product Pricing Models and Algorithms Based on Reservation Prices  

E-Print Network [OSTI]

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

Tunçel, Levent

500

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

E-Print Network [OSTI]

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

California at Davis, University of